---
_id: '11977'
abstract:
- lang: eng
text: The development of a continuous flow multistep strategy for the synthesis
of linear peptoids and their subsequent macrocyclization via Click chemistry is
described. The central transformation of this process is an Ugi four-component
reaction generating the peptidomimetic core structure. In order to avoid exposure
to the often toxic and malodorous isocyanide building blocks, the continuous approach
was telescoped by the dehydration of the corresponding formamide. In a concurrent
operation, the highly energetic azide moiety required for the subsequent intramolecular
copper-catalyzed azide–alkyne cycloaddition (Click reaction) was installed by
nucleophilic substitution from a bromide precursor. All steps yielding to the
linear core structures can be conveniently coupled without the need for purification
steps resulting in a single process generating the desired peptidomimetics in
good to excellent yields within a 25 min reaction time. The following macrocyclization
was realized in a coil reactor made of copper without any additional additive.
A careful process intensification study demonstrated that this transformation
occurs quantitatively within 25 min at 140 °C. Depending on the resulting ring
strain, either a dimeric or a monomeric form of the cyclic product was obtained.
article_processing_charge: No
article_type: original
author:
- first_name: Carlos Eduardo M.
full_name: Salvador, Carlos Eduardo M.
last_name: Salvador
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: Philipp M.
full_name: Neu, Philipp M.
last_name: Neu
- first_name: Ana
full_name: Torvisco, Ana
last_name: Torvisco
- first_name: Carlos
full_name: Kleber Z. Andrade, Carlos
last_name: Kleber Z. Andrade
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO.
A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach
for the continuous flow generation of cyclic peptoids. The Journal of Organic
Chemistry. 2015;80(9):4590-4602. doi:10.1021/acs.joc.5b00445
apa: Salvador, C. E. M., Pieber, B., Neu, P. M., Torvisco, A., Kleber Z. Andrade,
C., & Kappe, C. O. (2015). A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne
cycloaddition approach for the continuous flow generation of cyclic peptoids.
The Journal of Organic Chemistry. American Chemical Society. https://doi.org/10.1021/acs.joc.5b00445
chicago: Salvador, Carlos Eduardo M., Bartholomäus Pieber, Philipp M. Neu, Ana Torvisco,
Carlos Kleber Z. Andrade, and C. Oliver Kappe. “A Sequential Ugi Multicomponent/Cu-Catalyzed
Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic
Peptoids.” The Journal of Organic Chemistry. American Chemical Society,
2015. https://doi.org/10.1021/acs.joc.5b00445.
ieee: C. E. M. Salvador, B. Pieber, P. M. Neu, A. Torvisco, C. Kleber Z. Andrade,
and C. O. Kappe, “A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition
approach for the continuous flow generation of cyclic peptoids,” The Journal
of Organic Chemistry, vol. 80, no. 9. American Chemical Society, pp. 4590–4602,
2015.
ista: Salvador CEM, Pieber B, Neu PM, Torvisco A, Kleber Z. Andrade C, Kappe CO.
2015. A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition
approach for the continuous flow generation of cyclic peptoids. The Journal of
Organic Chemistry. 80(9), 4590–4602.
mla: Salvador, Carlos Eduardo M., et al. “A Sequential Ugi Multicomponent/Cu-Catalyzed
Azide–Alkyne Cycloaddition Approach for the Continuous Flow Generation of Cyclic
Peptoids.” The Journal of Organic Chemistry, vol. 80, no. 9, American Chemical
Society, 2015, pp. 4590–602, doi:10.1021/acs.joc.5b00445.
short: C.E.M. Salvador, B. Pieber, P.M. Neu, A. Torvisco, C. Kleber Z. Andrade,
C.O. Kappe, The Journal of Organic Chemistry 80 (2015) 4590–4602.
date_created: 2022-08-25T10:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-02-21T10:10:04Z
day: '01'
doi: 10.1021/acs.joc.5b00445
extern: '1'
external_id:
pmid:
- '25842982'
intvolume: ' 80'
issue: '9'
language:
- iso: eng
month: '05'
oa_version: None
page: 4590-4602
pmid: 1
publication: The Journal of Organic Chemistry
publication_identifier:
eissn:
- 1520-6904
issn:
- 0022-3263
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach
for the continuous flow generation of cyclic peptoids
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2015'
...
---
_id: '11989'
abstract:
- lang: eng
text: In recent years, the high demand for sustainable processes resulted in the
development of highly attractive oxidation protocols utilizing molecular oxygen
or even air instead of more uneconomic and often toxic reagents. The application
of these sustainable, gaseous oxidants in conventional batch reactors is often
associated with severe safety risks and process challenges especially on larger
scales. Continuous flow technology offers the possibility to minimize these safety
hazards and concurrently allows working in high-temperature/high-pressure regimes
to access highly efficient oxidation protocols. This review article critically
discusses recent literature examples of flow methodologies for selective aerobic
oxidations of organic compounds. Several technologies and reactor designs for
biphasic gas/liquid as well as supercritical reaction media are presented in detail.
© Springer International Publishing Switzerland 2015.
alternative_title:
- Topics in Organometallic Chemistry
article_processing_charge: No
author:
- first_name: Bartholomäus
full_name: Pieber, Bartholomäus
id: 93e5e5b2-0da6-11ed-8a41-af589a024726
last_name: Pieber
orcid: 0000-0001-8689-388X
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: 'Pieber B, Kappe CO. Aerobic oxidations in continuous flow. In: Noël T, ed.
Organometallic Flow Chemistry. Vol 57. 1st ed. TOPORGAN. Cham: Springer
Nature; 2015:97–136. doi:10.1007/3418_2015_133'
apa: 'Pieber, B., & Kappe, C. O. (2015). Aerobic oxidations in continuous flow.
In T. Noël (Ed.), Organometallic Flow Chemistry (1st ed., Vol. 57, pp.
97–136). Cham: Springer Nature. https://doi.org/10.1007/3418_2015_133'
chicago: 'Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous
Flow.” In Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed.,
57:97–136. TOPORGAN. Cham: Springer Nature, 2015. https://doi.org/10.1007/3418_2015_133.'
ieee: 'B. Pieber and C. O. Kappe, “Aerobic oxidations in continuous flow,” in Organometallic
Flow Chemistry, 1st ed., vol. 57, T. Noël, Ed. Cham: Springer Nature, 2015,
pp. 97–136.'
ista: 'Pieber B, Kappe CO. 2015.Aerobic oxidations in continuous flow. In: Organometallic
Flow Chemistry. Topics in Organometallic Chemistry, vol. 57, 97–136.'
mla: Pieber, Bartholomäus, and C. Oliver Kappe. “Aerobic Oxidations in Continuous
Flow.” Organometallic Flow Chemistry, edited by Timothy Noël, 1st ed.,
vol. 57, Springer Nature, 2015, pp. 97–136, doi:10.1007/3418_2015_133.
short: B. Pieber, C.O. Kappe, in:, T. Noël (Ed.), Organometallic Flow Chemistry,
1st ed., Springer Nature, Cham, 2015, pp. 97–136.
date_created: 2022-08-25T11:58:38Z
date_published: 2015-06-10T00:00:00Z
date_updated: 2023-02-21T10:10:35Z
day: '10'
doi: 10.1007/3418_2015_133
edition: '1'
editor:
- first_name: Timothy
full_name: Noël, Timothy
last_name: Noël
extern: '1'
intvolume: ' 57'
language:
- iso: eng
month: '06'
oa_version: None
page: 97–136
place: Cham
publication: Organometallic Flow Chemistry
publication_identifier:
eisbn:
- '9783319332437'
eissn:
- 1616-8534
isbn:
- '9783319332413'
issn:
- 1436-6002
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: TOPORGAN
status: public
title: Aerobic oxidations in continuous flow
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 57
year: '2015'
...
---
_id: '120'
abstract:
- lang: eng
text: Clustering of fine particles is of crucial importance in settings ranging
from the early stages of planet formation to the coagulation of industrial powders
and airborne pollutants. Models of such clustering typically focus on inelastic
deformation and cohesion. However, even in charge-neutral particle systems comprising
grains of the same dielectric material, tribocharging can generate large amounts
of net positive or negative charge on individual particles, resulting in long-range
electrostatic forces. The effects of such forces on cluster formation are not
well understood and have so far not been studied in situ. Here we report the first
observations of individual collide-and-capture events between charged submillimetre
particles, including Kepler-like orbits. Charged particles can become trapped
in their mutual electrostatic energy well and aggregate via multiple bounces.
This enables the initiation of clustering at relative velocities much larger than
the upper limit for sticking after a head-on collision, a long-standing issue
known from pre-planetary dust aggregation. Moreover, Coulomb interactions together
with dielectric polarization are found to stabilize characteristic molecule-like
configurations, providing new insights for the modelling of clustering dynamics
in a wide range of microscopic dielectric systems, such as charged polarizable
ions, biomolecules and colloids.
acknowledgement: This research was supported by NSF through DMR-1309611. The Chicago
MRSEC, supported by NSF DMR-1420709, is gratefully acknowledged for access to its
shared experimental facilities.
author:
- first_name: Victor
full_name: Lee, Victor
last_name: Lee
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Marc
full_name: Miskin, Marc
last_name: Miskin
- first_name: Heinrich
full_name: Jaeger, Heinrich
last_name: Jaeger
citation:
ama: Lee V, Waitukaitis SR, Miskin M, Jaeger H. Direct observation of particle interactions
and clustering in charged granular streams. Nature Physics. 2015;11(9):733-737.
doi:10.1038/nphys3396
apa: Lee, V., Waitukaitis, S. R., Miskin, M., & Jaeger, H. (2015). Direct observation
of particle interactions and clustering in charged granular streams. Nature
Physics. Nature Publishing Group. https://doi.org/10.1038/nphys3396
chicago: Lee, Victor, Scott R Waitukaitis, Marc Miskin, and Heinrich Jaeger. “Direct
Observation of Particle Interactions and Clustering in Charged Granular Streams.”
Nature Physics. Nature Publishing Group, 2015. https://doi.org/10.1038/nphys3396.
ieee: V. Lee, S. R. Waitukaitis, M. Miskin, and H. Jaeger, “Direct observation of
particle interactions and clustering in charged granular streams,” Nature Physics,
vol. 11, no. 9. Nature Publishing Group, pp. 733–737, 2015.
ista: Lee V, Waitukaitis SR, Miskin M, Jaeger H. 2015. Direct observation of particle
interactions and clustering in charged granular streams. Nature Physics. 11(9),
733–737.
mla: Lee, Victor, et al. “Direct Observation of Particle Interactions and Clustering
in Charged Granular Streams.” Nature Physics, vol. 11, no. 9, Nature Publishing
Group, 2015, pp. 733–37, doi:10.1038/nphys3396.
short: V. Lee, S.R. Waitukaitis, M. Miskin, H. Jaeger, Nature Physics 11 (2015)
733–737.
date_created: 2018-12-11T11:44:44Z
date_published: 2015-07-13T00:00:00Z
date_updated: 2021-01-12T06:49:02Z
day: '13'
doi: 10.1038/nphys3396
extern: '1'
intvolume: ' 11'
issue: '9'
language:
- iso: eng
month: '07'
oa_version: None
page: 733 - 737
publication: Nature Physics
publication_status: published
publisher: Nature Publishing Group
publist_id: '7934'
quality_controlled: '1'
status: public
title: Direct observation of particle interactions and clustering in charged granular
streams
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
_id: '121'
abstract:
- lang: eng
text: We show that the simplest building blocks of origami-based materials - rigid,
degree-four vertices - are generically multistable. The existence of two distinct
branches of folding motion emerging from the flat state suggests at least bistability,
but we show how nonlinearities in the folding motions allow generic vertex geometries
to have as many as five stable states. In special geometries with collinear folds
and symmetry, more branches emerge leading to as many as six stable states. Tuning
the fold energy parameters, we show how monostability is also possible. Finally,
we show how to program the stability features of a single vertex into a periodic
fold tessellation. The resulting metasheets provide a previously unanticipated
functionality - tunable and switchable shape and size via multistability.
acknowledgement: B. G. C. acknowledges support from FOM, and S. W. and M. v. H. acknowledge
support from NWO.
article_number: '055503'
author:
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: Rémi
full_name: Menaut, Rémi
last_name: Menaut
- first_name: Bryan
full_name: Chen, Bryan
last_name: Chen
- first_name: Martin
full_name: Van Hecke, Martin
last_name: Van Hecke
citation:
ama: 'Waitukaitis SR, Menaut R, Chen B, Van Hecke M. Origami multistability: From
single vertices to metasheets. APS Physics, Physical Review Letters. 2015;114(5).
doi:10.1103/PhysRevLett.114.055503'
apa: 'Waitukaitis, S. R., Menaut, R., Chen, B., & Van Hecke, M. (2015). Origami
multistability: From single vertices to metasheets. APS Physics, Physical Review
Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.114.055503'
chicago: 'Waitukaitis, Scott R, Rémi Menaut, Bryan Chen, and Martin Van Hecke. “Origami
Multistability: From Single Vertices to Metasheets.” APS Physics, Physical
Review Letters. American Physical Society, 2015. https://doi.org/10.1103/PhysRevLett.114.055503.'
ieee: 'S. R. Waitukaitis, R. Menaut, B. Chen, and M. Van Hecke, “Origami multistability:
From single vertices to metasheets,” APS Physics, Physical Review Letters,
vol. 114, no. 5. American Physical Society, 2015.'
ista: 'Waitukaitis SR, Menaut R, Chen B, Van Hecke M. 2015. Origami multistability:
From single vertices to metasheets. APS Physics, Physical Review Letters. 114(5),
055503.'
mla: 'Waitukaitis, Scott R., et al. “Origami Multistability: From Single Vertices
to Metasheets.” APS Physics, Physical Review Letters, vol. 114, no. 5,
055503, American Physical Society, 2015, doi:10.1103/PhysRevLett.114.055503.'
short: S.R. Waitukaitis, R. Menaut, B. Chen, M. Van Hecke, APS Physics, Physical
Review Letters 114 (2015).
date_created: 2018-12-11T11:44:44Z
date_published: 2015-02-04T00:00:00Z
date_updated: 2021-01-12T06:49:07Z
day: '04'
doi: 10.1103/PhysRevLett.114.055503
extern: '1'
external_id:
arxiv:
- '1408.1607'
intvolume: ' 114'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1408.1607
month: '02'
oa: 1
oa_version: Preprint
publication: APS Physics, Physical Review Letters
publication_status: published
publisher: American Physical Society
publist_id: '7933'
quality_controlled: '1'
status: public
title: 'Origami multistability: From single vertices to metasheets'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 114
year: '2015'
...
---
_id: '1311'
abstract:
- lang: eng
text: In this paper, we develop an energy method to study finite speed of propagation
and waiting time phenomena for the stochastic porous media equation with linear
multiplicative noise in up to three spatial dimensions. Based on a novel iteration
technique and on stochastic counterparts of weighted integral estimates used in
the deterministic setting, we formulate a sufficient criterion on the growth of
initial data which locally guarantees a waiting time phenomenon to occur almost
surely. Up to a logarithmic factor, this criterion coincides with the optimal
criterion known from the deterministic setting. Our technique can be modified
to prove finite speed of propagation as well.
acknowledgement: The first author has been supported by the Lithuanian-Swiss co- operation
program under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
- first_name: Günther
full_name: Grün, Günther
last_name: Grün
citation:
ama: 'Fischer JL, Grün G. Finite speed of propagation and waiting times for the
stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical
Analysis. 2015;47(1):825-854. doi:10.1137/140960578'
apa: 'Fischer, J. L., & Grün, G. (2015). Finite speed of propagation and waiting
times for the stochastic porous medium equation: A unifying approach. SIAM
Journal on Mathematical Analysis. Society for Industrial and Applied Mathematics
. https://doi.org/10.1137/140960578'
chicago: 'Fischer, Julian L, and Günther Grün. “Finite Speed of Propagation and
Waiting Times for the Stochastic Porous Medium Equation: A Unifying Approach.”
SIAM Journal on Mathematical Analysis. Society for Industrial and Applied
Mathematics , 2015. https://doi.org/10.1137/140960578.'
ieee: 'J. L. Fischer and G. Grün, “Finite speed of propagation and waiting times
for the stochastic porous medium equation: A unifying approach,” SIAM Journal
on Mathematical Analysis, vol. 47, no. 1. Society for Industrial and Applied
Mathematics , pp. 825–854, 2015.'
ista: 'Fischer JL, Grün G. 2015. Finite speed of propagation and waiting times for
the stochastic porous medium equation: A unifying approach. SIAM Journal on Mathematical
Analysis. 47(1), 825–854.'
mla: 'Fischer, Julian L., and Günther Grün. “Finite Speed of Propagation and Waiting
Times for the Stochastic Porous Medium Equation: A Unifying Approach.” SIAM
Journal on Mathematical Analysis, vol. 47, no. 1, Society for Industrial and
Applied Mathematics , 2015, pp. 825–54, doi:10.1137/140960578.'
short: J.L. Fischer, G. Grün, SIAM Journal on Mathematical Analysis 47 (2015) 825–854.
date_created: 2018-12-11T11:51:18Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:48Z
day: '01'
doi: 10.1137/140960578
extern: 1
intvolume: ' 47'
issue: '1'
month: '01'
page: 825 - 854
publication: SIAM Journal on Mathematical Analysis
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '5958'
quality_controlled: 0
status: public
title: 'Finite speed of propagation and waiting times for the stochastic porous medium
equation: A unifying approach'
type: journal_article
volume: 47
year: '2015'
...
---
_id: '1314'
abstract:
- lang: eng
text: 'We derive a posteriori estimates for the modeling error caused by the assumption
of perfect incompressibility in the incompressible Navier-Stokes equation: Real
fluids are never perfectly incompressible but always feature at least some low
amount of compressibility. Thus, their behavior is described by the compressible
Navier-Stokes equation, the pressure being a steep function of the density. We
rigorously estimate the difference between an approximate solution to the incompressible
Navier-Stokes equation and any weak solution to the compressible Navier-Stokes
equation in the sense of Lions (without assuming any additional regularity of
solutions). Heuristics and numerical results suggest that our error estimates
are of optimal order in the case of "well-behaved" flows and divergence-free
approximations of the velocity field. Thus, we expect our estimates to justify
the idealization of fluids as perfectly incompressible also in practical situations.'
acknowledgement: The research of the author was supported by the Lithuanian-Swiss
cooperation program under the project agreement CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Fischer, Julian L
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: Fischer JL. A posteriori modeling error estimates for the assumption of perfect
incompressibility in the Navier-Stokes equation. SIAM Journal on Numerical
Analysis. 2015;53(5):2178-2205. doi:10.1137/140966654
apa: Fischer, J. L. (2015). A posteriori modeling error estimates for the assumption
of perfect incompressibility in the Navier-Stokes equation. SIAM Journal on
Numerical Analysis. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/140966654
chicago: Fischer, Julian L. “A Posteriori Modeling Error Estimates for the Assumption
of Perfect Incompressibility in the Navier-Stokes Equation.” SIAM Journal on
Numerical Analysis. Society for Industrial and Applied Mathematics , 2015.
https://doi.org/10.1137/140966654.
ieee: J. L. Fischer, “A posteriori modeling error estimates for the assumption of
perfect incompressibility in the Navier-Stokes equation,” SIAM Journal on Numerical
Analysis, vol. 53, no. 5. Society for Industrial and Applied Mathematics ,
pp. 2178–2205, 2015.
ista: Fischer JL. 2015. A posteriori modeling error estimates for the assumption
of perfect incompressibility in the Navier-Stokes equation. SIAM Journal on Numerical
Analysis. 53(5), 2178–2205.
mla: Fischer, Julian L. “A Posteriori Modeling Error Estimates for the Assumption
of Perfect Incompressibility in the Navier-Stokes Equation.” SIAM Journal on
Numerical Analysis, vol. 53, no. 5, Society for Industrial and Applied Mathematics
, 2015, pp. 2178–205, doi:10.1137/140966654.
short: J.L. Fischer, SIAM Journal on Numerical Analysis 53 (2015) 2178–2205.
date_created: 2018-12-11T11:51:19Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:49Z
day: '01'
doi: 10.1137/140966654
extern: '1'
intvolume: ' 53'
issue: '5'
language:
- iso: eng
month: '01'
oa_version: None
page: 2178 - 2205
publication: SIAM Journal on Numerical Analysis
publication_status: published
publisher: 'Society for Industrial and Applied Mathematics '
publist_id: '5957'
quality_controlled: '1'
status: public
title: A posteriori modeling error estimates for the assumption of perfect incompressibility
in the Navier-Stokes equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2015'
...
---
_id: '1313'
abstract:
- lang: eng
text: We present an algorithm for the derivation of lower bounds on support propagation
for a certain class of nonlinear parabolic equations. We proceed by combining
the ideas in some recent papers by the author with the algorithmic construction
of entropies due to Jüngel and Matthes, reducing the problem to a quantifier elimination
problem. Due to its complexity, the quantifier elimination problem cannot be solved
by present exact algorithms. However, by tackling the quantifier elimination problem
numerically, in the case of the thin-film equation we are able to improve recent
results by the author in the regime of strong slippage n ∈ (1, 2). For certain
second-order doubly nonlinear parabolic equations, we are able to extend the known
lower bounds on free boundary propagation to the case of irregular oscillatory
initial data. Finally, we apply our method to a sixth-order quantum drift-diffusion
equation, resulting in an upper bound on the time which it takes for the support
to reach every point in the domain.
acknowledgement: This research was supported by the Lithuanian-Swiss cooperation program
under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: 'Fischer JL. Estimates on front propagation for nonlinear higher-order parabolic
equations: An algorithmic approach. Interfaces and Free Boundaries. 2015;17(1):1-20.
doi:10.4171/IFB/331'
apa: 'Fischer, J. L. (2015). Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach. Interfaces and Free Boundaries.
European Mathematical Society Publishing House. https://doi.org/10.4171/IFB/331'
chicago: 'Fischer, Julian L. “Estimates on Front Propagation for Nonlinear Higher-Order
Parabolic Equations: An Algorithmic Approach.” Interfaces and Free Boundaries.
European Mathematical Society Publishing House, 2015. https://doi.org/10.4171/IFB/331.'
ieee: 'J. L. Fischer, “Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach,” Interfaces and Free Boundaries,
vol. 17, no. 1. European Mathematical Society Publishing House, pp. 1–20, 2015.'
ista: 'Fischer JL. 2015. Estimates on front propagation for nonlinear higher-order
parabolic equations: An algorithmic approach. Interfaces and Free Boundaries.
17(1), 1–20.'
mla: 'Fischer, Julian L. “Estimates on Front Propagation for Nonlinear Higher-Order
Parabolic Equations: An Algorithmic Approach.” Interfaces and Free Boundaries,
vol. 17, no. 1, European Mathematical Society Publishing House, 2015, pp. 1–20,
doi:10.4171/IFB/331.'
short: J.L. Fischer, Interfaces and Free Boundaries 17 (2015) 1–20.
date_created: 2018-12-11T11:51:19Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:49:48Z
day: '01'
doi: 10.4171/IFB/331
extern: 1
intvolume: ' 17'
issue: '1'
month: '01'
page: 1 - 20
publication: Interfaces and Free Boundaries
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '5956'
quality_controlled: 0
status: public
title: 'Estimates on front propagation for nonlinear higher-order parabolic equations:
An algorithmic approach'
type: journal_article
volume: 17
year: '2015'
...
---
_id: '1316'
abstract:
- lang: eng
text: In the present work we introduce the notion of a renormalized solution for
reaction–diffusion systems with entropy-dissipating reactions. We establish the
global existence of renormalized solutions. In the case of integrable reaction
terms our notion of a renormalized solution reduces to the usual notion of a weak
solution. Our existence result in particular covers all reaction–diffusion systems
involving a single reversible reaction with mass-action kinetics and (possibly
species-dependent) Fick-law diffusion; more generally, it covers the case of systems
of reversible reactions with mass-action kinetics which satisfy the detailed balance
condition. For such equations the existence of any kind of solution in general
was an open problem, thereby motivating the study of renormalized solutions.
acknowledgement: This research was supported by the Lithuanian-Swiss cooperation program
under the project agreement No. CH-SMM-01/0.
author:
- first_name: Julian L
full_name: Julian Fischer
id: 2C12A0B0-F248-11E8-B48F-1D18A9856A87
last_name: Fischer
orcid: 0000-0002-0479-558X
citation:
ama: Fischer JL. Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis.
2015;218(1):553-587. doi:10.1007/s00205-015-0866-x
apa: Fischer, J. L. (2015). Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis.
Springer. https://doi.org/10.1007/s00205-015-0866-x
chicago: Fischer, Julian L. “Global Existence of Renormalized Solutions to Entropy-Dissipating
Reaction–Diffusion Systems.” Archive for Rational Mechanics and Analysis.
Springer, 2015. https://doi.org/10.1007/s00205-015-0866-x.
ieee: J. L. Fischer, “Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems,” Archive for Rational Mechanics and Analysis,
vol. 218, no. 1. Springer, pp. 553–587, 2015.
ista: Fischer JL. 2015. Global existence of renormalized solutions to entropy-dissipating
reaction–diffusion systems. Archive for Rational Mechanics and Analysis. 218(1),
553–587.
mla: Fischer, Julian L. “Global Existence of Renormalized Solutions to Entropy-Dissipating
Reaction–Diffusion Systems.” Archive for Rational Mechanics and Analysis,
vol. 218, no. 1, Springer, 2015, pp. 553–87, doi:10.1007/s00205-015-0866-x.
short: J.L. Fischer, Archive for Rational Mechanics and Analysis 218 (2015) 553–587.
date_created: 2018-12-11T11:51:20Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:49:50Z
day: '01'
doi: 10.1007/s00205-015-0866-x
extern: 1
intvolume: ' 218'
issue: '1'
month: '10'
page: 553 - 587
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '5955'
quality_controlled: 0
status: public
title: Global existence of renormalized solutions to entropy-dissipating reaction–diffusion
systems
type: journal_article
volume: 218
year: '2015'
...
---
_id: '1383'
abstract:
- lang: eng
text: In plants, vacuolar H+-ATPase (V-ATPase) activity acidifies both the trans-Golgi
network/early endosome (TGN/EE) and the vacuole. This dual V-ATPase function has
impeded our understanding of how the pH homeostasis within the plant TGN/EE controls
exo- and endocytosis. Here, we show that the weak V-ATPase mutant deetiolated3
(det3) displayed a pH increase in the TGN/EE, but not in the vacuole, strongly
impairing secretion and recycling of the brassinosteroid receptor and the cellulose
synthase complexes to the plasma membrane, in contrast to mutants lacking tonoplast-localized
V-ATPase activity only. The brassinosteroid insensitivity and the cellulose deficiency
defects in det3 were tightly correlated with reduced Golgi and TGN/EE motility.
Thus, our results provide strong evidence that acidification of the TGN/EE, but
not of the vacuole, is indispensable for functional secretion and recycling in
plants.
article_number: '15094'
article_processing_charge: No
article_type: original
author:
- first_name: Luo
full_name: Yu, Luo
last_name: Yu
- first_name: Stefan
full_name: Scholl, Stefan
last_name: Scholl
- first_name: Anett
full_name: Doering, Anett
last_name: Doering
- first_name: Zhang
full_name: Yi, Zhang
last_name: Yi
- first_name: Niloufer
full_name: Irani, Niloufer
last_name: Irani
- first_name: Simone
full_name: Di Rubbo, Simone
last_name: Di Rubbo
- first_name: Lutz
full_name: Neumetzler, Lutz
last_name: Neumetzler
- first_name: Praveen
full_name: Krishnamoorthy, Praveen
last_name: Krishnamoorthy
- first_name: Isabelle
full_name: Van Houtte, Isabelle
last_name: Van Houtte
- first_name: Evelien
full_name: Mylle, Evelien
last_name: Mylle
- first_name: Volker
full_name: Bischoff, Volker
last_name: Bischoff
- first_name: Samantha
full_name: Vernhettes, Samantha
last_name: Vernhettes
- first_name: Johan
full_name: Winne, Johan
last_name: Winne
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: York
full_name: Stierhof, York
last_name: Stierhof
- first_name: Karin
full_name: Schumacher, Karin
last_name: Schumacher
- first_name: Staffan
full_name: Persson, Staffan
last_name: Persson
- first_name: Eugenia
full_name: Russinova, Eugenia
last_name: Russinova
citation:
ama: Yu L, Scholl S, Doering A, et al. V-ATPase activity in the TGN/EE is required
for exocytosis and recycling in Arabidopsis. Nature Plants. 2015;1(7).
doi:10.1038/nplants.2015.94
apa: Yu, L., Scholl, S., Doering, A., Yi, Z., Irani, N., Di Rubbo, S., … Russinova,
E. (2015). V-ATPase activity in the TGN/EE is required for exocytosis and recycling
in Arabidopsis. Nature Plants. Nature Publishing Group. https://doi.org/10.1038/nplants.2015.94
chicago: Yu, Luo, Stefan Scholl, Anett Doering, Zhang Yi, Niloufer Irani, Simone
Di Rubbo, Lutz Neumetzler, et al. “V-ATPase Activity in the TGN/EE Is Required
for Exocytosis and Recycling in Arabidopsis.” Nature Plants. Nature Publishing
Group, 2015. https://doi.org/10.1038/nplants.2015.94.
ieee: L. Yu et al., “V-ATPase activity in the TGN/EE is required for exocytosis
and recycling in Arabidopsis,” Nature Plants, vol. 1, no. 7. Nature Publishing
Group, 2015.
ista: Yu L, Scholl S, Doering A, Yi Z, Irani N, Di Rubbo S, Neumetzler L, Krishnamoorthy
P, Van Houtte I, Mylle E, Bischoff V, Vernhettes S, Winne J, Friml J, Stierhof
Y, Schumacher K, Persson S, Russinova E. 2015. V-ATPase activity in the TGN/EE
is required for exocytosis and recycling in Arabidopsis. Nature Plants. 1(7),
15094.
mla: Yu, Luo, et al. “V-ATPase Activity in the TGN/EE Is Required for Exocytosis
and Recycling in Arabidopsis.” Nature Plants, vol. 1, no. 7, 15094, Nature
Publishing Group, 2015, doi:10.1038/nplants.2015.94.
short: L. Yu, S. Scholl, A. Doering, Z. Yi, N. Irani, S. Di Rubbo, L. Neumetzler,
P. Krishnamoorthy, I. Van Houtte, E. Mylle, V. Bischoff, S. Vernhettes, J. Winne,
J. Friml, Y. Stierhof, K. Schumacher, S. Persson, E. Russinova, Nature Plants
1 (2015).
date_created: 2018-12-11T11:51:42Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2021-01-12T06:50:18Z
day: '06'
department:
- _id: JiFr
doi: 10.1038/nplants.2015.94
external_id:
pmid:
- '27250258'
intvolume: ' 1'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4905525/
month: '07'
oa: 1
oa_version: Submitted Version
pmid: 1
publication: Nature Plants
publication_status: published
publisher: Nature Publishing Group
publist_id: '5827'
quality_controlled: '1'
scopus_import: 1
status: public
title: V-ATPase activity in the TGN/EE is required for exocytosis and recycling in
Arabidopsis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2015'
...
---
_id: '1425'
abstract:
- lang: eng
text: 'In this work we aim at extending the theoretical foundations of lifelong
learning. Previous work analyzing this scenario is based on the assumption that
learning tasks are sampled i.i.d. from a task environment or limited to strongly
constrained data distributions. Instead, we study two scenarios when lifelong
learning is possible, even though the observed tasks do not form an i.i.d. sample:
first, when they are sampled from the same environment, but possibly with dependencies,
and second, when the task environment is allowed to change over time in a consistent
way. In the first case we prove a PAC-Bayesian theorem that can be seen as a direct
generalization of the analogous previous result for the i.i.d. case. For the second
scenario we propose to learn an inductive bias in form of a transfer procedure.
We present a generalization bound and show on a toy example how it can be used
to identify a beneficial transfer algorithm.'
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- 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, Lampert C. Lifelong learning with non-i.i.d. tasks. In: Vol 2015.
Neural Information Processing Systems; 2015:1540-1548.'
apa: 'Pentina, A., & Lampert, C. (2015). Lifelong learning with non-i.i.d. tasks
(Vol. 2015, pp. 1540–1548). Presented at the NIPS: Neural Information Processing
Systems, Montreal, Canada: Neural Information Processing Systems.'
chicago: Pentina, Anastasia, and Christoph Lampert. “Lifelong Learning with Non-i.i.d.
Tasks,” 2015:1540–48. Neural Information Processing Systems, 2015.
ieee: 'A. Pentina and C. Lampert, “Lifelong learning with non-i.i.d. tasks,” presented
at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2015, vol.
2015, pp. 1540–1548.'
ista: 'Pentina A, Lampert C. 2015. Lifelong learning with non-i.i.d. tasks. NIPS:
Neural Information Processing Systems, Advances in Neural Information Processing
Systems, vol. 2015, 1540–1548.'
mla: Pentina, Anastasia, and Christoph Lampert. Lifelong Learning with Non-i.i.d.
Tasks. Vol. 2015, Neural Information Processing Systems, 2015, pp. 1540–48.
short: A. Pentina, C. Lampert, in:, Neural Information Processing Systems, 2015,
pp. 1540–1548.
conference:
end_date: 2015-12-12
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2015-12-07
date_created: 2018-12-11T11:51:57Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:39Z
day: '01'
department:
- _id: ChLa
ec_funded: 1
intvolume: ' 2015'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://papers.nips.cc/paper/6007-lifelong-learning-with-non-iid-tasks
month: '01'
oa: 1
oa_version: None
page: 1540 - 1548
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5781'
quality_controlled: '1'
scopus_import: 1
status: public
title: Lifelong learning with non-i.i.d. tasks
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '1424'
abstract:
- lang: eng
text: We consider the problem of statistical computations with persistence diagrams,
a summary representation of topological features in data. These diagrams encode
persistent homology, a widely used invariant in topological data analysis. While
several avenues towards a statistical treatment of the diagrams have been explored
recently, we follow an alternative route that is motivated by the success of methods
based on the embedding of probability measures into reproducing kernel Hilbert
spaces. In fact, a positive definite kernel on persistence diagrams has recently
been proposed, connecting persistent homology to popular kernel-based learning
techniques such as support vector machines. However, important properties of that
kernel enabling a principled use in the context of probability measure embeddings
remain to be explored. Our contribution is to close this gap by proving universality
of a variant of the original kernel, and to demonstrate its effective use in twosample
hypothesis testing on synthetic as well as real-world data.
acknowledgement: This work was partially supported by the Austrian Science FUnd, project
no. KLI 00012.
alternative_title:
- Advances in Neural Information Processing Systems
author:
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Marc
full_name: Niethammer, Marc
last_name: Niethammer
- first_name: Weili
full_name: Lin, Weili
last_name: Lin
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
citation:
ama: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. Statistical topological data
analysis-A kernel perspective. In: Vol 28. Neural Information Processing Systems;
2015:3070-3078.'
apa: 'Kwitt, R., Huber, S., Niethammer, M., Lin, W., & Bauer, U. (2015). Statistical
topological data analysis-A kernel perspective (Vol. 28, pp. 3070–3078). Presented
at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information
Processing Systems.'
chicago: Kwitt, Roland, Stefan Huber, Marc Niethammer, Weili Lin, and Ulrich Bauer.
“Statistical Topological Data Analysis-A Kernel Perspective,” 28:3070–78. Neural
Information Processing Systems, 2015.
ieee: 'R. Kwitt, S. Huber, M. Niethammer, W. Lin, and U. Bauer, “Statistical topological
data analysis-A kernel perspective,” presented at the NIPS: Neural Information
Processing Systems, Montreal, Canada, 2015, vol. 28, pp. 3070–3078.'
ista: 'Kwitt R, Huber S, Niethammer M, Lin W, Bauer U. 2015. Statistical topological
data analysis-A kernel perspective. NIPS: Neural Information Processing Systems,
Advances in Neural Information Processing Systems, vol. 28, 3070–3078.'
mla: Kwitt, Roland, et al. Statistical Topological Data Analysis-A Kernel Perspective.
Vol. 28, Neural Information Processing Systems, 2015, pp. 3070–78.
short: R. Kwitt, S. Huber, M. Niethammer, W. Lin, U. Bauer, in:, Neural Information
Processing Systems, 2015, pp. 3070–3078.
conference:
end_date: 2015-12-12
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2015-12-07
date_created: 2018-12-11T11:51:56Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:50:38Z
day: '01'
department:
- _id: HeEd
intvolume: ' 28'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/5887-statistical-topological-data-analysis-a-kernel-perspective
month: '12'
oa: 1
oa_version: Submitted Version
page: 3070 - 3078
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5782'
quality_controlled: '1'
status: public
title: Statistical topological data analysis-A kernel perspective
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 28
year: '2015'
...
---
_id: '1430'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) form a popular optimisation paradigm inspired
by natural evolution. In recent years the field of evolutionary computation has
developed a rigorous analytical theory to analyse their runtime on many illustrative
problems. Here we apply this theory to a simple model of natural evolution. In
the Strong Selection Weak Mutation (SSWM) evolutionary regime the time between
occurrence of new mutations is much longer than the time it takes for a new beneficial
mutation to take over the population. In this situation, the population only contains
copies of one genotype and evolution can be modelled as a (1+1)-type process where
the probability of accepting a new genotype (improvements or worsenings) depends
on the change in fitness. We present an initial runtime analysis of SSWM, quantifying
its performance for various parameters and investigating differences to the (1+1)
EA. We show that SSWM can have a moderate advantage over the (1+1) EA at crossing
fitness valleys and study an example where SSWM outperforms the (1+1) EA by taking
advantage of information on the fitness gradient.
author:
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
- first_name: Jorge
full_name: Heredia, Jorge
last_name: Heredia
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
citation:
ama: 'Paixao T, Sudholt D, Heredia J, Trubenova B. First steps towards a runtime
comparison of natural and artificial evolution. In: Proceedings of the 2015
Annual Conference on Genetic and Evolutionary Computation. ACM; 2015:1455-1462.
doi:10.1145/2739480.2754758'
apa: 'Paixao, T., Sudholt, D., Heredia, J., & Trubenova, B. (2015). First steps
towards a runtime comparison of natural and artificial evolution. In Proceedings
of the 2015 Annual Conference on Genetic and Evolutionary Computation (pp.
1455–1462). Madrid, Spain: ACM. https://doi.org/10.1145/2739480.2754758'
chicago: Paixao, Tiago, Dirk Sudholt, Jorge Heredia, and Barbora Trubenova. “First
Steps towards a Runtime Comparison of Natural and Artificial Evolution.” In Proceedings
of the 2015 Annual Conference on Genetic and Evolutionary Computation, 1455–62.
ACM, 2015. https://doi.org/10.1145/2739480.2754758.
ieee: T. Paixao, D. Sudholt, J. Heredia, and B. Trubenova, “First steps towards
a runtime comparison of natural and artificial evolution,” in Proceedings of
the 2015 Annual Conference on Genetic and Evolutionary Computation, Madrid,
Spain, 2015, pp. 1455–1462.
ista: 'Paixao T, Sudholt D, Heredia J, Trubenova B. 2015. First steps towards a
runtime comparison of natural and artificial evolution. Proceedings of the 2015
Annual Conference on Genetic and Evolutionary Computation. GECCO: Genetic and
evolutionary computation conference, 1455–1462.'
mla: Paixao, Tiago, et al. “First Steps towards a Runtime Comparison of Natural
and Artificial Evolution.” Proceedings of the 2015 Annual Conference on Genetic
and Evolutionary Computation, ACM, 2015, pp. 1455–62, doi:10.1145/2739480.2754758.
short: T. Paixao, D. Sudholt, J. Heredia, B. Trubenova, in:, Proceedings of the
2015 Annual Conference on Genetic and Evolutionary Computation, ACM, 2015, pp.
1455–1462.
conference:
end_date: 2015-07-15
location: Madrid, Spain
name: 'GECCO: Genetic and evolutionary computation conference'
start_date: 2015-07-11
date_created: 2018-12-11T11:51:58Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2021-01-12T06:50:41Z
day: '11'
department:
- _id: NiBa
- _id: CaGu
doi: 10.1145/2739480.2754758
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1504.06260
month: '07'
oa: 1
oa_version: Preprint
page: 1455 - 1462
project:
- _id: 25B1EC9E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618091'
name: Speed of Adaptation in Population Genetics and Evolutionary Computation
publication: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary
Computation
publication_status: published
publisher: ACM
publist_id: '5768'
quality_controlled: '1'
scopus_import: 1
status: public
title: First steps towards a runtime comparison of natural and artificial evolution
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1474'
abstract:
- lang: eng
text: Cryptographic access control offers selective access to encrypted data via
a combination of key management and functionality-rich cryptographic schemes,
such as attribute-based encryption. Using this approach, publicly available meta-data
may inadvertently leak information on the access policy that is enforced by cryptography,
which renders cryptographic access control unusable in settings where this information
is highly sensitive. We begin to address this problem by presenting rigorous definitions
for policy privacy in cryptographic access control. For concreteness we set our
results in the model of Role-Based Access Control (RBAC), where we identify and
formalize several different flavors of privacy, however, our framework should
serve as inspiration for other models of access control. Based on our insights
we propose a new system which significantly improves on the privacy properties
of state-of-the-art constructions. Our design is based on a novel type of privacy-preserving
attribute-based encryption, which we introduce and show how to instantiate. We
present our results in the context of a cryptographic RBAC system by Ferrara et
al. (CSF'13), which uses cryptography to control read access to files, while write
access is still delegated to trusted monitors. We give an extension of the construction
that permits cryptographic control over write access. Our construction assumes
that key management uses out-of-band channels between the policy enforcer and
the users but eliminates completely the need for monitoring read/write access
to the data.
article_processing_charge: No
author:
- first_name: Anna
full_name: Ferrara, Anna
last_name: Ferrara
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Bin
full_name: Liu, Bin
last_name: Liu
- first_name: Bogdan
full_name: Warinschi, Bogdan
last_name: Warinschi
citation:
ama: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. Policy privacy in cryptographic
access control. In: IEEE; 2015:46-60. doi:10.1109/CSF.2015.11'
apa: 'Ferrara, A., Fuchsbauer, G., Liu, B., & Warinschi, B. (2015). Policy privacy
in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security
Foundations, Verona, Italy: IEEE. https://doi.org/10.1109/CSF.2015.11'
chicago: Ferrara, Anna, Georg Fuchsbauer, Bin Liu, and Bogdan Warinschi. “Policy
Privacy in Cryptographic Access Control,” 46–60. IEEE, 2015. https://doi.org/10.1109/CSF.2015.11.
ieee: 'A. Ferrara, G. Fuchsbauer, B. Liu, and B. Warinschi, “Policy privacy in cryptographic
access control,” presented at the CSF: Computer Security Foundations, Verona,
Italy, 2015, pp. 46–60.'
ista: 'Ferrara A, Fuchsbauer G, Liu B, Warinschi B. 2015. Policy privacy in cryptographic
access control. CSF: Computer Security Foundations, 46–60.'
mla: Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control.
IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.
short: A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.
conference:
end_date: 2015-07-17
location: Verona, Italy
name: 'CSF: Computer Security Foundations'
start_date: 2015-07-13
date_created: 2018-12-11T11:52:14Z
date_published: 2015-09-04T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '04'
department:
- _id: KrPi
doi: 10.1109/CSF.2015.11
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://epubs.surrey.ac.uk/808055/
month: '09'
oa: 1
oa_version: Submitted Version
page: 46-60
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: IEEE
publist_id: '5722'
quality_controlled: '1'
status: public
title: Policy privacy in cryptographic access control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1473'
abstract:
- lang: eng
text: In this paper we survey geometric and arithmetic techniques to study the cohomology
of semiprojective hyperkähler manifolds including toric hyperkähler varieties,
Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces.
The resulting formulae for their Poincaré polynomials are combinatorial and representation
theoretical in nature. In particular we will look at their Betti numbers and will
establish some results and state some expectations on their asymptotic shape.
author:
- first_name: Tamas
full_name: Tamas Hausel
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
- first_name: Fernando
full_name: Rodríguez Villegas, Fernando
last_name: Rodríguez Villegas
citation:
ama: Hausel T, Rodríguez Villegas F. Cohomology of large semiprojective hyperkähler
varieties. Asterisque. 2015;2015(370):113-156.
apa: Hausel, T., & Rodríguez Villegas, F. (2015). Cohomology of large semiprojective
hyperkähler varieties. Asterisque. Societe Mathematique de France.
chicago: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
Hyperkähler Varieties.” Asterisque. Societe Mathematique de France, 2015.
ieee: T. Hausel and F. Rodríguez Villegas, “Cohomology of large semiprojective hyperkähler
varieties,” Asterisque, vol. 2015, no. 370. Societe Mathematique de France,
pp. 113–156, 2015.
ista: Hausel T, Rodríguez Villegas F. 2015. Cohomology of large semiprojective hyperkähler
varieties. Asterisque. 2015(370), 113–156.
mla: Hausel, Tamás, and Fernando Rodríguez Villegas. “Cohomology of Large Semiprojective
Hyperkähler Varieties.” Asterisque, vol. 2015, no. 370, Societe Mathematique
de France, 2015, pp. 113–56.
short: T. Hausel, F. Rodríguez Villegas, Asterisque 2015 (2015) 113–156.
date_created: 2018-12-11T11:52:13Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:50:59Z
day: '01'
extern: 1
intvolume: ' 2015'
issue: '370'
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.4914
month: '01'
oa: 1
page: 113 - 156
publication: Asterisque
publication_status: published
publisher: Societe Mathematique de France
publist_id: '5723'
quality_controlled: 0
status: public
title: Cohomology of large semiprojective hyperkähler varieties
type: review
volume: 2015
year: '2015'
...
---
_id: '1483'
abstract:
- lang: eng
text: Topological data analysis offers a rich source of valuable information to
study vision problems. Yet, so far we lack a theoretically sound connection to
popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In
this work, we establish such a connection by designing a multi-scale kernel for
persistence diagrams, a stable summary representation of topological features
in data. We show that this kernel is positive definite and prove its stability
with respect to the 1-Wasserstein distance. Experiments on two benchmark datasets
for 3D shape classification/retrieval and texture recognition show considerable
performance gains of the proposed method compared to an alternative approach that
is based on the recently introduced persistence landscapes.
author:
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Roland
full_name: Kwitt, Roland
last_name: Kwitt
citation:
ama: 'Reininghaus J, Huber S, Bauer U, Kwitt R. A stable multi-scale kernel for
topological machine learning. In: IEEE; 2015:4741-4748. doi:10.1109/CVPR.2015.7299106'
apa: 'Reininghaus, J., Huber, S., Bauer, U., & Kwitt, R. (2015). A stable multi-scale
kernel for topological machine learning (pp. 4741–4748). Presented at the CVPR:
Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7299106'
chicago: Reininghaus, Jan, Stefan Huber, Ulrich Bauer, and Roland Kwitt. “A Stable
Multi-Scale Kernel for Topological Machine Learning,” 4741–48. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299106.
ieee: 'J. Reininghaus, S. Huber, U. Bauer, and R. Kwitt, “A stable multi-scale kernel
for topological machine learning,” presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, USA, 2015, pp. 4741–4748.'
ista: 'Reininghaus J, Huber S, Bauer U, Kwitt R. 2015. A stable multi-scale kernel
for topological machine learning. CVPR: Computer Vision and Pattern Recognition,
4741–4748.'
mla: Reininghaus, Jan, et al. A Stable Multi-Scale Kernel for Topological Machine
Learning. IEEE, 2015, pp. 4741–48, doi:10.1109/CVPR.2015.7299106.
short: J. Reininghaus, S. Huber, U. Bauer, R. Kwitt, in:, IEEE, 2015, pp. 4741–4748.
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:52:17Z
date_published: 2015-10-14T00:00:00Z
date_updated: 2021-01-12T06:51:03Z
day: '14'
department:
- _id: HeEd
doi: 10.1109/CVPR.2015.7299106
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.6821
month: '10'
oa: 1
oa_version: Preprint
page: 4741 - 4748
publication_identifier:
eisbn:
- '978-1-4673-6964-0 '
publication_status: published
publisher: IEEE
publist_id: '5709'
scopus_import: 1
status: public
title: A stable multi-scale kernel for topological machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1498'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. Nonetheless there is surprisingly little
language and verification support to build distributed systems based on fault-tolerant
algorithms. In this paper, we present some of the challenges that a designer has
to overcome to implement a fault-tolerant distributed system. Then we review different
models that have been proposed to reason about distributed algorithms and sketch
how such a model can form the basis for a domain-specific programming language.
Adopting a high-level programming model can simplify the programmer's life and
make the code amenable to automated verification, while still compiling to efficiently
executable code. We conclude by summarizing the current status of an ongoing language
design and implementation project that is based on this idea.
alternative_title:
- LIPIcs
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- 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: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant
distributed systems. 2015;32:90-102. doi:10.4230/LIPIcs.SNAPL.2015.90
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2015). The need for language
support for fault-tolerant distributed systems. Presented at the SNAPL: Summit
oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90'
chicago: Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for
Language Support for Fault-Tolerant Distributed Systems.” Leibniz International
Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90.
ieee: C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support
for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, pp. 90–102, 2015.
ista: Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for
fault-tolerant distributed systems. 32, 90–102.
mla: Dragoi, Cezara, et al. The Need for Language Support for Fault-Tolerant
Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.
short: C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.
conference:
end_date: 2015-05-06
location: Asilomar, CA, United States
name: 'SNAPL: Summit oN Advances in Programming Languages'
start_date: 2015-05-03
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-08-11T10:09:14Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.SNAPL.2015.90
ec_funded: 1
file:
- access_level: open_access
checksum: cf5e94baa89a2dc4c5de01abc676eda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:02Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5050'
file_name: IST-2016-499-v1+1_9.pdf
file_size: 489362
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 32'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 90 - 102
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- '978-3-939897-80-4 '
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5681'
pubrep_id: '499'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: The need for language support for fault-tolerant distributed systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2015'
...
---
_id: '1497'
abstract:
- lang: eng
text: Detecting allelic biases from high-throughput sequencing data requires an
approach that maximises sensitivity while minimizing false positives. Here, we
present Allelome.PRO, an automated user-friendly bioinformatics pipeline, which
uses high-throughput sequencing data from reciprocal crosses of two genetically
distinct mouse strains to detect allele-specific expression and chromatin modifications.
Allelome.PRO extends approaches used in previous studies that exclusively analyzed
imprinted expression to give a complete picture of the ‘allelome’ by automatically
categorising the allelic expression of all genes in a given cell type into imprinted,
strain-biased, biallelic or non-informative. Allelome.PRO offers increased sensitivity
to analyze lowly expressed transcripts, together with a robust false discovery
rate empirically calculated from variation in the sequencing data. We used RNA-seq
data from mouse embryonic fibroblasts from F1 reciprocal crosses to determine
a biologically relevant allelic ratio cutoff, and define for the first time an
entire allelome. Furthermore, we show that Allelome.PRO detects differential enrichment
of H3K4me3 over promoters from ChIP-seq data validating the RNA-seq results. This
approach can be easily extended to analyze histone marks of active enhancers,
or transcription factor binding sites and therefore provides a powerful tool to
identify candidate cis regulatory elements genome wide.
acknowledgement: "Austrian Science Fund [FWF P25185-B22, FWF F4302- B09, FWFW1207-B09].
Funding for open access charge: Austrian Science Fund.\r\nWe thank Florian Breitwieser
for advice during the early stages of this project. High-throughput sequencing was
conducted by the Biomedical Sequencing Facility (BSF) at CeMM in Vienna."
article_number: e146
author:
- first_name: Daniel
full_name: Andergassen, Daniel
last_name: Andergassen
- first_name: Christoph
full_name: Dotter, Christoph
id: 4C66542E-F248-11E8-B48F-1D18A9856A87
last_name: Dotter
- first_name: Tomasz
full_name: Kulinski, Tomasz
last_name: Kulinski
- first_name: Philipp
full_name: Guenzl, Philipp
last_name: Guenzl
- first_name: Philipp
full_name: Bammer, Philipp
last_name: Bammer
- first_name: Denise
full_name: Barlow, Denise
last_name: Barlow
- first_name: Florian
full_name: Pauler, Florian
last_name: Pauler
- first_name: Quanah
full_name: Hudson, Quanah
last_name: Hudson
citation:
ama: Andergassen D, Dotter C, Kulinski T, et al. Allelome.PRO, a pipeline to define
allele-specific genomic features from high-throughput sequencing data. Nucleic
Acids Research. 2015;43(21). doi:10.1093/nar/gkv727
apa: Andergassen, D., Dotter, C., Kulinski, T., Guenzl, P., Bammer, P., Barlow,
D., … Hudson, Q. (2015). Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research.
Oxford University Press. https://doi.org/10.1093/nar/gkv727
chicago: Andergassen, Daniel, Christoph Dotter, Tomasz Kulinski, Philipp Guenzl,
Philipp Bammer, Denise Barlow, Florian Pauler, and Quanah Hudson. “Allelome.PRO,
a Pipeline to Define Allele-Specific Genomic Features from High-Throughput Sequencing
Data.” Nucleic Acids Research. Oxford University Press, 2015. https://doi.org/10.1093/nar/gkv727.
ieee: D. Andergassen et al., “Allelome.PRO, a pipeline to define allele-specific
genomic features from high-throughput sequencing data,” Nucleic Acids Research,
vol. 43, no. 21. Oxford University Press, 2015.
ista: Andergassen D, Dotter C, Kulinski T, Guenzl P, Bammer P, Barlow D, Pauler
F, Hudson Q. 2015. Allelome.PRO, a pipeline to define allele-specific genomic
features from high-throughput sequencing data. Nucleic Acids Research. 43(21),
e146.
mla: Andergassen, Daniel, et al. “Allelome.PRO, a Pipeline to Define Allele-Specific
Genomic Features from High-Throughput Sequencing Data.” Nucleic Acids Research,
vol. 43, no. 21, e146, Oxford University Press, 2015, doi:10.1093/nar/gkv727.
short: D. Andergassen, C. Dotter, T. Kulinski, P. Guenzl, P. Bammer, D. Barlow,
F. Pauler, Q. Hudson, Nucleic Acids Research 43 (2015).
date_created: 2018-12-11T11:52:22Z
date_published: 2015-07-21T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '21'
ddc:
- '570'
department:
- _id: GaNo
doi: 10.1093/nar/gkv727
file:
- access_level: open_access
checksum: 385b83854fd0eb2e4f386867da2823e2
content_type: application/pdf
creator: dernst
date_created: 2018-12-20T14:18:57Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5768'
file_name: 2015_NucleicAcidsRes_Andergassen.pdf
file_size: 6863297
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 43'
issue: '21'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '5682'
quality_controlled: '1'
scopus_import: 1
status: public
title: Allelome.PRO, a pipeline to define allele-specific genomic features from high-throughput
sequencing data
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: 43
year: '2015'
...
---
_id: '1499'
abstract:
- lang: eng
text: "We consider weighted automata with both positive and negative integer weights
on edges and\r\nstudy the problem of synchronization using adaptive strategies
that may only observe whether\r\nthe current weight-level is negative or nonnegative.
We show that the synchronization problem is decidable in polynomial time for deterministic
weighted automata."
acknowledgement: "The research leading to these results has received funding from
the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement
601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center
IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM),
the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award), the Czech Science Foundation under grant agreement P202/12/G061, and People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme
(FP7/2007-2013) REA Grant No 291734."
alternative_title:
- LIPIcs
author:
- 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: Simon
full_name: Laursen, Simon
last_name: Laursen
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of
weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142'
apa: 'Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial
time decidability of weighted synchronization under partial observability (Vol.
42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142'
chicago: Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time
Decidability of Weighted Synchronization under Partial Observability,” 42:142–54.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.
ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability
of weighted synchronization under partial observability,” presented at the CONCUR:
Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.'
ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability
of weighted synchronization under partial observability. CONCUR: Concurrency Theory,
LIPIcs, vol. 42, 142–154.'
mla: Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization
under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.
short: J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015, pp. 142–154.
conference:
end_date: 2015-09-04
location: Madrid, Spain
name: 'CONCUR: Concurrency Theory'
start_date: 2015-09-01
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:10Z
day: '01'
ddc:
- '000'
- '003'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2015.142
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:12Z
date_updated: 2020-07-14T12:44:58Z
file_id: '4672'
file_name: IST-2016-498-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 42'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 142 - 154
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
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5680'
pubrep_id: '498'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polynomial time decidability of weighted synchronization under partial observability
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: 42
year: '2015'
...
---
_id: '1495'
abstract:
- lang: eng
text: 'Motivated by biological questions, we study configurations of equal-sized
disks in the Euclidean plane that neither pack nor cover. Measuring the quality
by the probability that a random point lies in exactly one disk, we show that
the regular hexagonal grid gives the maximum among lattice configurations. '
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Mabel
full_name: Iglesias Ham, Mabel
id: 41B58C0C-F248-11E8-B48F-1D18A9856A87
last_name: Iglesias Ham
- first_name: Vitaliy
full_name: Kurlin, Vitaliy
last_name: Kurlin
citation:
ama: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: Proceedings
of the 27th Canadian Conference on Computational Geometry. Vol 2015-August.
Queen’s University; 2015:128-135.'
apa: 'Edelsbrunner, H., Iglesias Ham, M., & Kurlin, V. (2015). Relaxed disk
packing. In Proceedings of the 27th Canadian Conference on Computational Geometry
(Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.'
chicago: Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed
Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational
Geometry, 2015–August:128–35. Queen’s University, 2015.
ieee: H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in
Proceedings of the 27th Canadian Conference on Computational Geometry,
Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.
ista: 'Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings
of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference
on Computational Geometry vol. 2015–August, 128–135.'
mla: Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the
27th Canadian Conference on Computational Geometry, vol. 2015–August, Queen’s
University, 2015, pp. 128–35.
short: H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th
Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.
conference:
end_date: 2015-08-12
location: Ontario, Canada
name: 'CCCG: Canadian Conference on Computational Geometry'
start_date: 2015-08-10
date_created: 2018-12-11T11:52:21Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:09Z
day: '01'
department:
- _id: HeEd
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1505.03402
month: '08'
oa: 1
oa_version: Submitted Version
page: 128-135
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the 27th Canadian Conference on Computational Geometry
publication_status: published
publisher: Queen's University
publist_id: '5684'
quality_controlled: '1'
scopus_import: 1
status: public
title: Relaxed disk packing
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 2015-August
year: '2015'
...
---
_id: '1504'
abstract:
- lang: eng
text: Let Q = (Q1, . . . , Qn) be a random vector drawn from the uniform distribution
on the set of all n! permutations of {1, 2, . . . , n}. Let Z = (Z1, . . . , Zn),
where Zj is the mean zero variance one random variable obtained by centralizing
and normalizing Qj , j = 1, . . . , n. Assume that Xi , i = 1, . . . ,p are i.i.d.
copies of 1/√ p Z and X = Xp,n is the p × n random matrix with Xi as its ith row.
Then Sn = XX is called the p × n Spearman's rank correlation matrix which can
be regarded as a high dimensional extension of the classical nonparametric statistic
Spearman's rank correlation coefficient between two independent random variables.
In this paper, we establish a CLT for the linear spectral statistics of this nonparametric
random matrix model in the scenario of high dimension, namely, p = p(n) and p/n→c
∈ (0,∞) as n→∞.We propose a novel evaluation scheme to estimate the core quantity
in Anderson and Zeitouni's cumulant method in [Ann. Statist. 36 (2008) 2553-2576]
to bypass the so-called joint cumulant summability. In addition, we raise a two-step
comparison approach to obtain the explicit formulae for the mean and covariance
functions in the CLT. Relying on this CLT, we then construct a distribution-free
statistic to test complete independence for components of random vectors. Owing
to the nonparametric property, we can use this test on generally distributed random
variables including the heavy-tailed ones.
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Liang
full_name: Lin, Liang
last_name: Lin
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Lin L, Pan G, Zhou W. Spectral statistics of large dimensional spearman
s rank correlation matrix and its application. Annals of Statistics. 2015;43(6):2588-2623.
doi:10.1214/15-AOS1353
apa: Bao, Z., Lin, L., Pan, G., & Zhou, W. (2015). Spectral statistics of large
dimensional spearman s rank correlation matrix and its application. Annals
of Statistics. Institute of Mathematical Statistics. https://doi.org/10.1214/15-AOS1353
chicago: Bao, Zhigang, Liang Lin, Guangming Pan, and Wang Zhou. “Spectral Statistics
of Large Dimensional Spearman s Rank Correlation Matrix and Its Application.”
Annals of Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/15-AOS1353.
ieee: Z. Bao, L. Lin, G. Pan, and W. Zhou, “Spectral statistics of large dimensional
spearman s rank correlation matrix and its application,” Annals of Statistics,
vol. 43, no. 6. Institute of Mathematical Statistics, pp. 2588–2623, 2015.
ista: Bao Z, Lin L, Pan G, Zhou W. 2015. Spectral statistics of large dimensional
spearman s rank correlation matrix and its application. Annals of Statistics.
43(6), 2588–2623.
mla: Bao, Zhigang, et al. “Spectral Statistics of Large Dimensional Spearman s Rank
Correlation Matrix and Its Application.” Annals of Statistics, vol. 43,
no. 6, Institute of Mathematical Statistics, 2015, pp. 2588–623, doi:10.1214/15-AOS1353.
short: Z. Bao, L. Lin, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 2588–2623.
date_created: 2018-12-11T11:52:24Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
doi: 10.1214/15-AOS1353
extern: '1'
intvolume: ' 43'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1312.5119
month: '12'
oa: 1
oa_version: Published Version
page: 2588 - 2623
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5674'
quality_controlled: '1'
status: public
title: Spectral statistics of large dimensional spearman s rank correlation matrix
and its application
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...