---
_id: '2253'
abstract:
- lang: eng
text: Plant growth is achieved predominantly by cellular elongation, which is thought
to be controlled on several levels by apoplastic auxin. Auxin export into the
apoplast is achieved by plasma membrane efflux catalysts of the PIN-FORMED (PIN)
and ATP-binding cassette protein subfamily B/phosphor- glycoprotein (ABCB/PGP)
classes; the latter were shown to depend on interaction with the FKBP42, TWISTED
DWARF1 (TWD1). Here by using a transgenic approach in combination with phenotypical,
biochemical and cell biological analyses we demonstrate the importance of a putative
C-terminal in-plane membrane anchor of TWD1 in the regulation of ABCB-mediated
auxin transport. In contrast with dwarfed twd1 loss-of-function alleles, TWD1
gain-of-function lines that lack a putative in-plane membrane anchor (HA-TWD1-Ct)
show hypermorphic plant architecture, characterized by enhanced stem length and
leaf surface but reduced shoot branching. Greater hypocotyl length is the result
of enhanced cell elongation that correlates with reduced polar auxin transport
capacity for HA-TWD1-Ct. As a consequence, HA-TWD1-Ct displays higher hypocotyl
auxin accumulation, which is shown to result in elevated auxin-induced cell elongation
rates. Our data highlight the importance of C-terminal membrane anchoring for
TWD1 action, which is required for specific regulation of ABCB-mediated auxin
transport. These data support a model in which TWD1 controls lateral ABCB1-mediated
export into the apoplast, which is required for auxin-mediated cell elongation.
article_processing_charge: No
article_type: original
author:
- first_name: Aurélien
full_name: Bailly, Aurélien
last_name: Bailly
- first_name: Bangjun
full_name: Wang, Bangjun
last_name: Wang
- first_name: Marta
full_name: Zwiewka, Marta
last_name: Zwiewka
- first_name: Stephan
full_name: Pollmann, Stephan
last_name: Pollmann
- first_name: Daniel
full_name: Schenck, Daniel
last_name: Schenck
- first_name: Hartwig
full_name: Lüthen, Hartwig
last_name: Lüthen
- first_name: Alexander
full_name: Schulz, Alexander
last_name: Schulz
- first_name: Jirí
full_name: Friml, Jirí
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
- first_name: Markus
full_name: Geisler, Markus
last_name: Geisler
citation:
ama: Bailly A, Wang B, Zwiewka M, et al. Expression of TWISTED DWARF1 lacking its
in-plane membrane anchor leads to increased cell elongation and hypermorphic growth.
Plant Journal. 2014;77(1):108-118. doi:10.1111/tpj.12369
apa: Bailly, A., Wang, B., Zwiewka, M., Pollmann, S., Schenck, D., Lüthen, H., …
Geisler, M. (2014). Expression of TWISTED DWARF1 lacking its in-plane membrane
anchor leads to increased cell elongation and hypermorphic growth. Plant Journal.
Wiley-Blackwell. https://doi.org/10.1111/tpj.12369
chicago: Bailly, Aurélien, Bangjun Wang, Marta Zwiewka, Stephan Pollmann, Daniel
Schenck, Hartwig Lüthen, Alexander Schulz, Jiří Friml, and Markus Geisler. “Expression
of TWISTED DWARF1 Lacking Its In-Plane Membrane Anchor Leads to Increased Cell
Elongation and Hypermorphic Growth.” Plant Journal. Wiley-Blackwell, 2014.
https://doi.org/10.1111/tpj.12369.
ieee: A. Bailly et al., “Expression of TWISTED DWARF1 lacking its in-plane
membrane anchor leads to increased cell elongation and hypermorphic growth,” Plant
Journal, vol. 77, no. 1. Wiley-Blackwell, pp. 108–118, 2014.
ista: Bailly A, Wang B, Zwiewka M, Pollmann S, Schenck D, Lüthen H, Schulz A, Friml
J, Geisler M. 2014. Expression of TWISTED DWARF1 lacking its in-plane membrane
anchor leads to increased cell elongation and hypermorphic growth. Plant Journal.
77(1), 108–118.
mla: Bailly, Aurélien, et al. “Expression of TWISTED DWARF1 Lacking Its In-Plane
Membrane Anchor Leads to Increased Cell Elongation and Hypermorphic Growth.” Plant
Journal, vol. 77, no. 1, Wiley-Blackwell, 2014, pp. 108–18, doi:10.1111/tpj.12369.
short: A. Bailly, B. Wang, M. Zwiewka, S. Pollmann, D. Schenck, H. Lüthen, A. Schulz,
J. Friml, M. Geisler, Plant Journal 77 (2014) 108–118.
date_created: 2018-12-11T11:56:35Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:18Z
day: '01'
department:
- _id: JiFr
doi: 10.1111/tpj.12369
intvolume: ' 77'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1111/tpj.12369
month: '01'
oa: 1
oa_version: Published Version
page: 108 - 118
project:
- _id: 256BDAB0-B435-11E9-9278-68D0E5697425
name: Innovationsförderung in der Grenzregion Österreich – Tschechische Republik
durch die Schaffung von Synergien im Bereich der Forschungsinfrastruktur
publication: Plant Journal
publication_identifier:
issn:
- '09607412'
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4694'
quality_controlled: '1'
scopus_import: 1
status: public
title: Expression of TWISTED DWARF1 lacking its in-plane membrane anchor leads to
increased cell elongation and hypermorphic growth
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 77
year: '2014'
...
---
_id: '2254'
abstract:
- lang: eng
text: Theta-gamma network oscillations are thought to represent key reference signals
for information processing in neuronal ensembles, but the underlying synaptic
mechanisms remain unclear. To address this question, we performed whole-cell (WC)
patch-clamp recordings from mature hippocampal granule cells (GCs) in vivo in
the dentate gyrus of anesthetized and awake rats. GCs in vivo fired action potentials
at low frequency, consistent with sparse coding in the dentate gyrus. GCs were
exposed to barrages of fast AMPAR-mediated excitatory postsynaptic currents (EPSCs),
primarily relayed from the entorhinal cortex, and inhibitory postsynaptic currents
(IPSCs), presumably generated by local interneurons. EPSCs exhibited coherence
with the field potential predominantly in the theta frequency band, whereas IPSCs
showed coherence primarily in the gamma range. Action potentials in GCs were phase
locked to network oscillations. Thus, theta-gamma-modulated synaptic currents
may provide a framework for sparse temporal coding of information in the dentate
gyrus.
author:
- first_name: Alejandro
full_name: Pernia-Andrade, Alejandro
id: 36963E98-F248-11E8-B48F-1D18A9856A87
last_name: Pernia-Andrade
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Pernia-Andrade A, Jonas PM. Theta-gamma-modulated synaptic currents in hippocampal
granule cells in vivo define a mechanism for network oscillations. Neuron.
2014;81(1):140-152. doi:10.1016/j.neuron.2013.09.046
apa: Pernia-Andrade, A., & Jonas, P. M. (2014). Theta-gamma-modulated synaptic
currents in hippocampal granule cells in vivo define a mechanism for network oscillations.
Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2013.09.046
chicago: Pernia-Andrade, Alejandro, and Peter M Jonas. “Theta-Gamma-Modulated Synaptic
Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.”
Neuron. Elsevier, 2014. https://doi.org/10.1016/j.neuron.2013.09.046.
ieee: A. Pernia-Andrade and P. M. Jonas, “Theta-gamma-modulated synaptic currents
in hippocampal granule cells in vivo define a mechanism for network oscillations,”
Neuron, vol. 81, no. 1. Elsevier, pp. 140–152, 2014.
ista: Pernia-Andrade A, Jonas PM. 2014. Theta-gamma-modulated synaptic currents
in hippocampal granule cells in vivo define a mechanism for network oscillations.
Neuron. 81(1), 140–152.
mla: Pernia-Andrade, Alejandro, and Peter M. Jonas. “Theta-Gamma-Modulated Synaptic
Currents in Hippocampal Granule Cells in Vivo Define a Mechanism for Network Oscillations.”
Neuron, vol. 81, no. 1, Elsevier, 2014, pp. 140–52, doi:10.1016/j.neuron.2013.09.046.
short: A. Pernia-Andrade, P.M. Jonas, Neuron 81 (2014) 140–152.
date_created: 2018-12-11T11:56:35Z
date_published: 2014-01-08T00:00:00Z
date_updated: 2021-01-12T06:56:19Z
day: '08'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2013.09.046
ec_funded: 1
file:
- access_level: open_access
checksum: 438547cfcd9045a22f065f2019f07849
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:48Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4773'
file_name: IST-2016-422-v1+1_1-s2.0-S0896627313009227-main.pdf
file_size: 4373072
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 81'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 140 - 152
project:
- _id: 25C0F108-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '268548'
name: Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons
- _id: 25C26B1E-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P24909-B24
name: Mechanisms of transmitter release at GABAergic synapses
publication: Neuron
publication_identifier:
issn:
- '08966273'
publication_status: published
publisher: Elsevier
publist_id: '4692'
pubrep_id: '422'
quality_controlled: '1'
scopus_import: 1
status: public
title: Theta-gamma-modulated synaptic currents in hippocampal granule cells in vivo
define a mechanism for network oscillations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 81
year: '2014'
...
---
_id: '2255'
abstract:
- lang: eng
text: Motivated by applications in biology, we present an algorithm for estimating
the length of tube-like shapes in 3-dimensional Euclidean space. In a first step,
we combine the tube formula of Weyl with integral geometric methods to obtain
an integral representation of the length, which we approximate using a variant
of the Koksma-Hlawka Theorem. In a second step, we use tools from computational
topology to decrease the dependence on small perturbations of the shape. We present
computational experiments that shed light on the stability and the convergence
rate of our algorithm.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Florian
full_name: Pausinger, Florian
id: 2A77D7A2-F248-11E8-B48F-1D18A9856A87
last_name: Pausinger
orcid: 0000-0002-8379-3768
citation:
ama: Edelsbrunner H, Pausinger F. Stable length estimates of tube-like shapes. Journal
of Mathematical Imaging and Vision. 2014;50(1):164-177. doi:10.1007/s10851-013-0468-x
apa: Edelsbrunner, H., & Pausinger, F. (2014). Stable length estimates of tube-like
shapes. Journal of Mathematical Imaging and Vision. Springer. https://doi.org/10.1007/s10851-013-0468-x
chicago: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates
of Tube-like Shapes.” Journal of Mathematical Imaging and Vision. Springer,
2014. https://doi.org/10.1007/s10851-013-0468-x.
ieee: H. Edelsbrunner and F. Pausinger, “Stable length estimates of tube-like shapes,”
Journal of Mathematical Imaging and Vision, vol. 50, no. 1. Springer, pp.
164–177, 2014.
ista: Edelsbrunner H, Pausinger F. 2014. Stable length estimates of tube-like shapes.
Journal of Mathematical Imaging and Vision. 50(1), 164–177.
mla: Edelsbrunner, Herbert, and Florian Pausinger. “Stable Length Estimates of Tube-like
Shapes.” Journal of Mathematical Imaging and Vision, vol. 50, no. 1, Springer,
2014, pp. 164–77, doi:10.1007/s10851-013-0468-x.
short: H. Edelsbrunner, F. Pausinger, Journal of Mathematical Imaging and Vision
50 (2014) 164–177.
date_created: 2018-12-11T11:56:36Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2023-09-07T11:41:25Z
day: '01'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/s10851-013-0468-x
ec_funded: 1
file:
- access_level: open_access
checksum: 2f93f3e63a38a85cd4404d7953913b14
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:16:18Z
date_updated: 2020-07-14T12:45:35Z
file_id: '5204'
file_name: IST-2016-549-v1+1_2014-J-06-LengthEstimate.pdf
file_size: 3941391
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 50'
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 164 - 177
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Journal of Mathematical Imaging and Vision
publication_identifier:
issn:
- '09249907'
publication_status: published
publisher: Springer
publist_id: '4691'
pubrep_id: '549'
quality_controlled: '1'
related_material:
record:
- id: '2843'
relation: earlier_version
status: public
- id: '1399'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Stable length estimates of tube-like shapes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 50
year: '2014'
...
---
_id: '2257'
abstract:
- lang: eng
text: 'Maximum entropy models are the least structured probability distributions
that exactly reproduce a chosen set of statistics measured in an interacting network.
Here we use this principle to construct probabilistic models which describe the
correlated spiking activity of populations of up to 120 neurons in the salamander
retina as it responds to natural movies. Already in groups as small as 10 neurons,
interactions between spikes can no longer be regarded as small perturbations in
an otherwise independent system; for 40 or more neurons pairwise interactions
need to be supplemented by a global interaction that controls the distribution
of synchrony in the population. Here we show that such “K-pairwise” models—being
systematic extensions of the previously used pairwise Ising models—provide an
excellent account of the data. We explore the properties of the neural vocabulary
by: 1) estimating its entropy, which constrains the population''s capacity to
represent visual information; 2) classifying activity patterns into a small set
of metastable collective modes; 3) showing that the neural codeword ensembles
are extremely inhomogenous; 4) demonstrating that the state of individual neurons
is highly predictable from the rest of the population, allowing the capacity for
error correction.'
acknowledgement: "\r\n\r\n\r\n\r\nThis work was funded by NSF grant IIS-0613435, NSF
grant PHY-0957573, NSF grant CCF-0939370, NIH grant R01 EY14196, NIH grant P50 GM071508,
the Fannie and John Hertz Foundation, the Swartz Foundation, the WM Keck Foundation,
ANR Optima and the French State program “Investissements d'Avenir” [LIFESENSES:
ANR-10-LABX-65], and the Austrian Research Foundation FWF P25651."
article_number: e1003408
author:
- first_name: Gasper
full_name: Tkacik, Gasper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkacik
orcid: 0000-0002-6699-1455
- first_name: Olivier
full_name: Marre, Olivier
last_name: Marre
- first_name: Dario
full_name: Amodei, Dario
last_name: Amodei
- first_name: Elad
full_name: Schneidman, Elad
last_name: Schneidman
- first_name: William
full_name: Bialek, William
last_name: Bialek
- first_name: Michael
full_name: Berry, Michael
last_name: Berry
citation:
ama: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. Searching for
collective behavior in a large network of sensory neurons. PLoS Computational
Biology. 2014;10(1). doi:10.1371/journal.pcbi.1003408
apa: Tkačik, G., Marre, O., Amodei, D., Schneidman, E., Bialek, W., & Berry,
M. (2014). Searching for collective behavior in a large network of sensory neurons.
PLoS Computational Biology. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1003408
chicago: Tkačik, Gašper, Olivier Marre, Dario Amodei, Elad Schneidman, William Bialek,
and Michael Berry. “Searching for Collective Behavior in a Large Network of Sensory
Neurons.” PLoS Computational Biology. Public Library of Science, 2014.
https://doi.org/10.1371/journal.pcbi.1003408.
ieee: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, and M. Berry, “Searching
for collective behavior in a large network of sensory neurons,” PLoS Computational
Biology, vol. 10, no. 1. Public Library of Science, 2014.
ista: Tkačik G, Marre O, Amodei D, Schneidman E, Bialek W, Berry M. 2014. Searching
for collective behavior in a large network of sensory neurons. PLoS Computational
Biology. 10(1), e1003408.
mla: Tkačik, Gašper, et al. “Searching for Collective Behavior in a Large Network
of Sensory Neurons.” PLoS Computational Biology, vol. 10, no. 1, e1003408,
Public Library of Science, 2014, doi:10.1371/journal.pcbi.1003408.
short: G. Tkačik, O. Marre, D. Amodei, E. Schneidman, W. Bialek, M. Berry, PLoS
Computational Biology 10 (2014).
date_created: 2018-12-11T11:56:36Z
date_published: 2014-01-02T00:00:00Z
date_updated: 2024-02-21T13:46:14Z
day: '02'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1003408
file:
- access_level: open_access
checksum: c720222c5e924a4acb17f23b9381a6ca
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:46Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4965'
file_name: IST-2016-436-v1+1_journal.pcbi.1003408.pdf
file_size: 2194790
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 10'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://repository.ist.ac.at/id/eprint/436
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553734X
publication_status: published
publisher: Public Library of Science
publist_id: '4689'
pubrep_id: '436'
quality_controlled: '1'
related_material:
record:
- id: '5562'
relation: popular_science
status: public
scopus_import: 1
status: public
title: Searching for collective behavior in a large network of sensory neurons
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: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 10
year: '2014'
...
---
_id: '2261'
abstract:
- lang: eng
text: To reveal the full potential of human pluripotent stem cells, new methods
for rapid, site-specific genomic engineering are needed. Here, we describe a system
for precise genetic modification of human embryonic stem cells (ESCs) and induced
pluripotent stem cells (iPSCs). We identified a novel human locus, H11, located
in a safe, intergenic, transcriptionally active region of chromosome 22, as the
recipient site, to provide robust, ubiquitous expression of inserted genes. Recipient
cell lines were established by site-specific placement of a ‘landing pad’ cassette
carrying attP sites for phiC31 and Bxb1 integrases at the H11 locus by spontaneous
or TALEN-assisted homologous recombination. Dual integrase cassette exchange (DICE)
mediated by phiC31 and Bxb1 integrases was used to insert genes of interest flanked
by phiC31 and Bxb1 attB sites at the H11 locus, replacing the landing pad. This
system provided complete control over content, direction and copy number of inserted
genes, with a specificity of 100%. A series of genes, including mCherry and various
combinations of the neural transcription factors LMX1a, FOXA2 and OTX2, were inserted
in recipient cell lines derived from H9 ESC, as well as iPSC lines derived from
a Parkinson’s disease patient and a normal sibling control. The DICE system offers
rapid, efficient and precise gene insertion in ESC and iPSC and is particularly
well suited for repeated modifications of the same locus.
acknowledgement: "California Institute for Regenerative Medicine [RT2-01880 and TR2-01756].
Funding for open access charge: California Institute for Regenerative Medicine [RT2-01880
and TR2-01756]\r\nCC BY 3,0"
article_number: e34
author:
- first_name: Fangfang
full_name: Zhu, Fangfang
last_name: Zhu
- first_name: Matthew
full_name: Gamboa, Matthew
last_name: Gamboa
- first_name: Alfonso
full_name: Farruggio, Alfonso
last_name: Farruggio
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Bosiljka
full_name: Tasic, Bosiljka
last_name: Tasic
- first_name: Birgitt
full_name: Schüle, Birgitt
last_name: Schüle
- first_name: Yanru
full_name: Chen Tsai, Yanru
last_name: Chen Tsai
- first_name: Michele
full_name: Calos, Michele
last_name: Calos
citation:
ama: Zhu F, Gamboa M, Farruggio A, et al. DICE, an efficient system for iterative
genomic editing in human pluripotent stem cells. Nucleic Acids Research.
2014;42(5). doi:10.1093/nar/gkt1290
apa: Zhu, F., Gamboa, M., Farruggio, A., Hippenmeyer, S., Tasic, B., Schüle, B.,
… Calos, M. (2014). DICE, an efficient system for iterative genomic editing in
human pluripotent stem cells. Nucleic Acids Research. Oxford University
Press. https://doi.org/10.1093/nar/gkt1290
chicago: Zhu, Fangfang, Matthew Gamboa, Alfonso Farruggio, Simon Hippenmeyer, Bosiljka
Tasic, Birgitt Schüle, Yanru Chen Tsai, and Michele Calos. “DICE, an Efficient
System for Iterative Genomic Editing in Human Pluripotent Stem Cells.” Nucleic
Acids Research. Oxford University Press, 2014. https://doi.org/10.1093/nar/gkt1290.
ieee: F. Zhu et al., “DICE, an efficient system for iterative genomic editing
in human pluripotent stem cells,” Nucleic Acids Research, vol. 42, no.
5. Oxford University Press, 2014.
ista: Zhu F, Gamboa M, Farruggio A, Hippenmeyer S, Tasic B, Schüle B, Chen Tsai
Y, Calos M. 2014. DICE, an efficient system for iterative genomic editing in human
pluripotent stem cells. Nucleic Acids Research. 42(5), e34.
mla: Zhu, Fangfang, et al. “DICE, an Efficient System for Iterative Genomic Editing
in Human Pluripotent Stem Cells.” Nucleic Acids Research, vol. 42, no.
5, e34, Oxford University Press, 2014, doi:10.1093/nar/gkt1290.
short: F. Zhu, M. Gamboa, A. Farruggio, S. Hippenmeyer, B. Tasic, B. Schüle, Y.
Chen Tsai, M. Calos, Nucleic Acids Research 42 (2014).
date_created: 2018-12-11T11:56:38Z
date_published: 2014-03-05T00:00:00Z
date_updated: 2021-01-12T06:56:22Z
day: '05'
ddc:
- '571'
- '610'
department:
- _id: SiHi
doi: 10.1093/nar/gkt1290
file:
- access_level: open_access
checksum: e9268f5f96a820f04d7ebbf85927c3cb
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:15Z
date_updated: 2020-07-14T12:45:35Z
file_id: '4738'
file_name: IST-2018-961-v1+1_2014_Hippenmeyer_DICE.pdf
file_size: 11044478
relation: main_file
file_date_updated: 2020-07-14T12:45:35Z
has_accepted_license: '1'
intvolume: ' 42'
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Preprint
publication: Nucleic Acids Research
publication_status: published
publisher: Oxford University Press
publist_id: '4684'
pubrep_id: '961'
quality_controlled: '1'
scopus_import: 1
status: public
title: DICE, an efficient system for iterative genomic editing in human pluripotent
stem cells
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: 42
year: '2014'
...
---
_id: '2265'
abstract:
- lang: eng
text: Coordinated migration of newly-born neurons to their target territories is
essential for correct neuronal circuit assembly in the developing brain. Although
a cohort of signaling pathways has been implicated in the regulation of cortical
projection neuron migration, the precise molecular mechanisms and how a balanced
interplay of cell-autonomous and non-autonomous functions of candidate signaling
molecules controls the discrete steps in the migration process, are just being
revealed. In this chapter, I will focally review recent advances that improved
our understanding of the cell-autonomous and possible cell-nonautonomous functions
of the evolutionarily conserved LIS1/NDEL1-complex in regulating the sequential
steps of cortical projection neuron migration. I will then elaborate on the emerging
concept that the Reelin signaling pathway, acts exactly at precise stages in the
course of cortical projection neuron migration. Lastly, I will discuss how finely
tuned transcriptional programs and downstream effectors govern particular aspects
in driving radial migration at discrete stages and how they regulate the precise
positioning of cortical projection neurons in the developing cerebral cortex.
alternative_title:
- Advances in Experimental Medicine and Biology
author:
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: 'Hippenmeyer S. Molecular pathways controlling the sequential steps of cortical
projection neuron migration. In: Nguyen L, ed. Cellular and Molecular Control
of Neuronal Migration. Vol 800. Springer; 2014:1-24. doi:10.1007/978-94-007-7687-6_1'
apa: Hippenmeyer, S. (2014). Molecular pathways controlling the sequential steps
of cortical projection neuron migration. In L. Nguyen (Ed.), Cellular and
Molecular Control of Neuronal Migration (Vol. 800, pp. 1–24). Springer. https://doi.org/10.1007/978-94-007-7687-6_1
chicago: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps
of Cortical Projection Neuron Migration.” In Cellular and Molecular Control
of Neuronal Migration, edited by Laurent Nguyen, 800:1–24. Springer, 2014.
https://doi.org/10.1007/978-94-007-7687-6_1.
ieee: S. Hippenmeyer, “Molecular pathways controlling the sequential steps of cortical
projection neuron migration,” in Cellular and Molecular Control of Neuronal
Migration, vol. 800, L. Nguyen, Ed. Springer, 2014, pp. 1–24.
ista: 'Hippenmeyer S. 2014.Molecular pathways controlling the sequential steps of
cortical projection neuron migration. In: Cellular and Molecular Control of Neuronal
Migration. Advances in Experimental Medicine and Biology, vol. 800, 1–24.'
mla: Hippenmeyer, Simon. “Molecular Pathways Controlling the Sequential Steps of
Cortical Projection Neuron Migration.” Cellular and Molecular Control of Neuronal
Migration, edited by Laurent Nguyen, vol. 800, Springer, 2014, pp. 1–24, doi:10.1007/978-94-007-7687-6_1.
short: S. Hippenmeyer, in:, L. Nguyen (Ed.), Cellular and Molecular Control of
Neuronal Migration, Springer, 2014, pp. 1–24.
date_created: 2018-12-11T11:56:39Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:56:23Z
day: '01'
department:
- _id: SiHi
doi: 10.1007/978-94-007-7687-6_1
editor:
- first_name: Laurent
full_name: Nguyen, Laurent
last_name: Nguyen
intvolume: ' 800'
language:
- iso: eng
month: '01'
oa_version: None
page: 1 - 24
publication: ' Cellular and Molecular Control of Neuronal Migration'
publication_status: published
publisher: Springer
publist_id: '4679'
quality_controlled: '1'
scopus_import: 1
status: public
title: Molecular pathways controlling the sequential steps of cortical projection
neuron migration
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 800
year: '2014'
...
---
_id: '2275'
abstract:
- lang: eng
text: "Energies with high-order non-submodular interactions have been shown to be
very useful in vision due to their high modeling power. Optimization of such energies,
however, is generally NP-hard. A naive approach that works for small problem instances
is exhaustive search, that is, enumeration of all possible labelings of the underlying
graph. We propose a general minimization approach for large graphs based on enumeration
of labelings of certain small patches. \r\nThis partial enumeration technique
reduces complex high-order energy formulations to pairwise Constraint Satisfaction
Problems with unary costs (uCSP), which can be efficiently solved using standard
methods like TRW-S. Our approach outperforms a number of existing state-of-the-art
algorithms on well known difficult problems (e.g. curvature regularization, stereo,
deconvolution); it gives near global minimum and better speed. \r\nOur main application
of interest is curvature regularization. In the context of segmentation, our partial
enumeration technique allows to evaluate curvature directly on small patches using
a novel integral geometry approach.\r\n"
author:
- first_name: Carl
full_name: Olsson, Carl
last_name: Olsson
- first_name: Johannes
full_name: Ulen, Johannes
last_name: Ulen
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. Partial enumeration and curvature
regularization. In: IEEE; 2014:2936-2943. doi:10.1109/ICCV.2013.365'
apa: 'Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration
and curvature regularization (pp. 2936–2943). Presented at the ICCV: International
Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365'
chicago: Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial
Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.
ieee: 'C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and
curvature regularization,” presented at the ICCV: International Conference on
Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.'
ista: 'Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature
regularization. ICCV: International Conference on Computer Vision, 2936–2943.'
mla: Olsson, Carl, et al. Partial Enumeration and Curvature Regularization.
IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
short: C. Olsson, J. Ulen, Y. Boykov, V. Kolmogorov, in:, IEEE, 2014, pp. 2936–2943.
conference:
end_date: 2013-12-08
location: Sydney, Australia
name: 'ICCV: International Conference on Computer Vision'
start_date: 2013-12-01
date_created: 2018-12-11T11:56:42Z
date_published: 2014-03-03T00:00:00Z
date_updated: 2021-01-12T06:56:28Z
day: '03'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/ICCV.2013.365
file:
- access_level: open_access
checksum: 4a74b5c92d6dcd2348c2c10ec8dd18bf
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:30Z
date_updated: 2020-07-14T12:45:36Z
file_id: '4754'
file_name: IST-2016-566-v1+1_iccv13_part_enumeration.pdf
file_size: 378601
relation: main_file
file_date_updated: 2020-07-14T12:45:36Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Submitted Version
page: 2936 - 2943
publication_status: published
publisher: IEEE
publist_id: '4669'
pubrep_id: '566'
quality_controlled: '1'
scopus_import: 1
status: public
title: Partial enumeration and curvature regularization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2281'
abstract:
- lang: eng
text: We consider two-dimensional Bose-Einstein condensates with attractive interaction,
described by the Gross-Pitaevskii functional. Minimizers of this functional exist
only if the interaction strength a satisfies {Mathematical expression}, where
Q is the unique positive radial solution of {Mathematical expression} in {Mathematical
expression}. We present a detailed analysis of the behavior of minimizers as a
approaches a*, where all the mass concentrates at a global minimum of the trapping
potential.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yujin
full_name: Guo, Yujin
last_name: Guo
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: Guo Y, Seiringer R. On the mass concentration for Bose-Einstein condensates
with attractive interactions. Letters in Mathematical Physics. 2014;104(2):141-156.
doi:10.1007/s11005-013-0667-9
apa: Guo, Y., & Seiringer, R. (2014). On the mass concentration for Bose-Einstein
condensates with attractive interactions. Letters in Mathematical Physics.
Springer. https://doi.org/10.1007/s11005-013-0667-9
chicago: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein
Condensates with Attractive Interactions.” Letters in Mathematical Physics.
Springer, 2014. https://doi.org/10.1007/s11005-013-0667-9.
ieee: Y. Guo and R. Seiringer, “On the mass concentration for Bose-Einstein condensates
with attractive interactions,” Letters in Mathematical Physics, vol. 104,
no. 2. Springer, pp. 141–156, 2014.
ista: Guo Y, Seiringer R. 2014. On the mass concentration for Bose-Einstein condensates
with attractive interactions. Letters in Mathematical Physics. 104(2), 141–156.
mla: Guo, Yujin, and Robert Seiringer. “On the Mass Concentration for Bose-Einstein
Condensates with Attractive Interactions.” Letters in Mathematical Physics,
vol. 104, no. 2, Springer, 2014, pp. 141–56, doi:10.1007/s11005-013-0667-9.
short: Y. Guo, R. Seiringer, Letters in Mathematical Physics 104 (2014) 141–156.
date_created: 2018-12-11T11:56:44Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2024-02-14T12:19:42Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11005-013-0667-9
external_id:
arxiv:
- '1301.5682'
intvolume: ' 104'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1301.5682
month: '02'
oa: 1
oa_version: Preprint
page: 141 - 156
publication: Letters in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4653'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the mass concentration for Bose-Einstein condensates with attractive interactions
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 104
year: '2014'
...
---
_id: '2285'
abstract:
- lang: eng
text: GABAergic inhibitory interneurons control fundamental aspects of neuronal
network function. Their functional roles are assumed to be defined by the identity
of their input synapses, the architecture of their dendritic tree, the passive
and active membrane properties and finally the nature of their postsynaptic targets.
Indeed, interneurons display a high degree of morphological and physiological
heterogeneity. However, whether their morphological and physiological characteristics
are correlated and whether interneuron diversity can be described by a continuum
of GABAergic cell types or by distinct classes has remained unclear. Here we perform
a detailed morphological and physiological characterization of GABAergic cells
in the dentate gyrus, the input region of the hippocampus. To achieve an unbiased
and efficient sampling and classification we used knock-in mice expressing the
enhanced green fluorescent protein (eGFP) in glutamate decarboxylase 67 (GAD67)-positive
neurons and performed cluster analysis. We identified five interneuron classes,
each of them characterized by a distinct set of anatomical and physiological parameters.
Cross-correlation analysis further revealed a direct relation between morphological
and physiological properties indicating that dentate gyrus interneurons fall into
functionally distinct classes which may differentially control neuronal network
activity.
acknowledgement: 'Funded by Deutsche Forschungsgemeinschaft. Grant Numbers: SFB 505,
SFB 780, BA1582/2-1 Excellence Initiative of the German Research Foundation (Spemann
Graduate School). Grant Number: GSC-4 Lichtenberg Professorship-Award (VW-Foundation);
Schram-Foundation; Excellence Initiative Brain Links-Brain Tools. The authors thank
Drs. Jonas-Frederic Sauer and Claudio Elgueta for critically reading the manuscript.
They also thank Karin Winterhalter, Margit Northemann and Ulrich Nöller for technical
assistance.'
author:
- first_name: Jonas
full_name: Hosp, Jonas
last_name: Hosp
- first_name: Michael
full_name: Strüber, Michael
last_name: Strüber
- first_name: Yuchio
full_name: Yanagawa, Yuchio
last_name: Yanagawa
- first_name: Kunihiko
full_name: Obata, Kunihiko
last_name: Obata
- first_name: Imre
full_name: Vida, Imre
last_name: Vida
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Marlene
full_name: Bartos, Marlene
last_name: Bartos
citation:
ama: Hosp J, Strüber M, Yanagawa Y, et al. Morpho-physiological criteria divide
dentate gyrus interneurons into classes. Hippocampus. 2014;23(2):189-203.
doi:10.1002/hipo.22214
apa: Hosp, J., Strüber, M., Yanagawa, Y., Obata, K., Vida, I., Jonas, P. M., &
Bartos, M. (2014). Morpho-physiological criteria divide dentate gyrus interneurons
into classes. Hippocampus. Wiley-Blackwell. https://doi.org/10.1002/hipo.22214
chicago: Hosp, Jonas, Michael Strüber, Yuchio Yanagawa, Kunihiko Obata, Imre Vida,
Peter M Jonas, and Marlene Bartos. “Morpho-Physiological Criteria Divide Dentate
Gyrus Interneurons into Classes.” Hippocampus. Wiley-Blackwell, 2014. https://doi.org/10.1002/hipo.22214.
ieee: J. Hosp et al., “Morpho-physiological criteria divide dentate gyrus
interneurons into classes,” Hippocampus, vol. 23, no. 2. Wiley-Blackwell,
pp. 189–203, 2014.
ista: Hosp J, Strüber M, Yanagawa Y, Obata K, Vida I, Jonas PM, Bartos M. 2014.
Morpho-physiological criteria divide dentate gyrus interneurons into classes.
Hippocampus. 23(2), 189–203.
mla: Hosp, Jonas, et al. “Morpho-Physiological Criteria Divide Dentate Gyrus Interneurons
into Classes.” Hippocampus, vol. 23, no. 2, Wiley-Blackwell, 2014, pp.
189–203, doi:10.1002/hipo.22214.
short: J. Hosp, M. Strüber, Y. Yanagawa, K. Obata, I. Vida, P.M. Jonas, M. Bartos,
Hippocampus 23 (2014) 189–203.
date_created: 2018-12-11T11:56:46Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2021-01-12T06:56:32Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22214
file:
- access_level: open_access
checksum: ff6bc75a79dbc985a2e31b79253e6444
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:54Z
date_updated: 2020-07-14T12:45:37Z
file_id: '5178'
file_name: IST-2016-461-v1+1_Hosp_et_al-2014-Hippocampus.pdf
file_size: 801589
relation: main_file
file_date_updated: 2020-07-14T12:45:37Z
has_accepted_license: '1'
intvolume: ' 23'
issue: '2'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '02'
oa: 1
oa_version: Published Version
page: 189 - 203
publication: Hippocampus
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4646'
pubrep_id: '461'
quality_controlled: '1'
scopus_import: 1
status: public
title: Morpho-physiological criteria divide dentate gyrus interneurons into classes
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2014'
...
---
_id: '2699'
abstract:
- lang: eng
text: "We prove the universality of the β-ensembles with convex analytic potentials
and for any β >\r\n0, i.e. we show that the spacing distributions of log-gases
at any inverse temperature β coincide with those of the Gaussian β-ensembles."
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: Paul
full_name: Bourgade, Paul
last_name: Bourgade
- first_name: Horng
full_name: Yau, Horng
last_name: Yau
citation:
ama: Erdös L, Bourgade P, Yau H. Universality of general β-ensembles. Duke Mathematical
Journal. 2014;163(6):1127-1190. doi:10.1215/00127094-2649752
apa: Erdös, L., Bourgade, P., & Yau, H. (2014). Universality of general β-ensembles.
Duke Mathematical Journal. Duke University Press. https://doi.org/10.1215/00127094-2649752
chicago: Erdös, László, Paul Bourgade, and Horng Yau. “Universality of General β-Ensembles.”
Duke Mathematical Journal. Duke University Press, 2014. https://doi.org/10.1215/00127094-2649752.
ieee: L. Erdös, P. Bourgade, and H. Yau, “Universality of general β-ensembles,”
Duke Mathematical Journal, vol. 163, no. 6. Duke University Press, pp.
1127–1190, 2014.
ista: Erdös L, Bourgade P, Yau H. 2014. Universality of general β-ensembles. Duke
Mathematical Journal. 163(6), 1127–1190.
mla: Erdös, László, et al. “Universality of General β-Ensembles.” Duke Mathematical
Journal, vol. 163, no. 6, Duke University Press, 2014, pp. 1127–90, doi:10.1215/00127094-2649752.
short: L. Erdös, P. Bourgade, H. Yau, Duke Mathematical Journal 163 (2014) 1127–1190.
date_created: 2018-12-11T11:59:08Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2021-01-12T06:59:07Z
day: '01'
department:
- _id: LaEr
doi: 10.1215/00127094-2649752
intvolume: ' 163'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2272
month: '04'
oa: 1
oa_version: Preprint
page: 1127 - 1190
publication: Duke Mathematical Journal
publication_status: published
publisher: Duke University Press
publist_id: '4197'
quality_controlled: '1'
scopus_import: 1
status: public
title: Universality of general β-ensembles
type: journal_article
user_id: 3FFCCD3A-F248-11E8-B48F-1D18A9856A87
volume: 163
year: '2014'
...
---
_id: '2716'
abstract:
- lang: eng
text: Multi-dimensional mean-payoff and energy games provide the mathematical foundation
for the quantitative study of reactive systems, and play a central role in the
emerging quantitative theory of verification and synthesis. In this work, we study
the strategy synthesis problem for games with such multi-dimensional objectives
along with a parity condition, a canonical way to express ω ω -regular conditions.
While in general, the winning strategies in such games may require infinite memory,
for synthesis the most relevant problem is the construction of a finite-memory
winning strategy (if one exists). Our main contributions are as follows. First,
we show a tight exponential bound (matching upper and lower bounds) on the memory
required for finite-memory winning strategies in both multi-dimensional mean-payoff
and energy games along with parity objectives. This significantly improves the
triple exponential upper bound for multi energy games (without parity) that could
be derived from results in literature for games on vector addition systems with
states. Second, we present an optimal symbolic and incremental algorithm to compute
a finite-memory winning strategy (if one exists) in such games. Finally, we give
a complete characterization of when finite memory of strategies can be traded
off for randomness. In particular, we show that for one-dimension mean-payoff
parity games, randomized memoryless strategies are as powerful as their pure finite-memory
counterparts.
acknowledgement: "Krishnendu Chatterjee is supported by Austrian Science Fund (FWF)
Grant No P 23499-N23, FWF NFN Grant No S11407 (RiSE), ERC Starting Grant (279307:
Graph Games) and Microsoft faculty fellowship. Mickael Randour is supported by F.R.S.-FNRS.
fellowship. \r\nJean-François Raskin is supported by ERC Starting Grant (279499:
inVEST).Thanks to D. Sbabo for useful pointers, V. Bruyère for comments on a preliminary
draft, and A. Bohy for fruitful discussions about the Acacia+ tool. We are grateful
to the anonymous reviewers for their insightful comments. "
article_processing_charge: No
article_type: original
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: Mickael
full_name: Randour, Mickael
last_name: Randour
- first_name: Jean
full_name: Raskin, Jean
last_name: Raskin
citation:
ama: Chatterjee K, Randour M, Raskin J. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 2014;51(3-4):129-163. doi:10.1007/s00236-013-0182-6
apa: Chatterjee, K., Randour, M., & Raskin, J. (2014). Strategy synthesis for
multi-dimensional quantitative objectives. Acta Informatica. Springer.
https://doi.org/10.1007/s00236-013-0182-6
chicago: Chatterjee, Krishnendu, Mickael Randour, and Jean Raskin. “Strategy Synthesis
for Multi-Dimensional Quantitative Objectives.” Acta Informatica. Springer,
2014. https://doi.org/10.1007/s00236-013-0182-6.
ieee: K. Chatterjee, M. Randour, and J. Raskin, “Strategy synthesis for multi-dimensional
quantitative objectives,” Acta Informatica, vol. 51, no. 3–4. Springer,
pp. 129–163, 2014.
ista: Chatterjee K, Randour M, Raskin J. 2014. Strategy synthesis for multi-dimensional
quantitative objectives. Acta Informatica. 51(3–4), 129–163.
mla: Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative
Objectives.” Acta Informatica, vol. 51, no. 3–4, Springer, 2014, pp. 129–63,
doi:10.1007/s00236-013-0182-6.
short: K. Chatterjee, M. Randour, J. Raskin, Acta Informatica 51 (2014) 129–163.
date_created: 2018-12-11T11:59:14Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2023-02-21T16:06:56Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/s00236-013-0182-6
external_id:
arxiv:
- '1201.5073'
intvolume: ' 51'
issue: 3-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1201.5073
month: '06'
oa: 1
oa_version: Preprint
page: 129 - 163
project:
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Acta Informatica
publication_status: published
publisher: Springer
publist_id: '4176'
quality_controlled: '1'
related_material:
record:
- id: '10904'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Strategy synthesis for multi-dimensional quantitative objectives
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 51
year: '2014'
...
---
_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
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: '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'
...