---
_id: '2852'
abstract:
- lang: eng
text: A robust combiner for hash functions takes two candidate implementations and
constructs a hash function which is secure as long as at least one of the candidates
is secure. So far, hash function combiners only aim at preserving a single property
such as collision-resistance or pseudorandomness. However, when hash functions
are used in protocols like TLS they are often required to provide several properties
simultaneously. We therefore put forward the notion of robust multi-property combiners
and elaborate on different definitions for such combiners. We then propose a combiner
that provably preserves (target) collision-resistance, pseudorandomness, and being
a secure message authentication code. This combiner satisfies the strongest notion
we propose, which requires that the combined function satisfies every security
property which is satisfied by at least one of the underlying hash function. If
the underlying hash functions have output length n, the combiner has output length
2 n. This basically matches a known lower bound for black-box combiners for collision-resistance
only, thus the other properties can be achieved without penalizing the length
of the hash values. We then propose a combiner which also preserves the property
of being indifferentiable from a random oracle, slightly increasing the output
length to 2 n+ω(log n). Moreover, we show how to augment our constructions in
order to make them also robust for the one-wayness property, but in this case
require an a priory upper bound on the input length.
author:
- first_name: Marc
full_name: Fischlin, Marc
last_name: Fischlin
- first_name: Anja
full_name: Lehmann, Anja
last_name: Lehmann
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash
functions. Journal of Cryptology. 2014;27(3):397-428. doi:10.1007/s00145-013-9148-7
apa: Fischlin, M., Lehmann, A., & Pietrzak, K. Z. (2014). Robust multi-property
combiners for hash functions. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-013-9148-7
chicago: Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property
Combiners for Hash Functions.” Journal of Cryptology. Springer, 2014. https://doi.org/10.1007/s00145-013-9148-7.
ieee: M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners
for hash functions,” Journal of Cryptology, vol. 27, no. 3. Springer, pp.
397–428, 2014.
ista: Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners
for hash functions. Journal of Cryptology. 27(3), 397–428.
mla: Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.”
Journal of Cryptology, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:10.1007/s00145-013-9148-7.
short: M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.
date_created: 2018-12-11T11:59:56Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2023-02-23T11:17:53Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-013-9148-7
intvolume: ' 27'
issue: '3'
language:
- iso: eng
month: '07'
oa_version: None
page: 397 - 428
publication: Journal of Cryptology
publication_status: published
publisher: Springer
publist_id: '3940'
quality_controlled: '1'
related_material:
record:
- id: '3225'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Robust multi-property combiners for hash functions
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 27
year: '2014'
...
---
_id: '2905'
abstract:
- lang: eng
text: "Persistent homology is a recent grandchild of homology that has found use
in\r\nscience and engineering as well as in mathematics. This paper surveys the
method as well\r\nas the applications, neglecting completeness in favor of highlighting
ideas and directions."
acknowledgement: This research is partially supported by NSF under grant DBI-0820624,
by ESF under the Research Networking Programme, and by the Russian Government Project
11.G34.31.0053.
article_processing_charge: No
author:
- 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: Morozovy, Dmitriy
last_name: Morozovy
citation:
ama: 'Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In:
European Mathematical Society Publishing House; 2014:31-50. doi:10.4171/120-1/3'
apa: 'Edelsbrunner, H., & Morozovy, D. (2014). Persistent homology: Theory and
practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics,
Kraków, Poland: European Mathematical Society Publishing House. https://doi.org/10.4171/120-1/3'
chicago: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory
and Practice,” 31–50. European Mathematical Society Publishing House, 2014. https://doi.org/10.4171/120-1/3.'
ieee: 'H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,”
presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014,
pp. 31–50.'
ista: 'Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice.
ECM: European Congress of Mathematics, 31–50.'
mla: 'Edelsbrunner, Herbert, and Dmitriy Morozovy. Persistent Homology: Theory
and Practice. European Mathematical Society Publishing House, 2014, pp. 31–50,
doi:10.4171/120-1/3.'
short: H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing
House, 2014, pp. 31–50.
conference:
end_date: 2012-07-07
location: Kraków, Poland
name: 'ECM: European Congress of Mathematics'
start_date: 2012-07-02
date_created: 2018-12-11T12:00:16Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:36Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4171/120-1/3
file:
- access_level: open_access
checksum: 1d4a046f1af945c407c5c4d411d4c5e4
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:43Z
date_updated: 2020-07-14T12:45:52Z
file_id: '5232'
file_name: IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf
file_size: 435320
relation: main_file
file_date_updated: 2020-07-14T12:45:52Z
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 31 - 50
publication_status: published
publisher: European Mathematical Society Publishing House
publist_id: '3842'
pubrep_id: '544'
quality_controlled: '1'
status: public
title: 'Persistent homology: Theory and practice'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '3263'
abstract:
- lang: eng
text: Adaptation in the retina is thought to optimize the encoding of natural light
signals into sequences of spikes sent to the brain. While adaptive changes in
retinal processing to the variations of the mean luminance level and second-order
stimulus statistics have been documented before, no such measurements have been
performed when higher-order moments of the light distribution change. We therefore
measured the ganglion cell responses in the tiger salamander retina to controlled
changes in the second (contrast), third (skew) and fourth (kurtosis) moments of
the light intensity distribution of spatially uniform temporally independent stimuli.
The skew and kurtosis of the stimuli were chosen to cover the range observed in
natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear
models that capture well the retinal encoding properties across all stimuli. We
found that the encoding properties of retinal ganglion cells change only marginally
when higher-order statistics change, compared to the changes observed in response
to the variation in contrast. By analyzing optimal coding in LN-type models, we
showed that neurons can maintain a high information rate without large dynamic
adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli,
spatio-temporal summation within the receptive field averages away non-gaussian
aspects of the light intensity distribution.
acknowledgement: "This work was supported by The Israel Science Foundation and The
Human Frontiers Science Program.\r\nWe thank the referees for helping significantly
improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason
Prentice for stimulating discussions. GT wishes to thank the faculty and students
of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory,
Woods Hole.\r\n"
article_number: e85841
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Anandamohan
full_name: Ghosh, Anandamohan
last_name: Ghosh
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: Ronen
full_name: Segev, Ronen
last_name: Segev
citation:
ama: Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 2014;9(1). doi:10.1371/journal.pone.0085841
apa: Tkačik, G., Ghosh, A., Schneidman, E., & Segev, R. (2014). Adaptation to
changes in higher-order stimulus statistics in the salamander retina. PLoS
One. Public Library of Science. https://doi.org/10.1371/journal.pone.0085841
chicago: Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation
to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” PLoS
One. Public Library of Science, 2014. https://doi.org/10.1371/journal.pone.0085841.
ieee: G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in
higher-order stimulus statistics in the salamander retina,” PLoS One, vol.
9, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order
stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.
mla: Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics
in the Salamander Retina.” PLoS One, vol. 9, no. 1, e85841, Public Library
of Science, 2014, doi:10.1371/journal.pone.0085841.
short: G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014).
date_created: 2018-12-11T12:02:20Z
date_published: 2014-01-21T00:00:00Z
date_updated: 2021-01-12T07:42:14Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pone.0085841
file:
- access_level: open_access
checksum: 1d5816b343abe5eadc3eb419bcece971
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:28Z
date_updated: 2020-07-14T12:46:06Z
file_id: '5011'
file_name: IST-2016-432-v1+1_journal.pone.0085841.pdf
file_size: 1568524
relation: main_file
file_date_updated: 2020-07-14T12:46:06Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '3385'
pubrep_id: '432'
quality_controlled: '1'
scopus_import: 1
status: public
title: Adaptation to changes in higher-order stimulus statistics in the salamander
retina
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: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '10793'
abstract:
- lang: eng
text: "The Hanani–Tutte theorem is a classical result proved for the first time
in the 1930s that characterizes planar graphs as graphs that admit a drawing in
the plane in which every pair of edges not sharing a vertex cross an even number
of times. We generalize this classical result to clustered graphs with two disjoint
clusters, and show that a straightforward extension of our result to flat clustered
graphs with three or more disjoint clusters is not possible.\r\n\r\nWe also give
a new and short proof for a related result by Di Battista and Frati based on the
matroid intersection algorithm."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Radoslav
full_name: Fulek, Radoslav
id: 39F3FFE4-F248-11E8-B48F-1D18A9856A87
last_name: Fulek
orcid: 0000-0001-8485-1774
- first_name: Jan
full_name: Kynčl, Jan
last_name: Kynčl
- first_name: Igor
full_name: Malinović, Igor
last_name: Malinović
- first_name: Dömötör
full_name: Pálvölgyi, Dömötör
last_name: Pálvölgyi
citation:
ama: 'Fulek R, Kynčl J, Malinović I, Pálvölgyi D. Clustered planarity testing revisited.
In: International Symposium on Graph Drawing. Vol 8871. Cham: Springer
Nature; 2014:428-436. doi:10.1007/978-3-662-45803-7_36'
apa: 'Fulek, R., Kynčl, J., Malinović, I., & Pálvölgyi, D. (2014). Clustered
planarity testing revisited. In International Symposium on Graph Drawing
(Vol. 8871, pp. 428–436). Cham: Springer Nature. https://doi.org/10.1007/978-3-662-45803-7_36'
chicago: 'Fulek, Radoslav, Jan Kynčl, Igor Malinović, and Dömötör Pálvölgyi. “Clustered
Planarity Testing Revisited.” In International Symposium on Graph Drawing,
8871:428–36. Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-662-45803-7_36.'
ieee: R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing
revisited,” in International Symposium on Graph Drawing, 2014, vol. 8871,
pp. 428–436.
ista: Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing
revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436.
mla: Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” International
Symposium on Graph Drawing, vol. 8871, Springer Nature, 2014, pp. 428–36,
doi:10.1007/978-3-662-45803-7_36.
short: R. Fulek, J. Kynčl, I. Malinović, D. Pálvölgyi, in:, International Symposium
on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.
date_created: 2022-02-25T10:32:14Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T10:08:04Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/978-3-662-45803-7_36
external_id:
arxiv:
- '1305.4519'
intvolume: ' 8871'
language:
- iso: eng
month: '01'
oa_version: Preprint
page: 428-436
place: Cham
publication: International Symposium on Graph Drawing
publication_identifier:
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '1642'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Clustered planarity testing revisited
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8871
year: '2014'
...
---
_id: '10811'
abstract:
- lang: eng
text: Auxin is an important signaling compound in plants and vital for plant development
and growth. The present book, Auxin and its Role in Plant Development, provides
the reader with detailed and comprehensive insight into the functioning of the
molecule on the whole and specifically in plant development. In the first part,
the functioning, metabolism and signaling pathways of auxin in plants are explained,
the second part depicts the specific role of auxin in plant development and the
third part describes the interaction and functioning of the signaling compound upon
stimuli of the environment. Each chapter is written by international experts in
the respective field and designed for scientists and researchers in plant biology,
plant development and cell biology to summarize the recent progress in understanding
the role of auxin and suggest future perspectives for auxin research.
article_processing_charge: No
citation:
ama: 'Zažímalová E, Petrášek J, Benková E, eds. Auxin and Its Role in Plant Development.
1st ed. Vienna: Springer Nature; 2014. doi:10.1007/978-3-7091-1526-8'
apa: 'Zažímalová, E., Petrášek, J., & Benková, E. (Eds.). (2014). Auxin and
Its Role in Plant Development (1st ed.). Vienna: Springer Nature. https://doi.org/10.1007/978-3-7091-1526-8'
chicago: 'Zažímalová, Eva, Jan Petrášek, and Eva Benková, eds. Auxin and Its
Role in Plant Development. 1st ed. Vienna: Springer Nature, 2014. https://doi.org/10.1007/978-3-7091-1526-8.'
ieee: 'E. Zažímalová, J. Petrášek, and E. Benková, Eds., Auxin and Its Role in
Plant Development, 1st ed. Vienna: Springer Nature, 2014.'
ista: 'Zažímalová E, Petrášek J, Benková E eds. 2014. Auxin and Its Role in Plant
Development 1st ed., Vienna: Springer Nature, 444p.'
mla: Zažímalová, Eva, et al., editors. Auxin and Its Role in Plant Development.
1st ed., Springer Nature, 2014, doi:10.1007/978-3-7091-1526-8.
short: E. Zažímalová, J. Petrášek, E. Benková, eds., Auxin and Its Role in Plant
Development, 1st ed., Springer Nature, Vienna, 2014.
date_created: 2022-03-03T11:52:44Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2022-03-04T07:38:15Z
day: '01'
department:
- _id: EvBe
doi: 10.1007/978-3-7091-1526-8
edition: '1'
editor:
- first_name: Eva
full_name: Zažímalová, Eva
last_name: Zažímalová
- first_name: Jan
full_name: Petrášek, Jan
last_name: Petrášek
- first_name: Eva
full_name: Benková, Eva
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
language:
- iso: eng
month: '04'
oa_version: None
page: '444'
place: Vienna
publication_identifier:
eisbn:
- '9783709115268'
isbn:
- '9783709115251'
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Auxin and Its Role in Plant Development
type: book_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '10814'
abstract:
- lang: eng
text: We review recent progress towards a rigorous understanding of the excitation
spectrum of bosonic quantum many-body systems. In particular, we explain how one
can rigorously establish the predictions resulting from the Bogoliubov approximation
in the mean field limit. The latter predicts that the spectrum is made up of elementary
excitations, whose energy behaves linearly in the momentum for small momentum.
This property is crucial for the superfluid behavior of the system. We also discuss
a list of open problems in this field.
article_processing_charge: No
article_type: original
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Seiringer R. The excitation spectrum for Bose fluids with weak interactions.
Jahresbericht der Deutschen Mathematiker-Vereinigung. 2014;116:21-41. doi:10.1365/s13291-014-0083-9
apa: Seiringer, R. (2014). The excitation spectrum for Bose fluids with weak interactions.
Jahresbericht Der Deutschen Mathematiker-Vereinigung. Springer Nature.
https://doi.org/10.1365/s13291-014-0083-9
chicago: Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.”
Jahresbericht Der Deutschen Mathematiker-Vereinigung. Springer Nature,
2014. https://doi.org/10.1365/s13291-014-0083-9.
ieee: R. Seiringer, “The excitation spectrum for Bose fluids with weak interactions,”
Jahresbericht der Deutschen Mathematiker-Vereinigung, vol. 116. Springer
Nature, pp. 21–41, 2014.
ista: Seiringer R. 2014. The excitation spectrum for Bose fluids with weak interactions.
Jahresbericht der Deutschen Mathematiker-Vereinigung. 116, 21–41.
mla: Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.”
Jahresbericht Der Deutschen Mathematiker-Vereinigung, vol. 116, Springer
Nature, 2014, pp. 21–41, doi:10.1365/s13291-014-0083-9.
short: R. Seiringer, Jahresbericht Der Deutschen Mathematiker-Vereinigung 116 (2014)
21–41.
date_created: 2022-03-04T07:54:39Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2023-09-05T14:19:47Z
day: '01'
department:
- _id: RoSe
doi: 10.1365/s13291-014-0083-9
intvolume: ' 116'
keyword:
- General Medicine
language:
- iso: eng
month: '03'
oa_version: None
page: 21-41
publication: Jahresbericht der Deutschen Mathematiker-Vereinigung
publication_identifier:
eissn:
- 1869-7135
issn:
- 0012-0456
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The excitation spectrum for Bose fluids with weak interactions
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 116
year: '2014'
...
---
_id: '10815'
abstract:
- lang: eng
text: In the last several decades, developmental biology has clarified the molecular
mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated
that the “tool-kit genes” essential for regulating developmental processes are
not only highly conserved among species, but are also used as systems at various
times and places in an organism to control distinct developmental events. Therefore,
mutations in many of these tool-kit genes may cause congenital diseases involving
morphological abnormalities. This link between genes and abnormal morphological
phenotypes underscores the importance of understanding how cells behave and contribute
to morphogenesis as a result of gene function. Recent improvements in live imaging
and in quantitative analyses of cellular dynamics will advance our understanding
of the cellular pathogenesis of congenital diseases associated with aberrant morphologies.
In these studies, it is critical to select an appropriate model organism for the
particular phenomenon of interest.
acknowledgement: The authors thank all the members of the Division of Morphogenesis,
National Institute for Basic Biology, for their contributions to the research, their
encouragement, and helpful discussions, particularly Dr M. Suzuki for his critical
reading of the manuscript. We also thank the Model Animal Research and Spectrography
and Bioimaging Facilities, NIBB Core Research Facilities, for technical support.
M.H. was supported by a research fellowship from the Japan Society for the Promotion
of Science (JSPS). Our work introduced in this review was supported by a Grant-in-Aid
for Scientific Research on Innovative Areas from the Ministry of Education, Culture,
Sports, Science, and Technology (MEXT), Japan, to N.U.
article_processing_charge: No
article_type: original
author:
- first_name: Masakazu
full_name: Hashimoto, Masakazu
last_name: Hashimoto
- first_name: Hitoshi
full_name: Morita, Hitoshi
id: 4C6E54C6-F248-11E8-B48F-1D18A9856A87
last_name: Morita
- first_name: Naoto
full_name: Ueno, Naoto
last_name: Ueno
citation:
ama: Hashimoto M, Morita H, Ueno N. Molecular and cellular mechanisms of development
underlying congenital diseases. Congenital Anomalies. 2014;54(1):1-7. doi:10.1111/cga.12039
apa: Hashimoto, M., Morita, H., & Ueno, N. (2014). Molecular and cellular mechanisms
of development underlying congenital diseases. Congenital Anomalies. Wiley.
https://doi.org/10.1111/cga.12039
chicago: Hashimoto, Masakazu, Hitoshi Morita, and Naoto Ueno. “Molecular and Cellular
Mechanisms of Development Underlying Congenital Diseases.” Congenital Anomalies.
Wiley, 2014. https://doi.org/10.1111/cga.12039.
ieee: M. Hashimoto, H. Morita, and N. Ueno, “Molecular and cellular mechanisms of
development underlying congenital diseases,” Congenital Anomalies, vol.
54, no. 1. Wiley, pp. 1–7, 2014.
ista: Hashimoto M, Morita H, Ueno N. 2014. Molecular and cellular mechanisms of
development underlying congenital diseases. Congenital Anomalies. 54(1), 1–7.
mla: Hashimoto, Masakazu, et al. “Molecular and Cellular Mechanisms of Development
Underlying Congenital Diseases.” Congenital Anomalies, vol. 54, no. 1,
Wiley, 2014, pp. 1–7, doi:10.1111/cga.12039.
short: M. Hashimoto, H. Morita, N. Ueno, Congenital Anomalies 54 (2014) 1–7.
date_created: 2022-03-04T08:17:25Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2022-03-04T08:26:05Z
day: '01'
department:
- _id: CaHe
doi: 10.1111/cga.12039
external_id:
pmid:
- '24666178'
intvolume: ' 54'
issue: '1'
keyword:
- Developmental Biology
- Embryology
- General Medicine
- Pediatrics
- Perinatology
- and Child Health
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/cga.12039
month: '02'
oa: 1
oa_version: None
page: 1-7
pmid: 1
publication: Congenital Anomalies
publication_identifier:
issn:
- 0914-3505
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Molecular and cellular mechanisms of development underlying congenital diseases
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2014'
...
---
_id: '10817'
abstract:
- lang: eng
text: The Morse-Smale complex can be either explicitly or implicitly represented.
Depending on the type of representation, the simplification of the Morse-Smale
complex works differently. In the explicit representation, the Morse-Smale complex
is directly simplified by explicitly reconnecting the critical points during the
simplification. In the implicit representation, on the other hand, the Morse-Smale
complex is given by a combinatorial gradient field. In this setting, the simplification
changes the combinatorial flow, which yields an indirect simplification of the
Morse-Smale complex. The topological complexity of the Morse-Smale complex is
reduced in both representations. However, the simplifications generally yield
different results. In this chapter, we emphasize properties of the two representations
that cause these differences. We also provide a complexity analysis of the two
schemes with respect to running time and memory consumption.
acknowledgement: This research is supported and funded by the Digiteo unTopoVis project,
the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC.
article_processing_charge: No
author:
- first_name: David
full_name: Günther, David
last_name: Günther
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Hans-Peter
full_name: Seidel, Hans-Peter
last_name: Seidel
- first_name: Tino
full_name: Weinkauf, Tino
last_name: Weinkauf
citation:
ama: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification
of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds.
Topological Methods in Data Analysis and Visualization III. Mathematics
and Visualization. Cham: Springer Nature; 2014:135-150. doi:10.1007/978-3-319-04099-8_9'
apa: 'Günther, D., Reininghaus, J., Seidel, H.-P., & Weinkauf, T. (2014). Notes
on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V.
Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and
Visualization III. (pp. 135–150). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-04099-8_9'
chicago: 'Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf.
“Notes on the Simplification of the Morse-Smale Complex.” In Topological Methods
in Data Analysis and Visualization III., edited by Peer-Timo Bremer, Ingrid
Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization.
Cham: Springer Nature, 2014. https://doi.org/10.1007/978-3-319-04099-8_9.'
ieee: 'D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the
simplification of the Morse-Smale complex,” in Topological Methods in Data
Analysis and Visualization III., P.-T. Bremer, I. Hotz, V. Pascucci, and R.
Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.'
ista: 'Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification
of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization
III. , 135–150.'
mla: Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.”
Topological Methods in Data Analysis and Visualization III., edited by
Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:10.1007/978-3-319-04099-8_9.
short: D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer,
I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis
and Visualization III., Springer Nature, Cham, 2014, pp. 135–150.
date_created: 2022-03-04T08:33:57Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2023-09-05T15:33:45Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_9
ec_funded: 1
editor:
- first_name: Peer-Timo
full_name: Bremer, Peer-Timo
last_name: Bremer
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
- first_name: Valerio
full_name: Pascucci, Valerio
last_name: Pascucci
- first_name: Ronald
full_name: Peikert, Ronald
last_name: Peikert
language:
- iso: eng
month: '03'
oa_version: None
page: 135-150
place: Cham
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Topological Methods in Data Analysis and Visualization III.
publication_identifier:
eisbn:
- '9783319040998'
eissn:
- 2197-666X
isbn:
- '9783319040981'
issn:
- 1612-3786
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: Mathematics and Visualization
status: public
title: Notes on the simplification of the Morse-Smale complex
type: book_chapter
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2014'
...
---
_id: '10884'
abstract:
- lang: eng
text: "We revisit the parameterized model checking problem for token-passing systems
and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have
shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional
token rings can be reduced to checking rings up to some cutoff size. Clarke et
al. (2004) have shown a similar result for general topologies and indexed LTL
\\X, provided processes cannot choose the directions for sending or receiving
the token.\r\nWe unify and substantially extend these results by systematically
exploring fragments of indexed CTL ∗ \\X with respect to general topologies.
For each fragment we establish whether a cutoff exists, and for some concrete
topologies, such as rings, cliques and stars, we infer small cutoffs. Finally,
we show that the problem becomes undecidable, and thus no cutoffs exist, if processes
are allowed to choose the directions in which they send or from which they receive
the token."
acknowledgement: "This work was supported by the Austrian Science Fund through grant
P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23);
ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants
PROSEED, ICT12-059, and VRG11-005."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Ayrat
full_name: Khalimov, Ayrat
last_name: Khalimov
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing
systems. In: Verification, Model Checking, and Abstract Interpretation.
Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15'
apa: 'Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized
model checking of token-passing systems. In Verification, Model Checking, and
Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States:
Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15'
chicago: Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized
Model Checking of Token-Passing Systems.” In Verification, Model Checking,
and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.
ieee: B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking
of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation,
San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
ista: 'Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking
of token-passing systems. Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
262–281.'
mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”
Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer
Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.
short: B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking,
and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
conference:
end_date: 2014-01-21
location: San Diego, CA, United States
name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2022-03-18T13:01:22Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2022-05-17T08:36:01Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_15
ec_funded: 1
external_id:
arxiv:
- '1311.4425'
intvolume: ' 8318'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1311.4425'
month: '01'
oa: 1
oa_version: Preprint
page: 262-281
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Verification, Model Checking, and Abstract Interpretation
publication_identifier:
eisbn:
- '9783642540134'
eissn:
- 1611-3349
isbn:
- '9783642540127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameterized model checking of token-passing systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '10885'
abstract:
- lang: eng
text: "Two-player games on graphs provide the theoretical framework for many important
problems such as reactive synthesis. While the traditional study of two-player
zero-sum games has been extended to multi-player games with several notions of
equilibria, they are decidable only for perfect-information games, whereas several
applications require imperfect-information games.\r\nIn this paper we propose
a new notion of equilibria, called doomsday equilibria, which is a strategy profile
such that all players satisfy their own objective, and if any coalition of players
deviates and violates even one of the players objective, then the objective of
every player is violated.\r\nWe present algorithms and complexity results for
deciding the existence of doomsday equilibria for various classes of ω-regular
objectives, both for imperfect-information games, and for perfect-information
games.We provide optimal complexity bounds for imperfect-information games, and
in most cases for perfect-information games."
acknowledgement: " Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF
NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Emmanuel
full_name: Filiot, Emmanuel
last_name: Filiot
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
citation:
ama: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular
games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation.
Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5'
apa: 'Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday
equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking,
and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United
States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5'
chicago: 'Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François
Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification,
Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature,
2014. https://doi.org/10.1007/978-3-642-54013-4_5.'
ieee: 'K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria
for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and
Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp.
78–97.'
ista: 'Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for
omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
78–97.'
mla: 'Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.”
VMCAI 2014: Verification, Model Checking, and Abstract Interpretation,
vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.'
short: 'K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification,
Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.'
conference:
end_date: 2014-01-21
location: San Diego, CA, United States
name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2022-03-18T13:03:15Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2023-02-23T12:52:24Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_5
ec_funded: 1
external_id:
arxiv:
- '1311.3238'
intvolume: ' 8318'
language:
- iso: eng
month: '01'
oa_version: Preprint
page: 78-97
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 'VMCAI 2014: Verification, Model Checking, and Abstract Interpretation'
publication_identifier:
eisbn:
- '9783642540134'
eissn:
- 1611-3349
isbn:
- '9783642540127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '681'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Doomsday equilibria for omega-regular games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '10886'
abstract:
- lang: eng
text: We propose a method for visualizing two-dimensional symmetric positive definite
tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the
heat kernel and was originally introduced as an isometry invariant shape signature.
Each positive definite tensor field defines a Riemannian manifold by considering
the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply
the definition of the HKS. The resulting scalar quantity is used for the visualization
of tensor fields. The HKS is closely related to the Gaussian curvature of the
Riemannian manifold and the time parameter of the heat kernel allows a multiscale
analysis in a natural way. In this way, the HKS represents field related scale
space properties, enabling a level of detail analysis of tensor fields. This makes
the HKS an interesting new scalar quantity for tensor fields, which differs significantly
from usual tensor invariants like the trace or the determinant. A method for visualization
and a numerical realization of the HKS for tensor fields is proposed in this chapter.
To validate the approach we apply it to some illustrating simple examples as isolated
critical points and to a medical diffusion tensor data set.
acknowledgement: This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.
alternative_title:
- Mathematics and Visualization
article_processing_charge: No
author:
- first_name: Valentin
full_name: Zobel, Valentin
last_name: Zobel
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
citation:
ama: 'Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric
positive definite tensor fields using the heat kernel signature. In: Topological
Methods in Data Analysis and Visualization III . Springer; 2014:249-262. doi:10.1007/978-3-319-04099-8_16'
apa: Zobel, V., Reininghaus, J., & Hotz, I. (2014). Visualization of two-dimensional
symmetric positive definite tensor fields using the heat kernel signature. In
Topological Methods in Data Analysis and Visualization III (pp. 249–262).
Springer. https://doi.org/10.1007/978-3-319-04099-8_16
chicago: Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional
Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In
Topological Methods in Data Analysis and Visualization III , 249–62. Springer,
2014. https://doi.org/10.1007/978-3-319-04099-8_16.
ieee: V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric
positive definite tensor fields using the heat kernel signature,” in Topological
Methods in Data Analysis and Visualization III , 2014, pp. 249–262.
ista: Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric
positive definite tensor fields using the heat kernel signature. Topological Methods
in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.
mla: Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive
Definite Tensor Fields Using the Heat Kernel Signature.” Topological Methods
in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16.
short: V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis
and Visualization III , Springer, 2014, pp. 249–262.
date_created: 2022-03-18T13:05:39Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2023-09-05T14:13:16Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_16
language:
- iso: eng
month: '03'
oa_version: None
page: 249-262
publication: 'Topological Methods in Data Analysis and Visualization III '
publication_identifier:
eisbn:
- '9783319040998'
eissn:
- 2197-666X
isbn:
- '9783319040981'
issn:
- 1612-3786
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visualization of two-dimensional symmetric positive definite tensor fields
using the heat kernel signature
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2014'
...
---
_id: '10892'
abstract:
- lang: eng
text: "In this paper, we introduce planar matchings on directed pseudo-line arrangements,
which yield a planar set of pseudo-line segments such that only matching-partners
are adjacent. By translating the planar matching problem into a corresponding
stable roommates problem we show that such matchings always exist.\r\nUsing our
new framework, we establish, for the first time, a complete, rigorous definition
of weighted straight skeletons, which are based on a so-called wavefront propagation
process. We present a generalized and unified approach to treat structural changes
in the wavefront that focuses on the restoration of weak planarity by finding
planar matchings."
acknowledgement: 'T. Biedl was supported by NSERC and the Ross and Muriel Cheriton
Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Therese
full_name: Biedl, Therese
last_name: Biedl
- first_name: Stefan
full_name: Huber, Stefan
id: 4700A070-F248-11E8-B48F-1D18A9856A87
last_name: Huber
orcid: 0000-0002-8871-5814
- first_name: Peter
full_name: Palfrader, Peter
last_name: Palfrader
citation:
ama: 'Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons.
In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature;
2014:117-127. doi:10.1007/978-3-319-13075-0_10'
apa: 'Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted
straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889,
pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10'
chicago: Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for
Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014,
8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10.
ieee: T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight
skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea,
2014, vol. 8889, pp. 117–127.
ista: 'Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight
skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium
on Algorithms and Computation, LNCS, vol. 8889, 117–127.'
mla: Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.”
25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014,
pp. 117–27, doi:10.1007/978-3-319-13075-0_10.
short: T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC
2014, Springer Nature, 2014, pp. 117–127.
conference:
end_date: 2014-12-17
location: Jeonju, Korea
name: 'ISAAC: International Symposium on Algorithms and Computation'
start_date: 2014-12-15
date_created: 2022-03-21T07:09:03Z
date_published: 2014-11-08T00:00:00Z
date_updated: 2023-02-23T12:20:55Z
day: '08'
department:
- _id: HeEd
doi: 10.1007/978-3-319-13075-0_10
intvolume: ' 8889'
language:
- iso: eng
month: '11'
oa_version: None
page: 117-127
publication: 25th International Symposium, ISAAC 2014
publication_identifier:
eisbn:
- '9783319130750'
eissn:
- 1611-3349
isbn:
- '9783319130743'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '481'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Planar matchings for weighted straight skeletons
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8889
year: '2014'
...
---
_id: '10893'
abstract:
- lang: eng
text: Saddle periodic orbits are an essential and stable part of the topological
skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm
to robustly extract these features. In this chapter, we present a novel technique
to extract saddle periodic orbits. Exploiting the analytic properties of such
an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent
(FTLE) that indicates its presence. Using persistent homology, we can then extract
the robust cycles of this field. These cycles thereby represent the saddle periodic
orbits of the given vector field. We discuss the different existing FTLE approximation
schemes regarding their applicability to this specific problem and propose an
adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate
our method using simple analytic vector field data.
acknowledgement: First, we thank the reviewers of this paper for their ideas and critical
comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions.
This research is supported by the European Commission under the TOPOSYS project
FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the
European Science Foundation under the ACAT Research Network Program.
article_processing_charge: No
author:
- first_name: Jens
full_name: Kasten, Jens
last_name: Kasten
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Wieland
full_name: Reich, Wieland
last_name: Reich
- first_name: Gerik
full_name: Scheuermann, Gerik
last_name: Scheuermann
citation:
ama: 'Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of
saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. Topological
Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization.
Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4'
apa: 'Kasten, J., Reininghaus, J., Reich, W., & Scheuermann, G. (2014). Toward
the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci,
& R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization
III (Vol. 1, pp. 55–69). Cham: Springer. https://doi.org/10.1007/978-3-319-04099-8_4'
chicago: 'Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward
the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis
and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci,
and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014.
https://doi.org/10.1007/978-3-319-04099-8_4.'
ieee: 'J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction
of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization
III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham:
Springer, 2014, pp. 55–69.'
ista: 'Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction
of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization
III . vol. 1, 55–69.'
mla: Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological
Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer
et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4.
short: J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I.
Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and
Visualization III , Springer, Cham, 2014, pp. 55–69.
date_created: 2022-03-21T07:11:23Z
date_published: 2014-03-19T00:00:00Z
date_updated: 2022-06-21T12:01:47Z
day: '19'
department:
- _id: HeEd
doi: 10.1007/978-3-319-04099-8_4
ec_funded: 1
editor:
- first_name: Peer-Timo
full_name: Bremer, Peer-Timo
last_name: Bremer
- first_name: Ingrid
full_name: Hotz, Ingrid
last_name: Hotz
- first_name: Valerio
full_name: Pascucci, Valerio
last_name: Pascucci
- first_name: Ronald
full_name: Peikert, Ronald
last_name: Peikert
intvolume: ' 1'
language:
- iso: eng
month: '03'
oa_version: None
page: 55-69
place: Cham
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: 'Topological Methods in Data Analysis and Visualization III '
publication_identifier:
eisbn:
- '9783319040998'
eissn:
- 2197-666X
isbn:
- '9783319040981'
issn:
- 1612-3786
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
series_title: Mathematics and Visualization
status: public
title: Toward the extraction of saddle periodic orbits
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1
year: '2014'
...
---
_id: '10894'
abstract:
- lang: eng
text: PHAT is a C++ library for the computation of persistent homology by matrix
reduction. We aim for a simple generic design that decouples algorithms from data
structures without sacrificing efficiency or user-friendliness. This makes PHAT
a versatile platform for experimenting with algorithmic ideas and comparing them
to state of the art implementations.
article_processing_charge: No
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Michael
full_name: Kerber, Michael
last_name: Kerber
- first_name: Jan
full_name: Reininghaus, Jan
id: 4505473A-F248-11E8-B48F-1D18A9856A87
last_name: Reininghaus
- first_name: Hubert
full_name: Wagner, Hubert
last_name: Wagner
citation:
ama: 'Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms
Toolbox. In: ICMS 2014: International Congress on Mathematical Software.
Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143.
doi:10.1007/978-3-662-44199-2_24'
apa: 'Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2014). PHAT – Persistent
Homology Algorithms Toolbox. In ICMS 2014: International Congress on Mathematical
Software (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg.
https://doi.org/10.1007/978-3-662-44199-2_24'
chicago: 'Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT
– Persistent Homology Algorithms Toolbox.” In ICMS 2014: International Congress
on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer
Berlin Heidelberg, 2014. https://doi.org/10.1007/978-3-662-44199-2_24.'
ieee: 'U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology
Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software,
Seoul, South Korea, 2014, vol. 8592, pp. 137–143.'
ista: 'Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology
Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software.
ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.'
mla: 'Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” ICMS
2014: International Congress on Mathematical Software, vol. 8592, Springer
Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.'
short: 'U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International
Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg,
2014, pp. 137–143.'
conference:
end_date: 2014-08-09
location: Seoul, South Korea
name: 'ICMS: International Congress on Mathematical Software'
start_date: 2014-08-05
date_created: 2022-03-21T07:12:16Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-09-20T09:42:40Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-662-44199-2_24
intvolume: ' 8592'
language:
- iso: eng
month: '09'
oa_version: None
page: 137-143
place: Berlin, Heidelberg
publication: 'ICMS 2014: International Congress on Mathematical Software'
publication_identifier:
eisbn:
- '9783662441992'
eissn:
- 1611-3349
isbn:
- '9783662441985'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
related_material:
record:
- id: '1433'
relation: later_version
status: public
scopus_import: '1'
series_title: LNCS
status: public
title: PHAT – Persistent Homology Algorithms Toolbox
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 8592
year: '2014'
...
---
_id: '8044'
abstract:
- lang: eng
text: Many questions concerning models in quantum mechanics require a detailed analysis
of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable
Hilbert space. Of particular relevance for an understanding of the low-temperature
properties of a system is the structure of the excitation spectrum, which is the
part of the spectrum close to the spectral bottom. We present recent progress
on this question for bosonic many-body quantum systems with weak two-body interactions.
Such system are currently of great interest, due to their experimental realization
in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations,
which predicts that the low-energy spectrum is made up of sums of elementary excitations,
with linear dispersion law at low momentum. The latter property is crucial for
the superfluid behavior the system.
article_processing_charge: No
author:
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Seiringer R. Structure of the excitation spectrum for many-body quantum systems.
In: Proceeding of the International Congress of Mathematicans. Vol 3. International
Congress of Mathematicians; 2014:1175-1194.'
apa: 'Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum
systems. In Proceeding of the International Congress of Mathematicans (Vol.
3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.'
chicago: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body
Quantum Systems.” In Proceeding of the International Congress of Mathematicans,
3:1175–94. International Congress of Mathematicians, 2014.
ieee: R. Seiringer, “Structure of the excitation spectrum for many-body quantum
systems,” in Proceeding of the International Congress of Mathematicans,
Seoul, South Korea, 2014, vol. 3, pp. 1175–1194.
ista: 'Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum
systems. Proceeding of the International Congress of Mathematicans. ICM: International
Congress of Mathematicans vol. 3, 1175–1194.'
mla: Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum
Systems.” Proceeding of the International Congress of Mathematicans, vol.
3, International Congress of Mathematicians, 2014, pp. 1175–94.
short: R. Seiringer, in:, Proceeding of the International Congress of Mathematicans,
International Congress of Mathematicians, 2014, pp. 1175–1194.
conference:
end_date: 2014-08-21
location: Seoul, South Korea
name: 'ICM: International Congress of Mathematicans'
start_date: 2014-08-13
date_created: 2020-06-29T07:59:35Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2023-10-17T11:12:33Z
day: '01'
department:
- _id: RoSe
intvolume: ' 3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.icm2014.org/en/vod/proceedings.html
month: '08'
oa: 1
oa_version: Published Version
page: 1175-1194
publication: Proceeding of the International Congress of Mathematicans
publication_identifier:
isbn:
- '9788961058063'
publication_status: published
publisher: International Congress of Mathematicians
quality_controlled: '1'
scopus_import: '1'
status: public
title: Structure of the excitation spectrum for many-body quantum systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2014'
...
---
_id: '1629'
abstract:
- lang: eng
text: We propose a method for propagating edit operations in 2D vector graphics,
based on geometric relationship functions. These functions quantify the geometric
relationship of a point to a polygon, such as the distance to the boundary or
the direction to the closest corner vertex. The level sets of the relationship
functions describe points with the same relationship to a polygon. For a given
query point, we first determine a set of relationships to local features, construct
all level sets for these relationships, and accumulate them. The maxima of the
resulting distribution are points with similar geometric relationships. We show
extensions to handle mirror symmetries, and discuss the use of relationship functions
as local coordinate systems. Our method can be applied, for example, to interactive
floorplan editing, and it is especially useful for large layouts, where individual
edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds
of objects by propagating relatively few edit operations.
article_number: '15'
author:
- first_name: Paul
full_name: Guerrero, Paul
last_name: Guerrero
- first_name: Stefan
full_name: Jeschke, Stefan
id: 44D6411A-F248-11E8-B48F-1D18A9856A87
last_name: Jeschke
- first_name: Michael
full_name: Wimmer, Michael
last_name: Wimmer
- first_name: Peter
full_name: Wonka, Peter
last_name: Wonka
citation:
ama: Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2591010
apa: Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2014). Edit propagation
using geometric relationship functions. ACM Transactions on Graphics. ACM.
https://doi.org/10.1145/2591010
chicago: Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit
Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics.
ACM, 2014. https://doi.org/10.1145/2591010.
ieee: P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using
geometric relationship functions,” ACM Transactions on Graphics, vol. 33,
no. 2. ACM, 2014.
ista: Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric
relationship functions. ACM Transactions on Graphics. 33(2), 15.
mla: Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.”
ACM Transactions on Graphics, vol. 33, no. 2, 15, ACM, 2014, doi:10.1145/2591010.
short: P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics
33 (2014).
date_created: 2018-12-11T11:53:08Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2021-01-12T06:52:06Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/2591010
file:
- access_level: open_access
checksum: 7f91e588a4e888610313b98271e6418e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:22Z
date_updated: 2020-07-14T12:45:07Z
file_id: '4876'
file_name: IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf
file_size: 9832561
relation: main_file
file_date_updated: 2020-07-14T12:45:07Z
has_accepted_license: '1'
intvolume: ' 33'
issue: '2'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
publication: ACM Transactions on Graphics
publication_status: published
publisher: ACM
publist_id: '5526'
pubrep_id: '577'
quality_controlled: '1'
status: public
title: Edit propagation using geometric relationship functions
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2014'
...
---
_id: '1643'
abstract:
- lang: eng
text: We extend the notion of verifiable random functions (VRF) to constrained VRFs,
which generalize the concept of constrained pseudorandom functions, put forward
by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13)
and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs,
respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom
function at any point of its domain; in addition, it enables computation of a
non-interactive proof that the function value was computed correctly. In a constrained
VRF from the key sk one can derive constrained keys skS for subsets S of the domain,
which allow computation of function values and proofs only at points in S. After
formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based
constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for
any set that can be decided by a polynomial-size circuit. Our VRFs have the same
function values as the Boneh-Waters PRFs and are proved secure under the same
hardness assumption, showing that verifiability comes at no cost. Constrained
(functional) VRFs were stated as an open problem by Boyle et al.
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Fuchsbauer, Georg
id: 46B4C3EE-F248-11E8-B48F-1D18A9856A87
last_name: Fuchsbauer
citation:
ama: 'Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De
Prisco R, eds. SCN 2014. Vol 8642. Springer; 2014:95-114. doi:10.1007/978-3-319-10879-7_7'
apa: 'Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla
& R. De Prisco (Eds.), SCN 2014 (Vol. 8642, pp. 95–114). Amalfi, Italy:
Springer. https://doi.org/10.1007/978-3-319-10879-7_7'
chicago: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In SCN
2014, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer,
2014. https://doi.org/10.1007/978-3-319-10879-7_7.
ieee: G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in SCN 2014,
Amalfi, Italy, 2014, vol. 8642, pp. 95–114.
ista: 'Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN:
Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.'
mla: Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” SCN 2014,
edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp.
95–114, doi:10.1007/978-3-319-10879-7_7.
short: G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer,
2014, pp. 95–114.
conference:
end_date: 2014-09-05
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2014-09-03
date_created: 2018-12-11T11:53:13Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:12Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-319-10879-7_7
ec_funded: 1
editor:
- first_name: Michel
full_name: Abdalla, Michel
last_name: Abdalla
- first_name: Roberto
full_name: De Prisco, Roberto
last_name: De Prisco
intvolume: ' 8642'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://eprint.iacr.org/2014/537
month: '01'
oa: 1
oa_version: Submitted Version
page: 95 - 114
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication: SCN 2014
publication_status: published
publisher: Springer
publist_id: '5509'
scopus_import: 1
status: public
title: 'Constrained Verifiable Random Functions '
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8642
year: '2014'
...
---
_id: '1702'
abstract:
- lang: eng
text: In this paper we present INTERHORN, a solver for recursion-free Horn clauses.
The main application domain of INTERHORN lies in solving interpolation problems
arising in software verification. We show how a range of interpolation problems,
including path, transition, nested, state/transition and well-founded interpolation
can be handled directly by INTERHORN. By detailing these interpolation problems
and their Horn clause representations, we hope to encourage the emergence of a
common back-end interpolation interface useful for diverse verification tools.
alternative_title:
- EPTCS
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion
free-horn clauses. In: Electronic Proceedings in Theoretical Computer Science,
EPTCS. Vol 169. Open Publishing; 2014:31-38. doi:10.4204/EPTCS.169.5'
apa: 'Gupta, A., Popeea, C., & Rybalchenko, A. (2014). Generalised interpolation
by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical
Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing.
https://doi.org/10.4204/EPTCS.169.5'
chicago: Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised
Interpolation by Solving Recursion Free-Horn Clauses.” In Electronic Proceedings
in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing, 2014.
https://doi.org/10.4204/EPTCS.169.5.
ieee: A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving
recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer
Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.
ista: 'Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving
recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science,
EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.'
mla: Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn
Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS,
vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.
short: A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical
Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.
conference:
end_date: 2014-07-17
location: Vienna, Austria
name: 'HCVS: Horn Clauses for Verification and Synthesis'
start_date: 2014-07-17
date_created: 2018-12-11T11:53:33Z
date_published: 2014-12-02T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '02'
department:
- _id: ToHe
doi: 10.4204/EPTCS.169.5
intvolume: ' 169'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.7378v2
month: '12'
oa: 1
oa_version: Submitted Version
page: 31 - 38
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing
publist_id: '5435'
quality_controlled: '1'
status: public
title: Generalised interpolation by solving recursion free-horn clauses
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 169
year: '2014'
...
---
_id: '1708'
abstract:
- lang: eng
text: It has been long argued that, because of inherent ambiguity and noise, the
brain needs to represent uncertainty in the form of probability distributions.
The neural encoding of such distributions remains however highly controversial.
Here we present a novel circuit model for representing multidimensional real-valued
distributions using a spike based spatio-temporal code. Our model combines the
computational advantages of the currently competing models for probabilistic codes
and exhibits realistic neural responses along a variety of classic measures. Furthermore,
the model highlights the challenges associated with interpreting neural activity
in relation to behavioral uncertainty and points to alternative population-level
approaches for the experimental validation of distributed representations.
author:
- first_name: Cristina
full_name: Savin, Cristina
id: 3933349E-F248-11E8-B48F-1D18A9856A87
last_name: Savin
- first_name: Sophie
full_name: Denève, Sophie
last_name: Denève
citation:
ama: 'Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking
neural networks. In: Vol 3. Neural Information Processing Systems; 2014:2024-2032.'
apa: 'Savin, C., & Denève, S. (2014). Spatio-temporal representations of uncertainty
in spiking neural networks (Vol. 3, pp. 2024–2032). Presented at the NIPS: Neural
Information Processing Systems, Montreal, Canada: Neural Information Processing
Systems.'
chicago: Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of
Uncertainty in Spiking Neural Networks,” 3:2024–32. Neural Information Processing
Systems, 2014.
ieee: 'C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in
spiking neural networks,” presented at the NIPS: Neural Information Processing
Systems, Montreal, Canada, 2014, vol. 3, no. January, pp. 2024–2032.'
ista: 'Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in
spiking neural networks. NIPS: Neural Information Processing Systems vol. 3, 2024–2032.'
mla: Savin, Cristina, and Sophie Denève. Spatio-Temporal Representations of Uncertainty
in Spiking Neural Networks. Vol. 3, no. January, Neural Information Processing
Systems, 2014, pp. 2024–32.
short: C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, pp.
2024–2032.
conference:
end_date: 2014-12-13
location: Montreal, Canada
name: 'NIPS: Neural Information Processing Systems'
start_date: 2014-12-08
date_created: 2018-12-11T11:53:35Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:52:40Z
day: '01'
department:
- _id: GaTk
intvolume: ' 3'
issue: January
language:
- iso: eng
main_file_link:
- url: http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf
month: '01'
oa_version: None
page: 2024 - 2032
publication_status: published
publisher: Neural Information Processing Systems
publist_id: '5427'
quality_controlled: '1'
scopus_import: 1
status: public
title: Spatio-temporal representations of uncertainty in spiking neural networks
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2014'
...
---
_id: '1733'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a distance for interfaces, called interface simulation distance. It makes the
alternating refinement preorder quantitative by, intuitively, tolerating errors
(while counting them) in the alternating simulation game. We show that the interface
simulation distance satisfies the triangle inequality, that the distance between
two interfaces does not increase under parallel composition with a third interface,
that the distance between two interfaces can be bounded from above and below by
distances between abstractions of the two interfaces, and how to synthesize an
interface from incompatible requirements. We illustrate the framework, and the
properties of the distances under composition of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- 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: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances.
Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019
apa: Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface
simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” Theoretical Computer Science. Elsevier,
2014. https://doi.org/10.1016/j.tcs.2014.08.019.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation
distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp.
348–363, 2014.
ista: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation
distances. Theoretical Computer Science. 560(3), 348–363.
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer
Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer
Science 560 (2014) 348–363.
date_created: 2018-12-11T11:53:43Z
date_published: 2014-12-04T00:00:00Z
date_updated: 2023-02-23T11:04:00Z
day: '04'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1016/j.tcs.2014.08.019
ec_funded: 1
intvolume: ' 560'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '12'
oa: 1
oa_version: Submitted Version
page: 348 - 363
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5392'
quality_controlled: '1'
related_material:
record:
- id: '2916'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Interface simulation distances
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 560
year: '2014'
...