---
_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.
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: 2021-01-12T06:55:39Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/2582112.2582169
ec_funded: 1
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: 4435EBFC-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).
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: 2023-09-11T13:38:49Z
day: '01'
department:
- _id: UlWa
doi: 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: 4435EBFC-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).
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: 2021-01-12T06:55:40Z
day: '01'
department:
- _id: MiSi
doi: 10.1016/j.ceb.2014.05.010
external_id:
pmid:
- '24959970'
intvolume: ' 30'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 30
year: '2014'
...
---
_id: '2159'
abstract:
- lang: eng
text: 'Motivated by topological Tverberg-type problems, we consider multiple (double,
triple, and higher multiplicity) selfintersection points of maps from finite simplicial
complexes (compact polyhedra) into ℝd and study conditions under which such multiple
points can be eliminated. The most classical case is that of embeddings (i.e.,
maps without double points) of a κ-dimensional complex K into ℝ2κ. For this problem,
the work of van Kampen, Shapiro, and Wu provides an efficiently testable necessary
condition for embeddability (namely, vanishing of the van Kampen ob-struction).
For κ ≥ 3, the condition is also sufficient, and yields a polynomial-time algorithm
for deciding embeddability: One starts with an arbitrary map f : K→ℝ2κ, which
generically has finitely many double points; if k ≥ 3 and if the obstruction vanishes
then one can successively remove these double points by local modifications of
the map f. One of the main tools is the famous Whitney trick that permits eliminating
pairs of double points of opposite intersection sign. We are interested in generalizing
this approach to intersection points of higher multiplicity. We call a point y
2 ℝd an r-fold Tverberg point of a map f : Kκ →ℝd if y lies in the intersection
f(σ1)∩. ∩f(σr) of the images of r pairwise disjoint simplices of K. The analogue
of (non-)embeddability that we study is the problem Tverbergκ r→d: Given a κ-dimensional
complex K, does it satisfy a Tverberg-type theorem with parameters r and d, i.e.,
does every map f : K κ → ℝd have an r-fold Tverberg point? Here, we show that
for fixed r, κ and d of the form d = rm and k = (r-1)m, m ≥ 3, there is a polynomial-time
algorithm for deciding this (based on the vanishing of a cohomological obstruction,
as in the case of embeddings). Our main tool is an r-fold analogue of the Whitney
trick: Given r pairwise disjoint simplices of K such that the intersection of
their images contains two r-fold Tverberg points y+ and y- of opposite intersection
sign, we can eliminate y+ and y- by a local isotopy of f. In a subsequent paper,
we plan to develop this further and present a generalization of the classical
Haeiger-Weber Theorem (which yields a necessary and sufficient condition for embeddability
of κ-complexes into ℝd for a wider range of dimensions) to intersection points
of higher multiplicity.'
acknowledgement: Swiss National Science Foundation (Project SNSF-PP00P2-138948)
author:
- first_name: Isaac
full_name: Mabillard, Isaac
id: 32BF9DAA-F248-11E8-B48F-1D18A9856A87
last_name: Mabillard
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Mabillard I, Wagner U. Eliminating Tverberg points, I. An analogue of the
Whitney trick. In: Proceedings of the Annual Symposium on Computational Geometry.
ACM; 2014:171-180. doi:10.1145/2582112.2582134'
apa: 'Mabillard, I., & Wagner, U. (2014). Eliminating Tverberg points, I. An
analogue of the Whitney trick. In Proceedings of the Annual Symposium on Computational
Geometry (pp. 171–180). Kyoto, Japan: ACM. https://doi.org/10.1145/2582112.2582134'
chicago: Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue
of the Whitney Trick.” In Proceedings of the Annual Symposium on Computational
Geometry, 171–80. ACM, 2014. https://doi.org/10.1145/2582112.2582134.
ieee: I. Mabillard and U. Wagner, “Eliminating Tverberg points, I. An analogue of
the Whitney trick,” in Proceedings of the Annual Symposium on Computational
Geometry, Kyoto, Japan, 2014, pp. 171–180.
ista: 'Mabillard I, Wagner U. 2014. Eliminating Tverberg points, I. An analogue
of the Whitney trick. Proceedings of the Annual Symposium on Computational Geometry.
SoCG: Symposium on Computational Geometry, 171–180.'
mla: Mabillard, Isaac, and Uli Wagner. “Eliminating Tverberg Points, I. An Analogue
of the Whitney Trick.” Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 171–80, doi:10.1145/2582112.2582134.
short: I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational
Geometry, ACM, 2014, pp. 171–180.
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:03Z
date_published: 2014-06-08T00:00:00Z
date_updated: 2023-09-07T11:56:27Z
day: '08'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.1145/2582112.2582134
file:
- access_level: open_access
checksum: 2aae223fee8ffeaf57bbabd8d92b6a2c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:12Z
date_updated: 2020-07-14T12:45:30Z
file_id: '4735'
file_name: IST-2016-534-v1+1_Eliminating_Tverberg_points_I._An_analogue_of_the_Whitney_trick.pdf
file_size: 914396
relation: main_file
file_date_updated: 2020-07-14T12:45:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 171 - 180
publication: Proceedings of the Annual Symposium on Computational Geometry
publication_status: published
publisher: ACM
publist_id: '4847'
pubrep_id: '534'
quality_controlled: '1'
related_material:
record:
- id: '1123'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Eliminating Tverberg points, I. An analogue of the Whitney trick
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
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
date_created: 2018-12-11T11:56:03Z
date_published: 2014-05-10T00:00:00Z
date_updated: 2023-10-17T11:54:24Z
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'
...
---
_id: '2161'
abstract:
- lang: eng
text: 'Repeated pathogen exposure is a common threat in colonies of social insects,
posing selection pressures on colony members to respond with improved disease-defense
performance. We here tested whether experience gained by repeated tending of low-level
fungus-exposed (Metarhizium robertsii) larvae may alter the performance of sanitary
brood care in the clonal ant, Platythyrea punctata. We trained ants individually
over nine consecutive trials to either sham-treated or fungus-exposed larvae.
We then compared the larval grooming behavior of naive and trained ants and measured
how effectively they removed infectious fungal conidiospores from the fungus-exposed
larvae. We found that the ants changed the duration of larval grooming in response
to both, larval treatment and their level of experience: (1) sham-treated larvae
received longer grooming than the fungus-exposed larvae and (2) trained ants performed
less self-grooming but longer larval grooming than naive ants, which was true
for both, ants trained to fungus-exposed and also to sham-treated larvae. Ants
that groomed the fungus-exposed larvae for longer periods removed a higher number
of fungal conidiospores from the surface of the fungus-exposed larvae. As experienced
ants performed longer larval grooming, they were more effective in fungal removal,
thus making them better caretakers under pathogen attack of the colony. By studying
this clonal ant, we can thus conclude that even in the absence of genetic variation
between colony members, differences in experience levels of brood care may affect
performance of sanitary brood care in social insects.'
acknowledgement: "We thank Katrin Kellner for colony establishment and characterization,
Mike Bidochka for the fungal strain, Meghan Vyleta for fungal strain characterization,
Martina Klatt and Simon Tragust for help in the laboratory, Dimitri Missoh for developing
the software BioLogic, and Mark Brown and Raphaël Jeanson for discussion and help
with data analysis. The study was funded by the European Research Council (ERC Starting
Grant to SC; Marie Curie IEF to LVU) and the German Research Foundation DFG (to
SC and to JH), and CW received funding by the doctoral school Diversité du Vivant
(Cotutelle project to CD and SC).\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Claudia
full_name: Westhus, Claudia
id: ca9c6ca9-e8aa-11ec-a586-b9471ede0494
last_name: Westhus
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Edouard
full_name: Tourdot, Edouard
last_name: Tourdot
- first_name: Jürgen
full_name: Heinze, Jürgen
last_name: Heinze
- first_name: Claudie
full_name: Doums, Claudie
last_name: Doums
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. Increased grooming
after repeated brood care provides sanitary benefits in a clonal ant. Behavioral
Ecology and Sociobiology. 2014;68(10):1701-1710. doi:10.1007/s00265-014-1778-8
apa: Westhus, C., Ugelvig, L. V., Tourdot, E., Heinze, J., Doums, C., & Cremer,
S. (2014). Increased grooming after repeated brood care provides sanitary benefits
in a clonal ant. Behavioral Ecology and Sociobiology. Springer. https://doi.org/10.1007/s00265-014-1778-8
chicago: Westhus, Claudia, Line V Ugelvig, Edouard Tourdot, Jürgen Heinze, Claudie
Doums, and Sylvia Cremer. “Increased Grooming after Repeated Brood Care Provides
Sanitary Benefits in a Clonal Ant.” Behavioral Ecology and Sociobiology.
Springer, 2014. https://doi.org/10.1007/s00265-014-1778-8.
ieee: C. Westhus, L. V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, and S. Cremer,
“Increased grooming after repeated brood care provides sanitary benefits in a
clonal ant,” Behavioral Ecology and Sociobiology, vol. 68, no. 10. Springer,
pp. 1701–1710, 2014.
ista: Westhus C, Ugelvig LV, Tourdot E, Heinze J, Doums C, Cremer S. 2014. Increased
grooming after repeated brood care provides sanitary benefits in a clonal ant.
Behavioral Ecology and Sociobiology. 68(10), 1701–1710.
mla: Westhus, Claudia, et al. “Increased Grooming after Repeated Brood Care Provides
Sanitary Benefits in a Clonal Ant.” Behavioral Ecology and Sociobiology,
vol. 68, no. 10, Springer, 2014, pp. 1701–10, doi:10.1007/s00265-014-1778-8.
short: C. Westhus, L.V. Ugelvig, E. Tourdot, J. Heinze, C. Doums, S. Cremer, Behavioral
Ecology and Sociobiology 68 (2014) 1701–1710.
date_created: 2018-12-11T11:56:03Z
date_published: 2014-07-23T00:00:00Z
date_updated: 2023-02-23T14:06:46Z
day: '23'
department:
- _id: SyCr
doi: 10.1007/s00265-014-1778-8
ec_funded: 1
intvolume: ' 68'
issue: '10'
language:
- iso: eng
month: '07'
oa_version: None
page: 1701 - 1710
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25DC711C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '243071'
name: 'Social Vaccination in Ant Colonies: from Individual Mechanisms to Society
Effects'
- _id: 25DAF0B2-B435-11E9-9278-68D0E5697425
grant_number: CR-118/3-1
name: Host-Parasite Coevolution
publication: Behavioral Ecology and Sociobiology
publication_identifier:
issn:
- 0340-5443
publication_status: published
publisher: Springer
publist_id: '4823'
quality_controlled: '1'
related_material:
record:
- id: '9742'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Increased grooming after repeated brood care provides sanitary benefits in
a clonal ant
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 68
year: '2014'
...
---
_id: '2162'
abstract:
- lang: eng
text: 'We study two-player (zero-sum) concurrent mean-payoff games played on a finite-state
graph. We focus on the important sub-class of ergodic games where all states are
visited infinitely often with probability 1. The algorithmic study of ergodic
games was initiated in a seminal work of Hoffman and Karp in 1966, but all basic
complexity questions have remained unresolved. Our main results for ergodic games
are as follows: We establish (1) an optimal exponential bound on the patience
of stationary strategies (where patience of a distribution is the inverse of the
smallest positive probability and represents a complexity measure of a stationary
strategy); (2) the approximation problem lies in FNP; (3) the approximation problem
is at least as hard as the decision problem for simple stochastic games (for which
NP ∩ coNP is the long-standing best known bound). We present a variant of the
strategy-iteration algorithm by Hoffman and Karp; show that both our algorithm
and the classical value-iteration algorithm can approximate the value in exponential
time; and identify a subclass where the value-iteration algorithm is a FPTAS.
We also show that the exact value can be expressed in the existential theory of
the reals, and establish square-root sum hardness for a related class of games.'
alternative_title:
- LNCS
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: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The complexity of ergodic mean payoff games.
In: Vol 8573. Springer; 2014:122-133. doi:10.1007/978-3-662-43951-7_11'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2014). The complexity of ergodic mean
payoff games (Vol. 8573, pp. 122–133). Presented at the ICST: International Conference
on Software Testing, Verification and Validation, Copenhagen, Denmark: Springer.
https://doi.org/10.1007/978-3-662-43951-7_11'
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Complexity of Ergodic
Mean Payoff Games,” 8573:122–33. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_11.
ieee: 'K. Chatterjee and R. Ibsen-Jensen, “The complexity of ergodic mean payoff
games,” presented at the ICST: International Conference on Software Testing, Verification
and Validation, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp. 122–133.'
ista: 'Chatterjee K, Ibsen-Jensen R. 2014. The complexity of ergodic mean payoff
games. ICST: International Conference on Software Testing, Verification and Validation,
LNCS, vol. 8573, 122–133.'
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. The Complexity of Ergodic
Mean Payoff Games. Vol. 8573, no. Part 2, Springer, 2014, pp. 122–33, doi:10.1007/978-3-662-43951-7_11.
short: K. Chatterjee, R. Ibsen-Jensen, in:, Springer, 2014, pp. 122–133.
conference:
end_date: 2014-07-11
location: Copenhagen, Denmark
name: 'ICST: International Conference on Software Testing, Verification and Validation'
start_date: 2014-07-08
date_created: 2018-12-11T11:56:04Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:24:48Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-43951-7_11
ec_funded: 1
external_id:
arxiv:
- '1404.5734'
intvolume: ' 8573'
issue: Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.5734
month: '01'
oa: 1
oa_version: Preprint
page: 122 - 133
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_status: published
publisher: Springer
publist_id: '4822'
quality_controlled: '1'
related_material:
record:
- id: '5404'
relation: earlier_version
status: public
status: public
title: The complexity of ergodic mean payoff games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8573
year: '2014'
...
---
_id: '2163'
abstract:
- lang: eng
text: We consider multi-player graph games with partial-observation and parity objective.
While the decision problem for three-player games with a coalition of the first
and second players against the third player is undecidable in general, we present
a decidability result for partial-observation games where the first and third
player are in a coalition against the second player, thus where the second player
is adversarial but weaker due to partial-observation. We establish tight complexity
bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness
for parity objectives. The symmetric case of player 1 more informed than player
2 is much more complicated, and we show that already in the case where player
1 has perfect observation, memory of size non-elementary is necessary in general
for reachability objectives, and the problem is decidable for safety and reachability
objectives. From our results we derive new complexity results for partial-observation
stochastic games.
acknowledgement: "This research was partly supported by European project Cassting
(FP7-601148).\r\nTechnical Report under https://research-explorer.app.ist.ac.at/record/5418\r\n"
alternative_title:
- LNCS
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
citation:
ama: 'Chatterjee K, Doyen L. Games with a weak adversary. In: Lecture Notes in
Computer Science. Vol 8573. Springer; 2014:110-121. doi:10.1007/978-3-662-43951-7_10'
apa: 'Chatterjee, K., & Doyen, L. (2014). Games with a weak adversary. In Lecture
Notes in Computer Science (Vol. 8573, pp. 110–121). Copenhagen, Denmark: Springer.
https://doi.org/10.1007/978-3-662-43951-7_10'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.”
In Lecture Notes in Computer Science, 8573:110–21. Springer, 2014. https://doi.org/10.1007/978-3-662-43951-7_10.
ieee: K. Chatterjee and L. Doyen, “Games with a weak adversary,” in Lecture Notes
in Computer Science, Copenhagen, Denmark, 2014, vol. 8573, no. Part 2, pp.
110–121.
ista: 'Chatterjee K, Doyen L. 2014. Games with a weak adversary. Lecture Notes in
Computer Science. ICALP: Automata, Languages and Programming, LNCS, vol. 8573,
110–121.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. “Games with a Weak Adversary.” Lecture
Notes in Computer Science, vol. 8573, no. Part 2, Springer, 2014, pp. 110–21,
doi:10.1007/978-3-662-43951-7_10.
short: K. Chatterjee, L. Doyen, in:, Lecture Notes in Computer Science, Springer,
2014, pp. 110–121.
conference:
end_date: 2014-07-11
location: Copenhagen, Denmark
name: 'ICALP: Automata, Languages and Programming'
start_date: 2014-07-08
date_created: 2018-12-11T11:56:04Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T12:25:29Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-662-43951-7_10
ec_funded: 1
external_id:
arxiv:
- '1404.5453'
intvolume: ' 8573'
issue: Part 2
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1404.5453
month: '01'
oa: 1
oa_version: Preprint
page: 110 - 121
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: Lecture Notes in Computer Science
publication_status: published
publisher: Springer
publist_id: '4821'
quality_controlled: '1'
related_material:
record:
- id: '5418'
relation: earlier_version
status: public
status: public
title: Games with a weak adversary
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8573
year: '2014'
...
---
_id: '2164'
abstract:
- lang: eng
text: 'Neuronal ectopia, such as granule cell dispersion (GCD) in temporal lobe
epilepsy (TLE), has been assumed to result from a migration defect during development.
Indeed, recent studies reported that aberrant migration of neonatal-generated
dentate granule cells (GCs) increased the risk to develop epilepsy later in life.
On the contrary, in the present study, we show that fully differentiated GCs become
motile following the induction of epileptiform activity, resulting in GCD. Hippocampal
slice cultures from transgenic mice expressing green fluorescent protein in differentiated,
but not in newly generated GCs, were incubated with the glutamate receptor agonist
kainate (KA), which induced GC burst activity and GCD. Using real-time microscopy,
we observed that KA-exposed, differentiated GCs translocated their cell bodies
and changed their dendritic organization. As found in human TLE, KA application
was associated with decreased expression of the extracellular matrix protein Reelin,
particularly in hilar interneurons. Together these findings suggest that KA-induced
motility of differentiated GCs contributes to the development of GCD and establish
slice cultures as a model to study neuronal changes induced by epileptiform activity. '
author:
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- first_name: Gert
full_name: Münzner, Gert
last_name: Münzner
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Stefanie
full_name: Tinnes, Stefanie
last_name: Tinnes
- first_name: Janina
full_name: Kowalski, Janina
id: 3F3CA136-F248-11E8-B48F-1D18A9856A87
last_name: Kowalski
- first_name: Ute
full_name: Häussler, Ute
last_name: Häussler
- first_name: Christina
full_name: Young, Christina
last_name: Young
- first_name: Carola
full_name: Haas, Carola
last_name: Haas
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Chai X, Münzner G, Zhao S, et al. Epilepsy-induced motility of differentiated
neurons. Cerebral Cortex. 2014;24(8):2130-2140. doi:10.1093/cercor/bht067
apa: Chai, X., Münzner, G., Zhao, S., Tinnes, S., Kowalski, J., Häussler, U., …
Frotscher, M. (2014). Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. Oxford University Press. https://doi.org/10.1093/cercor/bht067
chicago: Chai, Xuejun, Gert Münzner, Shanting Zhao, Stefanie Tinnes, Janina Kowalski,
Ute Häussler, Christina Young, Carola Haas, and Michael Frotscher. “Epilepsy-Induced
Motility of Differentiated Neurons.” Cerebral Cortex. Oxford University
Press, 2014. https://doi.org/10.1093/cercor/bht067.
ieee: X. Chai et al., “Epilepsy-induced motility of differentiated neurons,”
Cerebral Cortex, vol. 24, no. 8. Oxford University Press, pp. 2130–2140,
2014.
ista: Chai X, Münzner G, Zhao S, Tinnes S, Kowalski J, Häussler U, Young C, Haas
C, Frotscher M. 2014. Epilepsy-induced motility of differentiated neurons. Cerebral
Cortex. 24(8), 2130–2140.
mla: Chai, Xuejun, et al. “Epilepsy-Induced Motility of Differentiated Neurons.”
Cerebral Cortex, vol. 24, no. 8, Oxford University Press, 2014, pp. 2130–40,
doi:10.1093/cercor/bht067.
short: X. Chai, G. Münzner, S. Zhao, S. Tinnes, J. Kowalski, U. Häussler, C. Young,
C. Haas, M. Frotscher, Cerebral Cortex 24 (2014) 2130–2140.
date_created: 2018-12-11T11:56:04Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:43Z
day: '01'
department:
- _id: PeJo
doi: 10.1093/cercor/bht067
intvolume: ' 24'
issue: '8'
language:
- iso: eng
month: '08'
oa_version: None
page: 2130 - 2140
publication: Cerebral Cortex
publication_status: published
publisher: Oxford University Press
publist_id: '4820'
quality_controlled: '1'
scopus_import: 1
status: public
title: Epilepsy-induced motility of differentiated neurons
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 24
year: '2014'
...
---
_id: '2167'
abstract:
- lang: eng
text: Model-based testing is a promising technology for black-box software and hardware
testing, in which test cases are generated automatically from high-level specifications.
Nowadays, systems typically consist of multiple interacting components and, due
to their complexity, testing presents a considerable portion of the effort and
cost in the design process. Exploiting the compositional structure of system specifications
can considerably reduce the effort in model-based testing. Moreover, inferring
properties about the system from testing its individual components allows the
designer to reduce the amount of integration testing. In this paper, we study
compositional properties of the ioco-testing theory. We propose a new approach
to composition and hiding operations, inspired by contract-based design and interface
theories. These operations preserve behaviors that are compatible under composition
and hiding, and prune away incompatible ones. The resulting specification characterizes
the input sequences for which the unit testing of components is sufficient to
infer the correctness of component integration without the need for further tests.
We provide a methodology that uses these results to minimize integration testing
effort, but also to detect potential weaknesses in specifications. While we focus
on asynchronous models and the ioco conformance relation, the resulting methodology
can be applied to a broader class of systems.
article_number: '6823899'
article_processing_charge: No
arxiv: 1
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Willibald
full_name: Krenn, Willibald
last_name: Krenn
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Daca P, Henzinger TA, Krenn W, Nickovic D. Compositional specifications for
IOCO testing. In: IEEE 7th International Conference on Software Testing, Verification
and Validation. IEEE; 2014. doi:10.1109/ICST.2014.50'
apa: 'Daca, P., Henzinger, T. A., Krenn, W., & Nickovic, D. (2014). Compositional
specifications for IOCO testing. In IEEE 7th International Conference on Software
Testing, Verification and Validation. Cleveland, USA: IEEE. https://doi.org/10.1109/ICST.2014.50'
chicago: Daca, Przemyslaw, Thomas A Henzinger, Willibald Krenn, and Dejan Nickovic.
“Compositional Specifications for IOCO Testing.” In IEEE 7th International
Conference on Software Testing, Verification and Validation. IEEE, 2014. https://doi.org/10.1109/ICST.2014.50.
ieee: P. Daca, T. A. Henzinger, W. Krenn, and D. Nickovic, “Compositional specifications
for IOCO testing,” in IEEE 7th International Conference on Software Testing,
Verification and Validation, Cleveland, USA, 2014.
ista: 'Daca P, Henzinger TA, Krenn W, Nickovic D. 2014. Compositional specifications
for IOCO testing. IEEE 7th International Conference on Software Testing, Verification
and Validation. ICST: International Conference on Software Testing, Verification
and Validation, 6823899.'
mla: Daca, Przemyslaw, et al. “Compositional Specifications for IOCO Testing.” IEEE
7th International Conference on Software Testing, Verification and Validation,
6823899, IEEE, 2014, doi:10.1109/ICST.2014.50.
short: P. Daca, T.A. Henzinger, W. Krenn, D. Nickovic, in:, IEEE 7th International
Conference on Software Testing, Verification and Validation, IEEE, 2014.
conference:
end_date: 2014-04-04
location: Cleveland, USA
name: 'ICST: International Conference on Software Testing, Verification and Validation'
start_date: 2014-03-31
date_created: 2018-12-11T11:56:06Z
date_published: 2014-03-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: ToHe
doi: 10.1109/ICST.2014.50
ec_funded: 1
external_id:
arxiv:
- '1904.07083'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1904.07083
month: '03'
oa: 1
oa_version: Preprint
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: IEEE 7th International Conference on Software Testing, Verification and
Validation
publication_identifier:
isbn:
- 978-1-4799-2255-0
issn:
- 2159-4848
publication_status: published
publisher: IEEE
publist_id: '4817'
quality_controlled: '1'
related_material:
record:
- id: '5411'
relation: earlier_version
status: public
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Compositional specifications for IOCO testing
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2168'
abstract:
- lang: eng
text: Many species have an essentially continuous distribution in space, in which
there are no natural divisions between randomly mating subpopulations. Yet, the
standard approach to modelling these populations is to impose an arbitrary grid
of demes, adjusting deme sizes and migration rates in an attempt to capture the
important features of the population. Such indirect methods are required because
of the failure of the classical models of isolation by distance, which have been
shown to have major technical flaws. A recently introduced model of extinction
and recolonisation in two dimensions solves these technical problems, and provides
a rigorous technical foundation for the study of populations evolving in a spatial
continuum. The coalescent process for this model is simply stated, but direct
simulation is very inefficient for large neighbourhood sizes. We present efficient
and exact algorithms to simulate this coalescent process for arbitrary sample
sizes and numbers of loci, and analyse these algorithms in detail.
author:
- first_name: Jerome
full_name: Kelleher, Jerome
last_name: Kelleher
- first_name: Alison
full_name: Etheridge, Alison
last_name: Etheridge
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: 'Kelleher J, Etheridge A, Barton NH. Coalescent simulation in continuous space:
Algorithms for large neighbourhood size. Theoretical Population Biology.
2014;95:13-23. doi:10.1016/j.tpb.2014.05.001'
apa: 'Kelleher, J., Etheridge, A., & Barton, N. H. (2014). Coalescent simulation
in continuous space: Algorithms for large neighbourhood size. Theoretical Population
Biology. Academic Press. https://doi.org/10.1016/j.tpb.2014.05.001'
chicago: 'Kelleher, Jerome, Alison Etheridge, and Nicholas H Barton. “Coalescent
Simulation in Continuous Space: Algorithms for Large Neighbourhood Size.” Theoretical
Population Biology. Academic Press, 2014. https://doi.org/10.1016/j.tpb.2014.05.001.'
ieee: 'J. Kelleher, A. Etheridge, and N. H. Barton, “Coalescent simulation in continuous
space: Algorithms for large neighbourhood size,” Theoretical Population Biology,
vol. 95. Academic Press, pp. 13–23, 2014.'
ista: 'Kelleher J, Etheridge A, Barton NH. 2014. Coalescent simulation in continuous
space: Algorithms for large neighbourhood size. Theoretical Population Biology.
95, 13–23.'
mla: 'Kelleher, Jerome, et al. “Coalescent Simulation in Continuous Space: Algorithms
for Large Neighbourhood Size.” Theoretical Population Biology, vol. 95,
Academic Press, 2014, pp. 13–23, doi:10.1016/j.tpb.2014.05.001.'
short: J. Kelleher, A. Etheridge, N.H. Barton, Theoretical Population Biology 95
(2014) 13–23.
date_created: 2018-12-11T11:56:06Z
date_published: 2014-08-01T00:00:00Z
date_updated: 2021-01-12T06:55:44Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1016/j.tpb.2014.05.001
ec_funded: 1
file:
- access_level: open_access
checksum: 979d7a8034e9df198f068f0d251f31bd
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:49Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4839'
file_name: IST-2015-391-v1+1_1-s2.0-S0040580914000355-main.pdf
file_size: 569005
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 95'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 13 - 23
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Theoretical Population Biology
publication_status: published
publisher: Academic Press
publist_id: '4816'
pubrep_id: '391'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Coalescent simulation in continuous space: Algorithms for large neighbourhood
size'
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 95
year: '2014'
...
---
_id: '2169'
author:
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
citation:
ama: Barton NH, Novak S, Paixao T. Diverse forms of selection in evolution and computer
science. PNAS. 2014;111(29):10398-10399. doi:10.1073/pnas.1410107111
apa: Barton, N. H., Novak, S., & Paixao, T. (2014). Diverse forms of selection
in evolution and computer science. PNAS. National Academy of Sciences.
https://doi.org/10.1073/pnas.1410107111
chicago: Barton, Nicholas H, Sebastian Novak, and Tiago Paixao. “Diverse Forms of
Selection in Evolution and Computer Science.” PNAS. National Academy of
Sciences, 2014. https://doi.org/10.1073/pnas.1410107111.
ieee: N. H. Barton, S. Novak, and T. Paixao, “Diverse forms of selection in evolution
and computer science,” PNAS, vol. 111, no. 29. National Academy of Sciences,
pp. 10398–10399, 2014.
ista: Barton NH, Novak S, Paixao T. 2014. Diverse forms of selection in evolution
and computer science. PNAS. 111(29), 10398–10399.
mla: Barton, Nicholas H., et al. “Diverse Forms of Selection in Evolution and Computer
Science.” PNAS, vol. 111, no. 29, National Academy of Sciences, 2014, pp.
10398–99, doi:10.1073/pnas.1410107111.
short: N.H. Barton, S. Novak, T. Paixao, PNAS 111 (2014) 10398–10399.
date_created: 2018-12-11T11:56:07Z
date_published: 2014-07-22T00:00:00Z
date_updated: 2021-01-12T06:55:45Z
day: '22'
department:
- _id: NiBa
doi: 10.1073/pnas.1410107111
intvolume: ' 111'
issue: '29'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4115508/
month: '07'
oa: 1
oa_version: Submitted Version
page: 10398 - 10399
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '4815'
quality_controlled: '1'
scopus_import: 1
status: public
title: Diverse forms of selection in evolution and computer science
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2014'
...
---
_id: '2170'
abstract:
- lang: eng
text: ' Short-read sequencing technologies have in principle made it feasible to
draw detailed inferences about the recent history of any organism. In practice,
however, this remains challenging due to the difficulty of genome assembly in
most organisms and the lack of statistical methods powerful enough to discriminate
between recent, nonequilibrium histories. We address both the assembly and inference
challenges. We develop a bioinformatic pipeline for generating outgroup-rooted
alignments of orthologous sequence blocks from de novo low-coverage short-read
data for a small number of genomes, and show how such sequence blocks can be used
to fit explicit models of population divergence and admixture in a likelihood
framework. To illustrate our approach, we reconstruct the Pleistocene history
of an oak-feeding insect (the oak gallwasp Biorhiza pallida), which, in common
with many other taxa, was restricted during Pleistocene ice ages to a longitudinal
series of southern refugia spanning the Western Palaearctic. Our analysis of sequence
blocks sampled from a single genome from each of three major glacial refugia reveals
support for an unexpected history dominated by recent admixture. Despite the fact
that 80% of the genome is affected by admixture during the last glacial cycle,
we are able to infer the deeper divergence history of these populations. These
inferences are robust to variation in block length, mutation model and the sampling
location of individual genomes within refugia. This combination of de novo assembly
and numerical likelihood calculation provides a powerful framework for estimating
recent population history that can be applied to any organism without the need
for prior genetic resources.'
acknowledgement: This work was funded by NERC grants to G Stone, J Nicholls, K Lohse
and N Barton (NE/J010499, NBAF375, NE/E014453/1 and NER/B/S2003/00856).
author:
- first_name: Jack
full_name: Hearn, Jack
last_name: Hearn
- first_name: Graham
full_name: Stone, Graham
last_name: Stone
- first_name: Lynsey
full_name: Bunnefeld, Lynsey
last_name: Bunnefeld
- first_name: James
full_name: Nicholls, James
last_name: Nicholls
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Konrad
full_name: Lohse, Konrad
last_name: Lohse
citation:
ama: Hearn J, Stone G, Bunnefeld L, Nicholls J, Barton NH, Lohse K. Likelihood-based
inference of population history from low-coverage de novo genome assemblies. Molecular
Ecology. 2014;23(1):198-211. doi:10.1111/mec.12578
apa: Hearn, J., Stone, G., Bunnefeld, L., Nicholls, J., Barton, N. H., & Lohse,
K. (2014). Likelihood-based inference of population history from low-coverage
de novo genome assemblies. Molecular Ecology. Wiley-Blackwell. https://doi.org/10.1111/mec.12578
chicago: Hearn, Jack, Graham Stone, Lynsey Bunnefeld, James Nicholls, Nicholas H
Barton, and Konrad Lohse. “Likelihood-Based Inference of Population History from
Low-Coverage de Novo Genome Assemblies.” Molecular Ecology. Wiley-Blackwell,
2014. https://doi.org/10.1111/mec.12578.
ieee: J. Hearn, G. Stone, L. Bunnefeld, J. Nicholls, N. H. Barton, and K. Lohse,
“Likelihood-based inference of population history from low-coverage de novo genome
assemblies,” Molecular Ecology, vol. 23, no. 1. Wiley-Blackwell, pp. 198–211,
2014.
ista: Hearn J, Stone G, Bunnefeld L, Nicholls J, Barton NH, Lohse K. 2014. Likelihood-based
inference of population history from low-coverage de novo genome assemblies. Molecular
Ecology. 23(1), 198–211.
mla: Hearn, Jack, et al. “Likelihood-Based Inference of Population History from
Low-Coverage de Novo Genome Assemblies.” Molecular Ecology, vol. 23, no.
1, Wiley-Blackwell, 2014, pp. 198–211, doi:10.1111/mec.12578.
short: J. Hearn, G. Stone, L. Bunnefeld, J. Nicholls, N.H. Barton, K. Lohse, Molecular
Ecology 23 (2014) 198–211.
date_created: 2018-12-11T11:56:07Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2023-02-23T14:07:09Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1111/mec.12578
file:
- access_level: open_access
checksum: 4de1ab255976a8ae77eb0e55ad62ecc9
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:52Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4651'
file_name: IST-2016-559-v1+1_Hearn_et_al.pdf
file_size: 807444
relation: main_file
- access_level: open_access
checksum: 01a8073e071c088500425f910b0f1f71
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:53Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4652'
file_name: IST-2016-559-v1+2_Hearn_et_al_Suppl.pdf
file_size: 1518088
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 23'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 198 - 211
publication: Molecular Ecology
publication_status: published
publisher: Wiley-Blackwell
publist_id: '4814'
pubrep_id: '559'
quality_controlled: '1'
related_material:
record:
- id: '9754'
relation: research_data
status: public
scopus_import: 1
status: public
title: Likelihood-based inference of population history from low-coverage de novo
genome assemblies
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 23
year: '2014'
...
---
_id: '2171'
abstract:
- lang: eng
text: We present LS-CRF, a new method for training cyclic Conditional Random Fields
(CRFs) from large datasets that is inspired by classical closed-form expressions
for the maximum likelihood parameters of a generative graphical model with tree
topology. Training a CRF with LS-CRF requires only solving a set of independent
regression problems, each of which can be solved efficiently in closed form or
by an iterative solver. This makes LS-CRF orders of magnitude faster than classical
CRF training based on probabilistic inference, and at the same time more flexible
and easier to implement than other approximate techniques, such as pseudolikelihood
or piecewise training. We apply LS-CRF to the task of semantic image segmentation,
showing that it achieves on par accuracy to other training techniques at higher
speed, thereby allowing efficient CRF training from very large training sets.
For example, training a linearly parameterized pairwise CRF on 150,000 images
requires less than one hour on a modern workstation.
alternative_title:
- LNCS
author:
- first_name: Alexander
full_name: Kolesnikov, Alexander
id: 2D157DB6-F248-11E8-B48F-1D18A9856A87
last_name: Kolesnikov
- first_name: Matthieu
full_name: Guillaumin, Matthieu
last_name: Guillaumin
- first_name: Vittorio
full_name: Ferrari, Vittorio
last_name: Ferrari
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. Closed-form approximate
CRF training for scalable image segmentation. In: Fleet D, Pajdla T, Schiele B,
Tuytelaars T, eds. Lecture Notes in Computer Science (Including Subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol
8691. Springer; 2014:550-565. doi:10.1007/978-3-319-10578-9_36'
apa: 'Kolesnikov, A., Guillaumin, M., Ferrari, V., & Lampert, C. (2014). Closed-form
approximate CRF training for scalable image segmentation. In D. Fleet, T. Pajdla,
B. Schiele, & T. Tuytelaars (Eds.), Lecture Notes in Computer Science (including
subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
(Vol. 8691, pp. 550–565). Zurich, Switzerland: Springer. https://doi.org/10.1007/978-3-319-10578-9_36'
chicago: Kolesnikov, Alexander, Matthieu Guillaumin, Vittorio Ferrari, and Christoph
Lampert. “Closed-Form Approximate CRF Training for Scalable Image Segmentation.”
In Lecture Notes in Computer Science (Including Subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), edited by David
Fleet, Tomas Pajdla, Bernt Schiele, and Tinne Tuytelaars, 8691:550–65. Springer,
2014. https://doi.org/10.1007/978-3-319-10578-9_36.
ieee: A. Kolesnikov, M. Guillaumin, V. Ferrari, and C. Lampert, “Closed-form approximate
CRF training for scalable image segmentation,” in Lecture Notes in Computer
Science (including subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Zurich, Switzerland, 2014, vol. 8691, no. PART 3,
pp. 550–565.
ista: 'Kolesnikov A, Guillaumin M, Ferrari V, Lampert C. 2014. Closed-form approximate
CRF training for scalable image segmentation. Lecture Notes in Computer Science
(including subseries Lecture Notes in Artificial Intelligence and Lecture Notes
in Bioinformatics). ECCV: European Conference on Computer Vision, LNCS, vol. 8691,
550–565.'
mla: Kolesnikov, Alexander, et al. “Closed-Form Approximate CRF Training for Scalable
Image Segmentation.” Lecture Notes in Computer Science (Including Subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
edited by David Fleet et al., vol. 8691, no. PART 3, Springer, 2014, pp. 550–65,
doi:10.1007/978-3-319-10578-9_36.
short: A. Kolesnikov, M. Guillaumin, V. Ferrari, C. Lampert, in:, D. Fleet, T. Pajdla,
B. Schiele, T. Tuytelaars (Eds.), Lecture Notes in Computer Science (Including
Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
Springer, 2014, pp. 550–565.
conference:
end_date: 2014-09-12
location: Zurich, Switzerland
name: 'ECCV: European Conference on Computer Vision'
start_date: 2014-09-06
date_created: 2018-12-11T11:56:07Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
department:
- _id: ChLa
doi: 10.1007/978-3-319-10578-9_36
ec_funded: 1
editor:
- first_name: David
full_name: Fleet, David
last_name: Fleet
- first_name: Tomas
full_name: Pajdla, Tomas
last_name: Pajdla
- first_name: Bernt
full_name: Schiele, Bernt
last_name: Schiele
- first_name: Tinne
full_name: Tuytelaars, Tinne
last_name: Tuytelaars
intvolume: ' 8691'
issue: PART 3
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1403.7057
month: '09'
oa: 1
oa_version: Submitted Version
page: 550 - 565
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_status: published
publisher: Springer
publist_id: '4813'
quality_controlled: '1'
scopus_import: 1
status: public
title: Closed-form approximate CRF training for scalable image segmentation
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8691
year: '2014'
...
---
_id: '2172'
abstract:
- lang: eng
text: Fisher Kernels and Deep Learning were two developments with significant impact
on large-scale object categorization in the last years. Both approaches were shown
to achieve state-of-the-art results on large-scale object categorization datasets,
such as ImageNet. Conceptually, however, they are perceived as very different
and it is not uncommon for heated debates to spring up when advocates of both
paradigms meet at conferences or workshops. In this work, we emphasize the similarities
between both architectures rather than their differences and we argue that such
a unified view allows us to transfer ideas from one domain to the other. As a
concrete example we introduce a method for learning a support vector machine classifier
with Fisher kernel at the same time as a task-specific data representation. We
reinterpret the setting as a multi-layer feed forward network. Its final layer
is the classifier, parameterized by a weight vector, and the two previous layers
compute Fisher vectors, parameterized by the coefficients of a Gaussian mixture
model. We introduce a gradient descent based learning algorithm that, in contrast
to other feature learning techniques, is not just derived from intuition or biological
analogy, but has a theoretical justification in the framework of statistical learning
theory. Our experiments show that the new training procedure leads to significant
improvements in classification accuracy while preserving the modularity and geometric
interpretability of a support vector machine setup.
author:
- first_name: Vladyslav
full_name: Sydorov, Vladyslav
last_name: Sydorov
- first_name: Mayu
full_name: Sakurada, Mayu
last_name: Sakurada
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Sydorov V, Sakurada M, Lampert C. Deep Fisher Kernels – End to end learning
of the Fisher Kernel GMM parameters. In: Proceedings of the IEEE Computer Society
Conference on Computer Vision and Pattern Recognition. IEEE; 2014:1402-1409.
doi:10.1109/CVPR.2014.182'
apa: 'Sydorov, V., Sakurada, M., & Lampert, C. (2014). Deep Fisher Kernels –
End to end learning of the Fisher Kernel GMM parameters. In Proceedings of
the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
(pp. 1402–1409). Columbus, USA: IEEE. https://doi.org/10.1109/CVPR.2014.182'
chicago: Sydorov, Vladyslav, Mayu Sakurada, and Christoph Lampert. “Deep Fisher
Kernels – End to End Learning of the Fisher Kernel GMM Parameters.” In Proceedings
of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition,
1402–9. IEEE, 2014. https://doi.org/10.1109/CVPR.2014.182.
ieee: V. Sydorov, M. Sakurada, and C. Lampert, “Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters,” in Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, Columbus, USA,
2014, pp. 1402–1409.
ista: 'Sydorov V, Sakurada M, Lampert C. 2014. Deep Fisher Kernels – End to end
learning of the Fisher Kernel GMM parameters. Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition. CVPR: Computer
Vision and Pattern Recognition, 1402–1409.'
mla: Sydorov, Vladyslav, et al. “Deep Fisher Kernels – End to End Learning of the
Fisher Kernel GMM Parameters.” Proceedings of the IEEE Computer Society Conference
on Computer Vision and Pattern Recognition, IEEE, 2014, pp. 1402–09, doi:10.1109/CVPR.2014.182.
short: V. Sydorov, M. Sakurada, C. Lampert, in:, Proceedings of the IEEE Computer
Society Conference on Computer Vision and Pattern Recognition, IEEE, 2014, pp.
1402–1409.
conference:
end_date: 2014-06-28
location: Columbus, USA
name: 'CVPR: Computer Vision and Pattern Recognition'
start_date: 2014-06-23
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-24T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '24'
department:
- _id: ChLa
doi: 10.1109/CVPR.2014.182
ec_funded: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 1402 - 1409
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the IEEE Computer Society Conference on Computer Vision
and Pattern Recognition
publication_status: published
publisher: IEEE
publist_id: '4812'
quality_controlled: '1'
scopus_import: 1
status: public
title: Deep Fisher Kernels – End to end learning of the Fisher Kernel GMM parameters
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2173'
abstract:
- lang: eng
text: "In this work we introduce a new approach to co-classification, i.e. the task
of jointly classifying multiple, otherwise independent, data samples. The method
we present, named CoConut, is based on the idea of adding a regularizer in the
label space to encode certain priors on the resulting labelings. A regularizer
that encourages labelings that are smooth across the test set, for instance, can
be seen as a test-time variant of the cluster assumption, which has been proven
useful at training time in semi-supervised learning. A regularizer that introduces
a preference for certain class proportions can be regarded as a prior distribution
on the class labels. CoConut can build on existing classifiers without making
any assumptions on how they were obtained and without the need to re-train them.
The use of a regularizer adds a new level of flexibility. It allows the integration
of potentially new information at test time, even in other modalities than what
the classifiers were trained on. We evaluate our framework on six datasets, reporting
a clear performance gain in classification accuracy compared to the standard classification
setup that predicts labels for each test sample separately.\r\n"
author:
- first_name: Sameh
full_name: Khamis, Sameh
last_name: Khamis
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Khamis S, Lampert C. CoConut: Co-classification with output space regularization.
In: Proceedings of the British Machine Vision Conference 2014. BMVA Press;
2014.'
apa: 'Khamis, S., & Lampert, C. (2014). CoConut: Co-classification with output
space regularization. In Proceedings of the British Machine Vision Conference
2014. Nottingham, UK: BMVA Press.'
chicago: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with
Output Space Regularization.” In Proceedings of the British Machine Vision
Conference 2014. BMVA Press, 2014.'
ieee: 'S. Khamis and C. Lampert, “CoConut: Co-classification with output space regularization,”
in Proceedings of the British Machine Vision Conference 2014, Nottingham,
UK, 2014.'
ista: 'Khamis S, Lampert C. 2014. CoConut: Co-classification with output space regularization.
Proceedings of the British Machine Vision Conference 2014. BMVC: British Machine
Vision Conference.'
mla: 'Khamis, Sameh, and Christoph Lampert. “CoConut: Co-Classification with Output
Space Regularization.” Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.'
short: S. Khamis, C. Lampert, in:, Proceedings of the British Machine Vision Conference
2014, BMVA Press, 2014.
conference:
end_date: 2014-09-05
location: Nottingham, UK
name: 'BMVC: British Machine Vision Conference'
start_date: 2014-09-01
date_created: 2018-12-11T11:56:08Z
date_published: 2014-09-01T00:00:00Z
date_updated: 2021-01-12T06:55:46Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
ec_funded: 1
file:
- access_level: open_access
checksum: c4c6d3efdb8ee648faf3e76849839ce2
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:23Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4683'
file_name: IST-2016-490-v1+1_khamis-bmvc2014.pdf
file_size: 408172
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 2532554C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '308036'
name: Lifelong Learning of Visual Scene Understanding
publication: Proceedings of the British Machine Vision Conference 2014
publication_status: published
publisher: BMVA Press
publist_id: '4811'
pubrep_id: '490'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'CoConut: Co-classification with output space regularization'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2014'
...
---
_id: '2174'
abstract:
- lang: eng
text: 'When polygenic traits are under stabilizing selection, many different combinations
of alleles allow close adaptation to the optimum. If alleles have equal effects,
all combinations that result in the same deviation from the optimum are equivalent.
Furthermore, the genetic variance that is maintained by mutation-selection balance
is 2μ/S per locus, where μ is the mutation rate and S the strength of stabilizing
selection. In reality, alleles vary in their effects, making the fitness landscape
asymmetric and complicating analysis of the equilibria. We show that that the
resulting genetic variance depends on the fraction of alleles near fixation, which
contribute by 2μ/S, and on the total mutational effects of alleles that are at
intermediate frequency. The inpplayfi between stabilizing selection and mutation
leads to a sharp transition: alleles with effects smaller than a threshold value
of 2 remain polymorphic, whereas those with larger effects are fixed. The genetic
load in equilibrium is less than for traits of equal effects, and the fitness
equilibria are more similar. We find p the optimum is displaced, alleles with
effects close to the threshold value sweep first, and their rate of increase is
bounded by Long-term response leads in general to well-adapted traits, unlike
the case of equal effects that often end up at a suboptimal fitness peak. However,
the particular peaks to which the populations converge are extremely sensitive
to the initial states and to the speed of the shift of the optimum trait value.'
author:
- first_name: Harold
full_name: De Vladar, Harold
last_name: De Vladar
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
citation:
ama: De Vladar H, Barton NH. Stability and response of polygenic traits to stabilizing
selection and mutation. Genetics. 2014;197(2):749-767. doi:10.1534/genetics.113.159111
apa: De Vladar, H., & Barton, N. H. (2014). Stability and response of polygenic
traits to stabilizing selection and mutation. Genetics. Genetics Society
of America. https://doi.org/10.1534/genetics.113.159111
chicago: De Vladar, Harold, and Nicholas H Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics. Genetics Society
of America, 2014. https://doi.org/10.1534/genetics.113.159111.
ieee: H. De Vladar and N. H. Barton, “Stability and response of polygenic traits
to stabilizing selection and mutation,” Genetics, vol. 197, no. 2. Genetics
Society of America, pp. 749–767, 2014.
ista: De Vladar H, Barton NH. 2014. Stability and response of polygenic traits to
stabilizing selection and mutation. Genetics. 197(2), 749–767.
mla: De Vladar, Harold, and Nicholas H. Barton. “Stability and Response of Polygenic
Traits to Stabilizing Selection and Mutation.” Genetics, vol. 197, no.
2, Genetics Society of America, 2014, pp. 749–67, doi:10.1534/genetics.113.159111.
short: H. De Vladar, N.H. Barton, Genetics 197 (2014) 749–767.
date_created: 2018-12-11T11:56:08Z
date_published: 2014-06-01T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '01'
department:
- _id: NiBa
doi: 10.1534/genetics.113.159111
ec_funded: 1
intvolume: ' 197'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1404.1017
month: '06'
oa: 1
oa_version: Submitted Version
page: 749 - 767
project:
- _id: 25B07788-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '250152'
name: Limits to selection in biology and in evolutionary computation
publication: Genetics
publication_status: published
publisher: Genetics Society of America
publist_id: '4809'
quality_controlled: '1'
scopus_import: 1
status: public
title: Stability and response of polygenic traits to stabilizing selection and mutation
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 197
year: '2014'
...
---
_id: '2175'
abstract:
- lang: eng
text: The cerebral cortex, the seat of our cognitive abilities, is composed of an
intricate network of billions of excitatory projection and inhibitory interneurons.
Postmitotic cortical neurons are generated by a diverse set of neural stem cell
progenitors within dedicated zones and defined periods of neurogenesis during
embryonic development. Disruptions in neurogenesis can lead to alterations in
the neuronal cytoarchitecture, which is thought to represent a major underlying
cause for several neurological disorders, including microcephaly, autism and epilepsy.
Although a number of signaling pathways regulating neurogenesis have been described,
the precise cellular and molecular mechanisms regulating the functional neural
stem cell properties in cortical neurogenesis remain unclear. Here, we discuss
the most up-to-date strategies to monitor the fundamental mechanistic parameters
of neuronal progenitor proliferation, and recent advances deciphering the logic
and dynamics of neurogenesis.
article_processing_charge: No
author:
- first_name: Maria P
full_name: Postiglione, Maria P
id: 2C67902A-F248-11E8-B48F-1D18A9856A87
last_name: Postiglione
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
citation:
ama: 'Postiglione MP, Hippenmeyer S. Monitoring neurogenesis in the cerebral cortex:
an update. Future Neurology. 2014;9(3):323-340. doi:10.2217/fnl.14.18'
apa: 'Postiglione, M. P., & Hippenmeyer, S. (2014). Monitoring neurogenesis
in the cerebral cortex: an update. Future Neurology. Future Science Group.
https://doi.org/10.2217/fnl.14.18'
chicago: 'Postiglione, Maria P, and Simon Hippenmeyer. “Monitoring Neurogenesis
in the Cerebral Cortex: An Update.” Future Neurology. Future Science Group,
2014. https://doi.org/10.2217/fnl.14.18.'
ieee: 'M. P. Postiglione and S. Hippenmeyer, “Monitoring neurogenesis in the cerebral
cortex: an update,” Future Neurology, vol. 9, no. 3. Future Science Group,
pp. 323–340, 2014.'
ista: 'Postiglione MP, Hippenmeyer S. 2014. Monitoring neurogenesis in the cerebral
cortex: an update. Future Neurology. 9(3), 323–340.'
mla: 'Postiglione, Maria P., and Simon Hippenmeyer. “Monitoring Neurogenesis in
the Cerebral Cortex: An Update.” Future Neurology, vol. 9, no. 3, Future
Science Group, 2014, pp. 323–40, doi:10.2217/fnl.14.18.'
short: M.P. Postiglione, S. Hippenmeyer, Future Neurology 9 (2014) 323–340.
date_created: 2018-12-11T11:56:09Z
date_published: 2014-05-01T00:00:00Z
date_updated: 2023-10-17T08:34:27Z
day: '01'
ddc:
- '570'
department:
- _id: SiHi
doi: 10.2217/fnl.14.18
ec_funded: 1
file:
- access_level: open_access
checksum: ba06659ecadabceec9a37dd8c4586dce
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:25Z
date_updated: 2020-07-14T12:45:31Z
file_id: '4812'
file_name: IST-2016-528-v1+1_fnl.14.18.pdf
file_size: 3848424
relation: main_file
file_date_updated: 2020-07-14T12:45:31Z
has_accepted_license: '1'
intvolume: ' 9'
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 323 - 340
project:
- _id: 25D61E48-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '618444'
name: Molecular Mechanisms of Cerebral Cortex Development
publication: Future Neurology
publication_identifier:
eissn:
- 1748-6971
issn:
- 1479-6708
publication_status: published
publisher: Future Science Group
publist_id: '4806'
pubrep_id: '528'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Monitoring neurogenesis in the cerebral cortex: an update'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '2176'
abstract:
- lang: eng
text: Electron microscopy (EM) allows for the simultaneous visualization of all
tissue components at high resolution. However, the extent to which conventional
aldehyde fixation and ethanol dehydration of the tissue alter the fine structure
of cells and organelles, thereby preventing detection of subtle structural changes
induced by an experiment, has remained an issue. Attempts have been made to rapidly
freeze tissue to preserve native ultrastructure. Shock-freezing of living tissue
under high pressure (high-pressure freezing, HPF) followed by cryosubstitution
of the tissue water avoids aldehyde fixation and dehydration in ethanol; the tissue
water is immobilized in â ̂1/450 ms, and a close-to-native fine structure of cells,
organelles and molecules is preserved. Here we describe a protocol for HPF that
is useful to monitor ultrastructural changes associated with functional changes
at synapses in the brain but can be applied to many other tissues as well. The
procedure requires a high-pressure freezer and takes a minimum of 7 d but can
be paused at several points.
author:
- first_name: Daniel
full_name: Studer, Daniel
last_name: Studer
- first_name: Shanting
full_name: Zhao, Shanting
last_name: Zhao
- first_name: Xuejun
full_name: Chai, Xuejun
last_name: Chai
- 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: Werner
full_name: Graber, Werner
last_name: Graber
- first_name: Sigrun
full_name: Nestel, Sigrun
last_name: Nestel
- first_name: Michael
full_name: Frotscher, Michael
last_name: Frotscher
citation:
ama: Studer D, Zhao S, Chai X, et al. Capture of activity-induced ultrastructural
changes at synapses by high-pressure freezing of brain tissue. Nature Protocols.
2014;9(6):1480-1495. doi:10.1038/nprot.2014.099
apa: Studer, D., Zhao, S., Chai, X., Jonas, P. M., Graber, W., Nestel, S., &
Frotscher, M. (2014). Capture of activity-induced ultrastructural changes at synapses
by high-pressure freezing of brain tissue. Nature Protocols. Nature Publishing
Group. https://doi.org/10.1038/nprot.2014.099
chicago: Studer, Daniel, Shanting Zhao, Xuejun Chai, Peter M Jonas, Werner Graber,
Sigrun Nestel, and Michael Frotscher. “Capture of Activity-Induced Ultrastructural
Changes at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols.
Nature Publishing Group, 2014. https://doi.org/10.1038/nprot.2014.099.
ieee: D. Studer et al., “Capture of activity-induced ultrastructural changes
at synapses by high-pressure freezing of brain tissue,” Nature Protocols,
vol. 9, no. 6. Nature Publishing Group, pp. 1480–1495, 2014.
ista: Studer D, Zhao S, Chai X, Jonas PM, Graber W, Nestel S, Frotscher M. 2014.
Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue. Nature Protocols. 9(6), 1480–1495.
mla: Studer, Daniel, et al. “Capture of Activity-Induced Ultrastructural Changes
at Synapses by High-Pressure Freezing of Brain Tissue.” Nature Protocols,
vol. 9, no. 6, Nature Publishing Group, 2014, pp. 1480–95, doi:10.1038/nprot.2014.099.
short: D. Studer, S. Zhao, X. Chai, P.M. Jonas, W. Graber, S. Nestel, M. Frotscher,
Nature Protocols 9 (2014) 1480–1495.
date_created: 2018-12-11T11:56:09Z
date_published: 2014-05-29T00:00:00Z
date_updated: 2021-01-12T06:55:47Z
day: '29'
department:
- _id: PeJo
doi: 10.1038/nprot.2014.099
intvolume: ' 9'
issue: '6'
language:
- iso: eng
month: '05'
oa_version: None
page: 1480 - 1495
project:
- _id: 25BDE9A4-B435-11E9-9278-68D0E5697425
grant_number: SFB-TR3-TP10B
name: Glutamaterge synaptische Übertragung und Plastizität in hippocampalen Mikroschaltkreisen
publication: Nature Protocols
publication_status: published
publisher: Nature Publishing Group
publist_id: '4807'
quality_controlled: '1'
scopus_import: 1
status: public
title: Capture of activity-induced ultrastructural changes at synapses by high-pressure
freezing of brain tissue
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2014'
...
---
_id: '2177'
abstract:
- lang: eng
text: We give evidence for the difficulty of computing Betti numbers of simplicial
complexes over a finite field. We do this by reducing the rank computation for
sparse matrices with to non-zero entries to computing Betti numbers of simplicial
complexes consisting of at most a constant times to simplices. Together with the
known reduction in the other direction, this implies that the two problems have
the same computational complexity.
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Salman
full_name: Parsa, Salman
id: 4BDBD4F2-F248-11E8-B48F-1D18A9856A87
last_name: Parsa
citation:
ama: 'Edelsbrunner H, Parsa S. On the computational complexity of betti numbers
reductions from matrix rank. In: Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms. SIAM; 2014:152-160. doi:10.1137/1.9781611973402.11'
apa: 'Edelsbrunner, H., & Parsa, S. (2014). On the computational complexity
of betti numbers reductions from matrix rank. In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms (pp. 152–160). Portland, USA: SIAM.
https://doi.org/10.1137/1.9781611973402.11'
chicago: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity
of Betti Numbers Reductions from Matrix Rank.” In Proceedings of the Annual
ACM-SIAM Symposium on Discrete Algorithms, 152–60. SIAM, 2014. https://doi.org/10.1137/1.9781611973402.11.
ieee: H. Edelsbrunner and S. Parsa, “On the computational complexity of betti numbers
reductions from matrix rank,” in Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, Portland, USA, 2014, pp. 152–160.
ista: 'Edelsbrunner H, Parsa S. 2014. On the computational complexity of betti numbers
reductions from matrix rank. Proceedings of the Annual ACM-SIAM Symposium on Discrete
Algorithms. SODA: Symposium on Discrete Algorithms, 152–160.'
mla: Edelsbrunner, Herbert, and Salman Parsa. “On the Computational Complexity of
Betti Numbers Reductions from Matrix Rank.” Proceedings of the Annual ACM-SIAM
Symposium on Discrete Algorithms, SIAM, 2014, pp. 152–60, doi:10.1137/1.9781611973402.11.
short: H. Edelsbrunner, S. Parsa, in:, Proceedings of the Annual ACM-SIAM Symposium
on Discrete Algorithms, SIAM, 2014, pp. 152–160.
conference:
end_date: 2014-01-07
location: Portland, USA
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2014-01-05
date_created: 2018-12-11T11:56:09Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:55:48Z
day: '01'
department:
- _id: HeEd
doi: 10.1137/1.9781611973402.11
language:
- iso: eng
month: '01'
oa_version: None
page: 152 - 160
publication: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
publication_status: published
publisher: SIAM
publist_id: '4805'
quality_controlled: '1'
scopus_import: 1
status: public
title: On the computational complexity of betti numbers reductions from matrix rank
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2014'
...