---
_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.
article_processing_charge: No
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.
corr_author: '1'
date_created: 2018-12-11T11:56:35Z
date_published: 2014-01-08T00:00:00Z
date_updated: 2026-04-16T10:08:53Z
day: '08'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2013.09.046
ec_funded: 1
external_id:
isi:
- '000329559000015'
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
fulldoi: https://doi.org/10.1016/j.neuron.2013.09.046
has_accepted_license: '1'
intvolume: ' 81'
isi: 1
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:
- 0896-6273
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: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 81
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: 'This 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
article_processing_charge: No
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).
corr_author: '1'
date_created: 2018-12-11T11:56:36Z
date_published: 2014-01-02T00:00:00Z
date_updated: 2025-09-29T11:14:06Z
day: '02'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1003408
external_id:
isi:
- '000337948500010'
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
fulldoi: https://doi.org/10.1371/journal.pcbi.1003408
has_accepted_license: '1'
intvolume: ' 10'
isi: 1
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
publication: PLoS Computational Biology
publication_identifier:
issn:
- 1553-734X
publication_status: published
publisher: Public Library of Science
publist_id: '4689'
pubrep_id: '436'
quality_controlled: '1'
related_material:
record:
- id: '5562'
relation: research_data
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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
article_processing_charge: No
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: 2025-09-29T11:13:18Z
day: '05'
ddc:
- '571'
- '610'
department:
- _id: SiHi
doi: 10.1093/nar/gkt1290
external_id:
isi:
- '000333093600005'
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
fulldoi: https://doi.org/10.1093/nar/gkt1290
has_accepted_license: '1'
intvolume: ' 42'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 42
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"
article_processing_charge: No
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: 2025-09-29T14:28:16Z
day: '03'
ddc:
- '000'
department:
- _id: VlKo
doi: 10.1109/ICCV.2013.365
external_id:
isi:
- '000351830500367'
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
fulldoi: https://doi.org/10.1109/ICCV.2013.365
has_accepted_license: '1'
isi: 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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.
corr_author: '1'
date_created: 2018-12-11T11:56:44Z
date_published: 2014-02-01T00:00:00Z
date_updated: 2025-09-29T11:12:19Z
day: '01'
department:
- _id: RoSe
doi: 10.1007/s11005-013-0667-9
external_id:
arxiv:
- '1301.5682'
isi:
- '000330128000002'
fulldoi: https://doi.org/10.1007/s11005-013-0667-9
intvolume: ' 104'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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.'
article_processing_charge: No
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: 2025-09-29T11:11:47Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1002/hipo.22214
external_id:
isi:
- '000329879300006'
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
fulldoi: https://doi.org/10.1002/hipo.22214
has_accepted_license: '1'
intvolume: ' 23'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
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."
article_processing_charge: No
arxiv: 1
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: 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: 2025-09-29T11:11:17Z
day: '01'
department:
- _id: LaEr
doi: 10.1215/00127094-2649752
external_id:
arxiv:
- '1104.2272'
isi:
- '000334478100003'
fulldoi: https://doi.org/10.1215/00127094-2649752
intvolume: ' 163'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 163
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.
article_processing_charge: No
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: 2025-09-29T11:09:56Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/s00145-013-9148-7
external_id:
isi:
- '000336370500001'
fulldoi: https://doi.org/10.1007/s00145-013-9148-7
intvolume: ' 27'
isi: 1
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2014'
...
---
_id: '2082'
abstract:
- lang: eng
text: 'NMAC is a mode of operation which turns a fixed input-length keyed hash function
f into a variable input-length function. A practical single-key variant of NMAC
called HMAC is a very popular and widely deployed message authentication code
(MAC). Security proofs and attacks for NMAC can typically be lifted to HMAC. NMAC
was introduced by Bellare, Canetti and Krawczyk [Crypto''96], who proved it to
be a secure pseudorandom function (PRF), and thus also a MAC, assuming that (1)
f is a PRF and (2) the function we get when cascading f is weakly collision-resistant.
Unfortunately, HMAC is typically instantiated with cryptographic hash functions
like MD5 or SHA-1 for which (2) has been found to be wrong. To restore the provable
guarantees for NMAC, Bellare [Crypto''06] showed its security based solely on
the assumption that f is a PRF, albeit via a non-uniform reduction. - Our first
contribution is a simpler and uniform proof for this fact: If f is an ε-secure
PRF (against q queries) and a δ-non-adaptively secure PRF (against q queries),
then NMAC f is an (ε+ℓqδ)-secure PRF against q queries of length at most ℓ blocks
each. - We then show that this ε+ℓqδ bound is basically tight. For the most interesting
case where ℓqδ ≥ ε we prove this by constructing an f for which an attack with
advantage ℓqδ exists. This also violates the bound O(ℓε) on the PRF-security of
NMAC recently claimed by Koblitz and Menezes. - Finally, we analyze the PRF-security
of a modification of NMAC called NI [An and Bellare, Crypto''99] that differs
mainly by using a compression function with an additional keying input. This avoids
the constant rekeying on multi-block messages in NMAC and allows for a security
proof starting by the standard switch from a PRF to a random function, followed
by an information-theoretic analysis. We carry out such an analysis, obtaining
a tight ℓq2/2 c bound for this step, improving over the trivial bound of ℓ2q2/2c.
The proof borrows combinatorial techniques originally developed for proving the
security of CBC-MAC [Bellare et al., Crypto''05].'
alternative_title:
- LNCS
author:
- first_name: Peter
full_name: Gazi, Peter
id: 3E0BFE38-F248-11E8-B48F-1D18A9856A87
last_name: Gazi
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Michal
full_name: Rybar, Michal
id: 2B3E3DE8-F248-11E8-B48F-1D18A9856A87
last_name: Rybar
citation:
ama: 'Gazi P, Pietrzak KZ, Rybar M. The exact PRF-security of NMAC and HMAC. In:
Garay J, Gennaro R, eds. Vol 8616. Springer; 2014:113-130. doi:10.1007/978-3-662-44371-2_7'
apa: 'Gazi, P., Pietrzak, K. Z., & Rybar, M. (2014). The exact PRF-security
of NMAC and HMAC. In J. Garay & R. Gennaro (Eds.) (Vol. 8616, pp. 113–130).
Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA:
Springer. https://doi.org/10.1007/978-3-662-44371-2_7'
chicago: Gazi, Peter, Krzysztof Z Pietrzak, and Michal Rybar. “The Exact PRF-Security
of NMAC and HMAC.” edited by Juan Garay and Rosario Gennaro, 8616:113–30. Springer,
2014. https://doi.org/10.1007/978-3-662-44371-2_7.
ieee: 'P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact PRF-security of NMAC and
HMAC,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara,
USA, 2014, vol. 8616, no. 1, pp. 113–130.'
ista: 'Gazi P, Pietrzak KZ, Rybar M. 2014. The exact PRF-security of NMAC and HMAC.
CRYPTO: International Cryptology Conference, LNCS, vol. 8616, 113–130.'
mla: Gazi, Peter, et al. The Exact PRF-Security of NMAC and HMAC. Edited
by Juan Garay and Rosario Gennaro, vol. 8616, no. 1, Springer, 2014, pp. 113–30,
doi:10.1007/978-3-662-44371-2_7.
short: P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer,
2014, pp. 113–130.
conference:
end_date: 2014-08-21
location: Santa Barbara, USA
name: 'CRYPTO: International Cryptology Conference'
start_date: 2014-08-17
corr_author: '1'
date_created: 2018-12-11T11:55:36Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2026-04-08T14:18:39Z
day: '01'
ddc:
- '000'
- '004'
department:
- _id: KrPi
doi: 10.1007/978-3-662-44371-2_7
ec_funded: 1
editor:
- first_name: Juan
full_name: Garay, Juan
last_name: Garay
- first_name: Rosario
full_name: Gennaro, Rosario
last_name: Gennaro
file:
- access_level: open_access
checksum: dab6ab36a5f6af94f2b597e6404ed11d
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:17Z
date_updated: 2020-07-14T12:45:28Z
file_id: '4999'
file_name: IST-2016-682-v1+1_578.pdf
file_size: 492310
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
fulldoi: https://doi.org/10.1007/978-3-662-44371-2_7
has_accepted_license: '1'
intvolume: ' 8616'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 113 - 130
project:
- _id: 258C570E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '259668'
name: Provable Security for Physical Cryptography
publication_status: published
publisher: Springer
publist_id: '4955'
pubrep_id: '682'
quality_controlled: '1'
related_material:
record:
- id: '838'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: The exact PRF-security of NMAC and HMAC
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8616
year: '2014'
...
---
_id: '2083'
abstract:
- lang: eng
text: Understanding the effects of sex and migration on adaptation to novel environments
remains a key problem in evolutionary biology. Using a single-cell alga Chlamydomonas
reinhardtii, we investigated how sex and migration affected rates of evolutionary
rescue in a sink environment, and subsequent changes in fitness following evolutionary
rescue. We show that sex and migration affect both the rate of evolutionary rescue
and subsequent adaptation. However, their combined effects change as the populations
adapt to a sink habitat. Both sex and migration independently increased rates
of evolutionary rescue, but the effect of sex on subsequent fitness improvements,
following initial rescue, changed with migration, as sex was beneficial in the
absence of migration but constraining adaptation when combined with migration.
These results suggest that sex and migration are beneficial during the initial
stages of adaptation, but can become detrimental as the population adapts to its
environment.
acknowledgement: The authors are grateful to the Leverhulme Trust (F/00 215/AW) for
funding this work.
article_processing_charge: No
article_type: original
author:
- first_name: Mato
full_name: Lagator, Mato
id: 345D25EC-F248-11E8-B48F-1D18A9856A87
last_name: Lagator
- first_name: Andrew
full_name: Morgan, Andrew
last_name: Morgan
- first_name: Paul
full_name: Neve, Paul
last_name: Neve
- first_name: Nick
full_name: Colegrave, Nick
last_name: Colegrave
citation:
ama: Lagator M, Morgan A, Neve P, Colegrave N. Role of sex and migration in adaptation
to sink environments. Evolution. 2014;68(8):2296-2305. doi:10.1111/evo.12440
apa: Lagator, M., Morgan, A., Neve, P., & Colegrave, N. (2014). Role of sex
and migration in adaptation to sink environments. Evolution. Wiley. https://doi.org/10.1111/evo.12440
chicago: Lagator, Mato, Andrew Morgan, Paul Neve, and Nick Colegrave. “Role of Sex
and Migration in Adaptation to Sink Environments.” Evolution. Wiley, 2014.
https://doi.org/10.1111/evo.12440.
ieee: M. Lagator, A. Morgan, P. Neve, and N. Colegrave, “Role of sex and migration
in adaptation to sink environments,” Evolution, vol. 68, no. 8. Wiley,
pp. 2296–2305, 2014.
ista: Lagator M, Morgan A, Neve P, Colegrave N. 2014. Role of sex and migration
in adaptation to sink environments. Evolution. 68(8), 2296–2305.
mla: Lagator, Mato, et al. “Role of Sex and Migration in Adaptation to Sink Environments.”
Evolution, vol. 68, no. 8, Wiley, 2014, pp. 2296–305, doi:10.1111/evo.12440.
short: M. Lagator, A. Morgan, P. Neve, N. Colegrave, Evolution 68 (2014) 2296–2305.
corr_author: '1'
date_created: 2018-12-11T11:55:36Z
date_published: 2014-04-25T00:00:00Z
date_updated: 2025-09-29T11:46:47Z
day: '25'
ddc:
- '570'
department:
- _id: CaGu
doi: 10.1111/evo.12440
external_id:
isi:
- '000340470600012'
file:
- access_level: open_access
checksum: 8d459b07e4a11bb5fde92d969184fe48
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T16:40:31Z
date_updated: 2020-07-14T12:45:28Z
file_id: '7845'
file_name: 2014_Evolution_Lagator.pdf
file_size: 467254
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
fulldoi: https://doi.org/10.1111/evo.12440
has_accepted_license: '1'
intvolume: ' 68'
isi: 1
issue: '8'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 2296 - 2305
publication: Evolution
publication_status: published
publisher: Wiley
publist_id: '4954'
quality_controlled: '1'
related_material:
record:
- id: '9747'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Role of sex and migration in adaptation to sink environments
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 68
year: '2014'
...
---
_id: '2084'
abstract:
- lang: eng
text: Receptor tyrosine kinases (RTKs) are a large family of cell surface receptors
that sense growth factors and hormones and regulate a variety of cell behaviours
in health and disease. Contactless activation of RTKs with spatial and temporal
precision is currently not feasible. Here, we generated RTKs that are insensitive
to endogenous ligands but can be selectively activated by low-intensity blue light.
We screened light-oxygen-voltage (LOV)-sensing domains for their ability to activate
RTKs by light-activated dimerization. Incorporation of LOV domains found in aureochrome
photoreceptors of stramenopiles resulted in robust activation of the fibroblast
growth factor receptor 1 (FGFR1), epidermal growth factor receptor (EGFR) and
rearranged during transfection (RET). In human cancer and endothelial cells, light
induced cellular signalling with spatial and temporal precision. Furthermore,
light faithfully mimicked complex mitogenic and morphogenic cell behaviour induced
by growth factors. RTKs under optical control (Opto-RTKs) provide a powerful optogenetic
approach to actuate cellular signals and manipulate cell behaviour.
acknowledgement: European Union Seventh Framework Programme; Human Frontier Science
Program; Oesterreichische Nationalbank Anniversary Fund 14211; Austrian Research
Promotion Agency; FemTech
article_processing_charge: No
author:
- first_name: Michael
full_name: Grusch, Michael
last_name: Grusch
- first_name: Karin
full_name: Schelch, Karin
last_name: Schelch
- first_name: Robert
full_name: Riedler, Robert
last_name: Riedler
- first_name: Eva
full_name: Gschaider-Reichhart, Eva
id: 3FEE232A-F248-11E8-B48F-1D18A9856A87
last_name: Gschaider-Reichhart
orcid: 0000-0002-7218-7738
- first_name: Christopher
full_name: Differ, Christopher
last_name: Differ
- first_name: Walter
full_name: Berger, Walter
last_name: Berger
- first_name: Álvaro
full_name: Inglés Prieto, Álvaro
id: 2A9DB292-F248-11E8-B48F-1D18A9856A87
last_name: Inglés Prieto
orcid: 0000-0002-5409-8571
- first_name: Harald L
full_name: Janovjak, Harald L
id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
last_name: Janovjak
orcid: 0000-0002-8023-9315
citation:
ama: Grusch M, Schelch K, Riedler R, et al. Spatio-temporally precise activation
of engineered receptor tyrosine kinases by light. EMBO Journal. 2014;33(15):1713-1726.
doi:10.15252/embj.201387695
apa: Grusch, M., Schelch, K., Riedler, R., Gschaider-Reichhart, E., Differ, C.,
Berger, W., … Janovjak, H. L. (2014). Spatio-temporally precise activation of
engineered receptor tyrosine kinases by light. EMBO Journal. Wiley-Blackwell.
https://doi.org/10.15252/embj.201387695
chicago: Grusch, Michael, Karin Schelch, Robert Riedler, Eva Gschaider-Reichhart,
Christopher Differ, Walter Berger, Álvaro Inglés Prieto, and Harald L Janovjak.
“Spatio-Temporally Precise Activation of Engineered Receptor Tyrosine Kinases
by Light.” EMBO Journal. Wiley-Blackwell, 2014. https://doi.org/10.15252/embj.201387695.
ieee: M. Grusch et al., “Spatio-temporally precise activation of engineered
receptor tyrosine kinases by light,” EMBO Journal, vol. 33, no. 15. Wiley-Blackwell,
pp. 1713–1726, 2014.
ista: Grusch M, Schelch K, Riedler R, Gschaider-Reichhart E, Differ C, Berger W,
Inglés Prieto Á, Janovjak HL. 2014. Spatio-temporally precise activation of engineered
receptor tyrosine kinases by light. EMBO Journal. 33(15), 1713–1726.
mla: Grusch, Michael, et al. “Spatio-Temporally Precise Activation of Engineered
Receptor Tyrosine Kinases by Light.” EMBO Journal, vol. 33, no. 15, Wiley-Blackwell,
2014, pp. 1713–26, doi:10.15252/embj.201387695.
short: M. Grusch, K. Schelch, R. Riedler, E. Gschaider-Reichhart, C. Differ, W.
Berger, Á. Inglés Prieto, H.L. Janovjak, EMBO Journal 33 (2014) 1713–1726.
corr_author: '1'
date_created: 2018-12-11T11:55:37Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2026-04-08T14:11:53Z
day: '01'
department:
- _id: HaJa
doi: 10.15252/embj.201387695
external_id:
isi:
- '000339917000011'
fulldoi: https://doi.org/10.15252/embj.201387695
intvolume: ' 33'
isi: 1
issue: '15'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4194103/
month: '07'
oa: 1
oa_version: Submitted Version
page: 1713 - 1726
publication: EMBO Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4953'
quality_controlled: '1'
related_material:
record:
- id: '418'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Spatio-temporally precise activation of engineered receptor tyrosine kinases
by light
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 33
year: '2014'
...
---
_id: '2086'
abstract:
- lang: eng
text: Pathogens may gain a fitness advantage through manipulation of the behaviour
of their hosts. Likewise, host behavioural changes can be a defence mechanism,
counteracting the impact of pathogens on host fitness. We apply harmonic radar
technology to characterize the impact of an emerging pathogen - Nosema ceranae
(Microsporidia) - on honeybee (Apis mellifera) flight and orientation performance
in the field. Honeybees are the most important commercial pollinators. Emerging
diseases have been proposed to play a prominent role in colony decline, partly
through sub-lethal behavioural manipulation of their hosts. We found that homing
success was significantly reduced in diseased (65.8%) versus healthy foragers
(92.5%). Although lost bees had significantly reduced continuous flight times
and prolonged resting times, other flight characteristics and navigational abilities
showed no significant difference between infected and non-infected bees. Our results
suggest that infected bees express normal flight characteristics but are constrained
in their homing ability, potentially compromising the colony by reducing its resource
inputs, but also counteracting the intra-colony spread of infection. We provide
the first high-resolution analysis of sub-lethal effects of an emerging disease
on insect flight behaviour. The potential causes and the implications for both
host and parasite are discussed.
acknowledgement: This study was funded jointly by a grant from BBSRC, Defra, NERC,
the Scottish Government and the Wellcome Trust, under the Insect Pollinators Initiative
(grant numbers BB/I00097/1 and BB/I000100/1). Rothamsted Research is a national
institute of bioscience strategically funded by the UK Biotechnology and Biological
Sciences Research Council (BBSRC).
article_number: e103989
article_processing_charge: No
author:
- first_name: Stephan
full_name: Wolf, Stephan
last_name: Wolf
- first_name: Dino
full_name: Mcmahon, Dino
last_name: Mcmahon
- first_name: Ka
full_name: Lim, Ka
last_name: Lim
- first_name: Christopher
full_name: Pull, Christopher
id: 3C7F4840-F248-11E8-B48F-1D18A9856A87
last_name: Pull
orcid: 0000-0003-1122-3982
- first_name: Suzanne
full_name: Clark, Suzanne
last_name: Clark
- first_name: Robert
full_name: Paxton, Robert
last_name: Paxton
- first_name: Juliet
full_name: Osborne, Juliet
last_name: Osborne
citation:
ama: 'Wolf S, Mcmahon D, Lim K, et al. So near and yet so far: Harmonic radar reveals
reduced homing ability of Nosema infected honeybees. PLoS One. 2014;9(8).
doi:10.1371/journal.pone.0103989'
apa: 'Wolf, S., Mcmahon, D., Lim, K., Pull, C., Clark, S., Paxton, R., & Osborne,
J. (2014). So near and yet so far: Harmonic radar reveals reduced homing ability
of Nosema infected honeybees. PLoS One. Public Library of Science. https://doi.org/10.1371/journal.pone.0103989'
chicago: 'Wolf, Stephan, Dino Mcmahon, Ka Lim, Christopher Pull, Suzanne Clark,
Robert Paxton, and Juliet Osborne. “So near and yet so Far: Harmonic Radar Reveals
Reduced Homing Ability of Nosema Infected Honeybees.” PLoS One. Public
Library of Science, 2014. https://doi.org/10.1371/journal.pone.0103989.'
ieee: 'S. Wolf et al., “So near and yet so far: Harmonic radar reveals reduced
homing ability of Nosema infected honeybees,” PLoS One, vol. 9, no. 8.
Public Library of Science, 2014.'
ista: 'Wolf S, Mcmahon D, Lim K, Pull C, Clark S, Paxton R, Osborne J. 2014. So
near and yet so far: Harmonic radar reveals reduced homing ability of Nosema infected
honeybees. PLoS One. 9(8), e103989.'
mla: 'Wolf, Stephan, et al. “So near and yet so Far: Harmonic Radar Reveals Reduced
Homing Ability of Nosema Infected Honeybees.” PLoS One, vol. 9, no. 8,
e103989, Public Library of Science, 2014, doi:10.1371/journal.pone.0103989.'
short: S. Wolf, D. Mcmahon, K. Lim, C. Pull, S. Clark, R. Paxton, J. Osborne, PLoS
One 9 (2014).
date_created: 2018-12-11T11:55:37Z
date_published: 2014-08-06T00:00:00Z
date_updated: 2025-09-29T11:45:41Z
day: '06'
ddc:
- '570'
department:
- _id: SyCr
doi: 10.1371/journal.pone.0103989
external_id:
isi:
- '000339995100042'
file:
- access_level: open_access
checksum: 2fc62c6739eada4bddf026afbae669db
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:13:55Z
date_updated: 2020-07-14T12:45:28Z
file_id: '5042'
file_name: IST-2016-437-v1+1_journal.pone.0103989.pdf
file_size: 1013386
relation: main_file
file_date_updated: 2020-07-14T12:45:28Z
fulldoi: https://doi.org/10.1371/journal.pone.0103989
has_accepted_license: '1'
intvolume: ' 9'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: PLoS One
publication_status: published
publisher: Public Library of Science
publist_id: '4949'
pubrep_id: '437'
quality_controlled: '1'
related_material:
record:
- id: '9888'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'So near and yet so far: Harmonic radar reveals reduced homing ability of Nosema
infected honeybees'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9
year: '2014'
...
---
_id: '2141'
abstract:
- lang: eng
text: The computation of the winning set for Büchi objectives in alternating games
on graphs is a central problem in computer-aided verification with a large number
of applications. The long-standing best known upper bound for solving the problem
is Õ(n ⋅ m), where n is the number of vertices and m is the number of edges in
the graph. We are the first to break the Õ(n ⋅ m) boundary by presenting a new
technique that reduces the running time to O(n2). This bound also leads to O(n2)-time
algorithms for computing the set of almost-sure winning vertices for Büchi objectives
(1) in alternating games with probabilistic transitions (improving an earlier
bound of Õ(n ⋅ m)), (2) in concurrent graph games with constant actions (improving
an earlier bound of O(n3)), and (3) in Markov decision processes (improving for
m>n4/3 an earlier bound of O(m ⋅ √m)). We then show how to maintain the winning
set for Büchi objectives in alternating games under a sequence of edge insertions
or a sequence of edge deletions in O(n) amortized time per operation. Our algorithms
are the first dynamic algorithms for this problem. We then consider another core
graph theoretic problem in verification of probabilistic systems, namely computing
the maximal end-component decomposition of a graph. We present two improved static
algorithms for the maximal end-component decomposition problem. Our first algorithm
is an O(m ⋅ √m)-time algorithm, and our second algorithm is an O(n2)-time algorithm
which is obtained using the same technique as for alternating Büchi games. Thus,
we obtain an O(min &lcu;m ⋅ √m,n2})-time algorithm improving the long-standing
O(n ⋅ m) time bound. Finally, we show how to maintain the maximal end-component
decomposition of a graph under a sequence of edge insertions or a sequence of
edge deletions in O(n) amortized time per edge deletion, and O(m) worst-case time
per edge insertion. Again, our algorithms are the first dynamic algorithms for
this problem.
article_number: a15
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Chatterjee K, Henzinger M. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM.
2014;61(3). doi:10.1145/2597631
apa: Chatterjee, K., & Henzinger, M. (2014). Efficient and dynamic algorithms
for alternating Büchi games and maximal end-component decomposition. Journal
of the ACM. ACM. https://doi.org/10.1145/2597631
chicago: Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms
for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal
of the ACM. ACM, 2014. https://doi.org/10.1145/2597631.
ieee: K. Chatterjee and M. Henzinger, “Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition,” Journal of the ACM,
vol. 61, no. 3. ACM, 2014.
ista: Chatterjee K, Henzinger M. 2014. Efficient and dynamic algorithms for alternating
Büchi games and maximal end-component decomposition. Journal of the ACM. 61(3),
a15.
mla: Chatterjee, Krishnendu, and Monika Henzinger. “Efficient and Dynamic Algorithms
for Alternating Büchi Games and Maximal End-Component Decomposition.” Journal
of the ACM, vol. 61, no. 3, a15, ACM, 2014, doi:10.1145/2597631.
short: K. Chatterjee, M. Henzinger, Journal of the ACM 61 (2014).
date_created: 2018-12-11T11:55:57Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2025-09-29T11:45:13Z
day: '01'
department:
- _id: KrCh
doi: 10.1145/2597631
ec_funded: 1
external_id:
isi:
- '000337201400001'
fulldoi: https://doi.org/10.1145/2597631
intvolume: ' 61'
isi: 1
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/3933/
month: '05'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Journal of the ACM
publication_status: published
publisher: ACM
publist_id: '4883'
quality_controlled: '1'
related_material:
record:
- id: '3165'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Efficient and dynamic algorithms for alternating Büchi games and maximal end-component
decomposition
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 61
year: '2014'
...
---
_id: '2153'
abstract:
- lang: eng
text: 'We define a simple, explicit map sending a morphism f : M → N of pointwise
finite dimensional persistence modules to a matching between the barcodes of M
and N. Our main result is that, in a precise sense, the quality of this matching
is tightly controlled by the lengths of the longest intervals in the barcodes
of ker f and coker f . As an immediate corollary, we obtain a new proof of the
algebraic stability theorem for persistence barcodes [5, 9], a fundamental result
in the theory of persistent homology. In contrast to previous proofs, ours shows
explicitly how a δ-interleaving morphism between two persistence modules induces
a δ-matching between the barcodes of the two modules. Our main result also specializes
to a structure theorem for submodules and quotients of persistence modules. Copyright
is held by the owner/author(s).'
article_processing_charge: No
arxiv: 1
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: Lesnick, Michael
last_name: Lesnick
citation:
ama: 'Bauer U, Lesnick M. Induced matchings of barcodes and the algebraic stability
of persistence. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:355-364. doi:10.1145/2582112.2582168'
apa: 'Bauer, U., & Lesnick, M. (2014). Induced matchings of barcodes and the
algebraic stability of persistence. In Proceedings of the Annual Symposium
on Computational Geometry (pp. 355–364). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582168'
chicago: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and
the Algebraic Stability of Persistence.” In Proceedings of the Annual Symposium
on Computational Geometry, 355–64. ACM, 2014. https://doi.org/10.1145/2582112.2582168.
ieee: U. Bauer and M. Lesnick, “Induced matchings of barcodes and the algebraic
stability of persistence,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 355–364.
ista: 'Bauer U, Lesnick M. 2014. Induced matchings of barcodes and the algebraic
stability of persistence. Proceedings of the Annual Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, 355–364.'
mla: Bauer, Ulrich, and Michael Lesnick. “Induced Matchings of Barcodes and the
Algebraic Stability of Persistence.” Proceedings of the Annual Symposium on
Computational Geometry, ACM, 2014, pp. 355–64, doi:10.1145/2582112.2582168.
short: U. Bauer, M. Lesnick, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 355–364.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:57:54Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582168
ec_funded: 1
external_id:
arxiv:
- '1311.3681'
fulldoi: https://doi.org/10.1145/2582112.2582168
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1311.3681
month: '06'
oa: 1
oa_version: Submitted Version
page: 355 - 364
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4853'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Induced matchings of barcodes and the algebraic stability of persistence
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2154'
abstract:
- lang: eng
text: A result of Boros and Füredi (d = 2) and of Bárány (arbitrary d) asserts that
for every d there exists cd > 0 such that for every n-point set P ⊂ ℝd, some
point of ℝd is covered by at least (Formula presented.) of the d-simplices spanned
by the points of P. The largest possible value of cd has been the subject of ongoing
research. Recently Gromov improved the existing lower bounds considerably by introducing
a new, topological proof method. We provide an exposition of the combinatorial
component of Gromov's approach, in terms accessible to combinatorialists and discrete
geometers, and we investigate the limits of his method. In particular, we give
tighter bounds on the cofilling profiles for the (n - 1)-simplex. These bounds
yield a minor improvement over Gromov's lower bounds on cd for large d, but they
also show that the room for further improvement through the cofilling profiles
alone is quite small. We also prove a slightly better lower bound for c3 by an
approach using an additional structure besides the cofilling profiles. We formulate
a combinatorial extremal problem whose solution might perhaps lead to a tight
lower bound for cd.
acknowledgement: Swiss National Science Foundation (SNF 200021-125309, 200020-138230,
200020-12507)
article_processing_charge: No
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Matoušek J, Wagner U. On Gromov’s method of selecting heavily covered points.
Discrete & Computational Geometry. 2014;52(1):1-33. doi:10.1007/s00454-014-9584-7
apa: Matoušek, J., & Wagner, U. (2014). On Gromov’s method of selecting heavily
covered points. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9584-7
chicago: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily
Covered Points.” Discrete & Computational Geometry. Springer, 2014.
https://doi.org/10.1007/s00454-014-9584-7.
ieee: J. Matoušek and U. Wagner, “On Gromov’s method of selecting heavily covered
points,” Discrete & Computational Geometry, vol. 52, no. 1. Springer,
pp. 1–33, 2014.
ista: Matoušek J, Wagner U. 2014. On Gromov’s method of selecting heavily covered
points. Discrete & Computational Geometry. 52(1), 1–33.
mla: Matoušek, Jiří, and Uli Wagner. “On Gromov’s Method of Selecting Heavily Covered
Points.” Discrete & Computational Geometry, vol. 52, no. 1, Springer,
2014, pp. 1–33, doi:10.1007/s00454-014-9584-7.
short: J. Matoušek, U. Wagner, Discrete & Computational Geometry 52 (2014) 1–33.
date_created: 2018-12-11T11:56:01Z
date_published: 2014-07-01T00:00:00Z
date_updated: 2025-09-29T11:44:29Z
day: '01'
department:
- _id: UlWa
doi: 10.1007/s00454-014-9584-7
external_id:
arxiv:
- '1102.3515'
isi:
- '000339382600001'
fulldoi: https://doi.org/10.1007/s00454-014-9584-7
intvolume: ' 52'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1102.3515
month: '07'
oa: 1
oa_version: Submitted Version
page: 1 - 33
project:
- _id: 25FA3206-B435-11E9-9278-68D0E5697425
grant_number: PP00P2_138948
name: 'Embeddings in Higher Dimensions: Algorithms and Combinatorics'
publication: Discrete & Computational Geometry
publication_status: published
publisher: Springer
publist_id: '4852'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On Gromov's method of selecting heavily covered points
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 52
year: '2014'
...
---
_id: '2155'
abstract:
- lang: eng
text: Given a finite set of points in Rn and a positive radius, we study the Čech,
Delaunay-Čech, alpha, and wrap complexes as instances of a generalized discrete
Morse theory. We prove that the latter three complexes are simple-homotopy equivalent.
Our results have applications in topological data analysis and in the reconstruction
of shapes from sampled data. Copyright is held by the owner/author(s).
acknowledgement: This research is partially supported by ESF under the ACAT Research
Network Programme, and by the Russian Government under mega project 11.G34.31.0053
article_processing_charge: No
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Bauer U, Edelsbrunner H. The morse theory of Čech and Delaunay filtrations.
In: Proceedings of the Annual Symposium on Computational Geometry. ACM;
2014:484-490. doi:10.1145/2582112.2582167'
apa: 'Bauer, U., & Edelsbrunner, H. (2014). The morse theory of Čech and Delaunay
filtrations. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 484–490). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582167'
chicago: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and
Delaunay Filtrations.” In Proceedings of the Annual Symposium on Computational
Geometry, 484–90. ACM, 2014. https://doi.org/10.1145/2582112.2582167.
ieee: U. Bauer and H. Edelsbrunner, “The morse theory of Čech and Delaunay filtrations,”
in Proceedings of the Annual Symposium on Computational Geometry, Kyoto,
Japan, 2014, pp. 484–490.
ista: 'Bauer U, Edelsbrunner H. 2014. The morse theory of Čech and Delaunay filtrations.
Proceedings of the Annual Symposium on Computational Geometry. SoCG: Symposium
on Computational Geometry, 484–490.'
mla: Bauer, Ulrich, and Herbert Edelsbrunner. “The Morse Theory of Čech and Delaunay
Filtrations.” Proceedings of the Annual Symposium on Computational Geometry,
ACM, 2014, pp. 484–90, doi:10.1145/2582112.2582167.
short: U. Bauer, H. Edelsbrunner, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 484–490.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
corr_author: '1'
date_created: 2018-12-11T11:56:01Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:58:27Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582167
ec_funded: 1
external_id:
arxiv:
- '1312.1231'
fulldoi: https://doi.org/10.1145/2582112.2582167
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1312.1231
month: '06'
oa: 1
oa_version: Submitted Version
page: 484 - 490
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4851'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The morse theory of Čech and Delaunay filtrations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2156'
abstract:
- lang: eng
text: We propose a metric for Reeb graphs, called the functional distortion distance.
Under this distance, the Reeb graph is stable against small changes of input functions.
At the same time, it remains discriminative at differentiating input functions.
In particular, the main result is that the functional distortion distance between
two Reeb graphs is bounded from below by the bottleneck distance between both
the ordinary and extended persistence diagrams for appropriate dimensions. As
an application of our results, we analyze a natural simplification scheme for
Reeb graphs, and show that persistent features in Reeb graph remains persistent
under simplification. Understanding the stability of important features of the
Reeb graph under simplification is an interesting problem on its own right, and
critical to the practical usage of Reeb graphs. Copyright is held by the owner/author(s).
acknowledgement: National Science Foundation under grants CCF-1319406, CCF-1116258.
article_processing_charge: No
arxiv: 1
author:
- first_name: Ulrich
full_name: Bauer, Ulrich
id: 2ADD483A-F248-11E8-B48F-1D18A9856A87
last_name: Bauer
orcid: 0000-0002-9683-0724
- first_name: Xiaoyin
full_name: Ge, Xiaoyin
last_name: Ge
- first_name: Yusu
full_name: Wang, Yusu
last_name: Wang
citation:
ama: 'Bauer U, Ge X, Wang Y. Measuring distance between Reeb graphs. In: Proceedings
of the Annual Symposium on Computational Geometry. ACM; 2014:464-473. doi:10.1145/2582112.2582169'
apa: 'Bauer, U., Ge, X., & Wang, Y. (2014). Measuring distance between Reeb
graphs. In Proceedings of the Annual Symposium on Computational Geometry
(pp. 464–473). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582169'
chicago: Bauer, Ulrich, Xiaoyin Ge, and Yusu Wang. “Measuring Distance between Reeb
Graphs.” In Proceedings of the Annual Symposium on Computational Geometry,
464–73. ACM, 2014. https://doi.org/10.1145/2582112.2582169.
ieee: U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in
Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan,
2014, pp. 464–473.
ista: 'Bauer U, Ge X, Wang Y. 2014. Measuring distance between Reeb graphs. Proceedings
of the Annual Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, 464–473.'
mla: Bauer, Ulrich, et al. “Measuring Distance between Reeb Graphs.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 464–73,
doi:10.1145/2582112.2582169.
short: U. Bauer, X. Ge, Y. Wang, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 464–473.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:58:42Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582169
ec_funded: 1
external_id:
arxiv:
- '1307.2839'
fulldoi: https://doi.org/10.1145/2582112.2582169
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1307.2839
month: '06'
oa: 1
oa_version: Submitted Version
page: 464 - 473
project:
- _id: 255D761E-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '318493'
name: Topological Complex Systems
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4850'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Measuring distance between Reeb graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2157'
abstract:
- lang: eng
text: 'We show that the following algorithmic problem is decidable: given a 2-dimensional
simplicial complex, can it be embedded (topologically, or equivalently, piecewise
linearly) in ℝ3? By a known reduction, it suffices to decide the embeddability
of a given triangulated 3-manifold X into the 3-sphere S3. The main step, which
allows us to simplify X and recurse, is in proving that if X can be embedded in
S3, then there is also an embedding in which X has a short meridian, i.e., an
essential curve in the boundary of X bounding a disk in S3 nX with length bounded
by a computable function of the number of tetrahedra of X.'
acknowledgement: ERC Advanced Grant No. 267165; Grant GRADR Eurogiga GIG/11/E023 (SNSF-PP00P2-138948);
Swiss National Science Foundation (SNSF-200020-138230).
article_processing_charge: No
arxiv: 1
author:
- first_name: Jiří
full_name: Matoušek, Jiří
last_name: Matoušek
- first_name: Eric
full_name: Sedgwick, Eric
last_name: Sedgwick
- first_name: Martin
full_name: Tancer, Martin
id: 38AC689C-F248-11E8-B48F-1D18A9856A87
last_name: Tancer
orcid: 0000-0002-1191-6714
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Matoušek J, Sedgwick E, Tancer M, Wagner U. Embeddability in the 3 sphere
is decidable. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:78-84. doi:10.1145/2582112.2582137'
apa: 'Matoušek, J., Sedgwick, E., Tancer, M., & Wagner, U. (2014). Embeddability
in the 3 sphere is decidable. In Proceedings of the Annual Symposium on Computational
Geometry (pp. 78–84). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582137'
chicago: Matoušek, Jiří, Eric Sedgwick, Martin Tancer, and Uli Wagner. “Embeddability
in the 3 Sphere Is Decidable.” In Proceedings of the Annual Symposium on Computational
Geometry, 78–84. ACM, 2014. https://doi.org/10.1145/2582112.2582137.
ieee: J. Matoušek, E. Sedgwick, M. Tancer, and U. Wagner, “Embeddability in the
3 sphere is decidable,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 78–84.
ista: 'Matoušek J, Sedgwick E, Tancer M, Wagner U. 2014. Embeddability in the 3
sphere is decidable. Proceedings of the Annual Symposium on Computational Geometry.
SoCG: Symposium on Computational Geometry, 78–84.'
mla: Matoušek, Jiří, et al. “Embeddability in the 3 Sphere Is Decidable.” Proceedings
of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84, doi:10.1145/2582112.2582137.
short: J. Matoušek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual
Symposium on Computational Geometry, ACM, 2014, pp. 78–84.
conference:
end_date: 2014-06-11
location: Kyoto, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2014-06-08
date_created: 2018-12-11T11:56:02Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2025-06-11T07:59:02Z
day: '01'
department:
- _id: UlWa
doi: 10.1145/2582112.2582137
external_id:
arxiv:
- '1402.0815'
fulldoi: https://doi.org/10.1145/2582112.2582137
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1402.0815
month: '06'
oa: 1
oa_version: Submitted Version
page: 78 - 84
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4849'
quality_controlled: '1'
related_material:
record:
- id: '425'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Embeddability in the 3 sphere is decidable
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2158'
abstract:
- lang: eng
text: Directional guidance of migrating cells is relatively well explored in the
reductionist setting of cell culture experiments. Here spatial gradients of chemical
cues as well as gradients of mechanical substrate characteristics prove sufficient
to attract single cells as well as their collectives. How such gradients present
and act in the context of an organism is far less clear. Here we review recent
advances in understanding how guidance cues emerge and operate in the physiological
context.
acknowledgement: This effort was supported by the Intramural Research Program of the
Center for Cancer Research, NCI, National Institutes of Health and the European
Research Council (ERC).
article_processing_charge: No
author:
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
- first_name: Carole
full_name: Parent, Carole
last_name: Parent
citation:
ama: Majumdar R, Sixt MK, Parent C. New paradigms in the establishment and maintenance
of gradients during directed cell migration. Current Opinion in Cell Biology.
2014;30(1):33-40. doi:10.1016/j.ceb.2014.05.010
apa: Majumdar, R., Sixt, M. K., & Parent, C. (2014). New paradigms in the establishment
and maintenance of gradients during directed cell migration. Current Opinion
in Cell Biology. Elsevier. https://doi.org/10.1016/j.ceb.2014.05.010
chicago: Majumdar, Ritankar, Michael K Sixt, and Carole Parent. “New Paradigms in
the Establishment and Maintenance of Gradients during Directed Cell Migration.”
Current Opinion in Cell Biology. Elsevier, 2014. https://doi.org/10.1016/j.ceb.2014.05.010.
ieee: R. Majumdar, M. K. Sixt, and C. Parent, “New paradigms in the establishment
and maintenance of gradients during directed cell migration,” Current Opinion
in Cell Biology, vol. 30, no. 1. Elsevier, pp. 33–40, 2014.
ista: Majumdar R, Sixt MK, Parent C. 2014. New paradigms in the establishment and
maintenance of gradients during directed cell migration. Current Opinion in Cell
Biology. 30(1), 33–40.
mla: Majumdar, Ritankar, et al. “New Paradigms in the Establishment and Maintenance
of Gradients during Directed Cell Migration.” Current Opinion in Cell Biology,
vol. 30, no. 1, Elsevier, 2014, pp. 33–40, doi:10.1016/j.ceb.2014.05.010.
short: R. Majumdar, M.K. Sixt, C. Parent, Current Opinion in Cell Biology 30 (2014)
33–40.
date_created: 2018-12-11T11:56:03Z
date_published: 2014-10-01T00:00:00Z
date_updated: 2025-09-29T11:43:11Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2014.05.010
external_id:
isi:
- '000343620300006'
pmid:
- '24959970'
fulldoi: https://doi.org/10.1016/j.ceb.2014.05.010
intvolume: ' 30'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4177954/
month: '10'
oa: 1
oa_version: Submitted Version
page: 33 - 40
pmid: 1
publication: Current Opinion in Cell Biology
publication_status: published
publisher: Elsevier
publist_id: '4848'
quality_controlled: '1'
scopus_import: '1'
status: public
title: New paradigms in the establishment and maintenance of gradients during directed
cell migration
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 30
year: '2014'
...
---
_id: '2160'
abstract:
- lang: eng
text: Transfer learning has received a lot of attention in the machine learning
community over the last years, and several effective algorithms have been developed.
However, relatively little is known about their theoretical properties, especially
in the setting of lifelong learning, where the goal is to transfer information
to tasks for which no data have been observed so far. In this work we study lifelong
learning from a theoretical perspective. Our main result is a PAC-Bayesian generalization
bound that offers a unified view on existing paradigms for transfer learning,
such as the transfer of parameters or the transfer of low-dimensional representations.
We also use the bound to derive two principled lifelong learning algorithms, and
we show that these yield results comparable with existing methods.
article_processing_charge: No
author:
- first_name: Anastasia
full_name: Pentina, Anastasia
id: 42E87FC6-F248-11E8-B48F-1D18A9856A87
last_name: Pentina
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Pentina A, Lampert C. A PAC-Bayesian bound for Lifelong Learning. In: Vol
32. ML Research Press; 2014:991-999.'
apa: 'Pentina, A., & Lampert, C. (2014). A PAC-Bayesian bound for Lifelong Learning
(Vol. 32, pp. 991–999). Presented at the ICML: International Conference on Machine
Learning, Beijing, China: ML Research Press.'
chicago: Pentina, Anastasia, and Christoph Lampert. “A PAC-Bayesian Bound for Lifelong
Learning,” 32:991–99. ML Research Press, 2014.
ieee: 'A. Pentina and C. Lampert, “A PAC-Bayesian bound for Lifelong Learning,”
presented at the ICML: International Conference on Machine Learning, Beijing,
China, 2014, vol. 32, pp. 991–999.'
ista: 'Pentina A, Lampert C. 2014. A PAC-Bayesian bound for Lifelong Learning. ICML:
International Conference on Machine Learning vol. 32, 991–999.'
mla: Pentina, Anastasia, and Christoph Lampert. A PAC-Bayesian Bound for Lifelong
Learning. Vol. 32, ML Research Press, 2014, pp. 991–99.
short: A. Pentina, C. Lampert, in:, ML Research Press, 2014, pp. 991–999.
conference:
end_date: 2014-06-26
location: Beijing, China
name: 'ICML: International Conference on Machine Learning'
start_date: 2014-06-21
corr_author: '1'
date_created: 2018-12-11T11:56:03Z
date_published: 2014-05-10T00:00:00Z
date_updated: 2024-10-09T20:55:36Z
day: '10'
department:
- _id: ChLa
intvolume: ' 32'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://dl.acm.org/citation.cfm?id=3045003
month: '05'
oa: 1
oa_version: Submitted Version
page: 991 - 999
publication_status: published
publisher: ML Research Press
publist_id: '4844'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A PAC-Bayesian bound for Lifelong Learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2014'
...