---
_id: '18401'
abstract:
- lang: eng
text: Intel's newly-announced low-cost RealSense 3D camera claims significantly
better precision than other currently available low-cost platforms and is expected
to become ubiquitous in laptops and mobile devices starting this year. In this
paper, we demonstrate for the first time that the RealSense camera can be easily
converted into a real low-cost gaze tracker. Gaze has become increasingly relevant
as an input for human-computer interaction due to its association with attention.
It is also critical in clinical mental health diagnosis. We present a novel 3D
gaze and fixation tracker based on the eye surface geometry captured with the
RealSense 3D camera. First, eye surface 3D point clouds are segmented to extract
the pupil center and iris using registered infrared images. With non-ellipsoid
eye surface and single fixation point assumptions, pupil centers and iris normal
vectors are used to first estimate gaze (for each eye), and then a single fixation
point for both eyes simultaneously using a RANSAC-based approach. With a simple
learned bias field correction model, the fixation tracker demonstrates mean error
of approximately 1 cm at 20-30 cm, which is sufficiently adequate for gaze and
fixation tracking in human-computer interaction and mental health diagnosis applications.
article_number: '7351256'
article_processing_charge: No
author:
- first_name: Mark
full_name: Draelos, Mark
last_name: Draelos
- first_name: Qiang
full_name: Qiu, Qiang
last_name: Qiu
- 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: 'Draelos M, Qiu Q, Bronstein AM, Sapiro G. Intel realsense = Real low cost
gaze. In: 2015 IEEE International Conference on Image Processing (ICIP).
IEEE; 2015. doi:10.1109/icip.2015.7351256'
apa: 'Draelos, M., Qiu, Q., Bronstein, A. M., & Sapiro, G. (2015). Intel realsense
= Real low cost gaze. In 2015 IEEE International Conference on Image Processing
(ICIP). Quebec City, QC, Canada: IEEE. https://doi.org/10.1109/icip.2015.7351256'
chicago: Draelos, Mark, Qiang Qiu, Alex M. Bronstein, and Guillermo Sapiro. “Intel
Realsense = Real Low Cost Gaze.” In 2015 IEEE International Conference on Image
Processing (ICIP). IEEE, 2015. https://doi.org/10.1109/icip.2015.7351256.
ieee: M. Draelos, Q. Qiu, A. M. Bronstein, and G. Sapiro, “Intel realsense = Real
low cost gaze,” in 2015 IEEE International Conference on Image Processing (ICIP),
Quebec City, QC, Canada, 2015.
ista: Draelos M, Qiu Q, Bronstein AM, Sapiro G. 2015. Intel realsense = Real low
cost gaze. 2015 IEEE International Conference on Image Processing (ICIP). IEEE
International Conference on Image Processing, 7351256.
mla: Draelos, Mark, et al. “Intel Realsense = Real Low Cost Gaze.” 2015 IEEE
International Conference on Image Processing (ICIP), 7351256, IEEE, 2015,
doi:10.1109/icip.2015.7351256.
short: M. Draelos, Q. Qiu, A.M. Bronstein, G. Sapiro, in:, 2015 IEEE International
Conference on Image Processing (ICIP), IEEE, 2015.
conference:
end_date: 2015-09-30
location: Quebec City, QC, Canada
name: IEEE International Conference on Image Processing
start_date: 2015-09-27
date_created: 2024-10-15T11:20:54Z
date_published: 2015-12-10T00:00:00Z
date_updated: 2024-12-05T08:13:05Z
day: '10'
doi: 10.1109/icip.2015.7351256
extern: '1'
fulldoi: https://doi.org/10.1109/icip.2015.7351256
language:
- iso: eng
month: '12'
oa_version: None
publication: 2015 IEEE International Conference on Image Processing (ICIP)
publication_identifier:
eisbn:
- '9781479983391'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Intel realsense = Real low cost gaze
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1841'
abstract:
- lang: eng
text: We propose a new family of message passing techniques for MAP estimation in
graphical models which we call Sequential Reweighted Message Passing (SRMP). Special
cases include well-known techniques such as Min-Sum Diffusion (MSD) and a faster
Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation
is simpler than the original derivation of TRW-S, and does not involve a decomposition
into trees. This allows easy generalizations. The new family of algorithms can
be viewed as a generalization of TRW-S from pairwise to higher-order graphical
models. We test SRMP on several real-world problems with promising results.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465
apa: Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465
chicago: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE
Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015. https://doi.org/10.1109/TPAMI.2014.2363465.
ieee: V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930,
2015.
ista: Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions
on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
mla: Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions
on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015,
pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
short: V. Kolmogorov, IEEE Transactions on Pattern Analysis and Machine Intelligence
37 (2015) 919–930.
corr_author: '1'
date_created: 2018-12-11T11:54:18Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2025-09-22T14:33:14Z
day: '01'
department:
- _id: VlKo
doi: 10.1109/TPAMI.2014.2363465
ec_funded: 1
external_id:
arxiv:
- '1309.5655'
isi:
- '000352533000002'
fulldoi: https://doi.org/10.1109/TPAMI.2014.2363465
intvolume: ' 37'
isi: 1
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1309.5655
month: '05'
oa: 1
oa_version: Preprint
page: 919 - 930
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: IEEE Transactions on Pattern Analysis and Machine Intelligence
publication_status: published
publisher: IEEE
publist_id: '5261'
quality_controlled: '1'
related_material:
record:
- id: '2273'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: A new look at reweighted message passing
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 37
year: '2015'
...
---
_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'
fulldoi: https://doi.org/10.1109/tpami.2015.2392779
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'
fulldoi: https://doi.org/10.1109/tpami.2015.2408348
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'
fulldoi: https://doi.org/10.1111/cgf.12454
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'
fulldoi: https://doi.org/10.1111/cgf.12734
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'
fulldoi: https://doi.org/10.1364/oe.23.024547
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'
fulldoi: https://doi.org/10.4108/eai.14-10-2015.2261657
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: '1508'
abstract:
- lang: eng
text: We consider generalized Wigner ensembles and general β-ensembles with analytic
potentials for any β ≥ 1. The recent universality results in particular assert
that the local averages of consecutive eigenvalue gaps in the bulk of the spectrum
are universal in the sense that they coincide with those of the corresponding
Gaussian β-ensembles. In this article, we show that local averaging is not necessary
for this result, i.e. we prove that the single gap distributions in the bulk are
universal. In fact, with an additional step, our result can be extended to any
C4(ℝ) potential.
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Yau H. Gap universality of generalized Wigner and β ensembles. Journal
of the European Mathematical Society. 2015;17(8):1927-2036. doi:10.4171/JEMS/548
apa: Erdös, L., & Yau, H. (2015). Gap universality of generalized Wigner and
β ensembles. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/JEMS/548
chicago: Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and
β Ensembles.” Journal of the European Mathematical Society. EMS Press,
2015. https://doi.org/10.4171/JEMS/548.
ieee: L. Erdös and H. Yau, “Gap universality of generalized Wigner and β ensembles,”
Journal of the European Mathematical Society, vol. 17, no. 8. EMS Press,
pp. 1927–2036, 2015.
ista: Erdös L, Yau H. 2015. Gap universality of generalized Wigner and β ensembles.
Journal of the European Mathematical Society. 17(8), 1927–2036.
mla: Erdös, László, and Horng Yau. “Gap Universality of Generalized Wigner and β
Ensembles.” Journal of the European Mathematical Society, vol. 17, no.
8, EMS Press, 2015, pp. 1927–2036, doi:10.4171/JEMS/548.
short: L. Erdös, H. Yau, Journal of the European Mathematical Society 17 (2015)
1927–2036.
das_tickbox: '1'
date_created: 2018-12-11T11:52:26Z
date_published: 2015-08-01T00:00:00Z
date_updated: 2026-07-06T11:55:30Z
day: '01'
department:
- _id: LaEr
doi: 10.4171/JEMS/548
external_id:
arxiv:
- '1211.3786'
isi:
- '000360822900003'
fulldoi: https://doi.org/10.4171/JEMS/548
intvolume: ' 17'
isi: 1
issue: '8'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1211.3786
month: '08'
oa: 1
oa_version: Preprint
page: 1927 - 2036
publication: Journal of the European Mathematical Society
publication_status: published
publisher: EMS Press
publist_id: '5669'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Gap universality of generalized Wigner and β ensembles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2015'
...
---
_id: '1832'
abstract:
- lang: eng
text: 'Linearizability of concurrent data structures is usually proved by monolithic
simulation arguments relying on the identification of the so-called linearization
points. Regrettably, such proofs, whether manual or automatic, are often complicated
and scale poorly to advanced non-blocking concurrency patterns, such as helping
and optimistic updates. In response, we propose a more modular way of checking
linearizability of concurrent queue algorithms that does not involve identifying
linearization points. We reduce the task of proving linearizability with respect
to the queue specification to establishing four basic properties, each of which
can be proved independently by simpler arguments. As a demonstration of our approach,
we verify the Herlihy and Wing queue, an algorithm that is challenging to verify
by a simulation proof. '
article_number: '20'
article_processing_charge: No
article_type: original
author:
- first_name: Soham
full_name: Chakraborty, Soham
last_name: Chakraborty
- 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: Ali
full_name: Sezgin, Ali
last_name: Sezgin
- first_name: Viktor
full_name: Vafeiadis, Viktor
last_name: Vafeiadis
citation:
ama: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability
proofs. Logical Methods in Computer Science. 2015;11(1). doi:10.2168/LMCS-11(1:20)2015
apa: Chakraborty, S., Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2015).
Aspect-oriented linearizability proofs. Logical Methods in Computer Science.
International Federation for Computational Logic. https://doi.org/10.2168/LMCS-11(1:20)2015
chicago: Chakraborty, Soham, Thomas A Henzinger, Ali Sezgin, and Viktor Vafeiadis.
“Aspect-Oriented Linearizability Proofs.” Logical Methods in Computer Science.
International Federation for Computational Logic, 2015. https://doi.org/10.2168/LMCS-11(1:20)2015.
ieee: S. Chakraborty, T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented
linearizability proofs,” Logical Methods in Computer Science, vol. 11,
no. 1. International Federation for Computational Logic, 2015.
ista: Chakraborty S, Henzinger TA, Sezgin A, Vafeiadis V. 2015. Aspect-oriented
linearizability proofs. Logical Methods in Computer Science. 11(1), 20.
mla: Chakraborty, Soham, et al. “Aspect-Oriented Linearizability Proofs.” Logical
Methods in Computer Science, vol. 11, no. 1, 20, International Federation
for Computational Logic, 2015, doi:10.2168/LMCS-11(1:20)2015.
short: S. Chakraborty, T.A. Henzinger, A. Sezgin, V. Vafeiadis, Logical Methods
in Computer Science 11 (2015).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:54:15Z
date_published: 2015-04-01T00:00:00Z
date_updated: 2026-07-06T13:24:05Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.2168/LMCS-11(1:20)2015
ec_funded: 1
external_id:
isi:
- '000353193000019'
file:
- access_level: open_access
checksum: 7370e164d0a731f442424a92669efc34
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:27Z
date_updated: 2020-07-14T12:45:17Z
file_id: '4881'
file_name: IST-2015-390-v1+1_1502.07639.pdf
file_size: 380203
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
fulldoi: https://doi.org/10.2168/LMCS-11(1:20)2015
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '5271'
pubrep_id: '390'
quality_controlled: '1'
related_material:
record:
- id: '2328'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Aspect-oriented linearizability proofs
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 11
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1610'
abstract:
- lang: eng
text: The edit distance between two words w1, w2 is the minimal number of word operations
(letter insertions, deletions, and substitutions) necessary to transform w1 to
w2. The edit distance generalizes to languages L1,L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses. The problem of computing edit
distance to pushdown automata is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under\r\ngrant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects\r\nS11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award), FWF Grant No P23499-\r\nN23,
FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph\r\nGames), and
MSR faculty fellows award."
alternative_title:
- LNCS
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. In: 42nd International Colloquium on Automata, Languages, and Programming.
Vol 9135. Springer Nature; 2015:121-133. doi:10.1007/978-3-662-47666-6_10'
apa: 'Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. In 42nd International Colloquium on Automata,
Languages, and Programming (Vol. 9135, pp. 121–133). Kyoto, Japan: Springer
Nature. https://doi.org/10.1007/978-3-662-47666-6_10'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium
on Automata, Languages, and Programming, 9135:121–33. Springer Nature, 2015.
https://doi.org/10.1007/978-3-662-47666-6_10.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” in 42nd International Colloquium on Automata, Languages,
and Programming, Kyoto, Japan, 2015, vol. 9135, no. Part II, pp. 121–133.
ista: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata. 42nd International Colloquium on Automata, Languages, and Programming.
ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 121–133.'
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd
International Colloquium on Automata, Languages, and Programming, vol. 9135,
no. Part II, Springer Nature, 2015, pp. 121–33, doi:10.1007/978-3-662-47666-6_10.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International
Colloquium on Automata, Languages, and Programming, Springer Nature, 2015, pp.
121–133.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:01Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-07-06T13:27:53Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-47666-6_10
ec_funded: 1
external_id:
arxiv:
- '1504.08259'
isi:
- '000364317900010'
fulldoi: https://doi.org/10.1007/978-3-662-47666-6_10
intvolume: ' 9135'
isi: 1
issue: Part II
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.08259
month: '07'
oa: 1
oa_version: Preprint
page: 121 - 133
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 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
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 42nd International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- 978-3-662-47665-9
publication_status: published
publisher: Springer Nature
publist_id: '5556'
pubrep_id: '321'
quality_controlled: '1'
related_material:
record:
- id: '5438'
relation: earlier_version
status: public
- id: '465'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Edit distance for pushdown automata
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9135
year: '2015'
...
---
OA_place: repository
OA_type: green
_id: '1657'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. There exist two different views: (i) ~the expectation
semantics, where the goal is to optimize the expected mean-payoff objective, and
(ii) ~the satisfaction semantics, where the goal is to maximize the probability
of runs such that the mean-payoff value stays above a given vector. We consider
optimization with respect to both objectives at once, thus unifying the existing
semantics. Precisely, the goal is to optimize the expectation while ensuring the
satisfaction constraint. Our problem captures the notion of optimization with
respect to strategies that are risk-averse (i.e., Ensure certain probabilistic
guarantee). Our main results are as follows: First, we present algorithms for
the decision problems, which are always polynomial in the size of the MDP. We
also show that an approximation of the Pareto curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions. Second, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem. '
acknowledgement: "A Technical Report of this paper is available at DOI: 10.15479/AT:IST-2015-318-v1-1\r\n"
alternative_title:
- LICS
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: Zuzana
full_name: Komárková, Zuzana
last_name: Komárková
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komárková Z, Kretinsky J. Unifying two views on multiple mean-payoff
objectives in Markov decision processes. 2015:244-256. doi:10.1109/LICS.2015.32
apa: 'Chatterjee, K., Komárková, Z., & Kretinsky, J. (2015). Unifying two views
on multiple mean-payoff objectives in Markov decision processes. Presented at
the LICS: Logic in Computer Science, Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.32'
chicago: Chatterjee, Krishnendu, Zuzana Komárková, and Jan Kretinsky. “Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.” LICS.
IEEE, 2015. https://doi.org/10.1109/LICS.2015.32.
ieee: K. Chatterjee, Z. Komárková, and J. Kretinsky, “Unifying two views on multiple
mean-payoff objectives in Markov decision processes.” IEEE, pp. 244–256, 2015.
ista: Chatterjee K, Komárková Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes. , 244–256.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IEEE, 2015, pp. 244–56, doi:10.1109/LICS.2015.32.
short: K. Chatterjee, Z. Komárková, J. Kretinsky, (2015) 244–256.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:18Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-07-06T13:26:26Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1109/LICS.2015.32
ec_funded: 1
external_id:
isi:
- '000380427100024'
fulldoi: https://doi.org/10.1109/LICS.2015.32
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.15479/AT:IST-2015-318-v1-1
month: '07'
oa: 1
oa_version: Preprint
page: 244 - 256
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: IEEE
publist_id: '5493'
quality_controlled: '1'
related_material:
record:
- id: '5429'
relation: earlier_version
status: public
- id: '5435'
relation: earlier_version
status: public
- id: '466'
relation: later_version
status: public
scopus_import: '1'
series_title: LICS
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2015'
...
---
_id: '5435'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. \r\nThere have been two different views: (i) the
expectation semantics, where the goal is to optimize the expected mean-payoff
objective, and (ii) the satisfaction semantics, where the goal is to maximize
the probability of runs such that the mean-payoff value stays above a given vector.
\ \r\nWe consider the problem where the goal is to optimize the expectation under
the constraint that the satisfaction semantics is ensured, and thus consider a
generalization that unifies the existing semantics. Our problem captures the notion
of optimization with respect to strategies that are risk-averse (i.e., ensures
certain probabilistic guarantee).\r\nOur main results are algorithms for the decision
problem which are always polynomial in the size of the MDP.\r\nWe also show that
an approximation of the Pareto-curve can be computed in time polynomial in the
size of the MDP, and the approximation factor, but exponential in the number of
dimensions. Finally, we present a complete characterization of the strategy complexity
(in terms of memory bounds and randomization) required to solve our problem."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Komarkova, Zuzana
last_name: Komarkova
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v2-1
apa: Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two
views on multiple mean-payoff objectives in Markov decision processes. IST
Austria. https://doi.org/10.15479/AT:IST-2015-318-v2-1
chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v2-1.
ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple
mean-payoff objectives in Markov decision processes. IST Austria, 2015.
ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes, IST Austria, 51p.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v2-1.
short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-02-23T00:00:00Z
date_updated: 2026-07-06T13:26:26Z
day: '23'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v2-1
file:
- access_level: open_access
checksum: 75284adec80baabdfe71ff9ebbc27445
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:03Z
date_updated: 2020-07-14T12:46:53Z
file_id: '5525'
file_name: IST-2015-318-v2+1_main.pdf
file_size: 717630
relation: main_file
file_date_updated: 2020-07-14T12:46:53Z
fulldoi: https://doi.org/10.15479/AT:IST-2015-318-v2-1
has_accepted_license: '1'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: '51'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '327'
related_material:
record:
- id: '5429'
relation: earlier_version
status: public
- id: '1657'
relation: later_version
status: public
- id: '466'
relation: later_version
status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5429'
abstract:
- lang: eng
text: "We consider Markov decision processes (MDPs) with multiple limit-average
(or mean-payoff) objectives. \r\nThere have been two different views: (i) the
expectation semantics, where the goal is to optimize the expected mean-payoff
objective, and (ii) the satisfaction semantics, where the goal is to maximize
the probability of runs such that the mean-payoff value stays above a given vector.
\ \r\nWe consider the problem where the goal is to optimize the expectation under
the constraint that the satisfaction semantics is ensured, and thus consider a
generalization that unifies the existing semantics.\r\nOur problem captures the
notion of optimization with respect to strategies that are risk-averse (i.e.,
ensures certain probabilistic guarantee).\r\nOur main results are algorithms for
the decision problem which are always polynomial in the size of the MDP. We also
show that an approximation of the Pareto-curve can be computed in time polynomial
in the size of the MDP, and the approximation factor, but exponential in the number
of dimensions.\r\nFinally, we present a complete characterization of the strategy
complexity (in terms of memory bounds and randomization) required to solve our
problem."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Zuzana
full_name: Komarkova, Zuzana
last_name: Komarkova
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: Chatterjee K, Komarkova Z, Kretinsky J. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria; 2015. doi:10.15479/AT:IST-2015-318-v1-1
apa: Chatterjee, K., Komarkova, Z., & Kretinsky, J. (2015). Unifying two
views on multiple mean-payoff objectives in Markov decision processes. IST
Austria. https://doi.org/10.15479/AT:IST-2015-318-v1-1
chicago: Chatterjee, Krishnendu, Zuzana Komarkova, and Jan Kretinsky. Unifying
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-318-v1-1.
ieee: K. Chatterjee, Z. Komarkova, and J. Kretinsky, Unifying two views on multiple
mean-payoff objectives in Markov decision processes. IST Austria, 2015.
ista: Chatterjee K, Komarkova Z, Kretinsky J. 2015. Unifying two views on multiple
mean-payoff objectives in Markov decision processes, IST Austria, 41p.
mla: Chatterjee, Krishnendu, et al. Unifying Two Views on Multiple Mean-Payoff
Objectives in Markov Decision Processes. IST Austria, 2015, doi:10.15479/AT:IST-2015-318-v1-1.
short: K. Chatterjee, Z. Komarkova, J. Kretinsky, Unifying Two Views on Multiple
Mean-Payoff Objectives in Markov Decision Processes, IST Austria, 2015.
date_created: 2018-12-12T11:39:17Z
date_published: 2015-01-12T00:00:00Z
date_updated: 2026-07-06T13:26:26Z
day: '12'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-318-v1-1
file:
- access_level: open_access
checksum: e4869a584567c506349abda9c8ec7db3
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:11Z
date_updated: 2020-07-14T12:46:52Z
file_id: '5533'
file_name: IST-2015-318-v1+1_main.pdf
file_size: 689863
relation: main_file
file_date_updated: 2020-07-14T12:46:52Z
fulldoi: https://doi.org/10.15479/AT:IST-2015-318-v1-1
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '41'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '318'
related_material:
record:
- id: '5435'
relation: later_version
status: public
- id: '1657'
relation: later_version
status: public
- id: '466'
relation: later_version
status: public
status: public
title: Unifying two views on multiple mean-payoff objectives in Markov decision processes
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5438'
abstract:
- lang: eng
text: "The edit distance between two words w1, w2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses.\r\nThe problem of computing edit
distance to a pushdown automaton is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown
Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance
for pushdown automata. IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata, IST Austria, 15p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata.
IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for
Pushdown Automata, IST Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-05T00:00:00Z
date_updated: 2026-07-06T13:27:53Z
day: '05'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-334-v1-1
file:
- access_level: open_access
checksum: 8a5f2d77560e552af87eb1982437a43b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:56Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5518'
file_name: IST-2015-334-v1+1_report.pdf
file_size: 422573
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
fulldoi: https://doi.org/10.15479/AT:IST-2015-334-v1-1
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '15'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '334'
related_material:
record:
- id: '1610'
relation: later_version
status: public
- id: '465'
relation: later_version
status: public
status: public
title: Edit distance for pushdown automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1661'
abstract:
- lang: eng
text: The computation of the winning set for one-pair Streett objectives and for
k-pair Streett objectives in (standard) graphs as well as in game graphs are central
problems in computer-aided verification, with application to the verification
of closed systems with strong fairness conditions, the verification of open systems,
checking interface compatibility, well-formed ness of specifications, and the
synthesis of reactive systems. We give faster algorithms for the computation of
the winning set for (1) one-pair Streett objectives (aka parity-3 problem) in
game graphs and (2) for k-pair Streett objectives in graphs. For both problems
this represents the first improvement in asymptotic running time in 15 years.
acknowledgement: 'K. C. is supported by the Austrian Science Fund (FWF): P23499-N23
and S11407-N23 (RiSE), an ERC Start Grant (279307: Graph Games), and a Microsoft
Faculty Fellows Award. M. H. is supported by the Austrian Science Fund (FWF): P23499-N23
and the Vienna Science and Technology Fund (WWTF) grant ICT10-002. V. L. is supported
by the Vienna Science and Technology Fund (WWTF) grant ICT10-002. The research leading
to these results has received funding from the European Research Council under the
European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement
no. 340506.'
article_number: '7174888'
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Veronika
full_name: Loitzenbauer, Veronika
last_name: Loitzenbauer
citation:
ama: 'Chatterjee K, Henzinger M, Loitzenbauer V. Improved algorithms for one-pair
and k-pair Streett objectives. In: Proceedings - Symposium on Logic in Computer
Science. Vol 2015-July. IEEE; 2015. doi:10.1109/LICS.2015.34'
apa: 'Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2015). Improved algorithms
for one-pair and k-pair Streett objectives. In Proceedings - Symposium on Logic
in Computer Science (Vol. 2015–July). Kyoto, Japan: IEEE. https://doi.org/10.1109/LICS.2015.34'
chicago: Chatterjee, Krishnendu, Monika Henzinger, and Veronika Loitzenbauer. “Improved
Algorithms for One-Pair and k-Pair Streett Objectives.” In Proceedings - Symposium
on Logic in Computer Science, Vol. 2015–July. IEEE, 2015. https://doi.org/10.1109/LICS.2015.34.
ieee: K. Chatterjee, M. Henzinger, and V. Loitzenbauer, “Improved algorithms for
one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic
in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
ista: 'Chatterjee K, Henzinger M, Loitzenbauer V. 2015. Improved algorithms for
one-pair and k-pair Streett objectives. Proceedings - Symposium on Logic in Computer
Science. LICS: Logic in Computer Science vol. 2015–July, 7174888.'
mla: Chatterjee, Krishnendu, et al. “Improved Algorithms for One-Pair and k-Pair
Streett Objectives.” Proceedings - Symposium on Logic in Computer Science,
vol. 2015–July, 7174888, IEEE, 2015, doi:10.1109/LICS.2015.34.
short: K. Chatterjee, M. Henzinger, V. Loitzenbauer, in:, Proceedings - Symposium
on Logic in Computer Science, IEEE, 2015.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'LICS: Logic in Computer Science'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:19Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2026-07-06T13:28:05Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2015.34
ec_funded: 1
external_id:
isi:
- '000380427100026'
fulldoi: https://doi.org/10.1109/LICS.2015.34
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/4368/
month: '07'
oa: 1
oa_version: Submitted 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: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings - Symposium on Logic in Computer Science
publication_status: published
publisher: IEEE
publist_id: '5489'
quality_controlled: '1'
related_material:
record:
- id: '464'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Improved algorithms for one-pair and k-pair Streett objectives
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 2015-July
year: '2015'
...
---
_id: '1566'
abstract:
- lang: eng
text: Deposits of misfolded proteins in the human brain are associated with the
development of many neurodegenerative diseases. Recent studies show that these
proteins have common traits even at the monomer level. Among them, a polyglutamine
region that is present in huntingtin is known to exhibit a correlation between
the length of the chain and the severity as well as the earliness of the onset
of Huntington disease. Here, we apply bias exchange molecular dynamics to generate
structures of polyglutamine expansions of several lengths and characterize the
resulting independent conformations. We compare the properties of these conformations
to those of the standard proteins, as well as to other homopolymeric tracts. We
find that, similar to the previously studied polyvaline chains, the set of possible
transient folds is much broader than the set of known-to-date folds, although
the conformations have different structures. We show that the mechanical stability
is not related to any simple geometrical characteristics of the structures. We
demonstrate that long polyglutamine expansions result in higher mechanical stability
than the shorter ones. They also have a longer life span and are substantially
more prone to form knotted structures. The knotted region has an average length
of 35 residues, similar to the typical threshold for most polyglutamine-related
diseases. Similarly, changes in shape and mechanical stability appear once the
total length of the peptide exceeds this threshold of 35 glutamine residues. We
suggest that knotted conformers may also harm the cellular machinery and thus
lead to disease.
acknowledgement: 'We acknowledge the support by the EU Joint Programme in Neurodegenerative
Diseases (JPND AC14/00037) project. The project is supported through the following
funding organisations under the aegis of JPND—www.jpnd.eu: Ireland, HRB; Poland,
National Science Centre; and Spain, ISCIII. '
article_number: e1004541
article_processing_charge: No
author:
- first_name: Àngel
full_name: Gómez Sicilia, Àngel
last_name: Gómez Sicilia
- first_name: Mateusz K
full_name: Sikora, Mateusz K
id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
last_name: Sikora
- first_name: Marek
full_name: Cieplak, Marek
last_name: Cieplak
- first_name: Mariano
full_name: Carrión Vázquez, Mariano
last_name: Carrión Vázquez
citation:
ama: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of
the universe of polyglutamine structures. PLoS Computational Biology. 2015;11(10).
doi:10.1371/journal.pcbi.1004541
apa: Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015).
An exploration of the universe of polyglutamine structures. PLoS Computational
Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004541
chicago: Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión
Vázquez. “An Exploration of the Universe of Polyglutamine Structures.” PLoS
Computational Biology. Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004541.
ieee: À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration
of the universe of polyglutamine structures,” PLoS Computational Biology,
vol. 11, no. 10. Public Library of Science, 2015.
ista: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration
of the universe of polyglutamine structures. PLoS Computational Biology. 11(10),
e1004541.
mla: Gómez Sicilia, Àngel, et al. “An Exploration of the Universe of Polyglutamine
Structures.” PLoS Computational Biology, vol. 11, no. 10, e1004541, Public
Library of Science, 2015, doi:10.1371/journal.pcbi.1004541.
short: À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, PLoS Computational
Biology 11 (2015).
date_created: 2018-12-11T11:52:45Z
date_published: 2015-10-23T00:00:00Z
date_updated: 2026-07-06T13:54:28Z
day: '23'
ddc:
- '570'
department:
- _id: CaHe
doi: 10.1371/journal.pcbi.1004541
external_id:
isi:
- '000364399700067'
file:
- access_level: open_access
checksum: 8b67d729be663bfc9af04bfd94459655
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:21Z
date_updated: 2020-07-14T12:45:02Z
file_id: '5207'
file_name: IST-2016-478-v1+1_journal.pcbi.1004541.pdf
file_size: 1412511
relation: main_file
file_date_updated: 2020-07-14T12:45:02Z
fulldoi: https://doi.org/10.1371/journal.pcbi.1004541
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '5605'
pubrep_id: '478'
quality_controlled: '1'
related_material:
record:
- id: '9714'
relation: research_data
status: public
scopus_import: '1'
status: public
title: An exploration of the universe of polyglutamine structures
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: 11
year: '2015'
...
---
_id: '9714'
article_processing_charge: No
author:
- first_name: Àngel
full_name: Gómez Sicilia, Àngel
last_name: Gómez Sicilia
- first_name: Mateusz K
full_name: Sikora, Mateusz K
id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
last_name: Sikora
- first_name: Marek
full_name: Cieplak, Marek
last_name: Cieplak
- first_name: Mariano
full_name: Carrión Vázquez, Mariano
last_name: Carrión Vázquez
citation:
ama: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of
the universe of polyglutamine structures - submission to PLOS journals. 2015.
doi:10.1371/journal.pcbi.1004541.s001
apa: Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015).
An exploration of the universe of polyglutamine structures - submission to PLOS
journals. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004541.s001
chicago: Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión
Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission
to PLOS Journals.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004541.s001.
ieee: À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration
of the universe of polyglutamine structures - submission to PLOS journals.” Public
Library of Science, 2015.
ista: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration
of the universe of polyglutamine structures - submission to PLOS journals, Public
Library of Science, 10.1371/journal.pcbi.1004541.s001.
mla: Gómez Sicilia, Àngel, et al. An Exploration of the Universe of Polyglutamine
Structures - Submission to PLOS Journals. Public Library of Science, 2015,
doi:10.1371/journal.pcbi.1004541.s001.
short: À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).
date_created: 2021-07-23T12:05:28Z
date_published: 2015-10-23T00:00:00Z
date_updated: 2026-07-06T13:54:29Z
day: '23'
department:
- _id: CaHe
doi: 10.1371/journal.pcbi.1004541.s001
fulldoi: https://doi.org/10.1371/journal.pcbi.1004541.s001
month: '10'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1566'
relation: used_in_publication
status: public
status: public
title: An exploration of the universe of polyglutamine structures - submission to
PLOS journals
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1555'
abstract:
- lang: eng
text: We show that incorporating spatial dispersal of individuals into a simple
vaccination epidemic model may give rise to a model that exhibits rich dynamical
behavior. Using an SIVS (susceptible-infected-vaccinated-susceptible) model as
a basis, we describe the spread of an infectious disease in a population split
into two regions. In each subpopulation, both forward and backward bifurcations
can occur. This implies that for disconnected regions the two-patch system may
admit several steady states. We consider traveling between the regions and investigate
the impact of spatial dispersal of individuals on the model dynamics. We establish
conditions for the existence of multiple nontrivial steady states in the system,
and we study the structure of the equilibria. The mathematical analysis reveals
an unusually rich dynamical behavior, not normally found in the simple epidemic
models. In addition to the disease-free equilibrium, eight endemic equilibria
emerge from backward transcritical and saddle-node bifurcation points, forming
an interesting bifurcation diagram. Stability of steady states, their bifurcations,
and the global dynamics are investigated with analytical tools, numerical simulations,
and rigorous set-oriented numerical computations.
acknowledgement: Institute of Science and Technology Austria, Am Campus 1, 3400 Klosterneuburg,
Austria (pawel.pilarczyk@ist.ac.at). This author’s work was partially supported
by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework
Programme (FP7/2007-2013) under REA grant agreement 622033, by Fundo Europeu de
Desenvolvimento Regional (FEDER) through COMPETE—Programa Operacional Factores de
Competitividade (POFC), by the Portuguese national funds through Funda ̧caoparaaCiˆencia
e a Tecnologia (FCT) in the framework of the research project FCOMP-01-0124-FEDER-010645
(ref. FCT PTDC/MAT/098871/2008), and by European Research Council through StG 259559
in the framework of the EPIDELAY project.
article_processing_charge: No
article_type: original
author:
- first_name: Diána
full_name: Knipl, Diána
last_name: Knipl
- first_name: Pawel
full_name: Pilarczyk, Pawel
id: 3768D56A-F248-11E8-B48F-1D18A9856A87
last_name: Pilarczyk
- first_name: Gergely
full_name: Röst, Gergely
last_name: Röst
citation:
ama: Knipl D, Pilarczyk P, Röst G. Rich bifurcation structure in a two patch vaccination
model. SIAM Journal on Applied Dynamical Systems. 2015;14(2):980-1017.
doi:10.1137/140993934
apa: Knipl, D., Pilarczyk, P., & Röst, G. (2015). Rich bifurcation structure
in a two patch vaccination model. SIAM Journal on Applied Dynamical Systems.
Society for Industrial and Applied Mathematics. https://doi.org/10.1137/140993934
chicago: Knipl, Diána, Pawel Pilarczyk, and Gergely Röst. “Rich Bifurcation Structure
in a Two Patch Vaccination Model.” SIAM Journal on Applied Dynamical Systems.
Society for Industrial and Applied Mathematics, 2015. https://doi.org/10.1137/140993934.
ieee: D. Knipl, P. Pilarczyk, and G. Röst, “Rich bifurcation structure in a two
patch vaccination model,” SIAM Journal on Applied Dynamical Systems, vol.
14, no. 2. Society for Industrial and Applied Mathematics, pp. 980–1017, 2015.
ista: Knipl D, Pilarczyk P, Röst G. 2015. Rich bifurcation structure in a two patch
vaccination model. SIAM Journal on Applied Dynamical Systems. 14(2), 980–1017.
mla: Knipl, Diána, et al. “Rich Bifurcation Structure in a Two Patch Vaccination
Model.” SIAM Journal on Applied Dynamical Systems, vol. 14, no. 2, Society
for Industrial and Applied Mathematics, 2015, pp. 980–1017, doi:10.1137/140993934.
short: D. Knipl, P. Pilarczyk, G. Röst, SIAM Journal on Applied Dynamical Systems
14 (2015) 980–1017.
das_tickbox: '1'
date_created: 2018-12-11T11:52:42Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2026-07-06T13:59:25Z
day: '01'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.1137/140993934
ec_funded: 1
external_id:
isi:
- '000357310400015'
fulldoi: https://doi.org/10.1137/140993934
intvolume: ' 14'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://discovery.ucl.ac.uk/1473750/1/99393.pdf
month: '01'
oa: 1
oa_version: Published Version
page: 980 - 1017
project:
- _id: 255F06BE-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '622033'
name: Persistent Homology - Images, Data and Maps
publication: SIAM Journal on Applied Dynamical Systems
publication_identifier:
eissn:
- 1536-0040
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '5616'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rich bifurcation structure in a two patch vaccination model
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 14
year: '2015'
...
---
OA_place: publisher
OA_type: gold
_id: '1525'
abstract:
- lang: eng
text: 'Based on 16 recommendations, efforts should be made to achieve the following
goal: By 2025, all scholarly publication activity in Austria should be Open Access.
In other words, the final versions of all scholarly publications resulting from
the support of public resources must be freely accessible on the Internet without
delay (Gold Open Access). The resources required to meet this obligation shall
be provided to the authors, or the cost of the publication venues shall be borne
directly by the research organisations.'
article_processing_charge: No
article_type: original
author:
- first_name: Bruno
full_name: Bauer, Bruno
last_name: Bauer
- first_name: Guido
full_name: Blechl, Guido
last_name: Blechl
- first_name: Christoph
full_name: Bock, Christoph
last_name: Bock
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Andreas
full_name: Ferus, Andreas
last_name: Ferus
- first_name: Anton
full_name: Graschopf, Anton
last_name: Graschopf
- first_name: Thomas
full_name: König, Thomas
last_name: König
- first_name: Katja
full_name: Mayer, Katja
last_name: Mayer
- first_name: Falk
full_name: Reckling, Falk
last_name: Reckling
- first_name: Katharina
full_name: Rieck, Katharina
last_name: Rieck
- first_name: Peter
full_name: Seitz, Peter
last_name: Seitz
- first_name: Herwig
full_name: Stöger, Herwig
last_name: Stöger
- first_name: Elvira
full_name: Welzig, Elvira
last_name: Welzig
citation:
ama: Bauer B, Blechl G, Bock C, et al. Arbeitsgruppe „Nationale Strategie“ des Open
Access Network Austria OANA. VÖB Mitteilungen. 2015;68(3):580-607. doi:10.5281/zenodo.33178
apa: Bauer, B., Blechl, G., Bock, C., Danowski, P., Ferus, A., Graschopf, A., …
Welzig, E. (2015). Arbeitsgruppe „Nationale Strategie“ des Open Access Network
Austria OANA. VÖB Mitteilungen. Vereinigung Österreichischer Bibliothekarinnen
und Bibliothekare. https://doi.org/10.5281/zenodo.33178
chicago: Bauer, Bruno, Guido Blechl, Christoph Bock, Patrick Danowski, Andreas Ferus,
Anton Graschopf, Thomas König, et al. “Arbeitsgruppe „Nationale Strategie“ Des
Open Access Network Austria OANA.” VÖB Mitteilungen. Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare, 2015. https://doi.org/10.5281/zenodo.33178.
ieee: B. Bauer et al., “Arbeitsgruppe „Nationale Strategie“ des Open Access
Network Austria OANA,” VÖB Mitteilungen, vol. 68, no. 3. Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare, pp. 580–607, 2015.
ista: Bauer B, Blechl G, Bock C, Danowski P, Ferus A, Graschopf A, König T, Mayer
K, Reckling F, Rieck K, Seitz P, Stöger H, Welzig E. 2015. Arbeitsgruppe „Nationale
Strategie“ des Open Access Network Austria OANA. VÖB Mitteilungen. 68(3), 580–607.
mla: Bauer, Bruno, et al. “Arbeitsgruppe „Nationale Strategie“ Des Open Access Network
Austria OANA.” VÖB Mitteilungen, vol. 68, no. 3, Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare, 2015, pp. 580–607, doi:10.5281/zenodo.33178.
short: B. Bauer, G. Blechl, C. Bock, P. Danowski, A. Ferus, A. Graschopf, T. König,
K. Mayer, F. Reckling, K. Rieck, P. Seitz, H. Stöger, E. Welzig, VÖB Mitteilungen
68 (2015) 580–607.
das_tickbox: '1'
date_created: 2018-12-11T11:52:31Z
date_published: 2015-11-12T00:00:00Z
date_updated: 2026-07-07T06:11:42Z
day: '12'
ddc:
- '020'
department:
- _id: E-Lib
doi: 10.5281/zenodo.33178
file:
- access_level: open_access
checksum: a495fe253bbc7615b1d60e9e85c94408
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:59Z
date_updated: 2020-07-14T12:45:00Z
file_id: '5317'
file_name: IST-2016-720-v1+1_OANA_OA-Empfehlungen_12-11-2015.pdf
file_size: 931707
relation: main_file
file_date_updated: 2020-07-14T12:45:00Z
fulldoi: https://doi.org/10.5281/zenodo.33178
has_accepted_license: '1'
intvolume: ' 68'
issue: '3'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 580 - 607
publication: VÖB Mitteilungen
publication_status: published
publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '5648'
pubrep_id: '720'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Arbeitsgruppe „Nationale Strategie“ des Open Access Network Austria OANA
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2015'
...