---
_id: '1625'
abstract:
- lang: eng
text: In recent years we have seen numerous improvements on 3D scanning and tracking
of human faces, greatly advancing the creation of digital doubles for film and
video games. However, despite the high-resolution quality of the reconstruction
approaches available, current methods are unable to capture one of the most important
regions of the face - the eye region. In this work we present the first method
for detailed spatio-temporal reconstruction of eyelids. Tracking and reconstructing
eyelids is extremely challenging, as this region exhibits very complex and unique
skin deformation where skin is folded under while opening the eye. Furthermore,
eyelids are often only partially visible and obstructed due to selfocclusion and
eyelashes. Our approach is to combine a geometric deformation model with image
data, leveraging multi-view stereo, optical flow, contour tracking and wrinkle
detection from local skin appearance. Our deformation model serves as a prior
that enables reconstruction of eyelids even under strong self-occlusions caused
by rolling and folding skin as the eye opens and closes. The output is a person-specific,
time-varying eyelid reconstruction with anatomically plausible deformations. Our
high-resolution detailed eyelids couple naturally with current facial performance
capture approaches. As a result, our method can largely increase the fidelity
of facial capture and the creation of digital doubles.
article_number: '44'
author:
- first_name: Amit
full_name: Bermano, Amit
last_name: Bermano
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
- first_name: Yeara
full_name: Kozlov, Yeara
last_name: Kozlov
- first_name: Derek
full_name: Bradley, Derek
last_name: Bradley
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Markus
full_name: Gross, Markus
last_name: Gross
citation:
ama: 'Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. Detailed spatio-temporal
reconstruction of eyelids. In: Vol 34. ACM; 2015. doi:10.1145/2766924'
apa: 'Bermano, A., Beeler, T., Kozlov, Y., Bradley, D., Bickel, B., & Gross,
M. (2015). Detailed spatio-temporal reconstruction of eyelids (Vol. 34). Presented
at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques,
Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766924'
chicago: Bermano, Amit, Thabo Beeler, Yeara Kozlov, Derek Bradley, Bernd Bickel,
and Markus Gross. “Detailed Spatio-Temporal Reconstruction of Eyelids,” Vol. 34.
ACM, 2015. https://doi.org/10.1145/2766924.
ieee: 'A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, and M. Gross, “Detailed
spatio-temporal reconstruction of eyelids,” presented at the SIGGRAPH: Special
Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA,
United States, 2015, vol. 34, no. 4.'
ista: 'Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. 2015. Detailed
spatio-temporal reconstruction of eyelids. SIGGRAPH: Special Interest Group on
Computer Graphics and Interactive Techniques vol. 34, 44.'
mla: Bermano, Amit, et al. Detailed Spatio-Temporal Reconstruction of Eyelids.
Vol. 34, no. 4, 44, ACM, 2015, doi:10.1145/2766924.
short: A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, M. Gross, in:, ACM,
2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:06Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2021-01-12T06:52:05Z
day: '27'
department:
- _id: BeBi
doi: 10.1145/2766924
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
publication_status: published
publisher: ACM
publist_id: '5535'
quality_controlled: '1'
scopus_import: 1
status: public
title: Detailed spatio-temporal reconstruction of eyelids
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1626'
abstract:
- lang: eng
text: This paper introduces "OmniAD," a novel data-driven pipeline to
model and acquire the aerodynamics of three-dimensional rigid objects. Traditionally,
aerodynamics are examined through elaborate wind tunnel experiments or expensive
fluid dynamics computations, and are only measured for a small number of discrete
wind directions. OmniAD allows the evaluation of aerodynamic forces, such as drag
and lift, for any incoming wind direction using a novel representation based on
spherical harmonics. Our datadriven technique acquires the aerodynamic properties
of an object simply by capturing its falling motion using a single camera. Once
model parameters are estimated, OmniAD enables realistic realtime simulation of
rigid bodies, such as the tumbling and gliding of leaves, without simulating the
surrounding air. In addition, we propose an intuitive user interface based on
OmniAD to interactively design three-dimensional kites that actually fly. Various
nontraditional kites were designed to demonstrate the physical validity of our
model.
alternative_title:
- ACM Transactions on Graphics
article_number: '113'
author:
- first_name: Tobias
full_name: Martin, Tobias
last_name: Martin
- first_name: Nobuyuki
full_name: Umetani, Nobuyuki
last_name: Umetani
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
citation:
ama: 'Martin T, Umetani N, Bickel B. OmniAD: Data-driven omni-directional aerodynamics.
In: Vol 34. ACM; 2015. doi:10.1145/2766919'
apa: 'Martin, T., Umetani, N., & Bickel, B. (2015). OmniAD: Data-driven omni-directional
aerodynamics (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer
Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766919'
chicago: 'Martin, Tobias, Nobuyuki Umetani, and Bernd Bickel. “OmniAD: Data-Driven
Omni-Directional Aerodynamics,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766919.'
ieee: 'T. Martin, N. Umetani, and B. Bickel, “OmniAD: Data-driven omni-directional
aerodynamics,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics
and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no.
4.'
ista: 'Martin T, Umetani N, Bickel B. 2015. OmniAD: Data-driven omni-directional
aerodynamics. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, ACM Transactions on Graphics, vol. 34, 113.'
mla: 'Martin, Tobias, et al. OmniAD: Data-Driven Omni-Directional Aerodynamics.
Vol. 34, no. 4, 113, ACM, 2015, doi:10.1145/2766919.'
short: T. Martin, N. Umetani, B. Bickel, in:, ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:06Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2021-01-12T06:52:05Z
day: '27'
department:
- _id: BeBi
doi: 10.1145/2766919
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
publication_status: published
publisher: ACM
publist_id: '5532'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'OmniAD: Data-driven omni-directional aerodynamics'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1628'
abstract:
- lang: eng
text: We propose a method for fabricating deformable objects with spatially varying
elasticity using 3D printing. Using a single, relatively stiff printer material,
our method designs an assembly of smallscale microstructures that have the effect
of a softer material at the object scale, with properties depending on the microstructure
used in each part of the object. We build on work in the area of metamaterials,
using numerical optimization to design tiled microstructures with desired properties,
but with the key difference that our method designs families of related structures
that can be interpolated to smoothly vary the material properties over a wide
range. To create an object with spatially varying elastic properties, we tile
the object's interior with microstructures drawn from these families, generating
a different microstructure for each cell using an efficient algorithm to select
compatible structures for neighboring cells. We show results computed for both
2D and 3D objects, validating several 2D and 3D printed structures using standard
material tests as well as demonstrating various example applications.
article_number: '136'
article_processing_charge: No
author:
- first_name: Christian
full_name: Schumacher, Christian
last_name: Schumacher
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Jan
full_name: Rys, Jan
last_name: Rys
- first_name: Steve
full_name: Marschner, Steve
last_name: Marschner
- first_name: Chiara
full_name: Daraio, Chiara
last_name: Daraio
- first_name: Markus
full_name: Gross, Markus
last_name: Gross
citation:
ama: 'Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. Microstructures
to control elasticity in 3D printing. In: Vol 34. ACM; 2015. doi:10.1145/2766926'
apa: 'Schumacher, C., Bickel, B., Rys, J., Marschner, S., Daraio, C., & Gross,
M. (2015). Microstructures to control elasticity in 3D printing (Vol. 34). Presented
at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques,
Los Angeles, CA, USA: ACM. https://doi.org/10.1145/2766926'
chicago: Schumacher, Christian, Bernd Bickel, Jan Rys, Steve Marschner, Chiara Daraio,
and Markus Gross. “Microstructures to Control Elasticity in 3D Printing,” Vol.
34. ACM, 2015. https://doi.org/10.1145/2766926.
ieee: 'C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, and M. Gross,
“Microstructures to control elasticity in 3D printing,” presented at the SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles,
CA, USA, 2015, vol. 34, no. 4.'
ista: 'Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. 2015. Microstructures
to control elasticity in 3D printing. SIGGRAPH: Special Interest Group on Computer
Graphics and Interactive Techniques vol. 34, 136.'
mla: Schumacher, Christian, et al. Microstructures to Control Elasticity in 3D
Printing. Vol. 34, no. 4, 136, ACM, 2015, doi:10.1145/2766926.
short: C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, M. Gross, in:,
ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, USA
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:07Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:06Z
day: '01'
department:
- _id: BeBi
doi: 10.1145/2766926
intvolume: ' 34'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/2766926
month: '08'
oa: 1
oa_version: Published Version
publication_status: published
publisher: ACM
publist_id: '5529'
quality_controlled: '1'
scopus_import: 1
status: public
title: Microstructures to control elasticity in 3D printing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1627'
abstract:
- lang: eng
text: We present a computational tool for fabrication-oriented design of flexible
rod meshes. Given a deformable surface and a set of deformed poses as input, our
method automatically computes a printable rod mesh that, once manufactured, closely
matches the input poses under the same boundary conditions. The core of our method
is formed by an optimization scheme that adjusts the cross-sectional profiles
of the rods and their rest centerline in order to best approximate the target
deformations. This approach allows us to locally control the bending and stretching
resistance of the surface with a single material, yielding high design flexibility
and low fabrication cost.
acknowledgement: This work was supported in part by grants from the Spanish Ministry
of Economy (TIN2012-35840), and the European Research Council (ERC Starting Grant
no. 280135 Animetrics).
article_number: '138'
author:
- first_name: Jesús
full_name: Pérez, Jesús
last_name: Pérez
- first_name: Bernhard
full_name: Thomaszewski, Bernhard
last_name: Thomaszewski
- first_name: Stelian
full_name: Coros, Stelian
last_name: Coros
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: José
full_name: Canabal, José
last_name: Canabal
- first_name: Robert
full_name: Sumner, Robert
last_name: Sumner
- first_name: Miguel
full_name: Otaduy, Miguel
last_name: Otaduy
citation:
ama: 'Pérez J, Thomaszewski B, Coros S, et al. Design and fabrication of flexible
rod meshes. In: Vol 34. ACM; 2015. doi:10.1145/2766998'
apa: 'Pérez, J., Thomaszewski, B., Coros, S., Bickel, B., Canabal, J., Sumner, R.,
& Otaduy, M. (2015). Design and fabrication of flexible rod meshes (Vol. 34).
Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2766998'
chicago: Pérez, Jesús, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, José
Canabal, Robert Sumner, and Miguel Otaduy. “Design and Fabrication of Flexible
Rod Meshes,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766998.
ieee: 'J. Pérez et al., “Design and fabrication of flexible rod meshes,”
presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.'
ista: 'Pérez J, Thomaszewski B, Coros S, Bickel B, Canabal J, Sumner R, Otaduy M.
2015. Design and fabrication of flexible rod meshes. SIGGRAPH: Special Interest
Group on Computer Graphics and Interactive Techniques vol. 34, 138.'
mla: Pérez, Jesús, et al. Design and Fabrication of Flexible Rod Meshes.
Vol. 34, no. 4, 138, ACM, 2015, doi:10.1145/2766998.
short: J. Pérez, B. Thomaszewski, S. Coros, B. Bickel, J. Canabal, R. Sumner, M.
Otaduy, in:, ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:07Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2021-01-12T06:52:06Z
day: '27'
department:
- _id: BeBi
doi: 10.1145/2766998
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa_version: None
publication_status: published
publisher: ACM
publist_id: '5530'
quality_controlled: '1'
scopus_import: 1
status: public
title: Design and fabrication of flexible rod meshes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1634'
abstract:
- lang: eng
text: Simulating the delightful dynamics of soap films, bubbles, and foams has traditionally
required the use of a fully three-dimensional many-phase Navier-Stokes solver,
even though their visual appearance is completely dominated by the thin liquid
surface. We depart from earlier work on soap bubbles and foams by noting that
their dynamics are naturally described by a Lagrangian vortex sheet model in which
circulation is the primary variable. This leads us to derive a novel circulation-preserving
surface-only discretization of foam dynamics driven by surface tension on a non-manifold
triangle mesh. We represent the surface using a mesh-based multimaterial surface
tracker which supports complex bubble topology changes, and evolve the surface
according to the ambient air flow induced by a scalar circulation field stored
on the mesh. Surface tension forces give rise to a simple update rule for circulation,
even at non-manifold Plateau borders, based on a discrete measure of signed scalar
mean curvature. We further incorporate vertex constraints to enable the interaction
of soap films with wires. The result is a method that is at once simple, robust,
and efficient, yet able to capture an array of soap films behaviors including
foam rearrangement, catenoid collapse, blowing bubbles, and double bubbles being
pulled apart.
article_number: '149'
author:
- first_name: Fang
full_name: Da, Fang
last_name: Da
- first_name: Christopher
full_name: Batty, Christopher
last_name: Batty
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Eitan
full_name: Grinspun, Eitan
last_name: Grinspun
citation:
ama: 'Da F, Batty C, Wojtan C, Grinspun E. Double bubbles sans toil and trouble:
discrete circulation-preserving vortex sheets for soap films and foams. In: Vol
34. ACM; 2015. doi:10.1145/2767003'
apa: 'Da, F., Batty, C., Wojtan, C., & Grinspun, E. (2015). Double bubbles sans
toil and trouble: discrete circulation-preserving vortex sheets for soap films
and foams (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer
Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. https://doi.org/10.1145/2767003'
chicago: 'Da, Fang, Christopher Batty, Chris Wojtan, and Eitan Grinspun. “Double
Bubbles sans Toil and Trouble: Discrete Circulation-Preserving Vortex Sheets for
Soap Films and Foams,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2767003.'
ieee: 'F. Da, C. Batty, C. Wojtan, and E. Grinspun, “Double bubbles sans toil and
trouble: discrete circulation-preserving vortex sheets for soap films and foams,”
presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.'
ista: 'Da F, Batty C, Wojtan C, Grinspun E. 2015. Double bubbles sans toil and trouble:
discrete circulation-preserving vortex sheets for soap films and foams. SIGGRAPH:
Special Interest Group on Computer Graphics and Interactive Techniques vol. 34,
149.'
mla: 'Da, Fang, et al. Double Bubbles sans Toil and Trouble: Discrete Circulation-Preserving
Vortex Sheets for Soap Films and Foams. Vol. 34, no. 4, 149, ACM, 2015, doi:10.1145/2767003.'
short: F. Da, C. Batty, C. Wojtan, E. Grinspun, in:, ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:09Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2023-02-23T10:07:42Z
day: '27'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2767003
ec_funded: 1
file:
- access_level: open_access
checksum: 57b07d78d2d612a8052744b37d4a71fa
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:14Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4867'
file_name: IST-2016-608-v1+1_doublebubbles.pdf
file_size: 8973215
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication_status: published
publisher: ACM
publist_id: '5521'
pubrep_id: '608'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Double bubbles sans toil and trouble: discrete circulation-preserving vortex
sheets for soap films and foams'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1636'
abstract:
- lang: eng
text: "Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem
that appears in many areas of Computer Science. It can be equivalently stated
as computing a homomorphism R→ΓΓ between two relational structures, e.g. between
two directed graphs. Analyzing its complexity has been a prominent research direction,
especially for the fixed template CSPs where the right side ΓΓ is fixed and the
left side R is unconstrained.\r\n\r\nFar fewer results are known for the hybrid
setting that restricts both sides simultaneously. It assumes that R belongs to
a certain class of relational structures (called a structural restriction in this
paper). We study which structural restrictions are effective, i.e. there exists
a fixed template ΓΓ (from a certain class of languages) for which the problem
is tractable when R is restricted, and NP-hard otherwise. We provide a characterization
for structural restrictions that are closed under inverse homomorphisms. The criterion
is based on the chromatic number of a relational structure defined in this paper;
it generalizes the standard chromatic number of a graph.\r\n\r\nAs our main tool,
we use the algebraic machinery developed for fixed template CSPs. To apply it
to our case, we introduce a new construction called a “lifted language”. We also
give a characterization for structural restrictions corresponding to minor-closed
families of graphs, extend results to certain Valued CSPs (namely conservative
valued languages), and state implications for (valued) CSPs with ordered variables
and for the maximum weight independent set problem on some restricted families
of graphs."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Michal
full_name: Rolinek, Michal
id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87
last_name: Rolinek
- first_name: Rustem
full_name: Takhanov, Rustem
last_name: Takhanov
citation:
ama: 'Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions
for hybrid CSPs. In: 26th International Symposium. Vol 9472. Springer Nature;
2015:566-577. doi:10.1007/978-3-662-48971-0_48'
apa: 'Kolmogorov, V., Rolinek, M., & Takhanov, R. (2015). Effectiveness of structural
restrictions for hybrid CSPs. In 26th International Symposium (Vol. 9472,
pp. 566–577). Nagoya, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-48971-0_48'
chicago: Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness
of Structural Restrictions for Hybrid CSPs.” In 26th International Symposium,
9472:566–77. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.
ieee: V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions
for hybrid CSPs,” in 26th International Symposium, Nagoya, Japan, 2015,
vol. 9472, pp. 566–577.
ista: 'Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions
for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium
on Algorithms and Computation, LNCS, vol. 9472, 566–577.'
mla: Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for
Hybrid CSPs.” 26th International Symposium, vol. 9472, Springer Nature,
2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
short: V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium,
Springer Nature, 2015, pp. 566–577.
conference:
end_date: 2015-12-11
location: Nagoya, Japan
name: 'ISAAC: International Symposium on Algorithms and Computation'
start_date: 2015-12-09
date_created: 2018-12-11T11:53:10Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2022-02-01T15:12:35Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/978-3-662-48971-0_48
ec_funded: 1
external_id:
arxiv:
- '1504.07067'
intvolume: ' 9472'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1504.07067
month: '12'
oa: 1
oa_version: Preprint
page: 566 - 577
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: 26th International Symposium
publication_identifier:
isbn:
- 978-3-662-48970-3
publication_status: published
publisher: Springer Nature
publist_id: '5519'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Effectiveness of structural restrictions for hybrid CSPs
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9472
year: '2015'
...
---
_id: '1632'
abstract:
- lang: eng
text: "This paper presents a liquid simulation technique that enforces the incompressibility
condition using a stream function solve instead of a pressure projection. Previous
methods have used stream function techniques for the simulation of detailed single-phase
flows, but a formulation for liquid simulation has proved elusive in part due
to the free surface boundary conditions. In this paper, we introduce a stream
function approach to liquid simulations with novel boundary conditions for free
surfaces, solid obstacles, and solid-fluid coupling.\r\n\r\nAlthough our approach
increases the dimension of the linear system necessary to enforce incompressibility,
it provides interesting and surprising benefits. First, the resulting flow is
guaranteed to be divergence-free regardless of the accuracy of the solve. Second,
our free-surface boundary conditions guarantee divergence-free motion even in
the un-simulated air phase, which enables two-phase flow simulation by only computing
a single phase. We implemented this method using a variant of FLIP simulation
which only samples particles within a narrow band of the liquid surface, and we
illustrate the effectiveness of our method for detailed two-phase flow simulations
with complex boundaries, detailed bubble interactions, and two-way solid-fluid
coupling."
acknowledgement: The first author was supported by a JSPS Postdoctoral Fellowship
for Research Abroad. This work was also supported by the ERC projects ERC-2014-StG-637014
realFlow and ERC-2014- StG-638176 BigSplash.
alternative_title:
- ACM Transactions on Graphics
article_number: '53'
author:
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: 'Ando R, Thuerey N, Wojtan C. A stream function solver for liquid simulations.
In: Vol 34. ACM; 2015. doi:10.1145/2766935'
apa: 'Ando, R., Thuerey, N., & Wojtan, C. (2015). A stream function solver for
liquid simulations (Vol. 34). Presented at the SIGGRAPH: Special Interest Group
on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA: ACM. https://doi.org/10.1145/2766935'
chicago: Ando, Ryoichi, Nils Thuerey, and Chris Wojtan. “A Stream Function Solver
for Liquid Simulations,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766935.
ieee: 'R. Ando, N. Thuerey, and C. Wojtan, “A stream function solver for liquid
simulations,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics
and Interactive Techniques, Los Angeles, CA, USA, 2015, vol. 34, no. 4.'
ista: 'Ando R, Thuerey N, Wojtan C. 2015. A stream function solver for liquid simulations.
SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques,
ACM Transactions on Graphics, vol. 34, 53.'
mla: Ando, Ryoichi, et al. A Stream Function Solver for Liquid Simulations.
Vol. 34, no. 4, 53, ACM, 2015, doi:10.1145/2766935.
short: R. Ando, N. Thuerey, C. Wojtan, in:, ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, USA
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:09Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2023-02-23T10:07:37Z
day: '27'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2766935
file:
- access_level: open_access
checksum: 7a9afdfaba9209157ce19376e15bc90b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:52Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4909'
file_name: IST-2016-610-v1+1_vecpotential.pdf
file_size: 21831121
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: ACM
publist_id: '5523'
pubrep_id: '610'
quality_controlled: '1'
scopus_import: 1
status: public
title: A stream function solver for liquid simulations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1630'
abstract:
- lang: eng
text: We present a method to learn and propagate shape placements in 2D polygonal
scenes from a few examples provided by a user. The placement of a shape is modeled
as an oriented bounding box. Simple geometric relationships between this bounding
box and nearby scene polygons define a feature set for the placement. The feature
sets of all example placements are then used to learn a probabilistic model over
all possible placements and scenes. With this model, we can generate a new set
of placements with similar geometric relationships in any given scene. We introduce
extensions that enable propagation and generation of shapes in 3D scenes, as
well as the application of a learned modeling session to large scenes without
additional user interaction. These concepts allow us to generate complex scenes
with thousands of objects with relatively little user interaction.
acknowledgement: This publication is based upon work supported by the KAUST Office
of Competitive Research Funds (OCRF) under Award No. 62140401, the KAUST Visual
Computing Center and the Austrian Science Fund (FWF) projects DEEP PICTURES (no.
P24352-N23) and Data-Driven Procedural Modeling of Interiors (no. P24600-N23).
article_number: '108'
author:
- first_name: Paul
full_name: Guerrero, Paul
last_name: Guerrero
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Michael
full_name: Wimmer, Michael
last_name: Wimmer
- first_name: Peter
full_name: Wonka, Peter
last_name: Wonka
citation:
ama: 'Guerrero P, Jeschke S, Wimmer M, Wonka P. Learning shape placements by example.
In: Vol 34. ACM; 2015. doi:10.1145/2766933'
apa: 'Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2015). Learning shape
placements by example (Vol. 34). Presented at the SIGGRAPH: Special Interest Group
on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States:
ACM. https://doi.org/10.1145/2766933'
chicago: Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Learning
Shape Placements by Example,” Vol. 34. ACM, 2015. https://doi.org/10.1145/2766933.
ieee: 'P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Learning shape placements
by example,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics
and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no.
4.'
ista: 'Guerrero P, Jeschke S, Wimmer M, Wonka P. 2015. Learning shape placements
by example. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive
Techniques vol. 34, 108.'
mla: Guerrero, Paul, et al. Learning Shape Placements by Example. Vol. 34,
no. 4, 108, ACM, 2015, doi:10.1145/2766933.
short: P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, in:, ACM, 2015.
conference:
end_date: 2015-08-13
location: Los Angeles, CA, United States
name: 'SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques'
start_date: 2015-08-09
date_created: 2018-12-11T11:53:08Z
date_published: 2015-07-27T00:00:00Z
date_updated: 2021-01-12T06:52:07Z
day: '27'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2766933
file:
- access_level: open_access
checksum: 8b05a51e372c9b0b5af9a00098a9538b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:49Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4647'
file_name: IST-2016-576-v1+1_guerrero-2015-lsp-paper.pdf
file_size: 11902290
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
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_status: published
publisher: ACM
publist_id: '5525'
pubrep_id: '576'
quality_controlled: '1'
scopus_import: 1
status: public
title: Learning shape placements by example
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1640'
abstract:
- lang: eng
text: Auxin and cytokinin are key endogenous regulators of plant development. Although
cytokinin-mediated modulation of auxin distribution is a developmentally crucial
hormonal interaction, its molecular basis is largely unknown. Here we show a direct
regulatory link between cytokinin signalling and the auxin transport machinery
uncovering a mechanistic framework for cytokinin-auxin cross-talk. We show that
the CYTOKININ RESPONSE FACTORS (CRFs), transcription factors downstream of cytokinin
perception, transcriptionally control genes encoding PIN-FORMED (PIN) auxin transporters
at a specific PIN CYTOKININ RESPONSE ELEMENT (PCRE) domain. Removal of this cis-regulatory
element effectively uncouples PIN transcription from the CRF-mediated cytokinin
regulation and attenuates plant cytokinin sensitivity. We propose that CRFs represent
a missing cross-talk component that fine-tunes auxin transport capacity downstream
of cytokinin signalling to control plant development.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
acknowledgement: This work was supported by the European Research Council Starting
Independent Research grant (ERC-2007-Stg-207362-HCPO to E.B., M.S., C.C.), by the
Ghent University Multidisciplinary Research Partnership ‘Biotechnology for a Sustainable
Economy’ no.01MRB510W, by the Research Foundation—Flanders (grant 3G033711 to J.-A.O.),
by the Austrian Science Fund (FWF01_I1774S) to K.Ö.,E.B., and by the Interuniversity
Attraction Poles Programme (IUAP P7/29 ‘MARS’) initiated by the Belgian Science
Policy Office. I.D.C. and S.V. are post-doctoral fellows of the Research Foundation—Flanders
(FWO). This research was supported by the Scientific Service Units (SSU) of IST-Austria
through resources provided by the Bioimaging Facility (BIF), the Life Science Facility
(LSF).
article_number: '8717'
author:
- first_name: Mária
full_name: Šimášková, Mária
last_name: Šimášková
- first_name: José
full_name: O'Brien, José
last_name: O'Brien
- first_name: Mamoona
full_name: Khan-Djamei, Mamoona
id: 391B5BBC-F248-11E8-B48F-1D18A9856A87
last_name: Khan-Djamei
- first_name: Giel
full_name: Van Noorden, Giel
last_name: Van Noorden
- first_name: Krisztina
full_name: Ötvös, Krisztina
id: 29B901B0-F248-11E8-B48F-1D18A9856A87
last_name: Ötvös
orcid: 0000-0002-5503-4983
- first_name: Anne
full_name: Vieten, Anne
last_name: Vieten
- first_name: Inge
full_name: De Clercq, Inge
last_name: De Clercq
- first_name: Johanna
full_name: Van Haperen, Johanna
last_name: Van Haperen
- first_name: Candela
full_name: Cuesta, Candela
id: 33A3C818-F248-11E8-B48F-1D18A9856A87
last_name: Cuesta
orcid: 0000-0003-1923-2410
- first_name: Klára
full_name: Hoyerová, Klára
last_name: Hoyerová
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Peter
full_name: Marhavy, Peter
id: 3F45B078-F248-11E8-B48F-1D18A9856A87
last_name: Marhavy
orcid: 0000-0001-5227-5741
- first_name: Krzysztof T
full_name: Wabnik, Krzysztof T
id: 4DE369A4-F248-11E8-B48F-1D18A9856A87
last_name: Wabnik
orcid: 0000-0001-7263-0560
- first_name: Frank
full_name: Van Breusegem, Frank
last_name: Van Breusegem
- first_name: Moritz
full_name: Nowack, Moritz
last_name: Nowack
- first_name: Angus
full_name: Murphy, Angus
last_name: Murphy
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
citation:
ama: Šimášková M, O’Brien J, Khan-Djamei M, et al. Cytokinin response factors regulate
PIN-FORMED auxin transporters. Nature Communications. 2015;6. doi:10.1038/ncomms9717
apa: Šimášková, M., O’Brien, J., Khan-Djamei, M., Van Noorden, G., Ötvös, K., Vieten,
A., … Benková, E. (2015). Cytokinin response factors regulate PIN-FORMED auxin
transporters. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms9717
chicago: Šimášková, Mária, José O’Brien, Mamoona Khan-Djamei, Giel Van Noorden,
Krisztina Ötvös, Anne Vieten, Inge De Clercq, et al. “Cytokinin Response Factors
Regulate PIN-FORMED Auxin Transporters.” Nature Communications. Nature
Publishing Group, 2015. https://doi.org/10.1038/ncomms9717.
ieee: M. Šimášková et al., “Cytokinin response factors regulate PIN-FORMED
auxin transporters,” Nature Communications, vol. 6. Nature Publishing Group,
2015.
ista: Šimášková M, O’Brien J, Khan-Djamei M, Van Noorden G, Ötvös K, Vieten A, De
Clercq I, Van Haperen J, Cuesta C, Hoyerová K, Vanneste S, Marhavý P, Wabnik KT,
Van Breusegem F, Nowack M, Murphy A, Friml J, Weijers D, Beeckman T, Benková E.
2015. Cytokinin response factors regulate PIN-FORMED auxin transporters. Nature
Communications. 6, 8717.
mla: Šimášková, Mária, et al. “Cytokinin Response Factors Regulate PIN-FORMED Auxin
Transporters.” Nature Communications, vol. 6, 8717, Nature Publishing Group,
2015, doi:10.1038/ncomms9717.
short: M. Šimášková, J. O’Brien, M. Khan-Djamei, G. Van Noorden, K. Ötvös, A. Vieten,
I. De Clercq, J. Van Haperen, C. Cuesta, K. Hoyerová, S. Vanneste, P. Marhavý,
K.T. Wabnik, F. Van Breusegem, M. Nowack, A. Murphy, J. Friml, D. Weijers, T.
Beeckman, E. Benková, Nature Communications 6 (2015).
date_created: 2018-12-11T11:53:12Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:11Z
day: '01'
ddc:
- '580'
department:
- _id: EvBe
- _id: JiFr
doi: 10.1038/ncomms9717
ec_funded: 1
file:
- access_level: open_access
checksum: c2c84bca37401435fedf76bad0ba0579
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:36Z
date_updated: 2020-07-14T12:45:08Z
file_id: '5358'
file_name: IST-2018-1020-v1+1_Simaskova_et_al_NatCom_2015.pdf
file_size: 1471217
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
project:
- _id: 253FCA6A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '207362'
name: Hormonal cross-talk in plant organogenesis
- _id: 2542D156-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I 1774-B16
name: Hormone cross-talk drives nutrient dependent plant development
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '5513'
pubrep_id: '1020'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cytokinin response factors regulate PIN-FORMED auxin transporters
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2015'
...
---
_id: '1642'
abstract:
- lang: eng
text: The Hanani-Tutte theorem is a classical result proved for the first time in
the 1930s that characterizes planar graphs as graphs that admit a drawing in the
plane in which every pair of edges not sharing a vertex cross an even number of
times. We generalize this result to clustered graphs with two disjoint clusters,
and show that a straightforward extension to flat clustered graphs with three
or more disjoint clusters is not possible. For general clustered graphs we show
a variant of the Hanani-Tutte theorem in the case when each cluster induces a
connected subgraph. Di Battista and Frati proved that clustered planarity of embedded
clustered graphs whose every face is incident to at most five vertices can be
tested in polynomial time. We give a new and short proof of this result, using
the matroid intersection algorithm.
acknowledgement: e research leading to these results has received funding fromthe
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme(FP7/2007-2013) under REA grant agreement no [291734], and ESF Eurogiga
project GraDR as GAˇCRGIG/11/E023.
article_number: 'P4.24 '
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: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Igor
full_name: Malinovič, Igor
last_name: Malinovič
- first_name: Dömötör
full_name: Pálvölgyi, Dömötör
last_name: Pálvölgyi
citation:
ama: Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. Clustered planarity testing revisited.
Electronic Journal of Combinatorics. 2015;22(4). doi:10.37236/5002
apa: Fulek, R., Kynčl, J., Malinovič, I., & Pálvölgyi, D. (2015). Clustered
planarity testing revisited. Electronic Journal of Combinatorics. Electronic
Journal of Combinatorics. https://doi.org/10.37236/5002
chicago: Fulek, Radoslav, Jan Kynčl, Igor Malinovič, and Dömötör Pálvölgyi. “Clustered
Planarity Testing Revisited.” Electronic Journal of Combinatorics. Electronic
Journal of Combinatorics, 2015. https://doi.org/10.37236/5002.
ieee: R. Fulek, J. Kynčl, I. Malinovič, and D. Pálvölgyi, “Clustered planarity testing
revisited,” Electronic Journal of Combinatorics, vol. 22, no. 4. Electronic
Journal of Combinatorics, 2015.
ista: Fulek R, Kynčl J, Malinovič I, Pálvölgyi D. 2015. Clustered planarity testing
revisited. Electronic Journal of Combinatorics. 22(4), P4.24.
mla: Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” Electronic
Journal of Combinatorics, vol. 22, no. 4, P4.24, Electronic Journal of Combinatorics,
2015, doi:10.37236/5002.
short: R. Fulek, J. Kynčl, I. Malinovič, D. Pálvölgyi, Electronic Journal of Combinatorics
22 (2015).
date_created: 2018-12-11T11:53:12Z
date_published: 2015-11-13T00:00:00Z
date_updated: 2023-02-21T16:03:02Z
day: '13'
ddc:
- '514'
- '516'
department:
- _id: UlWa
doi: 10.37236/5002
ec_funded: 1
external_id:
arxiv:
- '1305.4519'
file:
- access_level: open_access
checksum: 40b5920b49ee736694f59f39588ee206
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:03Z
date_updated: 2020-07-14T12:45:08Z
file_id: '5120'
file_name: IST-2016-714-v1+1_5002-15499-3-PB.pdf
file_size: 443655
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 22'
issue: '4'
language:
- iso: eng
month: '11'
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: Electronic Journal of Combinatorics
publication_identifier:
eissn:
- 1077-8926
publication_status: published
publisher: Electronic Journal of Combinatorics
publist_id: '5511'
pubrep_id: '714'
quality_controlled: '1'
related_material:
record:
- id: '10793'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Clustered planarity testing revisited
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2015'
...
---
_id: '1639'
abstract:
- lang: eng
text: In this paper the optimal transport and the metamorphosis perspectives are
combined. For a pair of given input images geodesic paths in the space of images
are defined as minimizers of a resulting path energy. To this end, the underlying
Riemannian metric measures the rate of transport cost and the rate of viscous
dissipation. Furthermore, the model is capable to deal with strongly varying image
contrast and explicitly allows for sources and sinks in the transport equations
which are incorporated in the metric related to the metamorphosis approach by
Trouvé and Younes. In the non-viscous case with source term existence of geodesic
paths is proven in the space of measures. The proposed model is explored on the
range from merely optimal transport to strongly dissipative dynamics. For this
model a robust and effective variational time discretization of geodesic paths
is proposed. This requires to minimize a discrete path energy consisting of a
sum of consecutive image matching functionals. These functionals are defined on
corresponding pairs of intensity functions and on associated pairwise matching
deformations. Existence of time discrete geodesics is demonstrated. Furthermore,
a finite element implementation is proposed and applied to instructive test cases
and to real images. In the non-viscous case this is compared to the algorithm
proposed by Benamou and Brenier including a discretization of the source term.
Finally, the model is generalized to define discrete weighted barycentres with
applications to textures and objects.
acknowledgement: The authors acknowledge support of the Collaborative Research Centre
1060 funded by the German Science foundation. This work is further supported by
the King Abdullah University for Science and Technology (KAUST) Award No. KUK-I1-007-43
and the EPSRC grant Nr. EP/M00483X/1.
author:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Martin
full_name: Rumpf, Martin
last_name: Rumpf
- first_name: Carola
full_name: Schönlieb, Carola
last_name: Schönlieb
- first_name: Stefan
full_name: Simon, Stefan
last_name: Simon
citation:
ama: 'Maas J, Rumpf M, Schönlieb C, Simon S. A generalized model for optimal transport
of images including dissipation and density modulation. ESAIM: Mathematical
Modelling and Numerical Analysis. 2015;49(6):1745-1769. doi:10.1051/m2an/2015043'
apa: 'Maas, J., Rumpf, M., Schönlieb, C., & Simon, S. (2015). A generalized
model for optimal transport of images including dissipation and density modulation.
ESAIM: Mathematical Modelling and Numerical Analysis. EDP Sciences. https://doi.org/10.1051/m2an/2015043'
chicago: 'Maas, Jan, Martin Rumpf, Carola Schönlieb, and Stefan Simon. “A Generalized
Model for Optimal Transport of Images Including Dissipation and Density Modulation.”
ESAIM: Mathematical Modelling and Numerical Analysis. EDP Sciences, 2015.
https://doi.org/10.1051/m2an/2015043.'
ieee: 'J. Maas, M. Rumpf, C. Schönlieb, and S. Simon, “A generalized model for optimal
transport of images including dissipation and density modulation,” ESAIM: Mathematical
Modelling and Numerical Analysis, vol. 49, no. 6. EDP Sciences, pp. 1745–1769,
2015.'
ista: 'Maas J, Rumpf M, Schönlieb C, Simon S. 2015. A generalized model for optimal
transport of images including dissipation and density modulation. ESAIM: Mathematical
Modelling and Numerical Analysis. 49(6), 1745–1769.'
mla: 'Maas, Jan, et al. “A Generalized Model for Optimal Transport of Images Including
Dissipation and Density Modulation.” ESAIM: Mathematical Modelling and Numerical
Analysis, vol. 49, no. 6, EDP Sciences, 2015, pp. 1745–69, doi:10.1051/m2an/2015043.'
short: 'J. Maas, M. Rumpf, C. Schönlieb, S. Simon, ESAIM: Mathematical Modelling
and Numerical Analysis 49 (2015) 1745–1769.'
date_created: 2018-12-11T11:53:11Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2021-01-12T06:52:10Z
day: '01'
department:
- _id: JaMa
doi: 10.1051/m2an/2015043
external_id:
arxiv:
- '1504.01988'
intvolume: ' 49'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1504.01988
month: '11'
oa: 1
oa_version: Preprint
page: 1745 - 1769
publication: 'ESAIM: Mathematical Modelling and Numerical Analysis'
publication_status: published
publisher: EDP Sciences
publist_id: '5514'
quality_controlled: '1'
scopus_import: 1
status: public
title: A generalized model for optimal transport of images including dissipation and
density modulation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 49
year: '2015'
...
---
_id: '1638'
abstract:
- lang: eng
text: The mitochondrial respiratory chain, also known as the electron transport
chain (ETC), is crucial to life, and energy production in the form of ATP is the
main mitochondrial function. Three proton-translocating enzymes of the ETC, namely
complexes I, III and IV, generate proton motive force, which in turn drives ATP
synthase (complex V). The atomic structures and basic mechanisms of most respiratory
complexes have previously been established, with the exception of complex I, the
largest complex in the ETC. Recently, the crystal structure of the entire complex
I was solved using a bacterial enzyme. The structure provided novel insights into
the core architecture of the complex, the electron transfer and proton translocation
pathways, as well as the mechanism that couples these two processes.
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Sazanov LA. A giant molecular proton pump: structure and mechanism of respiratory
complex I. Nature Reviews Molecular Cell Biology. 2015;16(6):375-388. doi:10.1038/nrm3997'
apa: 'Sazanov, L. A. (2015). A giant molecular proton pump: structure and mechanism
of respiratory complex I. Nature Reviews Molecular Cell Biology. Nature
Publishing Group. https://doi.org/10.1038/nrm3997'
chicago: 'Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism
of Respiratory Complex I.” Nature Reviews Molecular Cell Biology. Nature
Publishing Group, 2015. https://doi.org/10.1038/nrm3997.'
ieee: 'L. A. Sazanov, “A giant molecular proton pump: structure and mechanism of
respiratory complex I,” Nature Reviews Molecular Cell Biology, vol. 16,
no. 6. Nature Publishing Group, pp. 375–388, 2015.'
ista: 'Sazanov LA. 2015. A giant molecular proton pump: structure and mechanism
of respiratory complex I. Nature Reviews Molecular Cell Biology. 16(6), 375–388.'
mla: 'Sazanov, Leonid A. “A Giant Molecular Proton Pump: Structure and Mechanism
of Respiratory Complex I.” Nature Reviews Molecular Cell Biology, vol.
16, no. 6, Nature Publishing Group, 2015, pp. 375–88, doi:10.1038/nrm3997.'
short: L.A. Sazanov, Nature Reviews Molecular Cell Biology 16 (2015) 375–388.
date_created: 2018-12-11T11:53:11Z
date_published: 2015-05-22T00:00:00Z
date_updated: 2021-01-12T06:52:10Z
day: '22'
department:
- _id: LeSa
doi: 10.1038/nrm3997
intvolume: ' 16'
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 375 - 388
publication: Nature Reviews Molecular Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '5517'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'A giant molecular proton pump: structure and mechanism of respiratory complex
I'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2015'
...
---
_id: '1646'
abstract:
- lang: eng
text: 'A pseudorandom function (PRF) is a keyed function F : K × X → Y where, for
a random key k ∈ K, the function F(k, ·) is indistinguishable from a uniformly
random function, given black-box access. A key-homomorphic PRF has the additional
feature that for any keys k, k'' and any input x, we have F(k+k'', x) = F(k, x)⊕F(k'',
x) for some group operations +,⊕ on K and Y, respectively. A constrained PRF for
a family of setsS ⊆ P(X) has the property that, given any key k and set S ∈ S,
one can efficiently compute a “constrained” key kS that enables evaluation of
F(k, x) on all inputs x ∈ S, while the values F(k, x) for x /∈ S remain pseudorandom
even given kS. In this paper we construct PRFs that are simultaneously constrained
and key homomorphic, where the homomorphic property holds even for constrained
keys. We first show that the multilinear map-based bit-fixing and circuit-constrained
PRFs of Boneh and Waters (Asiacrypt 2013) can be modified to also be keyhomomorphic.
We then show that the LWE-based key-homomorphic PRFs of Banerjee and Peikert (Crypto
2014) are essentially already prefix-constrained PRFs, using a (non-obvious) definition
of constrained keys and associated group operation. Moreover, the constrained
keys themselves are pseudorandom, and the constraining and evaluation functions
can all be computed in low depth. As an application of key-homomorphic constrained
PRFs,we construct a proxy re-encryption schemewith fine-grained access control.
This scheme allows storing encrypted data on an untrusted server, where each file
can be encrypted relative to some attributes, so that only parties whose constrained
keys match the attributes can decrypt. Moreover, the server can re-key (arbitrary
subsets of) the ciphertexts without learning anything about the plaintexts, thus
permitting efficient and finegrained revocation.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Abishek
full_name: Banerjee, Abishek
last_name: Banerjee
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Chris
full_name: Peikert, Chris
last_name: Peikert
- 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: Sophie
full_name: Stevens, Sophie
last_name: Stevens
citation:
ama: 'Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. Key-homomorphic
constrained pseudorandom functions. In: 12th Theory of Cryptography Conference.
Vol 9015. Springer Nature; 2015:31-60. doi:10.1007/978-3-662-46497-7_2'
apa: 'Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., & Stevens,
S. (2015). Key-homomorphic constrained pseudorandom functions. In 12th Theory
of Cryptography Conference (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer
Nature. https://doi.org/10.1007/978-3-662-46497-7_2'
chicago: Banerjee, Abishek, Georg Fuchsbauer, Chris Peikert, Krzysztof Z Pietrzak,
and Sophie Stevens. “Key-Homomorphic Constrained Pseudorandom Functions.” In 12th
Theory of Cryptography Conference, 9015:31–60. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-46497-7_2.
ieee: A. Banerjee, G. Fuchsbauer, C. Peikert, K. Z. Pietrzak, and S. Stevens, “Key-homomorphic
constrained pseudorandom functions,” in 12th Theory of Cryptography Conference,
Warsaw, Poland, 2015, vol. 9015, pp. 31–60.
ista: 'Banerjee A, Fuchsbauer G, Peikert C, Pietrzak KZ, Stevens S. 2015. Key-homomorphic
constrained pseudorandom functions. 12th Theory of Cryptography Conference. TCC:
Theory of Cryptography Conference, LNCS, vol. 9015, 31–60.'
mla: Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.”
12th Theory of Cryptography Conference, vol. 9015, Springer Nature, 2015,
pp. 31–60, doi:10.1007/978-3-662-46497-7_2.
short: A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, in:, 12th
Theory of Cryptography Conference, Springer Nature, 2015, pp. 31–60.
conference:
end_date: 2015-03-25
location: Warsaw, Poland
name: 'TCC: Theory of Cryptography Conference'
start_date: 2015-03-23
date_created: 2018-12-11T11:53:14Z
date_published: 2015-03-01T00:00:00Z
date_updated: 2022-02-03T08:41:46Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-662-46497-7_2
ec_funded: 1
file:
- access_level: open_access
checksum: 3c5093bda5783c89beaacabf1aa0e60e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:17Z
date_updated: 2020-07-14T12:45:08Z
file_id: '5136'
file_name: IST-2016-679-v1+1_180.pdf
file_size: 450665
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9015'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/180
month: '03'
oa: 1
oa_version: Submitted Version
page: 31 - 60
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: 12th Theory of Cryptography Conference
publication_identifier:
isbn:
- 978-3-662-46496-0
publication_status: published
publisher: Springer Nature
publist_id: '5505'
pubrep_id: '679'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Key-homomorphic constrained pseudorandom functions
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9015
year: '2015'
...
---
_id: '1648'
abstract:
- lang: eng
text: Generalized Selective Decryption (GSD), introduced by Panjwani [TCC’07], is
a game for a symmetric encryption scheme Enc that captures the difficulty of proving
adaptive security of certain protocols, most notably the Logical Key Hierarchy
(LKH) multicast encryption protocol. In the GSD game there are n keys k1,...,
kn, which the adversary may adaptively corrupt (learn); moreover, it can ask for
encryptions Encki (kj) of keys under other keys. The adversary’s task is to distinguish
keys (which it cannot trivially compute) from random. Proving the hardness of
GSD assuming only IND-CPA security of Enc is surprisingly hard. Using “complexity
leveraging” loses a factor exponential in n, which makes the proof practically
meaningless. We can think of the GSD game as building a graph on n vertices, where
we add an edge i → j when the adversary asks for an encryption of kj under ki.
If restricted to graphs of depth ℓ, Panjwani gave a reduction that loses only
a factor exponential in ℓ (not n). To date, this is the only non-trivial result
known for GSD. In this paper we give almost-polynomial reductions for large classes
of graphs. Most importantly, we prove the security of the GSD game restricted
to trees losing only a quasi-polynomial factor n3 log n+5. Trees are an important
special case capturing real-world protocols like the LKH protocol. Our new bound
improves upon Panjwani’s on some LKH variants proposed in the literature where
the underlying tree is not balanced. Our proof builds on ideas from the “nested
hybrids” technique recently introduced by Fuchsbauer et al. [Asiacrypt’14] for
proving the adaptive security of constrained PRFs.
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Zahra
full_name: Jafargholi, Zahra
last_name: Jafargholi
- 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: 'Fuchsbauer G, Jafargholi Z, Pietrzak KZ. A quasipolynomial reduction for generalized
selective decryption on trees. In: Vol 9215. Springer; 2015:601-620. doi:10.1007/978-3-662-47989-6_29'
apa: 'Fuchsbauer, G., Jafargholi, Z., & Pietrzak, K. Z. (2015). A quasipolynomial
reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620).
Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA,
USA: Springer. https://doi.org/10.1007/978-3-662-47989-6_29'
chicago: Fuchsbauer, Georg, Zahra Jafargholi, and Krzysztof Z Pietrzak. “A Quasipolynomial
Reduction for Generalized Selective Decryption on Trees,” 9215:601–20. Springer,
2015. https://doi.org/10.1007/978-3-662-47989-6_29.
ieee: 'G. Fuchsbauer, Z. Jafargholi, and K. Z. Pietrzak, “A quasipolynomial reduction
for generalized selective decryption on trees,” presented at the CRYPTO: International
Cryptology Conference, Santa Barbara, CA, USA, 2015, vol. 9215, pp. 601–620.'
ista: 'Fuchsbauer G, Jafargholi Z, Pietrzak KZ. 2015. A quasipolynomial reduction
for generalized selective decryption on trees. CRYPTO: International Cryptology
Conference, LNCS, vol. 9215, 601–620.'
mla: Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective
Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.
short: G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.
conference:
end_date: 2015-08-20
location: Santa Barbara, CA, USA
name: 'CRYPTO: International Cryptology Conference'
start_date: 2015-08-16
date_created: 2018-12-11T11:53:14Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:14Z
day: '01'
ddc:
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-662-47989-6_29
ec_funded: 1
file:
- access_level: open_access
checksum: 99b76b3263d5082554d0a9cbdeca3a22
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:31Z
date_updated: 2020-07-14T12:45:08Z
file_id: '5015'
file_name: IST-2016-674-v1+1_389.pdf
file_size: 505618
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9215'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 601 - 620
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5502'
pubrep_id: '674'
quality_controlled: '1'
scopus_import: 1
status: public
title: A quasipolynomial reduction for generalized selective decryption on trees
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9215
year: '2015'
...
---
_id: '1649'
abstract:
- lang: eng
text: 'We extend a commitment scheme based on the learning with errors over rings
(RLWE) problem, and present efficient companion zeroknowledge proofs of knowledge.
Our scheme maps elements from the ring (or equivalently, n elements from '
alternative_title:
- LNCS
author:
- first_name: Fabrice
full_name: Benhamouda, Fabrice
last_name: Benhamouda
- first_name: Stephan
full_name: Krenn, Stephan
last_name: Krenn
- first_name: Vadim
full_name: Lyubashevsky, Vadim
last_name: Lyubashevsky
- 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: Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. Efficient zero-knowledge
proofs for commitments from learning with errors over rings. 2015;9326:305-325.
doi:10.1007/978-3-319-24174-6_16
apa: 'Benhamouda, F., Krenn, S., Lyubashevsky, V., & Pietrzak, K. Z. (2015).
Efficient zero-knowledge proofs for commitments from learning with errors over
rings. Presented at the ESORICS: European Symposium on Research in Computer Security,
Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-24174-6_16'
chicago: Benhamouda, Fabrice, Stephan Krenn, Vadim Lyubashevsky, and Krzysztof Z
Pietrzak. “Efficient Zero-Knowledge Proofs for Commitments from Learning with
Errors over Rings.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-24174-6_16.
ieee: F. Benhamouda, S. Krenn, V. Lyubashevsky, and K. Z. Pietrzak, “Efficient zero-knowledge
proofs for commitments from learning with errors over rings,” vol. 9326. Springer,
pp. 305–325, 2015.
ista: Benhamouda F, Krenn S, Lyubashevsky V, Pietrzak KZ. 2015. Efficient zero-knowledge
proofs for commitments from learning with errors over rings. 9326, 305–325.
mla: Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments
from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25,
doi:10.1007/978-3-319-24174-6_16.
short: F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.
conference:
end_date: 2015-09-25
location: Vienna, Austria
name: 'ESORICS: European Symposium on Research in Computer Security'
start_date: 2015-09-21
date_created: 2018-12-11T11:53:15Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:14Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-319-24174-6_16
ec_funded: 1
file:
- access_level: open_access
checksum: 6eac4a485b2aa644b2d3f753ed0b280b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:28Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4883'
file_name: IST-2016-678-v1+1_889.pdf
file_size: 494239
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9326'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 305 - 325
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5501'
pubrep_id: '678'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Efficient zero-knowledge proofs for commitments from learning with errors over
rings
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9326
year: '2015'
...
---
_id: '1644'
abstract:
- lang: eng
text: Increasing the computational complexity of evaluating a hash function, both
for the honest users as well as for an adversary, is a useful technique employed
for example in password-based cryptographic schemes to impede brute-force attacks,
and also in so-called proofs of work (used in protocols like Bitcoin) to show
that a certain amount of computation was performed by a legitimate user. A natural
approach to adjust the complexity of a hash function is to iterate it c times,
for some parameter c, in the hope that any query to the scheme requires c evaluations
of the underlying hash function. However, results by Dodis et al. (Crypto 2012)
imply that plain iteration falls short of achieving this goal, and designing schemes
which provably have such a desirable property remained an open problem. This paper
formalizes explicitly what it means for a given scheme to amplify the query complexity
of a hash function. In the random oracle model, the goal of a secure query-complexity
amplifier (QCA) scheme is captured as transforming, in the sense of indifferentiability,
a random oracle allowing R queries (for the adversary) into one provably allowing
only r < R queries. Turned around, this means that making r queries to the
scheme requires at least R queries to the actual random oracle. Second, a new
scheme, called collision-free iteration, is proposed and proven to achieve c-fold
QCA for both the honest parties and the adversary, for any fixed parameter c.
alternative_title:
- LNCS
author:
- first_name: Grégory
full_name: Demay, Grégory
last_name: Demay
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Ueli
full_name: Maurer, Ueli
last_name: Maurer
- first_name: Björn
full_name: Tackmann, Björn
last_name: Tackmann
citation:
ama: 'Demay G, Gazi P, Maurer U, Tackmann B. Query-complexity amplification for
random oracles. In: Vol 9063. Springer; 2015:159-180. doi:10.1007/978-3-319-17470-9_10'
apa: 'Demay, G., Gazi, P., Maurer, U., & Tackmann, B. (2015). Query-complexity
amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS:
International Conference on Information Theoretic Security, Lugano, Switzerland:
Springer. https://doi.org/10.1007/978-3-319-17470-9_10'
chicago: Demay, Grégory, Peter Gazi, Ueli Maurer, and Björn Tackmann. “Query-Complexity
Amplification for Random Oracles,” 9063:159–80. Springer, 2015. https://doi.org/10.1007/978-3-319-17470-9_10.
ieee: 'G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Query-complexity amplification
for random oracles,” presented at the ICITS: International Conference on Information
Theoretic Security, Lugano, Switzerland, 2015, vol. 9063, pp. 159–180.'
ista: 'Demay G, Gazi P, Maurer U, Tackmann B. 2015. Query-complexity amplification
for random oracles. ICITS: International Conference on Information Theoretic Security,
LNCS, vol. 9063, 159–180.'
mla: Demay, Grégory, et al. Query-Complexity Amplification for Random Oracles.
Vol. 9063, Springer, 2015, pp. 159–80, doi:10.1007/978-3-319-17470-9_10.
short: G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, Springer, 2015, pp. 159–180.
conference:
end_date: 2015-05-05
location: Lugano, Switzerland
name: 'ICITS: International Conference on Information Theoretic Security'
start_date: 2015-05-02
date_created: 2018-12-11T11:53:13Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:13Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-17470-9_10
ec_funded: 1
intvolume: ' 9063'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2015/315
month: '01'
oa: 1
oa_version: Submitted Version
page: 159 - 180
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5507'
quality_controlled: '1'
scopus_import: 1
status: public
title: Query-complexity amplification for random oracles
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9063
year: '2015'
...
---
_id: '1647'
abstract:
- lang: eng
text: Round-optimal blind signatures are notoriously hard to construct in the standard
model, especially in the malicious-signer model, where blindness must hold under
adversarially chosen keys. This is substantiated by several impossibility results.
The only construction that can be termed theoretically efficient, by Garg and
Gupta (Eurocrypt’14), requires complexity leveraging, inducing an exponential
security loss. We present a construction of practically efficient round-optimal
blind signatures in the standard model. It is conceptually simple and builds on
the recent structure-preserving signatures on equivalence classes (SPSEQ) from
Asiacrypt’14. While the traditional notion of blindness follows from standard
assumptions, we prove blindness under adversarially chosen keys under an interactive
variant of DDH. However, we neither require non-uniform assumptions nor complexity
leveraging. We then show how to extend our construction to partially blind signatures
and to blind signatures on message vectors, which yield a construction of one-show
anonymous credentials à la “anonymous credentials light” (CCS’13) in the standard
model. Furthermore, we give the first SPS-EQ construction under noninteractive
assumptions and show how SPS-EQ schemes imply conventional structure-preserving
signatures, which allows us to apply optimality results for the latter to SPS-EQ.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Christian
full_name: Hanser, Christian
last_name: Hanser
- first_name: Daniel
full_name: Slamanig, Daniel
last_name: Slamanig
citation:
ama: 'Fuchsbauer G, Hanser C, Slamanig D. Practical round-optimal blind signatures
in the standard model. In: Vol 9216. Springer; 2015:233-253. doi:10.1007/978-3-662-48000-7_12'
apa: 'Fuchsbauer, G., Hanser, C., & Slamanig, D. (2015). Practical round-optimal
blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at
the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States:
Springer. https://doi.org/10.1007/978-3-662-48000-7_12'
chicago: Fuchsbauer, Georg, Christian Hanser, and Daniel Slamanig. “Practical Round-Optimal
Blind Signatures in the Standard Model,” 9216:233–53. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_12.
ieee: 'G. Fuchsbauer, C. Hanser, and D. Slamanig, “Practical round-optimal blind
signatures in the standard model,” presented at the CRYPTO: International Cryptology
Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 233–253.'
ista: 'Fuchsbauer G, Hanser C, Slamanig D. 2015. Practical round-optimal blind signatures
in the standard model. CRYPTO: International Cryptology Conference, LNCS, vol.
9216, 233–253.'
mla: Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the
Standard Model. Vol. 9216, Springer, 2015, pp. 233–53, doi:10.1007/978-3-662-48000-7_12.
short: G. Fuchsbauer, C. Hanser, D. Slamanig, in:, Springer, 2015, pp. 233–253.
conference:
end_date: 2015-08-20
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2015-08-16
date_created: 2018-12-11T11:53:14Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2023-02-21T16:44:51Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48000-7_12
ec_funded: 1
intvolume: ' 9216'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2015/626.pdf
month: '08'
oa: 1
oa_version: Submitted Version
page: 233 - 253
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5503'
quality_controlled: '1'
related_material:
record:
- id: '1225'
relation: later_version
status: public
scopus_import: 1
status: public
title: Practical round-optimal blind signatures in the standard model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9216
year: '2015'
...
---
_id: '1645'
abstract:
- lang: eng
text: Secret-key constructions are often proved secure in a model where one or more
underlying components are replaced by an idealized oracle accessible to the attacker.
This model gives rise to information-theoretic security analyses, and several
advances have been made in this area over the last few years. This paper provides
a systematic overview of what is achievable in this model, and how existing works
fit into this view.
article_number: '7133163'
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Gazi P, Tessaro S. Secret-key cryptography from ideal primitives: A systematic
verview. In: 2015 IEEE Information Theory Workshop. IEEE; 2015. doi:10.1109/ITW.2015.7133163'
apa: 'Gazi, P., & Tessaro, S. (2015). Secret-key cryptography from ideal primitives:
A systematic verview. In 2015 IEEE Information Theory Workshop. Jerusalem,
Israel: IEEE. https://doi.org/10.1109/ITW.2015.7133163'
chicago: 'Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal
Primitives: A Systematic Verview.” In 2015 IEEE Information Theory Workshop.
IEEE, 2015. https://doi.org/10.1109/ITW.2015.7133163.'
ieee: 'P. Gazi and S. Tessaro, “Secret-key cryptography from ideal primitives: A
systematic verview,” in 2015 IEEE Information Theory Workshop, Jerusalem,
Israel, 2015.'
ista: 'Gazi P, Tessaro S. 2015. Secret-key cryptography from ideal primitives: A
systematic verview. 2015 IEEE Information Theory Workshop. ITW 2015: IEEE Information
Theory Workshop, 7133163.'
mla: 'Gazi, Peter, and Stefano Tessaro. “Secret-Key Cryptography from Ideal Primitives:
A Systematic Verview.” 2015 IEEE Information Theory Workshop, 7133163,
IEEE, 2015, doi:10.1109/ITW.2015.7133163.'
short: P. Gazi, S. Tessaro, in:, 2015 IEEE Information Theory Workshop, IEEE, 2015.
conference:
end_date: 2015-05-01
location: Jerusalem, Israel
name: 'ITW 2015: IEEE Information Theory Workshop'
start_date: 2015-04-26
date_created: 2018-12-11T11:53:13Z
date_published: 2015-06-24T00:00:00Z
date_updated: 2021-01-12T06:52:13Z
day: '24'
department:
- _id: KrPi
doi: 10.1109/ITW.2015.7133163
ec_funded: 1
language:
- iso: eng
month: '06'
oa_version: None
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: 2015 IEEE Information Theory Workshop
publication_status: published
publisher: IEEE
publist_id: '5506'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Secret-key cryptography from ideal primitives: A systematic verview'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1654'
abstract:
- lang: eng
text: "HMAC and its variant NMAC are the most popular approaches to deriving a MAC
(and more generally, a PRF) from a cryptographic hash function. Despite nearly
two decades of research, their exact security still remains far from understood
in many different contexts. Indeed, recent works have re-surfaced interest for
{\\em generic} attacks, i.e., attacks that treat the compression function of the
underlying hash function as a black box.\r\n\r\nGeneric security can be proved
in a model where the underlying compression function is modeled as a random function
-- yet, to date, the question of proving tight, non-trivial bounds on the generic
security of HMAC/NMAC even as a PRF remains a challenging open question.\r\n\r\nIn
this paper, we ask the question of whether a small modification to HMAC and NMAC
can allow us to exactly characterize the security of the resulting constructions,
while only incurring little penalty with respect to efficiency. To this end, we
present simple variants of NMAC and HMAC, for which we prove tight bounds on the
generic PRF security, expressed in terms of numbers of construction and compression
function queries necessary to break the construction. All of our constructions
are obtained via a (near) {\\em black-box} modification of NMAC and HMAC, which
can be interpreted as an initial step of key-dependent message pre-processing.\r\n\r\nWhile
our focus is on PRF security, a further attractive feature of our new constructions
is that they clearly defeat all recent generic attacks against properties such
as state recovery and universal forgery. These exploit properties of the so-called
``functional graph'' which are not directly accessible in our new constructions. "
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- 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: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: Gazi P, Pietrzak KZ, Tessaro S. Generic security of NMAC and HMAC with input
whitening. 2015;9453:85-109. doi:10.1007/978-3-662-48800-3_4
apa: 'Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). Generic security of NMAC
and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application
of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48800-3_4'
chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “Generic Security
of NMAC and HMAC with Input Whitening.” Lecture Notes in Computer Science. Springer,
2015. https://doi.org/10.1007/978-3-662-48800-3_4.
ieee: P. Gazi, K. Z. Pietrzak, and S. Tessaro, “Generic security of NMAC and HMAC
with input whitening,” vol. 9453. Springer, pp. 85–109, 2015.
ista: Gazi P, Pietrzak KZ, Tessaro S. 2015. Generic security of NMAC and HMAC with
input whitening. 9453, 85–109.
mla: Gazi, Peter, et al. Generic Security of NMAC and HMAC with Input Whitening.
Vol. 9453, Springer, 2015, pp. 85–109, doi:10.1007/978-3-662-48800-3_4.
short: P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.
conference:
end_date: 2015-12-03
location: Auckland, New Zealand
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
start_date: 2015-11-29
date_created: 2018-12-11T11:53:17Z
date_published: 2015-12-30T00:00:00Z
date_updated: 2021-01-12T06:52:16Z
day: '30'
ddc:
- '004'
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48800-3_4
ec_funded: 1
file:
- access_level: open_access
checksum: d1e53203db2d8573a560995ccdffac62
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:09Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4732'
file_name: IST-2016-676-v1+1_881.pdf
file_size: 512071
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9453'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
page: 85 - 109
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5496'
pubrep_id: '676'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Generic security of NMAC and HMAC with input whitening
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9453
year: '2015'
...
---
_id: '1650'
abstract:
- lang: eng
text: "We consider the task of deriving a key with high HILL entropy (i.e., being
computationally indistinguishable from a key with high min-entropy) from an unpredictable
source.\r\n\r\nPrevious to this work, the only known way to transform unpredictability
into a key that was ϵ indistinguishable from having min-entropy was via pseudorandomness,
for example by Goldreich-Levin (GL) hardcore bits. This approach has the inherent
limitation that from a source with k bits of unpredictability entropy one can
derive a key of length (and thus HILL entropy) at most k−2log(1/ϵ) bits. In many
settings, e.g. when dealing with biometric data, such a 2log(1/ϵ) bit entropy
loss in not an option. Our main technical contribution is a theorem that states
that in the high entropy regime, unpredictability implies HILL entropy. Concretely,
any variable K with |K|−d bits of unpredictability entropy has the same amount
of so called metric entropy (against real-valued, deterministic distinguishers),
which is known to imply the same amount of HILL entropy. The loss in circuit size
in this argument is exponential in the entropy gap d, and thus this result only
applies for small d (i.e., where the size of distinguishers considered is exponential
in d).\r\n\r\nTo overcome the above restriction, we investigate if it’s possible
to first “condense” unpredictability entropy and make the entropy gap small. We
show that any source with k bits of unpredictability can be condensed into a source
of length k with k−3 bits of unpredictability entropy. Our condenser simply “abuses"
the GL construction and derives a k bit key from a source with k bits of unpredicatibily.
The original GL theorem implies nothing when extracting that many bits, but we
show that in this regime, GL still behaves like a “condenser" for unpredictability.
This result comes with two caveats (1) the loss in circuit size is exponential
in k and (2) we require that the source we start with has no HILL entropy (equivalently,
one can efficiently check if a guess is correct). We leave it as an intriguing
open problem to overcome these restrictions or to prove they’re inherent."
alternative_title:
- LNCS
author:
- first_name: Maciej
full_name: Skórski, Maciej
last_name: Skórski
- first_name: Alexander
full_name: Golovnev, Alexander
last_name: Golovnev
- 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: 'Skórski M, Golovnev A, Pietrzak KZ. Condensed unpredictability . In: Vol 9134.
Springer; 2015:1046-1057. doi:10.1007/978-3-662-47672-7_85'
apa: 'Skórski, M., Golovnev, A., & Pietrzak, K. Z. (2015). Condensed unpredictability (Vol.
9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming,
Kyoto, Japan: Springer. https://doi.org/10.1007/978-3-662-47672-7_85'
chicago: Skórski, Maciej, Alexander Golovnev, and Krzysztof Z Pietrzak. “Condensed
Unpredictability ,” 9134:1046–57. Springer, 2015. https://doi.org/10.1007/978-3-662-47672-7_85.
ieee: 'M. Skórski, A. Golovnev, and K. Z. Pietrzak, “Condensed unpredictability
,” presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan,
2015, vol. 9134, pp. 1046–1057.'
ista: 'Skórski M, Golovnev A, Pietrzak KZ. 2015. Condensed unpredictability . ICALP:
Automata, Languages and Programming, LNCS, vol. 9134, 1046–1057.'
mla: Skórski, Maciej, et al. Condensed Unpredictability . Vol. 9134, Springer,
2015, pp. 1046–57, doi:10.1007/978-3-662-47672-7_85.
short: M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:15Z
date_published: 2015-06-20T00:00:00Z
date_updated: 2021-01-12T06:52:15Z
day: '20'
ddc:
- '000'
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-662-47672-7_85
ec_funded: 1
file:
- access_level: open_access
checksum: e808c7eecb631336fc9f9bf2e8d4ecae
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:32Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4693'
file_name: IST-2016-675-v1+1_384.pdf
file_size: 525503
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9134'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1046 - 1057
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5500'
pubrep_id: '675'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Condensed unpredictability '
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '1651'
abstract:
- lang: eng
text: Cryptographic e-cash allows off-line electronic transactions between a bank,
users and merchants in a secure and anonymous fashion. A plethora of e-cash constructions
has been proposed in the literature; however, these traditional e-cash schemes
only allow coins to be transferred once between users and merchants. Ideally,
we would like users to be able to transfer coins between each other multiple times
before deposit, as happens with physical cash. “Transferable” e-cash schemes are
the solution to this problem. Unfortunately, the currently proposed schemes are
either completely impractical or do not achieve the desirable anonymity properties
without compromises, such as assuming the existence of a trusted “judge” who can
trace all coins and users in the system. This paper presents the first efficient
and fully anonymous transferable e-cash scheme without any trusted third parties.
We start by revising the security and anonymity properties of transferable e-cash
to capture issues that were previously overlooked. For our construction we use
the recently proposed malleable signatures by Chase et al. to allow the secure
and anonymous transfer of coins, combined with a new efficient double-spending
detection mechanism. Finally, we discuss an instantiation of our construction.
acknowledgement: Work done as an intern in Microsoft Research Redmond and as a student
at Brown University, where supported by NSF grant 0964379. Supported by the European
Research Council, ERC Starting Grant (259668-PSPC).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Foteini
full_name: Baldimtsi, Foteini
last_name: Baldimtsi
- first_name: Melissa
full_name: Chase, Melissa
last_name: Chase
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Markulf
full_name: Kohlweiss, Markulf
last_name: Kohlweiss
citation:
ama: 'Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. Anonymous transferable e-cash.
In: Public-Key Cryptography - PKC 2015. Vol 9020. Springer; 2015:101-124.
doi:10.1007/978-3-662-46447-2_5'
apa: 'Baldimtsi, F., Chase, M., Fuchsbauer, G., & Kohlweiss, M. (2015). Anonymous
transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020,
pp. 101–124). Gaithersburg, MD, United States: Springer. https://doi.org/10.1007/978-3-662-46447-2_5'
chicago: Baldimtsi, Foteini, Melissa Chase, Georg Fuchsbauer, and Markulf Kohlweiss.
“Anonymous Transferable E-Cash.” In Public-Key Cryptography - PKC 2015,
9020:101–24. Springer, 2015. https://doi.org/10.1007/978-3-662-46447-2_5.
ieee: F. Baldimtsi, M. Chase, G. Fuchsbauer, and M. Kohlweiss, “Anonymous transferable
e-cash,” in Public-Key Cryptography - PKC 2015, Gaithersburg, MD, United
States, 2015, vol. 9020, pp. 101–124.
ista: 'Baldimtsi F, Chase M, Fuchsbauer G, Kohlweiss M. 2015. Anonymous transferable
e-cash. Public-Key Cryptography - PKC 2015. PKC: Public Key Crypography, LNCS,
vol. 9020, 101–124.'
mla: Baldimtsi, Foteini, et al. “Anonymous Transferable E-Cash.” Public-Key Cryptography
- PKC 2015, vol. 9020, Springer, 2015, pp. 101–24, doi:10.1007/978-3-662-46447-2_5.
short: F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography
- PKC 2015, Springer, 2015, pp. 101–124.
conference:
end_date: 2015-04-01
location: Gaithersburg, MD, United States
name: 'PKC: Public Key Crypography'
start_date: 2015-03-30
date_created: 2018-12-11T11:53:15Z
date_published: 2015-03-17T00:00:00Z
date_updated: 2022-05-23T10:08:37Z
day: '17'
department:
- _id: KrPi
doi: 10.1007/978-3-662-46447-2_5
ec_funded: 1
intvolume: ' 9020'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-3-662-46447-2_5
month: '03'
oa: 1
oa_version: Published Version
page: 101 - 124
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Public-Key Cryptography - PKC 2015
publication_identifier:
isbn:
- 978-3-662-46446-5
publication_status: published
publisher: Springer
publist_id: '5499'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anonymous transferable e-cash
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9020
year: '2015'
...
---
_id: '1652'
abstract:
- lang: eng
text: We develop new theoretical tools for proving lower-bounds on the (amortized)
complexity of certain functions in models of parallel computation. We apply the
tools to construct a class of functions with high amortized memory complexity
in the parallel Random Oracle Model (pROM); a variant of the standard ROM allowing
for batches of simultaneous queries. In particular we obtain a new, more robust,
type of Memory-Hard Functions (MHF); a security primitive which has recently been
gaining acceptance in practice as an effective means of countering brute-force
attacks on security relevant functions. Along the way we also demonstrate an important
shortcoming of previous definitions of MHFs and give a new definition addressing
the problem. The tools we develop represent an adaptation of the powerful pebbling
paradigm (initially introduced by Hewitt and Paterson [HP70] and Cook [Coo73])
to a simple and intuitive parallel setting. We define a simple pebbling game Gp
over graphs which aims to abstract parallel computation in an intuitive way. As
a conceptual contribution we define a measure of pebbling complexity for graphs
called cumulative complexity (CC) and show how it overcomes a crucial shortcoming
(in the parallel setting) exhibited by more traditional complexity measures used
in the past. As a main technical contribution we give an explicit construction
of a constant in-degree family of graphs whose CC in Gp approaches maximality
to within a polylogarithmic factor for any graph of equal size (analogous to the
graphs of Tarjan et. al. [PTC76, LT82] for sequential pebbling games). Finally,
for a given graph G and related function fG, we derive a lower-bound on the amortized
memory complexity of fG in the pROM in terms of the CC of G in the game Gp.
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Vladimir
full_name: Serbinenko, Vladimir
last_name: Serbinenko
citation:
ama: 'Alwen JF, Serbinenko V. High parallel complexity graphs and memory-hard functions.
In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing.
ACM; 2015:595-603. doi:10.1145/2746539.2746622'
apa: 'Alwen, J. F., & Serbinenko, V. (2015). High parallel complexity graphs
and memory-hard functions. In Proceedings of the 47th annual ACM symposium
on Theory of computing (pp. 595–603). Portland, OR, United States: ACM. https://doi.org/10.1145/2746539.2746622'
chicago: Alwen, Joel F, and Vladimir Serbinenko. “High Parallel Complexity Graphs
and Memory-Hard Functions.” In Proceedings of the 47th Annual ACM Symposium
on Theory of Computing, 595–603. ACM, 2015. https://doi.org/10.1145/2746539.2746622.
ieee: J. F. Alwen and V. Serbinenko, “High parallel complexity graphs and memory-hard
functions,” in Proceedings of the 47th annual ACM symposium on Theory of computing,
Portland, OR, United States, 2015, pp. 595–603.
ista: 'Alwen JF, Serbinenko V. 2015. High parallel complexity graphs and memory-hard
functions. Proceedings of the 47th annual ACM symposium on Theory of computing.
STOC: Symposium on the Theory of Computing, 595–603.'
mla: Alwen, Joel F., and Vladimir Serbinenko. “High Parallel Complexity Graphs and
Memory-Hard Functions.” Proceedings of the 47th Annual ACM Symposium on Theory
of Computing, ACM, 2015, pp. 595–603, doi:10.1145/2746539.2746622.
short: J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium
on Theory of Computing, ACM, 2015, pp. 595–603.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on the Theory of Computing'
start_date: 2015-06-14
date_created: 2018-12-11T11:53:16Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:52:16Z
day: '01'
department:
- _id: KrPi
doi: 10.1145/2746539.2746622
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2014/238
month: '06'
oa: 1
oa_version: Submitted Version
page: 595 - 603
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Proceedings of the 47th annual ACM symposium on Theory of computing
publication_status: published
publisher: ACM
publist_id: '5498'
quality_controlled: '1'
scopus_import: 1
status: public
title: High parallel complexity graphs and memory-hard functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1658'
abstract:
- lang: eng
text: Continuous-time Markov chain (CTMC) models have become a central tool for
understanding the dynamics of complex reaction networks and the importance of
stochasticity in the underlying biochemical processes. When such models are employed
to answer questions in applications, in order to ensure that the model provides
a sufficiently accurate representation of the real system, it is of vital importance
that the model parameters are inferred from real measured data. This, however,
is often a formidable task and all of the existing methods fail in one case or
the other, usually because the underlying CTMC model is high-dimensional and computationally
difficult to analyze. The parameter inference methods that tend to scale best
in the dimension of the CTMC are based on so-called moment closure approximations.
However, there exists a large number of different moment closure approximations
and it is typically hard to say a priori which of the approximations is the most
suitable for the inference procedure. Here, we propose a moment-based parameter
inference method that automatically chooses the most appropriate moment closure
method. Accordingly, contrary to existing methods, the user is not required to
be experienced in moment closure techniques. In addition to that, our method adaptively
changes the approximation during the parameter inference to ensure that always
the best approximation is used, even in cases where different approximations are
best in different regions of the parameter space.
alternative_title:
- LNCS
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- 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: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Christian
full_name: Schilling, Christian
last_name: Schilling
citation:
ama: Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. Adaptive moment
closure for parameter inference of biochemical reaction networks. 2015;9308:77-89.
doi:10.1007/978-3-319-23401-4_8
apa: 'Bogomolov, S., Henzinger, T. A., Podelski, A., Ruess, J., & Schilling,
C. (2015). Adaptive moment closure for parameter inference of biochemical reaction
networks. Presented at the CMSB: Computational Methods in Systems Biology, Nantes,
France: Springer. https://doi.org/10.1007/978-3-319-23401-4_8'
chicago: Bogomolov, Sergiy, Thomas A Henzinger, Andreas Podelski, Jakob Ruess, and
Christian Schilling. “Adaptive Moment Closure for Parameter Inference of Biochemical
Reaction Networks.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-23401-4_8.
ieee: S. Bogomolov, T. A. Henzinger, A. Podelski, J. Ruess, and C. Schilling, “Adaptive
moment closure for parameter inference of biochemical reaction networks,” vol.
9308. Springer, pp. 77–89, 2015.
ista: Bogomolov S, Henzinger TA, Podelski A, Ruess J, Schilling C. 2015. Adaptive
moment closure for parameter inference of biochemical reaction networks. 9308,
77–89.
mla: Bogomolov, Sergiy, et al. Adaptive Moment Closure for Parameter Inference
of Biochemical Reaction Networks. Vol. 9308, Springer, 2015, pp. 77–89, doi:10.1007/978-3-319-23401-4_8.
short: S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, C. Schilling, 9308 (2015)
77–89.
conference:
end_date: 2015-09-18
location: Nantes, France
name: 'CMSB: Computational Methods in Systems Biology'
start_date: 2015-09-16
date_created: 2018-12-11T11:53:18Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2023-02-21T16:17:24Z
day: '01'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1007/978-3-319-23401-4_8
ec_funded: 1
intvolume: ' 9308'
language:
- iso: eng
month: '09'
oa_version: None
page: 77 - 89
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5492'
quality_controlled: '1'
related_material:
record:
- id: '1148'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Adaptive moment closure for parameter inference of biochemical reaction networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9308
year: '2015'
...
---
_id: '1660'
abstract:
- lang: eng
text: We study the pattern frequency vector for runs in probabilistic Vector Addition
Systems with States (pVASS). Intuitively, each configuration of a given pVASS
is assigned one of finitely many patterns, and every run can thus be seen as an
infinite sequence of these patterns. The pattern frequency vector assigns to each
run the limit of pattern frequencies computed for longer and longer prefixes of
the run. If the limit does not exist, then the vector is undefined. We show that
for one-counter pVASS, the pattern frequency vector is defined and takes one of
finitely many values for almost all runs. Further, these values and their associated
probabilities can be approximated up to an arbitrarily small relative error in
polynomial time. For stable two-counter pVASS, we show the same result, but we
do not provide any upper complexity bound. As a byproduct of our study, we discover
counterexamples falsifying some classical results about stochastic Petri nets
published in the 80s.
alternative_title:
- LICS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Stefan
full_name: Kiefer, Stefan
last_name: Kiefer
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
citation:
ama: 'Brázdil T, Kiefer S, Kučera A, Novotný P. Long-run average behaviour of probabilistic
vector addition systems. In: IEEE; 2015:44-55. doi:10.1109/LICS.2015.15'
apa: 'Brázdil, T., Kiefer, S., Kučera, A., & Novotný, P. (2015). Long-run average
behaviour of probabilistic vector addition systems (pp. 44–55). Presented at the
LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.15'
chicago: Brázdil, Tomáš, Stefan Kiefer, Antonín Kučera, and Petr Novotný. “Long-Run
Average Behaviour of Probabilistic Vector Addition Systems,” 44–55. IEEE, 2015.
https://doi.org/10.1109/LICS.2015.15.
ieee: 'T. Brázdil, S. Kiefer, A. Kučera, and P. Novotný, “Long-run average behaviour
of probabilistic vector addition systems,” presented at the LICS: Logic in Computer
Science, Kyoto, Japan, 2015, pp. 44–55.'
ista: 'Brázdil T, Kiefer S, Kučera A, Novotný P. 2015. Long-run average behaviour
of probabilistic vector addition systems. LICS: Logic in Computer Science, LICS,
, 44–55.'
mla: Brázdil, Tomáš, et al. Long-Run Average Behaviour of Probabilistic Vector
Addition Systems. IEEE, 2015, pp. 44–55, doi:10.1109/LICS.2015.15.
short: T. Brázdil, S. Kiefer, A. Kučera, P. Novotný, in:, IEEE, 2015, pp. 44–55.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:19Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2021-01-12T06:52:20Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2015.15
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1505.02655
month: '07'
oa: 1
oa_version: Preprint
page: 44 - 55
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: IEEE
publist_id: '5490'
quality_controlled: '1'
scopus_import: 1
status: public
title: Long-run average behaviour of probabilistic vector addition systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1665'
abstract:
- lang: eng
text: Which genetic alterations drive tumorigenesis and how they evolve over the
course of disease and therapy are central questions in cancer biology. Here we
identify 44 recurrently mutated genes and 11 recurrent somatic copy number variations
through whole-exome sequencing of 538 chronic lymphocytic leukaemia (CLL) and
matched germline DNA samples, 278 of which were collected in a prospective clinical
trial. These include previously unrecognized putative cancer drivers (RPS15, IKZF3),
and collectively identify RNA processing and export, MYC activity, and MAPK signalling
as central pathways involved in CLL. Clonality analysis of this large data set
further enabled reconstruction of temporal relationships between driver events.
Direct comparison between matched pre-treatment and relapse samples from 59 patients
demonstrated highly frequent clonal evolution. Thus, large sequencing data sets
of clinically informative samples enable the discovery of novel genes associated
with cancer, the network of relationships between the driver events, and their
impact on disease relapse and clinical outcome.
article_processing_charge: No
article_type: original
author:
- first_name: Dan
full_name: Landau, Dan
last_name: Landau
- first_name: Eugen
full_name: Tausch, Eugen
last_name: Tausch
- first_name: Amaro
full_name: Taylor Weiner, Amaro
last_name: Taylor Weiner
- first_name: Chip
full_name: Stewart, Chip
last_name: Stewart
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Jasmin
full_name: Bahlo, Jasmin
last_name: Bahlo
- first_name: Sandra
full_name: Kluth, Sandra
last_name: Kluth
- first_name: Ivana
full_name: Božić, Ivana
last_name: Božić
- first_name: Michael
full_name: Lawrence, Michael
last_name: Lawrence
- first_name: Sebastian
full_name: Böttcher, Sebastian
last_name: Böttcher
- first_name: Scott
full_name: Carter, Scott
last_name: Carter
- first_name: Kristian
full_name: Cibulskis, Kristian
last_name: Cibulskis
- first_name: Daniel
full_name: Mertens, Daniel
last_name: Mertens
- first_name: Carrie
full_name: Sougnez, Carrie
last_name: Sougnez
- first_name: Mara
full_name: Rosenberg, Mara
last_name: Rosenberg
- first_name: Julian
full_name: Hess, Julian
last_name: Hess
- first_name: Jennifer
full_name: Edelmann, Jennifer
last_name: Edelmann
- first_name: Sabrina
full_name: Kless, Sabrina
last_name: Kless
- first_name: Michael
full_name: Kneba, Michael
last_name: Kneba
- first_name: Matthias
full_name: Ritgen, Matthias
last_name: Ritgen
- first_name: Anna
full_name: Fink, Anna
last_name: Fink
- first_name: Kirsten
full_name: Fischer, Kirsten
last_name: Fischer
- first_name: Stacey
full_name: Gabriel, Stacey
last_name: Gabriel
- first_name: Eric
full_name: Lander, Eric
last_name: Lander
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
- first_name: Hartmut
full_name: Döhner, Hartmut
last_name: Döhner
- first_name: Michael
full_name: Hallek, Michael
last_name: Hallek
- first_name: Donna
full_name: Neuberg, Donna
last_name: Neuberg
- first_name: Gad
full_name: Getz, Gad
last_name: Getz
- first_name: Stephan
full_name: Stilgenbauer, Stephan
last_name: Stilgenbauer
- first_name: Catherine
full_name: Wu, Catherine
last_name: Wu
citation:
ama: Landau D, Tausch E, Taylor Weiner A, et al. Mutations driving CLL and their
evolution in progression and relapse. Nature. 2015;526(7574):525-530. doi:10.1038/nature15395
apa: Landau, D., Tausch, E., Taylor Weiner, A., Stewart, C., Reiter, J., Bahlo,
J., … Wu, C. (2015). Mutations driving CLL and their evolution in progression
and relapse. Nature. Nature Publishing Group. https://doi.org/10.1038/nature15395
chicago: Landau, Dan, Eugen Tausch, Amaro Taylor Weiner, Chip Stewart, Johannes
Reiter, Jasmin Bahlo, Sandra Kluth, et al. “Mutations Driving CLL and Their Evolution
in Progression and Relapse.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature15395.
ieee: D. Landau et al., “Mutations driving CLL and their evolution in progression
and relapse,” Nature, vol. 526, no. 7574. Nature Publishing Group, pp.
525–530, 2015.
ista: Landau D, Tausch E, Taylor Weiner A, Stewart C, Reiter J, Bahlo J, Kluth S,
Božić I, Lawrence M, Böttcher S, Carter S, Cibulskis K, Mertens D, Sougnez C,
Rosenberg M, Hess J, Edelmann J, Kless S, Kneba M, Ritgen M, Fink A, Fischer K,
Gabriel S, Lander E, Nowak M, Döhner H, Hallek M, Neuberg D, Getz G, Stilgenbauer
S, Wu C. 2015. Mutations driving CLL and their evolution in progression and relapse.
Nature. 526(7574), 525–530.
mla: Landau, Dan, et al. “Mutations Driving CLL and Their Evolution in Progression
and Relapse.” Nature, vol. 526, no. 7574, Nature Publishing Group, 2015,
pp. 525–30, doi:10.1038/nature15395.
short: D. Landau, E. Tausch, A. Taylor Weiner, C. Stewart, J. Reiter, J. Bahlo,
S. Kluth, I. Božić, M. Lawrence, S. Böttcher, S. Carter, K. Cibulskis, D. Mertens,
C. Sougnez, M. Rosenberg, J. Hess, J. Edelmann, S. Kless, M. Kneba, M. Ritgen,
A. Fink, K. Fischer, S. Gabriel, E. Lander, M. Nowak, H. Döhner, M. Hallek, D.
Neuberg, G. Getz, S. Stilgenbauer, C. Wu, Nature 526 (2015) 525–530.
date_created: 2018-12-11T11:53:21Z
date_published: 2015-10-22T00:00:00Z
date_updated: 2021-01-12T06:52:23Z
day: '22'
department:
- _id: KrCh
doi: 10.1038/nature15395
ec_funded: 1
external_id:
pmid:
- '26466571'
intvolume: ' 526'
issue: '7574'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4815041/
month: '10'
oa: 1
oa_version: Submitted Version
page: 525 - 530
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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5484'
quality_controlled: '1'
scopus_import: 1
status: public
title: Mutations driving CLL and their evolution in progression and relapse
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 526
year: '2015'
...
---
_id: '1663'
abstract:
- lang: eng
text: CREB-binding protein (CBP) and p300 are transcriptional coactivators involved
in numerous biological processes that affect cell growth, transformation, differentiation,
and development. In this study, we provide evidence of the involvement of homeodomain-interacting
protein kinase 2 (HIPK2) in the regulation of CBP activity. We show that HIPK2
interacts with and phosphorylates several regions of CBP. We demonstrate that
serines 2361, 2363, 2371, 2376, and 2381 are responsible for the HIPK2-induced
mobility shift of CBP C-terminal activation domain. Moreover, we show that HIPK2
strongly potentiates the transcriptional activity of CBP. However, our data suggest
that HIPK2 activates CBP mainly by counteracting the repressive action of cell
cycle regulatory domain 1 (CRD1), located between amino acids 977 and 1076, independently
of CBP phosphorylation. Our findings thus highlight a complex regulation of CBP
activity by HIPK2, which might be relevant for the control of specific sets of
target genes involved in cellular proliferation, differentiation and apoptosis.
author:
- first_name: Krisztián
full_name: Kovács, Krisztián
id: 2AB5821E-F248-11E8-B48F-1D18A9856A87
last_name: Kovács
- first_name: Myriam
full_name: Steinmann, Myriam
last_name: Steinmann
- first_name: Olivier
full_name: Halfon, Olivier
last_name: Halfon
- first_name: Pierre
full_name: Magistretti, Pierre
last_name: Magistretti
- first_name: Jean
full_name: Cardinaux, Jean
last_name: Cardinaux
citation:
ama: Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. Complex regulation
of CREB-binding protein by homeodomain-interacting protein kinase 2. Cellular
Signalling. 2015;27(11):2252-2260. doi:10.1016/j.cellsig.2015.08.001
apa: Kovács, K., Steinmann, M., Halfon, O., Magistretti, P., & Cardinaux, J.
(2015). Complex regulation of CREB-binding protein by homeodomain-interacting
protein kinase 2. Cellular Signalling. Elsevier. https://doi.org/10.1016/j.cellsig.2015.08.001
chicago: Kovács, Krisztián, Myriam Steinmann, Olivier Halfon, Pierre Magistretti,
and Jean Cardinaux. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting
Protein Kinase 2.” Cellular Signalling. Elsevier, 2015. https://doi.org/10.1016/j.cellsig.2015.08.001.
ieee: K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, and J. Cardinaux, “Complex
regulation of CREB-binding protein by homeodomain-interacting protein kinase 2,”
Cellular Signalling, vol. 27, no. 11. Elsevier, pp. 2252–2260, 2015.
ista: Kovács K, Steinmann M, Halfon O, Magistretti P, Cardinaux J. 2015. Complex
regulation of CREB-binding protein by homeodomain-interacting protein kinase 2.
Cellular Signalling. 27(11), 2252–2260.
mla: Kovács, Krisztián, et al. “Complex Regulation of CREB-Binding Protein by Homeodomain-Interacting
Protein Kinase 2.” Cellular Signalling, vol. 27, no. 11, Elsevier, 2015,
pp. 2252–60, doi:10.1016/j.cellsig.2015.08.001.
short: K. Kovács, M. Steinmann, O. Halfon, P. Magistretti, J. Cardinaux, Cellular
Signalling 27 (2015) 2252–2260.
date_created: 2018-12-11T11:53:20Z
date_published: 2015-11-01T00:00:00Z
date_updated: 2021-01-12T06:52:22Z
day: '01'
ddc:
- '570'
department:
- _id: JoCs
doi: 10.1016/j.cellsig.2015.08.001
ec_funded: 1
file:
- access_level: local
checksum: 4ee690b6444b7a43523237f0941457d1
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:03Z
date_updated: 2020-07-14T12:45:10Z
file_id: '5321'
file_name: IST-2016-578-v1+1_CLS-D-15-00072R1_.pdf
file_size: 1735337
relation: main_file
file_date_updated: 2020-07-14T12:45:10Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '11'
language:
- iso: eng
month: '11'
oa_version: Published Version
page: 2252 - 2260
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Cellular Signalling
publication_status: published
publisher: Elsevier
publist_id: '5487'
pubrep_id: '578'
quality_controlled: '1'
scopus_import: 1
status: public
title: Complex regulation of CREB-binding protein by homeodomain-interacting protein
kinase 2
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: 27
year: '2015'
...
---
_id: '1667'
abstract:
- lang: eng
text: We consider parametric version of fixed-delay continuoustime Markov chains
(or equivalently deterministic and stochastic Petri nets, DSPN) where fixed-delay
transitions are specified by parameters, rather than concrete values. Our goal
is to synthesize values of these parameters that, for a given cost function, minimise
expected total cost incurred before reaching a given set of target states. We
show that under mild assumptions, optimal values of parameters can be effectively
approximated using translation to a Markov decision process (MDP) whose actions
correspond to discretized values of these parameters. To this end we identify
and overcome several interesting phenomena arising in systems with fixed delays.
acknowledgement: The research leading to these results has received funding from the
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement n∘ [291734]. This work is partly
supported by the German Research Council (DFG) as part of the Transregional Collaborative
Research Center AVACS (SFB/TR 14), by the EU 7th Framework Programme under grant
agreement no. 295261 (MEALS) and 318490 (SENSATION), by the Czech Science Foundation,
grant No. 15-17564S, and by the CAS/SAFEA International Partnership Program for
Creative Research Teams.
alternative_title:
- LNCS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: L'Uboš
full_name: Korenčiak, L'Uboš
last_name: Korenčiak
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Petr
full_name: Novotny, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotny
- first_name: Vojtěch
full_name: Řehák, Vojtěch
last_name: Řehák
citation:
ama: Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. Optimizing performance
of continuous-time stochastic systems using timeout synthesis. 2015;9259:141-159.
doi:10.1007/978-3-319-22264-6_10
apa: 'Brázdil, T., Korenčiak, L., Krčál, J., Novotný, P., & Řehák, V. (2015).
Optimizing performance of continuous-time stochastic systems using timeout synthesis.
Presented at the QEST: Quantitative Evaluation of Systems, Madrid, Spain: Springer.
https://doi.org/10.1007/978-3-319-22264-6_10'
chicago: Brázdil, Tomáš, L’Uboš Korenčiak, Jan Krčál, Petr Novotný, and Vojtěch
Řehák. “Optimizing Performance of Continuous-Time Stochastic Systems Using Timeout
Synthesis.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22264-6_10.
ieee: T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, and V. Řehák, “Optimizing
performance of continuous-time stochastic systems using timeout synthesis,” vol.
9259. Springer, pp. 141–159, 2015.
ista: Brázdil T, Korenčiak L, Krčál J, Novotný P, Řehák V. 2015. Optimizing performance
of continuous-time stochastic systems using timeout synthesis. 9259, 141–159.
mla: Brázdil, Tomáš, et al. Optimizing Performance of Continuous-Time Stochastic
Systems Using Timeout Synthesis. Vol. 9259, Springer, 2015, pp. 141–59, doi:10.1007/978-3-319-22264-6_10.
short: T. Brázdil, L. Korenčiak, J. Krčál, P. Novotný, V. Řehák, 9259 (2015) 141–159.
conference:
end_date: 2015-09-03
location: Madrid, Spain
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2015-09-01
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-22T00:00:00Z
date_updated: 2021-01-12T06:52:24Z
day: '22'
department:
- _id: KrCh
doi: 10.1007/978-3-319-22264-6_10
ec_funded: 1
intvolume: ' 9259'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.4777
month: '08'
oa: 1
oa_version: Preprint
page: 141 - 159
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5482'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Optimizing performance of continuous-time stochastic systems using timeout
synthesis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9259
year: '2015'
...
---
_id: '1664'
abstract:
- lang: eng
text: Over a century of research into the origin of turbulence in wall-bounded shear
flows has resulted in a puzzling picture in which turbulence appears in a variety
of different states competing with laminar background flow. At moderate flow speeds,
turbulence is confined to localized patches; it is only at higher speeds that
the entire flow becomes turbulent. The origin of the different states encountered
during this transition, the front dynamics of the turbulent regions and the transformation
to full turbulence have yet to be explained. By combining experiments, theory
and computer simulations, here we uncover a bifurcation scenario that explains
the transformation to fully turbulent pipe flow and describe the front dynamics
of the different states encountered in the process. Key to resolving this problem
is the interpretation of the flow as a bistable system with nonlinear propagation
(advection) of turbulent fronts. These findings bridge the gap between our understanding
of the onset of turbulence and fully turbulent flows.
acknowledgement: We acknowledge the Deutsche Forschungsgemeinschaft (Project No. FOR
1182), and the European Research Council under the European Union’s Seventh Framework
Programme (FP/2007-2013)/ERC Grant Agreement 306589 for financial support. B.S.
acknowledges financial support from the Chinese State Scholarship Fund under grant
number 2010629145. B.S. acknowledges support from the International Max Planck Research
School for the Physics of Biological and Complex Systems and the Göttingen Graduate
School for Neurosciences and Molecular Biosciences. We acknowledge computing resources
from GWDG (Gesellschaft für wissenschaftliche Datenverarbeitung Göttingen) and the
Jülich Supercomputing Centre (grant HGU16) where the simulations were performed.
author:
- first_name: Dwight
full_name: Barkley, Dwight
last_name: Barkley
- first_name: Baofang
full_name: Song, Baofang
last_name: Song
- first_name: Mukund
full_name: Vasudevan, Mukund
id: 3C5A959A-F248-11E8-B48F-1D18A9856A87
last_name: Vasudevan
- first_name: Grégoire M
full_name: Lemoult, Grégoire M
id: 4787FE80-F248-11E8-B48F-1D18A9856A87
last_name: Lemoult
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. The rise of fully
turbulent flow. Nature. 2015;526(7574):550-553. doi:10.1038/nature15701
apa: Barkley, D., Song, B., Vasudevan, M., Lemoult, G. M., Avila, M., & Hof,
B. (2015). The rise of fully turbulent flow. Nature. Nature Publishing
Group. https://doi.org/10.1038/nature15701
chicago: Barkley, Dwight, Baofang Song, Mukund Vasudevan, Grégoire M Lemoult, Marc
Avila, and Björn Hof. “The Rise of Fully Turbulent Flow.” Nature. Nature
Publishing Group, 2015. https://doi.org/10.1038/nature15701.
ieee: D. Barkley, B. Song, M. Vasudevan, G. M. Lemoult, M. Avila, and B. Hof, “The
rise of fully turbulent flow,” Nature, vol. 526, no. 7574. Nature Publishing
Group, pp. 550–553, 2015.
ista: Barkley D, Song B, Vasudevan M, Lemoult GM, Avila M, Hof B. 2015. The rise
of fully turbulent flow. Nature. 526(7574), 550–553.
mla: Barkley, Dwight, et al. “The Rise of Fully Turbulent Flow.” Nature,
vol. 526, no. 7574, Nature Publishing Group, 2015, pp. 550–53, doi:10.1038/nature15701.
short: D. Barkley, B. Song, M. Vasudevan, G.M. Lemoult, M. Avila, B. Hof, Nature
526 (2015) 550–553.
date_created: 2018-12-11T11:53:20Z
date_published: 2015-10-21T00:00:00Z
date_updated: 2021-01-12T06:52:22Z
day: '21'
department:
- _id: BjHo
doi: 10.1038/nature15701
ec_funded: 1
intvolume: ' 526'
issue: '7574'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.09143
month: '10'
oa: 1
oa_version: Preprint
page: 550 - 553
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5485'
quality_controlled: '1'
scopus_import: 1
status: public
title: The rise of fully turbulent flow
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 526
year: '2015'
...
---
_id: '1672'
abstract:
- lang: eng
text: Composable notions of incoercibility aim to forbid a coercer from using anything
beyond the coerced parties’ inputs and outputs to catch them when they try to
deceive him. Existing definitions are restricted to weak coercion types, and/or
are not universally composable. Furthermore, they often make too strong assumptions
on the knowledge of coerced parties—e.g., they assume they known the identities
and/or the strategies of other coerced parties, or those of corrupted parties—
which makes them unsuitable for applications of incoercibility such as e-voting,
where colluding adversarial parties may attempt to coerce honest voters, e.g.,
by offering them money for a promised vote, and use their own view to check that
the voter keeps his end of the bargain. In this work we put forward the first
universally composable notion of incoercible multi-party computation, which satisfies
the above intuition and does not assume collusions among coerced parties or knowledge
of the corrupted set. We define natural notions of UC incoercibility corresponding
to standard coercion-types, i.e., receipt-freeness and resistance to full-active
coercion. Importantly, our suggested notion has the unique property that it builds
on top of the well studied UC framework by Canetti instead of modifying it. This
guarantees backwards compatibility, and allows us to inherit results from the
rich UC literature. We then present MPC protocols which realize our notions of
UC incoercibility given access to an arguably minimal setup—namely honestly generate
tamper-proof hardware performing a very simple cryptographic operation—e.g., a
smart card. This is, to our knowledge, the first proposed construction of an MPC
protocol (for more than two parties) that is incoercibly secure and universally
composable, and therefore the first construction of a universally composable receipt-free
e-voting protocol.
acknowledgement: Joël Alwen was supported by the ERC starting grant (259668-PSPC).
Rafail Ostrovsky was supported in part by NSF grants 09165174, 1065276, 1118126
and 1136174, US-Israel BSF grant 2008411, OKAWA Foundation Research Award, IBM Faculty
Research Award, Xerox Faculty Research Award, B. John Garrick Foundation Award,
Teradata Research Award, Lockheed-Martin Corporation Research Award, and the Defense
Advanced Research Projects Agency through the U.S. Office of Naval Research under
Contract N00014 -11 -1-0392. The views expressed are those of the author and do
not reflect the official policy or position of the Department of Defense or the
U.S. Government. Vassilis Zikas was supported in part by the Swiss National Science
Foundation (SNF) via the Ambizione grant PZ00P-2142549.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Rafail
full_name: Ostrovsky, Rafail
last_name: Ostrovsky
- first_name: Hongsheng
full_name: Zhou, Hongsheng
last_name: Zhou
- first_name: Vassilis
full_name: Zikas, Vassilis
last_name: Zikas
citation:
ama: 'Alwen JF, Ostrovsky R, Zhou H, Zikas V. Incoercible multi-party computation
and universally composable receipt-free voting. In: Advances in Cryptology
- CRYPTO 2015. Vol 9216. Lecture Notes in Computer Science. Springer; 2015:763-780.
doi:10.1007/978-3-662-48000-7_37'
apa: 'Alwen, J. F., Ostrovsky, R., Zhou, H., & Zikas, V. (2015). Incoercible
multi-party computation and universally composable receipt-free voting. In Advances
in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United
States: Springer. https://doi.org/10.1007/978-3-662-48000-7_37'
chicago: Alwen, Joel F, Rafail Ostrovsky, Hongsheng Zhou, and Vassilis Zikas. “Incoercible
Multi-Party Computation and Universally Composable Receipt-Free Voting.” In Advances
in Cryptology - CRYPTO 2015, 9216:763–80. Lecture Notes in Computer Science.
Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_37.
ieee: J. F. Alwen, R. Ostrovsky, H. Zhou, and V. Zikas, “Incoercible multi-party
computation and universally composable receipt-free voting,” in Advances in
Cryptology - CRYPTO 2015, Santa Barbara, CA, United States, 2015, vol. 9216,
pp. 763–780.
ista: 'Alwen JF, Ostrovsky R, Zhou H, Zikas V. 2015. Incoercible multi-party computation
and universally composable receipt-free voting. Advances in Cryptology - CRYPTO
2015. CRYPTO: International Cryptology ConferenceLecture Notes in Computer Science,
LNCS, vol. 9216, 763–780.'
mla: Alwen, Joel F., et al. “Incoercible Multi-Party Computation and Universally
Composable Receipt-Free Voting.” Advances in Cryptology - CRYPTO 2015,
vol. 9216, Springer, 2015, pp. 763–80, doi:10.1007/978-3-662-48000-7_37.
short: J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology
- CRYPTO 2015, Springer, 2015, pp. 763–780.
conference:
end_date: 2015-08-20
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2015-08-16
date_created: 2018-12-11T11:53:23Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2022-06-07T09:51:55Z
day: '01'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48000-7_37
ec_funded: 1
file:
- access_level: open_access
checksum: 5b6649e80d1f781a8910f7cce6427f78
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:55:29Z
date_updated: 2020-07-14T12:45:11Z
file_id: '7853'
file_name: 2015_CRYPTO_Alwen.pdf
file_size: 397363
relation: main_file
file_date_updated: 2020-07-14T12:45:11Z
has_accepted_license: '1'
intvolume: ' 9216'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 763 - 780
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Advances in Cryptology - CRYPTO 2015
publication_identifier:
eisbn:
- 978-3-662-48000-7
isbn:
- 978-3-662-47999-5
publication_status: published
publisher: Springer
publist_id: '5476'
quality_controlled: '1'
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Incoercible multi-party computation and universally composable receipt-free
voting
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9216
year: '2015'
...
---
_id: '1669'
abstract:
- lang: eng
text: Computational notions of entropy (a.k.a. pseudoentropy) have found many applications,
including leakage-resilient cryptography, deterministic encryption or memory delegation.
The most important tools to argue about pseudoentropy are chain rules, which quantify
by how much (in terms of quantity and quality) the pseudoentropy of a given random
variable X decreases when conditioned on some other variable Z (think for example
of X as a secret key and Z as information leaked by a side-channel). In this paper
we give a very simple and modular proof of the chain rule for HILL pseudoentropy,
improving best known parameters. Our version allows for increasing the acceptable
length of leakage in applications up to a constant factor compared to the best
previous bounds. As a contribution of independent interest, we provide a comprehensive
study of all known versions of the chain rule, comparing their worst-case strength
and limitations.
alternative_title:
- LNCS
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
last_name: Skórski
citation:
ama: Pietrzak KZ, Skórski M. The chain rule for HILL pseudoentropy, revisited. 2015;9230:81-98.
doi:10.1007/978-3-319-22174-8_5
apa: 'Pietrzak, K. Z., & Skórski, M. (2015). The chain rule for HILL pseudoentropy,
revisited. Presented at the LATINCRYPT: Cryptology and Information Security in
Latin America, Guadalajara, Mexico: Springer. https://doi.org/10.1007/978-3-319-22174-8_5'
chicago: Pietrzak, Krzysztof Z, and Maciej Skórski. “The Chain Rule for HILL Pseudoentropy,
Revisited.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-22174-8_5.
ieee: K. Z. Pietrzak and M. Skórski, “The chain rule for HILL pseudoentropy, revisited,”
vol. 9230. Springer, pp. 81–98, 2015.
ista: Pietrzak KZ, Skórski M. 2015. The chain rule for HILL pseudoentropy, revisited.
9230, 81–98.
mla: Pietrzak, Krzysztof Z., and Maciej Skórski. The Chain Rule for HILL Pseudoentropy,
Revisited. Vol. 9230, Springer, 2015, pp. 81–98, doi:10.1007/978-3-319-22174-8_5.
short: K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.
conference:
end_date: 2015-08-26
location: Guadalajara, Mexico
name: 'LATINCRYPT: Cryptology and Information Security in Latin America'
start_date: 2015-08-23
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-15T00:00:00Z
date_updated: 2021-01-12T06:52:24Z
day: '15'
ddc:
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-319-22174-8_5
ec_funded: 1
file:
- access_level: open_access
checksum: 8cd4215b83efba720e8cf27c23ff4781
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:29Z
date_updated: 2020-07-14T12:45:11Z
file_id: '5351'
file_name: IST-2016-669-v1+1_599.pdf
file_size: 443340
relation: main_file
file_date_updated: 2020-07-14T12:45:11Z
has_accepted_license: '1'
intvolume: ' 9230'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 81 - 98
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5480'
pubrep_id: '669'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: The chain rule for HILL pseudoentropy, revisited
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9230
year: '2015'
...
---
_id: '1671'
abstract:
- lang: eng
text: This paper studies the concrete security of PRFs and MACs obtained by keying
hash functions based on the sponge paradigm. One such hash function is KECCAK,
selected as NIST’s new SHA-3 standard. In contrast to other approaches like HMAC,
the exact security of keyed sponges is not well understood. Indeed, recent security
analyses delivered concrete security bounds which are far from existing attacks.
This paper aims to close this gap. We prove (nearly) exact bounds on the concrete
PRF security of keyed sponges using a random permutation. These bounds are tight
for the most relevant ranges of parameters, i.e., for messages of length (roughly)
l ≤ min{2n/4, 2r} blocks, where n is the state size and r is the desired output
length; and for l ≤ q queries (to the construction or the underlying permutation).
Moreover, we also improve standard-model bounds. As an intermediate step of independent
interest, we prove tight bounds on the PRF security of the truncated CBC-MAC construction,
which operates as plain CBC-MAC, but only returns a prefix of the output.
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- 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: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Gazi P, Pietrzak KZ, Tessaro S. The exact PRF security of truncation: Tight
bounds for keyed sponges and truncated CBC. In: Vol 9215. Springer; 2015:368-387.
doi:10.1007/978-3-662-47989-6_18'
apa: 'Gazi, P., Pietrzak, K. Z., & Tessaro, S. (2015). The exact PRF security
of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp.
368–387). Presented at the CRYPTO: International Cryptology Conference, Santa
Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-47989-6_18'
chicago: 'Gazi, Peter, Krzysztof Z Pietrzak, and Stefano Tessaro. “The Exact PRF
Security of Truncation: Tight Bounds for Keyed Sponges and Truncated CBC,” 9215:368–87.
Springer, 2015. https://doi.org/10.1007/978-3-662-47989-6_18.'
ieee: 'P. Gazi, K. Z. Pietrzak, and S. Tessaro, “The exact PRF security of truncation:
Tight bounds for keyed sponges and truncated CBC,” presented at the CRYPTO: International
Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9215, pp.
368–387.'
ista: 'Gazi P, Pietrzak KZ, Tessaro S. 2015. The exact PRF security of truncation:
Tight bounds for keyed sponges and truncated CBC. CRYPTO: International Cryptology
Conference, LNCS, vol. 9215, 368–387.'
mla: 'Gazi, Peter, et al. The Exact PRF Security of Truncation: Tight Bounds
for Keyed Sponges and Truncated CBC. Vol. 9215, Springer, 2015, pp. 368–87,
doi:10.1007/978-3-662-47989-6_18.'
short: P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.
conference:
end_date: 2015-08-20
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2015-08-16
date_created: 2018-12-11T11:53:23Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:25Z
day: '01'
ddc:
- '004'
- '005'
department:
- _id: KrPi
doi: 10.1007/978-3-662-47989-6_18
ec_funded: 1
file:
- access_level: open_access
checksum: 17d854227b3b753fd34f5d29e5b5a32e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:38Z
date_updated: 2020-07-14T12:45:11Z
file_id: '4827'
file_name: IST-2016-673-v1+1_053.pdf
file_size: 592296
relation: main_file
file_date_updated: 2020-07-14T12:45:11Z
has_accepted_license: '1'
intvolume: ' 9215'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 368 - 387
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5478'
pubrep_id: '673'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The exact PRF security of truncation: Tight bounds for keyed sponges and truncated
CBC'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9215
year: '2015'
...
---
_id: '1673'
abstract:
- lang: eng
text: 'When a new mutant arises in a population, there is a probability it outcompetes
the residents and fixes. The structure of the population can affect this fixation
probability. Suppressing population structures reduce the difference between two
competing variants, while amplifying population structures enhance the difference.
Suppressors are ubiquitous and easy to construct, but amplifiers for the large
population limit are more elusive and only a few examples have been discovered.
Whether or not a population structure is an amplifier of selection depends on
the probability distribution for the placement of the invading mutant. First,
we prove that there exist only bounded amplifiers for adversarial placement-that
is, for arbitrary initial conditions. Next, we show that the Star population structure,
which is known to amplify for mutants placed uniformly at random, does not amplify
for mutants that arise through reproduction and are therefore placed proportional
to the temperatures of the vertices. Finally, we construct population structures
that amplify for all mutational events that arise through reproduction, uniformly
at random, or through some combination of the two. '
acknowledgement: 'K.C. gratefully acknowledges support from ERC Start grant no. (279307:
Graph Games), Austrian Science Fund (FWF) grant no. P23499-N23, and FWF NFN grant
no. S11407-N23 (RiSE). '
article_number: '20150114'
author:
- first_name: Ben
full_name: Adlam, Ben
last_name: Adlam
- 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: 'Adlam B, Chatterjee K, Nowak M. Amplifiers of selection. Proceedings of
the Royal Society A: Mathematical, Physical and Engineering Sciences. 2015;471(2181).
doi:10.1098/rspa.2015.0114'
apa: 'Adlam, B., Chatterjee, K., & Nowak, M. (2015). Amplifiers of selection.
Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences. Royal Society of London. https://doi.org/10.1098/rspa.2015.0114'
chicago: 'Adlam, Ben, Krishnendu Chatterjee, and Martin Nowak. “Amplifiers of Selection.”
Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences. Royal Society of London, 2015. https://doi.org/10.1098/rspa.2015.0114.'
ieee: 'B. Adlam, K. Chatterjee, and M. Nowak, “Amplifiers of selection,” Proceedings
of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.
471, no. 2181. Royal Society of London, 2015.'
ista: 'Adlam B, Chatterjee K, Nowak M. 2015. Amplifiers of selection. Proceedings
of the Royal Society A: Mathematical, Physical and Engineering Sciences. 471(2181),
20150114.'
mla: 'Adlam, Ben, et al. “Amplifiers of Selection.” Proceedings of the Royal
Society A: Mathematical, Physical and Engineering Sciences, vol. 471, no.
2181, 20150114, Royal Society of London, 2015, doi:10.1098/rspa.2015.0114.'
short: 'B. Adlam, K. Chatterjee, M. Nowak, Proceedings of the Royal Society A: Mathematical,
Physical and Engineering Sciences 471 (2015).'
date_created: 2018-12-11T11:53:24Z
date_published: 2015-09-08T00:00:00Z
date_updated: 2021-01-12T06:52:26Z
day: '08'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1098/rspa.2015.0114
ec_funded: 1
file:
- access_level: open_access
checksum: e613d94d283c776322403a28aad11bdd
content_type: application/pdf
creator: kschuh
date_created: 2019-04-18T12:39:56Z
date_updated: 2020-07-14T12:45:11Z
file_id: '6342'
file_name: 2015_rspa_Adlam.pdf
file_size: 391466
relation: main_file
file_date_updated: 2020-07-14T12:45:11Z
has_accepted_license: '1'
intvolume: ' 471'
issue: '2181'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 'Proceedings of the Royal Society A: Mathematical, Physical and Engineering
Sciences'
publication_status: published
publisher: Royal Society of London
publist_id: '5477'
quality_controlled: '1'
scopus_import: 1
status: public
title: Amplifiers of selection
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 471
year: '2015'
...
---
_id: '1668'
abstract:
- lang: eng
text: "We revisit the security (as a pseudorandom permutation) of cascading-based
constructions for block-cipher key-length extension. Previous works typically
considered the extreme case where the adversary is given the entire codebook of
the construction, the only complexity measure being the number qe of queries to
the underlying ideal block cipher, representing adversary’s secret-key-independent
computation. Here, we initiate a systematic study of the more natural case of
an adversary restricted to adaptively learning a number qc of plaintext/ciphertext
pairs that is less than the entire codebook. For any such qc, we aim to determine
the highest number of block-cipher queries qe the adversary can issue without
being able to successfully distinguish the construction (under a secret key) from
a random permutation.\r\nMore concretely, we show the following results for key-length
extension schemes using a block cipher with n-bit blocks and κ-bit keys:\r\nPlain
cascades of length ℓ=2r+1 are secure whenever qcqre≪2r(κ+n), qc≪2κ and qe≪22κ.
The bound for r=1 also applies to two-key triple encryption (as used within Triple
DES).\r\nThe r-round XOR-cascade is secure as long as qcqre≪2r(κ+n), matching
an attack by Gaži (CRYPTO 2013).\r\nWe fully characterize the security of Gaži
and Tessaro’s two-call "
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Jooyoung
full_name: Lee, Jooyoung
last_name: Lee
- first_name: Yannick
full_name: Seurin, Yannick
last_name: Seurin
- first_name: John
full_name: Steinberger, John
last_name: Steinberger
- first_name: Stefano
full_name: Tessaro, Stefano
last_name: Tessaro
citation:
ama: 'Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. Relaxing full-codebook
security: A refined analysis of key-length extension schemes. 2015;9054:319-341.
doi:10.1007/978-3-662-48116-5_16'
apa: 'Gazi, P., Lee, J., Seurin, Y., Steinberger, J., & Tessaro, S. (2015).
Relaxing full-codebook security: A refined analysis of key-length extension schemes.
Presented at the FSE: Fast Software Encryption, Istanbul, Turkey: Springer. https://doi.org/10.1007/978-3-662-48116-5_16'
chicago: 'Gazi, Peter, Jooyoung Lee, Yannick Seurin, John Steinberger, and Stefano
Tessaro. “Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension
Schemes.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48116-5_16.'
ieee: 'P. Gazi, J. Lee, Y. Seurin, J. Steinberger, and S. Tessaro, “Relaxing full-codebook
security: A refined analysis of key-length extension schemes,” vol. 9054. Springer,
pp. 319–341, 2015.'
ista: 'Gazi P, Lee J, Seurin Y, Steinberger J, Tessaro S. 2015. Relaxing full-codebook
security: A refined analysis of key-length extension schemes. 9054, 319–341.'
mla: 'Gazi, Peter, et al. Relaxing Full-Codebook Security: A Refined Analysis
of Key-Length Extension Schemes. Vol. 9054, Springer, 2015, pp. 319–41, doi:10.1007/978-3-662-48116-5_16.'
short: P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.
conference:
end_date: 2015-03-11
location: Istanbul, Turkey
name: 'FSE: Fast Software Encryption'
start_date: 2015-03-08
date_created: 2018-12-11T11:53:22Z
date_published: 2015-08-12T00:00:00Z
date_updated: 2020-08-11T10:09:26Z
day: '12'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48116-5_16
ec_funded: 1
intvolume: ' 9054'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2015/397
month: '08'
oa: 1
oa_version: Submitted Version
page: 319 - 341
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5481'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'Relaxing full-codebook security: A refined analysis of key-length extension
schemes'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9054
year: '2015'
...
---
_id: '1670'
abstract:
- lang: eng
text: Planning in hybrid domains poses a special challenge due to the involved mixed
discrete-continuous dynamics. A recent solving approach for such domains is based
on applying model checking techniques on a translation of PDDL+ planning problems
to hybrid automata. However, the proposed translation is limited because must
behavior is only overapproximated, and hence, processes and events are not reflected
exactly. In this paper, we present the theoretical foundation of an exact PDDL+
translation. We propose a schema to convert a hybrid automaton with must transitions
into an equivalent hybrid automaton featuring only may transitions.
acknowledgement: This work was partly supported by the German Research Foundation
(DFG) as part of the Transregional Collaborative Research Center “Automatic Verification
and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/), by the
European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science
Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), and
by the Swiss National Science Foundation (SNSF) as part of the project “Automated
Reformulation and Pruning in Factored State Spaces (ARAP)”.
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Daniele
full_name: Magazzeni, Daniele
last_name: Magazzeni
- first_name: Stefano
full_name: Minopoli, Stefano
last_name: Minopoli
- first_name: Martin
full_name: Wehrle, Martin
last_name: Wehrle
citation:
ama: 'Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. PDDL+ planning with hybrid
automata: Foundations of translating must behavior. In: AAAI Press; 2015:42-46.'
apa: 'Bogomolov, S., Magazzeni, D., Minopoli, S., & Wehrle, M. (2015). PDDL+
planning with hybrid automata: Foundations of translating must behavior (pp. 42–46).
Presented at the ICAPS: International Conference on Automated Planning and Scheduling,
Jerusalem, Israel: AAAI Press.'
chicago: 'Bogomolov, Sergiy, Daniele Magazzeni, Stefano Minopoli, and Martin Wehrle.
“PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior,”
42–46. AAAI Press, 2015.'
ieee: 'S. Bogomolov, D. Magazzeni, S. Minopoli, and M. Wehrle, “PDDL+ planning with
hybrid automata: Foundations of translating must behavior,” presented at the ICAPS:
International Conference on Automated Planning and Scheduling, Jerusalem, Israel,
2015, pp. 42–46.'
ista: 'Bogomolov S, Magazzeni D, Minopoli S, Wehrle M. 2015. PDDL+ planning with
hybrid automata: Foundations of translating must behavior. ICAPS: International
Conference on Automated Planning and Scheduling, 42–46.'
mla: 'Bogomolov, Sergiy, et al. PDDL+ Planning with Hybrid Automata: Foundations
of Translating Must Behavior. AAAI Press, 2015, pp. 42–46.'
short: S. Bogomolov, D. Magazzeni, S. Minopoli, M. Wehrle, in:, AAAI Press, 2015,
pp. 42–46.
conference:
end_date: 2015-06-11
location: Jerusalem, Israel
name: 'ICAPS: International Conference on Automated Planning and Scheduling'
start_date: 2015-06-07
date_created: 2018-12-11T11:53:23Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:52:25Z
day: '01'
department:
- _id: ToHe
ec_funded: 1
language:
- iso: eng
main_file_link:
- url: https://www.aaai.org/ocs/index.php/ICAPS/ICAPS15/paper/view/10606/10394
month: '06'
oa_version: None
page: 42 - 46
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: AAAI Press
publist_id: '5479'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'PDDL+ planning with hybrid automata: Foundations of translating must behavior'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1674'
abstract:
- lang: eng
text: We consider N × N random matrices of the form H = W + V where W is a real
symmetric Wigner matrix and V a random or deterministic, real, diagonal matrix
whose entries are independent of W. We assume subexponential decay for the matrix
entries of W and we choose V so that the eigenvalues of W and V are typically
of the same order. For a large class of diagonal matrices V, we show that the
rescaled distribution of the extremal eigenvalues is given by the Tracy-Widom
distribution F1 in the limit of large N. Our proofs also apply to the complex
Hermitian setting, i.e. when W is a complex Hermitian Wigner matrix.
article_number: '1550018'
author:
- first_name: Jioon
full_name: Lee, Jioon
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Edge universality for deformed Wigner matrices. Reviews
in Mathematical Physics. 2015;27(8). doi:10.1142/S0129055X1550018X
apa: Lee, J., & Schnelli, K. (2015). Edge universality for deformed Wigner matrices.
Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/S0129055X1550018X
chicago: Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner
Matrices.” Reviews in Mathematical Physics. World Scientific Publishing,
2015. https://doi.org/10.1142/S0129055X1550018X.
ieee: J. Lee and K. Schnelli, “Edge universality for deformed Wigner matrices,”
Reviews in Mathematical Physics, vol. 27, no. 8. World Scientific Publishing,
2015.
ista: Lee J, Schnelli K. 2015. Edge universality for deformed Wigner matrices. Reviews
in Mathematical Physics. 27(8), 1550018.
mla: Lee, Jioon, and Kevin Schnelli. “Edge Universality for Deformed Wigner Matrices.”
Reviews in Mathematical Physics, vol. 27, no. 8, 1550018, World Scientific
Publishing, 2015, doi:10.1142/S0129055X1550018X.
short: J. Lee, K. Schnelli, Reviews in Mathematical Physics 27 (2015).
date_created: 2018-12-11T11:53:24Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:52:26Z
day: '01'
department:
- _id: LaEr
doi: 10.1142/S0129055X1550018X
intvolume: ' 27'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.8015
month: '09'
oa: 1
oa_version: Preprint
publication: Reviews in Mathematical Physics
publication_status: published
publisher: World Scientific Publishing
publist_id: '5475'
quality_controlled: '1'
scopus_import: 1
status: public
title: Edge universality for deformed Wigner matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2015'
...
---
_id: '1679'
article_number: '091102'
author:
- first_name: Grégoire M
full_name: Lemoult, Grégoire M
id: 4787FE80-F248-11E8-B48F-1D18A9856A87
last_name: Lemoult
- first_name: Philipp
full_name: Maier, Philipp
id: 384F7C04-F248-11E8-B48F-1D18A9856A87
last_name: Maier
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Lemoult GM, Maier P, Hof B. Taylor’s Forest. Physics of Fluids. 2015;27(9).
doi:10.1063/1.4930850
apa: Lemoult, G. M., Maier, P., & Hof, B. (2015). Taylor’s Forest. Physics
of Fluids. American Institute of Physics. https://doi.org/10.1063/1.4930850
chicago: Lemoult, Grégoire M, Philipp Maier, and Björn Hof. “Taylor’s Forest.” Physics
of Fluids. American Institute of Physics, 2015. https://doi.org/10.1063/1.4930850.
ieee: G. M. Lemoult, P. Maier, and B. Hof, “Taylor’s Forest,” Physics of Fluids,
vol. 27, no. 9. American Institute of Physics, 2015.
ista: Lemoult GM, Maier P, Hof B. 2015. Taylor’s Forest. Physics of Fluids. 27(9),
091102.
mla: Lemoult, Grégoire M., et al. “Taylor’s Forest.” Physics of Fluids, vol.
27, no. 9, 091102, American Institute of Physics, 2015, doi:10.1063/1.4930850.
short: G.M. Lemoult, P. Maier, B. Hof, Physics of Fluids 27 (2015).
date_created: 2018-12-11T11:53:26Z
date_published: 2015-09-24T00:00:00Z
date_updated: 2021-01-12T06:52:28Z
day: '24'
ddc:
- '532'
department:
- _id: BjHo
doi: 10.1063/1.4930850
file:
- access_level: open_access
checksum: 604bba3c2496aadb3efcff77de01ce6c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:35Z
date_updated: 2020-07-14T12:45:12Z
file_id: '5019'
file_name: IST-2017-748-v1+1_1.4930850.pdf
file_size: 872366
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 27'
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Physics of Fluids
publication_status: published
publisher: American Institute of Physics
publist_id: '5469'
pubrep_id: '748'
quality_controlled: '1'
scopus_import: 1
status: public
title: Taylor's Forest
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: 27
year: '2015'
...
---
_id: '1676'
author:
- 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: Erez
full_name: Raz, Erez
last_name: Raz
citation:
ama: 'Sixt MK, Raz E. Editorial overview: Cell adhesion and migration. Current
Opinion in Cell Biology. 2015;36(10):4-6. doi:10.1016/j.ceb.2015.09.004'
apa: 'Sixt, M. K., & Raz, E. (2015). Editorial overview: Cell adhesion and migration.
Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.09.004'
chicago: 'Sixt, Michael K, and Erez Raz. “Editorial Overview: Cell Adhesion and
Migration.” Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.09.004.'
ieee: 'M. K. Sixt and E. Raz, “Editorial overview: Cell adhesion and migration,”
Current Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 4–6, 2015.'
ista: 'Sixt MK, Raz E. 2015. Editorial overview: Cell adhesion and migration. Current
Opinion in Cell Biology. 36(10), 4–6.'
mla: 'Sixt, Michael K., and Erez Raz. “Editorial Overview: Cell Adhesion and Migration.”
Current Opinion in Cell Biology, vol. 36, no. 10, Elsevier, 2015, pp. 4–6,
doi:10.1016/j.ceb.2015.09.004.'
short: M.K. Sixt, E. Raz, Current Opinion in Cell Biology 36 (2015) 4–6.
date_created: 2018-12-11T11:53:25Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:52:27Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2015.09.004
intvolume: ' 36'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 4 - 6
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '5473'
scopus_import: 1
status: public
title: 'Editorial overview: Cell adhesion and migration'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2015'
...
---
_id: '1687'
abstract:
- lang: eng
text: Guided cell movement is essential for development and integrity of animals
and crucially involved in cellular immune responses. Leukocytes are professional
migratory cells that can navigate through most types of tissues and sense a wide
range of directional cues. The responses of these cells to attractants have been
mainly explored in tissue culture settings. How leukocytes make directional decisions
in situ, within the challenging environment of a tissue maze, is less understood.
Here we review recent advances in how leukocytes sense chemical cues in complex
tissue settings and make links with paradigms of directed migration in development
and Dictyostelium discoideum amoebae.
author:
- first_name: Milka
full_name: Sarris, Milka
last_name: Sarris
- 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: 'Sarris M, Sixt MK. Navigating in tissue mazes: Chemoattractant interpretation
in complex environments. Current Opinion in Cell Biology. 2015;36(10):93-102.
doi:10.1016/j.ceb.2015.08.001'
apa: 'Sarris, M., & Sixt, M. K. (2015). Navigating in tissue mazes: Chemoattractant
interpretation in complex environments. Current Opinion in Cell Biology.
Elsevier. https://doi.org/10.1016/j.ceb.2015.08.001'
chicago: 'Sarris, Milka, and Michael K Sixt. “Navigating in Tissue Mazes: Chemoattractant
Interpretation in Complex Environments.” Current Opinion in Cell Biology.
Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.08.001.'
ieee: 'M. Sarris and M. K. Sixt, “Navigating in tissue mazes: Chemoattractant interpretation
in complex environments,” Current Opinion in Cell Biology, vol. 36, no.
10. Elsevier, pp. 93–102, 2015.'
ista: 'Sarris M, Sixt MK. 2015. Navigating in tissue mazes: Chemoattractant interpretation
in complex environments. Current Opinion in Cell Biology. 36(10), 93–102.'
mla: 'Sarris, Milka, and Michael K. Sixt. “Navigating in Tissue Mazes: Chemoattractant
Interpretation in Complex Environments.” Current Opinion in Cell Biology,
vol. 36, no. 10, Elsevier, 2015, pp. 93–102, doi:10.1016/j.ceb.2015.08.001.'
short: M. Sarris, M.K. Sixt, Current Opinion in Cell Biology 36 (2015) 93–102.
date_created: 2018-12-11T11:53:28Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:52:31Z
day: '01'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2015.08.001
ec_funded: 1
file:
- access_level: open_access
checksum: c29973924b790aab02fdd91857759cfb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:21Z
date_updated: 2020-07-14T12:45:12Z
file_id: '4875'
file_name: IST-2016-445-v1+1_1-s2.0-S0955067415001064-main.pdf
file_size: 797964
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 93 - 102
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
(EU)
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '5458'
pubrep_id: '445'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Navigating in tissue mazes: Chemoattractant interpretation in complex environments'
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: 36
year: '2015'
...
---
_id: '1685'
abstract:
- lang: eng
text: "Given a graph G cellularly embedded on a surface Σ of genus g, a cut graph
is a subgraph of G such that cutting Σ along G yields a topological disk. We provide
a fixed parameter tractable approximation scheme for the problem of computing
the shortest cut graph, that is, for any ε > 0, we show how to compute a (1 + ε)
approximation of the shortest cut graph in time f(ε, g)n3.\r\nOur techniques first
rely on the computation of a spanner for the problem using the technique of brick
decompositions, to reduce the problem to the case of bounded tree-width. Then,
to solve the bounded tree-width case, we introduce a variant of the surface-cut
decomposition of Rué, Sau and Thilikos, which may be of independent interest."
alternative_title:
- LNCS
author:
- first_name: Vincent
full_name: Cohen Addad, Vincent
last_name: Cohen Addad
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
citation:
ama: 'Cohen Addad V, de Mesmay AN. A fixed parameter tractable approximation scheme
for the optimal cut graph of a surface. In: Vol 9294. Springer; 2015:386-398.
doi:10.1007/978-3-662-48350-3_33'
apa: 'Cohen Addad, V., & de Mesmay, A. N. (2015). A fixed parameter tractable
approximation scheme for the optimal cut graph of a surface (Vol. 9294, pp. 386–398).
Presented at the ESA: European Symposium on Algorithms, Patras, Greece: Springer.
https://doi.org/10.1007/978-3-662-48350-3_33'
chicago: Cohen Addad, Vincent, and Arnaud N de Mesmay. “A Fixed Parameter Tractable
Approximation Scheme for the Optimal Cut Graph of a Surface,” 9294:386–98. Springer,
2015. https://doi.org/10.1007/978-3-662-48350-3_33.
ieee: 'V. Cohen Addad and A. N. de Mesmay, “A fixed parameter tractable approximation
scheme for the optimal cut graph of a surface,” presented at the ESA: European
Symposium on Algorithms, Patras, Greece, 2015, vol. 9294, pp. 386–398.'
ista: 'Cohen Addad V, de Mesmay AN. 2015. A fixed parameter tractable approximation
scheme for the optimal cut graph of a surface. ESA: European Symposium on Algorithms,
LNCS, vol. 9294, 386–398.'
mla: Cohen Addad, Vincent, and Arnaud N. de Mesmay. A Fixed Parameter Tractable
Approximation Scheme for the Optimal Cut Graph of a Surface. Vol. 9294, Springer,
2015, pp. 386–98, doi:10.1007/978-3-662-48350-3_33.
short: V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.
conference:
end_date: 2015-09-16
location: Patras, Greece
name: 'ESA: European Symposium on Algorithms'
start_date: 2015-09-14
date_created: 2018-12-11T11:53:27Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:52:31Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/978-3-662-48350-3_33
ec_funded: 1
intvolume: ' 9294'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1507.01688
month: '09'
oa: 1
oa_version: Preprint
page: 386 - 398
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '5462'
quality_controlled: '1'
scopus_import: 1
status: public
title: A fixed parameter tractable approximation scheme for the optimal cut graph
of a surface
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9294
year: '2015'
...
---
_id: '1688'
abstract:
- lang: eng
text: 'We estimate the selection constant in the following geometric selection theorem
by Pach: For every positive integer d, there is a constant (Formula presented.)
such that whenever (Formula presented.) are n-element subsets of (Formula presented.),
we can find a point (Formula presented.) and subsets (Formula presented.) for
every i∈[d+1], each of size at least cdn, such that p belongs to all rainbowd-simplices
determined by (Formula presented.) simplices with one vertex in each Yi. We show
a super-exponentially decreasing upper bound (Formula presented.). The ideas used
in the proof of the upper bound also help us to prove Pach’s theorem with (Formula
presented.), which is a lower bound doubly exponentially decreasing in d (up to
some polynomial in the exponent). For comparison, Pach’s original approach yields
a triply exponentially decreasing lower bound. On the other hand, Fox, Pach, and
Suk recently obtained a hypergraph density result implying a proof of Pach’s theorem
with (Formula presented.). In our construction for the upper bound, we use the
fact that the minimum solid angle of every d-simplex is super-exponentially small.
This fact was previously unknown and might be of independent interest. For the
lower bound, we improve the ‘separation’ part of the argument by showing that
in one of the key steps only d+1 separations are necessary, compared to 2d separations
in the original proof. We also provide a measure version of Pach’s theorem.'
acknowledgement: R. K. was supported by the Russian Foundation for Basic Research
Grant 15-31-20403 (mol_a_ved) and grant 15-01-99563. J. K., Z. P., and M. T. were
partially supported by ERC Advanced Research Grant No. 267165 (DISCONV) and by the
project CE-ITI (GAČR P202/12/G061) of the Czech Science Foundation. J. K. was also
partially supported by Swiss National Science Foundation Grants 200021-137574 and
200020-14453. P. P., Z. P., and M. T. were partially supported by the Charles University
Grant GAUK 421511. P. P. was also partially supported by the Charles University
Grant SVV-2014-260107. Z. P. was also partially supported by the Charles University
Grant SVV-2014-260103.
author:
- first_name: Roman
full_name: Karasev, Roman
last_name: Karasev
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Pavel
full_name: Paták, Pavel
last_name: Paták
- first_name: Zuzana
full_name: Patakova, Zuzana
last_name: Patakova
orcid: 0000-0002-3975-1683
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
citation:
ama: Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. Bounds for Pach’s selection
theorem and for the minimum solid angle in a simplex. Discrete & Computational
Geometry. 2015;54(3):610-636. doi:10.1007/s00454-015-9720-z
apa: Karasev, R., Kynčl, J., Paták, P., Patakova, Z., & Tancer, M. (2015). Bounds
for Pach’s selection theorem and for the minimum solid angle in a simplex. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9720-z
chicago: Karasev, Roman, Jan Kynčl, Pavel Paták, Zuzana Patakova, and Martin Tancer.
“Bounds for Pach’s Selection Theorem and for the Minimum Solid Angle in a Simplex.”
Discrete & Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9720-z.
ieee: R. Karasev, J. Kynčl, P. Paták, Z. Patakova, and M. Tancer, “Bounds for Pach’s
selection theorem and for the minimum solid angle in a simplex,” Discrete &
Computational Geometry, vol. 54, no. 3. Springer, pp. 610–636, 2015.
ista: Karasev R, Kynčl J, Paták P, Patakova Z, Tancer M. 2015. Bounds for Pach’s
selection theorem and for the minimum solid angle in a simplex. Discrete &
Computational Geometry. 54(3), 610–636.
mla: Karasev, Roman, et al. “Bounds for Pach’s Selection Theorem and for the Minimum
Solid Angle in a Simplex.” Discrete & Computational Geometry, vol.
54, no. 3, Springer, 2015, pp. 610–36, doi:10.1007/s00454-015-9720-z.
short: R. Karasev, J. Kynčl, P. Paták, Z. Patakova, M. Tancer, Discrete & Computational
Geometry 54 (2015) 610–636.
date_created: 2018-12-11T11:53:28Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:52:32Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-015-9720-z
intvolume: ' 54'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1403.8147
month: '10'
oa: 1
oa_version: Preprint
page: 610 - 636
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5457'
quality_controlled: '1'
scopus_import: 1
status: public
title: Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2015'
...
---
_id: '1680'
abstract:
- lang: eng
text: We consider the satisfiability problem for modal logic over first-order definable
classes of frames.We confirm the conjecture from Hemaspaandra and Schnoor [2008]
that modal logic is decidable over classes definable by universal Horn formulae.
We provide a full classification of Horn formulae with respect to the complexity
of the corresponding satisfiability problem. It turns out, that except for the
trivial case of inconsistent formulae, local satisfiability is eitherNP-complete
or PSPACE-complete, and global satisfiability is NP-complete, PSPACE-complete,
or ExpTime-complete. We also show that the finite satisfiability problem for modal
logic over Horn definable classes of frames is decidable. On the negative side,
we show undecidability of two related problems. First, we exhibit a simple universal
three-variable formula defining the class of frames over which modal logic is
undecidable. Second, we consider the satisfiability problem of bimodal logic over
Horn definable classes of frames, and also present a formula leading to undecidability.
article_number: '2'
author:
- first_name: Jakub
full_name: Michaliszyn, Jakub
last_name: Michaliszyn
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Emanuel
full_name: Kieroňski, Emanuel
last_name: Kieroňski
citation:
ama: Michaliszyn J, Otop J, Kieroňski E. On the decidability of elementary modal
logics. ACM Transactions on Computational Logic. 2015;17(1). doi:10.1145/2817825
apa: Michaliszyn, J., Otop, J., & Kieroňski, E. (2015). On the decidability
of elementary modal logics. ACM Transactions on Computational Logic. ACM.
https://doi.org/10.1145/2817825
chicago: Michaliszyn, Jakub, Jan Otop, and Emanuel Kieroňski. “On the Decidability
of Elementary Modal Logics.” ACM Transactions on Computational Logic. ACM,
2015. https://doi.org/10.1145/2817825.
ieee: J. Michaliszyn, J. Otop, and E. Kieroňski, “On the decidability of elementary
modal logics,” ACM Transactions on Computational Logic, vol. 17, no. 1.
ACM, 2015.
ista: Michaliszyn J, Otop J, Kieroňski E. 2015. On the decidability of elementary
modal logics. ACM Transactions on Computational Logic. 17(1), 2.
mla: Michaliszyn, Jakub, et al. “On the Decidability of Elementary Modal Logics.”
ACM Transactions on Computational Logic, vol. 17, no. 1, 2, ACM, 2015,
doi:10.1145/2817825.
short: J. Michaliszyn, J. Otop, E. Kieroňski, ACM Transactions on Computational
Logic 17 (2015).
date_created: 2018-12-11T11:53:26Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:52:29Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2817825
ec_funded: 1
intvolume: ' 17'
issue: '1'
language:
- iso: eng
month: '09'
oa_version: None
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: ACM Transactions on Computational Logic
publication_status: published
publisher: ACM
publist_id: '5468'
quality_controlled: '1'
status: public
title: On the decidability of elementary modal logics
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2015'
...
---
_id: '1682'
abstract:
- lang: eng
text: 'We study the problem of robust satisfiability of systems of nonlinear equations,
namely, whether for a given continuous function f:K→ ℝn on a finite simplicial
complex K and α > 0, it holds that each function g: K → ℝn such that ||g -
f || ∞ < α, has a root in K. Via a reduction to the extension problem of maps
into a sphere, we particularly show that this problem is decidable in polynomial
time for every fixed n, assuming dimK ≤ 2n - 3. This is a substantial extension
of previous computational applications of topological degree and related concepts
in numerical and interval analysis. Via a reverse reduction, we prove that the
problem is undecidable when dim K > 2n - 2, where the threshold comes from
the stable range in homotopy theory. For the lucidity of our exposition, we focus
on the setting when f is simplexwise linear. Such functions can approximate general
continuous functions, and thus we get approximation schemes and undecidability
of the robust satisfiability in other possible settings.'
article_number: '26'
author:
- first_name: Peter
full_name: Franek, Peter
last_name: Franek
- first_name: Marek
full_name: Krcál, Marek
id: 33E21118-F248-11E8-B48F-1D18A9856A87
last_name: Krcál
citation:
ama: Franek P, Krcál M. Robust satisfiability of systems of equations. Journal
of the ACM. 2015;62(4). doi:10.1145/2751524
apa: Franek, P., & Krcál, M. (2015). Robust satisfiability of systems of equations.
Journal of the ACM. ACM. https://doi.org/10.1145/2751524
chicago: Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.”
Journal of the ACM. ACM, 2015. https://doi.org/10.1145/2751524.
ieee: P. Franek and M. Krcál, “Robust satisfiability of systems of equations,” Journal
of the ACM, vol. 62, no. 4. ACM, 2015.
ista: Franek P, Krcál M. 2015. Robust satisfiability of systems of equations. Journal
of the ACM. 62(4), 26.
mla: Franek, Peter, and Marek Krcál. “Robust Satisfiability of Systems of Equations.”
Journal of the ACM, vol. 62, no. 4, 26, ACM, 2015, doi:10.1145/2751524.
short: P. Franek, M. Krcál, Journal of the ACM 62 (2015).
date_created: 2018-12-11T11:53:27Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:30Z
day: '01'
department:
- _id: UlWa
- _id: HeEd
doi: 10.1145/2751524
intvolume: ' 62'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.0858
month: '08'
oa: 1
oa_version: Preprint
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '5466'
quality_controlled: '1'
scopus_import: 1
status: public
title: Robust satisfiability of systems of equations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 62
year: '2015'
...
---
_id: '1683'
abstract:
- lang: eng
text: The 1 MDa, 45-subunit proton-pumping NADH-ubiquinone oxidoreductase (complex
I) is the largest complex of the mitochondrial electron transport chain. The molecular
mechanism of complex I is central to the metabolism of cells, but has yet to be
fully characterized. The last two years have seen steady progress towards this
goal with the first atomic-resolution structure of the entire bacterial complex
I, a 5 Å cryo-electron microscopy map of bovine mitochondrial complex I and a
∼3.8 Å resolution X-ray crystallographic study of mitochondrial complex I from
yeast Yarrowia lipotytica. In this review we will discuss what we have learned
from these studies and what remains to be elucidated.
author:
- first_name: Jame A
full_name: Letts, Jame A
id: 322DA418-F248-11E8-B48F-1D18A9856A87
last_name: Letts
orcid: 0000-0002-9864-3586
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
citation:
ama: 'Letts JA, Sazanov LA. Gaining mass: The structure of respiratory complex I-from
bacterial towards mitochondrial versions. Current Opinion in Structural Biology.
2015;33(8):135-145. doi:10.1016/j.sbi.2015.08.008'
apa: 'Letts, J. A., & Sazanov, L. A. (2015). Gaining mass: The structure of
respiratory complex I-from bacterial towards mitochondrial versions. Current
Opinion in Structural Biology. Elsevier. https://doi.org/10.1016/j.sbi.2015.08.008'
chicago: 'Letts, James A, and Leonid A Sazanov. “Gaining Mass: The Structure of
Respiratory Complex I-from Bacterial towards Mitochondrial Versions.” Current
Opinion in Structural Biology. Elsevier, 2015. https://doi.org/10.1016/j.sbi.2015.08.008.'
ieee: 'J. A. Letts and L. A. Sazanov, “Gaining mass: The structure of respiratory
complex I-from bacterial towards mitochondrial versions,” Current Opinion in
Structural Biology, vol. 33, no. 8. Elsevier, pp. 135–145, 2015.'
ista: 'Letts JA, Sazanov LA. 2015. Gaining mass: The structure of respiratory complex
I-from bacterial towards mitochondrial versions. Current Opinion in Structural
Biology. 33(8), 135–145.'
mla: 'Letts, James A., and Leonid A. Sazanov. “Gaining Mass: The Structure of Respiratory
Complex I-from Bacterial towards Mitochondrial Versions.” Current Opinion in
Structural Biology, vol. 33, no. 8, Elsevier, 2015, pp. 135–45, doi:10.1016/j.sbi.2015.08.008.'
short: J.A. Letts, L.A. Sazanov, Current Opinion in Structural Biology 33 (2015)
135–145.
date_created: 2018-12-11T11:53:27Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:52:30Z
day: '01'
department:
- _id: LeSa
doi: 10.1016/j.sbi.2015.08.008
intvolume: ' 33'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 135 - 145
publication: Current Opinion in Structural Biology
publication_status: published
publisher: Elsevier
publist_id: '5465'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Gaining mass: The structure of respiratory complex I-from bacterial towards
mitochondrial versions'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2015'
...
---
_id: '1686'
author:
- first_name: Eva
full_name: Kiermaier, Eva
id: 3EB04B78-F248-11E8-B48F-1D18A9856A87
last_name: Kiermaier
orcid: 0000-0001-6165-5738
- 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: 'Kiermaier E, Sixt MK. Fragmented communication between immune cells: Neutrophils
blaze a trail with migratory cues for T cells to follow to sites of infection.
Science. 2015;349(6252):1055-1056. doi:10.1126/science.aad0867'
apa: 'Kiermaier, E., & Sixt, M. K. (2015). Fragmented communication between
immune cells: Neutrophils blaze a trail with migratory cues for T cells to follow
to sites of infection. Science. American Association for the Advancement
of Science. https://doi.org/10.1126/science.aad0867'
chicago: 'Kiermaier, Eva, and Michael K Sixt. “Fragmented Communication between
Immune Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow
to Sites of Infection.” Science. American Association for the Advancement
of Science, 2015. https://doi.org/10.1126/science.aad0867.'
ieee: 'E. Kiermaier and M. K. Sixt, “Fragmented communication between immune cells:
Neutrophils blaze a trail with migratory cues for T cells to follow to sites of
infection,” Science, vol. 349, no. 6252. American Association for the Advancement
of Science, pp. 1055–1056, 2015.'
ista: 'Kiermaier E, Sixt MK. 2015. Fragmented communication between immune cells:
Neutrophils blaze a trail with migratory cues for T cells to follow to sites of
infection. Science. 349(6252), 1055–1056.'
mla: 'Kiermaier, Eva, and Michael K. Sixt. “Fragmented Communication between Immune
Cells: Neutrophils Blaze a Trail with Migratory Cues for T Cells to Follow to
Sites of Infection.” Science, vol. 349, no. 6252, American Association
for the Advancement of Science, 2015, pp. 1055–56, doi:10.1126/science.aad0867.'
short: E. Kiermaier, M.K. Sixt, Science 349 (2015) 1055–1056.
date_created: 2018-12-11T11:53:28Z
date_published: 2015-09-04T00:00:00Z
date_updated: 2021-01-12T06:52:31Z
day: '04'
department:
- _id: MiSi
doi: 10.1126/science.aad0867
intvolume: ' 349'
issue: '6252'
language:
- iso: eng
month: '09'
oa_version: None
page: 1055 - 1056
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5459'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Fragmented communication between immune cells: Neutrophils blaze a trail with
migratory cues for T cells to follow to sites of infection'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 349
year: '2015'
...
---
_id: '1692'
abstract:
- lang: eng
text: Computing an approximation of the reachable states of a hybrid system is a
challenge, mainly because overapproximating the solutions of ODEs with a finite
number of sets does not scale well. Using template polyhedra can greatly reduce
the computational complexity, since it replaces complex operations on sets with
a small number of optimization problems. However, the use of templates may make
the over-approximation too conservative. Spurious transitions, which are falsely
considered reachable, are particularly detrimental to performance and accuracy,
and may exacerbate the state explosion problem. In this paper, we examine how
spurious transitions can be avoided with minimal computational effort. To this
end, detecting spurious transitions is reduced to the well-known problem of showing
that two convex sets are disjoint by finding a hyperplane that separates them.
We generalize this to owpipes by considering hyperplanes that evolve with time
in correspondence to the dynamics of the system. The approach is implemented in
the model checker SpaceEx and demonstrated on examples.
author:
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Marius
full_name: Greitschus, Marius
last_name: Greitschus
- first_name: Thomas
full_name: Strump, Thomas
last_name: Strump
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
citation:
ama: 'Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. Eliminating spurious
transitions in reachability with support functions. In: Proceedings of the
18th International Conference on Hybrid Systems: Computation and Control.
ACM; 2015:149-158. doi:10.1145/2728606.2728622'
apa: 'Frehse, G., Bogomolov, S., Greitschus, M., Strump, T., & Podelski, A.
(2015). Eliminating spurious transitions in reachability with support functions.
In Proceedings of the 18th International Conference on Hybrid Systems: Computation
and Control (pp. 149–158). Seattle, WA, United States: ACM. https://doi.org/10.1145/2728606.2728622'
chicago: 'Frehse, Goran, Sergiy Bogomolov, Marius Greitschus, Thomas Strump, and
Andreas Podelski. “Eliminating Spurious Transitions in Reachability with Support
Functions.” In Proceedings of the 18th International Conference on Hybrid Systems:
Computation and Control, 149–58. ACM, 2015. https://doi.org/10.1145/2728606.2728622.'
ieee: 'G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, and A. Podelski, “Eliminating
spurious transitions in reachability with support functions,” in Proceedings
of the 18th International Conference on Hybrid Systems: Computation and Control,
Seattle, WA, United States, 2015, pp. 149–158.'
ista: 'Frehse G, Bogomolov S, Greitschus M, Strump T, Podelski A. 2015. Eliminating
spurious transitions in reachability with support functions. Proceedings of the
18th International Conference on Hybrid Systems: Computation and Control. HSCC:
Hybrid Systems - Computation and Control, 149–158.'
mla: 'Frehse, Goran, et al. “Eliminating Spurious Transitions in Reachability with
Support Functions.” Proceedings of the 18th International Conference on Hybrid
Systems: Computation and Control, ACM, 2015, pp. 149–58, doi:10.1145/2728606.2728622.'
short: 'G. Frehse, S. Bogomolov, M. Greitschus, T. Strump, A. Podelski, in:, Proceedings
of the 18th International Conference on Hybrid Systems: Computation and Control,
ACM, 2015, pp. 149–158.'
conference:
end_date: 2015-04-16
location: Seattle, WA, United States
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2015-04-14
date_created: 2018-12-11T11:53:30Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2021-01-12T06:52:33Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2728606.2728622
ec_funded: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 149 - 158
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication: 'Proceedings of the 18th International Conference on Hybrid Systems:
Computation and Control'
publication_identifier:
isbn:
- 978-1-4503-3433-4
publication_status: published
publisher: ACM
publist_id: '5452'
quality_controlled: '1'
scopus_import: 1
status: public
title: Eliminating spurious transitions in reachability with support functions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1693'
abstract:
- lang: eng
text: Quantum interference between energetically close states is theoretically investigated,
with the state structure being observed via laser spectroscopy. In this work,
we focus on hyperfine states of selected hydrogenic muonic isotopes, and on how
quantum interference affects the measured Lamb shift. The process of photon excitation
and subsequent photon decay is implemented within the framework of nonrelativistic
second-order perturbation theory. Due to its experimental interest, calculations
are performed for muonic hydrogen, deuterium, and helium-3. We restrict our analysis
to the case of photon scattering by incident linear polarized photons and the
polarization of the scattered photons not being observed. We conclude that while
quantum interference effects can be safely neglected in muonic hydrogen and helium-3,
in the case of muonic deuterium there are resonances with close proximity, where
quantum interference effects can induce shifts up to a few percent of the linewidth,
assuming a pointlike detector. However, by taking into account the geometry of
the setup used by the CREMA collaboration, this effect is reduced to less than
0.2% of the linewidth in all possible cases, which makes it irrelevant at the
present level of accuracy. © 2015 American Physical Society.
article_number: '022514'
author:
- first_name: Pedro
full_name: Amaro, Pedro
last_name: Amaro
- first_name: Beatrice
full_name: Franke, Beatrice
last_name: Franke
- first_name: Julian
full_name: Krauth, Julian
last_name: Krauth
- first_name: Marc
full_name: Diepold, Marc
last_name: Diepold
- first_name: Filippo
full_name: Fratini, Filippo
last_name: Fratini
- first_name: Laleh
full_name: Safari, Laleh
id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
last_name: Safari
- first_name: Jorge
full_name: Machado, Jorge
last_name: Machado
- first_name: Aldo
full_name: Antognini, Aldo
last_name: Antognini
- first_name: Franz
full_name: Kottmann, Franz
last_name: Kottmann
- first_name: Paul
full_name: Indelicato, Paul
last_name: Indelicato
- first_name: Randolf
full_name: Pohl, Randolf
last_name: Pohl
- first_name: José
full_name: Santos, José
last_name: Santos
citation:
ama: Amaro P, Franke B, Krauth J, et al. Quantum interference effects in laser spectroscopy
of muonic hydrogen, deuterium, and helium-3. Physical Review A. 2015;92(2).
doi:10.1103/PhysRevA.92.022514
apa: Amaro, P., Franke, B., Krauth, J., Diepold, M., Fratini, F., Safari, L., …
Santos, J. (2015). Quantum interference effects in laser spectroscopy of muonic
hydrogen, deuterium, and helium-3. Physical Review A. American Physical
Society. https://doi.org/10.1103/PhysRevA.92.022514
chicago: Amaro, Pedro, Beatrice Franke, Julian Krauth, Marc Diepold, Filippo Fratini,
Laleh Safari, Jorge Machado, et al. “Quantum Interference Effects in Laser Spectroscopy
of Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A. American
Physical Society, 2015. https://doi.org/10.1103/PhysRevA.92.022514.
ieee: P. Amaro et al., “Quantum interference effects in laser spectroscopy
of muonic hydrogen, deuterium, and helium-3,” Physical Review A, vol. 92,
no. 2. American Physical Society, 2015.
ista: Amaro P, Franke B, Krauth J, Diepold M, Fratini F, Safari L, Machado J, Antognini
A, Kottmann F, Indelicato P, Pohl R, Santos J. 2015. Quantum interference effects
in laser spectroscopy of muonic hydrogen, deuterium, and helium-3. Physical Review
A. 92(2), 022514.
mla: Amaro, Pedro, et al. “Quantum Interference Effects in Laser Spectroscopy of
Muonic Hydrogen, Deuterium, and Helium-3.” Physical Review A, vol. 92,
no. 2, 022514, American Physical Society, 2015, doi:10.1103/PhysRevA.92.022514.
short: P. Amaro, B. Franke, J. Krauth, M. Diepold, F. Fratini, L. Safari, J. Machado,
A. Antognini, F. Kottmann, P. Indelicato, R. Pohl, J. Santos, Physical Review
A 92 (2015).
date_created: 2018-12-11T11:53:30Z
date_published: 2015-08-28T00:00:00Z
date_updated: 2021-01-12T06:52:34Z
day: '28'
department:
- _id: MiLe
doi: 10.1103/PhysRevA.92.022514
ec_funded: 1
intvolume: ' 92'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1506.02734
month: '08'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review A
publication_status: published
publisher: American Physical Society
publist_id: '5451'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantum interference effects in laser spectroscopy of muonic hydrogen, deuterium,
and helium-3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1690'
abstract:
- lang: eng
text: A number of powerful and scalable hybrid systems model checkers have recently
emerged. Although all of them honor roughly the same hybrid systems semantics,
they have drastically different model description languages. This situation (a)
makes it difficult to quickly evaluate a specific hybrid automaton model using
the different tools, (b) obstructs comparisons of reachability approaches, and
(c) impedes the widespread application of research results that perform model
modification and could benefit many of the tools. In this paper, we present Hyst,
a Hybrid Source Transformer. Hyst is a source-to-source translation tool, currently
taking input in the SpaceEx model format, and translating to the formats of HyCreate,
Flow∗, or dReach. Internally, the tool supports generic model-to-model transformation
passes that serve to both ease the translation and potentially improve reachability
results for the supported tools. Although these model transformation passes could
be implemented within each tool, the Hyst approach provides a single place for
model modification, generating modified input sources for the unmodified target
tools. Our evaluation demonstrates Hyst is capable of automatically translating
benchmarks in several classes (including affine and nonlinear hybrid automata)
to the input formats of several tools. Additionally, we illustrate a general model
transformation pass based on pseudo-invariants implemented in Hyst that illustrates
the reachability improvement.
acknowledgement: The material presented in this paper is based upon work sup-ported
by the Air Force Research Laboratory’s Information Directorate (AFRL/RI) through
the Visiting Faculty Research Program (VFRP) under contract number FA8750-13-2-0115
and the Air Force Office of Scientific Research (AFOSR). Any opinions,findings,
and conclusions or recommendations expressed in this publication are those of the
authors and do not necessarily reflect the views of the AFRL/RI or AFOSR. This work
was also partly supported in part by the German Research Foundation (DFG) as part
of the Transregional Collaborative Research Center “Automatic Verification and Analysis
of Complex Systems” (SFB/TR14 AVACS, http://www.avacs.org/), by the European Research
Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF)
under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).
author:
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Taylor
full_name: Johnson, Taylor
last_name: Johnson
citation:
ama: 'Bak S, Bogomolov S, Johnson T. HYST: A source transformation and translation
tool for hybrid automaton models. In: Springer; 2015:128-133. doi:10.1145/2728606.2728630'
apa: 'Bak, S., Bogomolov, S., & Johnson, T. (2015). HYST: A source transformation
and translation tool for hybrid automaton models (pp. 128–133). Presented at the
HSCC: Hybrid Systems - Computation and Control, Seattle, WA, United States: Springer.
https://doi.org/10.1145/2728606.2728630'
chicago: 'Bak, Stanley, Sergiy Bogomolov, and Taylor Johnson. “HYST: A Source Transformation
and Translation Tool for Hybrid Automaton Models,” 128–33. Springer, 2015. https://doi.org/10.1145/2728606.2728630.'
ieee: 'S. Bak, S. Bogomolov, and T. Johnson, “HYST: A source transformation and
translation tool for hybrid automaton models,” presented at the HSCC: Hybrid Systems
- Computation and Control, Seattle, WA, United States, 2015, pp. 128–133.'
ista: 'Bak S, Bogomolov S, Johnson T. 2015. HYST: A source transformation and translation
tool for hybrid automaton models. HSCC: Hybrid Systems - Computation and Control,
128–133.'
mla: 'Bak, Stanley, et al. HYST: A Source Transformation and Translation Tool
for Hybrid Automaton Models. Springer, 2015, pp. 128–33, doi:10.1145/2728606.2728630.'
short: S. Bak, S. Bogomolov, T. Johnson, in:, Springer, 2015, pp. 128–133.
conference:
end_date: 2015-04-16
location: Seattle, WA, United States
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2015-04-14
date_created: 2018-12-11T11:53:29Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2021-01-12T06:52:33Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2728606.2728630
ec_funded: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 128 - 133
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5454'
quality_controlled: '1'
status: public
title: 'HYST: A source transformation and translation tool for hybrid automaton models'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1691'
abstract:
- lang: eng
text: We consider a case study of the problem of deploying an autonomous air vehicle
in a partially observable, dynamic, indoor environment from a specification given
as a linear temporal logic (LTL) formula over regions of interest. We model the
motion and sensing capabilities of the vehicle as a partially observable Markov
decision process (POMDP). We adapt recent results for solving POMDPs with parity
objectives to generate a control policy. We also extend the existing framework
with a policy minimization technique to obtain a better implementable policy,
while preserving its correctness. The proposed techniques are illustrated in an
experimental setup involving an autonomous quadrotor performing surveillance in
a dynamic environment.
author:
- first_name: Mária
full_name: Svoreňová, Mária
last_name: Svoreňová
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Kevin
full_name: Leahy, Kevin
last_name: Leahy
- first_name: Hasan
full_name: Eniser, Hasan
last_name: Eniser
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ivana
full_name: Cěrná, Ivana
last_name: Cěrná
- first_name: Cǎlin
full_name: Belta, Cǎlin
last_name: Belta
citation:
ama: 'Svoreňová M, Chmelik M, Leahy K, et al. Temporal logic motion planning using
POMDPs with parity objectives: Case study paper. In: Proceedings of the 18th
International Conference on Hybrid Systems: Computation and Control. ACM;
2015:233-238. doi:10.1145/2728606.2728617'
apa: 'Svoreňová, M., Chmelik, M., Leahy, K., Eniser, H., Chatterjee, K., Cěrná,
I., & Belta, C. (2015). Temporal logic motion planning using POMDPs with parity
objectives: Case study paper. In Proceedings of the 18th International Conference
on Hybrid Systems: Computation and Control (pp. 233–238). Seattle, WA, United
States: ACM. https://doi.org/10.1145/2728606.2728617'
chicago: 'Svoreňová, Mária, Martin Chmelik, Kevin Leahy, Hasan Eniser, Krishnendu
Chatterjee, Ivana Cěrná, and Cǎlin Belta. “Temporal Logic Motion Planning Using
POMDPs with Parity Objectives: Case Study Paper.” In Proceedings of the 18th
International Conference on Hybrid Systems: Computation and Control, 233–38.
ACM, 2015. https://doi.org/10.1145/2728606.2728617.'
ieee: 'M. Svoreňová et al., “Temporal logic motion planning using POMDPs
with parity objectives: Case study paper,” in Proceedings of the 18th International
Conference on Hybrid Systems: Computation and Control, Seattle, WA, United
States, 2015, pp. 233–238.'
ista: 'Svoreňová M, Chmelik M, Leahy K, Eniser H, Chatterjee K, Cěrná I, Belta C.
2015. Temporal logic motion planning using POMDPs with parity objectives: Case
study paper. Proceedings of the 18th International Conference on Hybrid Systems:
Computation and Control. HSCC: Hybrid Systems - Computation and Control, 233–238.'
mla: 'Svoreňová, Mária, et al. “Temporal Logic Motion Planning Using POMDPs with
Parity Objectives: Case Study Paper.” Proceedings of the 18th International
Conference on Hybrid Systems: Computation and Control, ACM, 2015, pp. 233–38,
doi:10.1145/2728606.2728617.'
short: 'M. Svoreňová, M. Chmelik, K. Leahy, H. Eniser, K. Chatterjee, I. Cěrná,
C. Belta, in:, Proceedings of the 18th International Conference on Hybrid Systems:
Computation and Control, ACM, 2015, pp. 233–238.'
conference:
end_date: 2015-04-16
location: Seattle, WA, United States
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2015-04-14
date_created: 2018-12-11T11:53:29Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2021-01-12T06:52:33Z
day: '14'
department:
- _id: KrCh
doi: 10.1145/2728606.2728617
ec_funded: 1
language:
- iso: eng
month: '04'
oa_version: None
page: 233 - 238
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 'Proceedings of the 18th International Conference on Hybrid Systems:
Computation and Control'
publication_status: published
publisher: ACM
publist_id: '5453'
scopus_import: 1
status: public
title: 'Temporal logic motion planning using POMDPs with parity objectives: Case study
paper'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1694'
abstract:
- lang: eng
text: "\r\nWe introduce quantitative timed refinement and timed simulation (directed)
metrics, incorporating zenoness checks, for timed systems. These metrics assign
positive real numbers which quantify the timing mismatches between two timed systems,
amongst non-zeno runs. We quantify timing mismatches in three ways: (1) the maximal
timing mismatch that can arise, (2) the “steady-state” maximal timing mismatches,
where initial transient timing mismatches are ignored; and (3) the (long-run)
average timing mismatches amongst two systems. These three kinds of mismatches
constitute three important types of timing differences. Our event times are the
global times, measured from the start of the system execution, not just the time
durations of individual steps. We present algorithms over timed automata for computing
the three quantitative simulation distances to within any desired degree of accuracy.
In order to compute the values of the quantitative simulation distances, we use
a game theoretic formulation. We introduce two new kinds of objectives for two
player games on finite-state game graphs: (1) eventual debit-sum level objectives,
and (2) average debit-sum level objectives. We present algorithms for computing
the optimal values for these objectives in graph games, and then use these algorithms
to compute the values of the timed simulation distances over timed automata.\r\n"
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: Chatterjee K, Prabhu V. Quantitative temporal simulation and refinement distances
for timed systems. IEEE Transactions on Automatic Control. 2015;60(9):2291-2306.
doi:10.1109/TAC.2015.2404612
apa: Chatterjee, K., & Prabhu, V. (2015). Quantitative temporal simulation and
refinement distances for timed systems. IEEE Transactions on Automatic Control.
IEEE. https://doi.org/10.1109/TAC.2015.2404612
chicago: Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation
and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic
Control. IEEE, 2015. https://doi.org/10.1109/TAC.2015.2404612.
ieee: K. Chatterjee and V. Prabhu, “Quantitative temporal simulation and refinement
distances for timed systems,” IEEE Transactions on Automatic Control, vol.
60, no. 9. IEEE, pp. 2291–2306, 2015.
ista: Chatterjee K, Prabhu V. 2015. Quantitative temporal simulation and refinement
distances for timed systems. IEEE Transactions on Automatic Control. 60(9), 2291–2306.
mla: Chatterjee, Krishnendu, and Vinayak Prabhu. “Quantitative Temporal Simulation
and Refinement Distances for Timed Systems.” IEEE Transactions on Automatic
Control, vol. 60, no. 9, IEEE, 2015, pp. 2291–306, doi:10.1109/TAC.2015.2404612.
short: K. Chatterjee, V. Prabhu, IEEE Transactions on Automatic Control 60 (2015)
2291–2306.
date_created: 2018-12-11T11:53:30Z
date_published: 2015-02-24T00:00:00Z
date_updated: 2021-01-12T06:52:34Z
day: '24'
department:
- _id: KrCh
doi: 10.1109/TAC.2015.2404612
ec_funded: 1
intvolume: ' 60'
issue: '9'
language:
- iso: eng
month: '02'
oa_version: None
page: 2291 - 2306
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: IEEE Transactions on Automatic Control
publication_status: published
publisher: IEEE
publist_id: '5450'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative temporal simulation and refinement distances for timed systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2015'
...
---
_id: '1695'
abstract:
- lang: eng
text: We give a comprehensive introduction into a diagrammatic method that allows
for the evaluation of Gutzwiller wave functions in finite spatial dimensions.
We discuss in detail some numerical schemes that turned out to be useful in the
real-space evaluation of the diagrams. The method is applied to the problem of
d-wave superconductivity in a two-dimensional single-band Hubbard model. Here,
we discuss in particular the role of long-range contributions in our diagrammatic
expansion. We further reconsider our previous analysis on the kinetic energy gain
in the superconducting state.
author:
- first_name: Jan
full_name: Kaczmarczyk, Jan
id: 46C405DE-F248-11E8-B48F-1D18A9856A87
last_name: Kaczmarczyk
orcid: 0000-0002-1629-3675
- first_name: Tobias
full_name: Schickling, Tobias
last_name: Schickling
- first_name: Jörg
full_name: Bünemann, Jörg
last_name: Bünemann
citation:
ama: 'Kaczmarczyk J, Schickling T, Bünemann J. Evaluation techniques for Gutzwiller
wave functions in finite dimensions. Physica Status Solidi (B): Basic Solid
State Physics. 2015;252(9):2059-2071. doi:10.1002/pssb.201552082'
apa: 'Kaczmarczyk, J., Schickling, T., & Bünemann, J. (2015). Evaluation techniques
for Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B):
Basic Solid State Physics. Wiley. https://doi.org/10.1002/pssb.201552082'
chicago: 'Kaczmarczyk, Jan, Tobias Schickling, and Jörg Bünemann. “Evaluation Techniques
for Gutzwiller Wave Functions in Finite Dimensions.” Physica Status Solidi
(B): Basic Solid State Physics. Wiley, 2015. https://doi.org/10.1002/pssb.201552082.'
ieee: 'J. Kaczmarczyk, T. Schickling, and J. Bünemann, “Evaluation techniques for
Gutzwiller wave functions in finite dimensions,” Physica Status Solidi (B):
Basic Solid State Physics, vol. 252, no. 9. Wiley, pp. 2059–2071, 2015.'
ista: 'Kaczmarczyk J, Schickling T, Bünemann J. 2015. Evaluation techniques for
Gutzwiller wave functions in finite dimensions. Physica Status Solidi (B): Basic
Solid State Physics. 252(9), 2059–2071.'
mla: 'Kaczmarczyk, Jan, et al. “Evaluation Techniques for Gutzwiller Wave Functions
in Finite Dimensions.” Physica Status Solidi (B): Basic Solid State Physics,
vol. 252, no. 9, Wiley, 2015, pp. 2059–71, doi:10.1002/pssb.201552082.'
short: 'J. Kaczmarczyk, T. Schickling, J. Bünemann, Physica Status Solidi (B): Basic
Solid State Physics 252 (2015) 2059–2071.'
date_created: 2018-12-11T11:53:31Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:52:34Z
day: '01'
department:
- _id: MiLe
doi: 10.1002/pssb.201552082
ec_funded: 1
intvolume: ' 252'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1503.03738
month: '09'
oa: 1
oa_version: Preprint
page: 2059 - 2071
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: 'Physica Status Solidi (B): Basic Solid State Physics'
publication_status: published
publisher: Wiley
publist_id: '5449'
quality_controlled: '1'
scopus_import: 1
status: public
title: Evaluation techniques for Gutzwiller wave functions in finite dimensions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 252
year: '2015'
...
---
_id: '1697'
abstract:
- lang: eng
text: Motion tracking is a challenge the visual system has to solve by reading out
the retinal population. It is still unclear how the information from different
neurons can be combined together to estimate the position of an object. Here we
recorded a large population of ganglion cells in a dense patch of salamander and
guinea pig retinas while displaying a bar moving diffusively. We show that the
bar’s position can be reconstructed from retinal activity with a precision in
the hyperacuity regime using a linear decoder acting on 100+ cells. We then took
advantage of this unprecedented precision to explore the spatial structure of
the retina’s population code. The classical view would have suggested that the
firing rates of the cells form a moving hill of activity tracking the bar’s position.
Instead, we found that most ganglion cells in the salamander fired sparsely and
idiosyncratically, so that their neural image did not track the bar. Furthermore,
ganglion cell activity spanned an area much larger than predicted by their receptive
fields, with cells coding for motion far in their surround. As a result, population
redundancy was high, and we could find multiple, disjoint subsets of neurons that
encoded the trajectory with high precision. This organization allows for diverse
collections of ganglion cells to represent high-accuracy motion information in
a form easily read out by downstream neural circuits.
acknowledgement: 'This work was supported by grants EY 014196 and EY 017934 to MJB,
ANR OPTIMA, the French State program Investissements d’Avenir managed by the Agence
Nationale de la Recherche [LIFESENSES: ANR-10-LABX-65], and by a EC grant from the
Human Brain Project (CLAP) to OM, the Austrian Research Foundation FWF P25651 to
VBS and GT. VBS is partially supported by contracts MEC, Spain (Grant No. AYA2010-
22111-C03-02, Grant No. AYA2013-48623-C2-2 and FEDER Funds).'
article_number: e1004304
author:
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Vicente
full_name: Botella Soler, Vicente
id: 421234E8-F248-11E8-B48F-1D18A9856A87
last_name: Botella Soler
orcid: 0000-0002-8790-1914
- first_name: Kristina
full_name: Simmons, Kristina
last_name: Simmons
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. High accuracy
decoding of dynamical motion from a large retinal population. PLoS Computational
Biology. 2015;11(7). doi:10.1371/journal.pcbi.1004304
apa: Marre, O., Botella Soler, V., Simmons, K., Mora, T., Tkačik, G., & Berry,
M. (2015). High accuracy decoding of dynamical motion from a large retinal population.
PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004304
chicago: Marre, Olivier, Vicente Botella Soler, Kristina Simmons, Thierry Mora,
Gašper Tkačik, and Michael Berry. “High Accuracy Decoding of Dynamical Motion
from a Large Retinal Population.” PLoS Computational Biology. Public Library
of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004304.
ieee: O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, and M. Berry,
“High accuracy decoding of dynamical motion from a large retinal population,”
PLoS Computational Biology, vol. 11, no. 7. Public Library of Science,
2015.
ista: Marre O, Botella Soler V, Simmons K, Mora T, Tkačik G, Berry M. 2015. High
accuracy decoding of dynamical motion from a large retinal population. PLoS Computational
Biology. 11(7), e1004304.
mla: Marre, Olivier, et al. “High Accuracy Decoding of Dynamical Motion from a Large
Retinal Population.” PLoS Computational Biology, vol. 11, no. 7, e1004304,
Public Library of Science, 2015, doi:10.1371/journal.pcbi.1004304.
short: O. Marre, V. Botella Soler, K. Simmons, T. Mora, G. Tkačik, M. Berry, PLoS
Computational Biology 11 (2015).
date_created: 2018-12-11T11:53:31Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2021-01-12T06:52:35Z
day: '01'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004304
file:
- access_level: open_access
checksum: 472b979f3f1cffb37b3e503f085115ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:25Z
date_updated: 2020-07-14T12:45:12Z
file_id: '5212'
file_name: IST-2016-455-v1+1_journal.pcbi.1004304.pdf
file_size: 4673930
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '7'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 254D1A94-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 25651-N26
name: Sensitivity to higher-order statistics in natural scenes
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5447'
pubrep_id: '455'
quality_controlled: '1'
scopus_import: 1
status: public
title: High accuracy decoding of dynamical motion from a large retinal population
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: 11
year: '2015'
...
---
_id: '1699'
abstract:
- lang: eng
text: By hybridization and backcrossing, alleles can surmount species boundaries
and be incorporated into the genome of a related species. This introgression of
genes is of particular evolutionary relevance if it involves the transfer of adaptations
between populations. However, any beneficial allele will typically be associated
with other alien alleles that are often deleterious and hamper the introgression
process. In order to describe the introgression of an adaptive allele, we set
up a stochastic model with an explicit genetic makeup of linked and unlinked deleterious
alleles. Based on the theory of reducible multitype branching processes, we derive
a recursive expression for the establishment probability of the beneficial allele
after a single hybridization event. We furthermore study the probability that
slightly deleterious alleles hitchhike to fixation. The key to the analysis is
a split of the process into a stochastic phase in which the advantageous alleles
establishes and a deterministic phase in which it sweeps to fixation. We thereafter
apply the theory to a set of biologically relevant scenarios such as introgression
in the presence of many unlinked or few closely linked deleterious alleles. A
comparison to computer simulations shows that the approximations work well over
a large parameter range.
acknowledgement: This work was made possible with financial support by the Vienna
Science and Technology Fund (WWTF), by the Deutsche Forschungsgemeinschaft (DFG),
Research Unit 1078 Natural selection in structured populations, by the Austrian
Science Fund (FWF) via funding for the Vienna Graduate School for Population Genetics,
and by a “For Women in Science” fellowship (L’Oréal Österreich in cooperation with
the Austrian Commission for UNESCO and the Austrian Academy of Sciences with financial
support from the Federal Ministry for Science and Research Austria).
author:
- first_name: Hildegard
full_name: Uecker, Hildegard
id: 2DB8F68A-F248-11E8-B48F-1D18A9856A87
last_name: Uecker
orcid: 0000-0001-9435-2813
- first_name: Derek
full_name: Setter, Derek
last_name: Setter
- first_name: Joachim
full_name: Hermisson, Joachim
last_name: Hermisson
citation:
ama: Uecker H, Setter D, Hermisson J. Adaptive gene introgression after secondary
contact. Journal of Mathematical Biology. 2015;70(7):1523-1580. doi:10.1007/s00285-014-0802-y
apa: Uecker, H., Setter, D., & Hermisson, J. (2015). Adaptive gene introgression
after secondary contact. Journal of Mathematical Biology. Springer. https://doi.org/10.1007/s00285-014-0802-y
chicago: Uecker, Hildegard, Derek Setter, and Joachim Hermisson. “Adaptive Gene
Introgression after Secondary Contact.” Journal of Mathematical Biology.
Springer, 2015. https://doi.org/10.1007/s00285-014-0802-y.
ieee: H. Uecker, D. Setter, and J. Hermisson, “Adaptive gene introgression after
secondary contact,” Journal of Mathematical Biology, vol. 70, no. 7. Springer,
pp. 1523–1580, 2015.
ista: Uecker H, Setter D, Hermisson J. 2015. Adaptive gene introgression after secondary
contact. Journal of Mathematical Biology. 70(7), 1523–1580.
mla: Uecker, Hildegard, et al. “Adaptive Gene Introgression after Secondary Contact.”
Journal of Mathematical Biology, vol. 70, no. 7, Springer, 2015, pp. 1523–80,
doi:10.1007/s00285-014-0802-y.
short: H. Uecker, D. Setter, J. Hermisson, Journal of Mathematical Biology 70 (2015)
1523–1580.
date_created: 2018-12-11T11:53:32Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:10:36Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1007/s00285-014-0802-y
file:
- access_level: open_access
checksum: 00e3a67bda05d4cc165b3a48b41ef9ad
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:27Z
date_updated: 2020-07-14T12:45:12Z
file_id: '5079'
file_name: IST-2016-458-v1+1_s00285-014-0802-y.pdf
file_size: 1321527
relation: main_file
file_date_updated: 2020-07-14T12:45:12Z
has_accepted_license: '1'
intvolume: ' 70'
issue: '7'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1523 - 1580
project:
- _id: 25B67606-B435-11E9-9278-68D0E5697425
name: L'OREAL Fellowship
publication: Journal of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '5442'
pubrep_id: '458'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptive gene introgression after secondary contact
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: 70
year: '2015'
...
---
_id: '1696'
abstract:
- lang: eng
text: The recently proposed diagrammatic expansion (DE) technique for the full Gutzwiller
wave function (GWF) is applied to the Anderson lattice model. This approach allows
for a systematic evaluation of the expectation values with full Gutzwiller wave
function in finite-dimensional systems. It introduces results extending in an
essential manner those obtained by means of the standard Gutzwiller approximation
(GA), which is variationally exact only in infinite dimensions. Within the DE-GWF
approach we discuss the principal paramagnetic properties and their relevance
to heavy-fermion systems. We demonstrate the formation of an effective, narrow
f band originating from atomic f-electron states and subsequently interpret this
behavior as a direct itineracy of f electrons; it represents a combined effect
of both the hybridization and the correlations induced by the Coulomb repulsive
interaction. Such a feature is absent on the level of GA, which is equivalent
to the zeroth order of our expansion. Formation of the hybridization- and electron-concentration-dependent
narrow f band rationalizes the common assumption of such dispersion of f levels
in the phenomenological modeling of the band structure of CeCoIn5. Moreover, it
is shown that the emerging f-electron direct itineracy leads in a natural manner
to three physically distinct regimes within a single model that are frequently
discussed for 4f- or 5f-electron compounds as separate model situations. We identify
these regimes as (i) the mixed-valence regime, (ii) Kondo/almost-Kondo insulating
regime, and (iii) the Kondo-lattice limit when the f-electron occupancy is very
close to the f-state half filling, ⟨nˆf⟩→1. The nonstandard features of the emerging
correlated quantum liquid state are stressed.
acknowledgement: The work was partly supported by the National Science Centre (NCN)
under MAESTRO, Grant No. DEC-2012/04/A/ST3/00342. M.W. acknowledges the hospitality
of the Institute of Science and Technology Austria during the final stage of development
of the present work, as well as partial financial support from the Society-Environment-Technology
project of the Jagiellonian University for that stay. J.K. acknowledges support
from the People Programme (Marie Curie Actions) of the European Union's Seventh
Framework Programme (FP7/2007-2013) under REA Grant Agreement No. [291734 ].
article_number: '125135'
author:
- first_name: Marcin
full_name: Wysokiński, Marcin
last_name: Wysokiński
- first_name: Jan
full_name: Kaczmarczyk, Jan
id: 46C405DE-F248-11E8-B48F-1D18A9856A87
last_name: Kaczmarczyk
orcid: 0000-0002-1629-3675
- first_name: Jozef
full_name: Spałek, Jozef
last_name: Spałek
citation:
ama: 'Wysokiński M, Kaczmarczyk J, Spałek J. Gutzwiller wave function solution for
Anderson lattice model: Emerging universal regimes of heavy quasiparticle states.
Physical Review B. 2015;92(12). doi:10.1103/PhysRevB.92.125135'
apa: 'Wysokiński, M., Kaczmarczyk, J., & Spałek, J. (2015). Gutzwiller wave
function solution for Anderson lattice model: Emerging universal regimes of heavy
quasiparticle states. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.92.125135'
chicago: 'Wysokiński, Marcin, Jan Kaczmarczyk, and Jozef Spałek. “Gutzwiller Wave
Function Solution for Anderson Lattice Model: Emerging Universal Regimes of Heavy
Quasiparticle States.” Physical Review B. American Physical Society, 2015.
https://doi.org/10.1103/PhysRevB.92.125135.'
ieee: 'M. Wysokiński, J. Kaczmarczyk, and J. Spałek, “Gutzwiller wave function solution
for Anderson lattice model: Emerging universal regimes of heavy quasiparticle
states,” Physical Review B, vol. 92, no. 12. American Physical Society,
2015.'
ista: 'Wysokiński M, Kaczmarczyk J, Spałek J. 2015. Gutzwiller wave function solution
for Anderson lattice model: Emerging universal regimes of heavy quasiparticle
states. Physical Review B. 92(12), 125135.'
mla: 'Wysokiński, Marcin, et al. “Gutzwiller Wave Function Solution for Anderson
Lattice Model: Emerging Universal Regimes of Heavy Quasiparticle States.” Physical
Review B, vol. 92, no. 12, 125135, American Physical Society, 2015, doi:10.1103/PhysRevB.92.125135.'
short: M. Wysokiński, J. Kaczmarczyk, J. Spałek, Physical Review B 92 (2015).
date_created: 2018-12-11T11:53:31Z
date_published: 2015-09-18T00:00:00Z
date_updated: 2021-01-12T06:52:35Z
day: '18'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.92.125135
ec_funded: 1
intvolume: ' 92'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1505.07003
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '5448'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Gutzwiller wave function solution for Anderson lattice model: Emerging universal
regimes of heavy quasiparticle states'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1701'
abstract:
- lang: eng
text: 'The activity of a neural network is defined by patterns of spiking and silence
from the individual neurons. Because spikes are (relatively) sparse, patterns
of activity with increasing numbers of spikes are less probable, but, with more
spikes, the number of possible patterns increases. This tradeoff between probability
and numerosity is mathematically equivalent to the relationship between entropy
and energy in statistical physics. We construct this relationship for populations
of up to N = 160 neurons in a small patch of the vertebrate retina, using a combination
of direct and model-based analyses of experiments on the response of this network
to naturalistic movies. We see signs of a thermodynamic limit, where the entropy
per neuron approaches a smooth function of the energy per neuron as N increases.
The form of this function corresponds to the distribution of activity being poised
near an unusual kind of critical point. We suggest further tests of criticality,
and give a brief discussion of its functional significance. '
acknowledgement: "Research was supported in part by National Science Foundation Grants
PHY-1305525, PHY-1451171, and CCF-0939370, by National Institutes of Health Grant
R01 EY14196, and by Austrian Science Foundation Grant FWF P25651. Additional support
was provided by the\r\nFannie and John Hertz Foundation, by the Swartz Foundation,
by the W. M. Keck Foundation, and by the Simons Foundation."
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Thierry
full_name: Mora, Thierry
last_name: Mora
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Dario
full_name: Amodei, Dario
last_name: Amodei
- first_name: Stephanie
full_name: Palmer, Stephanie
last_name: Palmer
- first_name: Michael
full_name: Berry Ii, Michael
last_name: Berry Ii
- first_name: William
full_name: Bialek, William
last_name: Bialek
citation:
ama: Tkačik G, Mora T, Marre O, et al. Thermodynamics and signatures of criticality
in a network of neurons. PNAS. 2015;112(37):11508-11513. doi:10.1073/pnas.1514188112
apa: Tkačik, G., Mora, T., Marre, O., Amodei, D., Palmer, S., Berry Ii, M., &
Bialek, W. (2015). Thermodynamics and signatures of criticality in a network of
neurons. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1514188112
chicago: Tkačik, Gašper, Thierry Mora, Olivier Marre, Dario Amodei, Stephanie Palmer,
Michael Berry Ii, and William Bialek. “Thermodynamics and Signatures of Criticality
in a Network of Neurons.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1514188112.
ieee: G. Tkačik et al., “Thermodynamics and signatures of criticality in
a network of neurons,” PNAS, vol. 112, no. 37. National Academy of Sciences,
pp. 11508–11513, 2015.
ista: Tkačik G, Mora T, Marre O, Amodei D, Palmer S, Berry Ii M, Bialek W. 2015.
Thermodynamics and signatures of criticality in a network of neurons. PNAS. 112(37),
11508–11513.
mla: Tkačik, Gašper, et al. “Thermodynamics and Signatures of Criticality in a Network
of Neurons.” PNAS, vol. 112, no. 37, National Academy of Sciences, 2015,
pp. 11508–13, doi:10.1073/pnas.1514188112.
short: G. Tkačik, T. Mora, O. Marre, D. Amodei, S. Palmer, M. Berry Ii, W. Bialek,
PNAS 112 (2015) 11508–11513.
date_created: 2018-12-11T11:53:33Z
date_published: 2015-09-15T00:00:00Z
date_updated: 2021-01-12T06:52:37Z
day: '15'
department:
- _id: GaTk
doi: 10.1073/pnas.1514188112
external_id:
pmid:
- '26330611'
intvolume: ' 112'
issue: '37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4577210/
month: '09'
oa: 1
oa_version: Submitted Version
page: 11508 - 11513
pmid: 1
project:
- _id: 254D1A94-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 25651-N26
name: Sensitivity to higher-order statistics in natural scenes
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5440'
quality_controlled: '1'
scopus_import: 1
status: public
title: Thermodynamics and signatures of criticality in a network of neurons
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1698'
abstract:
- lang: eng
text: 'In mean-payoff games, the objective of the protagonist is to ensure that
the limit average of an infinite sequence of numeric weights is nonnegative. In
energy games, the objective is to ensure that the running sum of weights is always
nonnegative. Multi-mean-payoff and multi-energy games replace individual weights
by tuples, and the limit average (resp., running sum) of each coordinate must
be (resp., remain) nonnegative. We prove finite-memory determinacy of multi-energy
games and show inter-reducibility of multi-mean-payoff and multi-energy games
for finite-memory strategies. We improve the computational complexity for solving
both classes with finite-memory strategies: we prove coNP-completeness improving
the previous known EXPSPACE bound. For memoryless strategies, we show that deciding
the existence of a winning strategy for the protagonist is NP-complete. We present
the first solution of multi-mean-payoff games with infinite-memory strategies:
we show that mean-payoff-sup objectives can be decided in NP∩coNP, whereas mean-payoff-inf
objectives are coNP-complete.'
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 and S11402-N23 (RiSE), ERC Start
grant (279307: Graph Games), Microsoft faculty fellows award, the ERC Advanced Grant
QUAREM (267989: Quantitative Reactive Modeling), European project Cassting (FP7-601148),
ERC Start grant (279499: inVEST).'
author:
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
- 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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Alexander
full_name: Rabinovich, Alexander
last_name: Rabinovich
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. The
complexity of multi-mean-payoff and multi-energy games. Information and Computation.
2015;241(4):177-196. doi:10.1016/j.ic.2015.03.001
apa: Velner, Y., Chatterjee, K., Doyen, L., Henzinger, T. A., Rabinovich, A., &
Raskin, J. (2015). The complexity of multi-mean-payoff and multi-energy games.
Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2015.03.001
chicago: Velner, Yaron, Krishnendu Chatterjee, Laurent Doyen, Thomas A Henzinger,
Alexander Rabinovich, and Jean Raskin. “The Complexity of Multi-Mean-Payoff and
Multi-Energy Games.” Information and Computation. Elsevier, 2015. https://doi.org/10.1016/j.ic.2015.03.001.
ieee: Y. Velner, K. Chatterjee, L. Doyen, T. A. Henzinger, A. Rabinovich, and J.
Raskin, “The complexity of multi-mean-payoff and multi-energy games,” Information
and Computation, vol. 241, no. 4. Elsevier, pp. 177–196, 2015.
ista: Velner Y, Chatterjee K, Doyen L, Henzinger TA, Rabinovich A, Raskin J. 2015.
The complexity of multi-mean-payoff and multi-energy games. Information and Computation.
241(4), 177–196.
mla: Velner, Yaron, et al. “The Complexity of Multi-Mean-Payoff and Multi-Energy
Games.” Information and Computation, vol. 241, no. 4, Elsevier, 2015, pp.
177–96, doi:10.1016/j.ic.2015.03.001.
short: Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A. Rabinovich, J. Raskin,
Information and Computation 241 (2015) 177–196.
date_created: 2018-12-11T11:53:32Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:52:36Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1016/j.ic.2015.03.001
ec_funded: 1
intvolume: ' 241'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1209.3234
month: '04'
oa: 1
oa_version: Preprint
page: 177 - 196
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: 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: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Information and Computation
publication_status: published
publisher: Elsevier
publist_id: '5443'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of multi-mean-payoff and multi-energy games
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 241
year: '2015'
...
---
_id: '1700'
abstract:
- lang: eng
text: We use the dual boson approach to reveal the phase diagram of the Fermi-Hubbard
model with long-range dipole-dipole interactions. By using a large-scale finite-temperature
calculation on a 64×64 square lattice we demonstrate the existence of a novel
phase, possessing an "ultralong-range" order. The fingerprint of this
phase - the density correlation function - features a nontrivial behavior on a
scale of tens of lattice sites. We study the properties and the stability of the
ultralong-range-ordered phase, and show that it is accessible in modern experiments
with ultracold polar molecules and magnetic atoms.
acknowledgement: The work is supported by European Research Council (ERC) Advanced
Grant No. 338957 FEMTO/NANO.
article_number: '081106'
author:
- first_name: Erik
full_name: Van Loon, Erik
last_name: Van Loon
- first_name: Mikhail
full_name: Katsnelson, Mikhail
last_name: Katsnelson
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Van Loon E, Katsnelson M, Lemeshko M. Ultralong-range order in the Fermi-Hubbard
model with long-range interactions. Physical Review B. 2015;92(8). doi:10.1103/PhysRevB.92.081106
apa: Van Loon, E., Katsnelson, M., & Lemeshko, M. (2015). Ultralong-range order
in the Fermi-Hubbard model with long-range interactions. Physical Review B.
American Physical Society. https://doi.org/10.1103/PhysRevB.92.081106
chicago: Van Loon, Erik, Mikhail Katsnelson, and Mikhail Lemeshko. “Ultralong-Range
Order in the Fermi-Hubbard Model with Long-Range Interactions.” Physical Review
B. American Physical Society, 2015. https://doi.org/10.1103/PhysRevB.92.081106.
ieee: E. Van Loon, M. Katsnelson, and M. Lemeshko, “Ultralong-range order in the
Fermi-Hubbard model with long-range interactions,” Physical Review B, vol.
92, no. 8. American Physical Society, 2015.
ista: Van Loon E, Katsnelson M, Lemeshko M. 2015. Ultralong-range order in the Fermi-Hubbard
model with long-range interactions. Physical Review B. 92(8), 081106.
mla: Van Loon, Erik, et al. “Ultralong-Range Order in the Fermi-Hubbard Model with
Long-Range Interactions.” Physical Review B, vol. 92, no. 8, 081106, American
Physical Society, 2015, doi:10.1103/PhysRevB.92.081106.
short: E. Van Loon, M. Katsnelson, M. Lemeshko, Physical Review B 92 (2015).
date_created: 2018-12-11T11:53:32Z
date_published: 2015-08-10T00:00:00Z
date_updated: 2021-01-12T06:52:37Z
day: '10'
department:
- _id: MiLe
doi: 10.1103/PhysRevB.92.081106
intvolume: ' 92'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1506.06007
month: '08'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_status: published
publisher: American Physical Society
publist_id: '5441'
scopus_import: 1
status: public
title: Ultralong-range order in the Fermi-Hubbard model with long-range interactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 92
year: '2015'
...
---
_id: '1704'
abstract:
- lang: eng
text: Given a convex function (Formula presented.) and two hermitian matrices A
and B, Lewin and Sabin study in (Lett Math Phys 104:691–705, 2014) the relative
entropy defined by (Formula presented.). Among other things, they prove that the
so-defined quantity is monotone if and only if (Formula presented.) is operator
monotone. The monotonicity is then used to properly define (Formula presented.)
for bounded self-adjoint operators acting on an infinite-dimensional Hilbert space
by a limiting procedure. More precisely, for an increasing sequence of finite-dimensional
projections (Formula presented.) with (Formula presented.) strongly, the limit
(Formula presented.) is shown to exist and to be independent of the sequence of
projections (Formula presented.). The question whether this sequence converges
to its "obvious" limit, namely (Formula presented.), has been left open.
We answer this question in principle affirmatively and show that (Formula presented.).
If the operators A and B are regular enough, that is (A − B), (Formula presented.)
and (Formula presented.) are trace-class, the identity (Formula presented.) holds.
author:
- first_name: Andreas
full_name: Deuchert, Andreas
last_name: Deuchert
orcid: 0000-0003-3146-6746
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Deuchert A, Hainzl C, Seiringer R. Note on a family of monotone quantum relative
entropies. Letters in Mathematical Physics. 2015;105(10):1449-1466. doi:10.1007/s11005-015-0787-5
apa: Deuchert, A., Hainzl, C., & Seiringer, R. (2015). Note on a family of monotone
quantum relative entropies. Letters in Mathematical Physics. Springer.
https://doi.org/10.1007/s11005-015-0787-5
chicago: Deuchert, Andreas, Christian Hainzl, and Robert Seiringer. “Note on a Family
of Monotone Quantum Relative Entropies.” Letters in Mathematical Physics.
Springer, 2015. https://doi.org/10.1007/s11005-015-0787-5.
ieee: A. Deuchert, C. Hainzl, and R. Seiringer, “Note on a family of monotone quantum
relative entropies,” Letters in Mathematical Physics, vol. 105, no. 10.
Springer, pp. 1449–1466, 2015.
ista: Deuchert A, Hainzl C, Seiringer R. 2015. Note on a family of monotone quantum
relative entropies. Letters in Mathematical Physics. 105(10), 1449–1466.
mla: Deuchert, Andreas, et al. “Note on a Family of Monotone Quantum Relative Entropies.”
Letters in Mathematical Physics, vol. 105, no. 10, Springer, 2015, pp.
1449–66, doi:10.1007/s11005-015-0787-5.
short: A. Deuchert, C. Hainzl, R. Seiringer, Letters in Mathematical Physics 105
(2015) 1449–1466.
date_created: 2018-12-11T11:53:34Z
date_published: 2015-08-05T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '05'
ddc:
- '510'
department:
- _id: RoSe
doi: 10.1007/s11005-015-0787-5
file:
- access_level: open_access
checksum: fd7307282a314cc1fbbaef77b187516b
content_type: application/pdf
creator: dernst
date_created: 2019-01-15T14:42:07Z
date_updated: 2020-07-14T12:45:13Z
file_id: '5836'
file_name: 2015_LettersMathPhys_Deuchert.pdf
file_size: 484967
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 105'
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.07205
month: '08'
oa: 1
oa_version: Preprint
page: 1449 - 1466
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '5432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Note on a family of monotone quantum relative entropies
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 105
year: '2015'
...
---
_id: '1703'
abstract:
- lang: eng
text: Vegetation clearing and land-use change have depleted many natural plant communities
to the point where restoration is required. A major impediment to the success
of rebuilding complex vegetation communities is having regular access to sufficient
quantities of high-quality seed. Seed-production areas (SPAs) can help generate
this seed, but these must be underpinned by a broad genetic base to maximise the
evolutionary potential of restored populations. However, genetic bottlenecks can
occur at the collection, establishment and production stages in SPAs, requiring
genetic evaluation. This is especially relevant for species that may take many
years before a return on SPA investment is realised. Two recently established
yellow box (Eucalyptus melliodora A.Cunn. ex Schauer, Myrtaceae) SPAs were evaluated
to determine whether genetic bottlenecks had occurred between seed collection
and SPA establishment. No evidence was found to suggest that a significant loss
of genetic diversity had occurred at this stage, although there was a significant
difference in diversity between the two SPAs. Complex population genetic structure
was also observed in the seed used to source the SPAs, with up to eight groups
identified. Plant survival in the SPAs was influenced by seed collection location
but not by SPA location and was not associated with genetic diversity. There were
also no associations between genetic diversity and plant growth. These data highlighted
the importance of chance events when establishing SPAs and indicated that the
two yellow box SPAs are likely to provide genetically diverse seed sources for
future restoration projects, especially by pooling seed from both SPAs.
author:
- first_name: Linda
full_name: Broadhurst, Linda
last_name: Broadhurst
- first_name: Graham
full_name: Fifield, Graham
last_name: Fifield
- first_name: Bindi
full_name: Vanzella, Bindi
last_name: Vanzella
- first_name: Melinda
full_name: Pickup, Melinda
id: 2C78037E-F248-11E8-B48F-1D18A9856A87
last_name: Pickup
orcid: 0000-0001-6118-0541
citation:
ama: Broadhurst L, Fifield G, Vanzella B, Pickup M. An evaluation of the genetic
structure of seed sources and the maintenance of genetic diversity during establishment
of two yellow box (Eucalyptus melliodora) seed-production areas. Australian
Journal of Botany. 2015;63(5):455-466. doi:10.1071/BT15023
apa: Broadhurst, L., Fifield, G., Vanzella, B., & Pickup, M. (2015). An evaluation
of the genetic structure of seed sources and the maintenance of genetic diversity
during establishment of two yellow box (Eucalyptus melliodora) seed-production
areas. Australian Journal of Botany. CSIRO. https://doi.org/10.1071/BT15023
chicago: Broadhurst, Linda, Graham Fifield, Bindi Vanzella, and Melinda Pickup.
“An Evaluation of the Genetic Structure of Seed Sources and the Maintenance of
Genetic Diversity during Establishment of Two Yellow Box (Eucalyptus Melliodora)
Seed-Production Areas.” Australian Journal of Botany. CSIRO, 2015. https://doi.org/10.1071/BT15023.
ieee: L. Broadhurst, G. Fifield, B. Vanzella, and M. Pickup, “An evaluation of the
genetic structure of seed sources and the maintenance of genetic diversity during
establishment of two yellow box (Eucalyptus melliodora) seed-production areas,”
Australian Journal of Botany, vol. 63, no. 5. CSIRO, pp. 455–466, 2015.
ista: Broadhurst L, Fifield G, Vanzella B, Pickup M. 2015. An evaluation of the
genetic structure of seed sources and the maintenance of genetic diversity during
establishment of two yellow box (Eucalyptus melliodora) seed-production areas.
Australian Journal of Botany. 63(5), 455–466.
mla: Broadhurst, Linda, et al. “An Evaluation of the Genetic Structure of Seed Sources
and the Maintenance of Genetic Diversity during Establishment of Two Yellow Box
(Eucalyptus Melliodora) Seed-Production Areas.” Australian Journal of Botany,
vol. 63, no. 5, CSIRO, 2015, pp. 455–66, doi:10.1071/BT15023.
short: L. Broadhurst, G. Fifield, B. Vanzella, M. Pickup, Australian Journal of
Botany 63 (2015) 455–466.
date_created: 2018-12-11T11:53:34Z
date_published: 2015-05-26T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '26'
department:
- _id: NiBa
doi: 10.1071/BT15023
intvolume: ' 63'
issue: '5'
language:
- iso: eng
month: '05'
oa_version: None
page: 455 - 466
publication: Australian Journal of Botany
publication_status: published
publisher: CSIRO
publist_id: '5434'
quality_controlled: '1'
scopus_import: 1
status: public
title: An evaluation of the genetic structure of seed sources and the maintenance
of genetic diversity during establishment of two yellow box (Eucalyptus melliodora)
seed-production areas
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 63
year: '2015'
...
---
_id: '1706'
abstract:
- lang: eng
text: We consider a problem of learning kernels for use in SVM classification in
the multi-task and lifelong scenarios and provide generalization bounds on the
error of a large margin classifier. Our results show that, under mild conditions
on the family of kernels used for learning, solving several related tasks simultaneously
is beneficial over single task learning. In particular, as the number of observed
tasks grows, assuming that in the considered family of kernels there exists one
that yields low approximation error on all tasks, the overhead associated with
learning such a kernel vanishes and the complexity converges to that of learning
when this good kernel is given to the learner.
alternative_title:
- LNCS
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Shai
full_name: Ben David, Shai
last_name: Ben David
citation:
ama: 'Pentina A, Ben David S. Multi-task and lifelong learning of kernels. In: Vol
9355. Springer; 2015:194-208. doi:10.1007/978-3-319-24486-0_13'
apa: 'Pentina, A., & Ben David, S. (2015). Multi-task and lifelong learning
of kernels (Vol. 9355, pp. 194–208). Presented at the ALT: Algorithmic Learning
Theory, Banff, AB, Canada: Springer. https://doi.org/10.1007/978-3-319-24486-0_13'
chicago: Pentina, Anastasia, and Shai Ben David. “Multi-Task and Lifelong Learning
of Kernels,” 9355:194–208. Springer, 2015. https://doi.org/10.1007/978-3-319-24486-0_13.
ieee: 'A. Pentina and S. Ben David, “Multi-task and lifelong learning of kernels,”
presented at the ALT: Algorithmic Learning Theory, Banff, AB, Canada, 2015, vol.
9355, pp. 194–208.'
ista: 'Pentina A, Ben David S. 2015. Multi-task and lifelong learning of kernels.
ALT: Algorithmic Learning Theory, LNCS, vol. 9355, 194–208.'
mla: Pentina, Anastasia, and Shai Ben David. Multi-Task and Lifelong Learning
of Kernels. Vol. 9355, Springer, 2015, pp. 194–208, doi:10.1007/978-3-319-24486-0_13.
short: A. Pentina, S. Ben David, in:, Springer, 2015, pp. 194–208.
conference:
end_date: 2015-10-06
location: Banff, AB, Canada
name: 'ALT: Algorithmic Learning Theory'
start_date: 2015-10-04
date_created: 2018-12-11T11:53:35Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:39Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-319-24486-0_13
ec_funded: 1
intvolume: ' 9355'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1602.06531
month: '01'
oa: 1
oa_version: Preprint
page: 194 - 208
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Springer
publist_id: '5430'
quality_controlled: '1'
scopus_import: 1
status: public
title: Multi-task and lifelong learning of kernels
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9355
year: '2015'
...
---
_id: '1712'
abstract:
- lang: eng
text: The majority of immune cells in Drosophila melanogaster are plasmatocytes;
they carry out similar functions to vertebrate macrophages, influencing development
as well as protecting against infection and cancer. Plasmatocytes, sometimes referred
to with the broader term of hemocytes, migrate widely during embryonic development
and cycle in the larvae between sessile and circulating positions. Here we discuss
the similarities of plasmatocyte developmental migration and its functions to
that of vertebrate macrophages, considering the recent controversy regarding the
functions of Drosophila PDGF/VEGF related ligands. We also examine recent findings
on the significance of adhesion for plasmatocyte migration in the embryo, as well
as proliferation, trans-differentiation, and tumor responses in the larva. We
spotlight parallels throughout to vertebrate immune responses.
author:
- first_name: Aparna
full_name: Ratheesh, Aparna
id: 2F064CFE-F248-11E8-B48F-1D18A9856A87
last_name: Ratheesh
- first_name: Vera
full_name: Belyaeva, Vera
id: 47F080FE-F248-11E8-B48F-1D18A9856A87
last_name: Belyaeva
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
citation:
ama: Ratheesh A, Belyaeva V, Siekhaus DE. Drosophila immune cell migration and adhesion
during embryonic development and larval immune responses. Current Opinion in
Cell Biology. 2015;36(10):71-79. doi:10.1016/j.ceb.2015.07.003
apa: Ratheesh, A., Belyaeva, V., & Siekhaus, D. E. (2015). Drosophila immune
cell migration and adhesion during embryonic development and larval immune responses.
Current Opinion in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2015.07.003
chicago: Ratheesh, Aparna, Vera Belyaeva, and Daria E Siekhaus. “Drosophila Immune
Cell Migration and Adhesion during Embryonic Development and Larval Immune Responses.”
Current Opinion in Cell Biology. Elsevier, 2015. https://doi.org/10.1016/j.ceb.2015.07.003.
ieee: A. Ratheesh, V. Belyaeva, and D. E. Siekhaus, “Drosophila immune cell migration
and adhesion during embryonic development and larval immune responses,” Current
Opinion in Cell Biology, vol. 36, no. 10. Elsevier, pp. 71–79, 2015.
ista: Ratheesh A, Belyaeva V, Siekhaus DE. 2015. Drosophila immune cell migration
and adhesion during embryonic development and larval immune responses. Current
Opinion in Cell Biology. 36(10), 71–79.
mla: Ratheesh, Aparna, et al. “Drosophila Immune Cell Migration and Adhesion during
Embryonic Development and Larval Immune Responses.” Current Opinion in Cell
Biology, vol. 36, no. 10, Elsevier, 2015, pp. 71–79, doi:10.1016/j.ceb.2015.07.003.
short: A. Ratheesh, V. Belyaeva, D.E. Siekhaus, Current Opinion in Cell Biology
36 (2015) 71–79.
date_created: 2018-12-11T11:53:36Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:52:41Z
day: '01'
ddc:
- '573'
department:
- _id: DaSi
doi: 10.1016/j.ceb.2015.07.003
ec_funded: 1
file:
- access_level: open_access
checksum: bbb1ee39ca52929aefe4f48752b166ee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:44Z
date_updated: 2020-07-14T12:45:13Z
file_id: '5098'
file_name: IST-2015-346-v1+1_Current_Opinion_Review_Ratheesh_et_al_2015.pdf
file_size: 1023680
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 36'
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 71 - 79
project:
- _id: 2536F660-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '334077'
name: Investigating the role of transporters in invasive migration through junctions
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '5421'
pubrep_id: '346'
quality_controlled: '1'
scopus_import: 1
status: public
title: Drosophila immune cell migration and adhesion during embryonic development
and larval immune responses
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: 36
year: '2015'
...
---
_id: '1710'
abstract:
- lang: eng
text: 'We consider the hollow on the half-plane {(x, y) : y ≤ 0} ⊂ ℝ2 defined by
a function u : (-1, 1) → ℝ, u(x) < 0, and a vertical flow of point particles
incident on the hollow. It is assumed that u satisfies the so-called single impact
condition (SIC): each incident particle is elastically reflected by graph(u) and
goes away without hitting the graph of u anymore. We solve the problem: find the
function u minimizing the force of resistance created by the flow. We show that
the graph of the minimizer is formed by two arcs of parabolas symmetric to each
other with respect to the y-axis. Assuming that the resistance of u ≡ 0 equals
1, we show that the minimal resistance equals π/2 - 2arctan(1/2) ≈ 0.6435. This
result completes the previously obtained result [SIAM J. Math. Anal., 46 (2014),
pp. 2730-2742] stating in particular that the minimal resistance of a hollow in
higher dimensions equals 0.5. We additionally consider a similar problem of minimal
resistance, where the hollow in the half-space {(x1,...,xd,y) : y ≤ 0} ⊂ ℝd+1
is defined by a radial function U satisfying the SIC, U(x) = u(|x|), with x =
(x1,...,xd), u(ξ) < 0 for 0 ≤ ξ < 1, and u(ξ) = 0 for ξ ≥ 1, and the flow
is parallel to the y-axis. The minimal resistance is greater than 0.5 (and coincides
with 0.6435 when d = 1) and converges to 0.5 as d → ∞.'
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Alexander
full_name: Plakhov, Alexander
last_name: Plakhov
citation:
ama: Akopyan A, Plakhov A. Minimal resistance of curves under the single impact
assumption. Society for Industrial and Applied Mathematics. 2015;47(4):2754-2769.
doi:10.1137/140993843
apa: Akopyan, A., & Plakhov, A. (2015). Minimal resistance of curves under the
single impact assumption. Society for Industrial and Applied Mathematics.
SIAM. https://doi.org/10.1137/140993843
chicago: Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves
under the Single Impact Assumption.” Society for Industrial and Applied Mathematics.
SIAM, 2015. https://doi.org/10.1137/140993843.
ieee: A. Akopyan and A. Plakhov, “Minimal resistance of curves under the single
impact assumption,” Society for Industrial and Applied Mathematics, vol.
47, no. 4. SIAM, pp. 2754–2769, 2015.
ista: Akopyan A, Plakhov A. 2015. Minimal resistance of curves under the single
impact assumption. Society for Industrial and Applied Mathematics. 47(4), 2754–2769.
mla: Akopyan, Arseniy, and Alexander Plakhov. “Minimal Resistance of Curves under
the Single Impact Assumption.” Society for Industrial and Applied Mathematics,
vol. 47, no. 4, SIAM, 2015, pp. 2754–69, doi:10.1137/140993843.
short: A. Akopyan, A. Plakhov, Society for Industrial and Applied Mathematics 47
(2015) 2754–2769.
date_created: 2018-12-11T11:53:36Z
date_published: 2015-07-14T00:00:00Z
date_updated: 2021-01-12T06:52:41Z
day: '14'
department:
- _id: HeEd
doi: 10.1137/140993843
ec_funded: 1
intvolume: ' 47'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.3736
month: '07'
oa: 1
oa_version: Preprint
page: 2754 - 2769
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Society for Industrial and Applied Mathematics
publication_status: published
publisher: SIAM
publist_id: '5423'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimal resistance of curves under the single impact assumption
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '1730'
abstract:
- lang: eng
text: How much cutting is needed to simplify the topology of a surface? We provide
bounds for several instances of this question, for the minimum length of topologically
non-trivial closed curves, pants decompositions, and cut graphs with a given combinatorial
map in triangulated combinatorial surfaces (or their dual cross-metric counterpart).
Our work builds upon Riemannian systolic inequalities, which bound the minimum
length of non-trivial closed curves in terms of the genus and the area of the
surface. We first describe a systematic way to translate Riemannian systolic inequalities
to a discrete setting, and vice-versa. This implies a conjecture by Przytycka
and Przytycki (Graph structure theory. Contemporary Mathematics, vol. 147, 1993),
a number of new systolic inequalities in the discrete setting, and the fact that
a theorem of Hutchinson on the edge-width of triangulated surfaces and Gromov’s
systolic inequality for surfaces are essentially equivalent. We also discuss how
these proofs generalize to higher dimensions. Then we focus on topological decompositions
of surfaces. Relying on ideas of Buser, we prove the existence of pants decompositions
of length O(g^(3/2)n^(1/2)) for any triangulated combinatorial surface of genus
g with n triangles, and describe an O(gn)-time algorithm to compute such a decomposition.
Finally, we consider the problem of embedding a cut graph (or more generally a
cellular graph) with a given combinatorial map on a given surface. Using random
triangulations, we prove (essentially) that, for any choice of a combinatorial
map, there are some surfaces on which any cellular embedding with that combinatorial
map has length superlinear in the number of triangles of the triangulated combinatorial
surface. There is also a similar result for graphs embedded on polyhedral triangulations.
author:
- first_name: Éric
full_name: Colin De Verdière, Éric
last_name: Colin De Verdière
- first_name: Alfredo
full_name: Hubard, Alfredo
last_name: Hubard
- first_name: Arnaud N
full_name: De Mesmay, Arnaud N
id: 3DB2F25C-F248-11E8-B48F-1D18A9856A87
last_name: De Mesmay
citation:
ama: Colin De Verdière É, Hubard A, de Mesmay AN. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
2015;53(3):587-620. doi:10.1007/s00454-015-9679-9
apa: Colin De Verdière, É., Hubard, A., & de Mesmay, A. N. (2015). Discrete
systolic inequalities and decompositions of triangulated surfaces. Discrete
& Computational Geometry. Springer. https://doi.org/10.1007/s00454-015-9679-9
chicago: Colin De Verdière, Éric, Alfredo Hubard, and Arnaud N de Mesmay. “Discrete
Systolic Inequalities and Decompositions of Triangulated Surfaces.” Discrete
& Computational Geometry. Springer, 2015. https://doi.org/10.1007/s00454-015-9679-9.
ieee: É. Colin De Verdière, A. Hubard, and A. N. de Mesmay, “Discrete systolic inequalities
and decompositions of triangulated surfaces,” Discrete & Computational
Geometry, vol. 53, no. 3. Springer, pp. 587–620, 2015.
ista: Colin De Verdière É, Hubard A, de Mesmay AN. 2015. Discrete systolic inequalities
and decompositions of triangulated surfaces. Discrete & Computational Geometry.
53(3), 587–620.
mla: Colin De Verdière, Éric, et al. “Discrete Systolic Inequalities and Decompositions
of Triangulated Surfaces.” Discrete & Computational Geometry, vol.
53, no. 3, Springer, 2015, pp. 587–620, doi:10.1007/s00454-015-9679-9.
short: É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete & Computational
Geometry 53 (2015) 587–620.
date_created: 2018-12-11T11:53:42Z
date_published: 2015-04-02T00:00:00Z
date_updated: 2021-01-12T06:52:49Z
day: '02'
department:
- _id: UlWa
doi: 10.1007/s00454-015-9679-9
intvolume: ' 53'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.4036
month: '04'
oa: 1
oa_version: Preprint
page: 587 - 620
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '5397'
quality_controlled: '1'
scopus_import: 1
status: public
title: Discrete systolic inequalities and decompositions of triangulated surfaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2015'
...
---
_id: '1735'
abstract:
- lang: eng
text: This work presents a method for efficiently simplifying the pressure projection
step in a liquid simulation. We first devise a straightforward dimension reduction
technique that dramatically reduces the cost of solving the pressure projection.
Next, we introduce a novel change of basis that satisfies free-surface boundary
conditions exactly, regardless of the accuracy of the pressure solve. When combined,
these ideas greatly reduce the computational complexity of the pressure solve
without compromising free surface boundary conditions at the highest level of
detail. Our techniques are easy to parallelize, and they effectively eliminate
the computational bottleneck for large liquid simulations.
acknowledgement: The first author was supported by a JSPS Postdoctoral Fellowship
for Research Abroad
author:
- first_name: Ryoichi
full_name: Ando, Ryoichi
last_name: Ando
- first_name: Nils
full_name: Thürey, Nils
last_name: Thürey
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Ando R, Thürey N, Wojtan C. A dimension-reduced pressure solver for liquid
simulations. Computer Graphics Forum. 2015;34(2):473-480. doi:10.1111/cgf.12576
apa: Ando, R., Thürey, N., & Wojtan, C. (2015). A dimension-reduced pressure
solver for liquid simulations. Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12576
chicago: Ando, Ryoichi, Nils Thürey, and Chris Wojtan. “A Dimension-Reduced Pressure
Solver for Liquid Simulations.” Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12576.
ieee: R. Ando, N. Thürey, and C. Wojtan, “A dimension-reduced pressure solver for
liquid simulations,” Computer Graphics Forum, vol. 34, no. 2. Wiley, pp.
473–480, 2015.
ista: Ando R, Thürey N, Wojtan C. 2015. A dimension-reduced pressure solver for
liquid simulations. Computer Graphics Forum. 34(2), 473–480.
mla: Ando, Ryoichi, et al. “A Dimension-Reduced Pressure Solver for Liquid Simulations.”
Computer Graphics Forum, vol. 34, no. 2, Wiley, 2015, pp. 473–80, doi:10.1111/cgf.12576.
short: R. Ando, N. Thürey, C. Wojtan, Computer Graphics Forum 34 (2015) 473–480.
date_created: 2018-12-11T11:53:44Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-02-23T10:12:11Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1111/cgf.12576
file:
- access_level: open_access
checksum: 590752bf977855b337a80f78a9bc2404
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:30Z
date_updated: 2020-07-14T12:45:15Z
file_id: '5218'
file_name: IST-2016-607-v1+1_coarsegrid.pdf
file_size: 6312352
relation: main_file
file_date_updated: 2020-07-14T12:45:15Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '2'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 473 - 480
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley
publist_id: '5389'
pubrep_id: '607'
quality_controlled: '1'
scopus_import: 1
status: public
title: A dimension-reduced pressure solver for liquid simulations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1734'
abstract:
- lang: eng
text: Facial appearance capture is now firmly established within academic research
and used extensively across various application domains, perhaps most prominently
in the entertainment industry through the design of virtual characters in video
games and films. While significant progress has occurred over the last two decades,
no single survey currently exists that discusses the similarities, differences,
and practical considerations of the available appearance capture techniques as
applied to human faces. A central difficulty of facial appearance capture is the
way light interacts with skin-which has a complex multi-layered structure-and
the interactions that occur below the skin surface can, by definition, only be
observed indirectly. In this report, we distinguish between two broad strategies
for dealing with this complexity. "Image-based methods" try to exhaustively
capture the exact face appearance under different lighting and viewing conditions,
and then render the face through weighted image combinations. "Parametric
methods" instead fit the captured reflectance data to some parametric appearance
model used during rendering, allowing for a more lightweight and flexible representation
but at the cost of potentially increased rendering complexity or inexact reproduction.
The goal of this report is to provide an overview that can guide practitioners
and researchers in assessing the tradeoffs between current approaches and identifying
directions for future advances in facial appearance capture.
author:
- first_name: Oliver
full_name: Klehm, Oliver
last_name: Klehm
- first_name: Fabrice
full_name: Rousselle, Fabrice
last_name: Rousselle
- first_name: Marios
full_name: Papas, Marios
last_name: Papas
- first_name: Derek
full_name: Bradley, Derek
last_name: Bradley
- first_name: Christophe
full_name: Hery, Christophe
last_name: Hery
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Wojciech
full_name: Jarosz, Wojciech
last_name: Jarosz
- first_name: Thabo
full_name: Beeler, Thabo
last_name: Beeler
citation:
ama: Klehm O, Rousselle F, Papas M, et al. Recent advances in facial appearance
capture. Computer Graphics Forum. 2015;34(2):709-733. doi:10.1111/cgf.12594
apa: Klehm, O., Rousselle, F., Papas, M., Bradley, D., Hery, C., Bickel, B., … Beeler,
T. (2015). Recent advances in facial appearance capture. Computer Graphics
Forum. Wiley-Blackwell. https://doi.org/10.1111/cgf.12594
chicago: Klehm, Oliver, Fabrice Rousselle, Marios Papas, Derek Bradley, Christophe
Hery, Bernd Bickel, Wojciech Jarosz, and Thabo Beeler. “Recent Advances in Facial
Appearance Capture.” Computer Graphics Forum. Wiley-Blackwell, 2015. https://doi.org/10.1111/cgf.12594.
ieee: O. Klehm et al., “Recent advances in facial appearance capture,” Computer
Graphics Forum, vol. 34, no. 2. Wiley-Blackwell, pp. 709–733, 2015.
ista: Klehm O, Rousselle F, Papas M, Bradley D, Hery C, Bickel B, Jarosz W, Beeler
T. 2015. Recent advances in facial appearance capture. Computer Graphics Forum.
34(2), 709–733.
mla: Klehm, Oliver, et al. “Recent Advances in Facial Appearance Capture.” Computer
Graphics Forum, vol. 34, no. 2, Wiley-Blackwell, 2015, pp. 709–33, doi:10.1111/cgf.12594.
short: O. Klehm, F. Rousselle, M. Papas, D. Bradley, C. Hery, B. Bickel, W. Jarosz,
T. Beeler, Computer Graphics Forum 34 (2015) 709–733.
date_created: 2018-12-11T11:53:43Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:52:52Z
day: '01'
department:
- _id: BeBi
doi: 10.1111/cgf.12594
intvolume: ' 34'
issue: '2'
language:
- iso: eng
main_file_link:
- url: https://graphics.ethz.ch/~mpapas/publications/fac_star.pdf
month: '05'
oa_version: None
page: 709 - 733
publication: Computer Graphics Forum
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5391'
quality_controlled: '1'
scopus_import: 1
status: public
title: Recent advances in facial appearance capture
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1789'
abstract:
- lang: eng
text: Intellectual disability (ID) has an estimated prevalence of 2-3%. Due to its
extreme heterogeneity, the genetic basis of ID remains elusive in many cases.
Recently, whole exome sequencing (WES) studies revealed that a large proportion
of sporadic cases are caused by de novo gene variants. To identify further genes
involved in ID, we performed WES in 250 patients with unexplained ID and their
unaffected parents and included exomes of 51 previously sequenced child-parents
trios in the analysis. Exome analysis revealed de novo intragenic variants in
SET domain-containing 5 (SETD5) in two patients. One patient carried a nonsense
variant, and the other an 81 bp deletion located across a splice-donor site. Chromosomal
microarray diagnostics further identified four de novo non-recurrent microdeletions
encompassing SETD5. CRISPR/Cas9 mutation modelling of the two intragenic variants
demonstrated nonsense-mediated decay of the resulting transcripts, pointing to
a loss-of-function (LoF) and haploinsufficiency as the common disease-causing
mechanism of intragenic SETD5 sequence variants and SETD5-containing microdeletions.
In silico domain prediction of SETD5, a predicted SET domain-containing histone
methyltransferase (HMT), substantiated the presence of a SET domain and identified
a novel putative PHD domain, strengthening a functional link to well-known histone-modifying
ID genes. All six patients presented with ID and certain facial dysmorphisms,
suggesting that SETD5 sequence variants contribute substantially to the microdeletion
3p25.3 phenotype. The present report of two SETD5 LoF variants in 301 patients
demonstrates a prevalence of 0.7% and thus SETD5 variants as a relatively frequent
cause of ID.
author:
- first_name: Alma
full_name: Kuechler, Alma
last_name: Kuechler
- first_name: Alexander
full_name: Zink, Alexander
last_name: Zink
- first_name: Thomas
full_name: Wieland, Thomas
last_name: Wieland
- first_name: Hermann
full_name: Lüdecke, Hermann
last_name: Lüdecke
- first_name: Kirsten
full_name: Cremer, Kirsten
last_name: Cremer
- first_name: Leonardo
full_name: Salviati, Leonardo
last_name: Salviati
- first_name: Pamela
full_name: Magini, Pamela
last_name: Magini
- first_name: Kimia
full_name: Najafi, Kimia
last_name: Najafi
- first_name: Christiane
full_name: Zweier, Christiane
last_name: Zweier
- first_name: Johanna
full_name: Czeschik, Johanna
last_name: Czeschik
- first_name: Stefan
full_name: Aretz, Stefan
last_name: Aretz
- first_name: Sabine
full_name: Endele, Sabine
last_name: Endele
- first_name: Federica
full_name: Tamburrino, Federica
last_name: Tamburrino
- first_name: Claudia
full_name: Pinato, Claudia
last_name: Pinato
- first_name: Maurizio
full_name: Clementi, Maurizio
last_name: Clementi
- first_name: Jasmin
full_name: Gundlach, Jasmin
last_name: Gundlach
- first_name: Carina
full_name: Maylahn, Carina
last_name: Maylahn
- first_name: Laura
full_name: Mazzanti, Laura
last_name: Mazzanti
- first_name: Eva
full_name: Wohlleber, Eva
last_name: Wohlleber
- first_name: Thomas
full_name: Schwarzmayr, Thomas
last_name: Schwarzmayr
- first_name: Roxana
full_name: Kariminejad, Roxana
last_name: Kariminejad
- first_name: Avner
full_name: Schlessinger, Avner
last_name: Schlessinger
- first_name: Dagmar
full_name: Wieczorek, Dagmar
last_name: Wieczorek
- first_name: Tim
full_name: Strom, Tim
last_name: Strom
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Hartmut
full_name: Engels, Hartmut
last_name: Engels
citation:
ama: Kuechler A, Zink A, Wieland T, et al. Loss-of-function variants of SETD5 cause
intellectual disability and the core phenotype of microdeletion 3p25.3 syndrome.
European Journal of Human Genetics. 2015;23(6):753-760. doi:10.1038/ejhg.2014.165
apa: Kuechler, A., Zink, A., Wieland, T., Lüdecke, H., Cremer, K., Salviati, L.,
… Engels, H. (2015). Loss-of-function variants of SETD5 cause intellectual disability
and the core phenotype of microdeletion 3p25.3 syndrome. European Journal of
Human Genetics. Nature Publishing Group. https://doi.org/10.1038/ejhg.2014.165
chicago: Kuechler, Alma, Alexander Zink, Thomas Wieland, Hermann Lüdecke, Kirsten
Cremer, Leonardo Salviati, Pamela Magini, et al. “Loss-of-Function Variants of
SETD5 Cause Intellectual Disability and the Core Phenotype of Microdeletion 3p25.3
Syndrome.” European Journal of Human Genetics. Nature Publishing Group,
2015. https://doi.org/10.1038/ejhg.2014.165.
ieee: A. Kuechler et al., “Loss-of-function variants of SETD5 cause intellectual
disability and the core phenotype of microdeletion 3p25.3 syndrome,” European
Journal of Human Genetics, vol. 23, no. 6. Nature Publishing Group, pp. 753–760,
2015.
ista: Kuechler A, Zink A, Wieland T, Lüdecke H, Cremer K, Salviati L, Magini P,
Najafi K, Zweier C, Czeschik J, Aretz S, Endele S, Tamburrino F, Pinato C, Clementi
M, Gundlach J, Maylahn C, Mazzanti L, Wohlleber E, Schwarzmayr T, Kariminejad
R, Schlessinger A, Wieczorek D, Strom T, Novarino G, Engels H. 2015. Loss-of-function
variants of SETD5 cause intellectual disability and the core phenotype of microdeletion
3p25.3 syndrome. European Journal of Human Genetics. 23(6), 753–760.
mla: Kuechler, Alma, et al. “Loss-of-Function Variants of SETD5 Cause Intellectual
Disability and the Core Phenotype of Microdeletion 3p25.3 Syndrome.” European
Journal of Human Genetics, vol. 23, no. 6, Nature Publishing Group, 2015,
pp. 753–60, doi:10.1038/ejhg.2014.165.
short: A. Kuechler, A. Zink, T. Wieland, H. Lüdecke, K. Cremer, L. Salviati, P.
Magini, K. Najafi, C. Zweier, J. Czeschik, S. Aretz, S. Endele, F. Tamburrino,
C. Pinato, M. Clementi, J. Gundlach, C. Maylahn, L. Mazzanti, E. Wohlleber, T.
Schwarzmayr, R. Kariminejad, A. Schlessinger, D. Wieczorek, T. Strom, G. Novarino,
H. Engels, European Journal of Human Genetics 23 (2015) 753–760.
date_created: 2018-12-11T11:54:01Z
date_published: 2015-06-15T00:00:00Z
date_updated: 2021-01-12T06:53:12Z
day: '15'
department:
- _id: GaNo
doi: 10.1038/ejhg.2014.165
external_id:
pmid:
- '25138099'
intvolume: ' 23'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4795044/
month: '06'
oa: 1
oa_version: Submitted Version
page: 753 - 760
pmid: 1
publication: European Journal of Human Genetics
publication_status: published
publisher: Nature Publishing Group
publist_id: '5324'
quality_controlled: '1'
status: public
title: Loss-of-function variants of SETD5 cause intellectual disability and the core
phenotype of microdeletion 3p25.3 syndrome
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2015'
...
---
_id: '1804'
abstract:
- lang: eng
text: It is known that in classical fluids turbulence typically occurs at high Reynolds
numbers. But can turbulence occur at low Reynolds numbers? Here we investigate
the transition to turbulence in the classic Taylor-Couette system in which the
rotating fluids are manufactured ferrofluids with magnetized nanoparticles embedded
in liquid carriers. We find that, in the presence of a magnetic field transverse
to the symmetry axis of the system, turbulence can occur at Reynolds numbers that
are at least one order of magnitude smaller than those in conventional fluids.
This is established by extensive computational ferrohydrodynamics through a detailed
investigation of transitions in the flow structure, and characterization of behaviors
of physical quantities such as the energy, the wave number, and the angular momentum
through the bifurcations. A finding is that, as the magnetic field is increased,
onset of turbulence can be determined accurately and reliably. Our results imply
that experimental investigation of turbulence may be feasible by using ferrofluids.
Our study of transition to and evolution of turbulence in the Taylor-Couette ferrofluidic
flow system provides insights into the challenging problem of turbulence control.
article_number: '10781'
author:
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Ying
full_name: Lai, Ying
last_name: Lai
citation:
ama: Altmeyer S, Do Y, Lai Y. Transition to turbulence in Taylor-Couette ferrofluidic
flow. Scientific Reports. 2015;5. doi:10.1038/srep10781
apa: Altmeyer, S., Do, Y., & Lai, Y. (2015). Transition to turbulence in Taylor-Couette
ferrofluidic flow. Scientific Reports. Nature Publishing Group. https://doi.org/10.1038/srep10781
chicago: Altmeyer, Sebastian, Younghae Do, and Ying Lai. “Transition to Turbulence
in Taylor-Couette Ferrofluidic Flow.” Scientific Reports. Nature Publishing
Group, 2015. https://doi.org/10.1038/srep10781.
ieee: S. Altmeyer, Y. Do, and Y. Lai, “Transition to turbulence in Taylor-Couette
ferrofluidic flow,” Scientific Reports, vol. 5. Nature Publishing Group,
2015.
ista: Altmeyer S, Do Y, Lai Y. 2015. Transition to turbulence in Taylor-Couette
ferrofluidic flow. Scientific Reports. 5, 10781.
mla: Altmeyer, Sebastian, et al. “Transition to Turbulence in Taylor-Couette Ferrofluidic
Flow.” Scientific Reports, vol. 5, 10781, Nature Publishing Group, 2015,
doi:10.1038/srep10781.
short: S. Altmeyer, Y. Do, Y. Lai, Scientific Reports 5 (2015).
date_created: 2018-12-11T11:54:06Z
date_published: 2015-06-12T00:00:00Z
date_updated: 2021-01-12T06:53:18Z
day: '12'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1038/srep10781
file:
- access_level: open_access
checksum: 7716f582f8c9d82d8f2bf80bf896b440
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:26Z
date_updated: 2020-07-14T12:45:16Z
file_id: '5280'
file_name: IST-2016-450-v1+1_srep10781.pdf
file_size: 2449723
relation: main_file
file_date_updated: 2020-07-14T12:45:16Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Scientific Reports
publication_status: published
publisher: Nature Publishing Group
publist_id: '5306'
pubrep_id: '450'
quality_controlled: '1'
scopus_import: 1
status: public
title: Transition to turbulence in Taylor-Couette ferrofluidic flow
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: 5
year: '2015'
...
---
_id: '1807'
abstract:
- lang: eng
text: We study a double Cahn-Hilliard type functional related to the Gross-Pitaevskii
energy of two-components Bose-Einstein condensates. In the case of large but same
order intercomponent and intracomponent coupling strengths, we prove Γ-convergence
to a perimeter minimisation functional with an inhomogeneous surface tension.
We study the asymptotic behavior of the surface tension as the ratio between the
intercomponent and intracomponent coupling strengths becomes very small or very
large and obtain good agreement with the physical literature. We obtain as a consequence,
symmetry breaking of the minimisers for the harmonic potential.
author:
- first_name: Michael
full_name: Goldman, Michael
last_name: Goldman
- first_name: Jimena
full_name: Royo-Letelier, Jimena
id: 4D3BED28-F248-11E8-B48F-1D18A9856A87
last_name: Royo-Letelier
citation:
ama: Goldman M, Royo-Letelier J. Sharp interface limit for two components Bose-Einstein
condensates. ESAIM - Control, Optimisation and Calculus of Variations.
2015;21(3):603-624. doi:10.1051/cocv/2014040
apa: Goldman, M., & Royo-Letelier, J. (2015). Sharp interface limit for two
components Bose-Einstein condensates. ESAIM - Control, Optimisation and Calculus
of Variations. EDP Sciences. https://doi.org/10.1051/cocv/2014040
chicago: Goldman, Michael, and Jimena Royo-Letelier. “Sharp Interface Limit for
Two Components Bose-Einstein Condensates.” ESAIM - Control, Optimisation and
Calculus of Variations. EDP Sciences, 2015. https://doi.org/10.1051/cocv/2014040.
ieee: M. Goldman and J. Royo-Letelier, “Sharp interface limit for two components
Bose-Einstein condensates,” ESAIM - Control, Optimisation and Calculus of Variations,
vol. 21, no. 3. EDP Sciences, pp. 603–624, 2015.
ista: Goldman M, Royo-Letelier J. 2015. Sharp interface limit for two components
Bose-Einstein condensates. ESAIM - Control, Optimisation and Calculus of Variations.
21(3), 603–624.
mla: Goldman, Michael, and Jimena Royo-Letelier. “Sharp Interface Limit for Two
Components Bose-Einstein Condensates.” ESAIM - Control, Optimisation and Calculus
of Variations, vol. 21, no. 3, EDP Sciences, 2015, pp. 603–24, doi:10.1051/cocv/2014040.
short: M. Goldman, J. Royo-Letelier, ESAIM - Control, Optimisation and Calculus
of Variations 21 (2015) 603–624.
date_created: 2018-12-11T11:54:07Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:20Z
day: '01'
department:
- _id: RoSe
doi: 10.1051/cocv/2014040
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1401.1727
month: '05'
oa: 1
oa_version: Preprint
page: 603 - 624
publication: ESAIM - Control, Optimisation and Calculus of Variations
publication_status: published
publisher: EDP Sciences
publist_id: '5303'
quality_controlled: '1'
scopus_import: 1
status: public
title: Sharp interface limit for two components Bose-Einstein condensates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...
---
_id: '1810'
abstract:
- lang: eng
text: Combining antibiotics is a promising strategy for increasing treatment efficacy
and for controlling resistance evolution. When drugs are combined, their effects
on cells may be amplified or weakened, that is the drugs may show synergistic
or antagonistic interactions. Recent work revealed the underlying mechanisms of
such drug interactions by elucidating the drugs'; joint effects on cell physiology.
Moreover, new treatment strategies that use drug combinations to exploit evolutionary
tradeoffs were shown to affect the rate of resistance evolution in predictable
ways. High throughput studies have further identified drug candidates based on
their interactions with established antibiotics and general principles that enable
the prediction of drug interactions were suggested. Overall, the conceptual and
technical foundation for the rational design of potent drug combinations is rapidly
developing.
author:
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: 'Bollenbach MT. Antimicrobial interactions: Mechanisms and implications for
drug discovery and resistance evolution. Current Opinion in Microbiology.
2015;27:1-9. doi:10.1016/j.mib.2015.05.008'
apa: 'Bollenbach, M. T. (2015). Antimicrobial interactions: Mechanisms and implications
for drug discovery and resistance evolution. Current Opinion in Microbiology.
Elsevier. https://doi.org/10.1016/j.mib.2015.05.008'
chicago: 'Bollenbach, Mark Tobias. “Antimicrobial Interactions: Mechanisms and Implications
for Drug Discovery and Resistance Evolution.” Current Opinion in Microbiology.
Elsevier, 2015. https://doi.org/10.1016/j.mib.2015.05.008.'
ieee: 'M. T. Bollenbach, “Antimicrobial interactions: Mechanisms and implications
for drug discovery and resistance evolution,” Current Opinion in Microbiology,
vol. 27. Elsevier, pp. 1–9, 2015.'
ista: 'Bollenbach MT. 2015. Antimicrobial interactions: Mechanisms and implications
for drug discovery and resistance evolution. Current Opinion in Microbiology.
27, 1–9.'
mla: 'Bollenbach, Mark Tobias. “Antimicrobial Interactions: Mechanisms and Implications
for Drug Discovery and Resistance Evolution.” Current Opinion in Microbiology,
vol. 27, Elsevier, 2015, pp. 1–9, doi:10.1016/j.mib.2015.05.008.'
short: M.T. Bollenbach, Current Opinion in Microbiology 27 (2015) 1–9.
date_created: 2018-12-11T11:54:08Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:53:21Z
day: '01'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.1016/j.mib.2015.05.008
ec_funded: 1
file:
- access_level: open_access
checksum: 1683bb0f42ef892a5b3b71a050d65d25
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:23Z
date_updated: 2020-07-14T12:45:17Z
file_id: '5277'
file_name: IST-2016-493-v1+1_1-s2.0-S1369527415000594-main.pdf
file_size: 1047255
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 27'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1 - 9
project:
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27201-B22
name: Revealing the mechanisms underlying drug interactions
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303507'
name: Optimality principles in responses to antibiotics
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
grant_number: RGP0042/2013
name: Revealing the fundamental limits of cell growth
publication: Current Opinion in Microbiology
publication_status: published
publisher: Elsevier
publist_id: '5298'
pubrep_id: '493'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Antimicrobial interactions: Mechanisms and implications for drug discovery
and resistance evolution'
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: 27
year: '2015'
...
---
_id: '1812'
abstract:
- lang: eng
text: "We investigate the occurrence of rotons in a quadrupolar Bose–Einstein condensate
confined to two dimensions. Depending on the particle density, the ratio of the
contact and quadrupole–quadrupole interactions, and the alignment of the quadrupole
moments with respect to the confinement plane, the dispersion relation features
two or four point-like roton minima or one ring-shaped minimum. We map out the
entire parameter space of the roton behavior and identify the instability regions.
We propose to observe the exotic rotons by monitoring the characteristic density
wave dynamics resulting from a short local perturbation, and discuss the possibilities
to detect the predicted effects in state-of-the-art experiments with ultracold
homonuclear molecules.\r\n"
article_number: '045005'
article_processing_charge: No
author:
- first_name: Martin
full_name: Lahrz, Martin
last_name: Lahrz
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Ludwig
full_name: Mathey, Ludwig
last_name: Mathey
citation:
ama: Lahrz M, Lemeshko M, Mathey L. Exotic roton excitations in quadrupolar Bose–Einstein
condensates . New Journal of Physics. 2015;17(4). doi:10.1088/1367-2630/17/4/045005
apa: Lahrz, M., Lemeshko, M., & Mathey, L. (2015). Exotic roton excitations
in quadrupolar Bose–Einstein condensates . New Journal of Physics. IOP
Publishing Ltd. https://doi.org/10.1088/1367-2630/17/4/045005
chicago: Lahrz, Martin, Mikhail Lemeshko, and Ludwig Mathey. “Exotic Roton Excitations
in Quadrupolar Bose–Einstein Condensates .” New Journal of Physics. IOP
Publishing Ltd., 2015. https://doi.org/10.1088/1367-2630/17/4/045005.
ieee: M. Lahrz, M. Lemeshko, and L. Mathey, “Exotic roton excitations in quadrupolar
Bose–Einstein condensates ,” New Journal of Physics, vol. 17, no. 4. IOP
Publishing Ltd., 2015.
ista: Lahrz M, Lemeshko M, Mathey L. 2015. Exotic roton excitations in quadrupolar
Bose–Einstein condensates . New Journal of Physics. 17(4), 045005.
mla: Lahrz, Martin, et al. “Exotic Roton Excitations in Quadrupolar Bose–Einstein
Condensates .” New Journal of Physics, vol. 17, no. 4, 045005, IOP Publishing
Ltd., 2015, doi:10.1088/1367-2630/17/4/045005.
short: M. Lahrz, M. Lemeshko, L. Mathey, New Journal of Physics 17 (2015).
date_created: 2018-12-11T11:54:09Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:22Z
day: '01'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1088/1367-2630/17/4/045005
file:
- access_level: open_access
checksum: 551f751a75b39b89a1db2f7f498f9a49
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:59Z
date_updated: 2020-07-14T12:45:17Z
file_id: '5184'
file_name: IST-2016-446-v1+1_document.pdf
file_size: 1900925
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 17'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: New Journal of Physics
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '5294'
pubrep_id: '446'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Exotic roton excitations in quadrupolar Bose–Einstein condensates '
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: 17
year: '2015'
...
---
_id: '1811'
abstract:
- lang: eng
text: Atomic form factors are widely used for the characterization of targets and
specimens, from crystallography to biology. By using recent mathematical results,
here we derive an analytical expression for the atomic form factor within the
independent particle model constructed from nonrelativistic screened hydrogenic
wave functions. The range of validity of this analytical expression is checked
by comparing the analytically obtained form factors with the ones obtained within
the Hartee-Fock method. As an example, we apply our analytical expression for
the atomic form factor to evaluate the differential cross section for Rayleigh
scattering off neutral atoms.
acknowledgement: The research leading to these results has received funding from the
People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement n◦ [291734]. F.F. acknowledges
support by Fundação de Amparo à Pesquisa do estado de Minas Gerais (FAPEMIG), by
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), and by the
Austrian Science Fund (FWF) through the START Grant No. Y 591-N16.
article_number: '052105'
author:
- first_name: Laleh
full_name: Safari, Laleh
id: 3C325E5E-F248-11E8-B48F-1D18A9856A87
last_name: Safari
- first_name: José
full_name: Santos, José
last_name: Santos
- first_name: Pedro
full_name: Amaro, Pedro
last_name: Amaro
- first_name: Kari
full_name: Jänkälä, Kari
last_name: Jänkälä
- first_name: Filippo
full_name: Fratini, Filippo
last_name: Fratini
citation:
ama: 'Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. Analytical evaluation of
atomic form factors: Application to Rayleigh scattering. Journal of Mathematical
Physics. 2015;56(5). doi:10.1063/1.4921227'
apa: 'Safari, L., Santos, J., Amaro, P., Jänkälä, K., & Fratini, F. (2015).
Analytical evaluation of atomic form factors: Application to Rayleigh scattering.
Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4921227'
chicago: 'Safari, Laleh, José Santos, Pedro Amaro, Kari Jänkälä, and Filippo Fratini.
“Analytical Evaluation of Atomic Form Factors: Application to Rayleigh Scattering.”
Journal of Mathematical Physics. American Institute of Physics, 2015. https://doi.org/10.1063/1.4921227.'
ieee: 'L. Safari, J. Santos, P. Amaro, K. Jänkälä, and F. Fratini, “Analytical evaluation
of atomic form factors: Application to Rayleigh scattering,” Journal of Mathematical
Physics, vol. 56, no. 5. American Institute of Physics, 2015.'
ista: 'Safari L, Santos J, Amaro P, Jänkälä K, Fratini F. 2015. Analytical evaluation
of atomic form factors: Application to Rayleigh scattering. Journal of Mathematical
Physics. 56(5), 052105.'
mla: 'Safari, Laleh, et al. “Analytical Evaluation of Atomic Form Factors: Application
to Rayleigh Scattering.” Journal of Mathematical Physics, vol. 56, no.
5, 052105, American Institute of Physics, 2015, doi:10.1063/1.4921227.'
short: L. Safari, J. Santos, P. Amaro, K. Jänkälä, F. Fratini, Journal of Mathematical
Physics 56 (2015).
date_created: 2018-12-11T11:54:08Z
date_published: 2015-05-20T00:00:00Z
date_updated: 2021-01-12T06:53:21Z
day: '20'
department:
- _id: MiLe
doi: 10.1063/1.4921227
ec_funded: 1
intvolume: ' 56'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1409.0110
month: '05'
oa: 1
oa_version: Preprint
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Mathematical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '5295'
scopus_import: 1
status: public
title: 'Analytical evaluation of atomic form factors: Application to Rayleigh scattering'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 56
year: '2015'
...
---
_id: '1813'
abstract:
- lang: eng
text: We develop a microscopic theory describing a quantum impurity whose rotational
degree of freedom is coupled to a many-particle bath. We approach the problem
by introducing the concept of an “angulon”—a quantum rotor dressed by a quantum
field—and reveal its quasiparticle properties using a combination of variational
and diagrammatic techniques. Our theory predicts renormalization of the impurity
rotational structure, such as that observed in experiments with molecules in superfluid
helium droplets, in terms of a rotational Lamb shift induced by the many-particle
environment. Furthermore, we discover a rich many-body-induced fine structure,
emerging in rotational spectra due to a redistribution of angular momentum within
the quantum many-body system.
article_number: '203001'
author:
- first_name: Richard
full_name: Schmidt, Richard
last_name: Schmidt
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Schmidt R, Lemeshko M. Rotation of quantum impurities in the presence of a
many-body environment. Physical Review Letters. 2015;114(20). doi:10.1103/PhysRevLett.114.203001
apa: Schmidt, R., & Lemeshko, M. (2015). Rotation of quantum impurities in the
presence of a many-body environment. Physical Review Letters. American
Physical Society. https://doi.org/10.1103/PhysRevLett.114.203001
chicago: Schmidt, Richard, and Mikhail Lemeshko. “Rotation of Quantum Impurities
in the Presence of a Many-Body Environment.” Physical Review Letters. American
Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.203001.
ieee: R. Schmidt and M. Lemeshko, “Rotation of quantum impurities in the presence
of a many-body environment,” Physical Review Letters, vol. 114, no. 20.
American Physical Society, 2015.
ista: Schmidt R, Lemeshko M. 2015. Rotation of quantum impurities in the presence
of a many-body environment. Physical Review Letters. 114(20), 203001.
mla: Schmidt, Richard, and Mikhail Lemeshko. “Rotation of Quantum Impurities in
the Presence of a Many-Body Environment.” Physical Review Letters, vol.
114, no. 20, 203001, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.203001.
short: R. Schmidt, M. Lemeshko, Physical Review Letters 114 (2015).
date_created: 2018-12-11T11:54:09Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2021-01-12T06:53:22Z
day: '18'
department:
- _id: MiLe
doi: 10.1103/PhysRevLett.114.203001
intvolume: ' 114'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.03447
month: '05'
oa: 1
oa_version: Preprint
publication: Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '5293'
quality_controlled: '1'
scopus_import: 1
status: public
title: Rotation of quantum impurities in the presence of a many-body environment
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2015'
...
---
_id: '1808'
article_number: '7'
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- 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: Gupta A, Henzinger TA. Guest editors’ introduction to special issue on computational
methods in systems biology. ACM Transactions on Modeling and Computer Simulation.
2015;25(2). doi:10.1145/2745799
apa: Gupta, A., & Henzinger, T. A. (2015). Guest editors’ introduction to special
issue on computational methods in systems biology. ACM Transactions on Modeling
and Computer Simulation. ACM. https://doi.org/10.1145/2745799
chicago: Gupta, Ashutosh, and Thomas A Henzinger. “Guest Editors’ Introduction to
Special Issue on Computational Methods in Systems Biology.” ACM Transactions
on Modeling and Computer Simulation. ACM, 2015. https://doi.org/10.1145/2745799.
ieee: A. Gupta and T. A. Henzinger, “Guest editors’ introduction to special issue
on computational methods in systems biology,” ACM Transactions on Modeling
and Computer Simulation, vol. 25, no. 2. ACM, 2015.
ista: Gupta A, Henzinger TA. 2015. Guest editors’ introduction to special issue
on computational methods in systems biology. ACM Transactions on Modeling and
Computer Simulation. 25(2), 7.
mla: Gupta, Ashutosh, and Thomas A. Henzinger. “Guest Editors’ Introduction to Special
Issue on Computational Methods in Systems Biology.” ACM Transactions on Modeling
and Computer Simulation, vol. 25, no. 2, 7, ACM, 2015, doi:10.1145/2745799.
short: A. Gupta, T.A. Henzinger, ACM Transactions on Modeling and Computer Simulation
25 (2015).
date_created: 2018-12-11T11:54:07Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:20Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2745799
intvolume: ' 25'
issue: '2'
language:
- iso: eng
month: '05'
oa_version: None
publication: ACM Transactions on Modeling and Computer Simulation
publication_status: published
publisher: ACM
publist_id: '5302'
quality_controlled: '1'
status: public
title: Guest editors' introduction to special issue on computational methods in systems
biology
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2015'
...
---
_id: '1817'
abstract:
- lang: eng
text: 'Vertebrates have a unique 3D body shape in which correct tissue and organ
shape and alignment are essential for function. For example, vision requires the
lens to be centred in the eye cup which must in turn be correctly positioned in
the head. Tissue morphogenesis depends on force generation, force transmission
through the tissue, and response of tissues and extracellular matrix to force.
Although a century ago D''Arcy Thompson postulated that terrestrial animal body
shapes are conditioned by gravity, there has been no animal model directly demonstrating
how the aforementioned mechano-morphogenetic processes are coordinated to generate
a body shape that withstands gravity. Here we report a unique medaka fish (Oryzias
latipes) mutant, hirame (hir), which is sensitive to deformation by gravity. hir
embryos display a markedly flattened body caused by mutation of YAP, a nuclear
executor of Hippo signalling that regulates organ size. We show that actomyosin-mediated
tissue tension is reduced in hir embryos, leading to tissue flattening and tissue
misalignment, both of which contribute to body flattening. By analysing YAP function
in 3D spheroids of human cells, we identify the Rho GTPase activating protein
ARHGAP18 as an effector of YAP in controlling tissue tension. Together, these
findings reveal a previously unrecognised function of YAP in regulating tissue
shape and alignment required for proper 3D body shape. Understanding this morphogenetic
function of YAP could facilitate the use of embryonic stem cells to generate complex
organs requiring correct alignment of multiple tissues. '
author:
- first_name: Sean
full_name: Porazinski, Sean
last_name: Porazinski
- first_name: Huijia
full_name: Wang, Huijia
last_name: Wang
- first_name: Yoichi
full_name: Asaoka, Yoichi
last_name: Asaoka
- first_name: Martin
full_name: Behrndt, Martin
id: 3ECECA3A-F248-11E8-B48F-1D18A9856A87
last_name: Behrndt
- first_name: Tatsuo
full_name: Miyamoto, Tatsuo
last_name: Miyamoto
- first_name: Hitoshi
full_name: Morita, Hitoshi
id: 4C6E54C6-F248-11E8-B48F-1D18A9856A87
last_name: Morita
- first_name: Shoji
full_name: Hata, Shoji
last_name: Hata
- first_name: Takashi
full_name: Sasaki, Takashi
last_name: Sasaki
- first_name: Gabriel
full_name: Krens, Gabriel
id: 2B819732-F248-11E8-B48F-1D18A9856A87
last_name: Krens
orcid: 0000-0003-4761-5996
- first_name: Yumi
full_name: Osada, Yumi
last_name: Osada
- first_name: Satoshi
full_name: Asaka, Satoshi
last_name: Asaka
- first_name: Akihiro
full_name: Momoi, Akihiro
last_name: Momoi
- first_name: Sarah
full_name: Linton, Sarah
last_name: Linton
- first_name: Joel
full_name: Miesfeld, Joel
last_name: Miesfeld
- first_name: Brian
full_name: Link, Brian
last_name: Link
- first_name: Takeshi
full_name: Senga, Takeshi
last_name: Senga
- first_name: Atahualpa
full_name: Castillo Morales, Atahualpa
last_name: Castillo Morales
- first_name: Araxi
full_name: Urrutia, Araxi
last_name: Urrutia
- first_name: Nobuyoshi
full_name: Shimizu, Nobuyoshi
last_name: Shimizu
- first_name: Hideaki
full_name: Nagase, Hideaki
last_name: Nagase
- first_name: Shinya
full_name: Matsuura, Shinya
last_name: Matsuura
- first_name: Stefan
full_name: Bagby, Stefan
last_name: Bagby
- first_name: Hisato
full_name: Kondoh, Hisato
last_name: Kondoh
- first_name: Hiroshi
full_name: Nishina, Hiroshi
last_name: Nishina
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
- first_name: Makoto
full_name: Furutani Seiki, Makoto
last_name: Furutani Seiki
citation:
ama: Porazinski S, Wang H, Asaoka Y, et al. YAP is essential for tissue tension
to ensure vertebrate 3D body shape. Nature. 2015;521(7551):217-221. doi:10.1038/nature14215
apa: Porazinski, S., Wang, H., Asaoka, Y., Behrndt, M., Miyamoto, T., Morita, H.,
… Furutani Seiki, M. (2015). YAP is essential for tissue tension to ensure vertebrate
3D body shape. Nature. Nature Publishing Group. https://doi.org/10.1038/nature14215
chicago: Porazinski, Sean, Huijia Wang, Yoichi Asaoka, Martin Behrndt, Tatsuo Miyamoto,
Hitoshi Morita, Shoji Hata, et al. “YAP Is Essential for Tissue Tension to Ensure
Vertebrate 3D Body Shape.” Nature. Nature Publishing Group, 2015. https://doi.org/10.1038/nature14215.
ieee: S. Porazinski et al., “YAP is essential for tissue tension to ensure
vertebrate 3D body shape,” Nature, vol. 521, no. 7551. Nature Publishing
Group, pp. 217–221, 2015.
ista: Porazinski S, Wang H, Asaoka Y, Behrndt M, Miyamoto T, Morita H, Hata S, Sasaki
T, Krens G, Osada Y, Asaka S, Momoi A, Linton S, Miesfeld J, Link B, Senga T,
Castillo Morales A, Urrutia A, Shimizu N, Nagase H, Matsuura S, Bagby S, Kondoh
H, Nishina H, Heisenberg C-PJ, Furutani Seiki M. 2015. YAP is essential for tissue
tension to ensure vertebrate 3D body shape. Nature. 521(7551), 217–221.
mla: Porazinski, Sean, et al. “YAP Is Essential for Tissue Tension to Ensure Vertebrate
3D Body Shape.” Nature, vol. 521, no. 7551, Nature Publishing Group, 2015,
pp. 217–21, doi:10.1038/nature14215.
short: S. Porazinski, H. Wang, Y. Asaoka, M. Behrndt, T. Miyamoto, H. Morita, S.
Hata, T. Sasaki, G. Krens, Y. Osada, S. Asaka, A. Momoi, S. Linton, J. Miesfeld,
B. Link, T. Senga, A. Castillo Morales, A. Urrutia, N. Shimizu, H. Nagase, S.
Matsuura, S. Bagby, H. Kondoh, H. Nishina, C.-P.J. Heisenberg, M. Furutani Seiki,
Nature 521 (2015) 217–221.
date_created: 2018-12-11T11:54:10Z
date_published: 2015-03-16T00:00:00Z
date_updated: 2021-01-12T06:53:23Z
day: '16'
department:
- _id: CaHe
doi: 10.1038/nature14215
external_id:
pmid:
- '25778702'
intvolume: ' 521'
issue: '7551'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4720436/
month: '03'
oa: 1
oa_version: Submitted Version
page: 217 - 221
pmid: 1
publication: Nature
publication_status: published
publisher: Nature Publishing Group
publist_id: '5289'
quality_controlled: '1'
scopus_import: 1
status: public
title: YAP is essential for tissue tension to ensure vertebrate 3D body shape
type: journal_article
user_id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
volume: 521
year: '2015'
...
---
_id: '1820'
abstract:
- lang: eng
text: 'We consider partially observable Markov decision processes (POMDPs) with
a set of target states and every transition is associated with an integer cost.
The optimization objec- tive we study asks to minimize the expected total cost
till the target set is reached, while ensuring that the target set is reached
almost-surely (with probability 1). We show that for integer costs approximating
the optimal cost is undecidable. For positive costs, our results are as follows:
(i) we establish matching lower and upper bounds for the optimal cost and the
bound is double exponential; (ii) we show that the problem of approximating the
optimal cost is decidable and present ap- proximation algorithms developing on
the existing algorithms for POMDPs with finite-horizon objectives. While the worst-
case running time of our algorithm is double exponential, we present efficient
stopping criteria for the algorithm and show experimentally that it performs well
in many examples.'
acknowledgement: ' The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307:
Graph Games), and Microsoft faculty fellows award.'
alternative_title:
- Artifical Intelligence
author:
- 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: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Raghav
full_name: Gupta, Raghav
last_name: Gupta
- first_name: Ayush
full_name: Kanodia, Ayush
last_name: Kanodia
citation:
ama: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. Optimal cost almost-sure reachability
in POMDPs. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial
Intelligence . Vol 5. AAAI Press; 2015:3496-3502.'
apa: 'Chatterjee, K., Chmelik, M., Gupta, R., & Kanodia, A. (2015). Optimal
cost almost-sure reachability in POMDPs. In Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence (Vol. 5, pp. 3496–3502). Austin,
TX, USA: AAAI Press.'
chicago: Chatterjee, Krishnendu, Martin Chmelik, Raghav Gupta, and Ayush Kanodia.
“Optimal Cost Almost-Sure Reachability in POMDPs.” In Proceedings of the Twenty-Ninth
AAAI Conference on Artificial Intelligence , 5:3496–3502. AAAI Press, 2015.
ieee: K. Chatterjee, M. Chmelik, R. Gupta, and A. Kanodia, “Optimal cost almost-sure
reachability in POMDPs,” in Proceedings of the Twenty-Ninth AAAI Conference
on Artificial Intelligence , Austin, TX, USA, 2015, vol. 5, pp. 3496–3502.
ista: 'Chatterjee K, Chmelik M, Gupta R, Kanodia A. 2015. Optimal cost almost-sure
reachability in POMDPs. Proceedings of the Twenty-Ninth AAAI Conference on Artificial
Intelligence . IAAI: Innovative Applications of Artificial Intelligence, Artifical
Intelligence, vol. 5, 3496–3502.'
mla: Chatterjee, Krishnendu, et al. “Optimal Cost Almost-Sure Reachability in POMDPs.”
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence
, vol. 5, AAAI Press, 2015, pp. 3496–502.
short: K. Chatterjee, M. Chmelik, R. Gupta, A. Kanodia, in:, Proceedings of the
Twenty-Ninth AAAI Conference on Artificial Intelligence , AAAI Press, 2015, pp.
3496–3502.
conference:
end_date: 2015-01-30
location: Austin, TX, USA
name: 'IAAI: Innovative Applications of Artificial Intelligence'
start_date: 2015-01-25
date_created: 2018-12-11T11:54:11Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:02:57Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
arxiv:
- '1411.3880'
intvolume: ' 5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1411.3880
month: '06'
oa: 1
oa_version: Preprint
page: 3496-3502
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: 'Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence '
publication_status: published
publisher: AAAI Press
publist_id: '5286'
quality_controlled: '1'
related_material:
record:
- id: '1529'
relation: later_version
status: public
scopus_import: 1
status: public
title: Optimal cost almost-sure reachability in POMDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2015'
...
---
_id: '1814'
abstract:
- lang: eng
text: 'We present an efficient wavefront tracking algorithm for animating bodies
of water that interact with their environment. Our contributions include: a novel
wavefront tracking technique that enables dispersion, refraction, reflection,
and diffraction in the same simulation; a unique multivalued function interpolation
method that enables our simulations to elegantly sidestep the Nyquist limit; a
dispersion approximation for efficiently amplifying the number of simulated waves
by several orders of magnitude; and additional extensions that allow for time-dependent
effects and interactive artistic editing of the resulting animation. Our contributions
combine to give us multitudes more wave details than similar algorithms, while
maintaining high frame rates and allowing close camera zooms.'
article_number: '27'
author:
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Jeschke S, Wojtan C. Water wave animation via wavefront parameter interpolation.
ACM Transactions on Graphics. 2015;34(3). doi:10.1145/2714572
apa: Jeschke, S., & Wojtan, C. (2015). Water wave animation via wavefront parameter
interpolation. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2714572
chicago: Jeschke, Stefan, and Chris Wojtan. “Water Wave Animation via Wavefront
Parameter Interpolation.” ACM Transactions on Graphics. ACM, 2015. https://doi.org/10.1145/2714572.
ieee: S. Jeschke and C. Wojtan, “Water wave animation via wavefront parameter interpolation,”
ACM Transactions on Graphics, vol. 34, no. 3. ACM, 2015.
ista: Jeschke S, Wojtan C. 2015. Water wave animation via wavefront parameter interpolation.
ACM Transactions on Graphics. 34(3), 27.
mla: Jeschke, Stefan, and Chris Wojtan. “Water Wave Animation via Wavefront Parameter
Interpolation.” ACM Transactions on Graphics, vol. 34, no. 3, 27, ACM,
2015, doi:10.1145/2714572.
short: S. Jeschke, C. Wojtan, ACM Transactions on Graphics 34 (2015).
date_created: 2018-12-11T11:54:09Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2023-02-23T10:15:40Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2714572
ec_funded: 1
file:
- access_level: open_access
checksum: 67c9f4fa370def68cdf31299e48bc91f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:15Z
date_updated: 2020-07-14T12:45:17Z
file_id: '4933'
file_name: IST-2016-575-v1+1_wavefront_preprint.pdf
file_size: 23712153
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 34'
issue: '3'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
project:
- _id: 25357BD2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 24352-N23
name: 'Deep Pictures: Creating Visual and Haptic Vector Images'
- _id: 2533E772-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '638176'
name: Efficient Simulation of Natural Phenomena at Extremely Large Scales
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '5292'
pubrep_id: '575'
quality_controlled: '1'
scopus_import: 1
status: public
title: Water wave animation via wavefront parameter interpolation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '1818'
abstract:
- lang: eng
text: 'Why do species not adapt to ever-wider ranges of conditions, gradually expanding
their ecological niche and geographic range? Gene flow across environments has
two conflicting effects: although it increases genetic variation, which is a prerequisite
for adaptation, gene flow may swamp adaptation to local conditions. In 1956, Haldane
proposed that, when the environment varies across space, "swamping"
by gene flow creates a positive feedback between low population size and maladaptation,
leading to a sharp range margin. However, current deterministic theory shows that,
when variance can evolve, there is no such limit. Using simple analytical tools
and simulations, we show that genetic drift can generate a sharp margin to a species''
range, by reducing genetic variance below the level needed for adaptation to spatially
variable conditions. Aided by separation of ecological and evolutionary timescales,
the identified effective dimensionless parameters reveal a simple threshold that
predicts when adaptation at the range margin fails. Two observable parameters
determine the threshold: (i) the effective environmental gradient, which can be
measured by the loss of fitness due to dispersal to a different environment; and
(ii) the efficacy of selection relative to genetic drift. The theory predicts
sharp range margins even in the absence of abrupt changes in the environment.
Furthermore, it implies that gradual worsening of conditions across a species''
habitat may lead to a sudden range fragmentation, when adaptation to a wide span
of conditions within a single species becomes impossible.'
author:
- first_name: Jitka
full_name: Polechova, Jitka
id: 3BBFB084-F248-11E8-B48F-1D18A9856A87
last_name: Polechova
orcid: 0000-0003-0951-3112
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Polechova J, Barton NH. Limits to adaptation along environmental gradients.
PNAS. 2015;112(20):6401-6406. doi:10.1073/pnas.1421515112
apa: Polechova, J., & Barton, N. H. (2015). Limits to adaptation along environmental
gradients. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1421515112
chicago: Polechova, Jitka, and Nicholas H Barton. “Limits to Adaptation along Environmental
Gradients.” PNAS. National Academy of Sciences, 2015. https://doi.org/10.1073/pnas.1421515112.
ieee: J. Polechova and N. H. Barton, “Limits to adaptation along environmental gradients,”
PNAS, vol. 112, no. 20. National Academy of Sciences, pp. 6401–6406, 2015.
ista: Polechova J, Barton NH. 2015. Limits to adaptation along environmental gradients.
PNAS. 112(20), 6401–6406.
mla: Polechova, Jitka, and Nicholas H. Barton. “Limits to Adaptation along Environmental
Gradients.” PNAS, vol. 112, no. 20, National Academy of Sciences, 2015,
pp. 6401–06, doi:10.1073/pnas.1421515112.
short: J. Polechova, N.H. Barton, PNAS 112 (2015) 6401–6406.
date_created: 2018-12-11T11:54:11Z
date_published: 2015-05-19T00:00:00Z
date_updated: 2021-01-12T06:53:24Z
day: '19'
department:
- _id: NiBa
doi: 10.1073/pnas.1421515112
ec_funded: 1
external_id:
pmid:
- '25941385'
intvolume: ' 112'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4443383/
month: '05'
oa: 1
oa_version: Submitted Version
page: 6401 - 6406
pmid: 1
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5288'
quality_controlled: '1'
scopus_import: 1
status: public
title: Limits to adaptation along environmental gradients
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1819'
abstract:
- lang: eng
text: 'The sessile life style of plants creates the need to deal with an often adverse
environment, in which water availability can change on a daily basis, challenging
the cellular physiology and integrity. Changes in osmotic conditions disrupt the
equilibrium of the plasma membrane: hypoosmotic conditions increase and hyperosmotic
environment decrease the cell volume. Here, we show that short-term extracellular
osmotic treatments are closely followed by a shift in the balance between endocytosis
and exocytosis in root meristem cells. Acute hyperosmotic treatments (ionic and
nonionic) enhance clathrin-mediated endocytosis simultaneously attenuating exocytosis,
whereas hypoosmotic treatments have the opposite effects. In addition to clathrin
recruitment to the plasma membrane, components of early endocytic trafficking
are essential during hyperosmotic stress responses. Consequently, growth of seedlings
defective in elements of clathrin or early endocytic machinery is more sensitive
to hyperosmotic treatments. We also found that the endocytotic response to a change
of osmotic status in the environment is dominant over the presumably evolutionary
more recent regulatory effect of plant hormones, such as auxin. These results
imply that osmotic perturbation influences the balance between endocytosis and
exocytosis acting through clathrin-mediated endocytosis. We propose that tension
on the plasma membrane determines the addition or removal of membranes at the
cell surface, thus preserving cell integrity.'
acknowledgement: This work was supported by the European Research Council (project
ERC-2011-StG-20101109-PSDP); European Social Fund (CZ.1.07/2.3.00/20.0043) and the
Czech Science Foundation GAČR (GA13-40637S) to J.F.; project Postdoc I. (CZ.1.07/2.3.00/30.0009)
co-financed by the European Social Fund and the state budget of the Czech Republic
to M.Z. and T.N..
author:
- first_name: Marta
full_name: Zwiewka, Marta
last_name: Zwiewka
- first_name: Tomasz
full_name: Nodzyński, Tomasz
last_name: Nodzyński
- first_name: Stéphanie
full_name: Robert, Stéphanie
last_name: Robert
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Zwiewka M, Nodzyński T, Robert S, Vanneste S, Friml J. Osmotic stress modulates
the balance between exocytosis and clathrin mediated endocytosis in Arabidopsis
thaliana. Molecular Plant. 2015;8(8):1175-1187. doi:10.1016/j.molp.2015.03.007
apa: Zwiewka, M., Nodzyński, T., Robert, S., Vanneste, S., & Friml, J. (2015).
Osmotic stress modulates the balance between exocytosis and clathrin mediated
endocytosis in Arabidopsis thaliana. Molecular Plant. Elsevier. https://doi.org/10.1016/j.molp.2015.03.007
chicago: Zwiewka, Marta, Tomasz Nodzyński, Stéphanie Robert, Steffen Vanneste, and
Jiří Friml. “Osmotic Stress Modulates the Balance between Exocytosis and Clathrin
Mediated Endocytosis in Arabidopsis Thaliana.” Molecular Plant. Elsevier,
2015. https://doi.org/10.1016/j.molp.2015.03.007.
ieee: M. Zwiewka, T. Nodzyński, S. Robert, S. Vanneste, and J. Friml, “Osmotic stress
modulates the balance between exocytosis and clathrin mediated endocytosis in
Arabidopsis thaliana,” Molecular Plant, vol. 8, no. 8. Elsevier, pp. 1175–1187,
2015.
ista: Zwiewka M, Nodzyński T, Robert S, Vanneste S, Friml J. 2015. Osmotic stress
modulates the balance between exocytosis and clathrin mediated endocytosis in
Arabidopsis thaliana. Molecular Plant. 8(8), 1175–1187.
mla: Zwiewka, Marta, et al. “Osmotic Stress Modulates the Balance between Exocytosis
and Clathrin Mediated Endocytosis in Arabidopsis Thaliana.” Molecular Plant,
vol. 8, no. 8, Elsevier, 2015, pp. 1175–87, doi:10.1016/j.molp.2015.03.007.
short: M. Zwiewka, T. Nodzyński, S. Robert, S. Vanneste, J. Friml, Molecular Plant
8 (2015) 1175–1187.
date_created: 2018-12-11T11:54:11Z
date_published: 2015-08-03T00:00:00Z
date_updated: 2021-01-12T06:53:24Z
day: '03'
department:
- _id: JiFr
doi: 10.1016/j.molp.2015.03.007
ec_funded: 1
intvolume: ' 8'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 1175 - 1187
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Molecular Plant
publication_status: published
publisher: Elsevier
publist_id: '5287'
quality_controlled: '1'
scopus_import: 1
status: public
title: Osmotic stress modulates the balance between exocytosis and clathrin mediated
endocytosis in Arabidopsis thaliana
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2015'
...
---
_id: '1823'
abstract:
- lang: eng
text: Abstract Drug combinations are increasingly important in disease treatments,
for combating drug resistance, and for elucidating fundamental relationships in
cell physiology. When drugs are combined, their individual effects on cells may
be amplified or weakened. Such drug interactions are crucial for treatment efficacy,
but their underlying mechanisms remain largely unknown. To uncover the causes
of drug interactions, we developed a systematic approach based on precise quantification
of the individual and joint effects of antibiotics on growth of genome-wide Escherichia
coli gene deletion strains. We found that drug interactions between antibiotics
representing the main modes of action are highly robust to genetic perturbation.
This robustness is encapsulated in a general principle of bacterial growth, which
enables the quantitative prediction of mutant growth rates under drug combinations.
Rare violations of this principle exposed recurring cellular functions controlling
drug interactions. In particular, we found that polysaccharide and ATP synthesis
control multiple drug interactions with previously unexplained mechanisms, and
small molecule adjuvants targeting these functions synthetically reshape drug
interactions in predictable ways. These results provide a new conceptual framework
for the design of multidrug combinations and suggest that there are universal
mechanisms at the heart of most drug interactions. Synopsis A general principle
of bacterial growth enables the prediction of mutant growth rates under drug combinations.
Rare violations of this principle expose cellular functions that control drug
interactions and can be targeted by small molecules to alter drug interactions
in predictable ways. Drug interactions between antibiotics are highly robust to
genetic perturbations. A general principle of bacterial growth enables the prediction
of mutant growth rates under drug combinations. Rare violations of this principle
expose cellular functions that control drug interactions. Diverse drug interactions
are controlled by recurring cellular functions, including LPS synthesis and ATP
synthesis. A general principle of bacterial growth enables the prediction of mutant
growth rates under drug combinations. Rare violations of this principle expose
cellular functions that control drug interactions and can be targeted by small
molecules to alter drug interactions in predictable ways.
article_number: '807'
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Bollenbach MT. Systematic discovery of drug interaction mechanisms.
Molecular Systems Biology. 2015;11(4). doi:10.15252/msb.20156098
apa: Chevereau, G., & Bollenbach, M. T. (2015). Systematic discovery of drug
interaction mechanisms. Molecular Systems Biology. Nature Publishing Group.
https://doi.org/10.15252/msb.20156098
chicago: Chevereau, Guillaume, and Mark Tobias Bollenbach. “Systematic Discovery
of Drug Interaction Mechanisms.” Molecular Systems Biology. Nature Publishing
Group, 2015. https://doi.org/10.15252/msb.20156098.
ieee: G. Chevereau and M. T. Bollenbach, “Systematic discovery of drug interaction
mechanisms,” Molecular Systems Biology, vol. 11, no. 4. Nature Publishing
Group, 2015.
ista: Chevereau G, Bollenbach MT. 2015. Systematic discovery of drug interaction
mechanisms. Molecular Systems Biology. 11(4), 807.
mla: Chevereau, Guillaume, and Mark Tobias Bollenbach. “Systematic Discovery of
Drug Interaction Mechanisms.” Molecular Systems Biology, vol. 11, no. 4,
807, Nature Publishing Group, 2015, doi:10.15252/msb.20156098.
short: G. Chevereau, M.T. Bollenbach, Molecular Systems Biology 11 (2015).
date_created: 2018-12-11T11:54:12Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:26Z
day: '01'
ddc:
- '570'
department:
- _id: ToBo
doi: 10.15252/msb.20156098
ec_funded: 1
file:
- access_level: open_access
checksum: 4289b518fbe2166682fb1a1ef9b405f3
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:34Z
date_updated: 2020-07-14T12:45:17Z
file_id: '5087'
file_name: IST-2015-395-v1+1_807.full.pdf
file_size: 1273573
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 11'
issue: '4'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25E9AF9E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P27201-B22
name: Revealing the mechanisms underlying drug interactions
- _id: 25EB3A80-B435-11E9-9278-68D0E5697425
grant_number: RGP0042/2013
name: Revealing the fundamental limits of cell growth
- _id: 25E83C2C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303507'
name: Optimality principles in responses to antibiotics
publication: Molecular Systems Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '5283'
pubrep_id: '395'
quality_controlled: '1'
scopus_import: 1
status: public
title: Systematic discovery of drug interaction mechanisms
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: 11
year: '2015'
...
---
_id: '1824'
abstract:
- lang: eng
text: Condensation phenomena arise through a collective behaviour of particles.
They are observed in both classical and quantum systems, ranging from the formation
of traffic jams in mass transport models to the macroscopic occupation of the
energetic ground state in ultra-cold bosonic gases (Bose-Einstein condensation).
Recently, it has been shown that a driven and dissipative system of bosons may
form multiple condensates. Which states become the condensates has, however, remained
elusive thus far. The dynamics of this condensation are described by coupled birth-death
processes, which also occur in evolutionary game theory. Here we apply concepts
from evolutionary game theory to explain the formation of multiple condensates
in such driven-dissipative bosonic systems. We show that the vanishing of relative
entropy production determines their selection. The condensation proceeds exponentially
fast, but the system never comes to rest. Instead, the occupation numbers of condensates
may oscillate, as we demonstrate for a rock-paper-scissors game of condensates.
article_number: '6977'
author:
- first_name: Johannes
full_name: Knebel, Johannes
last_name: Knebel
- first_name: Markus
full_name: Weber, Markus
last_name: Weber
- 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
- first_name: Erwin
full_name: Frey, Erwin
last_name: Frey
citation:
ama: Knebel J, Weber M, Krüger TH, Frey E. Evolutionary games of condensates in
coupled birth-death processes. Nature Communications. 2015;6. doi:10.1038/ncomms7977
apa: Knebel, J., Weber, M., Krüger, T. H., & Frey, E. (2015). Evolutionary games
of condensates in coupled birth-death processes. Nature Communications.
Nature Publishing Group. https://doi.org/10.1038/ncomms7977
chicago: Knebel, Johannes, Markus Weber, Torben H Krüger, and Erwin Frey. “Evolutionary
Games of Condensates in Coupled Birth-Death Processes.” Nature Communications.
Nature Publishing Group, 2015. https://doi.org/10.1038/ncomms7977.
ieee: J. Knebel, M. Weber, T. H. Krüger, and E. Frey, “Evolutionary games of condensates
in coupled birth-death processes,” Nature Communications, vol. 6. Nature
Publishing Group, 2015.
ista: Knebel J, Weber M, Krüger TH, Frey E. 2015. Evolutionary games of condensates
in coupled birth-death processes. Nature Communications. 6, 6977.
mla: Knebel, Johannes, et al. “Evolutionary Games of Condensates in Coupled Birth-Death
Processes.” Nature Communications, vol. 6, 6977, Nature Publishing Group,
2015, doi:10.1038/ncomms7977.
short: J. Knebel, M. Weber, T.H. Krüger, E. Frey, Nature Communications 6 (2015).
date_created: 2018-12-11T11:54:13Z
date_published: 2015-04-24T00:00:00Z
date_updated: 2021-01-12T06:53:26Z
day: '24'
ddc:
- '530'
department:
- _id: LaEr
doi: 10.1038/ncomms7977
file:
- access_level: open_access
checksum: c4cffb5c8b245e658a34eac71a03e7cc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:54Z
date_updated: 2020-07-14T12:45:17Z
file_id: '5245'
file_name: IST-2016-451-v1+1_ncomms7977.pdf
file_size: 1151501
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '5282'
pubrep_id: '451'
quality_controlled: '1'
scopus_import: 1
status: public
title: Evolutionary games of condensates in coupled birth-death processes
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: '2015'
...
---
_id: '1831'
abstract:
- lang: eng
text: This paper introduces a theme issue presenting the latest developments in
research on the impacts of sociality on health and fitness. The articles that
follow cover research on societies ranging from insects to humans. Variation in
measures of fitness (i.e. survival and reproduction) has been linked to various
aspects of sociality in humans and animals alike, and variability in individual
health and condition has been recognized as a key mediator of these relationships.
Viewed from a broad evolutionary perspective, the evolutionary transitions from
a solitary lifestyle to group living have resulted in several new health-related
costs and benefits of sociality. Social transmission of parasites within groups
represents a major cost of group living, but some behavioural mechanisms, such
as grooming, have evolved repeatedly to reduce this cost. Group living also has
created novel costs in terms of altered susceptibility to infectious and non-infectious
disease as a result of the unavoidable physiological consequences of social competition
and integration, which are partly alleviated by social buffering in some vertebrates.
Here, we define the relevant aspects of sociality, summarize their health-related
costs and benefits, and discuss possible fitness measures in different study systems.
Given the pervasive effects of social factors on health and fitness, we propose
a synthesis of existing conceptual approaches in disease ecology, ecological immunology
and behavioural neurosciences by adding sociality as a key factor, with the goal
to generate a broader framework for organismal integration of health-related research.
acknowledgement: We thank the German Research Foundation (DFG), the Ministry of Science
and Culture of Lower-Saxony (MWK Hannover) and the German Primate Centre (DPZ) for
their support of the 9. Göttinger Freilandtage in 2013, a conference at which most
contributions to this issue were first presented, the referees of the contributions
to this issue for their constructive comments, Meggan Craft for comments, and Helen
Eaton for her support in producing this theme issue.
article_number: '20140116'
author:
- first_name: Peter
full_name: Kappeler, Peter
last_name: Kappeler
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
- first_name: Charles
full_name: Nunn, Charles
last_name: Nunn
citation:
ama: 'Kappeler P, Cremer S, Nunn C. Sociality and health: Impacts of sociality on
disease susceptibility and transmission in animal and human societies. Philosophical
Transactions of the Royal Society of London Series B, Biological Sciences.
2015;370(1669). doi:10.1098/rstb.2014.0116'
apa: 'Kappeler, P., Cremer, S., & Nunn, C. (2015). Sociality and health: Impacts
of sociality on disease susceptibility and transmission in animal and human societies.
Philosophical Transactions of the Royal Society of London. Series B, Biological
Sciences. Royal Society. https://doi.org/10.1098/rstb.2014.0116'
chicago: 'Kappeler, Peter, Sylvia Cremer, and Charles Nunn. “Sociality and Health:
Impacts of Sociality on Disease Susceptibility and Transmission in Animal and
Human Societies.” Philosophical Transactions of the Royal Society of London.
Series B, Biological Sciences. Royal Society, 2015. https://doi.org/10.1098/rstb.2014.0116.'
ieee: 'P. Kappeler, S. Cremer, and C. Nunn, “Sociality and health: Impacts of sociality
on disease susceptibility and transmission in animal and human societies,” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 370, no. 1669. Royal Society, 2015.'
ista: 'Kappeler P, Cremer S, Nunn C. 2015. Sociality and health: Impacts of sociality
on disease susceptibility and transmission in animal and human societies. Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences. 370(1669),
20140116.'
mla: 'Kappeler, Peter, et al. “Sociality and Health: Impacts of Sociality on Disease
Susceptibility and Transmission in Animal and Human Societies.” Philosophical
Transactions of the Royal Society of London. Series B, Biological Sciences,
vol. 370, no. 1669, 20140116, Royal Society, 2015, doi:10.1098/rstb.2014.0116.'
short: P. Kappeler, S. Cremer, C. Nunn, Philosophical Transactions of the Royal
Society of London. Series B, Biological Sciences 370 (2015).
date_created: 2018-12-11T11:54:15Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:29Z
day: '01'
department:
- _id: SyCr
doi: 10.1098/rstb.2014.0116
external_id:
pmid:
- '25870402'
intvolume: ' 370'
issue: '1669'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4410382/
month: '05'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Philosophical Transactions of the Royal Society of London. Series B,
Biological Sciences
publication_status: published
publisher: Royal Society
publist_id: '5272'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Sociality and health: Impacts of sociality on disease susceptibility and transmission
in animal and human societies'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 370
year: '2015'
...
---
_id: '1828'
abstract:
- lang: eng
text: We construct a non-linear Markov process connected with a biological model
of a bacterial genome recombination. The description of invariant measures of
this process gives us the solution of one problem in elementary probability theory.
article_processing_charge: No
author:
- first_name: Arseniy
full_name: Akopyan, Arseniy
id: 430D2C90-F248-11E8-B48F-1D18A9856A87
last_name: Akopyan
orcid: 0000-0002-2548-617X
- first_name: Sergey
full_name: Pirogov, Sergey
last_name: Pirogov
- first_name: Aleksandr
full_name: Rybko, Aleksandr
last_name: Rybko
citation:
ama: Akopyan A, Pirogov S, Rybko A. Invariant measures of genetic recombination
process. Journal of Statistical Physics. 2015;160(1):163-167. doi:10.1007/s10955-015-1238-5
apa: Akopyan, A., Pirogov, S., & Rybko, A. (2015). Invariant measures of genetic
recombination process. Journal of Statistical Physics. Springer. https://doi.org/10.1007/s10955-015-1238-5
chicago: Akopyan, Arseniy, Sergey Pirogov, and Aleksandr Rybko. “Invariant Measures
of Genetic Recombination Process.” Journal of Statistical Physics. Springer,
2015. https://doi.org/10.1007/s10955-015-1238-5.
ieee: A. Akopyan, S. Pirogov, and A. Rybko, “Invariant measures of genetic recombination
process,” Journal of Statistical Physics, vol. 160, no. 1. Springer, pp.
163–167, 2015.
ista: Akopyan A, Pirogov S, Rybko A. 2015. Invariant measures of genetic recombination
process. Journal of Statistical Physics. 160(1), 163–167.
mla: Akopyan, Arseniy, et al. “Invariant Measures of Genetic Recombination Process.”
Journal of Statistical Physics, vol. 160, no. 1, Springer, 2015, pp. 163–67,
doi:10.1007/s10955-015-1238-5.
short: A. Akopyan, S. Pirogov, A. Rybko, Journal of Statistical Physics 160 (2015)
163–167.
date_created: 2018-12-11T11:54:14Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2021-01-12T06:53:28Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/s10955-015-1238-5
ec_funded: 1
intvolume: ' 160'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: arxiv.org/abs/1406.5313
month: '07'
oa: 1
oa_version: Preprint
page: 163 - 167
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Statistical Physics
publication_status: published
publisher: Springer
publist_id: '5276'
quality_controlled: '1'
scopus_import: 1
status: public
title: Invariant measures of genetic recombination process
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 160
year: '2015'
...
---
_id: '1836'
abstract:
- lang: eng
text: In the standard framework for worst-case execution time (WCET) analysis of
programs, the main data structure is a single instance of integer linear programming
(ILP) that represents the whole program. The instance of this NP-hard problem
must be solved to find an estimate forWCET, and it must be refined if the estimate
is not tight.We propose a new framework for WCET analysis, based on abstract segment
trees (ASTs) as the main data structure. The ASTs have two advantages. First,
they allow computing WCET by solving a number of independent small ILP instances.
Second, ASTs store more expressive constraints, thus enabling a more efficient
and precise refinement procedure. In order to realize our framework algorithmically,
we develop an algorithm for WCET estimation on ASTs, and we develop an interpolation-based
counterexample-guided refinement scheme for ASTs. Furthermore, we extend our framework
to obtain parametric estimates of WCET. We experimentally evaluate our approach
on a set of examples from WCET benchmark suites and linear-algebra packages. We
show that our analysis, with comparable effort, provides WCET estimates that in
many cases significantly improve those computed by existing tools.
alternative_title:
- LNCS
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- 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: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
- first_name: Jakob
full_name: Zwirchmayr, Jakob
last_name: Zwirchmayr
citation:
ama: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. Segment abstraction
for worst-case execution time analysis. 2015;9032:105-131. doi:10.1007/978-3-662-46669-8_5
apa: 'Cerny, P., Henzinger, T. A., Kovács, L., Radhakrishna, A., & Zwirchmayr,
J. (2015). Segment abstraction for worst-case execution time analysis. Presented
at the ESOP: European Symposium on Programming, London, United Kingdom: Springer.
https://doi.org/10.1007/978-3-662-46669-8_5'
chicago: Cerny, Pavol, Thomas A Henzinger, Laura Kovács, Arjun Radhakrishna, and
Jakob Zwirchmayr. “Segment Abstraction for Worst-Case Execution Time Analysis.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46669-8_5.
ieee: P. Cerny, T. A. Henzinger, L. Kovács, A. Radhakrishna, and J. Zwirchmayr,
“Segment abstraction for worst-case execution time analysis,” vol. 9032. Springer,
pp. 105–131, 2015.
ista: Cerny P, Henzinger TA, Kovács L, Radhakrishna A, Zwirchmayr J. 2015. Segment
abstraction for worst-case execution time analysis. 9032, 105–131.
mla: Cerny, Pavol, et al. Segment Abstraction for Worst-Case Execution Time Analysis.
Vol. 9032, Springer, 2015, pp. 105–31, doi:10.1007/978-3-662-46669-8_5.
short: P. Cerny, T.A. Henzinger, L. Kovács, A. Radhakrishna, J. Zwirchmayr, 9032
(2015) 105–131.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'ESOP: European Symposium on Programming'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:16Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2020-08-11T10:09:32Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-46669-8_5
ec_funded: 1
intvolume: ' 9032'
language:
- iso: eng
month: '04'
oa_version: None
page: 105 - 131
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5266'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Segment abstraction for worst-case execution time analysis
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9032
year: '2015'
...
---
_id: '1838'
abstract:
- lang: eng
text: Synthesis of program parts is particularly useful for concurrent systems.
However, most approaches do not support common design tasks, like modifying a
single process without having to re-synthesize or verify the whole system. Assume-guarantee
synthesis (AGS) provides robustness against modifications of system parts, but
thus far has been limited to the perfect information setting. This means that
local variables cannot be hidden from other processes, which renders synthesis
results cumbersome or even impossible to realize.We resolve this shortcoming by
defining AGS under partial information. We analyze the complexity and decidability
in different settings, showing that the problem has a high worstcase complexity
and is undecidable in many interesting cases. Based on these observations, we
present a pragmatic algorithm based on bounded synthesis, and demonstrate its
practical applicability on several examples.
acknowledgement: 'This work was supported by the Austrian Science Fund (FWF) through
the research network RiSE (S11406-N23, S11407-N23) and grant nr. P23499-N23, by
the European Commission through an ERC Start grant (279307: Graph Games) and project
STANCE (317753), as well as by the German Research Foundation (DFG) through SFB/TR
14 AVACS and project ASDPS(JA 2357/2-1).'
alternative_title:
- LNCS
author:
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Robert
full_name: Könighofer, Robert
last_name: Könighofer
citation:
ama: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. Assume-guarantee synthesis
for concurrent reactive programs with partial information. In: Vol 9035. Springer;
2015:517-532. doi:10.1007/978-3-662-46681-0_50'
apa: 'Bloem, R., Chatterjee, K., Jacobs, S., & Könighofer, R. (2015). Assume-guarantee
synthesis for concurrent reactive programs with partial information (Vol. 9035,
pp. 517–532). Presented at the TACAS: Tools and Algorithms for the Construction
and Analysis of Systems, London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_50'
chicago: Bloem, Roderick, Krishnendu Chatterjee, Swen Jacobs, and Robert Könighofer.
“Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information,”
9035:517–32. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_50.
ieee: 'R. Bloem, K. Chatterjee, S. Jacobs, and R. Könighofer, “Assume-guarantee
synthesis for concurrent reactive programs with partial information,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom, 2015, vol. 9035, pp. 517–532.'
ista: 'Bloem R, Chatterjee K, Jacobs S, Könighofer R. 2015. Assume-guarantee synthesis
for concurrent reactive programs with partial information. TACAS: Tools and Algorithms
for the Construction and Analysis of Systems, LNCS, vol. 9035, 517–532.'
mla: Bloem, Roderick, et al. Assume-Guarantee Synthesis for Concurrent Reactive
Programs with Partial Information. Vol. 9035, Springer, 2015, pp. 517–32,
doi:10.1007/978-3-662-46681-0_50.
short: R. Bloem, K. Chatterjee, S. Jacobs, R. Könighofer, in:, Springer, 2015, pp.
517–532.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:17Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:32Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_50
ec_funded: 1
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1411.4604
month: '01'
oa: 1
oa_version: Preprint
page: 517 - 532
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '5264'
scopus_import: 1
status: public
title: Assume-guarantee synthesis for concurrent reactive programs with partial information
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1839'
abstract:
- lang: eng
text: We present MultiGain, a tool to synthesize strategies for Markov decision
processes (MDPs) with multiple mean-payoff objectives. Our models are described
in PRISM, and our tool uses the existing interface and simulator of PRISM. Our
tool extends PRISM by adding novel algorithms for multiple mean-payoff objectives,
and also provides features such as (i) generating strategies and exploring them
for simulation, and checking them with respect to other properties; and (ii) generating
an approximate Pareto curve for two mean-payoff objectives. In addition, we present
a new practical algorithm for the analysis of MDPs with multiple mean-payoff objectives
under memoryless strategies.
alternative_title:
- LNCS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. Multigain: A controller synthesis
tool for MDPs with multiple mean-payoff objectives. 2015;9035:181-187. doi:10.1007/978-3-662-46681-0_12'
apa: 'Brázdil, T., Chatterjee, K., Forejt, V., & Kučera, A. (2015). Multigain:
A controller synthesis tool for MDPs with multiple mean-payoff objectives. Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
London, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-46681-0_12'
chicago: 'Brázdil, Tomáš, Krishnendu Chatterjee, Vojtěch Forejt, and Antonín Kučera.
“Multigain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-46681-0_12.'
ieee: 'T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera, “Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives,” vol. 9035. Springer,
pp. 181–187, 2015.'
ista: 'Brázdil T, Chatterjee K, Forejt V, Kučera A. 2015. Multigain: A controller
synthesis tool for MDPs with multiple mean-payoff objectives. 9035, 181–187.'
mla: 'Brázdil, Tomáš, et al. Multigain: A Controller Synthesis Tool for MDPs
with Multiple Mean-Payoff Objectives. Vol. 9035, Springer, 2015, pp. 181–87,
doi:10.1007/978-3-662-46681-0_12.'
short: T. Brázdil, K. Chatterjee, V. Forejt, A. Kučera, 9035 (2015) 181–187.
conference:
end_date: 2015-04-18
location: London, United Kingdom
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2015-04-11
date_created: 2018-12-11T11:54:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-01-21T13:18:52Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-46681-0_12
ec_funded: 1
intvolume: ' 9035'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.03093
month: '01'
oa: 1
oa_version: Preprint
page: 181 - 187
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '5263'
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'Multigain: A controller synthesis tool for MDPs with multiple mean-payoff
objectives'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9035
year: '2015'
...
---
_id: '1837'
abstract:
- lang: eng
text: 'Transition to turbulence in straight pipes occurs in spite of the linear
stability of the laminar Hagen-Poiseuille flow if both the amplitude of flow perturbations
and the Reynolds number Re exceed a minimum threshold (subcritical transition).
As the pipe curvature increases, centrifugal effects become important, modifying
the basic flow as well as the most unstable linear modes. If the curvature (tube-to-coiling
diameter d/D) is sufficiently large, a Hopf bifurcation (supercritical instability)
is encountered before turbulence can be excited (subcritical instability). We
trace the instability thresholds in the Re - d/D parameter space in the range
0.01 ≤ d/D\ ≤ 0.1 by means of laser-Doppler velocimetry and determine the point
where the subcritical and supercritical instabilities meet. Two different experimental
set-ups are used: a closed system where the pipe forms an axisymmetric torus and
an open system employing a helical pipe. Implications for the measurement of friction
factors in curved pipes are discussed.'
article_number: R3
article_processing_charge: No
article_type: original
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: P
full_name: Braunshier, P
last_name: Braunshier
- first_name: M
full_name: Schwegel, M
last_name: Schwegel
- first_name: Hendrik
full_name: Kuhlmann, Hendrik
last_name: Kuhlmann
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. Subcritical versus supercritical
transition to turbulence in curved pipes. Journal of Fluid Mechanics. 2015;770(5).
doi:10.1017/jfm.2015.184
apa: Kühnen, J., Braunshier, P., Schwegel, M., Kuhlmann, H., & Hof, B. (2015).
Subcritical versus supercritical transition to turbulence in curved pipes. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2015.184
chicago: Kühnen, Jakob, P Braunshier, M Schwegel, Hendrik Kuhlmann, and Björn Hof.
“Subcritical versus Supercritical Transition to Turbulence in Curved Pipes.” Journal
of Fluid Mechanics. Cambridge University Press, 2015. https://doi.org/10.1017/jfm.2015.184.
ieee: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, and B. Hof, “Subcritical
versus supercritical transition to turbulence in curved pipes,” Journal of
Fluid Mechanics, vol. 770, no. 5. Cambridge University Press, 2015.
ista: Kühnen J, Braunshier P, Schwegel M, Kuhlmann H, Hof B. 2015. Subcritical versus
supercritical transition to turbulence in curved pipes. Journal of Fluid Mechanics.
770(5), R3.
mla: Kühnen, Jakob, et al. “Subcritical versus Supercritical Transition to Turbulence
in Curved Pipes.” Journal of Fluid Mechanics, vol. 770, no. 5, R3, Cambridge
University Press, 2015, doi:10.1017/jfm.2015.184.
short: J. Kühnen, P. Braunshier, M. Schwegel, H. Kuhlmann, B. Hof, Journal of Fluid
Mechanics 770 (2015).
date_created: 2018-12-11T11:54:17Z
date_published: 2015-04-08T00:00:00Z
date_updated: 2021-01-12T06:53:31Z
day: '08'
department:
- _id: BjHo
doi: 10.1017/jfm.2015.184
ec_funded: 1
external_id:
arxiv:
- '1508.06559'
intvolume: ' 770'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.06559
month: '04'
oa: 1
oa_version: Preprint
project:
- _id: 25152F3A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '306589'
name: Decoding the complexity of turbulence at its origin
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '5265'
quality_controlled: '1'
scopus_import: 1
status: public
title: Subcritical versus supercritical transition to turbulence in curved pipes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 770
year: '2015'
...
---
_id: '1846'
abstract:
- lang: eng
text: Modal transition systems (MTS) is a well-studied specification formalism of
reactive systems supporting a step-wise refinement methodology. Despite its many
advantages, the formalism as well as its currently known extensions are incapable
of expressing some practically needed aspects in the refinement process like exclusive,
conditional and persistent choices. We introduce a new model called parametric
modal transition systems (PMTS) together with a general modal refinement notion
that overcomes many of the limitations. We investigate the computational complexity
of modal and thorough refinement checking on PMTS and its subclasses and provide
a direct encoding of the modal refinement problem into quantified Boolean formulae,
allowing us to employ state-of-the-art QBF solvers for modal refinement checking.
The experiments we report on show that the feasibility of refinement checking
is more influenced by the degree of nondeterminism rather than by the syntactic
restrictions on the types of formulae allowed in the description of the PMTS.
article_processing_charge: No
article_type: original
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Mikael
full_name: Möller, Mikael
last_name: Möller
- first_name: Salomon
full_name: Sickert, Salomon
last_name: Sickert
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking
on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297.
doi:10.1007/s00236-015-0215-4
apa: Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba,
J. (2015). Refinement checking on parametric modal transition systems. Acta
Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4
chicago: Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert,
and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta
Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4.
ieee: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement
checking on parametric modal transition systems,” Acta Informatica, vol.
52, no. 2–3. Springer, pp. 269–297, 2015.
ista: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement
checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.
mla: Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.”
Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.
short: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica
52 (2015) 269–297.
date_created: 2018-12-11T11:54:20Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:35Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/s00236-015-0215-4
ec_funded: 1
file:
- access_level: open_access
checksum: fb4037ddc4fc05f33080dd3547ede350
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:57:44Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7854'
file_name: 2015_ActaInfo_Benes.pdf
file_size: 488482
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 52'
issue: 2-3
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 269 - 297
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '5255'
quality_controlled: '1'
scopus_import: 1
status: public
title: Refinement checking on parametric modal transition systems
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 52
year: '2015'
...
---
_id: '1845'
abstract:
- lang: eng
text: Based on extrapolation from excitatory synapses, it is often assumed that
depletion of the releasable pool of synaptic vesicles is the main factor underlying
depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression. Based on extrapolation from excitatory synapses, it is often assumed
that depletion of the releasable pool of synaptic vesicles is the main factor
underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression.
article_processing_charge: No
author:
- first_name: David H
full_name: Vandael, David H
id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
last_name: Vandael
orcid: 0000-0001-7577-1676
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic
terminals. Neuron. 2015;85(6):1149-1151. doi:10.1016/j.neuron.2015.03.006
apa: Vandael, D. H., Espinoza Martinez, C., & Jonas, P. M. (2015). Excitement
about inhibitory presynaptic terminals. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2015.03.006
chicago: Vandael, David H, Claudia Espinoza Martinez, and Peter M Jonas. “Excitement
about Inhibitory Presynaptic Terminals.” Neuron. Elsevier, 2015. https://doi.org/10.1016/j.neuron.2015.03.006.
ieee: D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory
presynaptic terminals,” Neuron, vol. 85, no. 6. Elsevier, pp. 1149–1151,
2015.
ista: Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory
presynaptic terminals. Neuron. 85(6), 1149–1151.
mla: Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.”
Neuron, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:10.1016/j.neuron.2015.03.006.
short: D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.
date_created: 2018-12-11T11:54:19Z
date_published: 2015-03-18T00:00:00Z
date_updated: 2021-10-08T09:07:34Z
day: '18'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2015.03.006
file:
- access_level: open_access
checksum: d1808550e376a0eca2a950fda017cfa6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5192'
file_name: IST-2017-822-v1+1_Perspective_Fig__Final.pdf
file_size: 411832
relation: main_file
- access_level: open_access
checksum: a279f4ae61e6c8f33d68f69a0d02097d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5193'
file_name: IST-2017-822-v1+2_Perspective_Final2.pdf
file_size: 100769
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 85'
issue: '6'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1149 - 1151
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '5256'
pubrep_id: '822'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Excitement about inhibitory presynaptic terminals
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 85
year: '2015'
...
---
_id: '1840'
abstract:
- lang: eng
text: In this paper, we present a method for reducing a regular, discrete-time Markov
chain (DTMC) to another DTMC with a given, typically much smaller number of states.
The cost of reduction is defined as the Kullback-Leibler divergence rate between
a projection of the original process through a partition function and a DTMC on
the correspondingly partitioned state space. Finding the reduced model with minimal
cost is computationally expensive, as it requires an exhaustive search among all
state space partitions, and an exact evaluation of the reduction cost for each
candidate partition. Our approach deals with the latter problem by minimizing
an upper bound on the reduction cost instead of minimizing the exact cost. The
proposed upper bound is easy to compute and it is tight if the original chain
is lumpable with respect to the partition. Then, we express the problem in the
form of information bottleneck optimization, and propose using the agglomerative
information bottleneck algorithm for searching a suboptimal partition greedily,
rather than exhaustively. The theory is illustrated with examples and one application
scenario in the context of modeling bio-molecular interactions.
acknowledgement: "This work was supported by the Austrian Research Association under
Project 06/12684, by the Swiss National Science Foundation (SNSF) under Grant PP00P2
128503/1, by the SystemsX.ch (the Swiss Inititative for Systems Biology), and by
a SNSF Early Postdoc.Mobility Fellowship grant P2EZP2_148797.\r\n"
author:
- first_name: Bernhard
full_name: Geiger, Bernhard
last_name: Geiger
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Gernot
full_name: Kubin, Gernot
last_name: Kubin
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
citation:
ama: Geiger B, Petrov T, Kubin G, Koeppl H. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 2015;60(4):1010-1022.
doi:10.1109/TAC.2014.2364971
apa: Geiger, B., Petrov, T., Kubin, G., & Koeppl, H. (2015). Optimal Kullback-Leibler
aggregation via information bottleneck. IEEE Transactions on Automatic Control.
IEEE. https://doi.org/10.1109/TAC.2014.2364971
chicago: Geiger, Bernhard, Tatjana Petrov, Gernot Kubin, and Heinz Koeppl. “Optimal
Kullback-Leibler Aggregation via Information Bottleneck.” IEEE Transactions
on Automatic Control. IEEE, 2015. https://doi.org/10.1109/TAC.2014.2364971.
ieee: B. Geiger, T. Petrov, G. Kubin, and H. Koeppl, “Optimal Kullback-Leibler aggregation
via information bottleneck,” IEEE Transactions on Automatic Control, vol.
60, no. 4. IEEE, pp. 1010–1022, 2015.
ista: Geiger B, Petrov T, Kubin G, Koeppl H. 2015. Optimal Kullback-Leibler aggregation
via information bottleneck. IEEE Transactions on Automatic Control. 60(4), 1010–1022.
mla: Geiger, Bernhard, et al. “Optimal Kullback-Leibler Aggregation via Information
Bottleneck.” IEEE Transactions on Automatic Control, vol. 60, no. 4, IEEE,
2015, pp. 1010–22, doi:10.1109/TAC.2014.2364971.
short: B. Geiger, T. Petrov, G. Kubin, H. Koeppl, IEEE Transactions on Automatic
Control 60 (2015) 1010–1022.
date_created: 2018-12-11T11:54:18Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2021-01-12T06:53:33Z
day: '01'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1109/TAC.2014.2364971
intvolume: ' 60'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1304.6603
month: '04'
oa: 1
oa_version: Preprint
page: 1010 - 1022
publication: IEEE Transactions on Automatic Control
publication_identifier:
issn:
- 0018-9286
publication_status: published
publisher: IEEE
publist_id: '5262'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal Kullback-Leibler aggregation via information bottleneck
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 60
year: '2015'
...
---
_id: '1841'
abstract:
- lang: eng
text: We propose a new family of message passing techniques for MAP estimation in
graphical models which we call Sequential Reweighted Message Passing (SRMP). Special
cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster
Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation
is simpler than the original derivation of TRW-S, and does not involve a decomposition
into trees. This allows easy generalizations. The new family of algorithms can
be viewed as a generalization of TRW-S from pairwise to higher-order graphical
models. We test SRMP on several real-world problems with promising results.
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465
apa: Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465
chicago: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE
Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.
ieee: V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930,
2015.
ista: Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
mla: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015,
pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
short: V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence
37 (2015) 919–930.
date_created: 2018-12-11T11:54:18Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2021-01-12T06:53:33Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2014.2363465
ec_funded: 1
intvolume: ' 37'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '05'
oa: 1
oa_version: Preprint
page: 919 - 930
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '5261'
quality_controlled: '1'
scopus_import: 1
status: public
title: A new look at reweighted message passing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '1849'
abstract:
- lang: eng
text: 'Cell polarity is a fundamental property of pro- and eukaryotic cells. It
is necessary for coordination of cell division, cell morphogenesis and signaling
processes. How polarity is generated and maintained is a complex issue governed
by interconnected feed-back regulations between small GTPase signaling and membrane
tension-based signaling that controls membrane trafficking, and cytoskeleton organization
and dynamics. Here, we will review the potential role for calcium as a crucial
signal that connects and coordinates the respective processes during polarization
processes in plants. This article is part of a Special Issue entitled: 13th European
Symposium on Calcium.'
acknowledgement: The contributing authors were supported by the Ghent University Special
Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33
and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP,
to J.F.), and the Research Foundation Flanders (to S.V.).
author:
- first_name: Ellie
full_name: Himschoot, Ellie
last_name: Himschoot
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
citation:
ama: Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell
polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
2015;1853(9):2168-2172. doi:10.1016/j.bbamcr.2015.02.017
apa: Himschoot, E., Beeckman, T., Friml, J., & Vanneste, S. (2015). Calcium
is an organizer of cell polarity in plants. Biochimica et Biophysica Acta -
Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2015.02.017
chicago: Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium
Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta
- Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2015.02.017.
ieee: E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer
of cell polarity in plants,” Biochimica et Biophysica Acta - Molecular Cell
Research, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.
ista: Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer
of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
1853(9), 2168–2172.
mla: Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.”
Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no.
9, Elsevier, 2015, pp. 2168–72, doi:10.1016/j.bbamcr.2015.02.017.
short: E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica
Acta - Molecular Cell Research 1853 (2015) 2168–2172.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2021-01-12T06:53:36Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.bbamcr.2015.02.017
intvolume: ' 1853'
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 2168 - 2172
publication: Biochimica et Biophysica Acta - Molecular Cell Research
publication_status: published
publisher: Elsevier
publist_id: '5252'
quality_controlled: '1'
scopus_import: 1
status: public
title: Calcium is an organizer of cell polarity in plants
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1853
year: '2015'
...
---
_id: '1847'
acknowledgement: This work was supported by the European Research Council (project
ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and
the Czech Science Foundation GAČR (GA13-40637S).
author:
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Grones P, Friml J. ABP1: Finally docking. Molecular Plant. 2015;8(3):356-358.
doi:10.1016/j.molp.2014.12.013'
apa: 'Grones, P., & Friml, J. (2015). ABP1: Finally docking. Molecular Plant.
Elsevier. https://doi.org/10.1016/j.molp.2014.12.013'
chicago: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant.
Elsevier, 2015. https://doi.org/10.1016/j.molp.2014.12.013.'
ieee: 'P. Grones and J. Friml, “ABP1: Finally docking,” Molecular Plant,
vol. 8, no. 3. Elsevier, pp. 356–358, 2015.'
ista: 'Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.'
mla: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant,
vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:10.1016/j.molp.2014.12.013.'
short: P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.
date_created: 2018-12-11T11:54:20Z
date_published: 2015-03-02T00:00:00Z
date_updated: 2021-01-12T06:53:35Z
day: '02'
department:
- _id: JiFr
doi: 10.1016/j.molp.2014.12.013
intvolume: ' 8'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 356 - 358
publication: Molecular Plant
publication_status: published
publisher: Elsevier
publist_id: '5254'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'ABP1: Finally docking'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2015'
...
---
_id: '1850'
abstract:
- lang: eng
text: 'Entomopathogenic fungi are potent biocontrol agents that are widely used
against insect pests, many of which are social insects. Nevertheless, theoretical
investigations of their particular life history are scarce. We develop a model
that takes into account the main distinguishing features between traditionally
studied diseases and obligate killing pathogens, like the (biocontrol-relevant)
insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic
fungi produce new infectious particles (conidiospores) only after host death and
not yet on the living host. Second, the killing rates of entomopathogenic fungi
depend strongly on the initial exposure dosage, thus we explicitly consider the
pathogen load of individual hosts. Further, we make the model applicable not only
to solitary host species, but also to group living species by incorporating social
interactions between hosts, like the collective disease defences of insect societies.
Our results identify the optimal killing rate for the pathogen that minimises
its invasion threshold. Furthermore, we find that the rate of contact between
hosts has an ambivalent effect: dense interaction networks between individuals
are considered to facilitate disease outbreaks because of increased pathogen transmission.
In social insects, this is compensated by their collective disease defences, i.e.,
social immunity. For the type of pathogens considered here, we show that even
without social immunity, high contact rates between live individuals dilute the
pathogen in the host colony and hence can reduce individual pathogen loads below
disease-causing levels.'
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing
rates and the ambivalent effect of high social interaction rates. Journal of
Theoretical Biology. 2015;372(5):54-64. doi:10.1016/j.jtbi.2015.02.018'
apa: 'Novak, S., & Cremer, S. (2015). Fungal disease dynamics in insect societies:
Optimal killing rates and the ambivalent effect of high social interaction rates.
Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2015.02.018'
chicago: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect
Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction
Rates.” Journal of Theoretical Biology. Elsevier, 2015. https://doi.org/10.1016/j.jtbi.2015.02.018.'
ieee: 'S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates,” Journal
of Theoretical Biology, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.'
ista: 'Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates. Journal
of Theoretical Biology. 372(5), 54–64.'
mla: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies:
Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.”
Journal of Theoretical Biology, vol. 372, no. 5, Elsevier, 2015, pp. 54–64,
doi:10.1016/j.jtbi.2015.02.018.'
short: S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-05-07T00:00:00Z
date_updated: 2021-01-12T06:53:37Z
day: '07'
ddc:
- '576'
department:
- _id: NiBa
- _id: SyCr
doi: 10.1016/j.jtbi.2015.02.018
ec_funded: 1
file:
- access_level: open_access
checksum: 3c0dcacc900bc45cc65a453dfda4ca43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5326'
file_name: IST-2015-329-v1+1_manuscript.pdf
file_size: 1546914
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 372'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 54 - 64
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '5251'
pubrep_id: '329'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Fungal disease dynamics in insect societies: Optimal killing rates and the
ambivalent effect of high social interaction rates'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 372
year: '2015'
...
---
_id: '1851'
abstract:
- lang: eng
text: We consider mating strategies for females who search for males sequentially
during a season of limited length. We show that the best strategy rejects a given
male type if encountered before a time-threshold but accepts him after. For frequency-independent
benefits, we obtain the optimal time-thresholds explicitly for both discrete and
continuous distributions of males, and allow for mistakes being made in assessing
the correct male type. When the benefits are indirect (genes for the offspring)
and the population is under frequency-dependent ecological selection, the benefits
depend on the mating strategy of other females as well. This case is particularly
relevant to speciation models that seek to explore the stability of reproductive
isolation by assortative mating under frequency-dependent ecological selection.
We show that the indirect benefits are to be quantified by the reproductive values
of couples, and describe how the evolutionarily stable time-thresholds can be
found. We conclude with an example based on the Levene model, in which we analyze
the evolutionarily stable assortative mating strategies and the strength of reproductive
isolation provided by them.
article_processing_charge: No
article_type: original
author:
- first_name: Tadeas
full_name: Priklopil, Tadeas
id: 3C869AA0-F248-11E8-B48F-1D18A9856A87
last_name: Priklopil
- first_name: Eva
full_name: Kisdi, Eva
last_name: Kisdi
- first_name: Mats
full_name: Gyllenberg, Mats
last_name: Gyllenberg
citation:
ama: Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618
apa: Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable
mating decisions for sequentially searching females and the stability of reproductive
isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618
chicago: Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable
Mating Decisions for Sequentially Searching Females and the Stability of Reproductive
Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618.
ieee: T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026,
2015.
ista: Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 69(4), 1015–1026.
mla: Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially
Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”
Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.
short: T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-02-09T00:00:00Z
date_updated: 2022-06-07T10:52:37Z
day: '09'
ddc:
- '570'
department:
- _id: NiBa
- _id: KrCh
doi: 10.1111/evo.12618
ec_funded: 1
external_id:
pmid:
- '25662095'
file:
- access_level: open_access
checksum: 1e8be0b1d7598a78cd2623d8ee8e7798
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T09:05:34Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7855'
file_name: 2015_Evolution_Priklopil.pdf
file_size: 967214
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 69'
issue: '4'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 1015 - 1026
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley
publist_id: '5249'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionarily stable mating decisions for sequentially searching females and
the stability of reproductive isolation by assortative mating
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2015'
...
---
_id: '1859'
abstract:
- lang: eng
text: "Structural support vector machines (SSVMs) are amongst the best performing
models for structured computer vision tasks, such as semantic image segmentation
or human pose estimation. Training SSVMs, however, is computationally costly,
because it requires repeated calls to a structured prediction subroutine (called
\\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a
graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that
is more efficient than earlier techniques when the max-oracle is computationally
expensive, as it is frequently the case in computer vision tasks. The main idea
is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm
with efficient hyperplane caching, and (ii) use an automatic selection rule for
deciding whether to call the exact max-oracle or to rely on an approximate one
based on the cached hyperplanes.\r\nWe show experimentally that this strategy
leads to faster convergence to the optimum with respect to the number of requires
oracle calls, and that this translates into faster convergence with respect to
the total runtime when the max-oracle is slow compared to the other steps of the
algorithm. "
author:
- first_name: Neel
full_name: Shah, Neel
id: 31ABAF80-F248-11E8-B48F-1D18A9856A87
last_name: Shah
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745.
doi:10.1109/CVPR.2015.7298890'
apa: 'Shah, N., Kolmogorov, V., & Lampert, C. (2015). A multi-plane block-coordinate
Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp.
2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston,
MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7298890'
chicago: Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane
Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly
Max-Oracle,” 2737–45. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298890.
ieee: 'N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle,” presented at
the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp.
2737–2745.'
ista: 'Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer
Vision and Pattern Recognition, 2737–2745.'
mla: Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm
for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45,
doi:10.1109/CVPR.2015.7298890.
short: N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:24Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:53:40Z
day: '01'
department:
- _id: VlKo
- _id: ChLa
doi: 10.1109/CVPR.2015.7298890
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.6804
month: '06'
oa: 1
oa_version: Preprint
page: 2737 - 2745
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_status: published
publisher: IEEE
publist_id: '5240'
quality_controlled: '1'
scopus_import: 1
status: public
title: A multi-plane block-coordinate Frank-Wolfe algorithm for training structural
SVMs with a costly max-oracle
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1860'
abstract:
- lang: eng
text: Classifiers for object categorization are usually evaluated by their accuracy
on a set of i.i.d. test examples. This provides us with an estimate of the expected
error when applying the classifiers to a single new image. In real application,
however, classifiers are rarely only used for a single image and then discarded.
Instead, they are applied sequentially to many images, and these are typically
not i.i.d. samples from a fixed data distribution, but they carry dependencies
and their class distribution varies over time. In this work, we argue that the
phenomenon of correlated data at prediction time is not a nuisance, but a blessing
in disguise. We describe a probabilistic method for adapting classifiers at prediction
time without having to retrain them. We also introduce a framework for creating
realistically distributed image sequences, which offers a way to benchmark classifier
adaptation methods, such as the one we propose. Experiments on the ILSVRC2010
and ILSVRC2012 datasets show that adapting object classification systems at prediction
time can significantly reduce their error rate, even with no additional human
feedback.
author:
- first_name: Amélie
full_name: Royer, Amélie
last_name: Royer
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409.
doi:10.1109/CVPR.2015.7298746'
apa: 'Royer, A., & Lampert, C. (2015). Classifier adaptation at prediction time
(pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition,
Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298746'
chicago: Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction
Time,” 1401–9. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298746.
ieee: 'A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented
at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States,
2015, pp. 1401–1409.'
ista: 'Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR:
Computer Vision and Pattern Recognition, 1401–1409.'
mla: Royer, Amélie, and Christoph Lampert. Classifier Adaptation at Prediction
Time. IEEE, 2015, pp. 1401–09, doi:10.1109/CVPR.2015.7298746.
short: A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:24Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:53:41Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7298746
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf
month: '06'
oa: 1
oa_version: Submitted Version
page: 1401 - 1409
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '5239'
quality_controlled: '1'
scopus_import: 1
status: public
title: Classifier adaptation at prediction time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1858'
abstract:
- lang: eng
text: 'We study the problem of predicting the future, though only in the probabilistic
sense of estimating a future state of a time-varying probability distribution.
This is not only an interesting academic problem, but solving this extrapolation
problem also has many practical application, e.g. for training classifiers that
have to operate under time-varying conditions. Our main contribution is a method
for predicting the next step of the time-varying distribution from a given sequence
of sample sets from earlier time steps. For this we rely on two recent machine
learning techniques: embedding probability distributions into a reproducing kernel
Hilbert space, and learning operators by vector-valued regression. We illustrate
the working principles and the practical usefulness of our method by experiments
on synthetic and real data. We also highlight an exemplary application: training
a classifier in a domain adaptation setting without having access to examples
from the test time distribution at training time.'
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Predicting the future behavior of a time-varying probability distribution.
In: IEEE; 2015:942-950. doi:10.1109/CVPR.2015.7298696'
apa: 'Lampert, C. (2015). Predicting the future behavior of a time-varying probability
distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern
Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298696'
chicago: Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability
Distribution,” 942–50. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298696.
ieee: 'C. Lampert, “Predicting the future behavior of a time-varying probability
distribution,” presented at the CVPR: Computer Vision and Pattern Recognition,
Boston, MA, United States, 2015, pp. 942–950.'
ista: 'Lampert C. 2015. Predicting the future behavior of a time-varying probability
distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.'
mla: Lampert, Christoph. Predicting the Future Behavior of a Time-Varying Probability
Distribution. IEEE, 2015, pp. 942–50, doi:10.1109/CVPR.2015.7298696.
short: C. Lampert, in:, IEEE, 2015, pp. 942–950.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:24Z
date_published: 2015-10-15T00:00:00Z
date_updated: 2021-01-12T06:53:40Z
day: '15'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7298696
external_id:
arxiv:
- '1406.5362'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.5362
month: '10'
oa: 1
oa_version: Preprint
page: 942 - 950
publication_status: published
publisher: IEEE
publist_id: '5241'
quality_controlled: '1'
scopus_import: 1
status: public
title: Predicting the future behavior of a time-varying probability distribution
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1857'
abstract:
- lang: eng
text: 'Sharing information between multiple tasks enables algorithms to achieve
good generalization performance even from small amounts of training data. However,
in a realistic scenario of multi-task learning not all tasks are equally related
to each other, hence it could be advantageous to transfer information only between
the most related tasks. In this work we propose an approach that processes multiple
tasks in a sequence with sharing between subsequent tasks instead of solving all
tasks jointly. Subsequently, we address the question of curriculum learning of
tasks, i.e. finding the best order of tasks to be learned. Our approach is based
on a generalization bound criterion for choosing the task order that optimizes
the average expected classification performance over all tasks. Our experimental
results show that learning multiple related tasks sequentially can be more effective
than learning them jointly, the order in which tasks are being solved affects
the overall performance, and that our model is able to automatically discover
the favourable order of tasks. '
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks.
In: IEEE; 2015:5492-5500. doi:10.1109/CVPR.2015.7299188'
apa: 'Pentina, A., Sharmanska, V., & Lampert, C. (2015). Curriculum learning
of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7299188'
chicago: Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum
Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299188.
ieee: 'A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple
tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston,
MA, United States, 2015, pp. 5492–5500.'
ista: 'Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple
tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.'
mla: Pentina, Anastasia, et al. Curriculum Learning of Multiple Tasks. IEEE,
2015, pp. 5492–500, doi:10.1109/CVPR.2015.7299188.
short: A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:23Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:17:31Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7299188
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.1353
month: '06'
oa: 1
oa_version: Preprint
page: 5492 - 5500
publication_status: published
publisher: IEEE
publist_id: '5243'
quality_controlled: '1'
scopus_import: 1
status: public
title: Curriculum learning of multiple tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1867'
abstract:
- lang: eng
text: Cultured mammalian cells essential are model systems in basic biology research,
production platforms of proteins for medical use, and testbeds in synthetic biology.
Flavin cofactors, in particular flavin mononucleotide (FMN) and flavin adenine
dinucleotide (FAD), are critical for cellular redox reactions and sense light
in naturally occurring photoreceptors and optogenetic tools. Here, we quantified
flavin contents of commonly used mammalian cell lines. We first compared three
procedures for extraction of free and noncovalently protein-bound flavins and
verified extraction using fluorescence spectroscopy. For separation, two CE methods
with different BGEs were established, and detection was performed by LED-induced
fluorescence with limit of detections (LODs 0.5-3.8 nM). We found that riboflavin
(RF), FMN, and FAD contents varied significantly between cell lines. RF (3.1-14
amol/cell) and FAD (2.2-17.0 amol/cell) were the predominant flavins, while FMN
(0.46-3.4 amol/cell) was found at markedly lower levels. Observed flavin contents
agree with those previously extracted from mammalian tissues, yet reduced forms
of RF were detected that were not described previously. Quantification of flavins
in mammalian cell lines will allow a better understanding of cellular redox reactions
and optogenetic tools.
author:
- first_name: Jens
full_name: Hühner, Jens
last_name: Hühner
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Christian
full_name: Neusüß, Christian
last_name: Neusüß
- first_name: Michael
full_name: Lämmerhofer, Michael
last_name: Lämmerhofer
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. Quantification
of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian
model cells by CE with LED-induced fluorescence detection. Electrophoresis.
2015;36(4):518-525. doi:10.1002/elps.201400451
apa: Hühner, J., Inglés Prieto, Á., Neusüß, C., Lämmerhofer, M., & Janovjak,
H. L. (2015). Quantification of riboflavin, flavin mononucleotide, and flavin
adenine dinucleotide in mammalian model cells by CE with LED-induced fluorescence
detection. Electrophoresis. Wiley. https://doi.org/10.1002/elps.201400451
chicago: Hühner, Jens, Álvaro Inglés Prieto, Christian Neusüß, Michael Lämmerhofer,
and Harald L Janovjak. “Quantification of Riboflavin, Flavin Mononucleotide, and
Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced Fluorescence
Detection.” Electrophoresis. Wiley, 2015. https://doi.org/10.1002/elps.201400451.
ieee: J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, and H. L. Janovjak,
“Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide
in mammalian model cells by CE with LED-induced fluorescence detection,” Electrophoresis,
vol. 36, no. 4. Wiley, pp. 518–525, 2015.
ista: Hühner J, Inglés Prieto Á, Neusüß C, Lämmerhofer M, Janovjak HL. 2015. Quantification
of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide in mammalian
model cells by CE with LED-induced fluorescence detection. Electrophoresis. 36(4),
518–525.
mla: Hühner, Jens, et al. “Quantification of Riboflavin, Flavin Mononucleotide,
and Flavin Adenine Dinucleotide in Mammalian Model Cells by CE with LED-Induced
Fluorescence Detection.” Electrophoresis, vol. 36, no. 4, Wiley, 2015,
pp. 518–25, doi:10.1002/elps.201400451.
short: J. Hühner, Á. Inglés Prieto, C. Neusüß, M. Lämmerhofer, H.L. Janovjak, Electrophoresis
36 (2015) 518–525.
date_created: 2018-12-11T11:54:26Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2021-01-12T06:53:43Z
day: '01'
department:
- _id: HaJa
doi: 10.1002/elps.201400451
ec_funded: 1
intvolume: ' 36'
issue: '4'
language:
- iso: eng
month: '02'
oa_version: None
page: 518 - 525
project:
- _id: 25548C20-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '303564'
name: Microbial Ion Channels for Synthetic Neurobiology
- _id: 255BFFFA-B435-11E9-9278-68D0E5697425
grant_number: RGY0084/2012
name: In situ real-time imaging of neurotransmitter signaling using designer optical
sensors (HFSP Young Investigator)
publication: Electrophoresis
publication_status: published
publisher: Wiley
publist_id: '5230'
pubrep_id: '836'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantification of riboflavin, flavin mononucleotide, and flavin adenine dinucleotide
in mammalian model cells by CE with LED-induced fluorescence detection
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2015'
...
---
_id: '1865'
abstract:
- lang: eng
text: The plant hormone auxin and its directional transport are known to play a
crucial role in defining the embryonic axis and subsequent development of the
body plan. Although the role of PIN auxin efflux transporters has been clearly
assigned during embryonic shoot and root specification, the role of the auxin
influx carriers AUX1 and LIKE-AUX1 (LAX) proteins is not well established. Here,
we used chemical and genetic tools on Brassica napus microspore-derived embryos
and Arabidopsis thaliana zygotic embryos, and demonstrate that AUX1, LAX1 and
LAX2 are required for both shoot and root pole formation, in concert with PIN
efflux carriers. Furthermore, we uncovered a positive-feedback loop betweenMONOPTEROS(ARF5)-dependent
auxin signalling and auxin transport. ThisMONOPTEROSdependent transcriptional
regulation of auxin influx (AUX1, LAX1 and LAX2) and auxin efflux (PIN1 and PIN4)
carriers by MONOPTEROS helps to maintain proper auxin transport to the root tip.
These results indicate that auxin-dependent cell specification during embryo development
requires balanced auxin transport involving both influx and efflux mechanisms,
and that this transport is maintained by a positive transcriptional feedback on
auxin signalling.
acknowledgement: W.G. is a post-doctoral fellow of the Research Foundation Flanders.
H.S.R. is supported by Employment of Best Young Scientists for International Cooperation
Empowerment [CZ.1.07/2.3.00/30.0037], co-financed by the European Social Fund and
the state budget of the Czech Republic. Mi.S. was funded by the Ramón y Cajal program.
This work was supported by the European Research Council [project ERC-2011-StG-20101109-PSDP],
project ‘CEITEC – Central European Institute of Technology’ [CZ.1.05/1.1.00/02.0068],
the European Social Fund [CZ.1.07/2.3.00/20.0043] and the Czech Science Foundation
GACR [GA13-40637S] to J.F. We acknowledge funding from the Biological and Biotechnological
Science Research Council (BBSRC) and Engineering Physics Science Research Council
(EPSRC) to R.S. and M.B
author:
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Wim
full_name: Grunewald, Wim
last_name: Grunewald
- first_name: Michael
full_name: Sauer, Michael
last_name: Sauer
- first_name: Bernard
full_name: Cannoot, Bernard
last_name: Cannoot
- first_name: Mercedes
full_name: Soriano, Mercedes
last_name: Soriano
- first_name: Ranjan
full_name: Swarup, Ranjan
last_name: Swarup
- first_name: Dolf
full_name: Weijers, Dolf
last_name: Weijers
- first_name: Malcolm
full_name: Bennett, Malcolm
last_name: Bennett
- first_name: Kim
full_name: Boutilier, Kim
last_name: Boutilier
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Robert H, Grunewald W, Sauer M, et al. Plant embryogenesis requires AUX/LAX-mediated
auxin influx. Development. 2015;142(4):702-711. doi:10.1242/dev.115832
apa: Robert, H., Grunewald, W., Sauer, M., Cannoot, B., Soriano, M., Swarup, R.,
… Friml, J. (2015). Plant embryogenesis requires AUX/LAX-mediated auxin influx.
Development. Company of Biologists. https://doi.org/10.1242/dev.115832
chicago: Robert, Hélène, Wim Grunewald, Michael Sauer, Bernard Cannoot, Mercedes
Soriano, Ranjan Swarup, Dolf Weijers, Malcolm Bennett, Kim Boutilier, and Jiří
Friml. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin Influx.” Development.
Company of Biologists, 2015. https://doi.org/10.1242/dev.115832.
ieee: H. Robert et al., “Plant embryogenesis requires AUX/LAX-mediated auxin
influx,” Development, vol. 142, no. 4. Company of Biologists, pp. 702–711,
2015.
ista: Robert H, Grunewald W, Sauer M, Cannoot B, Soriano M, Swarup R, Weijers D,
Bennett M, Boutilier K, Friml J. 2015. Plant embryogenesis requires AUX/LAX-mediated
auxin influx. Development. 142(4), 702–711.
mla: Robert, Hélène, et al. “Plant Embryogenesis Requires AUX/LAX-Mediated Auxin
Influx.” Development, vol. 142, no. 4, Company of Biologists, 2015, pp.
702–11, doi:10.1242/dev.115832.
short: H. Robert, W. Grunewald, M. Sauer, B. Cannoot, M. Soriano, R. Swarup, D.
Weijers, M. Bennett, K. Boutilier, J. Friml, Development 142 (2015) 702–711.
date_created: 2018-12-11T11:54:26Z
date_published: 2015-02-15T00:00:00Z
date_updated: 2021-01-12T06:53:43Z
day: '15'
department:
- _id: JiFr
doi: 10.1242/dev.115832
ec_funded: 1
intvolume: ' 142'
issue: '4'
language:
- iso: eng
month: '02'
oa_version: None
page: 702 - 711
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Development
publication_status: published
publisher: Company of Biologists
publist_id: '5231'
quality_controlled: '1'
scopus_import: 1
status: public
title: Plant embryogenesis requires AUX/LAX-mediated auxin influx
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 142
year: '2015'
...
---
_id: '1868'
abstract:
- lang: eng
text: We investigate high-dimensional nonlinear dynamical systems exhibiting multiple
resonances under adiabatic parameter variations. Our motivations come from experimental
considerations where time-dependent sweeping of parameters is a practical approach
to probing and characterizing the bifurcations of the system. The question is
whether bifurcations so detected are faithful representations of the bifurcations
intrinsic to the original stationary system. Utilizing a harmonically forced,
closed fluid flow system that possesses multiple resonances and solving the Navier-Stokes
equation under proper boundary conditions, we uncover the phenomenon of the early
effect. Specifically, as a control parameter, e.g., the driving frequency, is
adiabatically increased from an initial value, resonances emerge at frequency
values that are lower than those in the corresponding stationary system. The phenomenon
is established by numerical characterization of physical quantities through the
resonances, which include the kinetic energy and the vorticity field, and a heuristic
analysis based on the concept of instantaneous frequency. A simple formula is
obtained which relates the resonance points in the time-dependent and time-independent
systems. Our findings suggest that, in general, any true bifurcation of a nonlinear
dynamical system can be unequivocally uncovered through adiabatic parameter sweeping,
in spite of a shift in the bifurcation point, which is of value to experimental
studies of nonlinear dynamical systems.
article_number: '022906'
author:
- first_name: Youngyong
full_name: Park, Youngyong
last_name: Park
- first_name: Younghae
full_name: Do, Younghae
last_name: Do
- first_name: Sebastian
full_name: Altmeyer, Sebastian
id: 2EE67FDC-F248-11E8-B48F-1D18A9856A87
last_name: Altmeyer
orcid: 0000-0001-5964-0203
- first_name: Yingcheng
full_name: Lai, Yingcheng
last_name: Lai
- first_name: Gyuwon
full_name: Lee, Gyuwon
last_name: Lee
citation:
ama: Park Y, Do Y, Altmeyer S, Lai Y, Lee G. Early effect in time-dependent, high-dimensional
nonlinear dynamical systems with multiple resonances. Physical Review E.
2015;91(2). doi:10.1103/PhysRevE.91.022906
apa: Park, Y., Do, Y., Altmeyer, S., Lai, Y., & Lee, G. (2015). Early effect
in time-dependent, high-dimensional nonlinear dynamical systems with multiple
resonances. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.91.022906
chicago: Park, Youngyong, Younghae Do, Sebastian Altmeyer, Yingcheng Lai, and Gyuwon
Lee. “Early Effect in Time-Dependent, High-Dimensional Nonlinear Dynamical Systems
with Multiple Resonances.” Physical Review E. American Physical Society,
2015. https://doi.org/10.1103/PhysRevE.91.022906.
ieee: Y. Park, Y. Do, S. Altmeyer, Y. Lai, and G. Lee, “Early effect in time-dependent,
high-dimensional nonlinear dynamical systems with multiple resonances,” Physical
Review E, vol. 91, no. 2. American Physical Society, 2015.
ista: Park Y, Do Y, Altmeyer S, Lai Y, Lee G. 2015. Early effect in time-dependent,
high-dimensional nonlinear dynamical systems with multiple resonances. Physical
Review E. 91(2), 022906.
mla: Park, Youngyong, et al. “Early Effect in Time-Dependent, High-Dimensional Nonlinear
Dynamical Systems with Multiple Resonances.” Physical Review E, vol. 91,
no. 2, 022906, American Physical Society, 2015, doi:10.1103/PhysRevE.91.022906.
short: Y. Park, Y. Do, S. Altmeyer, Y. Lai, G. Lee, Physical Review E 91 (2015).
date_created: 2018-12-11T11:54:27Z
date_published: 2015-02-09T00:00:00Z
date_updated: 2021-01-12T06:53:44Z
day: '09'
department:
- _id: BjHo
doi: 10.1103/PhysRevE.91.022906
intvolume: ' 91'
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
publication: Physical Review E
publication_identifier:
issn:
- 1539-3755
publication_status: published
publisher: American Physical Society
publist_id: '5229'
quality_controlled: '1'
scopus_import: 1
status: public
title: Early effect in time-dependent, high-dimensional nonlinear dynamical systems
with multiple resonances
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 91
year: '2015'
...