--- _id: '2140' abstract: - lang: eng text: We propose a technique for engineering momentum-dependent dissipation in Bose-Einstein condensates with non-local interactions. The scheme relies on the use of momentum-dependent dark-states in close analogy to velocity-selective coherent population trapping. During the short-time dissipative dynamics, the system is driven into a particular finite-momentum phonon mode, which in real space corresponds to an ordered structure with non-local density-density correlations. Dissipation-induced ordering can be observed and studied in present-day experiments using cold atoms with dipole-dipole or off-resonant Rydberg interactions. Due to its dissipative nature, the ordering does not require artificial breaking of translational symmetry by an opticallattice or harmonic trap. This opens up a perspective of direct cooling of quantum gases into strongly-interacting phases. acknowledgement: This work was supported by NSF through a grant for the Institute for Theoretical Atomic, Molecular, and Optical Physics at Harvard University and Smithsonian Astrophysical Observatory as well as the Harvard Quantum Optics Center. article_number: '070401' author: - first_name: Johannes full_name: Otterbach, Johannes last_name: Otterbach - first_name: Mikhail full_name: Lemeshko, Mikhail id: 37CB05FA-F248-11E8-B48F-1D18A9856A87 last_name: Lemeshko orcid: 0000-0002-6990-7802 citation: ama: Otterbach J, Lemeshko M. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 2014;113(7). doi:10.1103/PhysRevLett.113.070401 apa: Otterbach, J., & Lemeshko, M. (2014). Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. American Physical Society. https://doi.org/10.1103/PhysRevLett.113.070401 chicago: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters. American Physical Society, 2014. https://doi.org/10.1103/PhysRevLett.113.070401. ieee: J. Otterbach and M. Lemeshko, “Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates,” Physical Review Letters, vol. 113, no. 7. American Physical Society, 2014. ista: Otterbach J, Lemeshko M. 2014. Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates. Physical Review Letters. 113(7), 070401. mla: Otterbach, Johannes, and Mikhail Lemeshko. “Dissipative Preparation of Spatial Order in Rydberg-Dressed Bose-Einstein Condensates.” Physical Review Letters, vol. 113, no. 7, 070401, American Physical Society, 2014, doi:10.1103/PhysRevLett.113.070401. short: J. Otterbach, M. Lemeshko, Physical Review Letters 113 (2014). date_created: 2018-12-11T11:55:56Z date_published: 2014-08-11T00:00:00Z date_updated: 2021-01-12T06:55:33Z day: '11' doi: 10.1103/PhysRevLett.113.070401 extern: '1' intvolume: ' 113' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1308.5905 month: '08' oa: 1 oa_version: Submitted Version publication: Physical Review Letters publication_status: published publisher: American Physical Society publist_id: '4884' status: public title: Dissipative preparation of spatial order in Rydberg-dressed Bose-Einstein condensates type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 113 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).' 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: 2021-01-12T06:55:38Z day: '01' department: - _id: HeEd doi: 10.1145/2582112.2582168 ec_funded: 1 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: 4435EBFC-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) 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: 2021-01-12T06:55:38Z day: '01' department: - _id: UlWa doi: 10.1007/s00454-014-9584-7 intvolume: ' 52' 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: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 52 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. 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: '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 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 date_created: 2018-12-11T11:56:01Z date_published: 2014-06-01T00:00:00Z date_updated: 2021-01-12T06:55:38Z day: '01' department: - _id: HeEd doi: 10.1145/2582112.2582167 ec_funded: 1 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: 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: '2165' abstract: - lang: eng text: 'In machine learning, the domain adaptation problem arrives when the test (tar-get) and the train (source) data are generated from different distributions. A key applied issue is thus the design of algorithms able to generalize on a new distribution, for which we have no label information. We focus on learning classification models defined as a weighted majority vote over a set of real-valued functions. In this context, Germain et al. (2013) have shown that a measure of disagreement between these functions is crucial to control. The core of this measure is a theoretical bound—the C-bound (Lacasse et al., 2007)—which involves the disagreement and leads to a well performing majority vote learn-ing algorithm in usual non-adaptative supervised setting: MinCq. In this work,we propose a framework to extend MinCq to a domain adaptation scenario.This procedure takes advantage of the recent perturbed variation divergence between distributions proposed by Harel and Mannor (2012). Justified by a theoretical bound on the target risk of the vote, we provide to MinCq a tar-get sample labeled thanks to a perturbed variation-based self-labeling focused on the regions where the source and target marginals appear similar. We also study the influence of our self-labeling, from which we deduce an original process for tuning the hyperparameters. Finally, our framework called PV-MinCq shows very promising results on a rotation and translation synthetic problem.' author: - first_name: Emilie full_name: Morvant, Emilie id: 4BAC2A72-F248-11E8-B48F-1D18A9856A87 last_name: Morvant orcid: 0000-0002-8301-7240 citation: ama: Morvant E. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 2014;51:37-43. doi:10.1016/j.patrec.2014.08.013 apa: Morvant, E. (2014). Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. Elsevier. https://doi.org/10.1016/j.patrec.2014.08.013 chicago: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters. Elsevier, 2014. https://doi.org/10.1016/j.patrec.2014.08.013. ieee: E. Morvant, “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling,” Pattern Recognition Letters, vol. 51. Elsevier, pp. 37–43, 2014. ista: Morvant E. 2014. Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling. Pattern Recognition Letters. 51, 37–43. mla: Morvant, Emilie. “Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling.” Pattern Recognition Letters, vol. 51, Elsevier, 2014, pp. 37–43, doi:10.1016/j.patrec.2014.08.013. short: E. Morvant, Pattern Recognition Letters 51 (2014) 37–43. date_created: 2018-12-11T11:56:05Z date_published: 2014-10-01T00:00:00Z date_updated: 2021-01-12T06:55:43Z day: '01' doi: 10.1016/j.patrec.2014.08.013 ec_funded: 1 extern: '1' intvolume: ' 51' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1410.0334 month: '10' oa: 1 oa_version: Submitted Version page: 37-43 project: - _id: 2532554C-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '308036' name: Lifelong Learning of Visual Scene Understanding publication: Pattern Recognition Letters publication_status: published publisher: Elsevier publist_id: '4819' quality_controlled: '1' status: public title: Domain Adaptation of Weighted Majority Votes via Perturbed Variation-Based Self-Labeling type: journal_article user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87 volume: 51 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: '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' ...