---
_id: '18415'
abstract:
- lang: eng
text: Parsimony, including sparsity and low rank, has been shown to successfully
model data in numerous machine learning and signal processing tasks. Traditionally,
such modeling approaches rely on an iterative algorithm that minimizes an objective
function with parsimony-promoting terms. The inherently sequential structure and
data-dependent complexity and latency of iterative optimization constitute a major
limitation in many applications requiring real-time performance or involving large-scale
data. Another limitation encountered by these modeling techniques is the difficulty
of their inclusion in discriminative learning scenarios. In this work, we propose
to move the emphasis from the model to the pursuit algorithm, and develop a process-centric
view of parsimonious modeling, in which a learned deterministic fixed-complexity
pursuit process is used in lieu of iterative optimization. We show a principled
way to construct learnable pursuit process architectures for structured sparse
and robust low rank models, derived from the iteration of proximal descent algorithms.
These architectures learn to approximate the exact parsimonious representation
at a fraction of the complexity of the standard optimization methods. We also
show that appropriate training regimes allow to naturally extend parsimonious
models to discriminative settings. State-of-the-art results are demonstrated on
several challenging problems in image and audio processing with several orders
of magnitude speed-up compared to the exact optimization algorithms.
article_processing_charge: No
arxiv: 1
author:
- first_name: P.
full_name: Sprechmann, P.
last_name: Sprechmann
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: G.
full_name: Sapiro, G.
last_name: Sapiro
citation:
ama: Sprechmann P, Bronstein AM, Sapiro G. Learning efficient sparse and low rank
models. IEEE Transactions on Pattern Analysis and Machine Intelligence.
2015;37(9):1821-1833. doi:10.1109/tpami.2015.2392779
apa: Sprechmann, P., Bronstein, A. M., & Sapiro, G. (2015). Learning efficient
sparse and low rank models. IEEE Transactions on Pattern Analysis and Machine
Intelligence. IEEE. https://doi.org/10.1109/tpami.2015.2392779
chicago: Sprechmann, P., Alex M. Bronstein, and G. Sapiro. “Learning Efficient Sparse
and Low Rank Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2015. https://doi.org/10.1109/tpami.2015.2392779.
ieee: P. Sprechmann, A. M. Bronstein, and G. Sapiro, “Learning efficient sparse
and low rank models,” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 37, no. 9. IEEE, pp. 1821–1833, 2015.
ista: Sprechmann P, Bronstein AM, Sapiro G. 2015. Learning efficient sparse and
low rank models. IEEE Transactions on Pattern Analysis and Machine Intelligence.
37(9), 1821–1833.
mla: Sprechmann, P., et al. “Learning Efficient Sparse and Low Rank Models.” IEEE
Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 9,
IEEE, 2015, pp. 1821–33, doi:10.1109/tpami.2015.2392779.
short: P. Sprechmann, A.M. Bronstein, G. Sapiro, IEEE Transactions on Pattern Analysis
and Machine Intelligence 37 (2015) 1821–1833.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2024-12-18T11:40:35Z
day: '01'
doi: 10.1109/tpami.2015.2392779
extern: '1'
external_id:
arxiv:
- '1212.3631'
pmid:
- '26353129'
intvolume: ' 37'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1212.3631
month: '09'
oa: 1
oa_version: Preprint
page: 1821-1833
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning efficient sparse and low rank models
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '18416'
abstract:
- lang: eng
text: We construct an extension of spectral and diffusion geometry to multiple modalities
through simultaneous diagonalization of Laplacian matrices. This naturally extends
classical data analysis tools based on spectral geometry, such as diffusion maps
and spectral clustering. We provide several synthetic and real examples of manifold
learning, object classification, and clustering, showing that the joint spectral
geometry better captures the inherent structure of multi-modal data. We also show
the relation of many previous approaches for multimodal manifold analysis to our
framework.
article_processing_charge: No
author:
- first_name: Davide
full_name: Eynard, Davide
last_name: Eynard
- first_name: Artiom
full_name: Kovnatsky, Artiom
last_name: Kovnatsky
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Klaus
full_name: Glashoff, Klaus
last_name: Glashoff
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. Multimodal manifold
snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions on
Pattern Analysis and Machine Intelligence. 2015;37(12):2505-2517. doi:10.1109/tpami.2015.2408348
apa: Eynard, D., Kovnatsky, A., Bronstein, M. M., Glashoff, K., & Bronstein,
A. M. (2015). Multimodal manifold snalysis by simultaneous diagonalization of
Laplacians. IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE. https://doi.org/10.1109/tpami.2015.2408348
chicago: Eynard, Davide, Artiom Kovnatsky, Michael M. Bronstein, Klaus Glashoff,
and Alex M. Bronstein. “Multimodal Manifold Snalysis by Simultaneous Diagonalization
of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence.
IEEE, 2015. https://doi.org/10.1109/tpami.2015.2408348.
ieee: D. Eynard, A. Kovnatsky, M. M. Bronstein, K. Glashoff, and A. M. Bronstein,
“Multimodal manifold snalysis by simultaneous diagonalization of Laplacians,”
IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37,
no. 12. IEEE, pp. 2505–2517, 2015.
ista: Eynard D, Kovnatsky A, Bronstein MM, Glashoff K, Bronstein AM. 2015. Multimodal
manifold snalysis by simultaneous diagonalization of Laplacians. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(12), 2505–2517.
mla: Eynard, Davide, et al. “Multimodal Manifold Snalysis by Simultaneous Diagonalization
of Laplacians.” IEEE Transactions on Pattern Analysis and Machine Intelligence,
vol. 37, no. 12, IEEE, 2015, pp. 2505–17, doi:10.1109/tpami.2015.2408348.
short: D. Eynard, A. Kovnatsky, M.M. Bronstein, K. Glashoff, A.M. Bronstein, IEEE
Transactions on Pattern Analysis and Machine Intelligence 37 (2015) 2505–2517.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-12-01T00:00:00Z
date_updated: 2024-12-12T14:08:46Z
day: '01'
doi: 10.1109/tpami.2015.2408348
extern: '1'
external_id:
pmid:
- '26539854'
intvolume: ' 37'
issue: '12'
language:
- iso: eng
month: '12'
oa_version: None
page: 2505-2517
pmid: 1
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_identifier:
eissn:
- 1939-3539
issn:
- 0162-8828
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multimodal manifold snalysis by simultaneous diagonalization of Laplacians
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2015'
...
---
_id: '18424'
abstract:
- lang: eng
text: We present a fast algorithm for global rigid symmetry detection with approximation
guarantees. The algorithm is guaranteed to find the best approximate symmetry
of a given shape, to within a user-specified threshold, with very high probability.
Our method uses a carefully designed sampling of the transformation space, where
each transformation is efficiently evaluated using a sublinear algorithm. We prove
that the density of the sampling depends on the total variation of the shape,
allowing us to derive formal bounds on the algorithm's complexity and approximation
quality. We further investigate different volumetric shape representations (in
the form of truncated distance transforms), and in such a way control the total
variation of the shape and hence the sampling density and the runtime of the algorithm.
A comprehensive set of experiments assesses the proposed method, including an
evaluation on the eight categories of the COSEG data set. This is the first large-scale
evaluation of any symmetry detection technique that we are aware of.
article_processing_charge: No
arxiv: 1
author:
- first_name: Simon
full_name: Korman, Simon
last_name: Korman
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- first_name: Shai
full_name: Avidan, Shai
last_name: Avidan
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Korman S, Litman R, Avidan S, Bronstein AM. Probably approximately symmetric:
Fast rigid symmetry detection with global guarantees. Computer Graphics Forum.
2015;34(1):2-13. doi:10.1111/cgf.12454'
apa: 'Korman, S., Litman, R., Avidan, S., & Bronstein, A. M. (2015). Probably
approximately symmetric: Fast rigid symmetry detection with global guarantees.
Computer Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12454'
chicago: 'Korman, Simon, Roee Litman, Shai Avidan, and Alex M. Bronstein. “Probably
Approximately Symmetric: Fast Rigid Symmetry Detection with Global Guarantees.”
Computer Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12454.'
ieee: 'S. Korman, R. Litman, S. Avidan, and A. M. Bronstein, “Probably approximately
symmetric: Fast rigid symmetry detection with global guarantees,” Computer
Graphics Forum, vol. 34, no. 1. Wiley, pp. 2–13, 2015.'
ista: 'Korman S, Litman R, Avidan S, Bronstein AM. 2015. Probably approximately
symmetric: Fast rigid symmetry detection with global guarantees. Computer Graphics
Forum. 34(1), 2–13.'
mla: 'Korman, Simon, et al. “Probably Approximately Symmetric: Fast Rigid Symmetry
Detection with Global Guarantees.” Computer Graphics Forum, vol. 34, no.
1, Wiley, 2015, pp. 2–13, doi:10.1111/cgf.12454.'
short: S. Korman, R. Litman, S. Avidan, A.M. Bronstein, Computer Graphics Forum
34 (2015) 2–13.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2024-12-19T10:12:48Z
day: '01'
doi: 10.1111/cgf.12454
extern: '1'
external_id:
arxiv:
- '1403.6637'
intvolume: ' 34'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1403.6637
month: '02'
oa: 1
oa_version: Preprint
page: 2-13
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Probably approximately symmetric: Fast rigid symmetry detection with global
guarantees'
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2015'
...
---
_id: '18425'
abstract:
- lang: eng
text: The recent introduction of 3D shape analysis frameworks able to quantify the
deformation of a shape into another in terms of the variation of real functions
yields a new interpretation of the 3D shape similarity assessment and opens new
perspectives. Indeed, while the classical approaches to similarity mainly quantify
it as a numerical score, map-based methods also define (dense) shape correspondences.
After presenting in detail the theoretical foundations underlying these approaches,
we classify them by looking at their most salient features, including the kind
of structure and invariance properties they capture, as well as the distances
and the output modalities according to which the similarity between shapes is
assessed and returned. We also review the usage of these methods in a number of
3D shape application domains, ranging from matching and retrieval to annotation
and segmentation. Finally, the most promising directions for future research developments
are discussed.
article_processing_charge: No
author:
- first_name: S.
full_name: Biasotti, S.
last_name: Biasotti
- first_name: A.
full_name: Cerri, A.
last_name: Cerri
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M.
full_name: Bronstein, M.
last_name: Bronstein
citation:
ama: Biasotti S, Cerri A, Bronstein AM, Bronstein M. Recent trends, applications,
and perspectives in 3D shape similarity assessment. Computer Graphics Forum.
2015;35(6):87-119. doi:10.1111/cgf.12734
apa: Biasotti, S., Cerri, A., Bronstein, A. M., & Bronstein, M. (2015). Recent
trends, applications, and perspectives in 3D shape similarity assessment. Computer
Graphics Forum. Wiley. https://doi.org/10.1111/cgf.12734
chicago: Biasotti, S., A. Cerri, Alex M. Bronstein, and M. Bronstein. “Recent Trends,
Applications, and Perspectives in 3D Shape Similarity Assessment.” Computer
Graphics Forum. Wiley, 2015. https://doi.org/10.1111/cgf.12734.
ieee: S. Biasotti, A. Cerri, A. M. Bronstein, and M. Bronstein, “Recent trends,
applications, and perspectives in 3D shape similarity assessment,” Computer
Graphics Forum, vol. 35, no. 6. Wiley, pp. 87–119, 2015.
ista: Biasotti S, Cerri A, Bronstein AM, Bronstein M. 2015. Recent trends, applications,
and perspectives in 3D shape similarity assessment. Computer Graphics Forum. 35(6),
87–119.
mla: Biasotti, S., et al. “Recent Trends, Applications, and Perspectives in 3D Shape
Similarity Assessment.” Computer Graphics Forum, vol. 35, no. 6, Wiley,
2015, pp. 87–119, doi:10.1111/cgf.12734.
short: S. Biasotti, A. Cerri, A.M. Bronstein, M. Bronstein, Computer Graphics Forum
35 (2015) 87–119.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2024-12-19T13:44:16Z
day: '01'
doi: 10.1111/cgf.12734
extern: '1'
intvolume: ' 35'
issue: '6'
language:
- iso: eng
month: '09'
oa_version: None
page: 87-119
publication: Computer Graphics Forum
publication_identifier:
eissn:
- 1467-8659
issn:
- 0167-7055
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Recent trends, applications, and perspectives in 3D shape similarity assessment
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 35
year: '2015'
...
---
_id: '18436'
article_processing_charge: No
author:
- first_name: Harel
full_name: Haim, Harel
last_name: Haim
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Emanuel
full_name: Marom, Emanuel
last_name: Marom
citation:
ama: Haim H, Bronstein AM, Marom E. Computational multi-focus imaging combining
sparse model with color dependent phase mask. Optics Express. 2015;23(19):24547-24556.
doi:10.1364/oe.23.024547
apa: Haim, H., Bronstein, A. M., & Marom, E. (2015). Computational multi-focus
imaging combining sparse model with color dependent phase mask. Optics Express.
Optica Publishing Group. https://doi.org/10.1364/oe.23.024547
chicago: Haim, Harel, Alex M. Bronstein, and Emanuel Marom. “Computational Multi-Focus
Imaging Combining Sparse Model with Color Dependent Phase Mask.” Optics Express.
Optica Publishing Group, 2015. https://doi.org/10.1364/oe.23.024547.
ieee: H. Haim, A. M. Bronstein, and E. Marom, “Computational multi-focus imaging
combining sparse model with color dependent phase mask,” Optics Express,
vol. 23, no. 19. Optica Publishing Group, pp. 24547–24556, 2015.
ista: Haim H, Bronstein AM, Marom E. 2015. Computational multi-focus imaging combining
sparse model with color dependent phase mask. Optics Express. 23(19), 24547–24556.
mla: Haim, Harel, et al. “Computational Multi-Focus Imaging Combining Sparse Model
with Color Dependent Phase Mask.” Optics Express, vol. 23, no. 19, Optica
Publishing Group, 2015, pp. 24547–56, doi:10.1364/oe.23.024547.
short: H. Haim, A.M. Bronstein, E. Marom, Optics Express 23 (2015) 24547–24556.
date_created: 2024-10-15T11:20:55Z
date_published: 2015-09-10T00:00:00Z
date_updated: 2024-12-19T10:48:50Z
day: '10'
doi: 10.1364/oe.23.024547
extern: '1'
intvolume: ' 23'
issue: '19'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1364/OE.23.024547
month: '09'
oa: 1
oa_version: Published Version
page: 24547 - 24556
publication: Optics Express
publication_identifier:
eissn:
- 1094-4087
publication_status: published
publisher: Optica Publishing Group
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computational multi-focus imaging combining sparse model with color dependent
phase mask
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2015'
...
---
_id: '18439'
abstract:
- lang: eng
text: Intel’s newly-announced low-cost and high precision RealSense 3D (RGBD) camera
is becoming ubiquitous in laptops and mobile devices starting this year, opening
the door for new applications in the mobile health arena. In this paper, we demonstrate
how the Intel RealSense 3D camera can be used for low-cost gaze tracking and passive
pulse rate estimation. We develop a novel 3D gaze and fixation tracker based on
the eye surface geometry as well as an illumination invariant pulse rate estimation
method using near-infrared images captured with RealSense. We achieve a mean error
of 1cm at 20 − 30cm for the gaze tracker and 2.26bpm (beats per minute) for pulse
estimation, which is adequate in many medical applications, demonstrating the
great potential of novel consumer-grade RGBD technology in mobile health.
article_processing_charge: No
author:
- first_name: Qiang
full_name: Qiu, Qiang
last_name: Qiu
- first_name: Zhuoqing
full_name: Chang, Zhuoqing
last_name: Chang
- first_name: Mark
full_name: Draelos, Mark
last_name: Draelos
- first_name: Jie
full_name: Chen, Jie
last_name: Chen
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. Low-cost gaze and
pulse analysis using realsense. In: Proceedings of the 5th EAI International
Conference on Wireless Mobile Communication and Healthcare. ICST; 2015. doi:10.4108/eai.14-10-2015.2261657'
apa: 'Qiu, Q., Chang, Z., Draelos, M., Chen, J., Bronstein, A. M., & Sapiro,
G. (2015). Low-cost gaze and pulse analysis using realsense. In Proceedings
of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare.
London, United Kingdom: ICST. https://doi.org/10.4108/eai.14-10-2015.2261657'
chicago: Qiu, Qiang, Zhuoqing Chang, Mark Draelos, Jie Chen, Alex M. Bronstein,
and Guillermo Sapiro. “Low-Cost Gaze and Pulse Analysis Using Realsense.” In Proceedings
of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare.
ICST, 2015. https://doi.org/10.4108/eai.14-10-2015.2261657.
ieee: Q. Qiu, Z. Chang, M. Draelos, J. Chen, A. M. Bronstein, and G. Sapiro, “Low-cost
gaze and pulse analysis using realsense,” in Proceedings of the 5th EAI International
Conference on Wireless Mobile Communication and Healthcare, London, United
Kingdom, 2015.
ista: Qiu Q, Chang Z, Draelos M, Chen J, Bronstein AM, Sapiro G. 2015. Low-cost
gaze and pulse analysis using realsense. Proceedings of the 5th EAI International
Conference on Wireless Mobile Communication and Healthcare. 5th EAI International
Conference on Wireless Mobile Communication and Healthcare - Transforming Healthcare
through Innovations in Mobile and Wireless Technologies.
mla: Qiu, Qiang, et al. “Low-Cost Gaze and Pulse Analysis Using Realsense.” Proceedings
of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare,
ICST, 2015, doi:10.4108/eai.14-10-2015.2261657.
short: Q. Qiu, Z. Chang, M. Draelos, J. Chen, A.M. Bronstein, G. Sapiro, in:, Proceedings
of the 5th EAI International Conference on Wireless Mobile Communication and Healthcare,
ICST, 2015.
conference:
end_date: 2015-10-16
location: London, United Kingdom
name: 5th EAI International Conference on Wireless Mobile Communication and Healthcare
- Transforming Healthcare through Innovations in Mobile and Wireless Technologies
start_date: 2015-10-14
date_created: 2024-10-15T11:20:55Z
date_published: 2015-12-22T00:00:00Z
date_updated: 2024-12-19T13:36:57Z
day: '22'
doi: 10.4108/eai.14-10-2015.2261657
extern: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4108/eai.14-10-2015.2261657
month: '12'
oa: 1
oa_version: Published Version
publication: Proceedings of the 5th EAI International Conference on Wireless Mobile
Communication and Healthcare
publication_identifier:
isbn:
- '9781631900884'
publication_status: published
publisher: ICST
quality_controlled: '1'
scopus_import: '1'
status: public
title: Low-cost gaze and pulse analysis using realsense
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1845'
abstract:
- lang: eng
text: Based on extrapolation from excitatory synapses, it is often assumed that
depletion of the releasable pool of synaptic vesicles is the main factor underlying
depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression. Based on extrapolation from excitatory synapses, it is often assumed
that depletion of the releasable pool of synaptic vesicles is the main factor
underlying depression at inhibitory synapses. In this issue of Neuron, using subcellular
patch-clamp recording from inhibitory presynaptic terminals, Kawaguchi and Sakaba
(2015) show that at Purkinje cell-deep cerebellar nuclei neuron synapses, changes
in presynaptic action potential waveform substantially contribute to synaptic
depression.
article_processing_charge: No
author:
- first_name: David H
full_name: Vandael, David H
id: 3AE48E0A-F248-11E8-B48F-1D18A9856A87
last_name: Vandael
orcid: 0000-0001-7577-1676
- first_name: 'Claudia '
full_name: 'Espinoza Martinez, Claudia '
id: 31FFEE2E-F248-11E8-B48F-1D18A9856A87
last_name: Espinoza Martinez
orcid: 0000-0003-4710-2082
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Vandael DH, Espinoza Martinez C, Jonas PM. Excitement about inhibitory presynaptic
terminals. Neuron. 2015;85(6):1149-1151. doi:10.1016/j.neuron.2015.03.006
apa: Vandael, D. H., Espinoza Martinez, C., & Jonas, P. M. (2015). Excitement
about inhibitory presynaptic terminals. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2015.03.006
chicago: Vandael, David H, Claudia Espinoza Martinez, and Peter M Jonas. “Excitement
about Inhibitory Presynaptic Terminals.” Neuron. Elsevier, 2015. https://doi.org/10.1016/j.neuron.2015.03.006.
ieee: D. H. Vandael, C. Espinoza Martinez, and P. M. Jonas, “Excitement about inhibitory
presynaptic terminals,” Neuron, vol. 85, no. 6. Elsevier, pp. 1149–1151,
2015.
ista: Vandael DH, Espinoza Martinez C, Jonas PM. 2015. Excitement about inhibitory
presynaptic terminals. Neuron. 85(6), 1149–1151.
mla: Vandael, David H., et al. “Excitement about Inhibitory Presynaptic Terminals.”
Neuron, vol. 85, no. 6, Elsevier, 2015, pp. 1149–51, doi:10.1016/j.neuron.2015.03.006.
short: D.H. Vandael, C. Espinoza Martinez, P.M. Jonas, Neuron 85 (2015) 1149–1151.
corr_author: '1'
date_created: 2018-12-11T11:54:19Z
date_published: 2015-03-18T00:00:00Z
date_updated: 2025-09-23T08:44:39Z
day: '18'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2015.03.006
external_id:
isi:
- '000351319000002'
file:
- access_level: open_access
checksum: d1808550e376a0eca2a950fda017cfa6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5192'
file_name: IST-2017-822-v1+1_Perspective_Fig__Final.pdf
file_size: 411832
relation: main_file
- access_level: open_access
checksum: a279f4ae61e6c8f33d68f69a0d02097d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5193'
file_name: IST-2017-822-v1+2_Perspective_Final2.pdf
file_size: 100769
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 85'
isi: 1
issue: '6'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 1149 - 1151
publication: Neuron
publication_status: published
publisher: Elsevier
publist_id: '5256'
pubrep_id: '822'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Excitement about inhibitory presynaptic terminals
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 85
year: '2015'
...
---
_id: '1846'
abstract:
- lang: eng
text: Modal transition systems (MTS) is a well-studied specification formalism of
reactive systems supporting a step-wise refinement methodology. Despite its many
advantages, the formalism as well as its currently known extensions are incapable
of expressing some practically needed aspects in the refinement process like exclusive,
conditional and persistent choices. We introduce a new model called parametric
modal transition systems (PMTS) together with a general modal refinement notion
that overcomes many of the limitations. We investigate the computational complexity
of modal and thorough refinement checking on PMTS and its subclasses and provide
a direct encoding of the modal refinement problem into quantified Boolean formulae,
allowing us to employ state-of-the-art QBF solvers for modal refinement checking.
The experiments we report on show that the feasibility of refinement checking
is more influenced by the degree of nondeterminism rather than by the syntactic
restrictions on the types of formulae allowed in the description of the PMTS.
article_processing_charge: No
article_type: original
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Mikael
full_name: Möller, Mikael
last_name: Möller
- first_name: Salomon
full_name: Sickert, Salomon
last_name: Sickert
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. Refinement checking
on parametric modal transition systems. Acta Informatica. 2015;52(2-3):269-297.
doi:10.1007/s00236-015-0215-4
apa: Beneš, N., Kretinsky, J., Larsen, K., Möller, M., Sickert, S., & Srba,
J. (2015). Refinement checking on parametric modal transition systems. Acta
Informatica. Springer. https://doi.org/10.1007/s00236-015-0215-4
chicago: Beneš, Nikola, Jan Kretinsky, Kim Larsen, Mikael Möller, Salomon Sickert,
and Jiří Srba. “Refinement Checking on Parametric Modal Transition Systems.” Acta
Informatica. Springer, 2015. https://doi.org/10.1007/s00236-015-0215-4.
ieee: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, and J. Srba, “Refinement
checking on parametric modal transition systems,” Acta Informatica, vol.
52, no. 2–3. Springer, pp. 269–297, 2015.
ista: Beneš N, Kretinsky J, Larsen K, Möller M, Sickert S, Srba J. 2015. Refinement
checking on parametric modal transition systems. Acta Informatica. 52(2–3), 269–297.
mla: Beneš, Nikola, et al. “Refinement Checking on Parametric Modal Transition Systems.”
Acta Informatica, vol. 52, no. 2–3, Springer, 2015, pp. 269–97, doi:10.1007/s00236-015-0215-4.
short: N. Beneš, J. Kretinsky, K. Larsen, M. Möller, S. Sickert, J. Srba, Acta Informatica
52 (2015) 269–297.
corr_author: '1'
date_created: 2018-12-11T11:54:20Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2025-09-23T10:33:12Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/s00236-015-0215-4
ec_funded: 1
external_id:
isi:
- '000351160200008'
file:
- access_level: open_access
checksum: fb4037ddc4fc05f33080dd3547ede350
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:57:44Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7854'
file_name: 2015_ActaInfo_Benes.pdf
file_size: 488482
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 52'
isi: 1
issue: 2-3
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 269 - 297
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '5255'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Refinement checking on parametric modal transition systems
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 52
year: '2015'
...
---
_id: '1847'
acknowledgement: This work was supported by the European Research Council (project
ERC-2011-StG-20101109-PSDP), European Social Fund (CZ.1.07/2.3.00/20.0043), and
the Czech Science Foundation GAČR (GA13-40637S).
article_processing_charge: No
author:
- first_name: Peter
full_name: Grones, Peter
id: 399876EC-F248-11E8-B48F-1D18A9856A87
last_name: Grones
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Grones P, Friml J. ABP1: Finally docking. Molecular Plant. 2015;8(3):356-358.
doi:10.1016/j.molp.2014.12.013'
apa: 'Grones, P., & Friml, J. (2015). ABP1: Finally docking. Molecular Plant.
Elsevier. https://doi.org/10.1016/j.molp.2014.12.013'
chicago: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant.
Elsevier, 2015. https://doi.org/10.1016/j.molp.2014.12.013.'
ieee: 'P. Grones and J. Friml, “ABP1: Finally docking,” Molecular Plant,
vol. 8, no. 3. Elsevier, pp. 356–358, 2015.'
ista: 'Grones P, Friml J. 2015. ABP1: Finally docking. Molecular Plant. 8(3), 356–358.'
mla: 'Grones, Peter, and Jiří Friml. “ABP1: Finally Docking.” Molecular Plant,
vol. 8, no. 3, Elsevier, 2015, pp. 356–58, doi:10.1016/j.molp.2014.12.013.'
short: P. Grones, J. Friml, Molecular Plant 8 (2015) 356–358.
corr_author: '1'
date_created: 2018-12-11T11:54:20Z
date_published: 2015-03-02T00:00:00Z
date_updated: 2025-09-23T07:30:08Z
day: '02'
department:
- _id: JiFr
doi: 10.1016/j.molp.2014.12.013
external_id:
isi:
- '000350813400003'
intvolume: ' 8'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 356 - 358
publication: Molecular Plant
publication_status: published
publisher: Elsevier
publist_id: '5254'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'ABP1: Finally docking'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 8
year: '2015'
...
---
_id: '1848'
abstract:
- lang: eng
text: The ability to escape apoptosis is a hallmark of cancer-initiating cells and
a key factor of resistance to oncolytic therapy. Here, we identify FAM96A as a
ubiquitous, evolutionarily conserved apoptosome-activating protein and investigate
its potential pro-apoptotic tumor suppressor function in gastrointestinal stromal
tumors (GISTs). Interaction between FAM96A and apoptotic peptidase activating
factor 1 (APAF1) was identified in yeast two-hybrid screen and further studied
by deletion mutants, glutathione-S-transferase pull-down, co-immunoprecipitation
and immunofluorescence. Effects of FAM96A overexpression and knock-down on apoptosis
sensitivity were examined in cancer cells and zebrafish embryos. Expression of
FAM96A in GISTs and histogenetically related cells including interstitial cells
of Cajal (ICCs), “fibroblast-like cells” (FLCs) and ICC stem cells (ICC-SCs) was
investigated by Northern blotting, reverse transcription—polymerase chain reaction,
immunohistochemistry and Western immunoblotting. Tumorigenicity of GIST cells
and transformed murine ICC-SCs stably transduced to re-express FAM96A was studied
by xeno- and allografting into immunocompromised mice. FAM96A was found to bind
APAF1 and to enhance the induction of mitochondrial apoptosis. FAM96A protein
or mRNA was dramatically reduced or lost in 106 of 108 GIST samples representing
three independent patient cohorts. Whereas ICCs, ICC-SCs and FLCs, the presumed
normal counterparts of GIST, were found to robustly express FAM96A protein and
mRNA, FAM96A expression was much reduced in tumorigenic ICC-SCs. Re-expression
of FAM96A in GIST cells and transformed ICC-SCs increased apoptosis sensitivity
and diminished tumorigenicity. Our data suggest FAM96A is a novel pro-apoptotic
tumor suppressor that is lost during GIST tumorigenesis.
article_processing_charge: No
article_type: original
author:
- first_name: Bettina
full_name: Schwamb, Bettina
last_name: Schwamb
- first_name: Robert
full_name: Pick, Robert
last_name: Pick
- first_name: Sara
full_name: Fernández, Sara
last_name: Fernández
- first_name: Kirsten
full_name: Völp, Kirsten
last_name: Völp
- first_name: Jan
full_name: Heering, Jan
last_name: Heering
- first_name: Volker
full_name: Dötsch, Volker
last_name: Dötsch
- first_name: Susanne
full_name: Bösser, Susanne
last_name: Bösser
- first_name: Jennifer
full_name: Jung, Jennifer
last_name: Jung
- first_name: Rasa
full_name: Beinoravičiute Kellner, Rasa
last_name: Beinoravičiute Kellner
- first_name: Josephine
full_name: Wesely, Josephine
last_name: Wesely
- first_name: Inka
full_name: Zörnig, Inka
last_name: Zörnig
- first_name: Matthias
full_name: Hammerschmidt, Matthias
last_name: Hammerschmidt
- first_name: Matthias
full_name: Nowak, Matthias
id: 30845DAA-F248-11E8-B48F-1D18A9856A87
last_name: Nowak
- first_name: Roland
full_name: Penzel, Roland
last_name: Penzel
- first_name: Kurt
full_name: Zatloukal, Kurt
last_name: Zatloukal
- first_name: Stefan
full_name: Joos, Stefan
last_name: Joos
- first_name: Ralf
full_name: Rieker, Ralf
last_name: Rieker
- first_name: Abbas
full_name: Agaimy, Abbas
last_name: Agaimy
- first_name: Stephan
full_name: Söder, Stephan
last_name: Söder
- first_name: Kmarie
full_name: Reid Lombardo, Kmarie
last_name: Reid Lombardo
- first_name: Michael
full_name: Kendrick, Michael
last_name: Kendrick
- first_name: Michael
full_name: Bardsley, Michael
last_name: Bardsley
- first_name: Yujiro
full_name: Hayashi, Yujiro
last_name: Hayashi
- first_name: David
full_name: Asuzu, David
last_name: Asuzu
- first_name: Sabriya
full_name: Syed, Sabriya
last_name: Syed
- first_name: Tamás
full_name: Ördög, Tamás
last_name: Ördög
- first_name: Martin
full_name: Zörnig, Martin
last_name: Zörnig
citation:
ama: Schwamb B, Pick R, Fernández S, et al. FAM96A is a novel pro-apoptotic tumor
suppressor in gastrointestinal stromal tumors. International Journal of Cancer.
2015;137(6):1318-1329. doi:10.1002/ijc.29498
apa: Schwamb, B., Pick, R., Fernández, S., Völp, K., Heering, J., Dötsch, V., …
Zörnig, M. (2015). FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal
stromal tumors. International Journal of Cancer. Wiley. https://doi.org/10.1002/ijc.29498
chicago: Schwamb, Bettina, Robert Pick, Sara Fernández, Kirsten Völp, Jan Heering,
Volker Dötsch, Susanne Bösser, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor
in Gastrointestinal Stromal Tumors.” International Journal of Cancer. Wiley,
2015. https://doi.org/10.1002/ijc.29498.
ieee: B. Schwamb et al., “FAM96A is a novel pro-apoptotic tumor suppressor
in gastrointestinal stromal tumors,” International Journal of Cancer, vol.
137, no. 6. Wiley, pp. 1318–1329, 2015.
ista: Schwamb B, Pick R, Fernández S, Völp K, Heering J, Dötsch V, Bösser S, Jung
J, Beinoravičiute Kellner R, Wesely J, Zörnig I, Hammerschmidt M, Nowak M, Penzel
R, Zatloukal K, Joos S, Rieker R, Agaimy A, Söder S, Reid Lombardo K, Kendrick
M, Bardsley M, Hayashi Y, Asuzu D, Syed S, Ördög T, Zörnig M. 2015. FAM96A is
a novel pro-apoptotic tumor suppressor in gastrointestinal stromal tumors. International
Journal of Cancer. 137(6), 1318–1329.
mla: Schwamb, Bettina, et al. “FAM96A Is a Novel Pro-Apoptotic Tumor Suppressor
in Gastrointestinal Stromal Tumors.” International Journal of Cancer, vol.
137, no. 6, Wiley, 2015, pp. 1318–29, doi:10.1002/ijc.29498.
short: B. Schwamb, R. Pick, S. Fernández, K. Völp, J. Heering, V. Dötsch, S. Bösser,
J. Jung, R. Beinoravičiute Kellner, J. Wesely, I. Zörnig, M. Hammerschmidt, M.
Nowak, R. Penzel, K. Zatloukal, S. Joos, R. Rieker, A. Agaimy, S. Söder, K. Reid
Lombardo, M. Kendrick, M. Bardsley, Y. Hayashi, D. Asuzu, S. Syed, T. Ördög, M.
Zörnig, International Journal of Cancer 137 (2015) 1318–1329.
date_created: 2018-12-11T11:54:20Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2025-09-23T08:46:31Z
day: '01'
department:
- _id: LifeSc
doi: 10.1002/ijc.29498
external_id:
isi:
- '000357808900012'
pmid:
- '25716227'
intvolume: ' 137'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4497860/
month: '09'
oa: 1
oa_version: Submitted Version
page: 1318 - 1329
pmid: 1
publication: International Journal of Cancer
publication_status: published
publisher: Wiley
publist_id: '5253'
quality_controlled: '1'
scopus_import: '1'
status: public
title: FAM96A is a novel pro-apoptotic tumor suppressor in gastrointestinal stromal
tumors
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 137
year: '2015'
...
---
_id: '1849'
abstract:
- lang: eng
text: 'Cell polarity is a fundamental property of pro- and eukaryotic cells. It
is necessary for coordination of cell division, cell morphogenesis and signaling
processes. How polarity is generated and maintained is a complex issue governed
by interconnected feed-back regulations between small GTPase signaling and membrane
tension-based signaling that controls membrane trafficking, and cytoskeleton organization
and dynamics. Here, we will review the potential role for calcium as a crucial
signal that connects and coordinates the respective processes during polarization
processes in plants. This article is part of a Special Issue entitled: 13th European
Symposium on Calcium.'
acknowledgement: The contributing authors were supported by the Ghent University Special
Research Fund (to E.H.), the Interuniversity Attraction Poles Programme (IAP VI/33
and IUAP P7/29 ‘MARS’), the European Research Council (project ERC-2011-StG-20101109-PSDP,
to J.F.), and the Research Foundation Flanders (to S.V.).
article_processing_charge: No
author:
- first_name: Ellie
full_name: Himschoot, Ellie
last_name: Himschoot
- first_name: Tom
full_name: Beeckman, Tom
last_name: Beeckman
- first_name: Jiřĺ
full_name: Friml, Jiřĺ
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
citation:
ama: Himschoot E, Beeckman T, Friml J, Vanneste S. Calcium is an organizer of cell
polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
2015;1853(9):2168-2172. doi:10.1016/j.bbamcr.2015.02.017
apa: Himschoot, E., Beeckman, T., Friml, J., & Vanneste, S. (2015). Calcium
is an organizer of cell polarity in plants. Biochimica et Biophysica Acta -
Molecular Cell Research. Elsevier. https://doi.org/10.1016/j.bbamcr.2015.02.017
chicago: Himschoot, Ellie, Tom Beeckman, Jiří Friml, and Steffen Vanneste. “Calcium
Is an Organizer of Cell Polarity in Plants.” Biochimica et Biophysica Acta
- Molecular Cell Research. Elsevier, 2015. https://doi.org/10.1016/j.bbamcr.2015.02.017.
ieee: E. Himschoot, T. Beeckman, J. Friml, and S. Vanneste, “Calcium is an organizer
of cell polarity in plants,” Biochimica et Biophysica Acta - Molecular Cell
Research, vol. 1853, no. 9. Elsevier, pp. 2168–2172, 2015.
ista: Himschoot E, Beeckman T, Friml J, Vanneste S. 2015. Calcium is an organizer
of cell polarity in plants. Biochimica et Biophysica Acta - Molecular Cell Research.
1853(9), 2168–2172.
mla: Himschoot, Ellie, et al. “Calcium Is an Organizer of Cell Polarity in Plants.”
Biochimica et Biophysica Acta - Molecular Cell Research, vol. 1853, no.
9, Elsevier, 2015, pp. 2168–72, doi:10.1016/j.bbamcr.2015.02.017.
short: E. Himschoot, T. Beeckman, J. Friml, S. Vanneste, Biochimica et Biophysica
Acta - Molecular Cell Research 1853 (2015) 2168–2172.
date_created: 2018-12-11T11:54:21Z
date_published: 2015-09-01T00:00:00Z
date_updated: 2025-09-23T08:04:01Z
day: '01'
department:
- _id: JiFr
doi: 10.1016/j.bbamcr.2015.02.017
external_id:
isi:
- '000359960400028'
intvolume: ' 1853'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa_version: None
page: 2168 - 2172
publication: Biochimica et Biophysica Acta - Molecular Cell Research
publication_status: published
publisher: Elsevier
publist_id: '5252'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Calcium is an organizer of cell polarity in plants
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1853
year: '2015'
...
---
_id: '1850'
abstract:
- lang: eng
text: 'Entomopathogenic fungi are potent biocontrol agents that are widely used
against insect pests, many of which are social insects. Nevertheless, theoretical
investigations of their particular life history are scarce. We develop a model
that takes into account the main distinguishing features between traditionally
studied diseases and obligate killing pathogens, like the (biocontrol-relevant)
insect-pathogenic fungi Metarhizium and Beauveria. First, obligate killing entomopathogenic
fungi produce new infectious particles (conidiospores) only after host death and
not yet on the living host. Second, the killing rates of entomopathogenic fungi
depend strongly on the initial exposure dosage, thus we explicitly consider the
pathogen load of individual hosts. Further, we make the model applicable not only
to solitary host species, but also to group living species by incorporating social
interactions between hosts, like the collective disease defences of insect societies.
Our results identify the optimal killing rate for the pathogen that minimises
its invasion threshold. Furthermore, we find that the rate of contact between
hosts has an ambivalent effect: dense interaction networks between individuals
are considered to facilitate disease outbreaks because of increased pathogen transmission.
In social insects, this is compensated by their collective disease defences, i.e.,
social immunity. For the type of pathogens considered here, we show that even
without social immunity, high contact rates between live individuals dilute the
pathogen in the host colony and hence can reduce individual pathogen loads below
disease-causing levels.'
article_processing_charge: No
author:
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
orcid: 0000-0002-2519-824X
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Novak S, Cremer S. Fungal disease dynamics in insect societies: Optimal killing
rates and the ambivalent effect of high social interaction rates. Journal of
Theoretical Biology. 2015;372(5):54-64. doi:10.1016/j.jtbi.2015.02.018'
apa: 'Novak, S., & Cremer, S. (2015). Fungal disease dynamics in insect societies:
Optimal killing rates and the ambivalent effect of high social interaction rates.
Journal of Theoretical Biology. Elsevier. https://doi.org/10.1016/j.jtbi.2015.02.018'
chicago: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect
Societies: Optimal Killing Rates and the Ambivalent Effect of High Social Interaction
Rates.” Journal of Theoretical Biology. Elsevier, 2015. https://doi.org/10.1016/j.jtbi.2015.02.018.'
ieee: 'S. Novak and S. Cremer, “Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates,” Journal
of Theoretical Biology, vol. 372, no. 5. Elsevier, pp. 54–64, 2015.'
ista: 'Novak S, Cremer S. 2015. Fungal disease dynamics in insect societies: Optimal
killing rates and the ambivalent effect of high social interaction rates. Journal
of Theoretical Biology. 372(5), 54–64.'
mla: 'Novak, Sebastian, and Sylvia Cremer. “Fungal Disease Dynamics in Insect Societies:
Optimal Killing Rates and the Ambivalent Effect of High Social Interaction Rates.”
Journal of Theoretical Biology, vol. 372, no. 5, Elsevier, 2015, pp. 54–64,
doi:10.1016/j.jtbi.2015.02.018.'
short: S. Novak, S. Cremer, Journal of Theoretical Biology 372 (2015) 54–64.
corr_author: '1'
date_created: 2018-12-11T11:54:21Z
date_published: 2015-05-07T00:00:00Z
date_updated: 2025-09-23T08:54:35Z
day: '07'
ddc:
- '576'
department:
- _id: NiBa
- _id: SyCr
doi: 10.1016/j.jtbi.2015.02.018
ec_funded: 1
external_id:
isi:
- '000353311700006'
file:
- access_level: open_access
checksum: 3c0dcacc900bc45cc65a453dfda4ca43
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:07Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5326'
file_name: IST-2015-329-v1+1_manuscript.pdf
file_size: 1546914
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 372'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 54 - 64
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
publication: Journal of Theoretical Biology
publication_status: published
publisher: Elsevier
publist_id: '5251'
pubrep_id: '329'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Fungal disease dynamics in insect societies: Optimal killing rates and the
ambivalent effect of high social interaction rates'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 372
year: '2015'
...
---
_id: '1851'
abstract:
- lang: eng
text: We consider mating strategies for females who search for males sequentially
during a season of limited length. We show that the best strategy rejects a given
male type if encountered before a time-threshold but accepts him after. For frequency-independent
benefits, we obtain the optimal time-thresholds explicitly for both discrete and
continuous distributions of males, and allow for mistakes being made in assessing
the correct male type. When the benefits are indirect (genes for the offspring)
and the population is under frequency-dependent ecological selection, the benefits
depend on the mating strategy of other females as well. This case is particularly
relevant to speciation models that seek to explore the stability of reproductive
isolation by assortative mating under frequency-dependent ecological selection.
We show that the indirect benefits are to be quantified by the reproductive values
of couples, and describe how the evolutionarily stable time-thresholds can be
found. We conclude with an example based on the Levene model, in which we analyze
the evolutionarily stable assortative mating strategies and the strength of reproductive
isolation provided by them.
article_processing_charge: No
article_type: original
author:
- first_name: Tadeas
full_name: Priklopil, Tadeas
id: 3C869AA0-F248-11E8-B48F-1D18A9856A87
last_name: Priklopil
- first_name: Eva
full_name: Kisdi, Eva
last_name: Kisdi
- first_name: Mats
full_name: Gyllenberg, Mats
last_name: Gyllenberg
citation:
ama: Priklopil T, Kisdi E, Gyllenberg M. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 2015;69(4):1015-1026. doi:10.1111/evo.12618
apa: Priklopil, T., Kisdi, E., & Gyllenberg, M. (2015). Evolutionarily stable
mating decisions for sequentially searching females and the stability of reproductive
isolation by assortative mating. Evolution. Wiley. https://doi.org/10.1111/evo.12618
chicago: Priklopil, Tadeas, Eva Kisdi, and Mats Gyllenberg. “Evolutionarily Stable
Mating Decisions for Sequentially Searching Females and the Stability of Reproductive
Isolation by Assortative Mating.” Evolution. Wiley, 2015. https://doi.org/10.1111/evo.12618.
ieee: T. Priklopil, E. Kisdi, and M. Gyllenberg, “Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating,” Evolution, vol. 69, no. 4. Wiley, pp. 1015–1026,
2015.
ista: Priklopil T, Kisdi E, Gyllenberg M. 2015. Evolutionarily stable mating decisions
for sequentially searching females and the stability of reproductive isolation
by assortative mating. Evolution. 69(4), 1015–1026.
mla: Priklopil, Tadeas, et al. “Evolutionarily Stable Mating Decisions for Sequentially
Searching Females and the Stability of Reproductive Isolation by Assortative Mating.”
Evolution, vol. 69, no. 4, Wiley, 2015, pp. 1015–26, doi:10.1111/evo.12618.
short: T. Priklopil, E. Kisdi, M. Gyllenberg, Evolution 69 (2015) 1015–1026.
corr_author: '1'
date_created: 2018-12-11T11:54:21Z
date_published: 2015-02-09T00:00:00Z
date_updated: 2025-09-22T14:27:30Z
day: '09'
ddc:
- '570'
department:
- _id: NiBa
- _id: KrCh
doi: 10.1111/evo.12618
ec_funded: 1
external_id:
isi:
- '000353236000014'
pmid:
- '25662095'
file:
- access_level: open_access
checksum: 1e8be0b1d7598a78cd2623d8ee8e7798
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T09:05:34Z
date_updated: 2020-07-14T12:45:19Z
file_id: '7855'
file_name: 2015_Evolution_Priklopil.pdf
file_size: 967214
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 69'
isi: 1
issue: '4'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Submitted Version
page: 1015 - 1026
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Evolution
publication_identifier:
eissn:
- 1558-5646
issn:
- 0014-3820
publication_status: published
publisher: Wiley
publist_id: '5249'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolutionarily stable mating decisions for sequentially searching females and
the stability of reproductive isolation by assortative mating
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 69
year: '2015'
...
---
_id: '1855'
abstract:
- lang: eng
text: 'Summary: Declining populations of bee pollinators are a cause of concern,
with major repercussions for biodiversity loss and food security. RNA viruses
associated with honeybees represent a potential threat to other insect pollinators,
but the extent of this threat is poorly understood. This study aims to attain
a detailed understanding of the current and ongoing risk of emerging infectious
disease (EID) transmission between managed and wild pollinator species across
a wide range of RNA viruses. Within a structured large-scale national survey across
26 independent sites, we quantify the prevalence and pathogen loads of multiple
RNA viruses in co-occurring managed honeybee (Apis mellifera) and wild bumblebee
(Bombus spp.) populations. We then construct models that compare virus prevalence
between wild and managed pollinators. Multiple RNA viruses associated with honeybees
are widespread in sympatric wild bumblebee populations. Virus prevalence in honeybees
is a significant predictor of virus prevalence in bumblebees, but we remain cautious
in speculating over the principle direction of pathogen transmission. We demonstrate
species-specific differences in prevalence, indicating significant variation in
disease susceptibility or tolerance. Pathogen loads within individual bumblebees
may be high and in the case of at least one RNA virus, prevalence is higher in
wild bumblebees than in managed honeybee populations. Our findings indicate widespread
transmission of RNA viruses between managed and wild bee pollinators, pointing
to an interconnected network of potential disease pressures within and among pollinator
species. In the context of the biodiversity crisis, our study emphasizes the importance
of targeting a wide range of pathogens and defining host associations when considering
potential drivers of population decline.'
acknowledgement: We thank J.R. de Miranda, L. De Smet and D. de Graaf for supplying
qRT-PCR and MLPA positive controls, respectively, in the form of plasmids. This
work was supported by the Insect Pollinators Initiative (IPI grants BB/1000100/1
and BB/I000151/1). The IPI is funded jointly by the Biotechnology and Biological
Sciences Research Council, the Department for Environment, Food and Rural Affairs,
the Natural Environment Research Council, The Scottish Government and The Wellcome
Trust, under the Living with Environmental Change Partnership.
article_processing_charge: No
article_type: original
author:
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Matthias
full_name: Fürst, Matthias
id: 393B1196-F248-11E8-B48F-1D18A9856A87
last_name: Fürst
orcid: 0000-0002-3712-925X
- first_name: Jesicca
full_name: Caspar, Jesicca
last_name: Caspar
- first_name: Panagiotis
full_name: Theodorou, Panagiotis
last_name: Theodorou
- first_name: Mark
full_name: Brown, Mark
last_name: Brown
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
citation:
ama: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. A sting in the
spit: Widespread cross-infection of multiple RNA viruses across wild and managed
bees. Journal of Animal Ecology. 2015;84(3):615-624. doi:10.1111/1365-2656.12345'
apa: 'Mcmahon, D., Fürst, M., Caspar, J., Theodorou, P., Brown, M., & Paxton,
R. (2015). A sting in the spit: Widespread cross-infection of multiple RNA viruses
across wild and managed bees. Journal of Animal Ecology. Wiley. https://doi.org/10.1111/1365-2656.12345'
chicago: 'Mcmahon, Dino, Matthias Fürst, Jesicca Caspar, Panagiotis Theodorou, Mark
Brown, and Robert Paxton. “A Sting in the Spit: Widespread Cross-Infection of
Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology.
Wiley, 2015. https://doi.org/10.1111/1365-2656.12345.'
ieee: 'D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, and R. Paxton, “A
sting in the spit: Widespread cross-infection of multiple RNA viruses across wild
and managed bees,” Journal of Animal Ecology, vol. 84, no. 3. Wiley, pp.
615–624, 2015.'
ista: 'Mcmahon D, Fürst M, Caspar J, Theodorou P, Brown M, Paxton R. 2015. A sting
in the spit: Widespread cross-infection of multiple RNA viruses across wild and
managed bees. Journal of Animal Ecology. 84(3), 615–624.'
mla: 'Mcmahon, Dino, et al. “A Sting in the Spit: Widespread Cross-Infection of
Multiple RNA Viruses across Wild and Managed Bees.” Journal of Animal Ecology,
vol. 84, no. 3, Wiley, 2015, pp. 615–24, doi:10.1111/1365-2656.12345.'
short: D. Mcmahon, M. Fürst, J. Caspar, P. Theodorou, M. Brown, R. Paxton, Journal
of Animal Ecology 84 (2015) 615–624.
date_created: 2018-12-11T11:54:23Z
date_published: 2015-03-03T00:00:00Z
date_updated: 2025-09-23T07:26:24Z
day: '03'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1111/1365-2656.12345
external_id:
isi:
- '000353405300004'
pmid:
- '25646973'
file:
- access_level: open_access
checksum: 542a0b9b07e78050a81b35f26f0b82da
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:29Z
date_updated: 2020-07-14T12:45:19Z
file_id: '5350'
file_name: IST-2016-460-v1+1_McMahon_et_al-2015-Journal_of_Animal_Ecology.pdf
file_size: 1823045
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
issue: '3'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 615 - 624
pmid: 1
publication: Journal of Animal Ecology
publication_status: published
publisher: Wiley
publist_id: '5245'
pubrep_id: '460'
quality_controlled: '1'
related_material:
record:
- id: '9720'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'A sting in the spit: Widespread cross-infection of multiple RNA viruses across
wild and managed bees'
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: 84
year: '2015'
...
---
_id: '1856'
abstract:
- lang: eng
text: 'The traditional synthesis question given a specification asks for the automatic
construction of a system that satisfies the specification, whereas often there
exists a preference order among the different systems that satisfy the given specification.
Under a probabilistic assumption about the possible inputs, such a preference
order is naturally expressed by a weighted automaton, which assigns to each word
a value, such that a system is preferred if it generates a higher expected value.
We solve the following optimal synthesis problem: given an omega-regular specification,
a Markov chain that describes the distribution of inputs, and a weighted automaton
that measures how well a system satisfies the given specification under the input
assumption, synthesize a system that optimizes the measured value. For safety
specifications and quantitative measures that are defined by mean-payoff automata,
the optimal synthesis problem reduces to finding a strategy in a Markov decision
process (MDP) that is optimal for a long-run average reward objective, which can
be achieved in polynomial time. For general omega-regular specifications along
with mean-payoff automata, the solution rests on a new, polynomial-time algorithm
for computing optimal strategies in MDPs with mean-payoff parity objectives. Our
algorithm constructs optimal strategies that consist of two memoryless strategies
and a counter. The counter is in general not bounded. To obtain a finite-state
system, we show how to construct an ε-optimal strategy with a bounded counter,
for all ε > 0. Furthermore, we show how to decide in polynomial time if it
is possible to construct an optimal finite-state system (i.e., a system without
a counter) for a given specification. We have implemented our approach and the
underlying algorithms in a tool that takes qualitative and quantitative specifications
and automatically constructs a system that satisfies the qualitative specification
and optimizes the quantitative specification, if such a system exists. We present
some experimental results showing optimal systems that were automatically generated
in this way.'
article_number: '9'
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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Barbara
full_name: Jobstmann, Barbara
last_name: Jobstmann
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing
systems in probabilistic environments. Journal of the ACM. 2015;62(1).
doi:10.1145/2699430
apa: Chatterjee, K., Henzinger, T. A., Jobstmann, B., & Singh, R. (2015). Measuring
and synthesizing systems in probabilistic environments. Journal of the ACM.
ACM. https://doi.org/10.1145/2699430
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit
Singh. “Measuring and Synthesizing Systems in Probabilistic Environments.” Journal
of the ACM. ACM, 2015. https://doi.org/10.1145/2699430.
ieee: K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and
synthesizing systems in probabilistic environments,” Journal of the ACM,
vol. 62, no. 1. ACM, 2015.
ista: Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2015. Measuring and synthesizing
systems in probabilistic environments. Journal of the ACM. 62(1), 9.
mla: Chatterjee, Krishnendu, et al. “Measuring and Synthesizing Systems in Probabilistic
Environments.” Journal of the ACM, vol. 62, no. 1, 9, ACM, 2015, doi:10.1145/2699430.
short: K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, Journal of the ACM
62 (2015).
date_created: 2018-12-11T11:54:23Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T09:33:01Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2699430
ec_funded: 1
external_id:
arxiv:
- '1004.0739'
isi:
- '000350563000009'
intvolume: ' 62'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1004.0739
month: '02'
oa: 1
oa_version: Preprint
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 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: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '5244'
quality_controlled: '1'
related_material:
record:
- id: '3864'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Measuring and synthesizing systems in probabilistic environments
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 62
year: '2015'
...
---
_id: '1857'
abstract:
- lang: eng
text: 'Sharing information between multiple tasks enables algorithms to achieve
good generalization performance even from small amounts of training data. However,
in a realistic scenario of multi-task learning not all tasks are equally related
to each other, hence it could be advantageous to transfer information only between
the most related tasks. In this work we propose an approach that processes multiple
tasks in a sequence with sharing between subsequent tasks instead of solving all
tasks jointly. Subsequently, we address the question of curriculum learning of
tasks, i.e. finding the best order of tasks to be learned. Our approach is based
on a generalization bound criterion for choosing the task order that optimizes
the average expected classification performance over all tasks. Our experimental
results show that learning multiple related tasks sequentially can be more effective
than learning them jointly, the order in which tasks are being solved affects
the overall performance, and that our model is able to automatically discover
the favourable order of tasks. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Viktoriia
full_name: Sharmanska, Viktoriia
id: 2EA6D09E-F248-11E8-B48F-1D18A9856A87
last_name: Sharmanska
orcid: 0000-0003-0192-9308
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Sharmanska V, Lampert C. Curriculum learning of multiple tasks.
In: IEEE; 2015:5492-5500. doi:10.1109/CVPR.2015.7299188'
apa: 'Pentina, A., Sharmanska, V., & Lampert, C. (2015). Curriculum learning
of multiple tasks (pp. 5492–5500). Presented at the CVPR: Computer Vision and
Pattern Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7299188'
chicago: Pentina, Anastasia, Viktoriia Sharmanska, and Christoph Lampert. “Curriculum
Learning of Multiple Tasks,” 5492–5500. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7299188.
ieee: 'A. Pentina, V. Sharmanska, and C. Lampert, “Curriculum learning of multiple
tasks,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston,
MA, United States, 2015, pp. 5492–5500.'
ista: 'Pentina A, Sharmanska V, Lampert C. 2015. Curriculum learning of multiple
tasks. CVPR: Computer Vision and Pattern Recognition, 5492–5500.'
mla: Pentina, Anastasia, et al. Curriculum Learning of Multiple Tasks. IEEE,
2015, pp. 5492–500, doi:10.1109/CVPR.2015.7299188.
short: A. Pentina, V. Sharmanska, C. Lampert, in:, IEEE, 2015, pp. 5492–5500.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
corr_author: '1'
date_created: 2018-12-11T11:54:23Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-06-11T07:19:52Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7299188
external_id:
arxiv:
- '1412.1353'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1412.1353
month: '06'
oa: 1
oa_version: Preprint
page: 5492 - 5500
publication_status: published
publisher: IEEE
publist_id: '5243'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Curriculum learning of multiple tasks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1858'
abstract:
- lang: eng
text: 'We study the problem of predicting the future, though only in the probabilistic
sense of estimating a future state of a time-varying probability distribution.
This is not only an interesting academic problem, but solving this extrapolation
problem also has many practical application, e.g. for training classifiers that
have to operate under time-varying conditions. Our main contribution is a method
for predicting the next step of the time-varying distribution from a given sequence
of sample sets from earlier time steps. For this we rely on two recent machine
learning techniques: embedding probability distributions into a reproducing kernel
Hilbert space, and learning operators by vector-valued regression. We illustrate
the working principles and the practical usefulness of our method by experiments
on synthetic and real data. We also highlight an exemplary application: training
a classifier in a domain adaptation setting without having access to examples
from the test time distribution at training time.'
arxiv: 1
author:
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Lampert C. Predicting the future behavior of a time-varying probability distribution.
In: IEEE; 2015:942-950. doi:10.1109/CVPR.2015.7298696'
apa: 'Lampert, C. (2015). Predicting the future behavior of a time-varying probability
distribution (pp. 942–950). Presented at the CVPR: Computer Vision and Pattern
Recognition, Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298696'
chicago: Lampert, Christoph. “Predicting the Future Behavior of a Time-Varying Probability
Distribution,” 942–50. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298696.
ieee: 'C. Lampert, “Predicting the future behavior of a time-varying probability
distribution,” presented at the CVPR: Computer Vision and Pattern Recognition,
Boston, MA, United States, 2015, pp. 942–950.'
ista: 'Lampert C. 2015. Predicting the future behavior of a time-varying probability
distribution. CVPR: Computer Vision and Pattern Recognition, 942–950.'
mla: Lampert, Christoph. Predicting the Future Behavior of a Time-Varying Probability
Distribution. IEEE, 2015, pp. 942–50, doi:10.1109/CVPR.2015.7298696.
short: C. Lampert, in:, IEEE, 2015, pp. 942–950.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
corr_author: '1'
date_created: 2018-12-11T11:54:24Z
date_published: 2015-10-15T00:00:00Z
date_updated: 2024-10-09T20:56:24Z
day: '15'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7298696
external_id:
arxiv:
- '1406.5362'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1406.5362
month: '10'
oa: 1
oa_version: Preprint
page: 942 - 950
publication_status: published
publisher: IEEE
publist_id: '5241'
quality_controlled: '1'
scopus_import: 1
status: public
title: Predicting the future behavior of a time-varying probability distribution
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1859'
abstract:
- lang: eng
text: "Structural support vector machines (SSVMs) are amongst the best performing
models for structured computer vision tasks, such as semantic image segmentation
or human pose estimation. Training SSVMs, however, is computationally costly,
because it requires repeated calls to a structured prediction subroutine (called
\\emph{max-oracle}), which has to solve an optimization problem itself, e.g. a
graph cut.\r\nIn this work, we introduce a new algorithm for SSVM training that
is more efficient than earlier techniques when the max-oracle is computationally
expensive, as it is frequently the case in computer vision tasks. The main idea
is to (i) combine the recent stochastic Block-Coordinate Frank-Wolfe algorithm
with efficient hyperplane caching, and (ii) use an automatic selection rule for
deciding whether to call the exact max-oracle or to rely on an approximate one
based on the cached hyperplanes.\r\nWe show experimentally that this strategy
leads to faster convergence to the optimum with respect to the number of requires
oracle calls, and that this translates into faster convergence with respect to
the total runtime when the max-oracle is slow compared to the other steps of the
algorithm. "
article_processing_charge: No
arxiv: 1
author:
- first_name: Neel
full_name: Shah, Neel
id: 31ABAF80-F248-11E8-B48F-1D18A9856A87
last_name: Shah
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Shah N, Kolmogorov V, Lampert C. A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle. In: IEEE; 2015:2737-2745.
doi:10.1109/CVPR.2015.7298890'
apa: 'Shah, N., Kolmogorov, V., & Lampert, C. (2015). A multi-plane block-coordinate
Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp.
2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston,
MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7298890'
chicago: Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane
Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly
Max-Oracle,” 2737–45. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298890.
ieee: 'N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle,” presented at
the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp.
2737–2745.'
ista: 'Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe
algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer
Vision and Pattern Recognition, 2737–2745.'
mla: Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm
for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45,
doi:10.1109/CVPR.2015.7298890.
short: N. Shah, V. Kolmogorov, C. Lampert, in:, IEEE, 2015, pp. 2737–2745.
conference:
end_date: 2015-06-12
location: Boston, MA, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
corr_author: '1'
date_created: 2018-12-11T11:54:24Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2025-06-11T07:20:12Z
day: '01'
department:
- _id: VlKo
- _id: ChLa
doi: 10.1109/CVPR.2015.7298890
ec_funded: 1
external_id:
arxiv:
- '1408.6804'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1408.6804
month: '06'
oa: 1
oa_version: Preprint
page: 2737 - 2745
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication_status: published
publisher: IEEE
publist_id: '5240'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A multi-plane block-coordinate Frank-Wolfe algorithm for training structural
SVMs with a costly max-oracle
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1860'
abstract:
- lang: eng
text: Classifiers for object categorization are usually evaluated by their accuracy
on a set of i.i.d. test examples. This provides us with an estimate of the expected
error when applying the classifiers to a single new image. In real application,
however, classifiers are rarely only used for a single image and then discarded.
Instead, they are applied sequentially to many images, and these are typically
not i.i.d. samples from a fixed data distribution, but they carry dependencies
and their class distribution varies over time. In this work, we argue that the
phenomenon of correlated data at prediction time is not a nuisance, but a blessing
in disguise. We describe a probabilistic method for adapting classifiers at prediction
time without having to retrain them. We also introduce a framework for creating
realistically distributed image sequences, which offers a way to benchmark classifier
adaptation methods, such as the one we propose. Experiments on the ILSVRC2010
and ILSVRC2012 datasets show that adapting object classification systems at prediction
time can significantly reduce their error rate, even with no additional human
feedback.
author:
- first_name: Amélie
full_name: Royer, Amélie
last_name: Royer
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Royer A, Lampert C. Classifier adaptation at prediction time. In: IEEE; 2015:1401-1409.
doi:10.1109/CVPR.2015.7298746'
apa: 'Royer, A., & Lampert, C. (2015). Classifier adaptation at prediction time
(pp. 1401–1409). Presented at the CVPR: Computer Vision and Pattern Recognition,
Boston, MA, United States: IEEE. https://doi.org/10.1109/CVPR.2015.7298746'
chicago: Royer, Amélie, and Christoph Lampert. “Classifier Adaptation at Prediction
Time,” 1401–9. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298746.
ieee: 'A. Royer and C. Lampert, “Classifier adaptation at prediction time,” presented
at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, United States,
2015, pp. 1401–1409.'
ista: 'Royer A, Lampert C. 2015. Classifier adaptation at prediction time. CVPR:
Computer Vision and Pattern Recognition, 1401–1409.'
mla: Royer, Amélie, and Christoph Lampert. Classifier Adaptation at Prediction
Time. IEEE, 2015, pp. 1401–09, doi:10.1109/CVPR.2015.7298746.
short: A. Royer, C. Lampert, in:, IEEE, 2015, pp. 1401–1409.
conference:
end_date: 2015-06-12
location: Boston, MA, United States
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2015-06-07
date_created: 2018-12-11T11:54:24Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2021-01-12T06:53:41Z
day: '01'
department:
- _id: ChLa
doi: 10.1109/CVPR.2015.7298746
ec_funded: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.cv-foundation.org/openaccess/content_cvpr_2015/papers/Royer_Classifier_Adaptation_at_2015_CVPR_paper.pdf
month: '06'
oa: 1
oa_version: Submitted Version
page: 1401 - 1409
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication_status: published
publisher: IEEE
publist_id: '5239'
quality_controlled: '1'
scopus_import: 1
status: public
title: Classifier adaptation at prediction time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1861'
abstract:
- lang: eng
text: Continuous-time Markov chains are commonly used in practice for modeling biochemical
reaction networks in which the inherent randomness of themolecular interactions
cannot be ignored. This has motivated recent research effort into methods for
parameter inference and experiment design for such models. The major difficulty
is that such methods usually require one to iteratively solve the chemical master
equation that governs the time evolution of the probability distribution of the
system. This, however, is rarely possible, and even approximation techniques remain
limited to relatively small and simple systems. An alternative explored in this
article is to base methods on only some low-order moments of the entire probability
distribution. We summarize the theory behind such moment-based methods for parameter
inference and experiment design and provide new case studies where we investigate
their performance.
acknowledgement: "HYCON2; EC; European Commission\r\n"
article_number: '8'
article_processing_charge: No
author:
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: John
full_name: Lygeros, John
last_name: Lygeros
citation:
ama: Ruess J, Lygeros J. Moment-based methods for parameter inference and experiment
design for stochastic biochemical reaction networks. ACM Transactions on Modeling
and Computer Simulation. 2015;25(2). doi:10.1145/2688906
apa: Ruess, J., & Lygeros, J. (2015). Moment-based methods for parameter inference
and experiment design for stochastic biochemical reaction networks. ACM Transactions
on Modeling and Computer Simulation. ACM. https://doi.org/10.1145/2688906
chicago: Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference
and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions
on Modeling and Computer Simulation. ACM, 2015. https://doi.org/10.1145/2688906.
ieee: J. Ruess and J. Lygeros, “Moment-based methods for parameter inference and
experiment design for stochastic biochemical reaction networks,” ACM Transactions
on Modeling and Computer Simulation, vol. 25, no. 2. ACM, 2015.
ista: Ruess J, Lygeros J. 2015. Moment-based methods for parameter inference and
experiment design for stochastic biochemical reaction networks. ACM Transactions
on Modeling and Computer Simulation. 25(2), 8.
mla: Ruess, Jakob, and John Lygeros. “Moment-Based Methods for Parameter Inference
and Experiment Design for Stochastic Biochemical Reaction Networks.” ACM Transactions
on Modeling and Computer Simulation, vol. 25, no. 2, 8, ACM, 2015, doi:10.1145/2688906.
short: J. Ruess, J. Lygeros, ACM Transactions on Modeling and Computer Simulation
25 (2015).
date_created: 2018-12-11T11:54:25Z
date_published: 2015-02-01T00:00:00Z
date_updated: 2025-09-23T09:36:19Z
day: '01'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1145/2688906
external_id:
isi:
- '000354789200002'
intvolume: ' 25'
isi: 1
issue: '2'
language:
- iso: eng
month: '02'
oa_version: None
publication: ACM Transactions on Modeling and Computer Simulation
publication_status: published
publisher: ACM
publist_id: '5238'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Moment-based methods for parameter inference and experiment design for stochastic
biochemical reaction networks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 25
year: '2015'
...