---
_id: '2029'
abstract:
- lang: eng
text: Spin-wave theory is a key ingredient in our comprehension of quantum spin
systems, and is used successfully for understanding a wide range of magnetic phenomena,
including magnon condensation and stability of patterns in dipolar systems. Nevertheless,
several decades of research failed to establish the validity of spin-wave theory
rigorously, even for the simplest models of quantum spins. A rigorous justification
of the method for the three-dimensional quantum Heisenberg ferromagnet at low
temperatures is presented here. We derive sharp bounds on its free energy by combining
a bosonic formulation of the model introduced by Holstein and Primakoff with probabilistic
estimates and operator inequalities.
acknowledgement: 239694; ERC; European Research Council
article_number: '20003'
article_processing_charge: No
arxiv: 1
author:
- first_name: Michele
full_name: Correggi, Michele
last_name: Correggi
- first_name: Alessandro
full_name: Giuliani, Alessandro
last_name: Giuliani
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Correggi M, Giuliani A, Seiringer R. Validity of spin-wave theory for the quantum
Heisenberg model. EPL. 2014;108(2). doi:10.1209/0295-5075/108/20003
apa: Correggi, M., Giuliani, A., & Seiringer, R. (2014). Validity of spin-wave
theory for the quantum Heisenberg model. EPL. IOP Publishing. https://doi.org/10.1209/0295-5075/108/20003
chicago: Correggi, Michele, Alessandro Giuliani, and Robert Seiringer. “Validity
of Spin-Wave Theory for the Quantum Heisenberg Model.” EPL. IOP Publishing,
2014. https://doi.org/10.1209/0295-5075/108/20003.
ieee: M. Correggi, A. Giuliani, and R. Seiringer, “Validity of spin-wave theory
for the quantum Heisenberg model,” EPL, vol. 108, no. 2. IOP Publishing,
2014.
ista: Correggi M, Giuliani A, Seiringer R. 2014. Validity of spin-wave theory for
the quantum Heisenberg model. EPL. 108(2), 20003.
mla: Correggi, Michele, et al. “Validity of Spin-Wave Theory for the Quantum Heisenberg
Model.” EPL, vol. 108, no. 2, 20003, IOP Publishing, 2014, doi:10.1209/0295-5075/108/20003.
short: M. Correggi, A. Giuliani, R. Seiringer, EPL 108 (2014).
date_created: 2018-12-11T11:55:18Z
date_published: 2014-10-13T00:00:00Z
date_updated: 2025-09-29T11:55:55Z
day: '13'
department:
- _id: RoSe
doi: 10.1209/0295-5075/108/20003
external_id:
arxiv:
- '1404.4717'
isi:
- '000344913300003'
fulldoi: https://doi.org/10.1209/0295-5075/108/20003
intvolume: ' 108'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.4717
month: '10'
oa: 1
oa_version: Submitted Version
publication: EPL
publication_status: published
publisher: IOP Publishing
publist_id: '5044'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Validity of spin-wave theory for the quantum Heisenberg model
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 108
year: '2014'
...
---
_id: '2031'
abstract:
- lang: eng
text: A puzzling property of synaptic transmission, originally established at the
neuromuscular junction, is that the time course of transmitter release is independent
of the extracellular Ca2+ concentration ([Ca2+]o), whereas the rate of release
is highly [Ca2+]o-dependent. Here, we examine the time course of release at inhibitory
basket cell-Purkinje cell synapses and show that it is independent of [Ca2+]o.
Modeling of Ca2+-dependent transmitter release suggests that the invariant time
course of release critically depends on tight coupling between Ca2+ channels and
release sensors. Experiments with exogenous Ca2+ chelators reveal that channel-sensor
coupling at basket cell-Purkinje cell synapses is very tight, with a mean distance
of 10–20 nm. Thus, tight channel-sensor coupling provides a mechanistic explanation
for the apparent [Ca2+]o independence of the time course of release.
article_processing_charge: No
author:
- first_name: Itaru
full_name: Arai, Itaru
id: 32A73F6C-F248-11E8-B48F-1D18A9856A87
last_name: Arai
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Arai itaru, Jonas PM. Nanodomain coupling explains Ca^2+ independence of transmitter
release time course at a fast central synapse. eLife. 2014;3. doi:10.7554/eLife.04057
apa: Arai, itaru, & Jonas, P. M. (2014). Nanodomain coupling explains Ca^2+
independence of transmitter release time course at a fast central synapse. ELife.
eLife Sciences Publications. https://doi.org/10.7554/eLife.04057
chicago: Arai, itaru, and Peter M Jonas. “Nanodomain Coupling Explains Ca^2+ Independence
of Transmitter Release Time Course at a Fast Central Synapse.” ELife. eLife
Sciences Publications, 2014. https://doi.org/10.7554/eLife.04057.
ieee: itaru Arai and P. M. Jonas, “Nanodomain coupling explains Ca^2+ independence
of transmitter release time course at a fast central synapse,” eLife, vol.
3. eLife Sciences Publications, 2014.
ista: Arai itaru, Jonas PM. 2014. Nanodomain coupling explains Ca^2+ independence
of transmitter release time course at a fast central synapse. eLife. 3.
mla: Arai, itaru, and Peter M. Jonas. “Nanodomain Coupling Explains Ca^2+ Independence
of Transmitter Release Time Course at a Fast Central Synapse.” ELife, vol.
3, eLife Sciences Publications, 2014, doi:10.7554/eLife.04057.
short: itaru Arai, P.M. Jonas, ELife 3 (2014).
corr_author: '1'
date_created: 2018-12-11T11:55:19Z
date_published: 2014-12-09T00:00:00Z
date_updated: 2025-09-29T11:55:24Z
day: '09'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.7554/eLife.04057
ec_funded: 1
external_id:
isi:
- '000346170300007'
file:
- access_level: open_access
checksum: c240f915450d4ebe8f95043a2a8c7b1a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:41Z
date_updated: 2020-07-14T12:45:26Z
file_id: '5094'
file_name: IST-2016-421-v1+1_e04057.full.pdf
file_size: 2239563
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.7554/eLife.04057
has_accepted_license: '1'
intvolume: ' 3'
isi: 1
language:
- iso: eng
month: '12'
oa: 1
oa_version: Submitted Version
project:
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
publication: eLife
publication_status: published
publisher: eLife Sciences Publications
publist_id: '5041'
pubrep_id: '421'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nanodomain coupling explains Ca^2+ independence of transmitter release time
course at a fast central synapse
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3
year: '2014'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '2032'
abstract:
- lang: eng
text: As light-based control of fundamental signaling pathways is becoming a reality,
the field of optogenetics is rapidly moving beyond neuroscience. We have recently
developed receptor tyrosine kinases that are activated by light and control cell
proliferation, epithelial–mesenchymal transition, and angiogenic sprouting—cell
behaviors central to cancer progression.
article_number: e964045
article_processing_charge: Yes
article_type: original
author:
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
- first_name: Karin
full_name: Schelch, Karin
last_name: Schelch
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
- first_name: Michael
full_name: Grusch, Michael
last_name: Grusch
citation:
ama: 'Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M.
The optogenetic promise for oncology: Episode I. Molecular and Cellular Oncology.
2014;1(4). doi:10.4161/23723548.2014.964045'
apa: 'Inglés Prieto, Á., Gschaider-Reichhart, E., Schelch, K., Janovjak, H. L.,
& Grusch, M. (2014). The optogenetic promise for oncology: Episode I. Molecular
and Cellular Oncology. Taylor & Francis. https://doi.org/10.4161/23723548.2014.964045'
chicago: 'Inglés Prieto, Álvaro, Eva Gschaider-Reichhart, Karin Schelch, Harald
L Janovjak, and Michael Grusch. “The Optogenetic Promise for Oncology: Episode
I.” Molecular and Cellular Oncology. Taylor & Francis, 2014. https://doi.org/10.4161/23723548.2014.964045.'
ieee: 'Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H. L. Janovjak, and
M. Grusch, “The optogenetic promise for oncology: Episode I,” Molecular and
Cellular Oncology, vol. 1, no. 4. Taylor & Francis, 2014.'
ista: 'Inglés Prieto Á, Gschaider-Reichhart E, Schelch K, Janovjak HL, Grusch M.
2014. The optogenetic promise for oncology: Episode I. Molecular and Cellular
Oncology. 1(4), e964045.'
mla: 'Inglés Prieto, Álvaro, et al. “The Optogenetic Promise for Oncology: Episode
I.” Molecular and Cellular Oncology, vol. 1, no. 4, e964045, Taylor &
Francis, 2014, doi:10.4161/23723548.2014.964045.'
short: Á. Inglés Prieto, E. Gschaider-Reichhart, K. Schelch, H.L. Janovjak, M. Grusch,
Molecular and Cellular Oncology 1 (2014).
date_created: 2018-12-11T11:55:19Z
date_published: 2014-12-31T00:00:00Z
date_updated: 2025-05-20T07:37:40Z
day: '31'
ddc:
- '570'
department:
- _id: HaJa
doi: 10.4161/23723548.2014.964045
external_id:
pmid:
- '27308360'
file:
- access_level: open_access
checksum: 44e17ad40577ab46eb602e88a8b0b8fd
content_type: application/pdf
creator: kschuh
date_created: 2019-05-16T13:39:11Z
date_updated: 2020-07-14T12:45:26Z
file_id: '6464'
file_name: 2014_Taylor_Alvaro.pdf
file_size: 1765933
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.4161/23723548.2014.964045
has_accepted_license: '1'
intvolume: ' 1'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/3.0/
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Molecular and Cellular Oncology
publication_identifier:
eissn:
- 2372-3556
publication_status: published
publisher: Taylor & Francis
publist_id: '5040'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The optogenetic promise for oncology: Episode I'
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/3.0/legalcode
name: Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
short: CC BY-NC (3.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '2033'
abstract:
- lang: eng
text: 'The learning with privileged information setting has recently attracted a
lot of attention within the machine learning community, as it allows the integration
of additional knowledge into the training process of a classifier, even when this
comes in the form of a data modality that is not available at test time. Here,
we show that privileged information can naturally be treated as noise in the latent
function of a Gaussian process classifier (GPC). That is, in contrast to the standard
GPC setting, the latent function is not just a nuisance but a feature: it becomes
a natural measure of confidence about the training data by modulating the slope
of the GPC probit likelihood function. Extensive experiments on public datasets
show that the proposed GPC method using privileged noise, called GPC+, improves
over a standard GPC without privileged knowledge, and also over the current state-of-the-art
SVM-based method, SVM+. Moreover, we show that advanced neural networks and deep
learning methods can be compressed as privileged information.'
article_processing_charge: No
author:
- first_name: Daniel
full_name: Hernandez Lobato, Daniel
last_name: Hernandez Lobato
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Kristian
full_name: Kersting, Kristian
last_name: Kersting
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Novi
full_name: Quadrianto, Novi
last_name: Quadrianto
citation:
ama: 'Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. Mind
the nuisance: Gaussian process classification using privileged noise. In: Advances
in Neural Information Processing Systems. Vol 1. Neural Information Processing
Systems Foundation; 2014:837-845.'
apa: 'Hernandez Lobato, D., Sharmanska, V., Kersting, K., Lampert, C., & Quadrianto,
N. (2014). Mind the nuisance: Gaussian process classification using privileged
noise. In Advances in Neural Information Processing Systems (Vol. 1, pp.
837–845). Montreal, Canada: Neural Information Processing Systems Foundation.'
chicago: 'Hernandez Lobato, Daniel, Viktoriia Sharmanska, Kristian Kersting, Christoph
Lampert, and Novi Quadrianto. “Mind the Nuisance: Gaussian Process Classification
Using Privileged Noise.” In Advances in Neural Information Processing Systems,
1:837–45. Neural Information Processing Systems Foundation, 2014.'
ieee: 'D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, and N. Quadrianto,
“Mind the nuisance: Gaussian process classification using privileged noise,” in
Advances in Neural Information Processing Systems, Montreal, Canada, 2014,
vol. 1, no. January, pp. 837–845.'
ista: 'Hernandez Lobato D, Sharmanska V, Kersting K, Lampert C, Quadrianto N. 2014.
Mind the nuisance: Gaussian process classification using privileged noise. Advances
in Neural Information Processing Systems. NIPS: Neural Information Processing
Systems vol. 1, 837–845.'
mla: 'Hernandez Lobato, Daniel, et al. “Mind the Nuisance: Gaussian Process Classification
Using Privileged Noise.” Advances in Neural Information Processing Systems,
vol. 1, no. January, Neural Information Processing Systems Foundation, 2014, pp.
837–45.'
short: D. Hernandez Lobato, V. Sharmanska, K. Kersting, C. Lampert, N. Quadrianto,
in:, Advances in Neural Information Processing Systems, Neural Information Processing
Systems Foundation, 2014, pp. 837–845.
conference:
end_date: 2014-12-13
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2014-12-08
date_created: 2018-12-11T11:55:20Z
date_published: 2014-12-08T00:00:00Z
date_updated: 2025-06-03T11:45:29Z
day: '08'
department:
- _id: ChLa
intvolume: ' 1'
issue: January
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://papers.nips.cc/paper/5373-mind-the-nuisance-gaussian-process-classification-using-privileged-noise
month: '12'
oa: 1
oa_version: Submitted Version
page: 837-845
publication: Advances in Neural Information Processing Systems
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '5038'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mind the nuisance: Gaussian process classification using privileged noise'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '2039'
abstract:
- lang: eng
text: 'A fundamental question in biology is the following: what is the time scale
that is needed for evolutionary innovations? There are many results that characterize
single steps in terms of the fixation time of new mutants arising in populations
of certain size and structure. But here we ask a different question, which is
concerned with the much longer time scale of evolutionary trajectories: how long
does it take for a population exploring a fitness landscape to find target sequences
that encode new biological functions? Our key variable is the length, (Formula
presented.) of the genetic sequence that undergoes adaptation. In computer science
there is a crucial distinction between problems that require algorithms which
take polynomial or exponential time. The latter are considered to be intractable.
Here we develop a theoretical approach that allows us to estimate the time of
evolution as function of (Formula presented.) We show that adaptation on many
fitness landscapes takes time that is exponential in (Formula presented.) even
if there are broad selection gradients and many targets uniformly distributed
in sequence space. These negative results lead us to search for specific mechanisms
that allow evolution to work on polynomial time scales. We study a regeneration
process and show that it enables evolution to work in polynomial time.'
article_number: 7p
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Ben
full_name: Adlam, Ben
last_name: Adlam
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. The time scale of evolutionary
innovation. PLoS Computational Biology. 2014;10(9). doi:10.1371/journal.pcbi.1003818
apa: Chatterjee, K., Pavlogiannis, A., Adlam, B., & Nowak, M. (2014). The time
scale of evolutionary innovation. PLoS Computational Biology. Public Library
of Science. https://doi.org/10.1371/journal.pcbi.1003818
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, Ben Adlam, and Martin Nowak.
“The Time Scale of Evolutionary Innovation.” PLoS Computational Biology.
Public Library of Science, 2014. https://doi.org/10.1371/journal.pcbi.1003818.
ieee: K. Chatterjee, A. Pavlogiannis, B. Adlam, and M. Nowak, “The time scale of
evolutionary innovation,” PLoS Computational Biology, vol. 10, no. 9. Public
Library of Science, 2014.
ista: Chatterjee K, Pavlogiannis A, Adlam B, Nowak M. 2014. The time scale of evolutionary
innovation. PLoS Computational Biology. 10(9), 7p.
mla: Chatterjee, Krishnendu, et al. “The Time Scale of Evolutionary Innovation.”
PLoS Computational Biology, vol. 10, no. 9, 7p, Public Library of Science,
2014, doi:10.1371/journal.pcbi.1003818.
short: K. Chatterjee, A. Pavlogiannis, B. Adlam, M. Nowak, PLoS Computational Biology
10 (2014).
corr_author: '1'
date_created: 2018-12-11T11:55:22Z
date_published: 2014-09-11T00:00:00Z
date_updated: 2025-09-29T11:53:46Z
day: '11'
ddc:
- '510'
department:
- _id: KrCh
doi: 10.1371/journal.pcbi.1003818
ec_funded: 1
external_id:
isi:
- '000343011700018'
file:
- access_level: open_access
checksum: 712d4c5787ddf97809cfc962507f0738
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:35Z
date_updated: 2020-07-14T12:45:26Z
file_id: '4890'
file_name: IST-2016-440-v1+1_journal.pcbi.1003818.pdf
file_size: 1399093
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.1371/journal.pcbi.1003818
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '9'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5012'
pubrep_id: '440'
quality_controlled: '1'
related_material:
record:
- id: '9739'
relation: research_data
status: public
scopus_import: '1'
status: public
title: The time scale of evolutionary innovation
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: 10
year: '2014'
...
---
_id: '2040'
abstract:
- lang: eng
text: 'Development requires tissue growth as well as cell diversification. To address
how these processes are coordinated, we analyzed the development of molecularly
distinct domains of neural progenitors in the mouse and chick neural tube. We
show that during development, these domains undergo changes in size that do not
scale with changes in overall tissue size. Our data show that domain proportions
are first established by opposing morphogen gradients and subsequently controlled
by domain-specific regulation of differentiation rate but not differences in proliferation
rate. Regulation of differentiation rate is key to maintaining domain proportions
while accommodating both intra- and interspecies variations in size. Thus, the
sequential control of progenitor specification and differentiation elaborates
pattern without requiring that signaling gradients grow as tissues expand. '
article_number: '1254927'
article_processing_charge: No
author:
- first_name: Anna
full_name: Kicheva, Anna
last_name: Kicheva
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
- first_name: Ana
full_name: Ribeiro, Ana
last_name: Ribeiro
- first_name: Helena
full_name: Pérez Valle, Helena
last_name: Pérez Valle
- first_name: Robin
full_name: Lovell Badge, Robin
last_name: Lovell Badge
- first_name: Vasso
full_name: Episkopou, Vasso
last_name: Episkopou
- first_name: James
full_name: Briscoe, James
last_name: Briscoe
citation:
ama: Kicheva A, Bollenbach MT, Ribeiro A, et al. Coordination of progenitor specification
and growth in mouse and chick spinal cord. Science. 2014;345(6204). doi:10.1126/science.1254927
apa: Kicheva, A., Bollenbach, M. T., Ribeiro, A., Pérez Valle, H., Lovell Badge,
R., Episkopou, V., & Briscoe, J. (2014). Coordination of progenitor specification
and growth in mouse and chick spinal cord. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.1254927
chicago: Kicheva, Anna, Mark Tobias Bollenbach, Ana Ribeiro, Helena Pérez Valle,
Robin Lovell Badge, Vasso Episkopou, and James Briscoe. “Coordination of Progenitor
Specification and Growth in Mouse and Chick Spinal Cord.” Science. American
Association for the Advancement of Science, 2014. https://doi.org/10.1126/science.1254927.
ieee: A. Kicheva et al., “Coordination of progenitor specification and growth
in mouse and chick spinal cord,” Science, vol. 345, no. 6204. American
Association for the Advancement of Science, 2014.
ista: Kicheva A, Bollenbach MT, Ribeiro A, Pérez Valle H, Lovell Badge R, Episkopou
V, Briscoe J. 2014. Coordination of progenitor specification and growth in mouse
and chick spinal cord. Science. 345(6204), 1254927.
mla: Kicheva, Anna, et al. “Coordination of Progenitor Specification and Growth
in Mouse and Chick Spinal Cord.” Science, vol. 345, no. 6204, 1254927,
American Association for the Advancement of Science, 2014, doi:10.1126/science.1254927.
short: A. Kicheva, M.T. Bollenbach, A. Ribeiro, H. Pérez Valle, R. Lovell Badge,
V. Episkopou, J. Briscoe, Science 345 (2014).
date_created: 2018-12-11T11:55:22Z
date_published: 2014-09-26T00:00:00Z
date_updated: 2025-09-29T11:53:14Z
day: '26'
department:
- _id: ToBo
doi: 10.1126/science.1254927
external_id:
isi:
- '000342164500032'
fulldoi: https://doi.org/10.1126/science.1254927
intvolume: ' 345'
isi: 1
issue: '6204'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4228193/
month: '09'
oa: 1
oa_version: Submitted Version
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '5011'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coordination of progenitor specification and growth in mouse and chick spinal
cord
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 345
year: '2014'
...
---
_id: '2041'
abstract:
- lang: eng
text: The hippocampus mediates several higher brain functions, such as learning,
memory, and spatial coding. The input region of the hippocampus, the dentate gyrus,
plays a critical role in these processes. Several lines of evidence suggest that
the dentate gyrus acts as a preprocessor of incoming information, preparing it
for subsequent processing in CA3. For example, the dentate gyrus converts input
from the entorhinal cortex, where cells have multiple spatial fields, into the
spatially more specific place cell activity characteristic of the CA3 region.
Furthermore, the dentate gyrus is involved in pattern separation, transforming
relatively similar input patterns into substantially different output patterns.
Finally, the dentate gyrus produces a very sparse coding scheme in which only
a very small fraction of neurons are active at any one time.
article_number: 2p
article_processing_charge: No
author:
- 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: John
full_name: Lisman, John
last_name: Lisman
citation:
ama: Jonas PM, Lisman J. Structure, function and plasticity of hippocampal dentate
gyrus microcircuits. Frontiers in Neural Circuits. 2014;8. doi:10.3389/fncir.2014.00107
apa: Jonas, P. M., & Lisman, J. (2014). Structure, function and plasticity of
hippocampal dentate gyrus microcircuits. Frontiers in Neural Circuits.
Frontiers Research Foundation. https://doi.org/10.3389/fncir.2014.00107
chicago: Jonas, Peter M, and John Lisman. “Structure, Function and Plasticity of
Hippocampal Dentate Gyrus Microcircuits.” Frontiers in Neural Circuits.
Frontiers Research Foundation, 2014. https://doi.org/10.3389/fncir.2014.00107.
ieee: P. M. Jonas and J. Lisman, “Structure, function and plasticity of hippocampal
dentate gyrus microcircuits,” Frontiers in Neural Circuits, vol. 8. Frontiers
Research Foundation, 2014.
ista: Jonas PM, Lisman J. 2014. Structure, function and plasticity of hippocampal
dentate gyrus microcircuits. Frontiers in Neural Circuits. 8, 2p.
mla: Jonas, Peter M., and John Lisman. “Structure, Function and Plasticity of Hippocampal
Dentate Gyrus Microcircuits.” Frontiers in Neural Circuits, vol. 8, 2p,
Frontiers Research Foundation, 2014, doi:10.3389/fncir.2014.00107.
short: P.M. Jonas, J. Lisman, Frontiers in Neural Circuits 8 (2014).
corr_author: '1'
date_created: 2018-12-11T11:55:22Z
date_published: 2014-09-10T00:00:00Z
date_updated: 2025-09-29T11:52:44Z
day: '10'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.3389/fncir.2014.00107
external_id:
isi:
- '000341953300001'
file:
- access_level: open_access
checksum: 3ca57b164045523f876407e9f13a9fb8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:38Z
date_updated: 2020-07-14T12:45:26Z
file_id: '5294'
file_name: IST-2016-424-v1+1_fncir-08-00107.pdf
file_size: 201110
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.3389/fncir.2014.00107
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Frontiers in Neural Circuits
publication_status: published
publisher: Frontiers Research Foundation
publist_id: '5010'
pubrep_id: '424'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure, function and plasticity of hippocampal dentate gyrus microcircuits
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: 8
year: '2014'
...
---
_id: '2042'
abstract:
- lang: eng
text: 'Background: CRISPR is a microbial immune system likely to be involved in
host-parasite coevolution. It functions using target sequences encoded by the
bacterial genome, which interfere with invading nucleic acids using a homology-dependent
system. The system also requires protospacer associated motifs (PAMs), short motifs
close to the target sequence that are required for interference in CRISPR types
I and II. Here, we investigate whether PAMs are depleted in phage genomes due
to selection pressure to escape recognition.Results: To this end, we analyzed
two data sets. Phages infecting all bacterial hosts were analyzed first, followed
by a detailed analysis of phages infecting the genus Streptococcus, where PAMs
are best understood. We use two different measures of motif underrepresentation
that control for codon bias and the frequency of submotifs. We compare phages
infecting species with a particular CRISPR type to those infecting species without
that type. Since only known PAMs were investigated, the analysis is restricted
to CRISPR types I-C and I-E and in Streptococcus to types I-C and II. We found
evidence for PAM depletion in Streptococcus phages infecting hosts with CRISPR
type I-C, in Vibrio phages infecting hosts with CRISPR type I-E and in Streptococcus
thermopilus phages infecting hosts with type II-A, known as CRISPR3.Conclusions:
The observed motif depletion in phages with hosts having CRISPR can be attributed
to selection rather than to mutational bias, as mutational bias should affect
the phages of all hosts. This observation implies that the CRISPR system has been
efficient in the groups discussed here.'
article_number: '663'
article_processing_charge: No
author:
- first_name: Anne
full_name: Kupczok, Anne
id: 2BB22BC2-F248-11E8-B48F-1D18A9856A87
last_name: Kupczok
- first_name: Jonathan P
full_name: Bollback, Jonathan P
id: 2C6FA9CC-F248-11E8-B48F-1D18A9856A87
last_name: Bollback
orcid: 0000-0002-4624-4612
citation:
ama: Kupczok A, Bollback JP. Motif depletion in bacteriophages infecting hosts with
CRISPR systems. BMC Genomics. 2014;15(1). doi:10.1186/1471-2164-15-663
apa: Kupczok, A., & Bollback, J. P. (2014). Motif depletion in bacteriophages
infecting hosts with CRISPR systems. BMC Genomics. BioMed Central. https://doi.org/10.1186/1471-2164-15-663
chicago: Kupczok, Anne, and Jonathan P Bollback. “Motif Depletion in Bacteriophages
Infecting Hosts with CRISPR Systems.” BMC Genomics. BioMed Central, 2014.
https://doi.org/10.1186/1471-2164-15-663.
ieee: A. Kupczok and J. P. Bollback, “Motif depletion in bacteriophages infecting
hosts with CRISPR systems,” BMC Genomics, vol. 15, no. 1. BioMed Central,
2014.
ista: Kupczok A, Bollback JP. 2014. Motif depletion in bacteriophages infecting
hosts with CRISPR systems. BMC Genomics. 15(1), 663.
mla: Kupczok, Anne, and Jonathan P. Bollback. “Motif Depletion in Bacteriophages
Infecting Hosts with CRISPR Systems.” BMC Genomics, vol. 15, no. 1, 663,
BioMed Central, 2014, doi:10.1186/1471-2164-15-663.
short: A. Kupczok, J.P. Bollback, BMC Genomics 15 (2014).
corr_author: '1'
date_created: 2018-12-11T11:55:23Z
date_published: 2014-08-08T00:00:00Z
date_updated: 2025-09-29T11:52:17Z
day: '08'
ddc:
- '570'
department:
- _id: JoBo
doi: 10.1186/1471-2164-15-663
external_id:
isi:
- '000341528300001'
file:
- access_level: open_access
checksum: 3f6d2776b90a842a28359cc957d3d04b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:24Z
date_updated: 2020-07-14T12:45:26Z
file_id: '4878'
file_name: IST-2015-396-v1+1_1471-2164-15-663.pdf
file_size: 1489769
relation: main_file
file_date_updated: 2020-07-14T12:45:26Z
fulldoi: https://doi.org/10.1186/1471-2164-15-663
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
issue: '1'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: BMC Genomics
publication_status: published
publisher: BioMed Central
publist_id: '5009'
pubrep_id: '396'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Motif depletion in bacteriophages infecting hosts with CRISPR systems
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 15
year: '2014'
...
---
_id: '2043'
abstract:
- lang: eng
text: Persistent homology is a popular and powerful tool for capturing topological
features of data. Advances in algorithms for computing persistent homology have
reduced the computation time drastically – as long as the algorithm does not exhaust
the available memory. Following up on a recently presented parallel method for
persistence computation on shared memory systems [1], we demonstrate that a simple
adaption of the standard reduction algorithm leads to a variant for distributed
systems. Our algorithmic design ensures that the data is distributed over the
nodes without redundancy; this permits the computation of much larger instances
than on a single machine. Moreover, we observe that the parallelism at least compensates
for the overhead caused by communication between nodes, and often even speeds
up the computation compared to sequential and even parallel shared memory algorithms.
In our experiments, we were able to compute the persistent homology of filtrations
with more than a billion (109) elements within seconds on a cluster with 32 nodes
using less than 6GB of memory per node.
article_processing_charge: No
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
citation:
ama: 'Bauer U, Kerber M, Reininghaus J. Distributed computation of persistent homology.
In: McGeoch C, Meyer U, eds. Proceedings of the Workshop on Algorithm Engineering
and Experiments. Society for Industrial and Applied Mathematics; 2014:31-38.
doi:10.1137/1.9781611973198.4'
apa: 'Bauer, U., Kerber, M., & Reininghaus, J. (2014). Distributed computation
of persistent homology. In C. McGeoch & U. Meyer (Eds.), Proceedings of
the Workshop on Algorithm Engineering and Experiments (pp. 31–38). Portland,
USA: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973198.4'
chicago: Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Distributed Computation
of Persistent Homology.” In Proceedings of the Workshop on Algorithm Engineering
and Experiments, edited by Catherine McGeoch and Ulrich Meyer, 31–38. Society
for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973198.4.
ieee: U. Bauer, M. Kerber, and J. Reininghaus, “Distributed computation of persistent
homology,” in Proceedings of the Workshop on Algorithm Engineering and Experiments,
Portland, USA, 2014, pp. 31–38.
ista: 'Bauer U, Kerber M, Reininghaus J. 2014. Distributed computation of persistent
homology. Proceedings of the Workshop on Algorithm Engineering and Experiments.
ALENEX: Algorithm Engineering and Experiments, 31–38.'
mla: Bauer, Ulrich, et al. “Distributed Computation of Persistent Homology.” Proceedings
of the Workshop on Algorithm Engineering and Experiments, edited by Catherine McGeoch
and Ulrich Meyer, Society for Industrial and Applied Mathematics, 2014, pp. 31–38,
doi:10.1137/1.9781611973198.4.
short: U. Bauer, M. Kerber, J. Reininghaus, in:, C. McGeoch, U. Meyer (Eds.), Proceedings
of the Workshop on Algorithm Engineering and Experiments, Society for Industrial
and Applied Mathematics, 2014, pp. 31–38.
conference:
end_date: 2014-01-05
location: Portland, USA
name: 'ALENEX: Algorithm Engineering and Experiments'
start_date: 2014-01-05
date_created: 2018-12-11T11:55:23Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2025-06-11T08:03:07Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973198.4
ec_funded: 1
editor:
- first_name: Catherine
full_name: ' McGeoch, Catherine'
last_name: ' McGeoch'
- first_name: Ulrich
full_name: Meyer, Ulrich
last_name: Meyer
external_id:
arxiv:
- '1310.0710'
fulldoi: https://doi.org/10.1137/1.9781611973198.4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1310.0710
month: '01'
oa: 1
oa_version: Submitted Version
page: 31 - 38
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Workshop on Algorithm Engineering and Experiments
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '5008'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Distributed computation of persistent homology
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2044'
abstract:
- lang: eng
text: We present a parallel algorithm for computing the persistent homology of a
filtered chain complex. Our approach differs from the commonly used reduction
algorithm by first computing persistence pairs within local chunks, then simplifying
the unpaired columns, and finally applying standard reduction on the simplified
matrix. The approach generalizes a technique by Günther et al., which uses discrete
Morse Theory to compute persistence; we derive the same worst-case complexity
bound in a more general context. The algorithm employs several practical optimization
techniques, which are of independent interest. Our sequential implementation of
the algorithm is competitive with state-of-the-art methods, and we further improve
the performance through parallel computation.
article_processing_charge: No
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
orcid: 0000-0002-8030-9299
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
citation:
ama: 'Bauer U, Kerber M, Reininghaus J. Clear and Compress: Computing Persistent
Homology in Chunks. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological
Methods in Data Analysis and Visualization III. Mathematics and Visualization.
Springer; 2014:103-117. doi:10.1007/978-3-319-04099-8_7'
apa: 'Bauer, U., Kerber, M., & Reininghaus, J. (2014). Clear and Compress: Computing
Persistent Homology in Chunks. In P.-T. Bremer, I. Hotz, V. Pascucci, & R.
Peikert (Eds.), Topological Methods in Data Analysis and Visualization III
(pp. 103–117). Springer. https://doi.org/10.1007/978-3-319-04099-8_7'
chicago: 'Bauer, Ulrich, Michael Kerber, and Jan Reininghaus. “Clear and Compress:
Computing Persistent Homology in Chunks.” In Topological Methods in Data Analysis
and Visualization III, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci,
and Ronald Peikert, 103–17. Mathematics and Visualization. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_7.'
ieee: 'U. Bauer, M. Kerber, and J. Reininghaus, “Clear and Compress: Computing Persistent
Homology in Chunks,” in Topological Methods in Data Analysis and Visualization
III, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Springer, 2014,
pp. 103–117.'
ista: 'Bauer U, Kerber M, Reininghaus J. 2014.Clear and Compress: Computing Persistent
Homology in Chunks. In: Topological Methods in Data Analysis and Visualization
III. , 103–117.'
mla: 'Bauer, Ulrich, et al. “Clear and Compress: Computing Persistent Homology in
Chunks.” Topological Methods in Data Analysis and Visualization III, edited
by Peer-Timo Bremer et al., Springer, 2014, pp. 103–17, doi:10.1007/978-3-319-04099-8_7.'
short: U. Bauer, M. Kerber, J. Reininghaus, in:, P.-T. Bremer, I. Hotz, V. Pascucci,
R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III,
Springer, 2014, pp. 103–117.
corr_author: '1'
date_created: 2018-12-11T11:55:23Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2025-06-11T07:56:57Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_7
ec_funded: 1
editor:
- first_name: Peer-Timo
full_name: Bremer, Peer-Timo
last_name: Bremer
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
- first_name: Valerio
full_name: Pascucci, Valerio
last_name: Pascucci
- first_name: Ronald
full_name: Peikert, Ronald
last_name: Peikert
external_id:
arxiv:
- '1303.0477'
fulldoi: https://doi.org/10.1007/978-3-319-04099-8_7
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.0477
month: '03'
oa: 1
oa_version: Submitted Version
page: 103 - 117
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Topological Methods in Data Analysis and Visualization III
publication_status: published
publisher: Springer
publist_id: '5007'
quality_controlled: '1'
scopus_import: '1'
series_title: Mathematics and Visualization
status: public
title: 'Clear and Compress: Computing Persistent Homology in Chunks'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2045'
abstract:
- lang: eng
text: 'We introduce and study a new notion of enhanced chosen-ciphertext security
(ECCA) for public-key encryption. Loosely speaking, in the ECCA security experiment,
the decryption oracle provided to the adversary is augmented to return not only
the output of the decryption algorithm on a queried ciphertext but also of a randomness-recovery
algorithm associated to the scheme. Our results mainly concern the case where
the randomness-recovery algorithm is efficient. We provide constructions of ECCA-secure
encryption from adaptive trapdoor functions as defined by Kiltz et al. (EUROCRYPT
2010), resulting in ECCA encryption from standard number-theoretic assumptions.
We then give two applications of ECCA-secure encryption: (1) We use it as a unifying
concept in showing equivalence of adaptive trapdoor functions and tag-based adaptive
trapdoor functions, resolving an open question of Kiltz et al. (2) We show that
ECCA-secure encryption can be used to securely realize an approach to public-key
encryption with non-interactive opening (PKENO) originally suggested by Damgård
and Thorbek (EUROCRYPT 2007), resulting in new and practical PKENO schemes quite
different from those in prior work. Our results demonstrate that ECCA security
is of both practical and theoretical interest.'
acknowledgement: The second author was supported by EPSRC grant EP/H043454/1.
alternative_title:
- LNCS
author:
- first_name: Dana
full_name: Dachman Soled, Dana
last_name: Dachman Soled
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
- first_name: Payman
full_name: Mohassel, Payman
last_name: Mohassel
- first_name: Adam
full_name: O’Neill, Adam
last_name: O’Neill
citation:
ama: 'Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. Enhanced chosen-ciphertext
security and applications. In: Krawczyk H, ed. Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). Vol 8383. Springer; 2014:329-344. doi:10.1007/978-3-642-54631-0_19'
apa: 'Dachman Soled, D., Fuchsbauer, G., Mohassel, P., & O’Neill, A. (2014).
Enhanced chosen-ciphertext security and applications. In H. Krawczyk (Ed.), Lecture
Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) (Vol. 8383, pp. 329–344). Buenos Aires,
Argentina: Springer. https://doi.org/10.1007/978-3-642-54631-0_19'
chicago: Dachman Soled, Dana, Georg Fuchsbauer, Payman Mohassel, and Adam O’Neill.
“Enhanced Chosen-Ciphertext Security and Applications.” In Lecture Notes in
Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:329–44.
Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_19.
ieee: D. Dachman Soled, G. Fuchsbauer, P. Mohassel, and A. O’Neill, “Enhanced chosen-ciphertext
security and applications,” in Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Buenos Aires, Argentina, 2014, vol. 8383, pp. 329–344.
ista: 'Dachman Soled D, Fuchsbauer G, Mohassel P, O’Neill A. 2014. Enhanced chosen-ciphertext
security and applications. Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
PKC: Public Key Crypography, LNCS, vol. 8383, 329–344.'
mla: Dachman Soled, Dana, et al. “Enhanced Chosen-Ciphertext Security and Applications.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk,
vol. 8383, Springer, 2014, pp. 329–44, doi:10.1007/978-3-642-54631-0_19.
short: D. Dachman Soled, G. Fuchsbauer, P. Mohassel, A. O’Neill, in:, H. Krawczyk
(Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014,
pp. 329–344.
conference:
end_date: 2014-03-28
location: Buenos Aires, Argentina
name: 'PKC: Public Key Crypography'
start_date: 2014-03-26
date_created: 2018-12-11T11:55:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:57Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-54631-0_19
ec_funded: 1
editor:
- first_name: Hugo
full_name: Krawczyk, Hugo
last_name: Krawczyk
fulldoi: https://doi.org/10.1007/978-3-642-54631-0_19
intvolume: ' 8383'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2012/543
month: '01'
oa: 1
oa_version: Submitted Version
page: 329 - 344
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '5006'
quality_controlled: '1'
scopus_import: 1
status: public
title: Enhanced chosen-ciphertext security and applications
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8383
year: '2014'
...
---
_id: '2046'
abstract:
- lang: eng
text: 'We introduce policy-based signatures (PBS), where a signer can only sign
messages conforming to some authority-specified policy. The main requirements
are unforgeability and privacy, the latter meaning that signatures not reveal
the policy. PBS offers value along two fronts: (1) On the practical side, they
allow a corporation to control what messages its employees can sign under the
corporate key. (2) On the theoretical side, they unify existing work, capturing
other forms of signatures as special cases or allowing them to be easily built.
Our work focuses on definitions of PBS, proofs that this challenging primitive
is realizable for arbitrary policies, efficient constructions for specific policies,
and a few representative applications.'
acknowledgement: Part of his work was done while at Bristol University, supported
by EPSRC grant EP/H043454/1.
alternative_title:
- LNCS
author:
- first_name: Mihir
full_name: Bellare, Mihir
last_name: Bellare
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Bellare M, Fuchsbauer G. Policy-based signatures. In: Krawczyk H, ed. Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). Vol 8383. Springer; 2014:520-537. doi:10.1007/978-3-642-54631-0_30'
apa: 'Bellare, M., & Fuchsbauer, G. (2014). Policy-based signatures. In H. Krawczyk
(Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383,
pp. 520–537). Buenos Aires, Argentina: Springer. https://doi.org/10.1007/978-3-642-54631-0_30'
chicago: Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” In Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, 8383:520–37.
Springer, 2014. https://doi.org/10.1007/978-3-642-54631-0_30.
ieee: M. Bellare and G. Fuchsbauer, “Policy-based signatures,” in Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Buenos Aires, Argentina, 2014, vol.
8383, pp. 520–537.
ista: 'Bellare M, Fuchsbauer G. 2014. Policy-based signatures. Lecture Notes in
Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). PKC: Public Key Crypography, LNCS, vol.
8383, 520–537.'
mla: Bellare, Mihir, and Georg Fuchsbauer. “Policy-Based Signatures.” Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Hugo Krawczyk, vol. 8383,
Springer, 2014, pp. 520–37, doi:10.1007/978-3-642-54631-0_30.
short: M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Springer, 2014, pp. 520–537.
conference:
end_date: 2014-05-28
location: Buenos Aires, Argentina
name: 'PKC: Public Key Crypography'
start_date: 2014-05-26
date_created: 2018-12-11T11:55:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:54:57Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-642-54631-0_30
ec_funded: 1
editor:
- first_name: Hugo
full_name: Krawczyk, Hugo
last_name: Krawczyk
fulldoi: https://doi.org/10.1007/978-3-642-54631-0_30
intvolume: ' 8383'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2013/413
month: '01'
oa: 1
oa_version: Submitted Version
page: 520 - 537
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '5005'
quality_controlled: '1'
scopus_import: 1
status: public
title: Policy-based signatures
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8383
year: '2014'
...
---
_id: '2047'
abstract:
- lang: eng
text: Following the publication of an attack on genome-wide association studies
(GWAS) data proposed by Homer et al., considerable attention has been given to
developing methods for releasing GWAS data in a privacy-preserving way. Here,
we develop an end-to-end differentially private method for solving regression
problems with convex penalty functions and selecting the penalty parameters by
cross-validation. In particular, we focus on penalized logistic regression with
elastic-net regularization, a method widely used to in GWAS analyses to identify
disease-causing genes. We show how a differentially private procedure for penalized
logistic regression with elastic-net regularization can be applied to the analysis
of GWAS data and evaluate our method’s performance.
acknowledgement: This research was partially supported by BCS- 0941518 to the Department
of Statistics at Carnegie Mellon University.
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Fei
full_name: Yu, Fei
last_name: Yu
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Stephen
full_name: Fienberg, Stephen
last_name: Fienberg
citation:
ama: 'Yu F, Rybar M, Uhler C, Fienberg S. Differentially-private logistic regression
for detecting multiple-SNP association in GWAS databases. In: Domingo Ferrer J,
ed. Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8744. Springer;
2014:170-184. doi:10.1007/978-3-319-11257-2_14'
apa: 'Yu, F., Rybar, M., Uhler, C., & Fienberg, S. (2014). Differentially-private
logistic regression for detecting multiple-SNP association in GWAS databases.
In J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. https://doi.org/10.1007/978-3-319-11257-2_14'
chicago: Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private
Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.”
In Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep
Domingo Ferrer, 8744:170–84. Springer, 2014. https://doi.org/10.1007/978-3-319-11257-2_14.
ieee: F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic
regression for detecting multiple-SNP association in GWAS databases,” in Lecture
Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Ibiza, Spain, 2014, vol. 8744, pp. 170–184.
ista: 'Yu F, Rybar M, Uhler C, Fienberg S. 2014. Differentially-private logistic
regression for detecting multiple-SNP association in GWAS databases. Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). PSD: Privacy in Statistical Databases, LNCS,
vol. 8744, 170–184.'
mla: Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP
Association in GWAS Databases.” Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:10.1007/978-3-319-11257-2_14.
short: F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.
conference:
end_date: 2014-09-19
location: Ibiza, Spain
name: 'PSD: Privacy in Statistical Databases'
start_date: 2014-09-17
date_created: 2018-12-11T11:55:24Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2024-11-04T13:35:21Z
day: '01'
department:
- _id: KrPi
- _id: CaUh
doi: 10.1007/978-3-319-11257-2_14
editor:
- first_name: Josep
full_name: Domingo Ferrer, Josep
last_name: Domingo Ferrer
external_id:
arxiv:
- '1407.8067'
fulldoi: https://doi.org/10.1007/978-3-319-11257-2_14
intvolume: ' 8744'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1407.8067
month: '01'
oa: 1
oa_version: Submitted Version
page: 170 - 184
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: Genome-wide Analysis of Root Traits
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '5004'
quality_controlled: '1'
scopus_import: 1
status: public
title: Differentially-private logistic regression for detecting multiple-SNP association
in GWAS databases
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8744
year: '2014'
...
---
_id: '2050'
abstract:
- lang: eng
text: The flow instability and further transition to turbulence in a toroidal pipe
(torus) with curvature ratio (tube-to-coiling diameter) 0.049 is investigated
experimentally. The flow inside the toroidal pipe is driven by a steel sphere
fitted to the inner pipe diameter. The sphere is moved with constant azimuthal
velocity from outside the torus by a moving magnet. The experiment is designed
to investigate curved pipe flow by optical measurement techniques. Using stereoscopic
particle image velocimetry, laser Doppler velocimetry and pressure drop measurements,
the flow is measured for Reynolds numbers ranging from 1000 to 15 000. Time- and
space-resolved velocity fields are obtained and analysed. The steady axisymmetric
basic flow is strongly influenced by centrifugal effects. On an increase of the
Reynolds number we find a sequence of bifurcations. For Re=4075±2% a supercritical
bifurcation to an oscillatory flow is found in which waves travel in the streamwise
direction with a phase velocity slightly faster than the mean flow. The oscillatory
flow is superseded by a presumably quasi-periodic flow at a further increase of
the Reynolds number before turbulence sets in. The results are found to be compatible,
in general, with earlier experimental and numerical investigations on transition
to turbulence in helical and curved pipes. However, important aspects of the bifurcation
scenario differ considerably.
article_processing_charge: No
arxiv: 1
author:
- first_name: Jakob
full_name: Kühnen, Jakob
id: 3A47AE32-F248-11E8-B48F-1D18A9856A87
last_name: Kühnen
orcid: 0000-0003-4312-0179
- first_name: Markus
full_name: Holzner, Markus
last_name: Holzner
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
- first_name: Hendrik
full_name: Kuhlmann, Hendrik
last_name: Kuhlmann
citation:
ama: Kühnen J, Holzner M, Hof B, Kuhlmann H. Experimental investigation of transitional
flow in a toroidal pipe. Journal of Fluid Mechanics. 2014;738:463-491.
doi:10.1017/jfm.2013.603
apa: Kühnen, J., Holzner, M., Hof, B., & Kuhlmann, H. (2014). Experimental investigation
of transitional flow in a toroidal pipe. Journal of Fluid Mechanics. Cambridge
University Press. https://doi.org/10.1017/jfm.2013.603
chicago: Kühnen, Jakob, Markus Holzner, Björn Hof, and Hendrik Kuhlmann. “Experimental
Investigation of Transitional Flow in a Toroidal Pipe.” Journal of Fluid Mechanics.
Cambridge University Press, 2014. https://doi.org/10.1017/jfm.2013.603.
ieee: J. Kühnen, M. Holzner, B. Hof, and H. Kuhlmann, “Experimental investigation
of transitional flow in a toroidal pipe,” Journal of Fluid Mechanics, vol.
738. Cambridge University Press, pp. 463–491, 2014.
ista: Kühnen J, Holzner M, Hof B, Kuhlmann H. 2014. Experimental investigation of
transitional flow in a toroidal pipe. Journal of Fluid Mechanics. 738, 463–491.
mla: Kühnen, Jakob, et al. “Experimental Investigation of Transitional Flow in a
Toroidal Pipe.” Journal of Fluid Mechanics, vol. 738, Cambridge University
Press, 2014, pp. 463–91, doi:10.1017/jfm.2013.603.
short: J. Kühnen, M. Holzner, B. Hof, H. Kuhlmann, Journal of Fluid Mechanics 738
(2014) 463–491.
corr_author: '1'
date_created: 2018-12-11T11:55:25Z
date_published: 2014-01-10T00:00:00Z
date_updated: 2025-09-29T11:51:23Z
day: '10'
department:
- _id: BjHo
doi: 10.1017/jfm.2013.603
external_id:
arxiv:
- '1508.06546'
isi:
- '000328486400021'
fulldoi: https://doi.org/10.1017/jfm.2013.603
intvolume: ' 738'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1508.06546
month: '01'
oa: 1
oa_version: Submitted Version
page: 463 - 491
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '5001'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Experimental investigation of transitional flow in a toroidal pipe
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 738
year: '2014'
...
---
OA_place: repository
OA_type: gold
_id: '2051'
abstract:
- lang: eng
text: We show that the usual score function for conditional Markov networks can
be written as the expectation over the scores of their spanning trees. We also
show that a small random sample of these output trees can attain a significant
fraction of the margin obtained by the complete graph and we provide conditions
under which we can perform tractable inference. The experimental results confirm
that practical learning is scalable to realistic datasets using this approach.
article_processing_charge: No
author:
- first_name: Mario
full_name: Marchand, Mario
last_name: Marchand
- first_name: Su
full_name: Hongyu, Su
last_name: Hongyu
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Juho
full_name: Rousu, Juho
last_name: Rousu
- first_name: John
full_name: Shawe Taylor, John
last_name: Shawe Taylor
citation:
ama: 'Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. Multilabel structured
output learning with random spanning trees of max-margin Markov networks. In:
Advances in Neural Information Processing Systems. Vol 27. Neural Information
Processing Systems Foundation; 2014.'
apa: 'Marchand, M., Hongyu, S., Morvant, E., Rousu, J., & Shawe Taylor, J. (2014).
Multilabel structured output learning with random spanning trees of max-margin
Markov networks. In Advances in Neural Information Processing Systems (Vol.
27). Montreal, Canada: Neural Information Processing Systems Foundation.'
chicago: Marchand, Mario, Su Hongyu, Emilie Morvant, Juho Rousu, and John Shawe
Taylor. “Multilabel Structured Output Learning with Random Spanning Trees of Max-Margin
Markov Networks.” In Advances in Neural Information Processing Systems,
Vol. 27. Neural Information Processing Systems Foundation, 2014.
ieee: M. Marchand, S. Hongyu, E. Morvant, J. Rousu, and J. Shawe Taylor, “Multilabel
structured output learning with random spanning trees of max-margin Markov networks,”
in Advances in Neural Information Processing Systems, Montreal, Canada,
2014, vol. 27.
ista: 'Marchand M, Hongyu S, Morvant E, Rousu J, Shawe Taylor J. 2014. Multilabel
structured output learning with random spanning trees of max-margin Markov networks.
Advances in Neural Information Processing Systems. NIPS: Neural Information Processing
Systems vol. 27.'
mla: Marchand, Mario, et al. “Multilabel Structured Output Learning with Random
Spanning Trees of Max-Margin Markov Networks.” Advances in Neural Information
Processing Systems, vol. 27, Neural Information Processing Systems Foundation,
2014.
short: M. Marchand, S. Hongyu, E. Morvant, J. Rousu, J. Shawe Taylor, in:, Advances
in Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2014.
conference:
end_date: 2014-12-13
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2014-12-08
date_created: 2018-12-11T11:55:26Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-06-18T18:24:19Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
intvolume: ' 27'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal.archives-ouvertes.fr/hal-01065586
month: '01'
oa: 1
oa_version: Published Version
publication: Advances in Neural Information Processing Systems
publication_identifier:
isbn:
- '9781510800410'
publication_status: published
publisher: Neural Information Processing Systems Foundation
publist_id: '4996'
status: public
title: Multilabel structured output learning with random spanning trees of max-margin
Markov networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2014'
...
---
_id: '2052'
abstract:
- lang: eng
text: A standard technique for solving the parameterized model checking problem
is to reduce it to the classic model checking problem of finitely many finite-state
systems. This work considers some of the theoretical power and limitations of
this technique. We focus on concurrent systems in which processes communicate
via pairwise rendezvous, as well as the special cases of disjunctive guards and
token passing; specifications are expressed in indexed temporal logic without
the next operator; and the underlying network topologies are generated by suitable
Monadic Second Order Logic formulas and graph operations. First, we settle the
exact computational complexity of the parameterized model checking problem for
some of our concurrent systems, and establish new decidability results for others.
Second, we consider the cases that model checking the parameterized system can
be reduced to model checking some fixed number of processes, the number is known
as a cutoff. We provide many cases for when such cutoffs can be computed, establish
lower bounds on the size of such cutoffs, and identify cases where no cutoff exists.
Third, we consider cases for which the parameterized system is equivalent to a
single finite-state system (more precisely a Büchi word automaton), and establish
tight bounds on the sizes of such automata.
acknowledgement: The second, third, fourth and fifth authors were supported by the
Austrian National Research Network S11403-N23 (RiSE) of the Austrian Science Fund
(FWF) and by the Vienna Science and Technology Fund (WWTF) through grants PROSEED,
ICT12-059, and VRG11-005.
alternative_title:
- LNCS
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Tomer
full_name: Kotek, Tomer
last_name: Kotek
- first_name: Sacha
full_name: Rubin, Sacha
last_name: Rubin
- first_name: Francesco
full_name: Spegni, Francesco
last_name: Spegni
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Aminof B, Kotek T, Rubin S, Spegni F, Veith H. Parameterized model checking
of rendezvous systems. In: Baldan P, Gorla D, eds. Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2014:109-124. doi:10.1007/978-3-662-44584-6_9'
apa: 'Aminof, B., Kotek, T., Rubin, S., Spegni, F., & Veith, H. (2014). Parameterized
model checking of rendezvous systems. In P. Baldan & D. Gorla (Eds.), Lecture
Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 109–124). Rome, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_9'
chicago: Aminof, Benjamin, Tomer Kotek, Sacha Rubin, Francesco Spegni, and Helmut
Veith. “Parameterized Model Checking of Rendezvous Systems.” In Lecture Notes
in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), edited by Paolo Baldan and Daniele Gorla,
8704:109–24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_9.
ieee: B. Aminof, T. Kotek, S. Rubin, F. Spegni, and H. Veith, “Parameterized model
checking of rendezvous systems,” in Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Rome, Italy, 2014, vol. 8704, pp. 109–124.
ista: 'Aminof B, Kotek T, Rubin S, Spegni F, Veith H. 2014. Parameterized model
checking of rendezvous systems. Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).
CONCUR: Concurrency Theory, LNCS, vol. 8704, 109–124.'
mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Rendezvous Systems.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan
and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 109–24, doi:10.1007/978-3-662-44584-6_9.
short: B. Aminof, T. Kotek, S. Rubin, F. Spegni, H. Veith, in:, P. Baldan, D. Gorla
(Eds.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2014, pp. 109–124.
conference:
end_date: 2014-09-05
location: Rome, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2014-09-02
date_created: 2018-12-11T11:55:26Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2024-10-21T06:02:50Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-44584-6_9
editor:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Daniele
full_name: Gorla, Daniele
last_name: Gorla
fulldoi: https://doi.org/10.1007/978-3-662-44584-6_9
intvolume: ' 8704'
language:
- iso: eng
month: '09'
oa_version: None
page: 109 - 124
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4994'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameterized model checking of rendezvous systems
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8704
year: '2014'
...
---
_id: '2053'
abstract:
- lang: eng
text: In contrast to the usual understanding of probabilistic systems as stochastic
processes, recently these systems have also been regarded as transformers of probabilities.
In this paper, we give a natural definition of strong bisimulation for probabilistic
systems corresponding to this view that treats probability distributions as first-class
citizens. Our definition applies in the same way to discrete systems as well as
to systems with uncountable state and action spaces. Several examples demonstrate
that our definition refines the understanding of behavioural equivalences of probabilistic
systems. In particular, it solves a longstanding open problem concerning the representation
of memoryless continuous time by memoryfull continuous time. Finally, we give
algorithms for computing this bisimulation not only for finite but also for classes
of uncountably infinite systems.
acknowledgement: This work is supported by the EU 7th Framework Programme under grant
agreements 295261 (MEALS) and 318490 (SENSATION), Czech Science Foundation under
grant agreement P202/12/G061, the DFG Transregional Collaborative Research Centre
SFB/TR 14 AVACS, and by the CAS/SAFEA International Partnership Program for Creative
Research Teams.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Holger
full_name: Hermanns, Holger
last_name: Hermanns
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Hermanns H, Krčál J, Kretinsky J. Probabilistic bisimulation: Naturally on
distributions. In: Baldan P, Gorla D, eds. Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). Vol 8704. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2014:249-265. doi:10.1007/978-3-662-44584-6_18'
apa: 'Hermanns, H., Krčál, J., & Kretinsky, J. (2014). Probabilistic bisimulation:
Naturally on distributions. In P. Baldan & D. Gorla (Eds.), Lecture Notes
in Computer Science (including subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics) (Vol. 8704, pp. 249–265). Rome, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-662-44584-6_18'
chicago: 'Hermanns, Holger, Jan Krčál, and Jan Kretinsky. “Probabilistic Bisimulation:
Naturally on Distributions.” In Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by Paolo Baldan and Daniele Gorla, 8704:249–65. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2014. https://doi.org/10.1007/978-3-662-44584-6_18.'
ieee: 'H. Hermanns, J. Krčál, and J. Kretinsky, “Probabilistic bisimulation: Naturally
on distributions,” in Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Rome, Italy, 2014, vol. 8704, pp. 249–265.'
ista: 'Hermanns H, Krčál J, Kretinsky J. 2014. Probabilistic bisimulation: Naturally
on distributions. Lecture Notes in Computer Science (including subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). CONCUR:
Concurrency Theory, LNCS, vol. 8704, 249–265.'
mla: 'Hermanns, Holger, et al. “Probabilistic Bisimulation: Naturally on Distributions.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), edited by Paolo Baldan
and Daniele Gorla, vol. 8704, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 249–65, doi:10.1007/978-3-662-44584-6_18.'
short: H. Hermanns, J. Krčál, J. Kretinsky, in:, P. Baldan, D. Gorla (Eds.), Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2014, pp. 249–265.
conference:
end_date: 2014-09-05
location: Rome, Italy
name: 'CONCUR: Concurrency Theory'
start_date: 2014-09-02
date_created: 2018-12-11T11:55:27Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2025-06-11T07:57:15Z
day: '01'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-662-44584-6_18
ec_funded: 1
editor:
- first_name: Paolo
full_name: Baldan, Paolo
last_name: Baldan
- first_name: Daniele
full_name: Gorla, Daniele
last_name: Gorla
external_id:
arxiv:
- '1404.5084'
fulldoi: https://doi.org/10.1007/978-3-662-44584-6_18
intvolume: ' 8704'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.5084
month: '09'
oa: 1
oa_version: Submitted Version
page: 249 - 265
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
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4993'
scopus_import: '1'
status: public
title: 'Probabilistic bisimulation: Naturally on distributions'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8704
year: '2014'
...
---
_id: '2056'
abstract:
- lang: eng
text: 'We consider a continuous-time Markov chain (CTMC) whose state space is partitioned
into aggregates, and each aggregate is assigned a probability measure. A sufficient
condition for defining a CTMC over the aggregates is presented as a variant of
weak lumpability, which also characterizes that the measure over the original
process can be recovered from that of the aggregated one. We show how the applicability
of de-aggregation depends on the initial distribution. The application section
is devoted to illustrate how the developed theory aids in reducing CTMC models
of biochemical systems particularly in connection to protein-protein interactions.
We assume that the model is written by a biologist in form of site-graph-rewrite
rules. Site-graph-rewrite rules compactly express that, often, only a local context
of a protein (instead of a full molecular species) needs to be in a certain configuration
in order to trigger a reaction event. This observation leads to suitable aggregate
Markov chains with smaller state spaces, thereby providing sufficient reduction
in computational complexity. This is further exemplified in two case studies:
simple unbounded polymerization and early EGFR/insulin crosstalk.'
acknowledgement: T. Petrov is supported by SystemsX.ch—the Swiss Inititative for Systems
Biology.
article_processing_charge: No
arxiv: 1
author:
- first_name: Arnab
full_name: Ganguly, Arnab
last_name: Ganguly
- first_name: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
- first_name: Heinz
full_name: Koeppl, Heinz
last_name: Koeppl
citation:
ama: Ganguly A, Petrov T, Koeppl H. Markov chain aggregation and its applications
to combinatorial reaction networks. Journal of Mathematical Biology. 2014;69(3):767-797.
doi:10.1007/s00285-013-0738-7
apa: Ganguly, A., Petrov, T., & Koeppl, H. (2014). Markov chain aggregation
and its applications to combinatorial reaction networks. Journal of Mathematical
Biology. Springer. https://doi.org/10.1007/s00285-013-0738-7
chicago: Ganguly, Arnab, Tatjana Petrov, and Heinz Koeppl. “Markov Chain Aggregation
and Its Applications to Combinatorial Reaction Networks.” Journal of Mathematical
Biology. Springer, 2014. https://doi.org/10.1007/s00285-013-0738-7.
ieee: A. Ganguly, T. Petrov, and H. Koeppl, “Markov chain aggregation and its applications
to combinatorial reaction networks,” Journal of Mathematical Biology, vol.
69, no. 3. Springer, pp. 767–797, 2014.
ista: Ganguly A, Petrov T, Koeppl H. 2014. Markov chain aggregation and its applications
to combinatorial reaction networks. Journal of Mathematical Biology. 69(3), 767–797.
mla: Ganguly, Arnab, et al. “Markov Chain Aggregation and Its Applications to Combinatorial
Reaction Networks.” Journal of Mathematical Biology, vol. 69, no. 3, Springer,
2014, pp. 767–97, doi:10.1007/s00285-013-0738-7.
short: A. Ganguly, T. Petrov, H. Koeppl, Journal of Mathematical Biology 69 (2014)
767–797.
date_created: 2018-12-11T11:55:28Z
date_published: 2014-11-20T00:00:00Z
date_updated: 2025-09-29T11:50:22Z
day: '20'
department:
- _id: CaGu
- _id: ToHe
doi: 10.1007/s00285-013-0738-7
external_id:
arxiv:
- '1303.4532'
isi:
- '000340588700008'
fulldoi: https://doi.org/10.1007/s00285-013-0738-7
intvolume: ' 69'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.4532
month: '11'
oa: 1
oa_version: Submitted Version
page: 767 - 797
publication: Journal of Mathematical Biology
publication_status: published
publisher: Springer
publist_id: '4990'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Markov chain aggregation and its applications to combinatorial reaction networks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 69
year: '2014'
...
---
_id: '2057'
abstract:
- lang: eng
text: 'In the past few years, a lot of attention has been devoted to multimedia
indexing by fusing multimodal informations. Two kinds of fusion schemes are generally
considered: The early fusion and the late fusion. We focus on late classifier
fusion, where one combines the scores of each modality at the decision level.
To tackle this problem, we investigate a recent and elegant well-founded quadratic
program named MinCq coming from the machine learning PAC-Bayesian theory. MinCq
looks for the weighted combination, over a set of real-valued functions seen as
voters, leading to the lowest misclassification rate, while maximizing the voters’
diversity. We propose an extension of MinCq tailored to multimedia indexing. Our
method is based on an order-preserving pairwise loss adapted to ranking that allows
us to improve Mean Averaged Precision measure while taking into account the diversity
of the voters that we want to fuse. We provide evidence that this method is naturally
adapted to late fusion procedures and confirm the good behavior of our approach
on the challenging PASCAL VOC’07 benchmark.'
alternative_title:
- LNCS
arxiv: 1
author:
- first_name: Emilie
full_name: Morvant, Emilie
id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87
last_name: Morvant
orcid: 0000-0002-8301-7240
- first_name: Amaury
full_name: Habrard, Amaury
last_name: Habrard
- first_name: Stéphane
full_name: Ayache, Stéphane
last_name: Ayache
citation:
ama: 'Morvant E, Habrard A, Ayache S. Majority vote of diverse classifiers for late
fusion. In: Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol
8621. Springer; 2014:153-162. doi:10.1007/978-3-662-44415-3_16'
apa: 'Morvant, E., Habrard, A., & Ayache, S. (2014). Majority vote of diverse
classifiers for late fusion. In Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8621, pp. 153–162). Joensuu, Finland: Springer. https://doi.org/10.1007/978-3-662-44415-3_16'
chicago: Morvant, Emilie, Amaury Habrard, and Stéphane Ayache. “Majority Vote of
Diverse Classifiers for Late Fusion.” In Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics), 8621:153–62. Springer, 2014. https://doi.org/10.1007/978-3-662-44415-3_16.
ieee: E. Morvant, A. Habrard, and S. Ayache, “Majority vote of diverse classifiers
for late fusion,” in Lecture Notes in Computer Science (including subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Joensuu, Finland, 2014, vol. 8621, pp. 153–162.
ista: 'Morvant E, Habrard A, Ayache S. 2014. Majority vote of diverse classifiers
for late fusion. Lecture Notes in Computer Science (including subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). IAPR: International
Workshop on Structural, Syntactic, and Statistical Pattern Recognition, LNCS,
vol. 8621, 153–162.'
mla: Morvant, Emilie, et al. “Majority Vote of Diverse Classifiers for Late Fusion.”
Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics), vol. 8621, Springer, 2014,
pp. 153–62, doi:10.1007/978-3-662-44415-3_16.
short: E. Morvant, A. Habrard, S. Ayache, in:, Lecture Notes in Computer Science
(Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics), Springer, 2014, pp. 153–162.
conference:
end_date: 2014-08-22
location: Joensuu, Finland
name: 'IAPR: International Workshop on Structural, Syntactic, and Statistical Pattern
Recognition'
start_date: 2014-08-20
date_created: 2018-12-11T11:55:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:01Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-662-44415-3_16
ec_funded: 1
external_id:
arxiv:
- '1404.7796'
fulldoi: https://doi.org/10.1007/978-3-662-44415-3_16
intvolume: ' 8621'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.7796
month: '01'
oa: 1
oa_version: Preprint
page: 153 - 162
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4989'
quality_controlled: '1'
scopus_import: 1
status: public
title: Majority vote of diverse classifiers for late fusion
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8621
year: '2014'
...
---
_id: '2058'
abstract:
- lang: eng
text: We present a method for smoothly blending between existing liquid animations.
We introduce a semi-automatic method for matching two existing liquid animations,
which we use to create new fluid motion that plausibly interpolates the input.
Our contributions include a new space-time non-rigid iterative closest point algorithm
that incorporates user guidance, a subsampling technique for efficient registration
of meshes with millions of vertices, and a fast surface extraction algorithm that
produces 3D triangle meshes from a 4D space-time surface. Our technique can be
used to instantly create hundreds of new simulations, or to interactively explore
complex parameter spaces. Our method is guaranteed to produce output that does
not deviate from the input animations, and it generalizes to multiple dimensions.
Because our method runs at interactive rates after the initial precomputation
step, it has potential applications in games and training simulations.
article_number: '137'
article_processing_charge: No
author:
- first_name: Karthik
full_name: Raveendran, Karthik
last_name: Raveendran
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
- first_name: Nils
full_name: Thuerey, Nils
last_name: Thuerey
- first_name: Greg
full_name: Türk, Greg
last_name: Türk
citation:
ama: 'Raveendran K, Wojtan C, Thuerey N, Türk G. Blending liquids. In: ACM Transactions
on Graphics. Vol 33. ACM; 2014. doi:10.1145/2601097.2601126'
apa: 'Raveendran, K., Wojtan, C., Thuerey, N., & Türk, G. (2014). Blending liquids.
In ACM Transactions on Graphics (Vol. 33). Vancouver, Canada: ACM. https://doi.org/10.1145/2601097.2601126'
chicago: Raveendran, Karthik, Chris Wojtan, Nils Thuerey, and Greg Türk. “Blending
Liquids.” In ACM Transactions on Graphics, Vol. 33. ACM, 2014. https://doi.org/10.1145/2601097.2601126.
ieee: K. Raveendran, C. Wojtan, N. Thuerey, and G. Türk, “Blending liquids,” in
ACM Transactions on Graphics, Vancouver, Canada, 2014, vol. 33, no. 4.
ista: 'Raveendran K, Wojtan C, Thuerey N, Türk G. 2014. Blending liquids. ACM Transactions
on Graphics. SIGGRAPH: International Conference and Exhibition on Computer Graphics
and Interactive Techniques vol. 33, 137.'
mla: Raveendran, Karthik, et al. “Blending Liquids.” ACM Transactions on Graphics,
vol. 33, no. 4, 137, ACM, 2014, doi:10.1145/2601097.2601126.
short: K. Raveendran, C. Wojtan, N. Thuerey, G. Türk, in:, ACM Transactions on Graphics,
ACM, 2014.
conference:
end_date: 2014-08-14
location: Vancouver, Canada
name: 'SIGGRAPH: International Conference and Exhibition on Computer Graphics and
Interactive Techniques'
start_date: 2014-08-10
date_created: 2018-12-11T11:55:28Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2025-09-29T11:49:44Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2601097.2601126
external_id:
isi:
- '000340000100104'
file:
- access_level: open_access
checksum: 1752760a2e71e254537f31c0d10d9c6c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:27Z
date_updated: 2020-07-14T12:45:27Z
file_id: '4688'
file_name: IST-2016-606-v1+1_BlendingLiquids-Preprint.pdf
file_size: 8387384
relation: main_file
file_date_updated: 2020-07-14T12:45:27Z
fulldoi: https://doi.org/10.1145/2601097.2601126
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
project:
- _id: 25636330-B435-11E9-9278-68D0E5697425
grant_number: 11-NSF-1070
name: Genome-wide Analysis of Root Traits
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '4988'
pubrep_id: '606'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blending liquids
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2014'
...