---
_id: '11785'
abstract:
- lang: eng
text: "Recently we presented the first algorithm for maintaining the set of nodes
reachable from a source node in a directed graph that is modified by edge deletions
with \U0001D45C(\U0001D45A\U0001D45B) total update time, where \U0001D45A is the
number of edges and \U0001D45B is the number of nodes in the graph [Henzinger
et al. STOC 2014]. The algorithm is a combination of several different algorithms,
each for a different \U0001D45A vs. \U0001D45B trade-off. For the case of \U0001D45A=Θ(\U0001D45B1.5)
the running time is \U0001D442(\U0001D45B2.47), just barely below \U0001D45A\U0001D45B=Θ(\U0001D45B2.5).
In this paper we simplify the previous algorithm using new algorithmic ideas and
achieve an improved running time of \U0001D442̃ (min(\U0001D45A7/6\U0001D45B2/3,\U0001D45A3/4\U0001D45B5/4+\U0001D45C(1),\U0001D45A2/3\U0001D45B4/3+\U0001D45C(1)+\U0001D45A3/7\U0001D45B12/7+\U0001D45C(1))).
This gives, e.g., \U0001D442(\U0001D45B2.36) for the notorious case \U0001D45A=Θ(\U0001D45B1.5).
We obtain the same upper bounds for the problem of maintaining the strongly connected
components of a directed graph undergoing edge deletions. Our algorithms are correct
with high probabililty against an oblivious adversary."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
citation:
ama: 'Henzinger MH, Krinninger S, Nanongkai D. Improved algorithms for decremental
single-source reachability on directed graphs. In: 42nd International Colloquium
on Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:725-736.
doi:10.1007/978-3-662-47672-7_59'
apa: 'Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2015). Improved algorithms
for decremental single-source reachability on directed graphs. In 42nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_59'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “Improved
Algorithms for Decremental Single-Source Reachability on Directed Graphs.” In
42nd International Colloquium on Automata, Languages and Programming, 9134:725–36.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_59.
ieee: M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for
decremental single-source reachability on directed graphs,” in 42nd International
Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol.
9134, pp. 725–736.
ista: 'Henzinger MH, Krinninger S, Nanongkai D. 2015. Improved algorithms for decremental
single-source reachability on directed graphs. 42nd International Colloquium on
Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 725–736.'
mla: Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source
Reachability on Directed Graphs.” 42nd International Colloquium on Automata,
Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 725–736.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T08:51:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:10:26Z
day: '01'
doi: 10.1007/978-3-662-47672-7_59
extern: '1'
external_id:
arxiv:
- '1612.03856'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.03856
month: '01'
oa: 1
oa_version: Preprint
page: 725 - 736
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved algorithms for decremental single-source reachability on directed
graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11787'
abstract:
- lang: eng
text: "We present faster algorithms for computing the 2-edge and 2-vertex strongly
connected components of a directed graph. While in undirected graphs the 2-edge
and 2-vertex connected components can be found in linear time, in directed graphs
with m edges and n vertices only rather simple O(m n)-time algorithms were known.
We use a hierarchical sparsification technique to obtain algorithms that run in
time \U0001D442(\U0001D45B2). For 2-edge strongly connected components our algorithm
gives the first running time improvement in 20 years. Additionally we present
an \U0001D442(\U0001D45A2/log\U0001D45B)-time algorithm for 2-edge strongly connected
components, and thus improve over the O(m n) running time also when \U0001D45A=\U0001D442(\U0001D45B).
Our approach extends to k-edge and k-vertex strongly connected components for
any constant k with a running time of \U0001D442(\U0001D45B2log\U0001D45B) for
k-edge-connectivity and \U0001D442(\U0001D45B3) for k-vertex-connectivity."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Henzinger MH, Krinninger S, Loitzenbauer V. Finding 2-edge and 2-vertex strongly
connected components in quadratic time. In: 2nd International Colloquium on
Automata, Languages and Programming. Vol 9134. Springer Nature; 2015:713-724.
doi:10.1007/978-3-662-47672-7_58'
apa: 'Henzinger, M. H., Krinninger, S., & Loitzenbauer, V. (2015). Finding 2-edge
and 2-vertex strongly connected components in quadratic time. In 2nd International
Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724).
Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_58'
chicago: Henzinger, Monika H, Sebastian Krinninger, and Veronika Loitzenbauer. “Finding
2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.” In 2nd
International Colloquium on Automata, Languages and Programming, 9134:713–24.
Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47672-7_58.
ieee: M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex
strongly connected components in quadratic time,” in 2nd International Colloquium
on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp.
713–724.
ista: 'Henzinger MH, Krinninger S, Loitzenbauer V. 2015. Finding 2-edge and 2-vertex
strongly connected components in quadratic time. 2nd International Colloquium
on Automata, Languages and Programming. ICALP: International Colloquium on Automata,
Languages, and Programming, LNCS, vol. 9134, 713–724.'
mla: Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected
Components in Quadratic Time.” 2nd International Colloquium on Automata, Languages
and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.
short: M.H. Henzinger, S. Krinninger, V. Loitzenbauer, in:, 2nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 713–724.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:38:34Z
date_published: 2015-07-06T00:00:00Z
date_updated: 2023-02-10T09:21:47Z
day: '06'
doi: 10.1007/978-3-662-47672-7_58
extern: '1'
external_id:
arxiv:
- '1412.6466'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1412.6466
month: '07'
oa: 1
oa_version: Preprint
page: 713 - 724
publication: 2nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finding 2-edge and 2-vertex strongly connected components in quadratic time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11788'
abstract:
- lang: eng
text: "Ad exchanges are becoming an increasingly popular way to sell advertisement
slots on the internet. An ad exchange is basically a spot market for ad impressions.
A publisher who has already signed contracts reserving advertisement impressions
on his pages can choose between assigning a new ad impression for a new page view
to a contracted advertiser or to sell it at an ad exchange. This leads to an online
revenue maximization problem for the publisher. Given a new impression to sell
decide whether (a) to assign it to a contracted advertiser and if so to which
one or (b) to sell it at the ad exchange and if so at which reserve price. We
make no assumptions about the distribution of the advertiser valuations that participate
in the ad exchange and show that there exists a simple primal-dual based online
algorithm, whose lower bound for the revenue converges to \U0001D445\U0001D434\U0001D437\U0001D44B+\U0001D445\U0001D434(1−1/\U0001D452),
where \U0001D445\U0001D434\U0001D437\U0001D44B is the revenue that the optimum
algorithm achieves from the ad exchange and \U0001D445\U0001D434 is the revenue
that the optimum algorithm achieves from the contracted advertisers."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Wolfgang
full_name: Dvořák, Wolfgang
last_name: Dvořák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Dvořák W, Henzinger MH. Online ad assignment with an ad exchange. In: 12th
International Workshop of Approximation and Online Algorithms. Vol 8952. Springer
Nature; 2015:156–167. doi:10.1007/978-3-319-18263-6_14'
apa: 'Dvořák, W., & Henzinger, M. H. (2015). Online ad assignment with an ad
exchange. In 12th International Workshop of Approximation and Online Algorithms
(Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature. https://doi.org/10.1007/978-3-319-18263-6_14'
chicago: Dvořák, Wolfgang, and Monika H Henzinger. “Online Ad Assignment with an
Ad Exchange.” In 12th International Workshop of Approximation and Online Algorithms,
8952:156–167. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-18263-6_14.
ieee: W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,”
in 12th International Workshop of Approximation and Online Algorithms,
Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
ista: 'Dvořák W, Henzinger MH. 2015. Online ad assignment with an ad exchange. 12th
International Workshop of Approximation and Online Algorithms. WAOA: International
Workshop on Approximation and Online Algorithms, LNCS, vol. 8952, 156–167.'
mla: Dvořák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad
Exchange.” 12th International Workshop of Approximation and Online Algorithms,
vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.
short: W. Dvořák, M.H. Henzinger, in:, 12th International Workshop of Approximation
and Online Algorithms, Springer Nature, 2015, pp. 156–167.
conference:
end_date: 2014-09-12
location: Wroclaw, Poland
name: 'WAOA: International Workshop on Approximation and Online Algorithms'
start_date: 2014-09-11
date_created: 2022-08-11T09:43:32Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:26:06Z
day: '01'
doi: 10.1007/978-3-319-18263-6_14
extern: '1'
external_id:
arxiv:
- '1604.05603'
intvolume: ' 8952'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05603
month: '01'
oa: 1
oa_version: Preprint
page: 156–167
publication: 12th International Workshop of Approximation and Online Algorithms
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Online ad assignment with an ad exchange
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8952
year: '2015'
...
---
_id: '11786'
abstract:
- lang: eng
text: "In this paper, we develop a dynamic version of the primal-dual method for
optimization problems, and apply it to obtain the following results. (1) For the
dynamic set-cover problem, we maintain an \U0001D442(\U0001D4532)-approximately
optimal solution in \U0001D442(\U0001D453⋅log(\U0001D45A+\U0001D45B)) amortized
update time, where \U0001D453 is the maximum “frequency” of an element, \U0001D45B
is the number of sets, and \U0001D45A is the maximum number of elements in the
universe at any point in time. (2) For the dynamic \U0001D44F-matching problem,
we maintain an \U0001D442(1)-approximately optimal solution in \U0001D442(log3\U0001D45B)
amortized update time, where \U0001D45B is the number of nodes in the graph."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
citation:
ama: 'Bhattacharya S, Henzinger MH, Italiano GF. Design of dynamic algorithms via
primal-dual method. In: 42nd International Colloquium on Automata, Languages
and Programming. Vol 9134. Springer Nature; 2015:206-218. doi:10.1007/978-3-662-47672-7_17'
apa: 'Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2015). Design of
dynamic algorithms via primal-dual method. In 42nd International Colloquium
on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan:
Springer Nature. https://doi.org/10.1007/978-3-662-47672-7_17'
chicago: Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Design
of Dynamic Algorithms via Primal-Dual Method.” In 42nd International Colloquium
on Automata, Languages and Programming, 9134:206–18. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47672-7_17.
ieee: S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms
via primal-dual method,” in 42nd International Colloquium on Automata, Languages
and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
ista: 'Bhattacharya S, Henzinger MH, Italiano GF. 2015. Design of dynamic algorithms
via primal-dual method. 42nd International Colloquium on Automata, Languages and
Programming. ICALP: International Colloquium on Automata, Languages, and Programming,
LNCS, vol. 9134, 206–218.'
mla: Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”
42nd International Colloquium on Automata, Languages and Programming, vol.
9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.
short: S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 42nd International Colloquium
on Automata, Languages and Programming, Springer Nature, 2015, pp. 206–218.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2015-07-06
date_created: 2022-08-11T09:28:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-10T09:13:31Z
day: '01'
doi: 10.1007/978-3-662-47672-7_17
extern: '1'
external_id:
arxiv:
- '1604.05337'
intvolume: ' 9134'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.05337
month: '01'
oa: 1
oa_version: Preprint
page: 206 - 218
publication: 42nd International Colloquium on Automata, Languages and Programming
publication_identifier:
isbn:
- '9783662476710'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Design of dynamic algorithms via primal-dual method
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9134
year: '2015'
...
---
_id: '11845'
abstract:
- lang: eng
text: "Phylogenetic diversity (PD) is a measure of biodiversity based on the evolutionary
history of species. Here, we discuss several optimization problems related to
the use of PD, and the more general measure split diversity (SD), in conservation
prioritization.\r\nDepending on the conservation goal and the information available
about species, one can construct optimization routines that incorporate various
conservation constraints. We demonstrate how this information can be used to select
sets of species for conservation action. Specifically, we discuss the use of species'
geographic distributions, the choice of candidates under economic pressure, and
the use of predator–prey interactions between the species in a community to define
viability constraints.\r\nDespite such optimization problems falling into the
area of NP hard problems, it is possible to solve them in a reasonable amount
of time using integer programming. We apply integer linear programming to a variety
of models for conservation prioritization that incorporate the SD measure.\r\nWe
exemplarily show the results for two data sets: the Cape region of South Africa
and a Caribbean coral reef community. Finally, we provide user-friendly software
at http://www.cibiv.at/software/pda."
article_processing_charge: No
article_type: original
author:
- first_name: Olga
full_name: Chernomor, Olga
last_name: Chernomor
- first_name: Bui Quang
full_name: Minh, Bui Quang
last_name: Minh
- first_name: Félix
full_name: Forest, Félix
last_name: Forest
- first_name: Steffen
full_name: Klaere, Steffen
last_name: Klaere
- first_name: Travis
full_name: Ingram, Travis
last_name: Ingram
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Arndt
full_name: von Haeseler, Arndt
last_name: von Haeseler
citation:
ama: Chernomor O, Minh BQ, Forest F, et al. Split diversity in constrained conservation
prioritization using integer linear programming. Methods in Ecology and Evolution.
2015;6(1):83-91. doi:10.1111/2041-210x.12299
apa: Chernomor, O., Minh, B. Q., Forest, F., Klaere, S., Ingram, T., Henzinger,
M. H., & von Haeseler, A. (2015). Split diversity in constrained conservation
prioritization using integer linear programming. Methods in Ecology and Evolution.
Wiley. https://doi.org/10.1111/2041-210x.12299
chicago: Chernomor, Olga, Bui Quang Minh, Félix Forest, Steffen Klaere, Travis Ingram,
Monika H Henzinger, and Arndt von Haeseler. “Split Diversity in Constrained Conservation
Prioritization Using Integer Linear Programming.” Methods in Ecology and Evolution.
Wiley, 2015. https://doi.org/10.1111/2041-210x.12299.
ieee: O. Chernomor et al., “Split diversity in constrained conservation prioritization
using integer linear programming,” Methods in Ecology and Evolution, vol.
6, no. 1. Wiley, pp. 83–91, 2015.
ista: Chernomor O, Minh BQ, Forest F, Klaere S, Ingram T, Henzinger MH, von Haeseler
A. 2015. Split diversity in constrained conservation prioritization using integer
linear programming. Methods in Ecology and Evolution. 6(1), 83–91.
mla: Chernomor, Olga, et al. “Split Diversity in Constrained Conservation Prioritization
Using Integer Linear Programming.” Methods in Ecology and Evolution, vol.
6, no. 1, Wiley, 2015, pp. 83–91, doi:10.1111/2041-210x.12299.
short: O. Chernomor, B.Q. Minh, F. Forest, S. Klaere, T. Ingram, M.H. Henzinger,
A. von Haeseler, Methods in Ecology and Evolution 6 (2015) 83–91.
date_created: 2022-08-16T06:43:49Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-17T09:30:08Z
day: '01'
ddc:
- '570'
doi: 10.1111/2041-210x.12299
extern: '1'
external_id:
pmid:
- '25893087'
file:
- access_level: open_access
checksum: 880e78f09f0ac99cb351c48dc97623b6
content_type: application/pdf
creator: asandaue
date_created: 2022-08-16T06:52:53Z
date_updated: 2022-08-16T06:52:53Z
file_id: '11846'
file_name: 2015_MethodsInEcologyAndEvolutionChernomor.pdf
file_size: 411415
relation: main_file
success: 1
file_date_updated: 2022-08-16T06:52:53Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 83-91
pmid: 1
publication: Methods in Ecology and Evolution
publication_identifier:
eissn:
- 2041-210X
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Split diversity in constrained conservation prioritization using integer linear
programming
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: '11868'
abstract:
- lang: eng
text: "Consider the following Online Boolean Matrix-Vector Multiplication problem:
We are given an n x n matrix M and will receive n column-vectors of size n, denoted
by v1, ..., vn, one by one. After seeing each vector vi, we have to output the
product Mvi before we can see the next vector. A naive algorithm can solve this
problem using O(n3) time in total, and its running time can be slightly improved
to O(n3/log2 n) [Williams SODA'07]. We show that a conjecture that there is no
truly subcubic (O(n3-ε)) time algorithm for this problem can be used to exhibit
the underlying polynomial time hardness shared by many dynamic problems. For a
number of problems, such as subgraph connectivity, Pagh's problem, d-failure connectivity,
decremental single-source shortest paths, and decremental transitive closure,
this conjecture implies tight hardness results. Thus, proving or disproving this
conjecture will be very interesting as it will either imply several tight unconditional
lower bounds or break through a common barrier that blocks progress with these
problems. This conjecture might also be considered as strong evidence against
any further improvement for these problems since refuting it will imply a major
breakthrough for combinatorial Boolean matrix multiplication and other long-standing
problems if the term \"combinatorial algorithms\" is interpreted as \"Strassen-like
algorithms\" [Ballard et al. SPAA'11].\r\n\r\nThe conjecture also leads to hardness
results for problems that were previously based on diverse problems and conjectures
-- such as 3SUM, combinatorial Boolean matrix multiplication, triangle detection,
and multiphase -- thus providing a uniform way to prove polynomial hardness results
for dynamic algorithms; some of the new proofs are also simpler or even become
trivial. The conjecture also leads to stronger and new, non-trivial, hardness
results, e.g., for the fully-dynamic densest subgraph and diameter problems."
article_number: 21-30
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Sebastian
full_name: Krinninger, Sebastian
last_name: Krinninger
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Thatchaphol
full_name: Saranurak, Thatchaphol
last_name: Saranurak
citation:
ama: 'Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. Unifying and strengthening
hardness for dynamic problems via the online matrix-vector multiplication conjecture.
In: 47th Annual ACM Symposium on Theory of Computing. Association for Computing
Machinery; 2015. doi:10.1145/2746539.2746609'
apa: 'Henzinger, M. H., Krinninger, S., Nanongkai, D., & Saranurak, T. (2015).
Unifying and strengthening hardness for dynamic problems via the online matrix-vector
multiplication conjecture. In 47th Annual ACM Symposium on Theory of Computing.
Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746609'
chicago: Henzinger, Monika H, Sebastian Krinninger, Danupon Nanongkai, and Thatchaphol
Saranurak. “Unifying and Strengthening Hardness for Dynamic Problems via the Online
Matrix-Vector Multiplication Conjecture.” In 47th Annual ACM Symposium on Theory
of Computing. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746609.
ieee: M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying
and strengthening hardness for dynamic problems via the online matrix-vector multiplication
conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland,
OR, United States, 2015.
ista: 'Henzinger MH, Krinninger S, Nanongkai D, Saranurak T. 2015. Unifying and
strengthening hardness for dynamic problems via the online matrix-vector multiplication
conjecture. 47th Annual ACM Symposium on Theory of Computing. STOC: Symposium
on Theory of Computing, 21–30.'
mla: Henzinger, Monika H., et al. “Unifying and Strengthening Hardness for Dynamic
Problems via the Online Matrix-Vector Multiplication Conjecture.” 47th Annual
ACM Symposium on Theory of Computing, 21–30, Association for Computing Machinery,
2015, doi:10.1145/2746539.2746609.
short: M.H. Henzinger, S. Krinninger, D. Nanongkai, T. Saranurak, in:, 47th Annual
ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2015-06-14
date_created: 2022-08-16T09:31:21Z
date_published: 2015-06-14T00:00:00Z
date_updated: 2023-02-17T11:09:54Z
day: '14'
doi: 10.1145/2746539.2746609
extern: '1'
external_id:
arxiv:
- '1511.06773'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.06773
month: '06'
oa: 1
oa_version: Preprint
publication: 47th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145033536-2
issn:
- '0737.8017'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unifying and strengthening hardness for dynamic problems via the online matrix-vector
multiplication conjecture
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '11869'
abstract:
- lang: eng
text: "While in many graph mining applications it is crucial to handle a stream
of updates efficiently in terms of both time and space, not much was known about
achieving such type of algorithm. In this paper we study this issue for a problem
which lies at the core of many graph mining applications called densest subgraph
problem. We develop an algorithm that achieves time- and space-efficiency for
this problem simultaneously. It is one of the first of its kind for graph problems
to the best of our knowledge.\r\n\r\nGiven an input graph, the densest subgraph
is the subgraph that maximizes the ratio between the number of edges and the number
of nodes. For any ε>0, our algorithm can, with high probability, maintain a (4+ε)-approximate
solution under edge insertions and deletions using ~O(n) space and ~O(1) amortized
time per update; here, $n$ is the number of nodes in the graph and ~O hides the
O(polylog_{1+ε} n) term. The approximation ratio can be improved to (2+ε) with
more time. It can be extended to a (2+ε)-approximation sublinear-time algorithm
and a distributed-streaming algorithm. Our algorithm is the first streaming algorithm
that can maintain the densest subgraph in one pass. Prior to this, no algorithm
could do so even in the special case of an incremental stream and even when there
is no time restriction. The previously best algorithm in this setting required
O(log n) passes [BahmaniKV12]. The space required by our algorithm is tight up
to a polylogarithmic factor."
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Danupon
full_name: Nanongkai, Danupon
last_name: Nanongkai
- first_name: Charalampos
full_name: Tsourakakis, Charalampos
last_name: Tsourakakis
citation:
ama: 'Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. Space- and time-efficient
algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: 47th
Annual ACM Symposium on Theory of Computing. Association for Computing Machinery;
2015:173-182. doi:10.1145/2746539.2746592'
apa: 'Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Tsourakakis, C. (2015).
Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass
dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp.
173–182). Portland, OR, United States: Association for Computing Machinery. https://doi.org/10.1145/2746539.2746592'
chicago: Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Charalampos
Tsourakakis. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs
on One-Pass Dynamic Streams.” In 47th Annual ACM Symposium on Theory of Computing,
173–82. Association for Computing Machinery, 2015. https://doi.org/10.1145/2746539.2746592.
ieee: S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space-
and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic
streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland,
OR, United States, 2015, pp. 173–182.
ista: 'Bhattacharya S, Henzinger MH, Nanongkai D, Tsourakakis C. 2015. Space- and
time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams.
47th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of
Computing, 173–182.'
mla: Bhattacharya, Sayan, et al. “Space- and Time-Efficient Algorithm for Maintaining
Dense Subgraphs on One-Pass Dynamic Streams.” 47th Annual ACM Symposium on
Theory of Computing, Association for Computing Machinery, 2015, pp. 173–82,
doi:10.1145/2746539.2746592.
short: S. Bhattacharya, M.H. Henzinger, D. Nanongkai, C. Tsourakakis, in:, 47th
Annual ACM Symposium on Theory of Computing, Association for Computing Machinery,
2015, pp. 173–182.
conference:
end_date: 2015-06-17
location: Portland, OR, United States
name: 'STOC: Symposium on Theory of Computing'
start_date: 2015-06-14
date_created: 2022-08-16T09:36:48Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-17T11:17:03Z
day: '01'
doi: 10.1145/2746539.2746592
extern: '1'
external_id:
arxiv:
- '1504.02268'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.02268
month: '06'
oa: 1
oa_version: Preprint
page: 173 - 182
publication: 47th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- 978-145033536-2
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass
dynamic streams
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '11837'
abstract:
- lang: eng
text: "Online social networks allow the collection of large amounts of data about
the influence between users connected by a friendship-like relationship. When
distributing items among agents forming a social network, this information allows
us to exploit network externalities that each agent receives from his neighbors
that get the same item. In this paper we consider Friends-of-Friends (2-hop) network
externalities, i.e., externalities that not only depend on the neighbors that
get the same item but also on neighbors of neighbors. For these externalities
we study a setting where multiple different items are assigned to unit-demand
agents. Specifically, we study the problem of welfare maximization under different
types of externality functions. Let n be the number of agents and m be the number
of items. Our contributions are the following: (1) We show that welfare maximization
is APX-hard; we show that even for step functions with 2-hop (and also with 1-hop)
externalities it is NP-hard to approximate social welfare better than (1-1/e).
(2) On the positive side we present (i) an O(sqrt n)-approximation algorithm for
general concave externality functions,\r\n(ii) an O(\\log m)-approximation algorithm
for linear externality functions, and (iii) an (1-1/e)\\frac{1}{6}-approximation
algorithm for 2-hop step function externalities. We also improve the result from
[6] for 1-hop step function externalities by giving a (1-1/e)/2-approximation
algorithm."
alternative_title:
- LIPIcs
article_processing_charge: No
author:
- first_name: Sayan
full_name: Bhattacharya, Sayan
last_name: Bhattacharya
- first_name: Wolfgang
full_name: Dvorák, Wolfgang
last_name: Dvorák
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: ' Martin'
full_name: Starnberger, Martin
last_name: Starnberger
citation:
ama: 'Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. Welfare maximization
with friends-of-friends network externalities. In: 32nd International Symposium
on Theoretical Aspects of Computer Science. Vol 30. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2015:90-102. doi:10.4230/LIPICS.STACS.2015.90'
apa: 'Bhattacharya, S., Dvorák, W., Henzinger, M. H., & Starnberger, Martin.
(2015). Welfare maximization with friends-of-friends network externalities. In
32nd International Symposium on Theoretical Aspects of Computer Science
(Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für
Informatik. https://doi.org/10.4230/LIPICS.STACS.2015.90'
chicago: Bhattacharya, Sayan, Wolfgang Dvorák, Monika H Henzinger, and Martin Starnberger.
“Welfare Maximization with Friends-of-Friends Network Externalities.” In 32nd
International Symposium on Theoretical Aspects of Computer Science, 30:90–102.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPICS.STACS.2015.90.
ieee: S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare
maximization with friends-of-friends network externalities,” in 32nd International
Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015,
vol. 30, pp. 90–102.
ista: 'Bhattacharya S, Dvorák W, Henzinger MH, Starnberger Martin. 2015. Welfare
maximization with friends-of-friends network externalities. 32nd International
Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical
Aspects of Computer Science, LIPIcs, vol. 30, 90–102.'
mla: Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network
Externalities.” 32nd International Symposium on Theoretical Aspects of Computer
Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015,
pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.
short: S. Bhattacharya, W. Dvorák, M.H. Henzinger, Martin Starnberger, in:, 32nd
International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2015, pp. 90–102.
conference:
end_date: 2015-03-07
location: Garching, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2015-03-04
date_created: 2022-08-12T11:39:40Z
date_published: 2015-02-26T00:00:00Z
date_updated: 2023-02-21T16:32:37Z
day: '26'
doi: 10.4230/LIPICS.STACS.2015.90
extern: '1'
intvolume: ' 30'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4230/LIPICS.STACS.2015.90
month: '02'
oa: 1
oa_version: Published Version
page: 90-102
publication: 32nd International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- 978-3-939897-78-1
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '11903'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Welfare maximization with friends-of-friends network externalities
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2015'
...
---
_id: '11901'
abstract:
- lang: eng
text: We consider auctions of indivisible items to unit-demand bidders with budgets.
This setting was suggested as an expressive model for single sponsored search
auctions. Prior work presented mechanisms that compute bidder-optimal outcomes
and are truthful for a restricted set of inputs, i.e., inputs in so-called general
position. This condition is easily violated. We provide the first mechanism that
is truthful in expectation for all inputs and achieves for each bidder no worse
utility than the bidder-optimal outcome. Additionally we give a complete characterization
for which inputs mechanisms that compute bidder-optimal outcomes are truthful.
article_processing_charge: No
article_type: original
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: Henzinger MH, Loitzenbauer V. Truthful unit-demand auctions with budgets revisited.
Theoretical Computer Science. 2015;573:1-15. doi:10.1016/j.tcs.2015.01.033
apa: Henzinger, M. H., & Loitzenbauer, V. (2015). Truthful unit-demand auctions
with budgets revisited. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2015.01.033
chicago: Henzinger, Monika H, and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions
with Budgets Revisited.” Theoretical Computer Science. Elsevier, 2015.
https://doi.org/10.1016/j.tcs.2015.01.033.
ieee: M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets
revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15,
2015.
ista: Henzinger MH, Loitzenbauer V. 2015. Truthful unit-demand auctions with budgets
revisited. Theoretical Computer Science. 573, 1–15.
mla: Henzinger, Monika H., and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions
with Budgets Revisited.” Theoretical Computer Science, vol. 573, Elsevier,
2015, pp. 1–15, doi:10.1016/j.tcs.2015.01.033.
short: M.H. Henzinger, V. Loitzenbauer, Theoretical Computer Science 573 (2015)
1–15.
date_created: 2022-08-17T09:06:53Z
date_published: 2015-03-30T00:00:00Z
date_updated: 2023-02-17T14:50:04Z
day: '30'
doi: 10.1016/j.tcs.2015.01.033
extern: '1'
intvolume: ' 573'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.tcs.2015.01.033
month: '03'
oa: 1
oa_version: None
page: 1-15
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Truthful unit-demand auctions with budgets revisited
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 573
year: '2015'
...
---
_id: '11962'
abstract:
- lang: eng
text: One of the rare alternative reagents for the reduction of carbon–carbon double
bonds is diimide (HNNH), which can be generated in situ from hydrazine hydrate
(N2H4⋅H2O) and O2. Although this selective method is extremely clean and powerful,
it is rarely used, as the rate-determining oxidation of hydrazine in the absence
of a catalyst is relatively slow using conventional batch protocols. A continuous
high-temperature/high-pressure methodology dramatically enhances the initial oxidation
step, at the same time allowing for a safe and scalable processing of the hazardous
reaction mixture. Simple alkenes can be selectively reduced within 10–20 min at
100–120 °C and 20 bar O2 pressure. The development of a multi-injection reactor
platform for the periodic addition of N2H4⋅H2O enables the reduction of less reactive
olefins even at lower reaction temperatures. This concept was utilized for the
highly selective reduction of artemisinic acid to dihydroartemisinic acid, the
precursor molecule for the semisynthesis of the antimalarial drug artemisinin.
The industrially relevant reduction was achieved by using four consecutive liquid
feeds (of N2H4⋅H2O) and residence time units resulting in a highly selective reduction
within approximately 40 min at 60 °C and 20 bar O2 pressure, providing dihydroartemisinic
acid in ≥93 % yield and ≥95 % selectivity.
article_processing_charge: No
article_type: original
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: Toma
full_name: Glasnov, Toma
last_name: Glasnov
- first_name: C. Oliver
full_name: Kappe, C. Oliver
last_name: Kappe
citation:
ama: Pieber B, Glasnov T, Kappe CO. Continuous flow reduction of artemisinic acid
utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs. Chemistry - A European Journal. 2015;21(11):4368-4376.
doi:10.1002/chem.201406439
apa: Pieber, B., Glasnov, T., & Kappe, C. O. (2015). Continuous flow reduction
of artemisinic acid utilizing multi-injection strategies-closing the gap towards
a fully continuous synthesis of antimalarial drugs. Chemistry - A European
Journal. Wiley. https://doi.org/10.1002/chem.201406439
chicago: Pieber, Bartholomäus, Toma Glasnov, and C. Oliver Kappe. “Continuous Flow
Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the
Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.” Chemistry
- A European Journal. Wiley, 2015. https://doi.org/10.1002/chem.201406439.
ieee: B. Pieber, T. Glasnov, and C. O. Kappe, “Continuous flow reduction of artemisinic
acid utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs,” Chemistry - A European Journal, vol.
21, no. 11. Wiley, pp. 4368–4376, 2015.
ista: Pieber B, Glasnov T, Kappe CO. 2015. Continuous flow reduction of artemisinic
acid utilizing multi-injection strategies-closing the gap towards a fully continuous
synthesis of antimalarial drugs. Chemistry - A European Journal. 21(11), 4368–4376.
mla: Pieber, Bartholomäus, et al. “Continuous Flow Reduction of Artemisinic Acid
Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous
Synthesis of Antimalarial Drugs.” Chemistry - A European Journal, vol.
21, no. 11, Wiley, 2015, pp. 4368–76, doi:10.1002/chem.201406439.
short: B. Pieber, T. Glasnov, C.O. Kappe, Chemistry - A European Journal 21 (2015)
4368–4376.
date_created: 2022-08-24T11:11:10Z
date_published: 2015-03-09T00:00:00Z
date_updated: 2023-02-21T10:09:30Z
day: '09'
doi: 10.1002/chem.201406439
extern: '1'
external_id:
pmid:
- '25655090'
intvolume: ' 21'
issue: '11'
language:
- iso: eng
month: '03'
oa_version: None
page: 4368-4376
pmid: 1
publication: Chemistry - A European Journal
publication_identifier:
eissn:
- 1521-3765
issn:
- 0947-6539
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing
the gap towards a fully continuous synthesis of antimalarial drugs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...
---
_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'
...
---
_id: '1500'
abstract:
- lang: eng
text: In this poster, we present methods for randomly generating hybrid automata
with affine differential equations, invariants, guards, and assignments. Selecting
an arbitrary affine function from the set of all affine functions results in a
low likelihood of generating hybrid automata with diverse and interesting behaviors,
as there are an uncountable number of elements in the set of all affine functions.
Instead, we partition the set of all affine functions into potentially interesting
classes and randomly select elements from these classes. For example, we partition
the set of all affine differential equations by using restrictions on eigenvalues
such as those that yield stable, unstable, etc. equilibrium points. We partition
the components describing discrete behavior (guards, assignments, and invariants)
to allow either time-dependent or state-dependent switching, and in particular
provide the ability to generate subclasses of piecewise-affine hybrid automata.
Our preliminary experimental results with a prototype tool called HyRG (Hybrid
Random Generator) illustrate the feasibility of this generation method to automatically
create standard hybrid automaton examples like the bouncing ball and thermostat.
alternative_title:
- '18th ACM International Conference on Hybrid Systems: Computation and Control, HSCC
2015'
author:
- first_name: Luan
full_name: Nguyen, Luan V
last_name: Nguyen
- first_name: Christian
full_name: Christian Schilling
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Sergiy
full_name: Sergiy Bogomolov
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Taylor
full_name: Johnson, Taylor T
last_name: Johnson
citation:
ama: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. Poster: HyRG: A Random Generation
Tool for Affine Hybrid Automata. Springer; 2015:289-290. doi:10.1145/2728606.2728650'
apa: 'Nguyen, L., Schilling, C., Bogomolov, S., & Johnson, T. (2015). Poster:
HyRG: A random generation tool for affine hybrid automata. HSCC: Hybrid
Systems - Computation and Control (pp. 289–290). Springer. https://doi.org/10.1145/2728606.2728650'
chicago: 'Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson.
Poster: HyRG: A Random Generation Tool for Affine Hybrid Automata. HSCC:
Hybrid Systems - Computation and Control. Springer, 2015. https://doi.org/10.1145/2728606.2728650.'
ieee: 'L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, Poster: HyRG: A
random generation tool for affine hybrid automata. Springer, 2015, pp. 289–290.'
ista: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Poster: HyRG: A random
generation tool for affine hybrid automata, Springer,p.'
mla: 'Nguyen, Luan, et al. “Poster: HyRG: A Random Generation Tool for Affine Hybrid
Automata.” HSCC: Hybrid Systems - Computation and Control, Springer, 2015,
pp. 289–90, doi:10.1145/2728606.2728650.'
short: 'L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, Poster: HyRG: A Random
Generation Tool for Affine Hybrid Automata, Springer, 2015.'
date_created: 2018-12-11T11:52:23Z
date_published: 2015-04-14T00:00:00Z
date_updated: 2019-04-26T07:22:03Z
day: '14'
doi: 10.1145/2728606.2728650
extern: 1
month: '04'
page: 289 - 290
publication: 'HSCC: Hybrid Systems - Computation and Control'
publication_status: published
publisher: Springer
publist_id: '5678'
quality_controlled: 0
status: public
title: 'Poster: HyRG: A random generation tool for affine hybrid automata'
type: conference_poster
year: '2015'
...
---
_id: '1503'
abstract:
- lang: eng
text: A Herman-Avila-Bochi type formula is obtained for the average sum of the top
d Lyapunov exponents over a one-parameter family of double-struck G-cocycles,
where double-struck G is the group that leaves a certain, non-degenerate Hermitian
form of signature (c, d) invariant. The generic example of such a group is the
pseudo-unitary group U(c, d) or, in the case c = d, the Hermitian-symplectic group
HSp(2d) which naturally appears for cocycles related to Schrödinger operators.
In the case d = 1, the formula for HSp(2d) cocycles reduces to the Herman-Avila-Bochi
formula for SL(2, ℝ) cocycles.
author:
- first_name: Christian
full_name: Sadel, Christian
id: 4760E9F8-F248-11E8-B48F-1D18A9856A87
last_name: Sadel
orcid: 0000-0001-8255-3968
citation:
ama: Sadel C. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems.
2015;35(5):1582-1591. doi:10.1017/etds.2013.103
apa: Sadel, C. (2015). A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems.
Cambridge University Press. https://doi.org/10.1017/etds.2013.103
chicago: Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional
Pseudo-Unitary and Hermitian-Symplectic-Cocycles.” Ergodic Theory and Dynamical
Systems. Cambridge University Press, 2015. https://doi.org/10.1017/etds.2013.103.
ieee: C. Sadel, “A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles,” Ergodic Theory and Dynamical Systems,
vol. 35, no. 5. Cambridge University Press, pp. 1582–1591, 2015.
ista: Sadel C. 2015. A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary
and Hermitian-symplectic-cocycles. Ergodic Theory and Dynamical Systems. 35(5),
1582–1591.
mla: Sadel, Christian. “A Herman-Avila-Bochi Formula for Higher-Dimensional Pseudo-Unitary
and Hermitian-Symplectic-Cocycles.” Ergodic Theory and Dynamical Systems,
vol. 35, no. 5, Cambridge University Press, 2015, pp. 1582–91, doi:10.1017/etds.2013.103.
short: C. Sadel, Ergodic Theory and Dynamical Systems 35 (2015) 1582–1591.
date_created: 2018-12-11T11:52:24Z
date_published: 2015-03-14T00:00:00Z
date_updated: 2021-01-12T06:51:13Z
day: '14'
doi: 10.1017/etds.2013.103
extern: '1'
intvolume: ' 35'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1307.8414
month: '03'
oa: 1
oa_version: Preprint
page: 1582 - 1591
publication: Ergodic Theory and Dynamical Systems
publication_status: published
publisher: Cambridge University Press
publist_id: '5675'
quality_controlled: '1'
status: public
title: A Herman-Avila-Bochi formula for higher-dimensional pseudo-unitary and Hermitian-symplectic-cocycles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2015'
...
---
_id: '1510'
abstract:
- lang: eng
text: 'The concept of well group in a special but important case captures homological
properties of the zero set of a continuous map f from K to R^n on a compact space
K that are invariant with respect to perturbations of f. The perturbations are
arbitrary continuous maps within L_infty distance r from f for a given r >
0. The main drawback of the approach is that the computability of well groups
was shown only when dim K = n or n = 1. Our contribution to the theory of well
groups is twofold: on the one hand we improve on the computability issue, but
on the other hand we present a range of examples where the well groups are incomplete
invariants, that is, fail to capture certain important robust properties of the
zero set. For the first part, we identify a computable subgroup of the well group
that is obtained by cap product with the pullback of the orientation of R^n by
f. In other words, well groups can be algorithmically approximated from below.
When f is smooth and dim K < 2n-2, our approximation of the (dim K-n)th well
group is exact. For the second part, we find examples of maps f, f'' from K to
R^n with all well groups isomorphic but whose perturbations have different zero
sets. We discuss on a possible replacement of the well groups of vector valued
maps by an invariant of a better descriptive power and computability status. '
alternative_title:
- LIPIcs
author:
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
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. On computability and triviality of well groups. In: Vol
34. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:842-856. doi:10.4230/LIPIcs.SOCG.2015.842'
apa: 'Franek, P., & Krcál, M. (2015). On computability and triviality of well
groups (Vol. 34, pp. 842–856). Presented at the SoCG: Symposium on Computational
Geometry, Eindhoven, Netherlands: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SOCG.2015.842'
chicago: Franek, Peter, and Marek Krcál. “On Computability and Triviality of Well
Groups,” 34:842–56. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.SOCG.2015.842.
ieee: 'P. Franek and M. Krcál, “On computability and triviality of well groups,”
presented at the SoCG: Symposium on Computational Geometry, Eindhoven, Netherlands,
2015, vol. 34, pp. 842–856.'
ista: 'Franek P, Krcál M. 2015. On computability and triviality of well groups.
SoCG: Symposium on Computational Geometry, LIPIcs, vol. 34, 842–856.'
mla: Franek, Peter, and Marek Krcál. On Computability and Triviality of Well
Groups. Vol. 34, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015,
pp. 842–56, doi:10.4230/LIPIcs.SOCG.2015.842.
short: P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 842–856.
conference:
end_date: 2015-06-25
location: Eindhoven, Netherlands
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2015-06-22
date_created: 2018-12-11T11:52:26Z
date_published: 2015-06-11T00:00:00Z
date_updated: 2023-02-21T17:02:57Z
day: '11'
ddc:
- '510'
department:
- _id: UlWa
- _id: HeEd
doi: 10.4230/LIPIcs.SOCG.2015.842
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:19Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5001'
file_name: IST-2016-503-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
intvolume: ' 34'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 842 - 856
project:
- _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: '5667'
pubrep_id: '503'
quality_controlled: '1'
related_material:
record:
- id: '1408'
relation: later_version
status: public
scopus_import: 1
status: public
title: On computability and triviality of well groups
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: 34
year: '2015'
...
---
_id: '1505'
abstract:
- lang: eng
text: This paper is aimed at deriving the universality of the largest eigenvalue
of a class of high-dimensional real or complex sample covariance matrices of the
form W N =Σ 1/2XX∗Σ 1/2 . Here, X = (xij )M,N is an M× N random matrix with independent
entries xij , 1 ≤ i M,≤ 1 ≤ j ≤ N such that Exij = 0, E|xij |2 = 1/N . On dimensionality,
we assume that M = M(N) and N/M → d ε (0, ∞) as N ∞→. For a class of general deterministic
positive-definite M × M matrices Σ , under some additional assumptions on the
distribution of xij 's, we show that the limiting behavior of the largest eigenvalue
of W N is universal, via pursuing a Green function comparison strategy raised
in [Probab. Theory Related Fields 154 (2012) 341-407, Adv. Math. 229 (2012) 1435-1515]
by Erd″os, Yau and Yin for Wigner matrices and extended by Pillai and Yin [Ann.
Appl. Probab. 24 (2014) 935-1001] to sample covariance matrices in the null case
(&Epsi = I ). Consequently, in the standard complex case (Ex2 ij = 0), combing
this universality property and the results known for Gaussian matrices obtained
by El Karoui in [Ann. Probab. 35 (2007) 663-714] (nonsingular case) and Onatski
in [Ann. Appl. Probab. 18 (2008) 470-490] (singular case), we show that after
an appropriate normalization the largest eigenvalue of W N converges weakly to
the type 2 Tracy-Widom distribution TW2 . Moreover, in the real case, we show
that whenΣ is spiked with a fixed number of subcritical spikes, the type 1 Tracy-Widom
limit TW1 holds for the normalized largest eigenvalue of W N , which extends a
result of Féral and Péché in [J. Math. Phys. 50 (2009) 073302] to the scenario
of nondiagonal Σ and more generally distributed X . In summary, we establish the
Tracy-Widom type universality for the largest eigenvalue of generally distributed
sample covariance matrices under quite light assumptions on &Sigma . Applications
of these limiting results to statistical signal detection and structure recognition
of separable covariance matrices are also discussed.
acknowledgement: "B.Z. was supported in part by NSFC Grant 11071213, ZJNSF
\ Grant R6090034 and SRFDP Grant 20100101110001. P.G. was supported in part
by the Ministry of Education, Singapore, under Grant ARC 14/11. Z.W. was supported
\ in part by the Ministry of Education, Singapore, under Grant ARC 14/11,
\ and by a Grant R-155-000-131-112 at the National University of Singapore\r\n"
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. Universality for the largest eigenvalue of sample covariance
matrices with general population. Annals of Statistics. 2015;43(1):382-421.
doi:10.1214/14-AOS1281
apa: Bao, Z., Pan, G., & Zhou, W. (2015). Universality for the largest eigenvalue
of sample covariance matrices with general population. Annals of Statistics.
Institute of Mathematical Statistics. https://doi.org/10.1214/14-AOS1281
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “Universality for the Largest
Eigenvalue of Sample Covariance Matrices with General Population.” Annals of
Statistics. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/14-AOS1281.
ieee: Z. Bao, G. Pan, and W. Zhou, “Universality for the largest eigenvalue of sample
covariance matrices with general population,” Annals of Statistics, vol.
43, no. 1. Institute of Mathematical Statistics, pp. 382–421, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. Universality for the largest eigenvalue of sample
covariance matrices with general population. Annals of Statistics. 43(1), 382–421.
mla: Bao, Zhigang, et al. “Universality for the Largest Eigenvalue of Sample Covariance
Matrices with General Population.” Annals of Statistics, vol. 43, no. 1,
Institute of Mathematical Statistics, 2015, pp. 382–421, doi:10.1214/14-AOS1281.
short: Z. Bao, G. Pan, W. Zhou, Annals of Statistics 43 (2015) 382–421.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/14-AOS1281
intvolume: ' 43'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1304.5690
month: '02'
oa: 1
oa_version: Preprint
page: 382 - 421
publication: Annals of Statistics
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5672'
quality_controlled: '1'
status: public
title: Universality for the largest eigenvalue of sample covariance matrices with
general population
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 43
year: '2015'
...
---
_id: '1508'
abstract:
- lang: eng
text: We consider generalized Wigner ensembles and general β-ensembles with analytic
potentials for any β ≥ 1. The recent universality results in particular assert
that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum
are universal in the sense that they coincide with those of the corresponding
Gaussian β-ensembles. In this article, we show that local averaging is not necessary
for this result, i.e. we prove that the single gap distributions in the bulk are
universal. In fact, with an additional step, our result can be extended to any
C4(ℝ) potential.
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. Journal
of the European Mathematical Society. 2015;17(8):1927-2036. doi:10.4171/JEMS/548
apa: Erdös, L., & Yau, H. (2015). Gap universality of generalized Wigner and
β ensembles. Journal of the European Mathematical Society. European Mathematical
Society. https://doi.org/10.4171/JEMS/548
chicago: Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and
β Ensembles.” Journal of the European Mathematical Society. European Mathematical
Society, 2015. https://doi.org/10.4171/JEMS/548.
ieee: L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,”
Journal of the European Mathematical Society, vol. 17, no. 8. European
Mathematical Society, pp. 1927–2036, 2015.
ista: Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles.
Journal of the European Mathematical Society. 17(8), 1927–2036.
mla: Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β
Ensembles.” Journal of the European Mathematical Society, vol. 17, no.
8, European Mathematical Society, 2015, pp. 1927–2036, doi:10.4171/JEMS/548.
short: L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015)
1927–2036.
date_created: 2018-12-11T11:52:26Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:15Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/JEMS/548
intvolume: ' 17'
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1211.3786
month: '08'
oa: 1
oa_version: Preprint
page: 1927 - 2036
publication: Journal of the European Mathematical Society
publication_status: published
publisher: European Mathematical Society
publist_id: '5669'
quality_controlled: '1'
scopus_import: 1
status: public
title: Gap universality of generalized Wigner and β ensembles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2015'
...
---
_id: '1506'
abstract:
- lang: eng
text: Consider the square random matrix An = (aij)n,n, where {aij:= a(n)ij , i,
j = 1, . . . , n} is a collection of independent real random variables with means
zero and variances one. Under the additional moment condition supn max1≤i,j ≤n
Ea4ij <∞, we prove Girko's logarithmic law of det An in the sense that as n→∞
log | detAn| ? (1/2) log(n-1)! d/→√(1/2) log n N(0, 1).
author:
- first_name: Zhigang
full_name: Bao, Zhigang
id: 442E6A6C-F248-11E8-B48F-1D18A9856A87
last_name: Bao
orcid: 0000-0003-3036-1475
- first_name: Guangming
full_name: Pan, Guangming
last_name: Pan
- first_name: Wang
full_name: Zhou, Wang
last_name: Zhou
citation:
ama: Bao Z, Pan G, Zhou W. The logarithmic law of random determinant. Bernoulli.
2015;21(3):1600-1628. doi:10.3150/14-BEJ615
apa: Bao, Z., Pan, G., & Zhou, W. (2015). The logarithmic law of random determinant.
Bernoulli. Bernoulli Society for Mathematical Statistics and Probability.
https://doi.org/10.3150/14-BEJ615
chicago: Bao, Zhigang, Guangming Pan, and Wang Zhou. “The Logarithmic Law of Random
Determinant.” Bernoulli. Bernoulli Society for Mathematical Statistics
and Probability, 2015. https://doi.org/10.3150/14-BEJ615.
ieee: Z. Bao, G. Pan, and W. Zhou, “The logarithmic law of random determinant,”
Bernoulli, vol. 21, no. 3. Bernoulli Society for Mathematical Statistics
and Probability, pp. 1600–1628, 2015.
ista: Bao Z, Pan G, Zhou W. 2015. The logarithmic law of random determinant. Bernoulli.
21(3), 1600–1628.
mla: Bao, Zhigang, et al. “The Logarithmic Law of Random Determinant.” Bernoulli,
vol. 21, no. 3, Bernoulli Society for Mathematical Statistics and Probability,
2015, pp. 1600–28, doi:10.3150/14-BEJ615.
short: Z. Bao, G. Pan, W. Zhou, Bernoulli 21 (2015) 1600–1628.
date_created: 2018-12-11T11:52:25Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:14Z
day: '01'
department:
- _id: LaEr
doi: 10.3150/14-BEJ615
intvolume: ' 21'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1208.5823
month: '08'
oa: 1
oa_version: Preprint
page: 1600 - 1628
publication: Bernoulli
publication_status: published
publisher: Bernoulli Society for Mathematical Statistics and Probability
publist_id: '5671'
quality_controlled: '1'
status: public
title: The logarithmic law of random determinant
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 21
year: '2015'
...
---
_id: '1513'
abstract:
- lang: eng
text: "Insects of the order Hemiptera (true bugs) use a wide range of mechanisms
of sex determination, including genetic sex determination, paternal genome elimination,
and haplodiploidy. Genetic sex determination, the prevalent mode, is generally
controlled by a pair of XY sex chromosomes or by an XX/X0 system, but different
configurations that include additional sex chromosomes are also present. Although
this diversity of sex determining systems has been extensively studied at the
cytogenetic level, only the X chromosome of the model pea aphid Acyrthosiphon
pisum has been analyzed at the genomic level, and little is known about X chromosome
biology in the rest of the order.\r\n\r\nIn this study, we take advantage of published
DNA- and RNA-seq data from three additional Hemiptera species to perform a comparative
analysis of the gene content and expression of the X chromosome throughout this
clade. We find that, despite showing evidence of dosage compensation, the X chromosomes
of these species show female-biased expression, and a deficit of male-biased genes,
in direct contrast to the pea aphid X. We further detect an excess of shared gene
content between these very distant species, suggesting that despite the diversity
of sex determining systems, the same chromosomal element is used as the X throughout
a large portion of the order. "
article_processing_charge: No
author:
- first_name: Arka
full_name: Pal, Arka
id: 6AAB2240-CA9A-11E9-9C1A-D9D1E5697425
last_name: Pal
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: 'Pal A, Vicoso B. The X chromosome of hemipteran insects: Conservation, dosage
compensation and sex-biased expression. Genome Biology and Evolution. 2015;7(12):3259-3268.
doi:10.1093/gbe/evv215'
apa: 'Pal, A., & Vicoso, B. (2015). The X chromosome of hemipteran insects:
Conservation, dosage compensation and sex-biased expression. Genome Biology
and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evv215'
chicago: 'Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects:
Conservation, Dosage Compensation and Sex-Biased Expression.” Genome Biology
and Evolution. Oxford University Press, 2015. https://doi.org/10.1093/gbe/evv215.'
ieee: 'A. Pal and B. Vicoso, “The X chromosome of hemipteran insects: Conservation,
dosage compensation and sex-biased expression,” Genome Biology and Evolution,
vol. 7, no. 12. Oxford University Press, pp. 3259–3268, 2015.'
ista: 'Pal A, Vicoso B. 2015. The X chromosome of hemipteran insects: Conservation,
dosage compensation and sex-biased expression. Genome Biology and Evolution. 7(12),
3259–3268.'
mla: 'Pal, Arka, and Beatriz Vicoso. “The X Chromosome of Hemipteran Insects: Conservation,
Dosage Compensation and Sex-Biased Expression.” Genome Biology and Evolution,
vol. 7, no. 12, Oxford University Press, 2015, pp. 3259–68, doi:10.1093/gbe/evv215.'
short: A. Pal, B. Vicoso, Genome Biology and Evolution 7 (2015) 3259–3268.
date_created: 2018-12-11T11:52:27Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2021-01-12T06:51:18Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1093/gbe/evv215
ec_funded: 1
file:
- access_level: open_access
checksum: 2b56b8c2e2a1d4cc3c9cb8daba26dd9b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:29Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5284'
file_name: IST-2016-496-v1+1_Genome_Biol_Evol-2015-Pal-3259-68.pdf
file_size: 858027
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 7'
issue: '12'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 3259 - 3268
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Genome Biology and Evolution
publication_status: published
publisher: Oxford University Press
publist_id: '5664'
pubrep_id: '496'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'The X chromosome of hemipteran insects: Conservation, dosage compensation
and sex-biased expression'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2015'
...
---
_id: '1517'
abstract:
- lang: eng
text: "We study the large deviation rate functional for the empirical distribution
of independent Brownian particles with drift. In one dimension, it has been shown
by Adams, Dirr, Peletier and Zimmer that this functional is asymptotically equivalent
(in the sense of Γ-convergence) to the Jordan-Kinderlehrer-Otto functional arising
in the Wasserstein gradient flow structure of the Fokker-Planck equation. In higher
dimensions, part of this statement (the lower bound) has been recently proved
by Duong, Laschos and Renger, but the upper bound remained open, since the proof
of Duong et al relies on regularity properties of optimal transport maps that
are restricted to one dimension. In this note we present a new proof of the upper
bound, thereby generalising the result of Adams et al to arbitrary dimensions.\r\n"
article_number: '89'
author:
- first_name: Matthias
full_name: Erbar, Matthias
last_name: Erbar
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Michiel
full_name: Renger, Michiel
last_name: Renger
citation:
ama: Erbar M, Maas J, Renger M. From large deviations to Wasserstein gradient flows
in multiple dimensions. Electronic Communications in Probability. 2015;20.
doi:10.1214/ECP.v20-4315
apa: Erbar, M., Maas, J., & Renger, M. (2015). From large deviations to Wasserstein
gradient flows in multiple dimensions. Electronic Communications in Probability.
Institute of Mathematical Statistics. https://doi.org/10.1214/ECP.v20-4315
chicago: Erbar, Matthias, Jan Maas, and Michiel Renger. “From Large Deviations to
Wasserstein Gradient Flows in Multiple Dimensions.” Electronic Communications
in Probability. Institute of Mathematical Statistics, 2015. https://doi.org/10.1214/ECP.v20-4315.
ieee: M. Erbar, J. Maas, and M. Renger, “From large deviations to Wasserstein gradient
flows in multiple dimensions,” Electronic Communications in Probability,
vol. 20. Institute of Mathematical Statistics, 2015.
ista: Erbar M, Maas J, Renger M. 2015. From large deviations to Wasserstein gradient
flows in multiple dimensions. Electronic Communications in Probability. 20, 89.
mla: Erbar, Matthias, et al. “From Large Deviations to Wasserstein Gradient Flows
in Multiple Dimensions.” Electronic Communications in Probability, vol.
20, 89, Institute of Mathematical Statistics, 2015, doi:10.1214/ECP.v20-4315.
short: M. Erbar, J. Maas, M. Renger, Electronic Communications in Probability 20
(2015).
date_created: 2018-12-11T11:52:29Z
date_published: 2015-11-29T00:00:00Z
date_updated: 2021-01-12T06:51:19Z
day: '29'
ddc:
- '519'
department:
- _id: JaMa
doi: 10.1214/ECP.v20-4315
file:
- access_level: open_access
checksum: 135741c17d3e1547ca696b6fbdcd559c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:39Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4828'
file_name: IST-2016-494-v1+1_4315-23820-1-PB.pdf
file_size: 230525
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 20'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
publication: Electronic Communications in Probability
publication_status: published
publisher: Institute of Mathematical Statistics
publist_id: '5660'
pubrep_id: '494'
quality_controlled: '1'
scopus_import: 1
status: public
title: From large deviations to Wasserstein gradient flows in multiple dimensions
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 20
year: '2015'
...
---
_id: '1515'
abstract:
- lang: eng
text: Type 1 metabotropic glutamate (mGlu1) receptors play a pivotal role in different
forms of synaptic plasticity in the cerebellar cortex, e.g. long-term depression
at glutamatergic synapses and rebound potentiation at GABAergic synapses. These
various forms of plasticity might depend on the subsynaptic arrangement of the
receptor in Purkinje cells that can be regulated by protein-protein interactions.
This study investigated, by means of the freeze-fracture replica immunogold labelling
method, the subcellular localization of mGlu1 receptors in the rodent cerebellum
and whether Homer proteins regulate their subsynaptic distribution. We observed
a widespread extrasynaptic localization of mGlu1 receptors and confirmed their
peri-synaptic enrichment at glutamatergic synapses. Conversely, we detected mGlu1
receptors within the main body of GABAergic synapses onto Purkinje cell dendrites.
Although Homer proteins are known to interact with the mGlu1 receptor C-terminus,
we could not detect Homer3, the most abundant Homer protein in the cerebellar
cortex, at GABAergic synapses by pre-embedding and post-embedding immunoelectron
microscopy. We then hypothesized a critical role for Homer proteins in the peri-junctional
localization of mGlu1 receptors at glutamatergic synapses. To disrupt Homer-associated
protein complexes, mice were tail-vein injected with the membrane-permeable dominant-negative
TAT-Homer1a. Freeze-fracture replica immunogold labelling analysis showed no significant
alteration in the mGlu1 receptor distribution pattern at parallel fibre-Purkinje
cell synapses, suggesting that other scaffolding proteins are involved in the
peri-synaptic confinement. The identification of interactors that regulate the
subsynaptic localization of the mGlu1 receptor at neurochemically distinct synapses
may offer new insight into its trafficking and intracellular signalling.
acknowledgement: This work was supported by the Austrian Science Fund (FWF) (project
W012060-10 to F.F.), The Japan Society for the Promotion of Science (JSPS) (to R.S.)
and Agence Nationale de la Recherche (ANR-11-BSV4-018-03, DELTAPLAN), Région Languedoc-Roussillon
(Chercheur d’Avenir) (to J.P.). The authors thank S. Schönherr for excellent technical
support and Dr Furuichi for kindly providing anti-Homer3 antibodies.
author:
- first_name: Mahnaz
full_name: Mansouri, Mahnaz
last_name: Mansouri
- first_name: Yu
full_name: Kasugai, Yu
last_name: Kasugai
- first_name: Yugo
full_name: Fukazawa, Yugo
last_name: Fukazawa
- first_name: Federica
full_name: Bertaso, Federica
last_name: Bertaso
- first_name: Fabrice
full_name: Raynaud, Fabrice
last_name: Raynaud
- first_name: Julie
full_name: Perroy, Julie
last_name: Perroy
- first_name: Laurent
full_name: Fagni, Laurent
last_name: Fagni
- first_name: Walter
full_name: Walter Kaufmann
id: 3F99E422-F248-11E8-B48F-1D18A9856A87
last_name: Kaufmann
orcid: 0000-0001-9735-5315
- first_name: Masahiko
full_name: Watanabe, Masahiko
last_name: Watanabe
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Francesco
full_name: Ferraguti, Francesco
last_name: Ferraguti
citation:
ama: Mansouri M, Kasugai Y, Fukazawa Y, et al. Distinct subsynaptic localization
of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses
in the rodent cerebellar cortex. European Journal of Neuroscience. 2015;41(2):157-167.
doi:10.1111/ejn.12779
apa: Mansouri, M., Kasugai, Y., Fukazawa, Y., Bertaso, F., Raynaud, F., Perroy,
J., … Ferraguti, F. (2015). Distinct subsynaptic localization of type 1 metabotropic
glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar
cortex. European Journal of Neuroscience. Wiley-Blackwell. https://doi.org/10.1111/ejn.12779
chicago: Mansouri, Mahnaz, Yu Kasugai, Yugo Fukazawa, Federica Bertaso, Fabrice
Raynaud, Julie Perroy, Laurent Fagni, et al. “Distinct Subsynaptic Localization
of Type 1 Metabotropic Glutamate Receptors at Glutamatergic and GABAergic Synapses
in the Rodent Cerebellar Cortex.” European Journal of Neuroscience. Wiley-Blackwell,
2015. https://doi.org/10.1111/ejn.12779.
ieee: M. Mansouri et al., “Distinct subsynaptic localization of type 1 metabotropic
glutamate receptors at glutamatergic and GABAergic synapses in the rodent cerebellar
cortex,” European Journal of Neuroscience, vol. 41, no. 2. Wiley-Blackwell,
pp. 157–167, 2015.
ista: Mansouri M, Kasugai Y, Fukazawa Y, Bertaso F, Raynaud F, Perroy J, Fagni L,
Kaufmann W, Watanabe M, Shigemoto R, Ferraguti F. 2015. Distinct subsynaptic localization
of type 1 metabotropic glutamate receptors at glutamatergic and GABAergic synapses
in the rodent cerebellar cortex. European Journal of Neuroscience. 41(2), 157–167.
mla: Mansouri, Mahnaz, et al. “Distinct Subsynaptic Localization of Type 1 Metabotropic
Glutamate Receptors at Glutamatergic and GABAergic Synapses in the Rodent Cerebellar
Cortex.” European Journal of Neuroscience, vol. 41, no. 2, Wiley-Blackwell,
2015, pp. 157–67, doi:10.1111/ejn.12779.
short: M. Mansouri, Y. Kasugai, Y. Fukazawa, F. Bertaso, F. Raynaud, J. Perroy,
L. Fagni, W. Kaufmann, M. Watanabe, R. Shigemoto, F. Ferraguti, European Journal
of Neuroscience 41 (2015) 157–167.
date_created: 2018-12-11T11:52:28Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2023-02-23T10:02:24Z
day: '01'
doi: 10.1111/ejn.12779
extern: 1
intvolume: ' 41'
issue: '2'
month: '01'
page: 157 - 167
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5662'
quality_controlled: 0
status: public
title: Distinct subsynaptic localization of type 1 metabotropic glutamate receptors
at glutamatergic and GABAergic synapses in the rodent cerebellar cortex
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
volume: 41
year: '2015'
...
---
_id: '1514'
abstract:
- lang: eng
text: 'Endocannabinoids (eCBs) play key roles in brain function, acting as modulatory
signals in synaptic transmission and plasticity. They are recognized as retrograde
messengers that mediate long-term synaptic depression (LTD), but their ability
to induce long-term potentiation (LTP) is poorly known. We show that eCBs induce
the long-term enhancement of transmitter release at single hippocampal synapses
through stimulation of astrocytes when coincident with postsynaptic activity.
This LTP requires the coordinated activity of the 3 elements of the tripartite
synapse: 1) eCB-evoked astrocyte calcium signal that stimulates glutamate release;
2) postsynaptic nitric oxide production; and 3) activation of protein kinase C
and presynaptic group I metabotropic glutamate receptors, whose location at presynaptic
sites was confirmed by immunoelectron microscopy. Hence, while eCBs act as retrograde
signals to depress homoneuronal synapses, they serve as lateral messengers to
induce LTP in distant heteroneuronal synapses through stimulation of astrocytes.
Therefore, eCBs can trigger LTP through stimulation of astrocyte-neuron signaling,
revealing novel cellular mechanisms of eCB effects on synaptic plasticity.'
acknowledgement: |-
This work was supported by grants from Ministerio de Economia y Competitividad, Spain (MINECO; BFU2010-15832), European Union (HEALTH-F2-2007-202167), and Cajal Blue Brain to A.A. Grants from Spain (MINECO; BFU-2009-08404 and
CSD2008-00005) to R.L. Grants from Spain (MINECO; Consolider, CSD2010-00045; Ramón y Cajal Program, RYC-2012-12014; and BFU2013-47265) to G.P. We thank Dr Atsu Aiba (Animal Resources, Center for Disease Biology and Integrative Medicine, Faculty of Medicine, University of Tokyo) for the donation of the mGluR1b rescue mice.
author:
- first_name: Marta
full_name: Gómez-Gonzalo, Marta
last_name: Gómez Gonzalo
- first_name: Marta
full_name: Navarrete, Marta
last_name: Navarrete
- first_name: Gertrudis
full_name: Perea, Gertrudis
last_name: Perea
- first_name: Ana
full_name: Covelo, Ana
last_name: Covelo
- first_name: Mario
full_name: Martín-Fernández, Mario
last_name: Martín Fernández
- first_name: Ryuichi
full_name: Ryuichi Shigemoto
id: 499F3ABC-F248-11E8-B48F-1D18A9856A87
last_name: Shigemoto
orcid: 0000-0001-8761-9444
- first_name: Rafael
full_name: Luján, Rafael
last_name: Luján
- first_name: Alfonso
full_name: Araque, Alfonso
last_name: Araque
citation:
ama: Gómez Gonzalo M, Navarrete M, Perea G, et al. Endocannabinoids induce lateral
long term potentiation of transmitter release by stimulation of gliotransmission.
Cerebral Cortex. 2015;25(10):3699-3712. doi:10.1093/cercor/bhu231
apa: Gómez Gonzalo, M., Navarrete, M., Perea, G., Covelo, A., Martín Fernández,
M., Shigemoto, R., … Araque, A. (2015). Endocannabinoids induce lateral long term
potentiation of transmitter release by stimulation of gliotransmission. Cerebral
Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bhu231
chicago: Gómez Gonzalo, Marta, Marta Navarrete, Gertrudis Perea, Ana Covelo, Mario
Martín Fernández, Ryuichi Shigemoto, Rafael Luján, and Alfonso Araque. “Endocannabinoids
Induce Lateral Long Term Potentiation of Transmitter Release by Stimulation of
Gliotransmission.” Cerebral Cortex. Oxford University Press, 2015. https://doi.org/10.1093/cercor/bhu231.
ieee: M. Gómez Gonzalo et al., “Endocannabinoids induce lateral long term
potentiation of transmitter release by stimulation of gliotransmission,” Cerebral
Cortex, vol. 25, no. 10. Oxford University Press, pp. 3699–3712, 2015.
ista: Gómez Gonzalo M, Navarrete M, Perea G, Covelo A, Martín Fernández M, Shigemoto
R, Luján R, Araque A. 2015. Endocannabinoids induce lateral long term potentiation
of transmitter release by stimulation of gliotransmission. Cerebral Cortex. 25(10),
3699–3712.
mla: Gómez Gonzalo, Marta, et al. “Endocannabinoids Induce Lateral Long Term Potentiation
of Transmitter Release by Stimulation of Gliotransmission.” Cerebral Cortex,
vol. 25, no. 10, Oxford University Press, 2015, pp. 3699–712, doi:10.1093/cercor/bhu231.
short: M. Gómez Gonzalo, M. Navarrete, G. Perea, A. Covelo, M. Martín Fernández,
R. Shigemoto, R. Luján, A. Araque, Cerebral Cortex 25 (2015) 3699–3712.
date_created: 2018-12-11T11:52:27Z
date_published: 2015-10-10T00:00:00Z
date_updated: 2021-01-12T06:51:18Z
day: '10'
doi: 10.1093/cercor/bhu231
extern: 1
intvolume: ' 25'
issue: '10'
month: '10'
page: 3699 - 3712
publication: Cerebral Cortex
publication_status: published
publisher: Oxford University Press
publist_id: '5663'
quality_controlled: 0
status: public
title: Endocannabinoids induce lateral long term potentiation of transmitter release
by stimulation of gliotransmission
type: journal_article
volume: 25
year: '2015'
...
---
_id: '1519'
abstract:
- lang: eng
text: Evolutionary biologists have an array of powerful theoretical techniques that
can accurately predict changes in the genetic composition of populations. Changes
in gene frequencies and genetic associations between loci can be tracked as they
respond to a wide variety of evolutionary forces. However, it is often less clear
how to decompose these various forces into components that accurately reflect
the underlying biology. Here, we present several issues that arise in the definition
and interpretation of selection and selection coefficients, focusing on insights
gained through the examination of selection coefficients in multilocus notation.
Using this notation, we discuss how its flexibility-which allows different biological
units to be identified as targets of selection-is reflected in the interpretation
of the coefficients that the notation generates. In many situations, it can be
difficult to agree on whether loci can be considered to be under "direct"
versus "indirect" selection, or to quantify this selection. We present
arguments for what the terms direct and indirect selection might best encompass,
considering a range of issues, from viability and sexual selection to kin selection.
We show how multilocus notation can discriminate between direct and indirect selection,
and describe when it can do so.
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Maria
full_name: Servedio, Maria
last_name: Servedio
citation:
ama: Barton NH, Servedio M. The interpretation of selection coefficients. Evolution.
2015;69(5):1101-1112. doi:10.1111/evo.12641
apa: Barton, N. H., & Servedio, M. (2015). The interpretation of selection coefficients.
Evolution. Wiley. https://doi.org/10.1111/evo.12641
chicago: Barton, Nicholas H, and Maria Servedio. “The Interpretation of Selection
Coefficients.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12641.
ieee: N. H. Barton and M. Servedio, “The interpretation of selection coefficients,”
Evolution, vol. 69, no. 5. Wiley, pp. 1101–1112, 2015.
ista: Barton NH, Servedio M. 2015. The interpretation of selection coefficients.
Evolution. 69(5), 1101–1112.
mla: Barton, Nicholas H., and Maria Servedio. “The Interpretation of Selection Coefficients.”
Evolution, vol. 69, no. 5, Wiley, 2015, pp. 1101–12, doi:10.1111/evo.12641.
short: N.H. Barton, M. Servedio, Evolution 69 (2015) 1101–1112.
date_created: 2018-12-11T11:52:29Z
date_published: 2015-03-19T00:00:00Z
date_updated: 2021-01-12T06:51:20Z
day: '19'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/evo.12641
ec_funded: 1
file:
- access_level: open_access
checksum: fd8d23f476bc194419929b72ca265c02
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:34Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4822'
file_name: IST-2016-560-v1+1_Interpreting_ML_coefficients_11.2.15_App.pdf
file_size: 188872
relation: main_file
- access_level: open_access
checksum: b774911e70044641d556e258efcb52ef
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:35Z
date_updated: 2020-07-14T12:45:00Z
file_id: '4823'
file_name: IST-2016-560-v1+2_Interpreting_ML_coefficients_11.2.15_mainText.pdf
file_size: 577415
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 69'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 1101 - 1112
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Evolution
publication_status: published
publisher: Wiley
publist_id: '5656'
pubrep_id: '560'
quality_controlled: '1'
scopus_import: 1
status: public
title: The interpretation of selection coefficients
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 69
year: '2015'
...
---
_id: '1525'
abstract:
- lang: eng
text: 'Based on 16 recommendations, efforts should be made to achieve the following
goal: By 2025, all scholarly publication activity in Austria should be Open Access.
In other words, the final versions of all scholarly publications resulting from
the support of public resources must be freely accessible on the Internet without
delay (Gold Open Access). The resources required to meet this obligation shall
be provided to the authors, or the cost of the publication venues shall be borne
directly by the research organisations.'
article_processing_charge: No
article_type: original
author:
- first_name: Bruno
full_name: Bauer, Bruno
last_name: Bauer
- first_name: Guido
full_name: Blechl, Guido
last_name: Blechl
- first_name: Christoph
full_name: Bock, Christoph
last_name: Bock
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Peter
full_name: Seitz, Peter
last_name: Seitz
- first_name: Herwig
full_name: Stöger, Herwig
last_name: Stöger
- first_name: Elvira
full_name: Welzig, Elvira
last_name: Welzig
citation:
ama: Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open
Access Network Austria OANA. VÖB Mitteilungen. 2015;68(3):580-607. doi:10.5281/zenodo.33178
apa: Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., …
Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network
Austria OANA. VÖB Mitteilungen. Verein Österreichischer Bibliothekare.
https://doi.org/10.5281/zenodo.33178
chicago: Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus,
Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des
Open Access Network Austria OANA.” VÖB Mitteilungen. Verein Österreichischer
Bibliothekare, 2015. https://doi.org/10.5281/zenodo.33178.
ieee: B. Bauer et al., “Arbeitsgruppe „Nationale Strategie“ des Open Access
Network Austria OANA,” VÖB Mitteilungen, vol. 68, no. 3. Verein Österreichischer
Bibliothekare, pp. 580–607, 2015.
ista: Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer
K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale
Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.
mla: Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network
Austria OANA.” VÖB Mitteilungen, vol. 68, no. 3, Verein Österreichischer
Bibliothekare, 2015, pp. 580–607, doi:10.5281/zenodo.33178.
short: B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König,
K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen
68 (2015) 580–607.
date_created: 2018-12-11T11:52:31Z
date_published: 2015-11-12T00:00:00Z
date_updated: 2021-01-12T06:51:22Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.33178
file:
- access_level: open_access
checksum: a495fe253bbc7615b1d60e9e85c94408
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:59Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5317'
file_name: IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf
file_size: 931707
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
has_accepted_license: '1'
intvolume: ' 68'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 580 - 607
publication: VÖB Mitteilungen
publication_status: published
publisher: Verein Österreichischer Bibliothekare
publist_id: '5648'
pubrep_id: '720'
quality_controlled: '1'
scopus_import: 1
status: public
title: Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA
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: 68
year: '2015'
...
---
_id: '1520'
abstract:
- lang: eng
text: Creating mechanical automata that can walk in stable and pleasing manners
is a challenging task that requires both skill and expertise. We propose to use
computational design to offset the technical difficulties of this process. A simple
drag-and-drop interface allows casual users to create personalized walking toys
from a library of pre-defined template mechanisms. Provided with this input, our
method leverages physical simulation and evolutionary optimization to refine the
mechanical designs such that the resulting toys are able to walk. The optimization
process is guided by an intuitive set of objectives that measure the quality of
the walking motions. We demonstrate our approach on a set of simulated mechanical
toys with different numbers of legs and various distinct gaits. Two fabricated
prototypes showcase the feasibility of our designs.
author:
- first_name: Gaurav
full_name: Bharaj, Gaurav
last_name: Bharaj
- first_name: Stelian
full_name: Coros, Stelian
last_name: Coros
- first_name: Bernhard
full_name: Thomaszewski, Bernhard
last_name: Thomaszewski
- first_name: James
full_name: Tompkin, James
last_name: Tompkin
- first_name: Bernd
full_name: Bickel, Bernd
id: 49876194-F248-11E8-B48F-1D18A9856A87
last_name: Bickel
orcid: 0000-0001-6511-9385
- first_name: Hanspeter
full_name: Pfister, Hanspeter
last_name: Pfister
citation:
ama: 'Bharaj G, Coros S, Thomaszewski B, Tompkin J, Bickel B, Pfister H. Computational
design of walking automata. In: ACM; 2015:93-100. doi:10.1145/2786784.2786803'
apa: 'Bharaj, G., Coros, S., Thomaszewski, B., Tompkin, J., Bickel, B., & Pfister,
H. (2015). Computational design of walking automata (pp. 93–100). Presented at
the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Los Angeles,
CA, United States: ACM. https://doi.org/10.1145/2786784.2786803'
chicago: Bharaj, Gaurav, Stelian Coros, Bernhard Thomaszewski, James Tompkin, Bernd
Bickel, and Hanspeter Pfister. “Computational Design of Walking Automata,” 93–100.
ACM, 2015. https://doi.org/10.1145/2786784.2786803.
ieee: 'G. Bharaj, S. Coros, B. Thomaszewski, J. Tompkin, B. Bickel, and H. Pfister,
“Computational design of walking automata,” presented at the SCA: ACM SIGGRAPH/Eurographics
Symposium on Computer animation, Los Angeles, CA, United States, 2015, pp. 93–100.'
ista: 'Bharaj G, Coros S, Thomaszewski B, Tompkin J, Bickel B, Pfister H. 2015.
Computational design of walking automata. SCA: ACM SIGGRAPH/Eurographics Symposium
on Computer animation, 93–100.'
mla: Bharaj, Gaurav, et al. Computational Design of Walking Automata. ACM,
2015, pp. 93–100, doi:10.1145/2786784.2786803.
short: G. Bharaj, S. Coros, B. Thomaszewski, J. Tompkin, B. Bickel, H. Pfister,
in:, ACM, 2015, pp. 93–100.
conference:
end_date: 2015-08-09
location: Los Angeles, CA, United States
name: 'SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation'
start_date: 2015-08-07
date_created: 2018-12-11T11:52:30Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2021-01-12T06:51:21Z
day: '01'
department:
- _id: BeBi
doi: 10.1145/2786784.2786803
language:
- iso: eng
month: '08'
oa_version: None
page: 93 - 100
publication_identifier:
isbn:
- 978-1-4503-3496-9
publication_status: published
publisher: ACM
publist_id: '5655'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computational design of walking automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1532'
abstract:
- lang: eng
text: Ammonium is the major nitrogen source in some plant ecosystems but is toxic
at high concentrations, especially when available as the exclusive nitrogen source.
Ammonium stress rapidly leads to various metabolic and hormonal imbalances that
ultimately inhibit root and shoot growth in many plant species, including Arabidopsis
thaliana (L.) Heynh. To identify molecular and genetic factors involved in seedling
survival with prolonged exclusive NH4+ nutrition, a transcriptomic analysis with
microarrays was used. Substantial transcriptional differences were most pronounced
in (NH4)2SO4-grown seedlings, compared with plants grown on KNO3 or NH4NO3. Consistent
with previous physiological analyses, major differences in the expression modules
of photosynthesis-related genes, an altered mitochondrial metabolism, differential
expression of the primary NH4+ assimilation, alteration of transporter gene expression
and crucial changes in cell wall biosynthesis were found. A major difference in
plant hormone responses, particularly of auxin but not cytokinin, was striking.
The activity of the DR5::GUS reporter revealed a dramatically decreased auxin
response in (NH4)2SO4-grown primary roots. The impaired root growth on (NH4)2SO4
was partially rescued by exogenous auxin or in specific mutants in the auxin pathway.
The data suggest that NH4+-induced nutritional and metabolic imbalances can be
partially overcome by elevated auxin levels.
article_processing_charge: No
article_type: original
author:
- first_name: Huaiyu
full_name: Yang, Huaiyu
last_name: Yang
- first_name: Jenny
full_name: Von Der Fecht Bartenbach, Jenny
last_name: Von Der Fecht Bartenbach
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Jan
full_name: Lohmann, Jan
last_name: Lohmann
- first_name: Benjamin
full_name: Neuhäuser, Benjamin
last_name: Neuhäuser
- first_name: Uwe
full_name: Ludewig, Uwe
last_name: Ludewig
citation:
ama: Yang H, Von Der Fecht Bartenbach J, Friml J, Lohmann J, Neuhäuser B, Ludewig
U. Auxin-modulated root growth inhibition in Arabidopsis thaliana seedlings with
ammonium as the sole nitrogen source. Functional Plant Biology. 2015;42(3):239-251.
doi:10.1071/FP14171
apa: Yang, H., Von Der Fecht Bartenbach, J., Friml, J., Lohmann, J., Neuhäuser,
B., & Ludewig, U. (2015). Auxin-modulated root growth inhibition in Arabidopsis
thaliana seedlings with ammonium as the sole nitrogen source. Functional Plant
Biology. CSIRO. https://doi.org/10.1071/FP14171
chicago: Yang, Huaiyu, Jenny Von Der Fecht Bartenbach, Jiří Friml, Jan Lohmann,
Benjamin Neuhäuser, and Uwe Ludewig. “Auxin-Modulated Root Growth Inhibition in
Arabidopsis Thaliana Seedlings with Ammonium as the Sole Nitrogen Source.” Functional
Plant Biology. CSIRO, 2015. https://doi.org/10.1071/FP14171.
ieee: H. Yang, J. Von Der Fecht Bartenbach, J. Friml, J. Lohmann, B. Neuhäuser,
and U. Ludewig, “Auxin-modulated root growth inhibition in Arabidopsis thaliana
seedlings with ammonium as the sole nitrogen source,” Functional Plant Biology,
vol. 42, no. 3. CSIRO, pp. 239–251, 2015.
ista: Yang H, Von Der Fecht Bartenbach J, Friml J, Lohmann J, Neuhäuser B, Ludewig
U. 2015. Auxin-modulated root growth inhibition in Arabidopsis thaliana seedlings
with ammonium as the sole nitrogen source. Functional Plant Biology. 42(3), 239–251.
mla: Yang, Huaiyu, et al. “Auxin-Modulated Root Growth Inhibition in Arabidopsis
Thaliana Seedlings with Ammonium as the Sole Nitrogen Source.” Functional Plant
Biology, vol. 42, no. 3, CSIRO, 2015, pp. 239–51, doi:10.1071/FP14171.
short: H. Yang, J. Von Der Fecht Bartenbach, J. Friml, J. Lohmann, B. Neuhäuser,
U. Ludewig, Functional Plant Biology 42 (2015) 239–251.
date_created: 2018-12-11T11:52:34Z
date_published: 2015-03-01T00:00:00Z
date_updated: 2022-05-24T09:02:24Z
day: '01'
department:
- _id: JiFr
doi: 10.1071/FP14171
external_id:
pmid:
- '32480670'
intvolume: ' 42'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 239 - 251
pmid: 1
publication: Functional Plant Biology
publication_identifier:
issn:
- 1445-4408
publication_status: published
publisher: CSIRO
publist_id: '5639'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin-modulated root growth inhibition in Arabidopsis thaliana seedlings with
ammonium as the sole nitrogen source
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2015'
...
---
_id: '1531'
abstract:
- lang: eng
text: The Heat Kernel Signature (HKS) is a scalar quantity which is derived from
the heat kernel of a given shape. Due to its robustness, isometry invariance,
and multiscale nature, it has been successfully applied in many geometric applications.
From a more general point of view, the HKS can be considered as a descriptor of
the metric of a Riemannian manifold. Given a symmetric positive definite tensor
field we may interpret it as the metric of some Riemannian manifold and thereby
apply the HKS to visualize and analyze the given tensor data. In this paper, we
propose a generalization of this approach that enables the treatment of indefinite
tensor fields, like the stress tensor, by interpreting them as a generator of
a positive definite tensor field. To investigate the usefulness of this approach
we consider the stress tensor from the two-point-load model example and from a
mechanical work piece.
alternative_title:
- Mathematics and Visualization
article_processing_charge: No
author:
- first_name: Valentin
full_name: Zobel, Valentin
last_name: Zobel
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
citation:
ama: 'Zobel V, Reininghaus J, Hotz I. Visualizing symmetric indefinite 2D tensor
fields using The Heat Kernel Signature. In: Hotz I, Schultz T, eds. Visualization
and Processing of Higher Order Descriptors for Multi-Valued Data. Vol 40.
1st ed. Springer; 2015:257-267. doi:10.1007/978-3-319-15090-1_13'
apa: Zobel, V., Reininghaus, J., & Hotz, I. (2015). Visualizing symmetric indefinite
2D tensor fields using The Heat Kernel Signature. In I. Hotz & T. Schultz
(Eds.), Visualization and Processing of Higher Order Descriptors for Multi-Valued
Data (1st ed., Vol. 40, pp. 257–267). Springer. https://doi.org/10.1007/978-3-319-15090-1_13
chicago: Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualizing Symmetric
Indefinite 2D Tensor Fields Using The Heat Kernel Signature.” In Visualization
and Processing of Higher Order Descriptors for Multi-Valued Data, edited by
Ingrid Hotz and Thomas Schultz, 1st ed., 40:257–67. Springer, 2015. https://doi.org/10.1007/978-3-319-15090-1_13.
ieee: V. Zobel, J. Reininghaus, and I. Hotz, “Visualizing symmetric indefinite 2D
tensor fields using The Heat Kernel Signature,” in Visualization and Processing
of Higher Order Descriptors for Multi-Valued Data, 1st ed., vol. 40, I. Hotz
and T. Schultz, Eds. Springer, 2015, pp. 257–267.
ista: 'Zobel V, Reininghaus J, Hotz I. 2015.Visualizing symmetric indefinite 2D
tensor fields using The Heat Kernel Signature. In: Visualization and Processing
of Higher Order Descriptors for Multi-Valued Data. Mathematics and Visualization,
vol. 40, 257–267.'
mla: Zobel, Valentin, et al. “Visualizing Symmetric Indefinite 2D Tensor Fields
Using The Heat Kernel Signature.” Visualization and Processing of Higher Order
Descriptors for Multi-Valued Data, edited by Ingrid Hotz and Thomas Schultz,
1st ed., vol. 40, Springer, 2015, pp. 257–67, doi:10.1007/978-3-319-15090-1_13.
short: V. Zobel, J. Reininghaus, I. Hotz, in:, I. Hotz, T. Schultz (Eds.), Visualization
and Processing of Higher Order Descriptors for Multi-Valued Data, 1st ed., Springer,
2015, pp. 257–267.
date_created: 2018-12-11T11:52:33Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2022-06-10T09:50:14Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-319-15090-1_13
edition: '1'
editor:
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
- first_name: Thomas
full_name: Schultz, Thomas
last_name: Schultz
intvolume: ' 40'
language:
- iso: eng
month: '01'
oa_version: None
page: 257 - 267
publication: Visualization and Processing of Higher Order Descriptors for Multi-Valued
Data
publication_identifier:
isbn:
- 978-3-319-15089-5
publication_status: published
publisher: Springer
publist_id: '5640'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visualizing symmetric indefinite 2D tensor fields using The Heat Kernel Signature
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 40
year: '2015'
...
---
_id: '1530'
abstract:
- lang: eng
text: In growing cells, protein synthesis and cell growth are typically not synchronous,
and, thus, protein concentrations vary over the cell division cycle. We have developed
a theoretical description of genetic regulatory systems in bacteria that explicitly
considers the cell division cycle to investigate its impact on gene expression.
We calculate the cell-to-cell variations arising from cells being at different
stages in the division cycle for unregulated genes and for basic regulatory mechanisms.
These variations contribute to the extrinsic noise observed in single-cell experiments,
and are most significant for proteins with short lifetimes. Negative autoregulation
buffers against variation of protein concentration over the division cycle, but
the effect is found to be relatively weak. Stronger buffering is achieved by an
increased protein lifetime. Positive autoregulation can strongly amplify such
variation if the parameters are set to values that lead to resonance-like behaviour.
For cooperative positive autoregulation, the concentration variation over the
division cycle diminishes the parameter region of bistability and modulates the
switching times between the two stable states. The same effects are seen for a
two-gene mutual-repression toggle switch. By contrast, an oscillatory circuit,
the repressilator, is only weakly affected by the division cycle.
article_number: '066003'
author:
- first_name: Veronika
full_name: Bierbaum, Veronika
id: 3FD04378-F248-11E8-B48F-1D18A9856A87
last_name: Bierbaum
- first_name: Stefan
full_name: Klumpp, Stefan
last_name: Klumpp
citation:
ama: Bierbaum V, Klumpp S. Impact of the cell division cycle on gene circuits. Physical
Biology. 2015;12(6). doi:10.1088/1478-3975/12/6/066003
apa: Bierbaum, V., & Klumpp, S. (2015). Impact of the cell division cycle on
gene circuits. Physical Biology. IOP Publishing Ltd. https://doi.org/10.1088/1478-3975/12/6/066003
chicago: Bierbaum, Veronika, and Stefan Klumpp. “Impact of the Cell Division Cycle
on Gene Circuits.” Physical Biology. IOP Publishing Ltd., 2015. https://doi.org/10.1088/1478-3975/12/6/066003.
ieee: V. Bierbaum and S. Klumpp, “Impact of the cell division cycle on gene circuits,”
Physical Biology, vol. 12, no. 6. IOP Publishing Ltd., 2015.
ista: Bierbaum V, Klumpp S. 2015. Impact of the cell division cycle on gene circuits.
Physical Biology. 12(6), 066003.
mla: Bierbaum, Veronika, and Stefan Klumpp. “Impact of the Cell Division Cycle on
Gene Circuits.” Physical Biology, vol. 12, no. 6, 066003, IOP Publishing
Ltd., 2015, doi:10.1088/1478-3975/12/6/066003.
short: V. Bierbaum, S. Klumpp, Physical Biology 12 (2015).
date_created: 2018-12-11T11:52:33Z
date_published: 2015-09-25T00:00:00Z
date_updated: 2021-01-12T06:51:25Z
day: '25'
department:
- _id: MiSi
doi: 10.1088/1478-3975/12/6/066003
intvolume: ' 12'
issue: '6'
language:
- iso: eng
month: '09'
oa_version: None
publication: Physical Biology
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '5641'
quality_controlled: '1'
scopus_import: 1
status: public
title: Impact of the cell division cycle on gene circuits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2015'
...
---
_id: '1539'
abstract:
- lang: eng
text: 'Many stochastic models of biochemical reaction networks contain some chemical
species for which the number of molecules that are present in the system can only
be finite (for instance due to conservation laws), but also other species that
can be present in arbitrarily large amounts. The prime example of such networks
are models of gene expression, which typically contain a small and finite number
of possible states for the promoter but an infinite number of possible states
for the amount of mRNA and protein. One of the main approaches to analyze such
models is through the use of equations for the time evolution of moments of the
chemical species. Recently, a new approach based on conditional moments of the
species with infinite state space given all the different possible states of the
finite species has been proposed. It was argued that this approach allows one
to capture more details about the full underlying probability distribution with
a smaller number of equations. Here, I show that the result that less moments
provide more information can only stem from an unnecessarily complicated description
of the system in the classical formulation. The foundation of this argument will
be the derivation of moment equations that describe the complete probability distribution
over the finite state space but only low-order moments over the infinite state
space. I will show that the number of equations that is needed is always less
than what was previously claimed and always less than the number of conditional
moment equations up to the same order. To support these arguments, a symbolic
algorithm is provided that can be used to derive minimal systems of unconditional
moment equations for models with partially finite state space. '
article_number: '244103'
author:
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
citation:
ama: Ruess J. Minimal moment equations for stochastic models of biochemical reaction
networks with partially finite state space. Journal of Chemical Physics.
2015;143(24). doi:10.1063/1.4937937
apa: Ruess, J. (2015). Minimal moment equations for stochastic models of biochemical
reaction networks with partially finite state space. Journal of Chemical Physics.
American Institute of Physics. https://doi.org/10.1063/1.4937937
chicago: Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical
Reaction Networks with Partially Finite State Space.” Journal of Chemical Physics.
American Institute of Physics, 2015. https://doi.org/10.1063/1.4937937.
ieee: J. Ruess, “Minimal moment equations for stochastic models of biochemical reaction
networks with partially finite state space,” Journal of Chemical Physics,
vol. 143, no. 24. American Institute of Physics, 2015.
ista: Ruess J. 2015. Minimal moment equations for stochastic models of biochemical
reaction networks with partially finite state space. Journal of Chemical Physics.
143(24), 244103.
mla: Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical
Reaction Networks with Partially Finite State Space.” Journal of Chemical Physics,
vol. 143, no. 24, 244103, American Institute of Physics, 2015, doi:10.1063/1.4937937.
short: J. Ruess, Journal of Chemical Physics 143 (2015).
date_created: 2018-12-11T11:52:36Z
date_published: 2015-12-22T00:00:00Z
date_updated: 2021-01-12T06:51:28Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1063/1.4937937
ec_funded: 1
file:
- access_level: open_access
checksum: 838657118ae286463a2b7737319f35ce
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:43Z
date_updated: 2020-07-14T12:45:01Z
file_id: '4641'
file_name: IST-2016-593-v1+1_Minimal_moment_equations.pdf
file_size: 605355
relation: main_file
file_date_updated: 2020-07-14T12:45:01Z
has_accepted_license: '1'
intvolume: ' 143'
issue: '24'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
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: Journal of Chemical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '5632'
pubrep_id: '593'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimal moment equations for stochastic models of biochemical reaction networks
with partially finite state space
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 143
year: '2015'
...
---
_id: '1534'
abstract:
- lang: eng
text: PIN proteins are auxin export carriers that direct intercellular auxin flow
and in turn regulate many aspects of plant growth and development including responses
to environmental changes. The Arabidopsis R2R3-MYB transcription factor FOUR LIPS
(FLP) and its paralogue MYB88 regulate terminal divisions during stomatal development,
as well as female reproductive development and stress responses. Here we show
that FLP and MYB88 act redundantly but differentially in regulating the transcription
of PIN3 and PIN7 in gravity-sensing cells of primary and lateral roots. On the
one hand, FLP is involved in responses to gravity stimulation in primary roots,
whereas on the other, FLP and MYB88 function complementarily in establishing the
gravitropic set-point angles of lateral roots. Our results support a model in
which FLP and MYB88 expression specifically determines the temporal-spatial patterns
of PIN3 and PIN7 transcription that are closely associated with their preferential
functions during root responses to gravity.
article_number: '8822'
author:
- first_name: Hongzhe
full_name: Wang, Hongzhe
last_name: Wang
- first_name: Kezhen
full_name: Yang, Kezhen
last_name: Yang
- first_name: Junjie
full_name: Zou, Junjie
last_name: Zou
- first_name: Lingling
full_name: Zhu, Lingling
last_name: Zhu
- first_name: Zidian
full_name: Xie, Zidian
last_name: Xie
- first_name: Miyoterao
full_name: Morita, Miyoterao
last_name: Morita
- first_name: Masao
full_name: Tasaka, Masao
last_name: Tasaka
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Erich
full_name: Grotewold, Erich
last_name: Grotewold
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Fred
full_name: Sack, Fred
last_name: Sack
- first_name: Jie
full_name: Le, Jie
last_name: Le
citation:
ama: Wang H, Yang K, Zou J, et al. Transcriptional regulation of PIN genes by FOUR
LIPS and MYB88 during Arabidopsis root gravitropism. Nature Communications.
2015;6. doi:10.1038/ncomms9822
apa: Wang, H., Yang, K., Zou, J., Zhu, L., Xie, Z., Morita, M., … Le, J. (2015).
Transcriptional regulation of PIN genes by FOUR LIPS and MYB88 during Arabidopsis
root gravitropism. Nature Communications. Nature Publishing Group. https://doi.org/10.1038/ncomms9822
chicago: Wang, Hongzhe, Kezhen Yang, Junjie Zou, Lingling Zhu, Zidian Xie, Miyoterao
Morita, Masao Tasaka, et al. “Transcriptional Regulation of PIN Genes by FOUR
LIPS and MYB88 during Arabidopsis Root Gravitropism.” Nature Communications.
Nature Publishing Group, 2015. https://doi.org/10.1038/ncomms9822.
ieee: H. Wang et al., “Transcriptional regulation of PIN genes by FOUR LIPS
and MYB88 during Arabidopsis root gravitropism,” Nature Communications,
vol. 6. Nature Publishing Group, 2015.
ista: Wang H, Yang K, Zou J, Zhu L, Xie Z, Morita M, Tasaka M, Friml J, Grotewold
E, Beeckman T, Vanneste S, Sack F, Le J. 2015. Transcriptional regulation of PIN
genes by FOUR LIPS and MYB88 during Arabidopsis root gravitropism. Nature Communications.
6, 8822.
mla: Wang, Hongzhe, et al. “Transcriptional Regulation of PIN Genes by FOUR LIPS
and MYB88 during Arabidopsis Root Gravitropism.” Nature Communications,
vol. 6, 8822, Nature Publishing Group, 2015, doi:10.1038/ncomms9822.
short: H. Wang, K. Yang, J. Zou, L. Zhu, Z. Xie, M. Morita, M. Tasaka, J. Friml,
E. Grotewold, T. Beeckman, S. Vanneste, F. Sack, J. Le, Nature Communications
6 (2015).
date_created: 2018-12-11T11:52:34Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2021-01-12T06:51:26Z
day: '18'
ddc:
- '570'
department:
- _id: JiFr
doi: 10.1038/ncomms9822
ec_funded: 1
file:
- access_level: open_access
checksum: 3c06735fc7cd7e482ca830cbd26001bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:07Z
date_updated: 2020-07-14T12:45:01Z
file_id: '5259'
file_name: IST-2016-485-v1+1_ncomms9822.pdf
file_size: 1852268
relation: main_file
file_date_updated: 2020-07-14T12:45:01Z
has_accepted_license: '1'
intvolume: ' 6'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 25716A02-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '282300'
name: Polarity and subcellular dynamics in plants
publication: Nature Communications
publication_status: published
publisher: Nature Publishing Group
publist_id: '5637'
pubrep_id: '485'
quality_controlled: '1'
scopus_import: 1
status: public
title: Transcriptional regulation of PIN genes by FOUR LIPS and MYB88 during Arabidopsis
root gravitropism
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: '1538'
abstract:
- lang: eng
text: Systems biology rests on the idea that biological complexity can be better
unraveled through the interplay of modeling and experimentation. However, the
success of this approach depends critically on the informativeness of the chosen
experiments, which is usually unknown a priori. Here, we propose a systematic
scheme based on iterations of optimal experiment design, flow cytometry experiments,
and Bayesian parameter inference to guide the discovery process in the case of
stochastic biochemical reaction networks. To illustrate the benefit of our methodology,
we apply it to the characterization of an engineered light-inducible gene expression
circuit in yeast and compare the performance of the resulting model with models
identified from nonoptimal experiments. In particular, we compare the parameter
posterior distributions and the precision to which the outcome of future experiments
can be predicted. Moreover, we illustrate how the identified stochastic model
can be used to determine light induction patterns that make either the average
amount of protein or the variability in a population of cells follow a desired
profile. Our results show that optimal experiment design allows one to derive
models that are accurate enough to precisely predict and regulate the protein
expression in heterogeneous cell populations over extended periods of time.
acknowledgement: 'J.R., F.P., and J.L. acknowledge support from the European Commission
under the Network of Excellence HYCON2 (highly-complex and networked control systems)
and SystemsX.ch under the SignalX Project. J.R. acknowledges support from the People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme
FP7/2007-2013 under REA (Research Executive Agency) Grant 291734. M.K. acknowledges
support from Human Frontier Science Program Grant RP0061/2011 (www.hfsp.org). '
author:
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Francesca
full_name: Parise, Francesca
last_name: Parise
- first_name: Andreas
full_name: Milias Argeitis, Andreas
last_name: Milias Argeitis
- first_name: Mustafa
full_name: Khammash, Mustafa
last_name: Khammash
- first_name: John
full_name: Lygeros, John
last_name: Lygeros
citation:
ama: Ruess J, Parise F, Milias Argeitis A, Khammash M, Lygeros J. Iterative experiment
design guides the characterization of a light-inducible gene expression circuit.
PNAS. 2015;112(26):8148-8153. doi:10.1073/pnas.1423947112
apa: Ruess, J., Parise, F., Milias Argeitis, A., Khammash, M., & Lygeros, J.
(2015). Iterative experiment design guides the characterization of a light-inducible
gene expression circuit. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1423947112
chicago: Ruess, Jakob, Francesca Parise, Andreas Milias Argeitis, Mustafa Khammash,
and John Lygeros. “Iterative Experiment Design Guides the Characterization of
a Light-Inducible Gene Expression Circuit.” PNAS. National Academy of Sciences,
2015. https://doi.org/10.1073/pnas.1423947112.
ieee: J. Ruess, F. Parise, A. Milias Argeitis, M. Khammash, and J. Lygeros, “Iterative
experiment design guides the characterization of a light-inducible gene expression
circuit,” PNAS, vol. 112, no. 26. National Academy of Sciences, pp. 8148–8153,
2015.
ista: Ruess J, Parise F, Milias Argeitis A, Khammash M, Lygeros J. 2015. Iterative
experiment design guides the characterization of a light-inducible gene expression
circuit. PNAS. 112(26), 8148–8153.
mla: Ruess, Jakob, et al. “Iterative Experiment Design Guides the Characterization
of a Light-Inducible Gene Expression Circuit.” PNAS, vol. 112, no. 26,
National Academy of Sciences, 2015, pp. 8148–53, doi:10.1073/pnas.1423947112.
short: J. Ruess, F. Parise, A. Milias Argeitis, M. Khammash, J. Lygeros, PNAS 112
(2015) 8148–8153.
date_created: 2018-12-11T11:52:36Z
date_published: 2015-06-30T00:00:00Z
date_updated: 2021-01-12T06:51:27Z
day: '30'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1073/pnas.1423947112
ec_funded: 1
external_id:
pmid:
- '26085136'
intvolume: ' 112'
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4491780/
month: '06'
oa: 1
oa_version: Submitted Version
page: 8148 - 8153
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5633'
quality_controlled: '1'
scopus_import: 1
status: public
title: Iterative experiment design guides the characterization of a light-inducible
gene expression circuit
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1535'
abstract:
- lang: eng
text: Neuronal and neuroendocrine L-type calcium channels (Cav1.2, Cav1.3) open
readily at relatively low membrane potentials and allow Ca2+ to enter the cells
near resting potentials. In this way, Cav1.2 and Cav1.3 shape the action potential
waveform, contribute to gene expression, synaptic plasticity, neuronal differentiation,
hormone secretion and pacemaker activity. In the chromaffin cells (CCs) of the
adrenal medulla, Cav1.3 is highly expressed and is shown to support most of the
pacemaking current that sustains action potential (AP) firings and part of the
catecholamine secretion. Cav1.3 forms Ca2+-nanodomains with the fast inactivating
BK channels and drives the resting SK currents. These latter set the inter-spike
interval duration between consecutive spikes during spontaneous firing and the
rate of spike adaptation during sustained depolarizations. Cav1.3 plays also a
primary role in the switch from “tonic” to “burst” firing that occurs in mouse
CCs when either the availability of voltage-gated Na channels (Nav) is reduced
or the β2 subunit featuring the fast inactivating BK channels is deleted. Here,
we discuss the functional role of these “neuronlike” firing modes in CCs and how
Cav1.3 contributes to them. The open issue is to understand how these novel firing
patterns are adapted to regulate the quantity of circulating catecholamines during
resting condition or in response to acute and chronic stress.
acknowledgement: This work was supported by the Italian MIUR (PRIN 2010/2011 project
2010JFYFY2) and the University of Torino.
article_processing_charge: No
article_type: original
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: Andrea
full_name: Marcantoni, Andrea
last_name: Marcantoni
- first_name: Emilio
full_name: Carbone, Emilio
last_name: Carbone
citation:
ama: Vandael DH, Marcantoni A, Carbone E. Cav1.3 channels as key regulators of neuron-like
firings and catecholamine release in chromaffin cells. Current Molecular Pharmacology.
2015;8(2):149-161. doi:10.2174/1874467208666150507105443
apa: Vandael, D. H., Marcantoni, A., & Carbone, E. (2015). Cav1.3 channels as
key regulators of neuron-like firings and catecholamine release in chromaffin
cells. Current Molecular Pharmacology. Bentham Science Publishers. https://doi.org/10.2174/1874467208666150507105443
chicago: Vandael, David H, Andrea Marcantoni, and Emilio Carbone. “Cav1.3 Channels
as Key Regulators of Neuron-like Firings and Catecholamine Release in Chromaffin
Cells.” Current Molecular Pharmacology. Bentham Science Publishers, 2015.
https://doi.org/10.2174/1874467208666150507105443.
ieee: D. H. Vandael, A. Marcantoni, and E. Carbone, “Cav1.3 channels as key regulators
of neuron-like firings and catecholamine release in chromaffin cells,” Current
Molecular Pharmacology, vol. 8, no. 2. Bentham Science Publishers, pp. 149–161,
2015.
ista: Vandael DH, Marcantoni A, Carbone E. 2015. Cav1.3 channels as key regulators
of neuron-like firings and catecholamine release in chromaffin cells. Current
Molecular Pharmacology. 8(2), 149–161.
mla: Vandael, David H., et al. “Cav1.3 Channels as Key Regulators of Neuron-like
Firings and Catecholamine Release in Chromaffin Cells.” Current Molecular Pharmacology,
vol. 8, no. 2, Bentham Science Publishers, 2015, pp. 149–61, doi:10.2174/1874467208666150507105443.
short: D.H. Vandael, A. Marcantoni, E. Carbone, Current Molecular Pharmacology 8
(2015) 149–161.
date_created: 2018-12-11T11:52:35Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2021-01-12T06:51:26Z
day: '01'
department:
- _id: PeJo
doi: 10.2174/1874467208666150507105443
external_id:
pmid:
- '25966692'
intvolume: ' 8'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5384372/
month: '10'
oa: 1
oa_version: Submitted Version
page: 149 - 161
pmid: 1
publication: Current Molecular Pharmacology
publication_status: published
publisher: Bentham Science Publishers
publist_id: '5636'
quality_controlled: '1'
scopus_import: 1
status: public
title: Cav1.3 channels as key regulators of neuron-like firings and catecholamine
release in chromaffin cells
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8
year: '2015'
...