---
_id: '1599'
abstract:
- lang: eng
text: "The addition of polysialic acid to N- and/or O-linked glycans, referred to
as polysialylation, is a rare posttranslational modification that is mainly known
to control the developmental plasticity of the nervous system. Here we show that
CCR7, the central chemokine receptor controlling immune cell trafficking to secondary
lymphatic organs, carries polysialic acid. This modification is essential for
the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking
is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed
lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function
analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited
conformation, which is released upon interaction with polysialic acid. Thus, we
describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic
basis.\r\n"
acknowledged_ssus:
- _id: SSU
acknowledgement: 'We thank S. Schüchner and E. Ogris for kindly providing the antibody
to GFP, M. Helmbrecht and A. Huber for providing Nrp2−/− mice, the IST Scientific
Support Facilities for excellent services, and J. Renkawitz and K. Vaahtomeri for
critically reading the manuscript. '
article_processing_charge: No
article_type: original
author:
- first_name: Eva
full_name: Kiermaier, Eva
id: 3EB04B78-F248-11E8-B48F-1D18A9856A87
last_name: Kiermaier
orcid: 0000-0001-6165-5738
- first_name: Christine
full_name: Moussion, Christine
id: 3356F664-F248-11E8-B48F-1D18A9856A87
last_name: Moussion
- first_name: Christopher
full_name: Veldkamp, Christopher
last_name: Veldkamp
- first_name: Rita
full_name: Gerardy Schahn, Rita
last_name: Gerardy Schahn
- first_name: Ingrid
full_name: De Vries, Ingrid
id: 4C7D837E-F248-11E8-B48F-1D18A9856A87
last_name: De Vries
- first_name: Larry
full_name: Williams, Larry
last_name: Williams
- first_name: Gary
full_name: Chaffee, Gary
last_name: Chaffee
- first_name: Andrew
full_name: Phillips, Andrew
last_name: Phillips
- first_name: Friedrich
full_name: Freiberger, Friedrich
last_name: Freiberger
- first_name: Richard
full_name: Imre, Richard
last_name: Imre
- first_name: Deni
full_name: Taleski, Deni
last_name: Taleski
- first_name: Richard
full_name: Payne, Richard
last_name: Payne
- first_name: Asolina
full_name: Braun, Asolina
last_name: Braun
- first_name: Reinhold
full_name: Förster, Reinhold
last_name: Förster
- first_name: Karl
full_name: Mechtler, Karl
last_name: Mechtler
- first_name: Martina
full_name: Mühlenhoff, Martina
last_name: Mühlenhoff
- first_name: Brian
full_name: Volkman, Brian
last_name: Volkman
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Kiermaier E, Moussion C, Veldkamp C, et al. Polysialylation controls dendritic
cell trafficking by regulating chemokine recognition. Science. 2016;351(6269):186-190.
doi:10.1126/science.aad0512
apa: Kiermaier, E., Moussion, C., Veldkamp, C., Gerardy Schahn, R., de Vries, I.,
Williams, L., … Sixt, M. K. (2016). Polysialylation controls dendritic cell trafficking
by regulating chemokine recognition. Science. American Association for
the Advancement of Science. https://doi.org/10.1126/science.aad0512
chicago: Kiermaier, Eva, Christine Moussion, Christopher Veldkamp, Rita Gerardy
Schahn, Ingrid de Vries, Larry Williams, Gary Chaffee, et al. “Polysialylation
Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” Science.
American Association for the Advancement of Science, 2016. https://doi.org/10.1126/science.aad0512.
ieee: E. Kiermaier et al., “Polysialylation controls dendritic cell trafficking
by regulating chemokine recognition,” Science, vol. 351, no. 6269. American
Association for the Advancement of Science, pp. 186–190, 2016.
ista: Kiermaier E, Moussion C, Veldkamp C, Gerardy Schahn R, de Vries I, Williams
L, Chaffee G, Phillips A, Freiberger F, Imre R, Taleski D, Payne R, Braun A, Förster
R, Mechtler K, Mühlenhoff M, Volkman B, Sixt MK. 2016. Polysialylation controls
dendritic cell trafficking by regulating chemokine recognition. Science. 351(6269),
186–190.
mla: Kiermaier, Eva, et al. “Polysialylation Controls Dendritic Cell Trafficking
by Regulating Chemokine Recognition.” Science, vol. 351, no. 6269, American
Association for the Advancement of Science, 2016, pp. 186–90, doi:10.1126/science.aad0512.
short: E. Kiermaier, C. Moussion, C. Veldkamp, R. Gerardy Schahn, I. de Vries,
L. Williams, G. Chaffee, A. Phillips, F. Freiberger, R. Imre, D. Taleski, R. Payne,
A. Braun, R. Förster, K. Mechtler, M. Mühlenhoff, B. Volkman, M.K. Sixt, Science
351 (2016) 186–190.
corr_author: '1'
date_created: 2018-12-11T11:52:57Z
date_published: 2016-01-08T00:00:00Z
date_updated: 2025-09-18T11:01:30Z
day: '08'
department:
- _id: MiSi
doi: 10.1126/science.aad0512
ec_funded: 1
external_id:
isi:
- '000367806500045'
pmid:
- '26657283'
intvolume: ' 351'
isi: 1
issue: '6269'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5583642/
month: '01'
oa: 1
oa_version: Submitted Version
page: 186 - 190
pmid: 1
project:
- _id: 25A603A2-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '281556'
name: Cytoskeletal force generation and force transduction of migrating leukocytes
- _id: 25A76F58-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '289720'
name: Stromal Cell-immune Cell Interactions in Health and Disease
- _id: 25A8E5EA-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Y 564-B12
name: Cytoskeletal force generation and force transduction of migrating leukocytes
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5570'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Polysialylation controls dendritic cell trafficking by regulating chemokine
recognition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 351
year: '2016'
...
---
_id: '1608'
abstract:
- lang: eng
text: 'We show that the Anderson model has a transition from localization to delocalization
at exactly 2 dimensional growth rate on antitrees with normalized edge weights
which are certain discrete graphs. The kinetic part has a one-dimensional structure
allowing a description through transfer matrices which involve some Schur complement.
For such operators we introduce the notion of having one propagating channel and
extend theorems from the theory of one-dimensional Jacobi operators that relate
the behavior of transfer matrices with the spectrum. These theorems are then applied
to the considered model. In essence, in a certain energy region the kinetic part
averages the random potentials along shells and the transfer matrices behave similar
as for a one-dimensional operator with random potential of decaying variance.
At d dimensional growth for d>2 this effective decay is strong enough to obtain
absolutely continuous spectrum, whereas for some uniform d dimensional growth
with d<2 one has pure point spectrum in this energy region. At exactly uniform
2 dimensional growth also some singular continuous spectrum appears, at least
at small disorder. As a corollary we also obtain a change from singular spectrum
(d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type
rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete
adjacency operator (Laplacian) on ℤd and λ a random potential. '
article_processing_charge: No
arxiv: 1
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. Anderson transition at 2 dimensional growth rate on antitrees and
spectral theory for operators with one propagating channel. Annales Henri Poincare.
2016;17(7):1631-1675. doi:10.1007/s00023-015-0456-3
apa: Sadel, C. (2016). Anderson transition at 2 dimensional growth rate on antitrees
and spectral theory for operators with one propagating channel. Annales Henri
Poincare. Birkhäuser. https://doi.org/10.1007/s00023-015-0456-3
chicago: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on
Antitrees and Spectral Theory for Operators with One Propagating Channel.” Annales
Henri Poincare. Birkhäuser, 2016. https://doi.org/10.1007/s00023-015-0456-3.
ieee: C. Sadel, “Anderson transition at 2 dimensional growth rate on antitrees and
spectral theory for operators with one propagating channel,” Annales Henri
Poincare, vol. 17, no. 7. Birkhäuser, pp. 1631–1675, 2016.
ista: Sadel C. 2016. Anderson transition at 2 dimensional growth rate on antitrees
and spectral theory for operators with one propagating channel. Annales Henri
Poincare. 17(7), 1631–1675.
mla: Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees
and Spectral Theory for Operators with One Propagating Channel.” Annales Henri
Poincare, vol. 17, no. 7, Birkhäuser, 2016, pp. 1631–75, doi:10.1007/s00023-015-0456-3.
short: C. Sadel, Annales Henri Poincare 17 (2016) 1631–1675.
corr_author: '1'
date_created: 2018-12-11T11:53:00Z
date_published: 2016-07-01T00:00:00Z
date_updated: 2025-09-18T11:00:43Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00023-015-0456-3
ec_funded: 1
external_id:
arxiv:
- '1501.04287'
isi:
- '000377994000003'
intvolume: ' 17'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.04287
month: '07'
oa: 1
oa_version: Preprint
page: 1631 - 1675
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '5558'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anderson transition at 2 dimensional growth rate on antitrees and spectral
theory for operators with one propagating channel
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2016'
...
---
_id: '1612'
abstract:
- lang: eng
text: We prove that whenever A is a 3-conservative relational structure with only
binary and unary relations,then the algebra of polymorphisms of A either has no
Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety
(i.e.,CSP(A)has bounded width).
article_processing_charge: No
arxiv: 1
author:
- first_name: Alexandr
full_name: Kazda, Alexandr
id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87
last_name: Kazda
citation:
ama: Kazda A. CSP for binary conservative relational structures. Algebra Universalis.
2016;75(1):75-84. doi:10.1007/s00012-015-0358-8
apa: Kazda, A. (2016). CSP for binary conservative relational structures. Algebra
Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8
chicago: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra
Universalis. Springer, 2016. https://doi.org/10.1007/s00012-015-0358-8.
ieee: A. Kazda, “CSP for binary conservative relational structures,” Algebra
Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016.
ista: Kazda A. 2016. CSP for binary conservative relational structures. Algebra
Universalis. 75(1), 75–84.
mla: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra
Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8.
short: A. Kazda, Algebra Universalis 75 (2016) 75–84.
corr_author: '1'
date_created: 2018-12-11T11:53:01Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2025-09-18T11:00:04Z
day: '01'
department:
- _id: VlKo
doi: 10.1007/s00012-015-0358-8
external_id:
arxiv:
- '1112.1099'
isi:
- '000375422500006'
intvolume: ' 75'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1112.1099
month: '02'
oa: 1
oa_version: Preprint
page: 75 - 84
publication: Algebra Universalis
publication_status: published
publisher: Springer
publist_id: '5554'
quality_controlled: '1'
scopus_import: '1'
status: public
title: CSP for binary conservative relational structures
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 75
year: '2016'
...
---
_id: '1616'
abstract:
- lang: eng
text: The hippocampus plays a key role in learning and memory. Previous studies
suggested that the main types of principal neurons, dentate gyrus granule cells
(GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity
pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal
neurons. It has been assumed but never shown that such different activity may
be caused by differential synaptic excitation. To test this hypothesis, we performed
high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo.
In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired
action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were
silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine
the underlying mechanisms, we quantitatively assessed the frequency of spontaneous
excitatory synaptic input, the passive membrane properties, and the active membrane
characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3
and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition.
Thus, differential synaptic excitation is not responsible for differences in firing.
Moreover, the three types of hippocampal neurons markedly differed in their passive
properties. While GCs showed the most negative membrane potential, CA3 pyramidal
neurons had the highest input resistance and the slowest membrane time constant.
The three types of neurons also differed in the active membrane characteristics.
GCs showed the highest action potential threshold, but displayed the largest gain
of the input-output curves. In conclusion, our results reveal that differential
firing of the three main types of hippocampal principal neurons in vivo is not
primarily caused by differences in the characteristics of the synaptic input,
but by the distinct properties of synaptic integration and input-output transformation.
acknowledgement: "The authors thank Jose Guzman for critically reading prior versions
of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices,
A. Schlögl for efficient pro-gramming, F. Marr for technical assistance, and E. Kramberger
for manuscript editing."
article_processing_charge: No
author:
- first_name: Janina
full_name: Kowalski, Janina
id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
last_name: Kowalski
- first_name: Jian
full_name: Gan, Jian
id: 3614E438-F248-11E8-B48F-1D18A9856A87
last_name: Gan
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
citation:
ama: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties
determine hippocampal differential firing pattern in vivo in anesthetized rats.
Hippocampus. 2016;26(5):668-682. doi:10.1002/hipo.22550
apa: Kowalski, J., Gan, J., Jonas, P. M., & Pernia-Andrade, A. (2016). Intrinsic
membrane properties determine hippocampal differential firing pattern in vivo
in anesthetized rats. Hippocampus. Wiley. https://doi.org/10.1002/hipo.22550
chicago: Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade.
“Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern
in Vivo in Anesthetized Rats.” Hippocampus. Wiley, 2016. https://doi.org/10.1002/hipo.22550.
ieee: J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane
properties determine hippocampal differential firing pattern in vivo in anesthetized
rats,” Hippocampus, vol. 26, no. 5. Wiley, pp. 668–682, 2016.
ista: Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties
determine hippocampal differential firing pattern in vivo in anesthetized rats.
Hippocampus. 26(5), 668–682.
mla: Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal
Differential Firing Pattern in Vivo in Anesthetized Rats.” Hippocampus,
vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:10.1002/hipo.22550.
short: J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016)
668–682.
corr_author: '1'
date_created: 2018-12-11T11:53:03Z
date_published: 2016-05-01T00:00:00Z
date_updated: 2025-09-18T10:58:31Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22550
external_id:
isi:
- '000374666700011'
file:
- access_level: open_access
checksum: 284b72b12fbe15474833ed3d4549f86b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:47Z
date_updated: 2020-07-14T12:45:07Z
file_id: '5033'
file_name: IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf
file_size: 905348
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 26'
isi: 1
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 668 - 682
publication: Hippocampus
publication_identifier:
eissn:
- 1098-1063
issn:
- 1050-9631
publication_status: published
publisher: Wiley
publist_id: '5550'
pubrep_id: '469'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intrinsic membrane properties determine hippocampal differential firing pattern
in vivo in anesthetized rats
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 26
year: '2016'
...
---
_id: '1617'
abstract:
- lang: eng
text: 'We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d
is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of
equal measure and placing a random point inside each of the N=md cubes. We prove
that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d,
where the upper bound with an unspecified constant Cd was proven earlier by Beck.
Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality
and a suitably taylored Bernstein inequality; we have reasons to believe that
the upper bound has the sharp scaling in N. Additional heuristics suggest that
jittered sampling should be able to improve known bounds on the inverse of the
star-discrepancy in the regime N≳dd. We also prove a partition principle showing
that every partition of [0,1]d combined with a jittered sampling construction
gives rise to a set whose expected squared L2-discrepancy is smaller than that
of purely random points.'
acknowledgement: We are grateful to the referee whose suggestions greatly improved
the quality and clarity of the exposition.
article_processing_charge: No
arxiv: 1
author:
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
- first_name: Stefan
full_name: Steinerberger, Stefan
last_name: Steinerberger
citation:
ama: Pausinger F, Steinerberger S. On the discrepancy of jittered sampling. Journal
of Complexity. 2016;33:199-216. doi:10.1016/j.jco.2015.11.003
apa: Pausinger, F., & Steinerberger, S. (2016). On the discrepancy of jittered
sampling. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.11.003
chicago: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered
Sampling.” Journal of Complexity. Academic Press, 2016. https://doi.org/10.1016/j.jco.2015.11.003.
ieee: F. Pausinger and S. Steinerberger, “On the discrepancy of jittered sampling,”
Journal of Complexity, vol. 33. Academic Press, pp. 199–216, 2016.
ista: Pausinger F, Steinerberger S. 2016. On the discrepancy of jittered sampling.
Journal of Complexity. 33, 199–216.
mla: Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered
Sampling.” Journal of Complexity, vol. 33, Academic Press, 2016, pp. 199–216,
doi:10.1016/j.jco.2015.11.003.
short: F. Pausinger, S. Steinerberger, Journal of Complexity 33 (2016) 199–216.
date_created: 2018-12-11T11:53:03Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T10:57:52Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.jco.2015.11.003
external_id:
arxiv:
- '1510.00251'
isi:
- '000370090400011'
intvolume: ' 33'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1510.00251
month: '04'
oa: 1
oa_version: Submitted Version
page: 199 - 216
publication: Journal of Complexity
publication_status: published
publisher: Academic Press
publist_id: '5549'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the discrepancy of jittered sampling
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2016'
...
---
_id: '1620'
abstract:
- lang: eng
text: We consider the Bardeen–Cooper–Schrieffer free energy functional for particles
interacting via a two-body potential on a microscopic scale and in the presence
of weak external fields varying on a macroscopic scale. We study the influence
of the external fields on the critical temperature. We show that in the limit
where the ratio between the microscopic and macroscopic scale tends to zero, the
next to leading order of the critical temperature is determined by the lowest
eigenvalue of the linearization of the Ginzburg–Landau equation.
acknowledgement: The authors are grateful to I. M. Sigal for useful discussions. Financial
support from the US National Science Foundation through Grants PHY-1347399 and DMS-1363432
(R.L.F.), from the Danish council for independent research and from ERC Advanced
Grant 321029 (J.P.S.) is acknowledged.
article_processing_charge: No
arxiv: 1
author:
- first_name: Rupert
full_name: Frank, Rupert
last_name: Frank
- first_name: Christian
full_name: Hainzl, Christian
last_name: Hainzl
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: Frank R, Hainzl C, Seiringer R, Solovej J. The external field dependence of
the BCS critical temperature. Communications in Mathematical Physics. 2016;342(1):189-216.
doi:10.1007/s00220-015-2526-2
apa: Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2016). The external
field dependence of the BCS critical temperature. Communications in Mathematical
Physics. Springer. https://doi.org/10.1007/s00220-015-2526-2
chicago: Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “The
External Field Dependence of the BCS Critical Temperature.” Communications
in Mathematical Physics. Springer, 2016. https://doi.org/10.1007/s00220-015-2526-2.
ieee: R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “The external field dependence
of the BCS critical temperature,” Communications in Mathematical Physics,
vol. 342, no. 1. Springer, pp. 189–216, 2016.
ista: Frank R, Hainzl C, Seiringer R, Solovej J. 2016. The external field dependence
of the BCS critical temperature. Communications in Mathematical Physics. 342(1),
189–216.
mla: Frank, Rupert, et al. “The External Field Dependence of the BCS Critical Temperature.”
Communications in Mathematical Physics, vol. 342, no. 1, Springer, 2016,
pp. 189–216, doi:10.1007/s00220-015-2526-2.
short: R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Communications in Mathematical
Physics 342 (2016) 189–216.
date_created: 2018-12-11T11:53:04Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2025-09-18T10:57:14Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00220-015-2526-2
external_id:
arxiv:
- '1410.2352'
isi:
- '000369965600006'
intvolume: ' 342'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1410.2352
month: '02'
oa: 1
oa_version: Submitted Version
page: 189 - 216
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '5546'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The external field dependence of the BCS critical temperature
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 342
year: '2016'
...
---
_id: '1622'
abstract:
- lang: eng
text: We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities
for many-body quantum systems with fractional kinetic operators and homogeneous
interaction potentials, where no anti-symmetry on the wave functions is assumed.
These many-body inequalities imply interesting one-body interpolation inequalities,
and we show that the corresponding one- and many-body inequalities are actually
equivalent in certain cases.
acknowledgement: "We thank Jan Philip Solovej, Robert Seiringer and Vladimir Maz’ya
for helpful discussions, as well as Rupert Frank\r\nand the anonymous referee for
useful comments. Part of this work has been carried out during a visit at the Institut
Mittag-Leffler (Stockholm). D.L. acknowledges financial support by the grant KAW
2010.0063 from the Knut and Alice Wallenberg Foundation and the Swedish Research
Council grant no. 2013-4734. P.T.N. is supported by the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement no. 291734. F.P. acknowledges support from the ERC project
no. 321029 “The\r\nmathematics of the structure of matter”."
article_processing_charge: No
arxiv: 1
author:
- first_name: Douglas
full_name: Lundholm, Douglas
last_name: Lundholm
- first_name: Phan
full_name: Nam, Phan
id: 404092F4-F248-11E8-B48F-1D18A9856A87
last_name: Nam
- first_name: Fabian
full_name: Portmann, Fabian
last_name: Portmann
citation:
ama: Lundholm D, Nam P, Portmann F. Fractional Hardy–Lieb–Thirring and related Inequalities
for interacting systems. Archive for Rational Mechanics and Analysis. 2016;219(3):1343-1382.
doi:10.1007/s00205-015-0923-5
apa: Lundholm, D., Nam, P., & Portmann, F. (2016). Fractional Hardy–Lieb–Thirring
and related Inequalities for interacting systems. Archive for Rational Mechanics
and Analysis. Springer. https://doi.org/10.1007/s00205-015-0923-5
chicago: Lundholm, Douglas, Phan Nam, and Fabian Portmann. “Fractional Hardy–Lieb–Thirring
and Related Inequalities for Interacting Systems.” Archive for Rational Mechanics
and Analysis. Springer, 2016. https://doi.org/10.1007/s00205-015-0923-5.
ieee: D. Lundholm, P. Nam, and F. Portmann, “Fractional Hardy–Lieb–Thirring and
related Inequalities for interacting systems,” Archive for Rational Mechanics
and Analysis, vol. 219, no. 3. Springer, pp. 1343–1382, 2016.
ista: Lundholm D, Nam P, Portmann F. 2016. Fractional Hardy–Lieb–Thirring and related
Inequalities for interacting systems. Archive for Rational Mechanics and Analysis.
219(3), 1343–1382.
mla: Lundholm, Douglas, et al. “Fractional Hardy–Lieb–Thirring and Related Inequalities
for Interacting Systems.” Archive for Rational Mechanics and Analysis,
vol. 219, no. 3, Springer, 2016, pp. 1343–82, doi:10.1007/s00205-015-0923-5.
short: D. Lundholm, P. Nam, F. Portmann, Archive for Rational Mechanics and Analysis
219 (2016) 1343–1382.
corr_author: '1'
date_created: 2018-12-11T11:53:05Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2025-09-18T10:52:35Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s00205-015-0923-5
ec_funded: 1
external_id:
arxiv:
- '1501.04570'
isi:
- '000368535400010'
intvolume: ' 219'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1501.04570
month: '03'
oa: 1
oa_version: Submitted Version
page: 1343 - 1382
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Archive for Rational Mechanics and Analysis
publication_status: published
publisher: Springer
publist_id: '5542'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 219
year: '2016'
...
---
_id: '1631'
abstract:
- lang: eng
text: 'Ancestral processes are fundamental to modern population genetics and spatial
structure has been the subject of intense interest for many years. Despite this
interest, almost nothing is known about the distribution of the locations of pedigree
or genetic ancestors. Using both spatially continuous and stepping-stone models,
we show that the distribution of pedigree ancestors approaches a travelling wave,
for which we develop two alternative approximations. The speed and width of the
wave are sensitive to the local details of the model. After a short time, genetic
ancestors spread far more slowly than pedigree ancestors, ultimately diffusing
out with radius ## rather than spreading at constant speed. In contrast to the
wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the
local details of the models.'
article_processing_charge: No
author:
- first_name: Jerome
full_name: Kelleher, Jerome
last_name: Kelleher
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Amandine
full_name: Véber, Amandine
last_name: Véber
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: Kelleher J, Etheridge A, Véber A, Barton NH. Spread of pedigree versus genetic
ancestry in spatially distributed populations. Theoretical Population Biology.
2016;108:1-12. doi:10.1016/j.tpb.2015.10.008
apa: Kelleher, J., Etheridge, A., Véber, A., & Barton, N. H. (2016). Spread
of pedigree versus genetic ancestry in spatially distributed populations. Theoretical
Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2015.10.008
chicago: Kelleher, Jerome, Alison Etheridge, Amandine Véber, and Nicholas H Barton.
“Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.”
Theoretical Population Biology. Academic Press, 2016. https://doi.org/10.1016/j.tpb.2015.10.008.
ieee: J. Kelleher, A. Etheridge, A. Véber, and N. H. Barton, “Spread of pedigree
versus genetic ancestry in spatially distributed populations,” Theoretical
Population Biology, vol. 108. Academic Press, pp. 1–12, 2016.
ista: Kelleher J, Etheridge A, Véber A, Barton NH. 2016. Spread of pedigree versus
genetic ancestry in spatially distributed populations. Theoretical Population
Biology. 108, 1–12.
mla: Kelleher, Jerome, et al. “Spread of Pedigree versus Genetic Ancestry in Spatially
Distributed Populations.” Theoretical Population Biology, vol. 108, Academic
Press, 2016, pp. 1–12, doi:10.1016/j.tpb.2015.10.008.
short: J. Kelleher, A. Etheridge, A. Véber, N.H. Barton, Theoretical Population
Biology 108 (2016) 1–12.
corr_author: '1'
date_created: 2018-12-11T11:53:08Z
date_published: 2016-04-01T00:00:00Z
date_updated: 2025-09-18T10:51:58Z
day: '01'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2015.10.008
ec_funded: 1
external_id:
isi:
- '000372560000001'
file:
- access_level: open_access
checksum: 6a65ba187994d4ad86c1c509e0ff482a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:12Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4865'
file_name: IST-2016-465-v1+1_1-s2.0-S0040580915001094-main.pdf
file_size: 1684043
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 108'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 1 - 12
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '5524'
pubrep_id: '465'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Spread of pedigree versus genetic ancestry in spatially distributed populations
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 108
year: '2016'
...
---
_id: '1641'
abstract:
- lang: eng
text: The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant
growth and development including embryo and root patterning, lateral organ formation
and growth responses to environmental stimuli. Auxin is directionally transported
from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)]
and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations
are aligned with the direction of the auxin flow. Auxin itself regulates its own
transport by modulation of the expression and subcellular localization of the
auxin transporters. Increased auxin levels promote the transcription of PIN2 and
AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged
auxin exposure increases the turnover of PIN proteins and their degradation in
the vacuole. In this study, we applied a forward genetic approach, to identify
molecular components playing a role in the auxin-mediated degradation. We generated
EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations
and designed a screen for mutants with persistently strong fluorescent signals
of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin
2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation
mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and
established a role for auxin-mediated degradation in plant development.
acknowledgement: 'European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science
Foundation GAČR (GA13-40637S) to JF. '
article_processing_charge: No
author:
- first_name: Radka
full_name: Zemová, Radka
last_name: Zemová
- first_name: Marta
full_name: Zwiewka, Marta
last_name: Zwiewka
- first_name: Agnieszka
full_name: Bielach, Agnieszka
last_name: Bielach
- first_name: Hélène
full_name: Robert, Hélène
last_name: Robert
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. A forward genetic screen
for new regulators of auxin mediated degradation of auxin transport proteins in
Arabidopsis thaliana. Journal of Plant Growth Regulation. 2016;35(2):465-476.
doi:10.1007/s00344-015-9553-2
apa: Zemová, R., Zwiewka, M., Bielach, A., Robert, H., & Friml, J. (2016). A
forward genetic screen for new regulators of auxin mediated degradation of auxin
transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation.
Springer. https://doi.org/10.1007/s00344-015-9553-2
chicago: Zemová, Radka, Marta Zwiewka, Agnieszka Bielach, Hélène Robert, and Jiří
Friml. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation
of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal of Plant Growth
Regulation. Springer, 2016. https://doi.org/10.1007/s00344-015-9553-2.
ieee: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, and J. Friml, “A forward genetic
screen for new regulators of auxin mediated degradation of auxin transport proteins
in Arabidopsis thaliana,” Journal of Plant Growth Regulation, vol. 35,
no. 2. Springer, pp. 465–476, 2016.
ista: Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. 2016. A forward genetic
screen for new regulators of auxin mediated degradation of auxin transport proteins
in Arabidopsis thaliana. Journal of Plant Growth Regulation. 35(2), 465–476.
mla: Zemová, Radka, et al. “A Forward Genetic Screen for New Regulators of Auxin
Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal
of Plant Growth Regulation, vol. 35, no. 2, Springer, 2016, pp. 465–76, doi:10.1007/s00344-015-9553-2.
short: R. Zemová, M. Zwiewka, A. Bielach, H. Robert, J. Friml, Journal of Plant
Growth Regulation 35 (2016) 465–476.
corr_author: '1'
date_created: 2018-12-11T11:53:12Z
date_published: 2016-06-01T00:00:00Z
date_updated: 2025-09-18T10:51:26Z
day: '01'
ddc:
- '581'
department:
- _id: JiFr
doi: 10.1007/s00344-015-9553-2
external_id:
isi:
- '000376482300015'
file:
- access_level: open_access
checksum: 0dc6a300cde6536ceedd2bcdd2060efb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:34Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4695'
file_name: IST-2018-1001-v1+1_Zemova_JPlantGrowthRegul_2016_proofs.pdf
file_size: 5637591
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 35'
isi: 1
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Preprint
page: 465 - 476
publication: Journal of Plant Growth Regulation
publication_status: published
publisher: Springer
publist_id: '5512'
pubrep_id: '1001'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A forward genetic screen for new regulators of auxin mediated degradation of
auxin transport proteins in Arabidopsis thaliana
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 35
year: '2016'
...
---
_id: '1653'
abstract:
- lang: eng
text: "A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs
(ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x)
using a public hashing-key hk. Furthermore, there is a way to set up the hash
key hk to make it statistically binding on some arbitrary hidden position i, meaning
that: (1) the digest y completely determines the i’th bit (or symbol) of x so
that all pre-images of y have the same value in the i’th position, (2) it is computationally
infeasible to distinguish the position i on which hk is statistically binding
from any other position i’. Lastly, the hash should have a local opening property
analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should
be possible to create a short proof π that certifies the value of the i’th bit
(or symbol) of x without having to provide the entire input x. A similar primitive
called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC
’15) further supports dynamic updates of the hashed value. These tools, which
are interesting in their own right, also serve as one of the main technical components
in several recent works building advanced applications from indistinguishability
obfuscation (iO).\r\n\r\nThe prior constructions of SSB hashing and positional
accumulators required fully homomorphic encryption (FHE) and iO respectively.
In this work, we give new constructions of these tools based on well studied number-theoretic
assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction
from lossy/injective functions."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tatsuaki
full_name: Okamoto, Tatsuaki
last_name: Okamoto
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Brent
full_name: Waters, Brent
last_name: Waters
- first_name: Daniel
full_name: Wichs, Daniel
last_name: Wichs
citation:
ama: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically
binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145.
doi:10.1007/978-3-662-48797-6_6'
apa: 'Okamoto, T., Pietrzak, K. Z., Waters, B., & Wichs, D. (2016). New realizations
of somewhere statistically binding hashing and positional accumulators (Vol. 9452,
pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology
and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48797-6_6'
chicago: Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs.
“New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,”
9452:121–45. Springer, 2016. https://doi.org/10.1007/978-3-662-48797-6_6.
ieee: 'T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of
somewhere statistically binding hashing and positional accumulators,” presented
at the ASIACRYPT: Theory and Application of Cryptology and Information Security,
Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.'
ista: 'Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere
statistically binding hashing and positional accumulators. ASIACRYPT: Theory and
Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.'
mla: Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding
Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45,
doi:10.1007/978-3-662-48797-6_6.
short: T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp.
121–145.
conference:
end_date: 2015-12-03
location: Auckland, New Zealand
name: 'ASIACRYPT: Theory and Application of Cryptology and Information Security'
start_date: 2015-11-29
date_created: 2018-12-11T11:53:16Z
date_published: 2016-01-08T00:00:00Z
date_updated: 2025-09-23T09:40:30Z
day: '08'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.1007/978-3-662-48797-6_6
ec_funded: 1
external_id:
isi:
- '000375148100006'
file:
- access_level: open_access
checksum: a57711cb660c5b17b42bb47275a00180
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:05Z
date_updated: 2020-07-14T12:45:08Z
file_id: '4923'
file_name: IST-2016-677-v1+1_869.pdf
file_size: 580088
relation: main_file
file_date_updated: 2020-07-14T12:45:08Z
has_accepted_license: '1'
intvolume: ' 9452'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 121 - 145
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '5497'
pubrep_id: '677'
quality_controlled: '1'
scopus_import: '1'
status: public
title: New realizations of somewhere statistically binding hashing and positional
accumulators
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9452
year: '2016'
...
---
_id: '1705'
abstract:
- lang: eng
text: Hybrid systems represent an important and powerful formalism for modeling
real-world applications such as embedded systems. A verification tool like SpaceEx
is based on the exploration of a symbolic search space (the region space). As
a verification tool, it is typically optimized towards proving the absence of
errors. In some settings, e.g., when the verification tool is employed in a feedback-directed
design cycle, one would like to have the option to call a version that is optimized
towards finding an error trajectory in the region space. A recent approach in
this direction is based on guided search. Guided search relies on a cost function
that indicates which states are promising to be explored, and preferably explores
more promising states first. In this paper, we propose an abstraction-based cost
function based on coarse-grained space abstractions for guiding the reachability
analysis. For this purpose, a suitable abstraction technique that exploits the
flexible granularity of modern reachability analysis algorithms is introduced.
The new cost function is an effective extension of pattern database approaches
that have been successfully applied in other areas. The approach has been implemented
in the SpaceEx model checker. The evaluation shows its practical potential.
article_processing_charge: Yes (via OA deal)
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Alexandre
full_name: Donzé, Alexandre
last_name: Donzé
- first_name: Goran
full_name: Frehse, Goran
last_name: Frehse
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
- first_name: Taylor
full_name: Johnson, Taylor
last_name: Johnson
- first_name: Hamed
full_name: Ladan, Hamed
last_name: Ladan
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Martin
full_name: Wehrle, Martin
last_name: Wehrle
citation:
ama: Bogomolov S, Donzé A, Frehse G, et al. Guided search for hybrid systems based
on coarse-grained space abstractions. International Journal on Software Tools
for Technology Transfer. 2016;18(4):449-467. doi:10.1007/s10009-015-0393-y
apa: Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H., …
Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space
abstractions. International Journal on Software Tools for Technology Transfer.
Springer. https://doi.org/10.1007/s10009-015-0393-y
chicago: Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson,
Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems
Based on Coarse-Grained Space Abstractions.” International Journal on Software
Tools for Technology Transfer. Springer, 2016. https://doi.org/10.1007/s10009-015-0393-y.
ieee: S. Bogomolov et al., “Guided search for hybrid systems based on coarse-grained
space abstractions,” International Journal on Software Tools for Technology
Transfer, vol. 18, no. 4. Springer, pp. 449–467, 2016.
ista: Bogomolov S, Donzé A, Frehse G, Grosu R, Johnson T, Ladan H, Podelski A, Wehrle
M. 2016. Guided search for hybrid systems based on coarse-grained space abstractions.
International Journal on Software Tools for Technology Transfer. 18(4), 449–467.
mla: Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained
Space Abstractions.” International Journal on Software Tools for Technology
Transfer, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:10.1007/s10009-015-0393-y.
short: S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski,
M. Wehrle, International Journal on Software Tools for Technology Transfer 18
(2016) 449–467.
corr_author: '1'
date_created: 2018-12-11T11:53:34Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-09-18T10:50:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s10009-015-0393-y
ec_funded: 1
external_id:
isi:
- '000379708300007'
file:
- access_level: open_access
checksum: 31561d7705599a9bd4ea816accc0752e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:26Z
date_updated: 2020-07-14T12:45:13Z
file_id: '5146'
file_name: IST-2016-457-v1+1_s10009-015-0393-y.pdf
file_size: 2296522
relation: main_file
file_date_updated: 2020-07-14T12:45:13Z
has_accepted_license: '1'
intvolume: ' 18'
isi: 1
issue: '4'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 449 - 467
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: International Journal on Software Tools for Technology Transfer
publication_status: published
publisher: Springer
publist_id: '5431'
pubrep_id: '457'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Guided search for hybrid systems based on coarse-grained space abstractions
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 18
year: '2016'
...
---
_id: '1707'
abstract:
- lang: eng
text: "Volunteer supporters play an important role in modern crisis and disaster
management. In the times of mobile Internet devices, help from thousands of volunteers
can be requested within a short time span, thus relieving professional helpers
from minor chores or geographically spread-out tasks. However, the simultaneous
availability of many volunteers also poses new problems. In particular, the volunteer
efforts must be well coordinated, or otherwise situations might emerge in which
too many idle volunteers at one location become more of a burden than a relief
to the professionals.\r\nIn this work, we study the task of optimally assigning
volunteers to selected locations, e.g. in order to perform regular measurements,
to report on damage, or to distribute information or resources to the population
in a crisis situation. We formulate the assignment tasks as an optimization problem
and propose an effective and efficient solution procedure. Experiments on real
data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show
the effectiveness and efficiency of our approach."
acknowledgement: The DRIVER FP7 project has received funding from the European Unions
Seventh Framework Programme for research, technological development and demonstration
under grant agreement no 607798. RE-ACTA was funded within the framework of the
Austrian Security Research Programme KIRAS by the Federal Ministry for Transport,
Innovation and Technology.
article_number: '7402041'
author:
- first_name: Jasmin
full_name: Pielorz, Jasmin
id: 49BC895A-F248-11E8-B48F-1D18A9856A87
last_name: Pielorz
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis
management. In: IEEE; 2016. doi:10.1109/ICT-DM.2015.7402041'
apa: 'Pielorz, J., & Lampert, C. (2016). Optimal geospatial allocation of volunteers
for crisis management. Presented at the ICT-DM: Information and Communication
Technologies for Disaster Management, Rennes, France: IEEE. https://doi.org/10.1109/ICT-DM.2015.7402041'
chicago: Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation
of Volunteers for Crisis Management.” IEEE, 2016. https://doi.org/10.1109/ICT-DM.2015.7402041.
ieee: 'J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for
crisis management,” presented at the ICT-DM: Information and Communication Technologies
for Disaster Management, Rennes, France, 2016.'
ista: 'Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for
crisis management. ICT-DM: Information and Communication Technologies for Disaster
Management, 7402041.'
mla: Pielorz, Jasmin, and Christoph Lampert. Optimal Geospatial Allocation of
Volunteers for Crisis Management. 7402041, IEEE, 2016, doi:10.1109/ICT-DM.2015.7402041.
short: J. Pielorz, C. Lampert, in:, IEEE, 2016.
conference:
end_date: 2015-12-02
location: Rennes, France
name: 'ICT-DM: Information and Communication Technologies for Disaster Management'
start_date: 2015-11-30
date_created: 2018-12-11T11:53:35Z
date_published: 2016-02-11T00:00:00Z
date_updated: 2021-01-12T06:52:39Z
day: '11'
department:
- _id: ChLa
doi: 10.1109/ICT-DM.2015.7402041
language:
- iso: eng
month: '02'
oa_version: None
publication_status: published
publisher: IEEE
publist_id: '5429'
quality_controlled: '1'
scopus_import: 1
status: public
title: Optimal geospatial allocation of volunteers for crisis management
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1881'
abstract:
- lang: eng
text: 'We consider random matrices of the form H=W+λV, λ∈ℝ+, where W is a real symmetric
or complex Hermitian Wigner matrix of size N and V is a real bounded diagonal
random matrix of size N with i.i.d.\ entries that are independent of W. We assume
subexponential decay for the matrix entries of W and we choose λ∼1, so that the
eigenvalues of W and λV are typically of the same order. Further, we assume that
the density of the entries of V is supported on a single interval and is convex
near the edges of its support. In this paper we prove that there is λ+∈ℝ+ such
that the largest eigenvalues of H are in the limit of large N determined by the
order statistics of V for λ>λ+. In particular, the largest eigenvalue of H
has a Weibull distribution in the limit N→∞ if λ>λ+. Moreover, for N sufficiently
large, we show that the eigenvectors associated to the largest eigenvalues are
partially localized for λ>λ+, while they are completely delocalized for λ<λ+.
Similar results hold for the lowest eigenvalues. '
acknowledgement: "Most of the presented work was obtained while Kevin Schnelli was
staying at the IAS with the support of\r\nThe Fund For Math."
article_processing_charge: No
arxiv: 1
author:
- first_name: Jioon
full_name: Lee, Jioon
last_name: Lee
- first_name: Kevin
full_name: Schnelli, Kevin
id: 434AD0AE-F248-11E8-B48F-1D18A9856A87
last_name: Schnelli
orcid: 0000-0003-0954-3231
citation:
ama: Lee J, Schnelli K. Extremal eigenvalues and eigenvectors of deformed Wigner
matrices. Probability Theory and Related Fields. 2016;164(1-2):165-241.
doi:10.1007/s00440-014-0610-8
apa: Lee, J., & Schnelli, K. (2016). Extremal eigenvalues and eigenvectors of
deformed Wigner matrices. Probability Theory and Related Fields. Springer.
https://doi.org/10.1007/s00440-014-0610-8
chicago: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors
of Deformed Wigner Matrices.” Probability Theory and Related Fields. Springer,
2016. https://doi.org/10.1007/s00440-014-0610-8.
ieee: J. Lee and K. Schnelli, “Extremal eigenvalues and eigenvectors of deformed
Wigner matrices,” Probability Theory and Related Fields, vol. 164, no.
1–2. Springer, pp. 165–241, 2016.
ista: Lee J, Schnelli K. 2016. Extremal eigenvalues and eigenvectors of deformed
Wigner matrices. Probability Theory and Related Fields. 164(1–2), 165–241.
mla: Lee, Jioon, and Kevin Schnelli. “Extremal Eigenvalues and Eigenvectors of Deformed
Wigner Matrices.” Probability Theory and Related Fields, vol. 164, no.
1–2, Springer, 2016, pp. 165–241, doi:10.1007/s00440-014-0610-8.
short: J. Lee, K. Schnelli, Probability Theory and Related Fields 164 (2016) 165–241.
corr_author: '1'
date_created: 2018-12-11T11:54:31Z
date_published: 2016-02-01T00:00:00Z
date_updated: 2025-09-18T10:46:46Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00440-014-0610-8
ec_funded: 1
external_id:
arxiv:
- '1310.7057'
isi:
- '000373163300006'
intvolume: ' 164'
isi: 1
issue: 1-2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.7057
month: '02'
oa: 1
oa_version: Preprint
page: 165 - 241
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: Probability Theory and Related Fields
publication_status: published
publisher: Springer
publist_id: '5215'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Extremal eigenvalues and eigenvectors of deformed Wigner matrices
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 164
year: '2016'
...
---
_id: '478'
abstract:
- lang: eng
text: 'Magic: the Gathering is a game about magical combat for any number of players.
Formally it is a zero-sum, imperfect information stochastic game that consists
of a potentially unbounded number of steps. We consider the problem of deciding
if a move is legal in a given single step of Magic. We show that the problem is
(a) coNP-complete in general; and (b) in P if either of two small sets of cards
are not used. Our lower bound holds even for single-player Magic games. The significant
aspects of our results are as follows: First, in most real-life game problems,
the task of deciding whether a given move is legal in a single step is trivial,
and the computationally hard task is to find the best sequence of legal moves
in the presence of multiple players. In contrast, quite uniquely our hardness
result holds for single step and with only one-player. Second, we establish efficient
algorithms for important special cases of Magic.'
alternative_title:
- Frontiers in Artificial Intelligence and Applications
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of deciding legality of a single
step of magic: The gathering. In: Vol 285. IOS Press; 2016:1432-1439. doi:10.3233/978-1-61499-672-9-1432'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2016). The complexity of deciding
legality of a single step of magic: The gathering (Vol. 285, pp. 1432–1439). Presented
at the ECAI: European Conference on Artificial Intelligence, The Hague, Netherlands:
IOS Press. https://doi.org/10.3233/978-1-61499-672-9-1432'
chicago: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering,” 285:1432–39. IOS Press, 2016.
https://doi.org/10.3233/978-1-61499-672-9-1432.'
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of deciding legality of
a single step of magic: The gathering,” presented at the ECAI: European Conference
on Artificial Intelligence, The Hague, Netherlands, 2016, vol. 285, pp. 1432–1439.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2016. The complexity of deciding legality of
a single step of magic: The gathering. ECAI: European Conference on Artificial
Intelligence, Frontiers in Artificial Intelligence and Applications, vol. 285,
1432–1439.'
mla: 'Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Deciding
Legality of a Single Step of Magic: The Gathering. Vol. 285, IOS Press, 2016,
pp. 1432–39, doi:10.3233/978-1-61499-672-9-1432.'
short: K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.
conference:
end_date: 2016-09-02
location: The Hague, Netherlands
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2016-08-29
corr_author: '1'
date_created: 2018-12-11T11:46:41Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2025-09-22T14:26:27Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.3233/978-1-61499-672-9-1432
external_id:
isi:
- '000385793700166'
file:
- access_level: open_access
checksum: 848043c812ace05e459579c923f3d3cf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:59Z
date_updated: 2020-07-14T12:46:35Z
file_id: '4658'
file_name: IST-2018-950-v1+1_2016_Chatterjee_The_complexity.pdf
file_size: 2116225
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 285'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '01'
oa: 1
oa_version: Published Version
page: 1432 - 1439
publication_status: published
publisher: IOS Press
publist_id: '7342'
pubrep_id: '950'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The complexity of deciding legality of a single step of magic: The gathering'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 285
year: '2016'
...
---
_id: '479'
abstract:
- lang: eng
text: Clinical guidelines and decision support systems (DSS) play an important role
in daily practices of medicine. Many text-based guidelines have been encoded for
work-flow simulation of DSS to automate health care. During the collaboration
with Carle hospital to develop a DSS, we identify that, for some complex and life-critical
diseases, it is highly desirable to automatically rigorously verify some complex
temporal properties in guidelines, which brings new challenges to current simulation
based DSS with limited support of automatical formal verification and real-time
data analysis. In this paper, we conduct the first study on applying runtime verification
to cooperate with current DSS based on real-time data. Within the proposed technique,
a user-friendly domain specific language, named DRTV, is designed to specify vital
real-time data sampled by medical devices and temporal properties originated from
clinical guidelines. Some interfaces are developed for data acquisition and communication.
Then, for medical practice scenarios described in DRTV model, we will automatically
generate event sequences and runtime property verifier automata. If a temporal
property violates, real-time warnings will be produced by the formal verifier
and passed to medical DSS. We have used DRTV to specify different kinds of medical
care scenarios, and applied the proposed technique to assist existing DSS. As
presented in experiment results, in terms of warning detection, it outperforms
the only use of DSS or human inspection, and improves the quality of clinical
health care of hospital
acknowledgement: "This work is supported by NSF CNS 13-30077, NSF CNS 13-29886, NSF
CNS 15-45002, and NSFC 61303014.\r\nThe authors thank Dr. Bobby and Dr. Hill at
Carle Hospital, Urbana, IL for their help with the discussion on medical knowledge.\r\n\r\n"
alternative_title:
- Proceedings International Conference on Software Engineering
article_processing_charge: No
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Rui
full_name: Wang, Rui
last_name: Wang
- first_name: Mohamad
full_name: Hosseini, Mohamad
last_name: Hosseini
- first_name: Jiaguang
full_name: Sun, Jiaguang
last_name: Sun
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: 'Jiang Y, Liu H, Kong H, et al. Use runtime verification to improve the quality
of medical care practice. In: Proceedings of the 38th International Conference
on Software Engineering Companion . IEEE; 2016:112-121. doi:10.1145/2889160.2889233'
apa: 'Jiang, Y., Liu, H., Kong, H., Wang, R., Hosseini, M., Sun, J., & Sha,
L. (2016). Use runtime verification to improve the quality of medical care practice.
In Proceedings of the 38th International Conference on Software Engineering
Companion (pp. 112–121). Austin, TX, USA: IEEE. https://doi.org/10.1145/2889160.2889233'
chicago: Jiang, Yu, Han Liu, Hui Kong, Rui Wang, Mohamad Hosseini, Jiaguang Sun,
and Lui Sha. “Use Runtime Verification to Improve the Quality of Medical Care
Practice.” In Proceedings of the 38th International Conference on Software
Engineering Companion , 112–21. IEEE, 2016. https://doi.org/10.1145/2889160.2889233.
ieee: Y. Jiang et al., “Use runtime verification to improve the quality of
medical care practice,” in Proceedings of the 38th International Conference
on Software Engineering Companion , Austin, TX, USA, 2016, pp. 112–121.
ista: 'Jiang Y, Liu H, Kong H, Wang R, Hosseini M, Sun J, Sha L. 2016. Use runtime
verification to improve the quality of medical care practice. Proceedings of the
38th International Conference on Software Engineering Companion . ICSE: International
Conference on Software Engineering, Proceedings International Conference on Software
Engineering, , 112–121.'
mla: Jiang, Yu, et al. “Use Runtime Verification to Improve the Quality of Medical
Care Practice.” Proceedings of the 38th International Conference on Software
Engineering Companion , IEEE, 2016, pp. 112–21, doi:10.1145/2889160.2889233.
short: Y. Jiang, H. Liu, H. Kong, R. Wang, M. Hosseini, J. Sun, L. Sha, in:, Proceedings
of the 38th International Conference on Software Engineering Companion , IEEE,
2016, pp. 112–121.
conference:
end_date: 2016-05-22
location: Austin, TX, USA
name: 'ICSE: International Conference on Software Engineering'
start_date: 2016-05-14
date_created: 2018-12-11T11:46:42Z
date_published: 2016-05-14T00:00:00Z
date_updated: 2025-09-22T14:22:48Z
day: '14'
department:
- _id: ToHe
doi: 10.1145/2889160.2889233
external_id:
isi:
- '000402155300016'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
page: 112 - 121
publication: 'Proceedings of the 38th International Conference on Software Engineering
Companion '
publication_status: published
publisher: IEEE
publist_id: '7341'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Use runtime verification to improve the quality of medical care practice
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '480'
abstract:
- lang: eng
text: Graph games provide the foundation for modeling and synthesizing reactive
processes. In the synthesis of stochastic reactive processes, the traditional
model is perfect-information stochastic games, where some transitions of the game
graph are controlled by two adversarial players, and the other transitions are
executed probabilistically. We consider such games where the objective is the
conjunction of several quantitative objectives (specified as mean-payoff conditions),
which we refer to as generalized mean-payoff objectives. The basic decision problem
asks for the existence of a finite-memory strategy for a player that ensures the
generalized mean-payoff objective be satisfied with a desired probability against
all strategies of the opponent. A special case of the decision problem is the
almost-sure problem where the desired probability is 1. Previous results presented
a semi-decision procedure for -approximations of the almost-sure problem. In this
work, we show that both the almost-sure problem as well as the general basic decision
problem are coNP-complete, significantly improving the previous results. Moreover,
we show that in the case of 1-player stochastic games, randomized memoryless strategies
are sufficient and the problem can be solved in polynomial time. In contrast,
in two-player stochastic games, we show that even with randomized strategies exponential
memory is required in general, and present a matching exponential upper bound.
We also study the basic decision problem with infinite-memory strategies and present
computational complexity results for the problem. Our results are relevant in
the synthesis of stochastic reactive systems with multiple quantitative requirements.
alternative_title:
- Proceedings Symposium on Logic in Computer Science
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Perfect-information stochastic games with generalized
mean-payoff objectives. In: Vol 05-08-July-2016. IEEE; 2016:247-256. doi:10.1145/2933575.2934513'
apa: 'Chatterjee, K., & Doyen, L. (2016). Perfect-information stochastic games
with generalized mean-payoff objectives (Vol. 05-08-July-2016, pp. 247–256). Presented
at the LICS: Logic in Computer Science, New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2934513'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives,” 05-08-July-2016:247–56. IEEE,
2016. https://doi.org/10.1145/2933575.2934513.
ieee: 'K. Chatterjee and L. Doyen, “Perfect-information stochastic games with generalized
mean-payoff objectives,” presented at the LICS: Logic in Computer Science, New
York, NY, USA, 2016, vol. 05-08-July-2016, pp. 247–256.'
ista: 'Chatterjee K, Doyen L. 2016. Perfect-information stochastic games with generalized
mean-payoff objectives. LICS: Logic in Computer Science, Proceedings Symposium
on Logic in Computer Science, vol. 05-08-July-2016, 247–256.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Perfect-Information Stochastic
Games with Generalized Mean-Payoff Objectives. Vol. 05-08-July-2016, IEEE,
2016, pp. 247–56, doi:10.1145/2933575.2934513.
short: K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.
conference:
end_date: 2016-07-08
location: New York, NY, USA
name: 'LICS: Logic in Computer Science'
start_date: 2016-07-05
date_created: 2018-12-11T11:46:42Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2025-09-22T14:22:08Z
day: '05'
department:
- _id: KrCh
doi: 10.1145/2933575.2934513
ec_funded: 1
external_id:
arxiv:
- '1604.06376'
isi:
- '000387609200025'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06376
month: '07'
oa: 1
oa_version: Preprint
page: 247 - 256
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: IEEE
publist_id: '7340'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Perfect-information stochastic games with generalized mean-payoff objectives
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 05-08-July-2016
year: '2016'
...
---
_id: '482'
abstract:
- lang: eng
text: Nonlinear electro-optical conversion of microwave radiation into the optical
telecommunication band is achieved within a crystalline whispering gallery mode
resonator, reaching 0.1% photon number conversion efficiency with MHz bandwidth.
alternative_title:
- Optics InfoBase Conference Papers
article_processing_charge: No
author:
- first_name: Alfredo
full_name: Rueda, Alfredo
last_name: Rueda
- first_name: Florian
full_name: Sedlmeir, Florian
last_name: Sedlmeir
- first_name: Michele
full_name: Collodo, Michele
last_name: Collodo
- first_name: Ulrich
full_name: Vogl, Ulrich
last_name: Vogl
- first_name: Birgit
full_name: Stiller, Birgit
last_name: Stiller
- first_name: Gerhard
full_name: Schunk, Gerhard
last_name: Schunk
- first_name: Dmitry
full_name: Strekalov, Dmitry
last_name: Strekalov
- first_name: Christoph
full_name: Marquardt, Christoph
last_name: Marquardt
- first_name: Johannes M
full_name: Fink, Johannes M
id: 4B591CBA-F248-11E8-B48F-1D18A9856A87
last_name: Fink
orcid: 0000-0001-8112-028X
- first_name: Oskar
full_name: Painter, Oskar
last_name: Painter
- first_name: Gerd
full_name: Leuchs, Gerd
last_name: Leuchs
- first_name: Harald
full_name: Schwefel, Harald
last_name: Schwefel
citation:
ama: 'Rueda A, Sedlmeir F, Collodo M, et al. Nonlinear single sideband microwave
to optical conversion using an electro-optic WGM-resonator. In: Optica Publishing
Group; 2016. doi:10.1364/NP.2016.NTh3A.6'
apa: 'Rueda, A., Sedlmeir, F., Collodo, M., Vogl, U., Stiller, B., Schunk, G., …
Schwefel, H. (2016). Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator. Presented at the NP: Nonlinear Photonics,
Sydney, Australia: Optica Publishing Group. https://doi.org/10.1364/NP.2016.NTh3A.6'
chicago: Rueda, Alfredo, Florian Sedlmeir, Michele Collodo, Ulrich Vogl, Birgit
Stiller, Gerhard Schunk, Dmitry Strekalov, et al. “Nonlinear Single Sideband Microwave
to Optical Conversion Using an Electro-Optic WGM-Resonator.” Optica Publishing
Group, 2016. https://doi.org/10.1364/NP.2016.NTh3A.6.
ieee: 'A. Rueda et al., “Nonlinear single sideband microwave to optical conversion
using an electro-optic WGM-resonator,” presented at the NP: Nonlinear Photonics,
Sydney, Australia, 2016.'
ista: 'Rueda A, Sedlmeir F, Collodo M, Vogl U, Stiller B, Schunk G, Strekalov D,
Marquardt C, Fink JM, Painter O, Leuchs G, Schwefel H. 2016. Nonlinear single
sideband microwave to optical conversion using an electro-optic WGM-resonator.
NP: Nonlinear Photonics, Optics InfoBase Conference Papers, .'
mla: Rueda, Alfredo, et al. Nonlinear Single Sideband Microwave to Optical Conversion
Using an Electro-Optic WGM-Resonator. Optica Publishing Group, 2016, doi:10.1364/NP.2016.NTh3A.6.
short: A. Rueda, F. Sedlmeir, M. Collodo, U. Vogl, B. Stiller, G. Schunk, D. Strekalov,
C. Marquardt, J.M. Fink, O. Painter, G. Leuchs, H. Schwefel, in:, Optica Publishing
Group, 2016.
conference:
end_date: 2016-09-08
location: Sydney, Australia
name: 'NP: Nonlinear Photonics'
start_date: 2016-09-05
date_created: 2018-12-11T11:46:43Z
date_published: 2016-08-29T00:00:00Z
date_updated: 2023-10-17T12:16:43Z
day: '29'
department:
- _id: JoFi
doi: 10.1364/NP.2016.NTh3A.6
language:
- iso: eng
month: '08'
oa_version: None
publication_status: published
publisher: Optica Publishing Group
publist_id: '7339'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nonlinear single sideband microwave to optical conversion using an electro-optic
WGM-resonator
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '510'
abstract:
- lang: eng
text: 'The CLE (CLAVATA3/Embryo Surrounding Region-related) peptides are small secreted
signaling peptides that are primarily involved in the regulation of stem cell
homeostasis in different plant meristems. Particularly, the characterization of
the CLE41-PXY/TDR signaling pathway has greatly advanced our understanding on
the potential roles of CLE peptides in vascular development and wood formation.
Nevertheless, our knowledge on this gene family in a tree species is limited.
In a recent study, we reported on a systematically investigation of the CLE gene
family in Populus trichocarpa . The potential roles of PtCLE genes were studied
by comparative analysis and transcriptional pro fi ling. Among fi fty PtCLE members,
many PtCLE proteins share identical CLE motifs or contain the same CLE motif as
that of AtCLEs, while PtCLE genes exhibited either comparable or distinct expression
patterns comparing to their Arabidopsis counterparts. These fi ndings indicate
the existence of both functional conservation and functional divergence between
PtCLEs and their AtCLE orthologues. Our results provide valuable resources for
future functional investigations of these critical signaling molecules in woody
plants. '
acknowledgement: 'We are grateful to Dr. Long (Laboratoire de Reproduction et Developpement
des Plantes,CNRS,INRA,ENSLyon,UCBL,Universite de Lyon,France)for critical reading
of the article. Work in our group is supported by the National Natural Science Foundation
of China (31271575; 31200902), the Fundamental Research Funds for the Central Univ
ersities (GK201103005), the Specialized Research Fund for the Doctoral Program of
Higher Education from the Ministry of Education of China (20120202120009), the Scientific
Research Foundation for the Returned Overseas Chinese Scholars, State Education
Ministry, and the Natural Science Basic Research Plan in Shaanxi Province of China
(2014JM3064). '
article_number: e1191734
article_processing_charge: No
author:
- first_name: Zhijun
full_name: Liu, Zhijun
last_name: Liu
- first_name: 'Nan'
full_name: Yang, Nan
last_name: Yang
- first_name: Yanting
full_name: Lv, Yanting
last_name: Lv
- first_name: Lixia
full_name: Pan, Lixia
last_name: Pan
- first_name: Shuo
full_name: Lv, Shuo
last_name: Lv
- first_name: Huibin
full_name: Han, Huibin
id: 31435098-F248-11E8-B48F-1D18A9856A87
last_name: Han
- first_name: Guodong
full_name: Wang, Guodong
last_name: Wang
citation:
ama: Liu Z, Yang N, Lv Y, et al. The CLE gene family in Populus trichocarpa. Plant
Signaling & Behavior. 2016;11(6). doi:10.1080/15592324.2016.1191734
apa: Liu, Z., Yang, N., Lv, Y., Pan, L., Lv, S., Han, H., & Wang, G. (2016).
The CLE gene family in Populus trichocarpa. Plant Signaling & Behavior.
Taylor & Francis. https://doi.org/10.1080/15592324.2016.1191734
chicago: Liu, Zhijun, Nan Yang, Yanting Lv, Lixia Pan, Shuo Lv, Huibin Han, and
Guodong Wang. “The CLE Gene Family in Populus Trichocarpa.” Plant Signaling
& Behavior. Taylor & Francis, 2016. https://doi.org/10.1080/15592324.2016.1191734.
ieee: Z. Liu et al., “The CLE gene family in Populus trichocarpa,” Plant
Signaling & Behavior, vol. 11, no. 6. Taylor & Francis, 2016.
ista: Liu Z, Yang N, Lv Y, Pan L, Lv S, Han H, Wang G. 2016. The CLE gene family
in Populus trichocarpa. Plant Signaling & Behavior. 11(6), e1191734.
mla: Liu, Zhijun, et al. “The CLE Gene Family in Populus Trichocarpa.” Plant
Signaling & Behavior, vol. 11, no. 6, e1191734, Taylor & Francis,
2016, doi:10.1080/15592324.2016.1191734.
short: Z. Liu, N. Yang, Y. Lv, L. Pan, S. Lv, H. Han, G. Wang, Plant Signaling &
Behavior 11 (2016).
date_created: 2018-12-11T11:46:53Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2025-09-22T14:21:19Z
day: '02'
department:
- _id: JiFr
doi: 10.1080/15592324.2016.1191734
external_id:
isi:
- '000378740600025'
intvolume: ' 11'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4973754/
month: '06'
oa: 1
oa_version: Submitted Version
publication: Plant Signaling & Behavior
publication_status: published
publisher: Taylor & Francis
publist_id: '7308'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The CLE gene family in Populus trichocarpa
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2016'
...
---
_id: '5445'
abstract:
- lang: eng
text: 'We consider the quantitative analysis problem for interprocedural control-flow
graphs (ICFGs). The input consists of an ICFG, a positive weight function that
assigns every transition a positive integer-valued number, and a labelling of
the transitions (events) as good, bad, and neutral events. The weight function
assigns to each transition a numerical value that represents ameasure of how good
or bad an event is. The quantitative analysis problem asks whether there is a
run of the ICFG where the ratio of the sum of the numerical weights of good events
versus the sum of weights of bad events in the long-run is at least a given threshold
(or equivalently, to compute the maximal ratio among all valid paths in the ICFG).
The quantitative analysis problem for ICFGs can be solved in polynomial time,
and we present an efficient and practical algorithm for the problem. We show that
several problems relevant for static program analysis, such as estimating the
worst-case execution time of a program or the average energy consumption of a
mobile application, can be modeled in our framework. We have implemented our algorithm
as a tool in the Java Soot framework. We demonstrate the effectiveness of our
approach with two case studies. First, we show that our framework provides a sound
approach (no false positives) for the analysis of inefficiently-used containers.
Second, we show that our approach can also be used for static profiling of programs
which reasons about methods that are frequently invoked. Our experimental results
show that our tool scales to relatively large benchmarks, and discovers relevant
and useful information that can be used to optimize performance of the programs. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis.
IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
apa: Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative
interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative
Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
ieee: K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural
analysis. IST Austria, 2016.
ista: Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural
analysis, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis.
IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
short: K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis,
IST Austria, 2016.
date_created: 2018-12-12T11:39:22Z
date_published: 2016-03-31T00:00:00Z
date_updated: 2025-04-15T08:11:41Z
day: '31'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-523-v1-1
file:
- access_level: open_access
checksum: cef516fa091925b5868813e355268fb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:52Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5513'
file_name: IST-2016-523-v1+1_main.pdf
file_size: 1012204
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '523'
related_material:
record:
- id: '1604'
relation: later_version
status: public
status: public
title: Quantitative interprocedural analysis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5449'
abstract:
- lang: eng
text: "The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population.\r\nThe
fixation probability is a fundamental quantity of natural selection, and known
to depend on the population structure.\r\nAmplifiers of natural selection are
population structures which increase the fixation probability of advantageous
mutants, as compared to the baseline case of well-mixed populations. In this work
we focus on symmetric population structures represented as undirected graphs.
In the regime of undirected graphs, the strongest amplifier known has been the
Star graph, and the existence of undirected graphs with stronger amplification
properties has remained open for over a decade.\r\nIn this work we present the
Comet and Comet-swarm families of undirected graphs. We show that for a range
of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation
probability strictly larger than the fixation probability of the Star graph, for
fixed population size and at the limit of large populations, respectively."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected
Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification
on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Amplification on Undirected Population Structures: Comets Beat Stars.
IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification
on undirected population structures: Comets beat stars. IST Austria, 2016.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on
undirected population structures: Comets beat stars, IST Austria, 22p.'
mla: 'Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures:
Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.'
short: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected
Population Structures: Comets Beat Stars, IST Austria, 2016.'
date_created: 2018-12-12T11:39:24Z
date_published: 2016-11-09T00:00:00Z
date_updated: 2025-09-18T09:50:09Z
day: '09'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-648-v1-1
file:
- access_level: open_access
checksum: 8345a8c1e7d7f0cd92516d182b7fc59e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:07Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5529'
file_name: IST-2016-648-v1+1_tr.pdf
file_size: 1264221
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Updated Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '648'
related_material:
record:
- id: '512'
relation: later_version
status: public
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...