---
_id: '18352'
abstract:
- lang: eng
text: Feature-based analysis is becoming a very popular approach for geometric shape
analysis. Following the success of this approach in image analysis, there is a
growing interest in finding analogous methods in the 3D world. Maximally stable
component detection is a low computation cost and high repeatability method for
feature detection in images.In this study, a diffusion-geometry based framework
for stable component detection is presented, which can be used for geometric feature
detection in deformable shapes.The vast majority of studies of deformable 3D shapes
models them as the two-dimensional boundary of the volume of the shape. Recent
works have shown that a volumetric shape model is advantageous in numerous ways
as it better captures the natural behavior of non-rigid deformations. We show
that our framework easily adapts to this volumetric approach, and even demonstrates
superior performance.A quantitative evaluation of our methods on the SHREC’10
and SHREC’11 feature detection benchmarks as well as qualitative tests on the
SCAPE dataset show its potential as a source of high-quality features. Examples
demonstrating the drawbacks of surface stable components and the advantage of
their volumetric counterparts are also presented.
alternative_title:
- Mathematics and Visualization
article_processing_charge: No
author:
- first_name: Roee
full_name: Litman, Roee
last_name: Litman
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
citation:
ama: 'Litman R, Bronstein AM, Bronstein MM. Stable Semi-local Features for Non-rigid
Shapes. In: Breuß M, Bruckstein A, Maragos P, eds. Innovations for Shape Analysis.
MATHVISUAL. Berlin, Heidelberg: Springer Nature; 2013:161-189. doi:10.1007/978-3-642-34141-0_8'
apa: 'Litman, R., Bronstein, A. M., & Bronstein, M. M. (2013). Stable Semi-local
Features for Non-rigid Shapes. In M. Breuß, A. Bruckstein, & P. Maragos (Eds.),
Innovations for Shape Analysis (pp. 161–189). Berlin, Heidelberg: Springer
Nature. https://doi.org/10.1007/978-3-642-34141-0_8'
chicago: 'Litman, Roee, Alex M. Bronstein, and Michael M. Bronstein. “Stable Semi-Local
Features for Non-Rigid Shapes.” In Innovations for Shape Analysis, edited
by Michael Breuß, Alfred Bruckstein, and Petros Maragos, 161–89. MATHVISUAL. Berlin,
Heidelberg: Springer Nature, 2013. https://doi.org/10.1007/978-3-642-34141-0_8.'
ieee: 'R. Litman, A. M. Bronstein, and M. M. Bronstein, “Stable Semi-local Features
for Non-rigid Shapes,” in Innovations for Shape Analysis, M. Breuß, A.
Bruckstein, and P. Maragos, Eds. Berlin, Heidelberg: Springer Nature, 2013, pp.
161–189.'
ista: 'Litman R, Bronstein AM, Bronstein MM. 2013.Stable Semi-local Features for
Non-rigid Shapes. In: Innovations for Shape Analysis. Mathematics and Visualization,
, 161–189.'
mla: Litman, Roee, et al. “Stable Semi-Local Features for Non-Rigid Shapes.” Innovations
for Shape Analysis, edited by Michael Breuß et al., Springer Nature, 2013,
pp. 161–89, doi:10.1007/978-3-642-34141-0_8.
short: R. Litman, A.M. Bronstein, M.M. Bronstein, in:, M. Breuß, A. Bruckstein,
P. Maragos (Eds.), Innovations for Shape Analysis, Springer Nature, Berlin, Heidelberg,
2013, pp. 161–189.
date_created: 2024-10-15T11:20:54Z
date_published: 2013-04-04T00:00:00Z
date_updated: 2025-01-16T15:50:22Z
day: '04'
doi: 10.1007/978-3-642-34141-0_8
editor:
- first_name: Michael
full_name: Breuß, Michael
last_name: Breuß
- first_name: Alfred
full_name: Bruckstein, Alfred
last_name: Bruckstein
- first_name: Petros
full_name: Maragos, Petros
last_name: Maragos
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-642-34141-0_8
language:
- iso: eng
month: '04'
oa_version: None
page: 161 - 189
place: Berlin, Heidelberg
publication: Innovations for Shape Analysis
publication_identifier:
eisbn:
- '9783642341410'
isbn:
- '9783642341403'
issn:
- 1612-3786
publication_status: published
publisher: Springer Nature
series_title: MATHVISUAL
status: public
title: Stable Semi-local Features for Non-rigid Shapes
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '18385'
abstract:
- lang: eng
text: In this paper we present a framework for real time enhancement of speech signals.
Our method leverages a new process-centric approach for sparse and parsimonious
models, where the representation pursuit is obtained applying a deterministic
function or process rather than solving an optimization problem. We first propose
a rank-regularized robust version of non-negative matrix factorization (NMF) for
modeling time-frequency representations of speech signals in which the spectral
frames are decomposed as sparse linear combinations of atoms of a low-rank dictionary.
Then, a parametric family of pursuit processes is derived from the iteration of
the proximal descent method for solving this model. We present several experiments
showing successful results and the potential of the proposed framework. Incorporating
discriminative learning makes the proposed method significantly outperform exact
NMF algorithms, with fixed latency and at a fraction of it's computational complexity.
article_number: '6637624'
article_processing_charge: No
author:
- first_name: Pablo
full_name: Sprechmann, Pablo
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: Michael
full_name: Bronstein, Michael
last_name: Bronstein
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Sprechmann P, Bronstein AM, Bronstein M, Sapiro G. Learnable low rank sparse
models for speech denoising. In: 2013 IEEE International Conference on Acoustics,
Speech and Signal Processing. IEEE; 2013. doi:10.1109/icassp.2013.6637624'
apa: 'Sprechmann, P., Bronstein, A. M., Bronstein, M., & Sapiro, G. (2013).
Learnable low rank sparse models for speech denoising. In 2013 IEEE International
Conference on Acoustics, Speech and Signal Processing. Vancouver, BC, Canada:
IEEE. https://doi.org/10.1109/icassp.2013.6637624'
chicago: Sprechmann, Pablo, Alex M. Bronstein, Michael Bronstein, and Guillermo
Sapiro. “Learnable Low Rank Sparse Models for Speech Denoising.” In 2013 IEEE
International Conference on Acoustics, Speech and Signal Processing. IEEE,
2013. https://doi.org/10.1109/icassp.2013.6637624.
ieee: P. Sprechmann, A. M. Bronstein, M. Bronstein, and G. Sapiro, “Learnable low
rank sparse models for speech denoising,” in 2013 IEEE International Conference
on Acoustics, Speech and Signal Processing, Vancouver, BC, Canada, 2013.
ista: Sprechmann P, Bronstein AM, Bronstein M, Sapiro G. 2013. Learnable low rank
sparse models for speech denoising. 2013 IEEE International Conference on Acoustics,
Speech and Signal Processing. 38th IEEE International Conference on Acoustics,
Speech, and Signal Processing, 6637624.
mla: Sprechmann, Pablo, et al. “Learnable Low Rank Sparse Models for Speech Denoising.”
2013 IEEE International Conference on Acoustics, Speech and Signal Processing,
6637624, IEEE, 2013, doi:10.1109/icassp.2013.6637624.
short: P. Sprechmann, A.M. Bronstein, M. Bronstein, G. Sapiro, in:, 2013 IEEE International
Conference on Acoustics, Speech and Signal Processing, IEEE, 2013.
conference:
end_date: 2013-05-31
location: Vancouver, BC, Canada
name: 38th IEEE International Conference on Acoustics, Speech, and Signal Processing
start_date: 2013-05-26
date_created: 2024-10-15T11:20:54Z
date_published: 2013-10-21T00:00:00Z
date_updated: 2024-12-04T13:34:16Z
day: '21'
doi: 10.1109/icassp.2013.6637624
extern: '1'
fulldoi: https://doi.org/10.1109/icassp.2013.6637624
language:
- iso: eng
month: '10'
oa_version: None
publication: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
publication_identifier:
eisbn:
- '9781479903566'
eissn:
- 2379-190X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learnable low rank sparse models for speech denoising
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '18386'
abstract:
- lang: eng
text: A method for removing impulse noise from audio signals by fusing multiple
copies of the same recording is introduced in this paper. The proposed algorithm
exploits the fact that while in general multiple copies of a given recording are
available, all sharing the same master, most degradations in audio signals are
record-dependent. Our method first seeks for the optimal non-rigid alignment of
the signals that is robust to the presence of sparse outliers with arbitrary magnitude.
Unlike previous approaches, we simultaneously find the optimal alignment of the
signals and impulsive degradation. This is obtained via continuous dynamic time
warping computed solving an Eikonal equation. We propose to use our approach in
the derivative domain, reconstructing the signal by solving an inverse problem
that resembles the Poisson image editing technique. The proposed framework is
here illustrated and tested in the restoration of old gramophone recordings showing
promising results; however, it can be used in other applications where different
copies of the signal of interest are available and the degradations are copy-dependent.
article_number: '6637774'
article_processing_charge: No
author:
- first_name: Pablo
full_name: Sprechmann, Pablo
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: Jean-Michel
full_name: Morel, Jean-Michel
last_name: Morel
- first_name: Guillermo
full_name: Sapiro, Guillermo
last_name: Sapiro
citation:
ama: 'Sprechmann P, Bronstein AM, Morel J-M, Sapiro G. Audio restoration from multiple
copies. In: 2013 IEEE International Conference on Acoustics, Speech and Signal
Processing. IEEE; 2013. doi:10.1109/icassp.2013.6637774'
apa: 'Sprechmann, P., Bronstein, A. M., Morel, J.-M., & Sapiro, G. (2013). Audio
restoration from multiple copies. In 2013 IEEE International Conference on
Acoustics, Speech and Signal Processing. Vancouver, BC, Canada: IEEE. https://doi.org/10.1109/icassp.2013.6637774'
chicago: Sprechmann, Pablo, Alex M. Bronstein, Jean-Michel Morel, and Guillermo
Sapiro. “Audio Restoration from Multiple Copies.” In 2013 IEEE International
Conference on Acoustics, Speech and Signal Processing. IEEE, 2013. https://doi.org/10.1109/icassp.2013.6637774.
ieee: P. Sprechmann, A. M. Bronstein, J.-M. Morel, and G. Sapiro, “Audio restoration
from multiple copies,” in 2013 IEEE International Conference on Acoustics,
Speech and Signal Processing, Vancouver, BC, Canada, 2013.
ista: Sprechmann P, Bronstein AM, Morel J-M, Sapiro G. 2013. Audio restoration from
multiple copies. 2013 IEEE International Conference on Acoustics, Speech and Signal
Processing. 38th IEEE International Conference on Acoustics, Speech, and Signal
Processing, 6637774.
mla: Sprechmann, Pablo, et al. “Audio Restoration from Multiple Copies.” 2013
IEEE International Conference on Acoustics, Speech and Signal Processing,
6637774, IEEE, 2013, doi:10.1109/icassp.2013.6637774.
short: P. Sprechmann, A.M. Bronstein, J.-M. Morel, G. Sapiro, in:, 2013 IEEE International
Conference on Acoustics, Speech and Signal Processing, IEEE, 2013.
conference:
end_date: 2013-05-31
location: Vancouver, BC, Canada
name: 38th IEEE International Conference on Acoustics, Speech, and Signal Processing
start_date: 2013-05-26
date_created: 2024-10-15T11:20:54Z
date_published: 2013-10-21T00:00:00Z
date_updated: 2024-12-04T13:05:44Z
day: '21'
doi: 10.1109/icassp.2013.6637774
extern: '1'
fulldoi: https://doi.org/10.1109/icassp.2013.6637774
language:
- iso: eng
month: '10'
oa_version: None
publication: 2013 IEEE International Conference on Acoustics, Speech and Signal Processing
publication_identifier:
eisbn:
- '9781479903566'
eissn:
- 2379-190X
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Audio restoration from multiple copies
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '18395'
abstract:
- lang: eng
text: Dynamic Time Warping (DTW), is a simple but efficient technique for matching
sequences with rigid deformation. Therefore, it is frequently used for matching
shapes in general, and shapes of handwritten words in Document Image Analysis
tasks. As DTW is computationally expensive, efficient algorithms for fast computation
are crucial. Retrieving images from large scale datasets using DTW, suffers from
the constraint of linear searching of all sample in the datasets. Fast approximation
algorithms for image retrieval are mostly based on normed spaces where the triangle
inequality holds, which is unfortunately not the case with the DTW metric. In
this paper we present a novel approach for fast search of handwritten words within
large datasets of shapes. The presented approach is based on the Boost-Map [1]
algorithm, for embedding the feature space with the DTW measurement to an euclidean
space and use the Local Sensitivity Hashing algorithm (LSH) to rank the k-nearest
neighbors of a query image. The algorithm, first, processes and embeds objects
of the large data sets to a normed space. Fast approximation of k-nearest neighbors
using LSH on the embedding space, generates the top kranked samples which are
examined using the real DTW distance to give final accurate results. We demonstrate
our method on a database of 45; 800 images of word-parts extracted from the IFN/ENIT
database [11] and images collected from 51 different writers. Our method achieves
a speedup of 4 orders of magnitude over the exact method, at the cost of only
a 2:2% reduction in accuracy.
article_number: '6424484'
article_processing_charge: No
author:
- first_name: Raid
full_name: Saabni, Raid
last_name: Saabni
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
citation:
ama: 'Saabni R, Bronstein AM. Fast key-word searching using “BoostMap” based embedding.
In: 2012 International Conference on Frontiers in Handwriting Recognition.
IEEE; 2013. doi:10.1109/icfhr.2012.204'
apa: 'Saabni, R., & Bronstein, A. M. (2013). Fast key-word searching using “BoostMap”
based embedding. In 2012 International Conference on Frontiers in Handwriting
Recognition. Bari, Italy: IEEE. https://doi.org/10.1109/icfhr.2012.204'
chicago: Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching Using ‘BoostMap’
Based Embedding.” In 2012 International Conference on Frontiers in Handwriting
Recognition. IEEE, 2013. https://doi.org/10.1109/icfhr.2012.204.
ieee: R. Saabni and A. M. Bronstein, “Fast key-word searching using ‘BoostMap’ based
embedding,” in 2012 International Conference on Frontiers in Handwriting Recognition,
Bari, Italy, 2013.
ista: Saabni R, Bronstein AM. 2013. Fast key-word searching using ‘BoostMap’ based
embedding. 2012 International Conference on Frontiers in Handwriting Recognition.
13th International Conference on Frontiers in Handwriting Recognition, 6424484.
mla: Saabni, Raid, and Alex M. Bronstein. “Fast Key-Word Searching Using ‘BoostMap’
Based Embedding.” 2012 International Conference on Frontiers in Handwriting
Recognition, 6424484, IEEE, 2013, doi:10.1109/icfhr.2012.204.
short: R. Saabni, A.M. Bronstein, in:, 2012 International Conference on Frontiers
in Handwriting Recognition, IEEE, 2013.
conference:
end_date: 2012-09-20
location: Bari, Italy
name: 13th International Conference on Frontiers in Handwriting Recognition
start_date: 2012-09-18
date_created: 2024-10-15T11:20:54Z
date_published: 2013-01-31T00:00:00Z
date_updated: 2024-12-04T13:00:18Z
day: '31'
doi: 10.1109/icfhr.2012.204
extern: '1'
fulldoi: https://doi.org/10.1109/icfhr.2012.204
language:
- iso: eng
month: '01'
oa_version: None
publication: 2012 International Conference on Frontiers in Handwriting Recognition
publication_identifier:
isbn:
- '9781467322621'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast key-word searching using 'BoostMap' based embedding
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2013'
...
---
_id: '18421'
abstract:
- lang: eng
text: The use of Laplacian eigenbases has been shown to be fruitful in many computer
graphics applications. Today, state-of-the-art approaches to shape analysis, synthesis,
and correspondence rely on these natural harmonic bases that allow using classical
tools from harmonic analysis on manifolds. However, many applications involving
multiple shapes are obstacled by the fact that Laplacian eigenbases computed independently
on different shapes are often incompatible with each other. In this paper, we
propose the construction of common approximate eigenbases for multiple shapes
using approximate joint diagonalization algorithms, taking as input a set of corresponding
functions (e.g. indicator functions of stable regions) on the two shapes. We illustrate
the benefits of the proposed approach on tasks from shape editing, pose transfer,
correspondence, and similarity.
article_processing_charge: No
arxiv: 1
author:
- first_name: A.
full_name: Kovnatsky, A.
last_name: Kovnatsky
- first_name: M. M.
full_name: Bronstein, M. M.
last_name: Bronstein
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: K.
full_name: Glashoff, K.
last_name: Glashoff
- first_name: R.
full_name: Kimmel, R.
last_name: Kimmel
citation:
ama: Kovnatsky A, Bronstein MM, Bronstein AM, Glashoff K, Kimmel R. Coupled quasi‐harmonic
bases. Computer Graphics Forum. 2013;32(2pt4):439-448. doi:10.1111/cgf.12064
apa: Kovnatsky, A., Bronstein, M. M., Bronstein, A. M., Glashoff, K., & Kimmel,
R. (2013). Coupled quasi‐harmonic bases. Computer Graphics Forum. Wiley.
https://doi.org/10.1111/cgf.12064
chicago: Kovnatsky, A., M. M. Bronstein, Alex M. Bronstein, K. Glashoff, and R.
Kimmel. “Coupled Quasi‐harmonic Bases.” Computer Graphics Forum. Wiley,
2013. https://doi.org/10.1111/cgf.12064.
ieee: A. Kovnatsky, M. M. Bronstein, A. M. Bronstein, K. Glashoff, and R. Kimmel,
“Coupled quasi‐harmonic bases,” Computer Graphics Forum, vol. 32, no. 2pt4.
Wiley, pp. 439–448, 2013.
ista: Kovnatsky A, Bronstein MM, Bronstein AM, Glashoff K, Kimmel R. 2013. Coupled
quasi‐harmonic bases. Computer Graphics Forum. 32(2pt4), 439–448.
mla: Kovnatsky, A., et al. “Coupled Quasi‐harmonic Bases.” Computer Graphics
Forum, vol. 32, no. 2pt4, Wiley, 2013, pp. 439–48, doi:10.1111/cgf.12064.
short: A. Kovnatsky, M.M. Bronstein, A.M. Bronstein, K. Glashoff, R. Kimmel, Computer
Graphics Forum 32 (2013) 439–448.
date_created: 2024-10-15T11:20:55Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2024-12-19T10:02:12Z
day: '01'
doi: 10.1111/cgf.12064
extern: '1'
external_id:
arxiv:
- '1210.0026'
fulldoi: https://doi.org/10.1111/cgf.12064
intvolume: ' 32'
issue: 2pt4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1210.0026
month: '05'
oa: 1
oa_version: Preprint
page: 439-448
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: Coupled quasi‐harmonic bases
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
_id: '18422'
abstract:
- lang: eng
text: We present a novel sparse modeling approach to non-rigid shape matching using
only the ability to detect repeatable regions. As the input to our algorithm,
we are given only two sets of regions in two shapes; no descriptors are provided
so the correspondence between the regions is not know, nor we know how many regions
correspond in the two shapes. We show that even with such scarce information,
it is possible to establish very accurate correspondence between the shapes by
using methods from the field of sparse modeling, being this, the first non-trivial
use of sparse models in shape correspondence. We formulate the problem of permuted
sparse coding, in which we solve simultaneously for an unknown permutation ordering
the regions on two shapes and for an unknown correspondence in functional representation.
We also propose a robust variant capable of handling incomplete matches. Numerically,
the problem is solved efficiently by alternating the solution of a linear assignment
and a sparse coding problem. The proposed methods are evaluated qualitatively
and quantitatively on standard benchmarks containing both synthetic and scanned
objects.
article_processing_charge: No
arxiv: 1
author:
- first_name: J.
full_name: Pokrass, J.
last_name: Pokrass
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: M. M.
full_name: Bronstein, M. M.
last_name: Bronstein
- first_name: P.
full_name: Sprechmann, P.
last_name: Sprechmann
- first_name: G.
full_name: Sapiro, G.
last_name: Sapiro
citation:
ama: Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. Sparse modeling
of intrinsic correspondences. Computer Graphics Forum. 2013;32(2pt4):459-468.
doi:10.1111/cgf.12066
apa: Pokrass, J., Bronstein, A. M., Bronstein, M. M., Sprechmann, P., & Sapiro,
G. (2013). Sparse modeling of intrinsic correspondences. Computer Graphics
Forum. Wiley. https://doi.org/10.1111/cgf.12066
chicago: Pokrass, J., Alex M. Bronstein, M. M. Bronstein, P. Sprechmann, and G.
Sapiro. “Sparse Modeling of Intrinsic Correspondences.” Computer Graphics Forum.
Wiley, 2013. https://doi.org/10.1111/cgf.12066.
ieee: J. Pokrass, A. M. Bronstein, M. M. Bronstein, P. Sprechmann, and G. Sapiro,
“Sparse modeling of intrinsic correspondences,” Computer Graphics Forum,
vol. 32, no. 2pt4. Wiley, pp. 459–468, 2013.
ista: Pokrass J, Bronstein AM, Bronstein MM, Sprechmann P, Sapiro G. 2013. Sparse
modeling of intrinsic correspondences. Computer Graphics Forum. 32(2pt4), 459–468.
mla: Pokrass, J., et al. “Sparse Modeling of Intrinsic Correspondences.” Computer
Graphics Forum, vol. 32, no. 2pt4, Wiley, 2013, pp. 459–68, doi:10.1111/cgf.12066.
short: J. Pokrass, A.M. Bronstein, M.M. Bronstein, P. Sprechmann, G. Sapiro, Computer
Graphics Forum 32 (2013) 459–468.
date_created: 2024-10-15T11:20:55Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2024-12-19T09:57:17Z
day: '01'
doi: 10.1111/cgf.12066
extern: '1'
external_id:
arxiv:
- '1209.6560'
fulldoi: https://doi.org/10.1111/cgf.12066
intvolume: ' 32'
issue: 2pt4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1209.6560
month: '05'
oa: 1
oa_version: Preprint
page: 459-468
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: Sparse modeling of intrinsic correspondences
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2013'
...
---
DOAJ_listed: '1'
_id: '18437'
abstract:
- lang: eng
text: "\r\n\r\nElg1 and Srs2 are two proteins involved in maintaining genome stability
in yeast. After DNA damage, the homotrimeric clamp PCNA, which provides stability
and processivity to DNA polymerases and serves as a docking platform for DNA repair
enzymes, undergoes modification by the ubiquitin-like molecule SUMO. PCNA SUMOylation
helps recruit Srs2 and Elg1 to the replication fork. In the absence of Elg1, both
SUMOylated PCNA and Srs2 accumulate at the chromatin fraction, indicating that
Elg1 is required for removing SUMOylated PCNA and Srs2 from DNA. Despite this
interaction, which suggests that the two proteins work together, double mutants
elg1Δ srs2Δ have severely impaired growth as haploids and exhibit synergistic
sensitivity to DNA damage and a synergistic increase in gene conversion. In addition,
diploid elg1Δ srs2Δ double mutants are dead, which implies that an essential function
in the cell requires at least one of the two gene products for survival. To gain
information about this essential function, we have carried out a high copy number
suppressor screen to search for genes that, when overexpressed, suppress the synthetic
lethality between elg1Δ and srs2Δ. We report the identification of 36 such genes,
which are enriched for functions related to DNA- and chromatin-binding, chromatin
packaging and modification, and mRNA export from the nucleus."
article_processing_charge: No
author:
- first_name: Inbal
full_name: Gazy, Inbal
last_name: Gazy
- first_name: Batia
full_name: Liefshitz, Batia
last_name: Liefshitz
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Oren
full_name: Parnas, Oren
last_name: Parnas
- first_name: Nir
full_name: Atias, Nir
last_name: Atias
- first_name: Roded
full_name: Sharan, Roded
last_name: Sharan
- first_name: Martin
full_name: Kupiec, Martin
last_name: Kupiec
citation:
ama: 'Gazy I, Liefshitz B, Bronstein AM, et al. A genetic screen for high copy number
suppressors of the synthetic lethality between elg1Δ and srs2Δ in yeast. G3:
Genes, Genomes, Genetics. 2013;3(5):917-926. doi:10.1534/g3.113.005561'
apa: 'Gazy, I., Liefshitz, B., Bronstein, A. M., Parnas, O., Atias, N., Sharan,
R., & Kupiec, M. (2013). A genetic screen for high copy number suppressors
of the synthetic lethality between elg1Δ and srs2Δ in yeast. G3: Genes, Genomes,
Genetics. Oxford University Press. https://doi.org/10.1534/g3.113.005561'
chicago: 'Gazy, Inbal, Batia Liefshitz, Alex M. Bronstein, Oren Parnas, Nir Atias,
Roded Sharan, and Martin Kupiec. “A Genetic Screen for High Copy Number Suppressors
of the Synthetic Lethality between Elg1Δ and Srs2Δ in Yeast.” G3: Genes, Genomes,
Genetics. Oxford University Press, 2013. https://doi.org/10.1534/g3.113.005561.'
ieee: 'I. Gazy et al., “A genetic screen for high copy number suppressors
of the synthetic lethality between elg1Δ and srs2Δ in yeast,” G3: Genes, Genomes,
Genetics, vol. 3, no. 5. Oxford University Press, pp. 917–926, 2013.'
ista: 'Gazy I, Liefshitz B, Bronstein AM, Parnas O, Atias N, Sharan R, Kupiec M.
2013. A genetic screen for high copy number suppressors of the synthetic lethality
between elg1Δ and srs2Δ in yeast. G3: Genes, Genomes, Genetics. 3(5), 917–926.'
mla: 'Gazy, Inbal, et al. “A Genetic Screen for High Copy Number Suppressors of
the Synthetic Lethality between Elg1Δ and Srs2Δ in Yeast.” G3: Genes, Genomes,
Genetics, vol. 3, no. 5, Oxford University Press, 2013, pp. 917–26, doi:10.1534/g3.113.005561.'
short: 'I. Gazy, B. Liefshitz, A.M. Bronstein, O. Parnas, N. Atias, R. Sharan, M.
Kupiec, G3: Genes, Genomes, Genetics 3 (2013) 917–926.'
date_created: 2024-10-15T11:20:55Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2024-12-18T15:30:20Z
day: '01'
doi: 10.1534/g3.113.005561
extern: '1'
fulldoi: https://doi.org/10.1534/g3.113.005561
intvolume: ' 3'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1534/g3.113.005561
month: '05'
oa: 1
oa_version: Published Version
page: 917-926
publication: ' G3: Genes, Genomes, Genetics'
publication_identifier:
eissn:
- 2160-1836
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A genetic screen for high copy number suppressors of the synthetic lethality
between elg1Δ and srs2Δ in yeast
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2013'
...
---
_id: '18440'
abstract:
- lang: eng
text: In this paper, we explore the use of the diffusion geometry framework for
the fusion of geometric and photometric information in local and global shape
descriptors. Our construction is based on the definition of a diffusion process
on the shape manifold embedded into a high-dimensional space where the embedding
coordinates represent the photometric information. Experimental results show that
such data fusion is useful in coping with different challenges of shape analysis
where pure geometric and pure photometric methods fail.
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Artiom
full_name: Kovnatsky, Artiom
last_name: Kovnatsky
- first_name: Dan
full_name: Raviv, Dan
last_name: Raviv
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Kovnatsky A, Raviv D, Bronstein MM, Kimmel R. Geometric and
photometric data fusion in non-rigid shape analysis. Numerical Mathematics:
Theory, Methods and Applications. 2013;6(1):199-222. doi:10.4208/nmtma.2013.mssvm11'
apa: 'Bronstein, A. M., Kovnatsky, A., Raviv, D., Bronstein, M. M., & Kimmel,
R. (2013). Geometric and photometric data fusion in non-rigid shape analysis.
Numerical Mathematics: Theory, Methods and Applications. Global Science
Press. https://doi.org/10.4208/nmtma.2013.mssvm11'
chicago: 'Bronstein, Alex M., Artiom Kovnatsky, Dan Raviv, Michael M. Bronstein,
and Ron Kimmel. “Geometric and Photometric Data Fusion in Non-Rigid Shape Analysis.”
Numerical Mathematics: Theory, Methods and Applications. Global Science
Press, 2013. https://doi.org/10.4208/nmtma.2013.mssvm11.'
ieee: 'A. M. Bronstein, A. Kovnatsky, D. Raviv, M. M. Bronstein, and R. Kimmel,
“Geometric and photometric data fusion in non-rigid shape analysis,” Numerical
Mathematics: Theory, Methods and Applications, vol. 6, no. 1. Global Science
Press, pp. 199–222, 2013.'
ista: 'Bronstein AM, Kovnatsky A, Raviv D, Bronstein MM, Kimmel R. 2013. Geometric
and photometric data fusion in non-rigid shape analysis. Numerical Mathematics:
Theory, Methods and Applications. 6(1), 199–222.'
mla: 'Bronstein, Alex M., et al. “Geometric and Photometric Data Fusion in Non-Rigid
Shape Analysis.” Numerical Mathematics: Theory, Methods and Applications,
vol. 6, no. 1, Global Science Press, 2013, pp. 199–222, doi:10.4208/nmtma.2013.mssvm11.'
short: 'A.M. Bronstein, A. Kovnatsky, D. Raviv, M.M. Bronstein, R. Kimmel, Numerical
Mathematics: Theory, Methods and Applications 6 (2013) 199–222.'
date_created: 2024-10-15T11:20:55Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2024-12-19T15:09:21Z
day: '01'
doi: 10.4208/nmtma.2013.mssvm11
extern: '1'
fulldoi: https://doi.org/10.4208/nmtma.2013.mssvm11
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 199-222
publication: 'Numerical Mathematics: Theory, Methods and Applications'
publication_identifier:
eissn:
- 2079-7338
issn:
- 1004-8979
publication_status: published
publisher: Global Science Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Geometric and photometric data fusion in non-rigid shape analysis
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2013'
...
---
_id: '18441'
abstract:
- lang: eng
text: Partial similarity of shapes is a challenging problem arising in many important
applications in computer vision, shape analysis, and graphics, e.g. when one has
to deal with partial information and acquisition artifacts. The problem is especially
hard when the underlying shapes are non-rigid and are given up to a deformation.
Partial matching is usually approached by computing local descriptors on a pair
of shapes and then establishing a point-wise non-bijective correspondence between
the two, taking into account possibly different parts. In this paper, we introduce
an alternative correspondence-less approach to matching fragments to an entire
shape undergoing a non-rigid deformation. We use region-wise local descriptors
and optimize over the integration domains on which the integral descriptors of
the two parts match. The problem is regularized using the Mumford-Shah functional.
We show an efficient discretization based on the Ambrosio-Tortorelli approximation
generalized to triangular point clouds and meshes, and present experiments demonstrating
the success of the proposed method.
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: 'Jonathan '
full_name: 'Pokrass, Jonathan '
last_name: Pokrass
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
citation:
ama: 'Bronstein AM, Pokrass J, Bronstein MM. Partial shape matching without point-wise
correspondence. Numerical Mathematics: Theory, Methods and Applications.
2013;6(1):223-244. doi:10.4208/nmtma.2013.mssvm12'
apa: 'Bronstein, A. M., Pokrass, J., & Bronstein, M. M. (2013). Partial shape
matching without point-wise correspondence. Numerical Mathematics: Theory,
Methods and Applications. Global Science Press. https://doi.org/10.4208/nmtma.2013.mssvm12'
chicago: 'Bronstein, Alex M., Jonathan Pokrass, and Michael M. Bronstein. “Partial
Shape Matching without Point-Wise Correspondence.” Numerical Mathematics: Theory,
Methods and Applications. Global Science Press, 2013. https://doi.org/10.4208/nmtma.2013.mssvm12.'
ieee: 'A. M. Bronstein, J. Pokrass, and M. M. Bronstein, “Partial shape matching
without point-wise correspondence,” Numerical Mathematics: Theory, Methods
and Applications, vol. 6, no. 1. Global Science Press, pp. 223–244, 2013.'
ista: 'Bronstein AM, Pokrass J, Bronstein MM. 2013. Partial shape matching without
point-wise correspondence. Numerical Mathematics: Theory, Methods and Applications.
6(1), 223–244.'
mla: 'Bronstein, Alex M., et al. “Partial Shape Matching without Point-Wise Correspondence.”
Numerical Mathematics: Theory, Methods and Applications, vol. 6, no. 1,
Global Science Press, 2013, pp. 223–44, doi:10.4208/nmtma.2013.mssvm12.'
short: 'A.M. Bronstein, J. Pokrass, M.M. Bronstein, Numerical Mathematics: Theory,
Methods and Applications 6 (2013) 223–244.'
date_created: 2024-10-15T11:20:55Z
date_published: 2013-02-01T00:00:00Z
date_updated: 2024-12-19T14:44:37Z
day: '01'
doi: 10.4208/nmtma.2013.mssvm12
extern: '1'
fulldoi: https://doi.org/10.4208/nmtma.2013.mssvm12
intvolume: ' 6'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 223-244
publication: 'Numerical Mathematics: Theory, Methods and Applications'
publication_identifier:
eissn:
- 2079-7338
issn:
- 1004-8979
publication_status: published
publisher: Global Science Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Partial shape matching without point-wise correspondence
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2013'
...
---
OA_place: repository
OA_type: green
_id: '22053'
abstract:
- lang: eng
text: We consider the Gross–Pitaevskii equation on R^4 and the cubic-quintic nonlinear
Schrödinger equation (NLS) on R^3 with non-vanishing boundary conditions at spatial
infinity. By viewing these equations as perturbations to the energy-critical NLS,
we prove that they are globally well-posed in their energy spaces. In particular,
we prove unconditional uniqueness in the energy spaces for these equations.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Tadahiro
full_name: Oh, Tadahiro
last_name: Oh
- first_name: Oana
full_name: Pocovnicu, Oana
last_name: Pocovnicu
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Oh T, Pocovnicu O, Vişan M. Global well-posedness of the Gross–Pitaevskii
and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary
conditions. Mathematical Research Letters. 2013;19(5):969-986. doi:10.4310/mrl.2012.v19.n5.a1
apa: Killip, R., Oh, T., Pocovnicu, O., & Vişan, M. (2013). Global well-posedness
of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with
non-vanishing boundary conditions. Mathematical Research Letters. International
Press of Boston. https://doi.org/10.4310/mrl.2012.v19.n5.a1
chicago: Killip, Rowan, Tadahiro Oh, Oana Pocovnicu, and Monica Vişan. “Global Well-Posedness
of the Gross–Pitaevskii and Cubic-Quintic Nonlinear Schrödinger Equations with
Non-Vanishing Boundary Conditions.” Mathematical Research Letters. International
Press of Boston, 2013. https://doi.org/10.4310/mrl.2012.v19.n5.a1.
ieee: R. Killip, T. Oh, O. Pocovnicu, and M. Vişan, “Global well-posedness of the
Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger equations with non-vanishing
boundary conditions,” Mathematical Research Letters, vol. 19, no. 5. International
Press of Boston, pp. 969–986, 2013.
ista: Killip R, Oh T, Pocovnicu O, Vişan M. 2013. Global well-posedness of the Gross–Pitaevskii
and cubic-quintic nonlinear Schrödinger equations with non-vanishing boundary
conditions. Mathematical Research Letters. 19(5), 969–986.
mla: Killip, Rowan, et al. “Global Well-Posedness of the Gross–Pitaevskii and Cubic-Quintic
Nonlinear Schrödinger Equations with Non-Vanishing Boundary Conditions.” Mathematical
Research Letters, vol. 19, no. 5, International Press of Boston, 2013, pp.
969–86, doi:10.4310/mrl.2012.v19.n5.a1.
short: R. Killip, T. Oh, O. Pocovnicu, M. Vişan, Mathematical Research Letters 19
(2013) 969–986.
das_tickbox: '1'
date_created: 2026-06-19T07:54:49Z
date_published: 2013-03-15T00:00:00Z
date_updated: 2026-06-25T08:33:18Z
day: '15'
doi: 10.4310/mrl.2012.v19.n5.a1
extern: '1'
external_id:
arxiv:
- '1112.1354'
fulldoi: https://doi.org/10.4310/mrl.2012.v19.n5.a1
intvolume: ' 19'
issue: '5'
keyword:
- NLS
- Gross–Pitaevskii equation
- non-vanishing boundary condition
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1112.1354
mathsc:
- 35Q55
month: '03'
oa: 1
oa_version: Preprint
page: 969-986
publication: Mathematical Research Letters
publication_identifier:
eissn:
- 1945-001X
issn:
- 1073-2780
publication_status: published
publisher: International Press of Boston
quality_controlled: '1'
scopus_import: '1'
status: public
title: Global well-posedness of the Gross–Pitaevskii and cubic-quintic nonlinear Schrödinger
equations with non-vanishing boundary conditions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2013'
...
---
_id: '2698'
abstract:
- lang: eng
text: We consider non-interacting particles subject to a fixed external potential
V and a self-generated magnetic field B. The total energy includes the field energy
β∫B2 and we minimize over all particle states and magnetic fields. In the case
of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system.
The parameter β tunes the coupling strength between the field and the particles
and it effectively determines the strength of the field. We investigate the stability
and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V).
The relevant parameter measuring the field strength in the semiclassical limit
is κ=βh. We are not able to give the exact leading order semiclassical asymptotics
uniformly in κ or even for fixed κ. We do however give upper and lower bounds
on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞
we show that the standard non-magnetic Weyl asymptotics holds. The same result
also holds for the spinless case, i.e. where the Pauli operator is replaced by
the Schrödinger operator.
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: Søren
full_name: Fournais, Søren
last_name: Fournais
- first_name: Jan
full_name: Solovej, Jan
last_name: Solovej
citation:
ama: Erdös L, Fournais S, Solovej J. Stability and semiclassics in self-generated
fields. Journal of the European Mathematical Society. 2013;15(6):2093-2113.
doi:10.4171/JEMS/416
apa: Erdös, L., Fournais, S., & Solovej, J. (2013). Stability and semiclassics
in self-generated fields. Journal of the European Mathematical Society.
EMS Press. https://doi.org/10.4171/JEMS/416
chicago: Erdös, László, Søren Fournais, and Jan Solovej. “Stability and Semiclassics
in Self-Generated Fields.” Journal of the European Mathematical Society.
EMS Press, 2013. https://doi.org/10.4171/JEMS/416.
ieee: L. Erdös, S. Fournais, and J. Solovej, “Stability and semiclassics in self-generated
fields,” Journal of the European Mathematical Society, vol. 15, no. 6.
EMS Press, pp. 2093–2113, 2013.
ista: Erdös L, Fournais S, Solovej J. 2013. Stability and semiclassics in self-generated
fields. Journal of the European Mathematical Society. 15(6), 2093–2113.
mla: Erdös, László, et al. “Stability and Semiclassics in Self-Generated Fields.”
Journal of the European Mathematical Society, vol. 15, no. 6, EMS Press,
2013, pp. 2093–113, doi:10.4171/JEMS/416.
short: L. Erdös, S. Fournais, J. Solovej, Journal of the European Mathematical Society
15 (2013) 2093–2113.
date_created: 2018-12-11T11:59:07Z
date_published: 2013-10-16T00:00:00Z
date_updated: 2026-07-06T11:56:35Z
day: '16'
department:
- _id: LaEr
doi: 10.4171/JEMS/416
external_id:
arxiv:
- '1105.0506'
isi:
- '000326323400006'
fulldoi: https://doi.org/10.4171/JEMS/416
intvolume: ' 15'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1105.0506
month: '10'
oa: 1
oa_version: Preprint
page: 2093 - 2113
publication: Journal of the European Mathematical Society
publication_status: published
publisher: EMS Press
publist_id: '4198'
quality_controlled: '1'
status: public
title: Stability and semiclassics in self-generated fields
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2013'
...
---
_id: '2328'
abstract:
- lang: eng
text: "Linearizability of concurrent data structures is usually proved by monolithic
simulation arguments relying on identifying 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.\r\nIn 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."
alternative_title:
- LNCS
author:
- 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
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Viktor
full_name: Vafeiadis, Viktor
last_name: Vafeiadis
citation:
ama: Henzinger TA, Sezgin A, Vafeiadis V. Aspect-oriented linearizability proofs.
2013;8052:242-256. doi:10.1007/978-3-642-40184-8_18
apa: 'Henzinger, T. A., Sezgin, A., & Vafeiadis, V. (2013). Aspect-oriented
linearizability proofs. Presented at the CONCUR: Concurrency Theory, Buenos Aires,
Argentina: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-642-40184-8_18'
chicago: Henzinger, Thomas A, Ali Sezgin, and Viktor Vafeiadis. “Aspect-Oriented
Linearizability Proofs.” Lecture Notes in Computer Science. Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2013. https://doi.org/10.1007/978-3-642-40184-8_18.
ieee: T. A. Henzinger, A. Sezgin, and V. Vafeiadis, “Aspect-oriented linearizability
proofs,” vol. 8052. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 242–256,
2013.
ista: Henzinger TA, Sezgin A, Vafeiadis V. 2013. Aspect-oriented linearizability
proofs. 8052, 242–256.
mla: Henzinger, Thomas A., et al. Aspect-Oriented Linearizability Proofs.
Vol. 8052, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 242–56,
doi:10.1007/978-3-642-40184-8_18.
short: T.A. Henzinger, A. Sezgin, V. Vafeiadis, 8052 (2013) 242–256.
conference:
end_date: 2013-08-30
location: Buenos Aires, Argentina
name: 'CONCUR: Concurrency Theory'
start_date: 2013-08-27
date_created: 2018-12-11T11:57:01Z
date_published: 2013-08-01T00:00:00Z
date_updated: 2026-07-06T13:24:04Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-642-40184-8_18
ec_funded: 1
file:
- access_level: open_access
checksum: bdbb520de91751fe0136309ad4ef67e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:58Z
date_updated: 2020-07-14T12:45:39Z
file_id: '4721'
file_name: IST-2014-197-v1+1_main-queue-verification.pdf
file_size: 337059
relation: main_file
file_date_updated: 2020-07-14T12:45:39Z
fulldoi: https://doi.org/10.1007/978-3-642-40184-8_18
has_accepted_license: '1'
intvolume: ' 8052'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Submitted Version
page: 242 - 256
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_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '4598'
pubrep_id: '197'
quality_controlled: '1'
related_material:
record:
- id: '1832'
relation: later_version
status: public
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: Aspect-oriented linearizability proofs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8052
year: '2013'
...
---
_id: '2901'
abstract:
- lang: eng
text: ' We introduce the M-modes problem for graphical models: predicting the M
label configurations of highest probability that are at the same time local maxima
of the probability landscape. M-modes have multiple possible applications: because
they are intrinsically diverse, they provide a principled alternative to non-maximum
suppression techniques for structured prediction, they can act as codebook vectors
for quantizing the configuration space, or they can form component centers for
mixture model approximation. We present two algorithms for solving the M-modes
problem. The first algorithm solves the problem in polynomial time when the underlying
graphical model is a simple chain. The second algorithm solves the problem for
junction chains. In synthetic and real dataset, we demonstrate how M-modes can
improve the performance of prediction. We also use the generated modes as a tool
to understand the topography of the probability distribution of configurations,
for example with relation to the training set size and amount of noise in the
data. '
alternative_title:
- PMLR
article_processing_charge: No
author:
- first_name: Chao
full_name: Chen, Chao
id: 3E92416E-F248-11E8-B48F-1D18A9856A87
last_name: Chen
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Zhu
full_name: Yan, Zhu
last_name: Yan
- first_name: Dimitris
full_name: Metaxas, Dimitris
last_name: Metaxas
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. Computing the M most probable
modes of a graphical model. In: Proceedings of the 16th International Conference
on Artificial Intelligence and Statistics. Vol 31. Journal of Machine Learning
Research; 2013:161-169.'
apa: 'Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., & Lampert, C. (2013).
Computing the M most probable modes of a graphical model. In Proceedings of
the 16th International Conference on Artificial Intelligence and Statistics
(Vol. 31, pp. 161–169). Scottsdale, AZ, United States: Journal of Machine Learning
Research.'
chicago: Chen, Chao, Vladimir Kolmogorov, Zhu Yan, Dimitris Metaxas, and Christoph
Lampert. “Computing the M Most Probable Modes of a Graphical Model.” In Proceedings
of the 16th International Conference on Artificial Intelligence and Statistics,
31:161–69. Journal of Machine Learning Research, 2013.
ieee: C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the
M most probable modes of a graphical model,” in Proceedings of the 16th International
Conference on Artificial Intelligence and Statistics, Scottsdale, AZ, United
States, 2013, vol. 31, pp. 161–169.
ista: 'Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M
most probable modes of a graphical model. Proceedings of the 16th International
Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Uncertainty
in Artificial Intelligence, PMLR, vol. 31, 161–169.'
mla: Chen, Chao, et al. “Computing the M Most Probable Modes of a Graphical Model.”
Proceedings of the 16th International Conference on Artificial Intelligence
and Statistics, vol. 31, Journal of Machine Learning Research, 2013, pp. 161–69.
short: C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, C. Lampert, in:, Proceedings
of the 16th International Conference on Artificial Intelligence and Statistics,
Journal of Machine Learning Research, 2013, pp. 161–169.
conference:
end_date: 2013-05-01
location: Scottsdale, AZ, United States
name: 'AISTATS: Conference on Uncertainty in Artificial Intelligence'
start_date: 2013-04-29
das_tickbox: '1'
date_created: 2018-12-11T12:00:14Z
date_published: 2013-01-01T00:00:00Z
date_updated: 2026-07-06T13:43:58Z
day: '01'
department:
- _id: HeEd
- _id: VlKo
- _id: ChLa
intvolume: ' 31'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://jmlr.org/proceedings/papers/v31/chen13a.html
month: '01'
oa: 1
oa_version: None
page: 161 - 169
publication: Proceedings of the 16th International Conference on Artificial Intelligence
and Statistics
publication_status: published
publisher: Journal of Machine Learning Research
publist_id: '3846'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing the M most probable modes of a graphical model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 31
year: '2013'
...
---
_id: '2818'
abstract:
- lang: eng
text: Models of neural responses to stimuli with complex spatiotemporal correlation
structure often assume that neurons are selective for only a small number of linear
projections of a potentially high-dimensional input. In this review, we explore
recent modeling approaches where the neural response depends on the quadratic
form of the input rather than on its linear projection, that is, the neuron is
sensitive to the local covariance structure of the signal preceding the spike.
To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic)
stimulus distribution, we review several inference methods, focusing in particular
on two information theory–based approaches (maximization of stimulus energy and
of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered
covariance and extensions of generalized linear models). We analyze the formal
relationship between the likelihood-based and information-based approaches to
demonstrate how they lead to consistent inference. We demonstrate the practical
feasibility of these procedures by using model neurons responding to a flickering
variance stimulus.
article_processing_charge: No
arxiv: 1
author:
- first_name: Kanaka
full_name: Rajan, Kanaka
last_name: Rajan
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
citation:
ama: Rajan K, Marre O, Tkačik G. Learning quadratic receptive fields from neural
responses to natural stimuli. Neural Computation. 2013;25(7):1661-1692.
doi:10.1162/NECO_a_00463
apa: Rajan, K., Marre, O., & Tkačik, G. (2013). Learning quadratic receptive
fields from neural responses to natural stimuli. Neural Computation. MIT
Press. https://doi.org/10.1162/NECO_a_00463
chicago: Rajan, Kanaka, Olivier Marre, and Gašper Tkačik. “Learning Quadratic Receptive
Fields from Neural Responses to Natural Stimuli.” Neural Computation. MIT
Press, 2013. https://doi.org/10.1162/NECO_a_00463.
ieee: K. Rajan, O. Marre, and G. Tkačik, “Learning quadratic receptive fields from
neural responses to natural stimuli,” Neural Computation, vol. 25, no.
7. MIT Press, pp. 1661–1692, 2013.
ista: Rajan K, Marre O, Tkačik G. 2013. Learning quadratic receptive fields from
neural responses to natural stimuli. Neural Computation. 25(7), 1661–1692.
mla: Rajan, Kanaka, et al. “Learning Quadratic Receptive Fields from Neural Responses
to Natural Stimuli.” Neural Computation, vol. 25, no. 7, MIT Press, 2013,
pp. 1661–92, doi:10.1162/NECO_a_00463.
short: K. Rajan, O. Marre, G. Tkačik, Neural Computation 25 (2013) 1661–1692.
das_tickbox: '1'
date_created: 2018-12-11T11:59:45Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2026-07-06T13:45:52Z
day: '01'
department:
- _id: GaTk
doi: 10.1162/NECO_a_00463
external_id:
arxiv:
- '1209.0121'
isi:
- '000319903700001'
fulldoi: https://doi.org/10.1162/NECO_a_00463
intvolume: ' 25'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1209.0121
month: '07'
oa: 1
oa_version: Preprint
page: 1661 - 1692
publication: Neural Computation
publication_status: published
publisher: MIT Press
publist_id: '3983'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Learning quadratic receptive fields from neural responses to natural stimuli
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 25
year: '2013'
...
---
_id: '2859'
abstract:
- lang: eng
text: Given a continuous function f:X-R on a topological space, we consider the
preimages of intervals and their homology groups and show how to read the ranks
of these groups from the extended persistence diagram of f. In addition, we quantify
the robustness of the homology classes under perturbations of f using well groups,
and we show how to read the ranks of these groups from the same extended persistence
diagram. The special case X=R3 has ramifications in the fields of medical imaging
and scientific visualization.
article_processing_charge: No
arxiv: 1
author:
- first_name: Paul
full_name: Bendich, Paul
id: 43F6EC54-F248-11E8-B48F-1D18A9856A87
last_name: Bendich
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Dmitriy
full_name: Morozov, Dmitriy
last_name: Morozov
- first_name: Amit
full_name: Patel, Amit
id: 34A254A0-F248-11E8-B48F-1D18A9856A87
last_name: Patel
citation:
ama: Bendich P, Edelsbrunner H, Morozov D, Patel A. Homology and robustness of level
and interlevel sets. Homology, Homotopy and Applications. 2013;15(1):51-72.
doi:10.4310/HHA.2013.v15.n1.a3
apa: Bendich, P., Edelsbrunner, H., Morozov, D., & Patel, A. (2013). Homology
and robustness of level and interlevel sets. Homology, Homotopy and Applications.
International Press of Boston. https://doi.org/10.4310/HHA.2013.v15.n1.a3
chicago: Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “Homology
and Robustness of Level and Interlevel Sets.” Homology, Homotopy and Applications.
International Press of Boston, 2013. https://doi.org/10.4310/HHA.2013.v15.n1.a3.
ieee: P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “Homology and robustness
of level and interlevel sets,” Homology, Homotopy and Applications, vol.
15, no. 1. International Press of Boston, pp. 51–72, 2013.
ista: Bendich P, Edelsbrunner H, Morozov D, Patel A. 2013. Homology and robustness
of level and interlevel sets. Homology, Homotopy and Applications. 15(1), 51–72.
mla: Bendich, Paul, et al. “Homology and Robustness of Level and Interlevel Sets.”
Homology, Homotopy and Applications, vol. 15, no. 1, International Press
of Boston, 2013, pp. 51–72, doi:10.4310/HHA.2013.v15.n1.a3.
short: P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, Homology, Homotopy and
Applications 15 (2013) 51–72.
das_tickbox: '1'
date_created: 2018-12-11T11:59:58Z
date_published: 2013-05-01T00:00:00Z
date_updated: 2026-07-06T13:38:59Z
day: '01'
department:
- _id: HeEd
doi: 10.4310/HHA.2013.v15.n1.a3
external_id:
arxiv:
- '1102.3389'
isi:
- '000322423600003'
fulldoi: https://doi.org/10.4310/HHA.2013.v15.n1.a3
intvolume: ' 15'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1102.3389v1
month: '05'
oa: 1
oa_version: Preprint
page: 51 - 72
publication: Homology, Homotopy and Applications
publication_status: published
publisher: International Press of Boston
publist_id: '3930'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Homology and robustness of level and interlevel sets
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2013'
...
---
_id: '2280'
abstract:
- lang: eng
text: The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal
container so as to minimize a measure of overlap between ellipsoids is considered.
A bilevel optimization formulation is given, together with an algorithm for the
general case and a simpler algorithm for the special case in which all ellipsoids
are in fact spheres. Convergence results are proved and computational experience
is described and illustrated. The motivating application-chromosome organization
in the human cell nucleus-is discussed briefly, and some illustrative results
are presented.
article_processing_charge: No
arxiv: 1
author:
- first_name: Caroline
full_name: Uhler, Caroline
id: 49ADD78E-F248-11E8-B48F-1D18A9856A87
last_name: Uhler
orcid: 0000-0002-7008-0216
- first_name: Stephen
full_name: Wright, Stephen
last_name: Wright
citation:
ama: Uhler C, Wright S. Packing ellipsoids with overlap. SIAM Review. 2013;55(4):671-706.
doi:10.1137/120872309
apa: Uhler, C., & Wright, S. (2013). Packing ellipsoids with overlap. SIAM
Review. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/120872309
chicago: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.”
SIAM Review. Society for Industrial and Applied Mathematics, 2013. https://doi.org/10.1137/120872309.
ieee: C. Uhler and S. Wright, “Packing ellipsoids with overlap,” SIAM Review,
vol. 55, no. 4. Society for Industrial and Applied Mathematics, pp. 671–706, 2013.
ista: Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4),
671–706.
mla: Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” SIAM
Review, vol. 55, no. 4, Society for Industrial and Applied Mathematics, 2013,
pp. 671–706, doi:10.1137/120872309.
short: C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.
das_tickbox: '1'
date_created: 2018-12-11T11:56:44Z
date_published: 2013-11-07T00:00:00Z
date_updated: 2026-07-06T13:58:55Z
day: '07'
department:
- _id: CaUh
doi: 10.1137/120872309
external_id:
arxiv:
- '1204.0235'
isi:
- '000327502800002'
fulldoi: https://doi.org/10.1137/120872309
intvolume: ' 55'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1204.0235
month: '11'
oa: 1
oa_version: Preprint
page: 671 - 706
publication: SIAM Review
publication_status: published
publisher: Society for Industrial and Applied Mathematics
publist_id: '4655'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Packing ellipsoids with overlap
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 55
year: '2013'
...
---
_id: '2256'
abstract:
- lang: eng
text: Linked (Open) Data - bibliographic data on the Semantic Web. Report of the
Working Group on Linked Data to the plenary assembly of the Austrian Library Network
(translation of the title). Linked Data stands for a certain approach to publishing
data on the Web. The underlying idea is to harmonise heterogeneous data sources
of different origin in order to improve their accessibility and interoperability,
effectively making them queryable as a big distributed database. This report summarises
relevant developments in Europe as well as the Linked Data Working Group‘s strategic
and technical considerations regarding the publishing of the Austrian Library
Network’s (OBV’s) bibliographic datasets. It concludes with the mutual agreement
that the implementation of Linked Data principles within the OBV can only be taken
into consideration accompanied by a discussion about the provision of the datasets
under a free license.
- lang: ger
text: "Linked Data steht für eine bestimmte Form der Veröffentlichung von Daten
via Internet. Die zu Grunde liegende Idee ist es, Daten verschiedenster Provenienz,
die derzeit teilweise gar nicht oder nur schwer zugänglich sind, in möglichst
\r\neinheitlicher Form miteinander zu verknüpfen und dadurch in ihrer Gesamtheit
abfragbar zu machen.\r\nDieser Bericht fasst die Entwicklungen im europäischen
Raum, sowie strategische und technische Überlegungen der AG Linked Data hinsichtlich
der Veröffentlichung von bibliothekarischen Daten des Österreichischen Bibliothekenverbundes
(OBV) zusammen und schließt mit der gemeinsamen Übereinkunft, dass die Umsetzung
von Linked Data-Prinzipien im OBV nur in Zusammenhang mit einer Diskussion über
die damit einhergehende Veröffentlichung der Daten unter einer freien Lizenz angedacht
werden sollte."
article_processing_charge: No
author:
- first_name: Patrick
full_name: Danowski, Patrick
id: 2EBD1598-F248-11E8-B48F-1D18A9856A87
last_name: Danowski
orcid: 0000-0002-6026-4409
- first_name: Doron
full_name: Goldfarb, Doron
last_name: Goldfarb
- first_name: Verena
full_name: Schaffner, Verena
last_name: Schaffner
- first_name: Wolfram
full_name: Seidler, Wolfram
last_name: Seidler
citation:
ama: Danowski P, Goldfarb D, Schaffner V, Seidler W. Linked (Open) Data - Bibliographische
Daten im Semantic Web. VÖB Mitteilungen. 2013;66(3/4):559-587.
apa: Danowski, P., Goldfarb, D., Schaffner, V., & Seidler, W. (2013). Linked
(Open) Data - Bibliographische Daten im Semantic Web. VÖB Mitteilungen.
Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare.
chicago: Danowski, Patrick, Doron Goldfarb, Verena Schaffner, and Wolfram Seidler.
“Linked (Open) Data - Bibliographische Daten Im Semantic Web.” VÖB Mitteilungen.
Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, 2013.
ieee: P. Danowski, D. Goldfarb, V. Schaffner, and W. Seidler, “Linked (Open) Data
- Bibliographische Daten im Semantic Web,” VÖB Mitteilungen, vol. 66, no.
3/4. Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare, pp. 559–587,
2013.
ista: Danowski P, Goldfarb D, Schaffner V, Seidler W. 2013. Linked (Open) Data -
Bibliographische Daten im Semantic Web. VÖB Mitteilungen. 66(3/4), 559–587.
mla: Danowski, Patrick, et al. “Linked (Open) Data - Bibliographische Daten Im Semantic
Web.” VÖB Mitteilungen, vol. 66, no. 3/4, Vereinigung Österreichischer
Bibliothekarinnen und Bibliothekare, 2013, pp. 559–87.
short: P. Danowski, D. Goldfarb, V. Schaffner, W. Seidler, VÖB Mitteilungen 66 (2013)
559–587.
das_tickbox: '1'
date_created: 2018-12-11T11:56:36Z
date_published: 2013-12-01T00:00:00Z
date_updated: 2026-07-07T06:12:03Z
day: '01'
ddc:
- '020'
department:
- _id: E-Lib
file:
- access_level: open_access
checksum: ae57ffcee3720adcc27b0f2767a1e04b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:09Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4669'
file_name: IST-2016-719-v1+1_Patrick_Danowski__Doron_Goldfarb__Verena_Schaffner__Wolfram_Seidler_Linked__Open__Data_Bibliographische_Daten_im_Semantic_Web.pdf
file_size: 881545
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 66'
issue: 3/4
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 559 - 587
popular_science: '1'
publication: VÖB Mitteilungen
publication_status: published
publisher: Vereinigung Österreichischer Bibliothekarinnen und Bibliothekare
publist_id: '4690'
pubrep_id: '719'
status: public
title: Linked (Open) Data - Bibliographische Daten im Semantic Web
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: 66
year: '2013'
...
---
_id: '2284'
abstract:
- lang: eng
text: 'Background: The brood of ants and other social insects is highly susceptible
to pathogens, particularly those that penetrate the soft larval and pupal cuticle.
We here test whether the presence of a pupal cocoon, which occurs in some ant
species but not in others, affects the sanitary brood care and fungal infection
patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We
use a) a comparative approach analysing four species with either naked or cocooned
pupae and b) a within-species analysis of a single ant species, in which both
pupal types co-exist in the same colony. Results: We found that the presence of
a cocoon did not compromise fungal pathogen detection by the ants and that species
with cocooned pupae increased brood grooming after pathogen exposure. All tested
ant species further removed brood from their nests, which was predominantly expressed
towards larvae and naked pupae treated with the live fungal pathogen. In contrast,
cocooned pupae exposed to live fungus were not removed at higher rates than cocooned
pupae exposed to dead fungus or a sham control. Consistent with this, exposure
to the live fungus caused high numbers of infections and fungal outgrowth in larvae
and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed
the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion:
Our study suggests that the pupal cocoon has a protective effect against fungal
infection, causing an adaptive change in sanitary behaviours by the ants. It further
demonstrates that brood removal-originally described for honeybees as "hygienic
behaviour"-is a widespread sanitary behaviour in ants, which likely has important
implications on disease dynamics in social insect colonies.'
acknowledgement: "The study was funded by the European Research Council (Marie Curie
ERG 036569) and Marie Curie IEF 302204 to LVU\r\nCC BY 2.0\r\n"
article_number: '225'
article_processing_charge: No
author:
- first_name: Simon
full_name: Tragust, Simon
id: 35A7A418-F248-11E8-B48F-1D18A9856A87
last_name: Tragust
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Michel
full_name: Chapuisat, Michel
last_name: Chapuisat
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Pupal cocoons affect
sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary
Biology. 2013;13(1). doi:10.1186/1471-2148-13-225
apa: Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., & Cremer, S. (2013).
Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies.
BMC Evolutionary Biology. BioMed Central. https://doi.org/10.1186/1471-2148-13-225
chicago: Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia
Cremer. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections
in Ant Colonies.” BMC Evolutionary Biology. BioMed Central, 2013. https://doi.org/10.1186/1471-2148-13-225.
ieee: S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Pupal
cocoons affect sanitary brood care and limit fungal infections in ant colonies,”
BMC Evolutionary Biology, vol. 13, no. 1. BioMed Central, 2013.
ista: Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2013. Pupal cocoons
affect sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary
Biology. 13(1), 225.
mla: Tragust, Simon, et al. “Pupal Cocoons Affect Sanitary Brood Care and Limit
Fungal Infections in Ant Colonies.” BMC Evolutionary Biology, vol. 13,
no. 1, 225, BioMed Central, 2013, doi:10.1186/1471-2148-13-225.
short: S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, BMC Evolutionary
Biology 13 (2013).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:56:46Z
date_published: 2013-10-14T00:00:00Z
date_updated: 2026-07-28T09:35:11Z
day: '14'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1186/1471-2148-13-225
ec_funded: 1
external_id:
isi:
- '000326620500001'
file:
- access_level: open_access
checksum: c16ef36f2a10786a7885e19c4528d707
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:41Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5026'
file_name: IST-2016-402-v1+1_1471-2148-13-225.pdf
file_size: 281736
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
fulldoi: https://doi.org/10.1186/1471-2148-13-225
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
- _id: 25DAF0B2-B435-11E9-9278-68D0E5697425
grant_number: CR-118/3-1
name: Host-Parasite Coevolution
- _id: 25DDF0F0-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '302004'
name: 'Collective disease defence and pathogen detection abilities in ant societies:
a chemo-neuro-immunological approach'
publication: BMC Evolutionary Biology
publication_status: published
publisher: BioMed Central
publist_id: '4647'
pubrep_id: '402'
quality_controlled: '1'
related_material:
record:
- id: '9753'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Pupal cocoons affect sanitary brood care and limit fungal infections in ant
colonies
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: 13
year: '2013'
...
---
_id: '1387'
abstract:
- lang: eng
text: Choices made by nondeterministic word automata depend on both the past (the
prefix of the word read so far) and the future (the suffix yet to be read). In
several applications, most notably synthesis, the future is diverse or unknown,
leading to algorithms that are based on deterministic automata. Hoping to retain
some of the advantages of nondeterministic automata, researchers have studied
restricted classes of nondeterministic automata. Three such classes are nondeterministic
automata that are good for trees (GFT; i.e., ones that can be expanded to tree
automata accepting the derived tree languages, thus whose choices should satisfy
diverse futures), good for games (GFG; i.e., ones whose choices depend only on
the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent
deterministic automata). The theoretical properties and relative merits of the
different classes are still open, having vagueness on whether they really differ
from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known
whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also
open is the possible succinctness of GFG and GFT automata compared to deterministic
automata. We study these problems for ω-regular automata with all common acceptance
conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction
for GFG automata.
acknowledgement: This work was supported in part by the Polish Ministry of Science
grant no. N206 567840, Poland’s NCN grant no. DEC-2012/05/N/ST6/03254, Austrian
Science Fund NFN RiSE (Rigorous Systems Engineering), ERC Advanced Grant QUAREM
(Quantitative Reactive Modeling), and ERC Grant QUALITY. The full version is available
at the authors’ URLs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Denis
full_name: Kuperberg, Denis
last_name: Kuperberg
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Michał
full_name: Skrzypczak, Michał
last_name: Skrzypczak
citation:
ama: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. Nondeterminism in the presence
of a diverse or unknown future. 2013;7966(PART 2):89-100. doi:10.1007/978-3-642-39212-2_11
apa: 'Boker, U., Kuperberg, D., Kupferman, O., & Skrzypczak, M. (2013). Nondeterminism
in the presence of a diverse or unknown future. Presented at the ICALP: Automata,
Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_11'
chicago: Boker, Udi, Denis Kuperberg, Orna Kupferman, and Michał Skrzypczak. “Nondeterminism
in the Presence of a Diverse or Unknown Future.” Lecture Notes in Computer Science.
Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_11.
ieee: U. Boker, D. Kuperberg, O. Kupferman, and M. Skrzypczak, “Nondeterminism in
the presence of a diverse or unknown future,” vol. 7966, no. PART 2. Springer,
pp. 89–100, 2013.
ista: Boker U, Kuperberg D, Kupferman O, Skrzypczak M. 2013. Nondeterminism in the
presence of a diverse or unknown future. 7966(PART 2), 89–100.
mla: Boker, Udi, et al. Nondeterminism in the Presence of a Diverse or Unknown
Future. Vol. 7966, no. PART 2, Springer, 2013, pp. 89–100, doi:10.1007/978-3-642-39212-2_11.
short: U. Boker, D. Kuperberg, O. Kupferman, M. Skrzypczak, 7966 (2013) 89–100.
conference:
end_date: 2013-07-12
location: Riga, Latvia
name: 'ICALP: Automata, Languages and Programming'
start_date: 2013-07-08
das_tickbox: '1'
date_created: 2018-12-11T11:51:44Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2026-07-28T09:26:19Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39212-2_11
ec_funded: 1
file:
- access_level: open_access
checksum: 98bc02e3793072e279ec8d364b381ff3
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:05:50Z
date_updated: 2020-07-14T12:44:48Z
file_id: '7857'
file_name: 2013_ICALP_Boker.pdf
file_size: 276982
relation: main_file
file_date_updated: 2020-07-14T12:44:48Z
fulldoi: https://doi.org/10.1007/978-3-642-39212-2_11
has_accepted_license: '1'
intvolume: ' 7966'
issue: PART 2
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 89 - 100
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_status: published
publisher: Springer
publist_id: '5823'
quality_controlled: '1'
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Nondeterminism in the presence of a diverse or unknown future
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...
---
_id: '2517'
abstract:
- lang: eng
text: 'Traditional formal methods are based on a Boolean satisfaction notion: a
reactive system satisfies, or not, a given specification. We generalize formal
methods to also address the quality of systems. As an adequate specification formalism
we introduce the linear temporal logic LTL[F]. The satisfaction value of an LTL[F]
formula is a number between 0 and 1, describing the quality of the satisfaction.
The logic generalizes traditional LTL by augmenting it with a (parameterized)
set F of arbitrary functions over the interval [0,1]. For example, F may contain
the maximum or minimum between the satisfaction values of subformulas, their product,
and their average. The classical decision problems in formal methods, such as
satisfiability, model checking, and synthesis, are generalized to search and optimization
problems in the quantitative setting. For example, model checking asks for the
quality in which a specification is satisfied, and synthesis returns a system
satisfying the specification with the highest quality. Reasoning about quality
gives rise to other natural questions, like the distance between specifications.
We formalize these basic questions and study them for LTL[F]. By extending the
automata-theoretic approach for LTL to a setting that takes quality into an account,
we are able to solve the above problems and show that reasoning about LTL[F] has
roughly the same complexity as reasoning about traditional LTL.'
acknowledgement: This work was supported in part by the Austrian Science Fund NFN
RiSE (Rigorous Systems Engineering), by the ERC Advanced Grant QUAREM (Quantitative
Reactive Modeling), and the ERC Grant QUALITY. The full version is available at
the authors’ URLs.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shaull
full_name: Almagor, Shaull
last_name: Almagor
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: Almagor S, Boker U, Kupferman O. Formalizing and reasoning about quality. 2013;7966(Part
2):15-27. doi:10.1007/978-3-642-39212-2_3
apa: 'Almagor, S., Boker, U., & Kupferman, O. (2013). Formalizing and reasoning
about quality. Presented at the ICALP: Automata, Languages and Programming, Riga,
Latvia: Springer. https://doi.org/10.1007/978-3-642-39212-2_3'
chicago: Almagor, Shaull, Udi Boker, and Orna Kupferman. “Formalizing and Reasoning
about Quality.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-39212-2_3.
ieee: S. Almagor, U. Boker, and O. Kupferman, “Formalizing and reasoning about quality,”
vol. 7966, no. Part 2. Springer, pp. 15–27, 2013.
ista: Almagor S, Boker U, Kupferman O. 2013. Formalizing and reasoning about quality.
7966(Part 2), 15–27.
mla: Almagor, Shaull, et al. Formalizing and Reasoning about Quality. Vol.
7966, no. Part 2, Springer, 2013, pp. 15–27, doi:10.1007/978-3-642-39212-2_3.
short: S. Almagor, U. Boker, O. Kupferman, 7966 (2013) 15–27.
conference:
end_date: 2013-07-12
location: Riga, Latvia
name: 'ICALP: Automata, Languages and Programming'
start_date: 2013-07-08
das_tickbox: '1'
date_created: 2018-12-11T11:58:08Z
date_published: 2013-07-01T00:00:00Z
date_updated: 2026-07-28T09:28:40Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-39212-2_3
ec_funded: 1
file:
- access_level: open_access
checksum: 85afbf6c18a2c7e377c52c9410e2d824
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T11:16:12Z
date_updated: 2020-07-14T12:45:42Z
file_id: '7860'
file_name: 2013_ICALP_Almagor.pdf
file_size: 363031
relation: main_file
file_date_updated: 2020-07-14T12:45:42Z
fulldoi: https://doi.org/10.1007/978-3-642-39212-2_3
has_accepted_license: '1'
intvolume: ' 7966'
issue: Part 2
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 15 - 27
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_status: published
publisher: Springer
publist_id: '4384'
quality_controlled: '1'
scopus_import: '1'
series_title: Lecture Notes in Computer Science
status: public
title: Formalizing and reasoning about quality
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7966
year: '2013'
...