---
_id: '760'
abstract:
- lang: eng
  text: A randomized implementation is given of a test-and-set register with O(log
    log n) individual step complexity and O(n) total step complexity against an oblivious
    adversary. The implementation is linearizable and multi-shot, and shows an exponential
    complexity improvement over previous solutions designed to work against a strong
    adversary.
acknowledgement: The work of Dan Alistarh was supported by the NCCR MICS Project.
  The work of James Aspnes was supported in part by NSF grant CCF-0916389.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: James
  full_name: Aspnes, James
  last_name: Aspnes
citation:
  ama: 'Alistarh D-A, Aspnes J. Sub-logarithmic test-and-set against a weak adversary.
    In: Vol 6950 LNCS. Springer; 2011:97-109. doi:<a href="https://doi.org/10.1007/978-3-642-24100-0_7">10.1007/978-3-642-24100-0_7</a>'
  apa: 'Alistarh, D.-A., &#38; Aspnes, J. (2011). Sub-logarithmic test-and-set against
    a weak adversary (Vol. 6950 LNCS, pp. 97–109). Presented at the DISC: Distributed
    Computing, Springer. <a href="https://doi.org/10.1007/978-3-642-24100-0_7">https://doi.org/10.1007/978-3-642-24100-0_7</a>'
  chicago: Alistarh, Dan-Adrian, and James Aspnes. “Sub-Logarithmic Test-and-Set against
    a Weak Adversary,” 6950 LNCS:97–109. Springer, 2011. <a href="https://doi.org/10.1007/978-3-642-24100-0_7">https://doi.org/10.1007/978-3-642-24100-0_7</a>.
  ieee: 'D.-A. Alistarh and J. Aspnes, “Sub-logarithmic test-and-set against a weak
    adversary,” presented at the DISC: Distributed Computing, 2011, vol. 6950 LNCS,
    pp. 97–109.'
  ista: 'Alistarh D-A, Aspnes J. 2011. Sub-logarithmic test-and-set against a weak
    adversary. DISC: Distributed Computing, LNCS, vol. 6950 LNCS, 97–109.'
  mla: Alistarh, Dan-Adrian, and James Aspnes. <i>Sub-Logarithmic Test-and-Set against
    a Weak Adversary</i>. Vol. 6950 LNCS, Springer, 2011, pp. 97–109, doi:<a href="https://doi.org/10.1007/978-3-642-24100-0_7">10.1007/978-3-642-24100-0_7</a>.
  short: D.-A. Alistarh, J. Aspnes, in:, Springer, 2011, pp. 97–109.
conference:
  name: 'DISC: Distributed Computing'
date_created: 2018-12-11T11:48:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:12:01Z
day: '01'
doi: 10.1007/978-3-642-24100-0_7
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 97 - 109
publication_status: published
publisher: Springer
publist_id: '6896'
status: public
title: Sub-logarithmic test-and-set against a weak adversary
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6950 LNCS
year: '2011'
...
---
_id: '761'
abstract:
- lang: eng
  text: We give two new randomized algorithms for strong renaming, both of which work
    against an adaptive adversary in asynchronous shared memory. The first uses repeated
    sampling over a sequence of arrays of decreasing size to assign unique names to
    each of n processes with step complexity O(log3 n). The second transforms any
    sorting network into a strong adaptive renaming protocol, with an expected cost
    equal to the depth of the sorting network. Using an AKS sorting network, this
    gives a strong adaptive renaming algorithm with step complexity O(log k), where
    k is the contention in the current execution. We show this to be optimal based
    on a classic lower bound of Jayanti. We also show that any such strong renaming
    protocol can be used to build a monotone-consistent counter with logarithmic step
    complexity (at the cost of adding a max register) or a linearizable fetch-and-increment
    register (at the cost of increasing the step complexity by a logarithmic factor).
acknowledgement: "We would like to thank Hagit Attiya, Rachid Guerraoui\r\nand Prasad
  Jayanti for useful discussions and support.  We\r\nwould also like to thank the
  anonymous reviewers for many\r\nuseful comments."
article_processing_charge: No
author:
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: James
  full_name: Aspnes, James
  last_name: Aspnes
- first_name: Keren
  full_name: Censor Hillel, Keren
  last_name: Censor Hillel
- first_name: Seth
  full_name: Gilbert, Seth
  last_name: Gilbert
- first_name: Morteza
  full_name: Zadimoghaddam, Morteza
  last_name: Zadimoghaddam
citation:
  ama: 'Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. Optimal-time
    adaptive strong renaming, with applications to counting. In: ACM; 2011:239-248.
    doi:<a href="https://doi.org/10.1145/1993806.1993850">10.1145/1993806.1993850</a>'
  apa: 'Alistarh, D.-A., Aspnes, J., Censor Hillel, K., Gilbert, S., &#38; Zadimoghaddam,
    M. (2011). Optimal-time adaptive strong renaming, with applications to counting
    (pp. 239–248). Presented at the PODC: Principles of Distributed Computing, ACM.
    <a href="https://doi.org/10.1145/1993806.1993850">https://doi.org/10.1145/1993806.1993850</a>'
  chicago: Alistarh, Dan-Adrian, James Aspnes, Keren Censor Hillel, Seth Gilbert,
    and Morteza Zadimoghaddam. “Optimal-Time Adaptive Strong Renaming, with Applications
    to Counting,” 239–48. ACM, 2011. <a href="https://doi.org/10.1145/1993806.1993850">https://doi.org/10.1145/1993806.1993850</a>.
  ieee: 'D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, and M. Zadimoghaddam,
    “Optimal-time adaptive strong renaming, with applications to counting,” presented
    at the PODC: Principles of Distributed Computing, 2011, pp. 239–248.'
  ista: 'Alistarh D-A, Aspnes J, Censor Hillel K, Gilbert S, Zadimoghaddam M. 2011.
    Optimal-time adaptive strong renaming, with applications to counting. PODC: Principles
    of Distributed Computing, 239–248.'
  mla: Alistarh, Dan-Adrian, et al. <i>Optimal-Time Adaptive Strong Renaming, with
    Applications to Counting</i>. ACM, 2011, pp. 239–48, doi:<a href="https://doi.org/10.1145/1993806.1993850">10.1145/1993806.1993850</a>.
  short: D.-A. Alistarh, J. Aspnes, K. Censor Hillel, S. Gilbert, M. Zadimoghaddam,
    in:, ACM, 2011, pp. 239–248.
conference:
  name: 'PODC: Principles of Distributed Computing'
date_created: 2018-12-11T11:48:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2023-02-23T13:12:17Z
day: '01'
doi: 10.1145/1993806.1993850
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 239 - 248
publication_status: published
publisher: ACM
publist_id: '6897'
status: public
title: Optimal-time adaptive strong renaming, with applications to counting
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '9943'
abstract:
- lang: eng
  text: Segmentation is the process of partitioning digital images into meaningful
    regions. The analysis of biological high content images often requires segmentation
    as a first step. We propose ilastik as an easy-to-use tool which allows the user
    without expertise in image processing to perform segmentation and classification
    in a unified way. ilastik learns from labels provided by the user through a convenient
    mouse interface. Based on these labels, ilastik infers a problem specific segmentation.
    A random forest classifier is used in the learning step, in which each pixel's
    neighborhood is characterized by a set of generic (nonlinear) features. ilastik
    supports up to three spatial plus one spectral dimension and makes use of all
    dimensions in the feature calculation. ilastik provides realtime feedback that
    enables the user to interactively refine the segmentation result and hence further
    fine-tune the classifier. An uncertainty measure guides the user to ambiguous
    regions in the images. Real time performance is achieved by multi-threading which
    fully exploits the capabilities of modern multi-core machines. Once a classifier
    has been trained on a set of representative images, it can be exported and used
    to automatically process a very large number of images (e.g. using the CellProfiler
    pipeline). ilastik is an open source project and released under the BSD license
    at www.ilastik.org.
article_processing_charge: No
author:
- first_name: Christoph M
  full_name: Sommer, Christoph M
  id: 4DF26D8C-F248-11E8-B48F-1D18A9856A87
  last_name: Sommer
  orcid: 0000-0003-1216-9105
- first_name: Christoph
  full_name: Straehle, Christoph
  last_name: Straehle
- first_name: Ullrich
  full_name: Köthe, Ullrich
  last_name: Köthe
- first_name: Fred A.
  full_name: Hamprecht, Fred A.
  last_name: Hamprecht
citation:
  ama: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. Ilastik: Interactive learning
    and segmentation toolkit. In: <i>2011 IEEE International Symposium on Biomedical
    Imaging: From Nano to Micro</i>. Institute of Electrical and Electronics Engineers;
    2011. doi:<a href="https://doi.org/10.1109/isbi.2011.5872394">10.1109/isbi.2011.5872394</a>'
  apa: 'Sommer, C. M., Straehle, C., Köthe, U., &#38; Hamprecht, F. A. (2011). Ilastik:
    Interactive learning and segmentation toolkit. In <i>2011 IEEE International Symposium
    on Biomedical Imaging: from Nano to Micro</i>. Chicago, Illinois, USA: Institute
    of Electrical and Electronics Engineers. <a href="https://doi.org/10.1109/isbi.2011.5872394">https://doi.org/10.1109/isbi.2011.5872394</a>'
  chicago: 'Sommer, Christoph M, Christoph Straehle, Ullrich Köthe, and Fred A. Hamprecht.
    “Ilastik: Interactive Learning and Segmentation Toolkit.” In <i>2011 IEEE International
    Symposium on Biomedical Imaging: From Nano to Micro</i>. Institute of Electrical
    and Electronics Engineers, 2011. <a href="https://doi.org/10.1109/isbi.2011.5872394">https://doi.org/10.1109/isbi.2011.5872394</a>.'
  ieee: 'C. M. Sommer, C. Straehle, U. Köthe, and F. A. Hamprecht, “Ilastik: Interactive
    learning and segmentation toolkit,” in <i>2011 IEEE International Symposium on
    Biomedical Imaging: from Nano to Micro</i>, Chicago, Illinois, USA, 2011.'
  ista: 'Sommer CM, Straehle C, Köthe U, Hamprecht FA. 2011. Ilastik: Interactive
    learning and segmentation toolkit. 2011 IEEE International Symposium on Biomedical
    Imaging: from Nano to Micro. ISBI: International Symposium on Biomedical Imaging.'
  mla: 'Sommer, Christoph M., et al. “Ilastik: Interactive Learning and Segmentation
    Toolkit.” <i>2011 IEEE International Symposium on Biomedical Imaging: From Nano
    to Micro</i>, Institute of Electrical and Electronics Engineers, 2011, doi:<a
    href="https://doi.org/10.1109/isbi.2011.5872394">10.1109/isbi.2011.5872394</a>.'
  short: 'C.M. Sommer, C. Straehle, U. Köthe, F.A. Hamprecht, in:, 2011 IEEE International
    Symposium on Biomedical Imaging: From Nano to Micro, Institute of Electrical and
    Electronics Engineers, 2011.'
conference:
  end_date: 2011-04-02
  location: Chicago, Illinois, USA
  name: 'ISBI: International Symposium on Biomedical Imaging'
  start_date: 2011-03-30
date_created: 2021-08-19T11:49:58Z
date_published: 2011-06-09T00:00:00Z
date_updated: 2023-02-23T14:13:38Z
day: '09'
department:
- _id: Bio
doi: 10.1109/isbi.2011.5872394
extern: '1'
keyword:
- image segmentation
- biomedical imaging
- three dimensional displays
- neurons
- retina
- observers
- image color analysis
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://www.researchgate.net/publication/224241106_Ilastik_Interactive_learning_and_segmentation_toolkit
month: '06'
oa: 1
oa_version: Preprint
publication: '2011 IEEE International Symposium on Biomedical Imaging: from Nano to
  Micro'
publication_identifier:
  eissn:
  - 1945-8452
  isbn:
  - 978-1-4244-4127-3
  issn:
  - 1945-7928
publication_status: published
publisher: Institute of Electrical and Electronics Engineers
quality_controlled: '1'
status: public
title: 'Ilastik: Interactive learning and segmentation toolkit'
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2011'
...
---
_id: '3429'
abstract:
- lang: eng
  text: Transcription factors are central to sustaining pluripotency, yet little is
    known about transcription factor dynamics in defining pluripotency in the early
    mammalian embryo. Here, we establish a fluorescence decay after photoactivation
    (FDAP) assay to quantitatively study the kinetic behaviour of Oct4, a key transcription
    factor controlling pre-implantation development in the mouse embryo. FDAP measurements
    reveal that each cell in a developing embryo shows one of two distinct Oct4 kinetics,
    before there are any morphologically distinguishable differences or outward signs
    of lineage patterning. The differences revealed by FDAP are due to differences
    in the accessibility of Oct4 to its DNA binding sites in the nucleus. Lineage
    tracing of the cells in the two distinct sub-populations demonstrates that the
    Oct4 kinetics predict lineages of the early embryo. Cells with slower Oct4 kinetics
    are more likely to give rise to the pluripotent cell lineage that contributes
    to the inner cell mass. Those with faster Oct4 kinetics contribute mostly to the
    extra-embryonic lineage. Our findings identify Oct4 kinetics, rather than differences
    in total transcription factor expression levels, as a predictive measure of developmental
    cell lineage patterning in the early mouse embryo.
acknowledgement: This work was supported by the Beckman Institute and Biological Imaging
  Center at the California Institute of Technology and by the NHGRI Center of Excellence
  in Genomic Science grant P50HG004071.
article_processing_charge: No
author:
- first_name: Nicolas
  full_name: Plachta, Nicolas
  last_name: Plachta
- first_name: Mark Tobias
  full_name: Bollenbach, Mark Tobias
  id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
  last_name: Bollenbach
  orcid: 0000-0003-4398-476X
- first_name: Shirley
  full_name: Pease, Shirley
  last_name: Pease
- first_name: Scott
  full_name: Fraser, Scott
  last_name: Fraser
- first_name: Periklis
  full_name: Pantazis, Periklis
  last_name: Pantazis
citation:
  ama: Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. Oct4 kinetics predict
    cell lineage patterning in the early mammalian embryo. <i>Nature Cell Biology</i>.
    2011;13(2):117-123. doi:<a href="https://doi.org/10.1038/ncb2154">10.1038/ncb2154</a>
  apa: Plachta, N., Bollenbach, M. T., Pease, S., Fraser, S., &#38; Pantazis, P. (2011).
    Oct4 kinetics predict cell lineage patterning in the early mammalian embryo. <i>Nature
    Cell Biology</i>. Nature Publishing Group. <a href="https://doi.org/10.1038/ncb2154">https://doi.org/10.1038/ncb2154</a>
  chicago: Plachta, Nicolas, Mark Tobias Bollenbach, Shirley Pease, Scott Fraser,
    and Periklis Pantazis. “Oct4 Kinetics Predict Cell Lineage Patterning in the Early
    Mammalian Embryo.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2011.
    <a href="https://doi.org/10.1038/ncb2154">https://doi.org/10.1038/ncb2154</a>.
  ieee: N. Plachta, M. T. Bollenbach, S. Pease, S. Fraser, and P. Pantazis, “Oct4
    kinetics predict cell lineage patterning in the early mammalian embryo,” <i>Nature
    Cell Biology</i>, vol. 13, no. 2. Nature Publishing Group, pp. 117–123, 2011.
  ista: Plachta N, Bollenbach MT, Pease S, Fraser S, Pantazis P. 2011. Oct4 kinetics
    predict cell lineage patterning in the early mammalian embryo. Nature Cell Biology.
    13(2), 117–123.
  mla: Plachta, Nicolas, et al. “Oct4 Kinetics Predict Cell Lineage Patterning in
    the Early Mammalian Embryo.” <i>Nature Cell Biology</i>, vol. 13, no. 2, Nature
    Publishing Group, 2011, pp. 117–23, doi:<a href="https://doi.org/10.1038/ncb2154">10.1038/ncb2154</a>.
  short: N. Plachta, M.T. Bollenbach, S. Pease, S. Fraser, P. Pantazis, Nature Cell
    Biology 13 (2011) 117–123.
date_created: 2018-12-11T12:03:17Z
date_published: 2011-01-23T00:00:00Z
date_updated: 2025-09-30T08:39:51Z
day: '23'
department:
- _id: ToBo
doi: 10.1038/ncb2154
external_id:
  isi:
  - '000286805900004'
intvolume: '        13'
isi: 1
issue: '2'
language:
- iso: eng
month: '01'
oa_version: None
page: 117 - 123
publication: Nature Cell Biology
publication_status: published
publisher: Nature Publishing Group
publist_id: '2971'
scopus_import: '1'
status: public
title: Oct4 kinetics predict cell lineage patterning in the early mammalian embryo
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2011'
...
---
_id: '3505'
abstract:
- lang: eng
  text: Cell migration on two-dimensional (2D) substrates follows entirely different
    rules than cell migration in three-dimensional (3D) environments. This is especially
    relevant for leukocytes that are able to migrate in the absence of adhesion receptors
    within the confined geometry of artificial 3D extracellular matrix scaffolds and
    within the interstitial space in vivo. Here, we describe in detail a simple and
    economical protocol to visualize dendritic cell migration in 3D collagen scaffolds
    along chemotactic gradients. This method can be adapted to other cell types and
    may serve as a physiologically relevant paradigm for the directed locomotion of
    most amoeboid cells.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
article_type: original
author:
- 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: Tim
  full_name: Lämmermann, Tim
  last_name: Lämmermann
citation:
  ama: Sixt MK, Lämmermann T. In vitro analysis of chemotactic leukocyte migration
    in 3D environments. <i>Cell Migration</i>. 2011;769:149-165. doi:<a href="https://doi.org/10.1007/978-1-61779-207-6_11">10.1007/978-1-61779-207-6_11</a>
  apa: Sixt, M. K., &#38; Lämmermann, T. (2011). In vitro analysis of chemotactic
    leukocyte migration in 3D environments. <i>Cell Migration</i>. Springer. <a href="https://doi.org/10.1007/978-1-61779-207-6_11">https://doi.org/10.1007/978-1-61779-207-6_11</a>
  chicago: Sixt, Michael K, and Tim Lämmermann. “In Vitro Analysis of Chemotactic
    Leukocyte Migration in 3D Environments.” <i>Cell Migration</i>. Springer, 2011.
    <a href="https://doi.org/10.1007/978-1-61779-207-6_11">https://doi.org/10.1007/978-1-61779-207-6_11</a>.
  ieee: M. K. Sixt and T. Lämmermann, “In vitro analysis of chemotactic leukocyte
    migration in 3D environments,” <i>Cell Migration</i>, vol. 769. Springer, pp.
    149–165, 2011.
  ista: Sixt MK, Lämmermann T. 2011. In vitro analysis of chemotactic leukocyte migration
    in 3D environments. Cell Migration. 769, 149–165.
  mla: Sixt, Michael K., and Tim Lämmermann. “In Vitro Analysis of Chemotactic Leukocyte
    Migration in 3D Environments.” <i>Cell Migration</i>, vol. 769, Springer, 2011,
    pp. 149–65, doi:<a href="https://doi.org/10.1007/978-1-61779-207-6_11">10.1007/978-1-61779-207-6_11</a>.
  short: M.K. Sixt, T. Lämmermann, Cell Migration 769 (2011) 149–165.
corr_author: '1'
date_created: 2018-12-11T12:03:41Z
date_published: 2011-05-17T00:00:00Z
date_updated: 2024-10-21T06:03:02Z
day: '17'
department:
- _id: MiSi
doi: 10.1007/978-1-61779-207-6_11
intvolume: '       769'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://pure.mpg.de/pubman/item/item_3219628_1/component/file_3219630/Sixt%20et%20al..pdf
month: '05'
oa: 1
oa_version: Published Version
page: 149 - 165
publication: Cell Migration
publication_status: published
publisher: Springer
publist_id: '2882'
quality_controlled: '1'
scopus_import: '1'
status: public
title: In vitro analysis of chemotactic leukocyte migration in 3D environments
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 769
year: '2011'
...
---
_id: '3724'
abstract:
- lang: eng
  text: 'Small photochromic molecules are widespread in nature and serve as switches
    for a plethora of light-controlled processes. In a typical photoreceptor, the
    different geometries and polarities of the photochrome isomers are tightly coupled
    to functionally relevant conformational changes in the proteins. The past decade
    has seen extensive efforts to mimic nature and create proteins controlled by synthetic
    photochromes in the laboratory. Here, we discuss the role of molecular modeling
    to gain a structural understanding of photochromes and to design light-controlled
    peptides and proteins. We address several fundamental questions: What are the
    molecular structures of photochromes, particularly for metastable isomers that
    cannot be addressed experimentally? How are the structures of bistable photoisomers
    coupled to the conformational states of peptides and proteins? Can we design light-controlled
    proteins rapidly and reliably? After an introduction to the principles of molecular
    modeling, we answer these questions by examining systems that range from the size
    of isolated photochromes, to that of peptides and large cell surface receptors,
    each from its unique computational perspective.'
author:
- first_name: Harald L
  full_name: Harald Janovjak
  id: 33BA6C30-F248-11E8-B48F-1D18A9856A87
  last_name: Janovjak
  orcid: 0000-0002-8023-9315
- first_name: Ehud
  full_name: Isacoff, Ehud Y
  last_name: Isacoff
citation:
  ama: 'Janovjak HL, Isacoff E. Structure-based design of light-controlled proteins.
    In: <i>Photosensitive Molecules for the Control of Biological Function</i>. Vol
    55. Springer; 2011:233-266. doi:<a href="https://doi.org/10.1007/978-1-61779-031-7_13">10.1007/978-1-61779-031-7_13</a>'
  apa: Janovjak, H. L., &#38; Isacoff, E. (2011). Structure-based design of light-controlled
    proteins. In <i>Photosensitive Molecules for the Control of Biological Function</i>
    (Vol. 55, pp. 233–266). Springer. <a href="https://doi.org/10.1007/978-1-61779-031-7_13">https://doi.org/10.1007/978-1-61779-031-7_13</a>
  chicago: Janovjak, Harald L, and Ehud Isacoff. “Structure-Based Design of Light-Controlled
    Proteins.” In <i>Photosensitive Molecules for the Control of Biological Function</i>,
    55:233–66. Springer, 2011. <a href="https://doi.org/10.1007/978-1-61779-031-7_13">https://doi.org/10.1007/978-1-61779-031-7_13</a>.
  ieee: H. L. Janovjak and E. Isacoff, “Structure-based design of light-controlled
    proteins,” in <i>Photosensitive Molecules for the Control of Biological Function</i>,
    vol. 55, Springer, 2011, pp. 233–266.
  ista: 'Janovjak HL, Isacoff E. 2011.Structure-based design of light-controlled proteins.
    In: Photosensitive Molecules for the Control of Biological Function. vol. 55,
    233–266.'
  mla: Janovjak, Harald L., and Ehud Isacoff. “Structure-Based Design of Light-Controlled
    Proteins.” <i>Photosensitive Molecules for the Control of Biological Function</i>,
    vol. 55, Springer, 2011, pp. 233–66, doi:<a href="https://doi.org/10.1007/978-1-61779-031-7_13">10.1007/978-1-61779-031-7_13</a>.
  short: H.L. Janovjak, E. Isacoff, in:, Photosensitive Molecules for the Control
    of Biological Function, Springer, 2011, pp. 233–266.
date_created: 2018-12-11T12:04:49Z
date_published: 2011-03-16T00:00:00Z
date_updated: 2021-01-12T07:51:45Z
day: '16'
doi: 10.1007/978-1-61779-031-7_13
extern: 1
intvolume: '        55'
month: '03'
page: 233 - 266
publication: Photosensitive Molecules for the Control of Biological Function
publication_status: published
publisher: Springer
publist_id: '2504'
quality_controlled: 0
status: public
title: Structure-based design of light-controlled proteins
type: book_chapter
volume: 55
year: '2011'
...
---
_id: '3770'
abstract:
- lang: eng
  text: 'The pink dolphin (Inia geoffrensis) is widely distributed along the Amazon
    and Orinoco basins, covering an area of approximately 7 million km2. Previous
    morphological and genetic studies have proposed the existence of at least two
    evolutionary significant units: one distributed across the Orinoco and Amazon
    basins and another confined to the Bolivian Amazon. The presence of barriers in
    the riverine environment has been suggested to play a significant role in shaping
    present-day patterns of ecological and genetic structure for this species. In
    the present study, we examined the phylogeographic structure, lineage divergence
    time and historical demography using mitochondrial (mt)DNA sequences in different
    pink dolphin populations distributed in large and small spatial scales, including
    two neighbouring Brazilian Amazon populations. mtDNA control region (CR) analysis
    revealed that the Brazilian haplotypes occupy an intermediate position compared
    to three previously studied geographic locations: the Colombian Amazon, the Colombian
    Orinoco, and the Bolivian Amazon. On a local scale, we have identified a pattern
    of maternal isolation between two neighbouring populations from Brazil. Six mtDNA
    CR haplotypes were identified in Brazil with no sharing between the two populations,
    as well as specific cytochrome b (cyt b) haplotypes identified in each locality.
    In addition, we analyzed autosomal microsatellites to investigate male-mediated
    gene flow and demographic changes within the study area in Brazil. Data analysis
    of 14 microsatellite loci failed to detect significant population subdivision,
    suggesting that male-mediated gene flow may maintain homogeneity between these
    two locations. Moreover, both mtDNA and microsatellite data indicate a major demographic
    collapse within Brazil in the late Pleistocene. Bayesian skyline plots (BSP) of
    mtDNA data revealed a stable population for Colombian and Brazilian Amazon lineages
    through time, whereas a population decline was demonstrated in the Colombian Orinoco
    lineage. Moreover, BSP and Tajima''s D and Fu''s Fs tests revealed a recent population
    expansion exclusively in the Bolivian sample. Finally, we estimated that the diversification
    of the Inia sp. lineage began in the Late Pliocene (approximately 3.1 Mya) and
    continued throughout the Pleistocene.'
article_processing_charge: No
author:
- first_name: Claudia
  full_name: Hollatz, Claudia
  last_name: Hollatz
- first_name: Sibelle
  full_name: Vilaça, Sibelle
  last_name: Vilaça
- first_name: Rodrigo A
  full_name: Fernandes Redondo, Rodrigo A
  id: 409D5C96-F248-11E8-B48F-1D18A9856A87
  last_name: Fernandes Redondo
  orcid: 0000-0002-5837-2793
- first_name: Míriam
  full_name: Marmontel, Míriam
  last_name: Marmontel
- first_name: Cyndi
  full_name: Baker, Cyndi
  last_name: Baker
- first_name: Fabrício
  full_name: Santos, Fabrício
  last_name: Santos
citation:
  ama: Hollatz C, Vilaça S, Fernandes Redondo RA, Marmontel M, Baker C, Santos F.
    The Amazon River system as an ecological barrier driving genetic differentiation
    of the pink dolphin (Inia geoffrensis). <i>Biological Journal of the Linnean Society</i>.
    2011;102(4):812-827. doi:<a href="https://doi.org/10.1111/j.1095-8312.2011.01616.x">10.1111/j.1095-8312.2011.01616.x</a>
  apa: Hollatz, C., Vilaça, S., Fernandes Redondo, R. A., Marmontel, M., Baker, C.,
    &#38; Santos, F. (2011). The Amazon River system as an ecological barrier driving
    genetic differentiation of the pink dolphin (Inia geoffrensis). <i>Biological
    Journal of the Linnean Society</i>. Wiley. <a href="https://doi.org/10.1111/j.1095-8312.2011.01616.x">https://doi.org/10.1111/j.1095-8312.2011.01616.x</a>
  chicago: Hollatz, Claudia, Sibelle Vilaça, Rodrigo A Fernandes Redondo, Míriam Marmontel,
    Cyndi Baker, and Fabrício Santos. “The Amazon River System as an Ecological Barrier
    Driving Genetic Differentiation of the Pink Dolphin (Inia Geoffrensis).” <i>Biological
    Journal of the Linnean Society</i>. Wiley, 2011. <a href="https://doi.org/10.1111/j.1095-8312.2011.01616.x">https://doi.org/10.1111/j.1095-8312.2011.01616.x</a>.
  ieee: C. Hollatz, S. Vilaça, R. A. Fernandes Redondo, M. Marmontel, C. Baker, and
    F. Santos, “The Amazon River system as an ecological barrier driving genetic differentiation
    of the pink dolphin (Inia geoffrensis),” <i>Biological Journal of the Linnean
    Society</i>, vol. 102, no. 4. Wiley, pp. 812–827, 2011.
  ista: Hollatz C, Vilaça S, Fernandes Redondo RA, Marmontel M, Baker C, Santos F.
    2011. The Amazon River system as an ecological barrier driving genetic differentiation
    of the pink dolphin (Inia geoffrensis). Biological Journal of the Linnean Society.
    102(4), 812–827.
  mla: Hollatz, Claudia, et al. “The Amazon River System as an Ecological Barrier
    Driving Genetic Differentiation of the Pink Dolphin (Inia Geoffrensis).” <i>Biological
    Journal of the Linnean Society</i>, vol. 102, no. 4, Wiley, 2011, pp. 812–27,
    doi:<a href="https://doi.org/10.1111/j.1095-8312.2011.01616.x">10.1111/j.1095-8312.2011.01616.x</a>.
  short: C. Hollatz, S. Vilaça, R.A. Fernandes Redondo, M. Marmontel, C. Baker, F.
    Santos, Biological Journal of the Linnean Society 102 (2011) 812–827.
date_created: 2018-12-11T12:05:04Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2021-01-12T07:52:05Z
day: '01'
doi: 10.1111/j.1095-8312.2011.01616.x
extern: '1'
intvolume: '       102'
issue: '4'
language:
- iso: eng
month: '04'
oa_version: None
page: 812 - 827
publication: Biological Journal of the Linnean Society
publication_status: published
publisher: Wiley
publist_id: '2457'
status: public
title: The Amazon River system as an ecological barrier driving genetic differentiation
  of the pink dolphin (Inia geoffrensis)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 102
year: '2011'
...
---
_id: '3771'
abstract:
- lang: eng
  text: The small-sized frugivorous bat Carollia perspicillata is an understory specialist
    and occurs in a wide range of lowland habitats, tending to be more common in tropical
    dry or moist forests of South and Central America. Its sister species, Carollia
    brevicauda, occurs almost exclusively in the Amazon rainforest. A recent phylogeographic
    study proposed a hypothesis of origin and subsequent diversification for C. perspicillata
    along the Atlantic coastal forest of Brazil. Additionally, it also found two allopatric
    clades for C. brevicauda separated by the Amazon Basin. We used cytochrome b gene
    sequences and a more extensive sampling to test hypotheses related to the origin
    and diversification of C. perspicillata plus C. brevicauda clade in South America.
    The results obtained indicate that there are two sympatric evolutionary lineages
    within each species. In C. perspicillata, one lineage is limited to the Southern
    Atlantic Forest, whereas the other is widely distributed. Coalescent analysis
    points to a simultaneous origin for C. perspicillata and C. brevicauda, although
    no place for the diversification of each species can be firmly suggested. The
    phylogeographic pattern shown by C. perspicillata is also congruent with the Pleistocene
    refugia hypothesis as a likely vicariant phenomenon shaping the present distribution
    of its intraspecific lineages.
article_processing_charge: No
author:
- first_name: Ana
  full_name: Pavan, Ana
  last_name: Pavan
- first_name: Felipe
  full_name: Martins, Felipe
  last_name: Martins
- first_name: Fabrício
  full_name: Santos, Fabrício
  last_name: Santos
- first_name: Albert
  full_name: Ditchfield, Albert
  last_name: Ditchfield
- first_name: Rodrigo A
  full_name: Fernandes Redondo, Rodrigo A
  id: 409D5C96-F248-11E8-B48F-1D18A9856A87
  last_name: Fernandes Redondo
  orcid: 0000-0002-5837-2793
citation:
  ama: 'Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. Patterns
    of diversification in two species of short-tailed bats (Carollia Gray, 1838):
    the effects of historical fragmentation of Brazilian rainforests. <i>Biological
    Journal of the Linnean Society</i>. 2011;102(3):527-539. doi:<a href="https://doi.org/10.1111/j.1095-8312.2010.01601.x">10.1111/j.1095-8312.2010.01601.x</a>'
  apa: 'Pavan, A., Martins, F., Santos, F., Ditchfield, A., &#38; Fernandes Redondo,
    R. A. (2011). Patterns of diversification in two species of short-tailed bats
    (Carollia Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.
    <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell. <a href="https://doi.org/10.1111/j.1095-8312.2010.01601.x">https://doi.org/10.1111/j.1095-8312.2010.01601.x</a>'
  chicago: 'Pavan, Ana, Felipe Martins, Fabrício Santos, Albert Ditchfield, and Rodrigo
    A Fernandes Redondo. “Patterns of Diversification in Two Species of Short-Tailed
    Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian
    Rainforests.” <i>Biological Journal of the Linnean Society</i>. Wiley-Blackwell,
    2011. <a href="https://doi.org/10.1111/j.1095-8312.2010.01601.x">https://doi.org/10.1111/j.1095-8312.2010.01601.x</a>.'
  ieee: 'A. Pavan, F. Martins, F. Santos, A. Ditchfield, and R. A. Fernandes Redondo,
    “Patterns of diversification in two species of short-tailed bats (Carollia Gray,
    1838): the effects of historical fragmentation of Brazilian rainforests.,” <i>Biological
    Journal of the Linnean Society</i>, vol. 102, no. 3. Wiley-Blackwell, pp. 527–539,
    2011.'
  ista: 'Pavan A, Martins F, Santos F, Ditchfield A, Fernandes Redondo RA. 2011. Patterns
    of diversification in two species of short-tailed bats (Carollia Gray, 1838):
    the effects of historical fragmentation of Brazilian rainforests. Biological Journal
    of the Linnean Society. 102(3), 527–539.'
  mla: 'Pavan, Ana, et al. “Patterns of Diversification in Two Species of Short-Tailed
    Bats (Carollia Gray, 1838): The Effects of Historical Fragmentation of Brazilian
    Rainforests.” <i>Biological Journal of the Linnean Society</i>, vol. 102, no.
    3, Wiley-Blackwell, 2011, pp. 527–39, doi:<a href="https://doi.org/10.1111/j.1095-8312.2010.01601.x">10.1111/j.1095-8312.2010.01601.x</a>.'
  short: A. Pavan, F. Martins, F. Santos, A. Ditchfield, R.A. Fernandes Redondo, Biological
    Journal of the Linnean Society 102 (2011) 527–539.
corr_author: '1'
date_created: 2018-12-11T12:05:05Z
date_published: 2011-02-10T00:00:00Z
date_updated: 2025-09-30T08:39:13Z
day: '10'
department:
- _id: FyKo
doi: 10.1111/j.1095-8312.2010.01601.x
external_id:
  isi:
  - '000287193800005'
intvolume: '       102'
isi: 1
issue: '3'
language:
- iso: eng
month: '02'
oa_version: None
page: 527 - 539
publication: Biological Journal of the Linnean Society
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2456'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Patterns of diversification in two species of short-tailed bats (Carollia
  Gray, 1838): the effects of historical fragmentation of Brazilian rainforests.'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 102
year: '2011'
...
---
_id: '3778'
article_processing_charge: No
author:
- 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: Barton NH. Estimating linkage disequilibria. <i>Heredity</i>. 2011;106(2):205-206.
    doi:<a href="https://doi.org/10.1038/hdy.2010.67">10.1038/hdy.2010.67</a>
  apa: Barton, N. H. (2011). Estimating linkage disequilibria. <i>Heredity</i>. Nature
    Publishing Group. <a href="https://doi.org/10.1038/hdy.2010.67">https://doi.org/10.1038/hdy.2010.67</a>
  chicago: Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>.
    Nature Publishing Group, 2011. <a href="https://doi.org/10.1038/hdy.2010.67">https://doi.org/10.1038/hdy.2010.67</a>.
  ieee: N. H. Barton, “Estimating linkage disequilibria,” <i>Heredity</i>, vol. 106,
    no. 2. Nature Publishing Group, pp. 205–206, 2011.
  ista: Barton NH. 2011. Estimating linkage disequilibria. Heredity. 106(2), 205–206.
  mla: Barton, Nicholas H. “Estimating Linkage Disequilibria.” <i>Heredity</i>, vol.
    106, no. 2, Nature Publishing Group, 2011, pp. 205–06, doi:<a href="https://doi.org/10.1038/hdy.2010.67">10.1038/hdy.2010.67</a>.
  short: N.H. Barton, Heredity 106 (2011) 205–206.
corr_author: '1'
date_created: 2018-12-11T12:05:07Z
date_published: 2011-02-01T00:00:00Z
date_updated: 2025-09-30T08:38:46Z
day: '01'
department:
- _id: NiBa
doi: 10.1038/hdy.2010.67
external_id:
  isi:
  - '000286375300002'
  pmid:
  - '20502479'
intvolume: '       106'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3183869/
month: '02'
oa: 1
oa_version: Submitted Version
page: 205 - 206
pmid: 1
publication: Heredity
publication_status: published
publisher: Nature Publishing Group
publist_id: '2449'
scopus_import: '1'
status: public
title: Estimating linkage disequilibria
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 106
year: '2011'
...
---
_id: '3784'
abstract:
- lang: eng
  text: Advanced stages of Scyllarus phyllosoma larvae were collected by demersal
    trawling during fishery research surveys in the western Mediterranean Sea in 2003–2005.
    Nucleotide sequence analysis of the mitochondrial 16S rDNA gene allowed the final-stage
    phyllosoma of Scyllarus arctus to be identified among these larvae. Its morphology
    is described and illustrated. This constitutes the second complete description
    of a Scyllaridae phyllosoma with its specific identity being validated by molecular
    techniques (the first was S. pygmaeus). These results also solved a long lasting
    taxonomic anomaly of several species assigned to the ancient genus Phyllosoma
    Leach, 1814. Detailed examination indicated that the final-stage phyllosoma of
    S. arctus shows closer affinities with the American scyllarid Scyllarus depressus
    or with the Australian Scyllarus sp. b (sensu Phillips et al., 1981) than to its
    sympatric species S. pygmaeus.
article_processing_charge: No
article_type: original
author:
- first_name: Ferran
  full_name: Palero, Ferran
  id: 3F0E2A22-F248-11E8-B48F-1D18A9856A87
  last_name: Palero
  orcid: 0000-0002-0343-8329
- first_name: Guillermo
  full_name: Guerao, Guillermo
  last_name: Guerao
- first_name: Paul
  full_name: Clark, Paul
  last_name: Clark
- first_name: Pere
  full_name: Abello, Pere
  last_name: Abello
citation:
  ama: 'Palero F, Guerao G, Clark P, Abello P. Scyllarus arctus (Crustacea: Decapoda:
    Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological
    description. <i>Journal of the Marine Biological Association of the United Kingdom</i>.
    2011;91(2):485-492. doi:<a href="https://doi.org/10.1017/S0025315410000287">10.1017/S0025315410000287</a>'
  apa: 'Palero, F., Guerao, G., Clark, P., &#38; Abello, P. (2011). Scyllarus arctus
    (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis,
    with morphological description. <i>Journal of the Marine Biological Association
    of the United Kingdom</i>. Cambridge University Press. <a href="https://doi.org/10.1017/S0025315410000287">https://doi.org/10.1017/S0025315410000287</a>'
  chicago: 'Palero, Ferran, Guillermo Guerao, Paul Clark, and Pere Abello. “Scyllarus
    Arctus (Crustacea: Decapoda: Scyllaridae) Final Stage Phyllosoma Identified by
    DNA Analysis, with Morphological Description.” <i>Journal of the Marine Biological
    Association of the United Kingdom</i>. Cambridge University Press, 2011. <a href="https://doi.org/10.1017/S0025315410000287">https://doi.org/10.1017/S0025315410000287</a>.'
  ieee: 'F. Palero, G. Guerao, P. Clark, and P. Abello, “Scyllarus arctus (Crustacea:
    Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with
    morphological description,” <i>Journal of the Marine Biological Association of
    the United Kingdom</i>, vol. 91, no. 2. Cambridge University Press, pp. 485–492,
    2011.'
  ista: 'Palero F, Guerao G, Clark P, Abello P. 2011. Scyllarus arctus (Crustacea:
    Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with
    morphological description. Journal of the Marine Biological Association of the
    United Kingdom. 91(2), 485–492.'
  mla: 'Palero, Ferran, et al. “Scyllarus Arctus (Crustacea: Decapoda: Scyllaridae)
    Final Stage Phyllosoma Identified by DNA Analysis, with Morphological Description.”
    <i>Journal of the Marine Biological Association of the United Kingdom</i>, vol.
    91, no. 2, Cambridge University Press, 2011, pp. 485–92, doi:<a href="https://doi.org/10.1017/S0025315410000287">10.1017/S0025315410000287</a>.'
  short: F. Palero, G. Guerao, P. Clark, P. Abello, Journal of the Marine Biological
    Association of the United Kingdom 91 (2011) 485–492.
corr_author: '1'
date_created: 2018-12-11T12:05:09Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2025-09-30T08:38:12Z
day: '01'
department:
- _id: NiBa
doi: 10.1017/S0025315410000287
external_id:
  isi:
  - '000287940400022'
intvolume: '        91'
isi: 1
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://digital.csic.es/bitstream/10261/32783/3/Palero_et_al_2011.pdf
month: '03'
oa: 1
oa_version: Published Version
page: 485 - 492
publication: Journal of the Marine Biological Association of the United Kingdom
publication_status: published
publisher: Cambridge University Press
publist_id: '2443'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma
  identified by DNA analysis, with morphological description'
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 91
year: '2011'
...
---
_id: '3791'
abstract:
- lang: eng
  text: During the development of multicellular organisms, cell fate specification
    is followed by the sorting of different cell types into distinct domains from
    where the different tissues and organs are formed. Cell sorting involves both
    the segregation of a mixed population of cells with different fates and properties
    into distinct domains, and the active maintenance of their segregated state. Because
    of its biological importance and apparent resemblance to fluid segregation in
    physics, cell sorting was extensively studied by both biologists and physicists
    over the last decades. Different theories were developed that try to explain cell
    sorting on the basis of the physical properties of the constituent cells. However,
    only recently the molecular and cellular mechanisms that control the physical
    properties driving cell sorting, have begun to be unraveled. In this review, we
    will provide an overview of different cell-sorting processes in development and
    discuss how these processes can be explained by the different sorting theories,
    and how these theories in turn can be connected to the molecular and cellular
    mechanisms driving these processes.
alternative_title:
- Current Topics in Developmental Biology
article_processing_charge: No
author:
- first_name: Gabriel
  full_name: Krens, Gabriel
  id: 2B819732-F248-11E8-B48F-1D18A9856A87
  last_name: Krens
  orcid: 0000-0003-4761-5996
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
citation:
  ama: 'Krens G, Heisenberg C-PJ. Cell sorting in development. In: Labouesse M, ed.
    <i>Forces and Tension in Development</i>. Vol 95. Elsevier; 2011:189-213. doi:<a
    href="https://doi.org/10.1016/B978-0-12-385065-2.00006-2">10.1016/B978-0-12-385065-2.00006-2</a>'
  apa: Krens, G., &#38; Heisenberg, C.-P. J. (2011). Cell sorting in development.
    In M. Labouesse (Ed.), <i>Forces and Tension in Development</i> (Vol. 95, pp.
    189–213). Elsevier. <a href="https://doi.org/10.1016/B978-0-12-385065-2.00006-2">https://doi.org/10.1016/B978-0-12-385065-2.00006-2</a>
  chicago: Krens, Gabriel, and Carl-Philipp J Heisenberg. “Cell Sorting in Development.”
    In <i>Forces and Tension in Development</i>, edited by Michel Labouesse, 95:189–213.
    Elsevier, 2011. <a href="https://doi.org/10.1016/B978-0-12-385065-2.00006-2">https://doi.org/10.1016/B978-0-12-385065-2.00006-2</a>.
  ieee: G. Krens and C.-P. J. Heisenberg, “Cell sorting in development,” in <i>Forces
    and Tension in Development</i>, vol. 95, M. Labouesse, Ed. Elsevier, 2011, pp.
    189–213.
  ista: 'Krens G, Heisenberg C-PJ. 2011.Cell sorting in development. In: Forces and
    Tension in Development. Current Topics in Developmental Biology, vol. 95, 189–213.'
  mla: Krens, Gabriel, and Carl-Philipp J. Heisenberg. “Cell Sorting in Development.”
    <i>Forces and Tension in Development</i>, edited by Michel Labouesse, vol. 95,
    Elsevier, 2011, pp. 189–213, doi:<a href="https://doi.org/10.1016/B978-0-12-385065-2.00006-2">10.1016/B978-0-12-385065-2.00006-2</a>.
  short: G. Krens, C.-P.J. Heisenberg, in:, M. Labouesse (Ed.), Forces and Tension
    in Development, Elsevier, 2011, pp. 189–213.
corr_author: '1'
date_created: 2018-12-11T12:05:11Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2025-09-30T08:37:44Z
day: '01'
department:
- _id: CaHe
doi: 10.1016/B978-0-12-385065-2.00006-2
editor:
- first_name: Michel
  full_name: Labouesse, Michel
  last_name: Labouesse
external_id:
  isi:
  - '000290454200007'
intvolume: '        95'
isi: 1
language:
- iso: eng
month: '01'
oa_version: None
page: 189 - 213
publication: Forces and Tension in Development
publication_status: published
publisher: Elsevier
publist_id: '2436'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell sorting in development
type: book_chapter
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 95
year: '2011'
...
---
_id: '3796'
abstract:
- lang: eng
  text: We address the problem of covering ℝ n with congruent balls, while minimizing
    the number of balls that contain an average point. Considering the 1-parameter
    family of lattices defined by stretching or compressing the integer grid in diagonal
    direction, we give a closed formula for the covering density that depends on the
    distortion parameter. We observe that our family contains the thinnest lattice
    coverings in dimensions 2 to 5. We also consider the problem of packing congruent
    balls in ℝ n , for which we give a closed formula for the packing density as well.
    Again we observe that our family contains optimal configurations, this time densest
    packings in dimensions 2 and 3.
alternative_title:
- LNCS
author:
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Michael
  full_name: Kerber, Michael
  id: 36E4574A-F248-11E8-B48F-1D18A9856A87
  last_name: Kerber
  orcid: 0000-0002-8030-9299
citation:
  ama: 'Edelsbrunner H, Kerber M. Covering and packing with spheres by diagonal distortion
    in R^n. In: Calude C, Rozenberg G, Salomaa A, eds. <i>Rainbow of Computer Science</i>.
    Vol 6570. Dedicated to Hermann Maurer on the Occasion of His 70th Birthday. Springer;
    2011:20-35. doi:<a href="https://doi.org/10.1007/978-3-642-19391-0_2">10.1007/978-3-642-19391-0_2</a>'
  apa: Edelsbrunner, H., &#38; Kerber, M. (2011). Covering and packing with spheres
    by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &#38; A. Salomaa (Eds.),
    <i>Rainbow of Computer Science</i> (Vol. 6570, pp. 20–35). Springer. <a href="https://doi.org/10.1007/978-3-642-19391-0_2">https://doi.org/10.1007/978-3-642-19391-0_2</a>
  chicago: Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres
    by Diagonal Distortion in R^n.” In <i>Rainbow of Computer Science</i>, edited
    by Cristian Calude, Grzegorz Rozenberg, and Arto Salomaa, 6570:20–35. Dedicated
    to Hermann Maurer on the Occasion of His 70th Birthday. Springer, 2011. <a href="https://doi.org/10.1007/978-3-642-19391-0_2">https://doi.org/10.1007/978-3-642-19391-0_2</a>.
  ieee: H. Edelsbrunner and M. Kerber, “Covering and packing with spheres by diagonal
    distortion in R^n,” in <i>Rainbow of Computer Science</i>, vol. 6570, C. Calude,
    G. Rozenberg, and A. Salomaa, Eds. Springer, 2011, pp. 20–35.
  ista: 'Edelsbrunner H, Kerber M. 2011.Covering and packing with spheres by diagonal
    distortion in R^n. In: Rainbow of Computer Science. LNCS, vol. 6570, 20–35.'
  mla: Edelsbrunner, Herbert, and Michael Kerber. “Covering and Packing with Spheres
    by Diagonal Distortion in R^n.” <i>Rainbow of Computer Science</i>, edited by
    Cristian Calude et al., vol. 6570, Springer, 2011, pp. 20–35, doi:<a href="https://doi.org/10.1007/978-3-642-19391-0_2">10.1007/978-3-642-19391-0_2</a>.
  short: H. Edelsbrunner, M. Kerber, in:, C. Calude, G. Rozenberg, A. Salomaa (Eds.),
    Rainbow of Computer Science, Springer, 2011, pp. 20–35.
corr_author: '1'
date_created: 2018-12-11T12:05:13Z
date_published: 2011-05-03T00:00:00Z
date_updated: 2024-10-21T06:03:02Z
day: '03'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.1007/978-3-642-19391-0_2
editor:
- first_name: Cristian
  full_name: Calude, Cristian
  last_name: Calude
- first_name: Grzegorz
  full_name: Rozenberg, Grzegorz
  last_name: Rozenberg
- first_name: Arto
  full_name: Salomaa, Arto
  last_name: Salomaa
file:
- access_level: open_access
  checksum: aaf22b4d7bd4277ffe8db532119cf474
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:07:42Z
  date_updated: 2020-07-14T12:46:16Z
  file_id: '4640'
  file_name: IST-2016-539-v1+1_2011-B-01-CoveringPacking.pdf
  file_size: 436875
  relation: main_file
file_date_updated: 2020-07-14T12:46:16Z
has_accepted_license: '1'
intvolume: '      6570'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 20 - 35
publication: Rainbow of Computer Science
publication_status: published
publisher: Springer
publist_id: '2427'
pubrep_id: '539'
quality_controlled: '1'
scopus_import: '1'
series_title: Dedicated to Hermann Maurer on the Occasion of His 70th Birthday
status: public
title: Covering and packing with spheres by diagonal distortion in R^n
type: book_chapter
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6570
year: '2011'
...
---
_id: '386'
abstract:
- lang: eng
  text: 'We present a detailed study of the local density of states (LDOS) associated
    with the surface-state band near a step edge of the strong topological insulator
    Bi2Te3 and reveal a one-dimensional bound state that runs parallel to the step
    edge and is bound to it at some characteristic distance. This bound state is clearly
    observed in the bulk gap region, while it becomes entangled with the oscillations
    of the warped surface band at high energy, and with the valence-band states near
    the Dirac point. We obtain excellent fits to theoretical predictions [Alpichshev,
    2011] that properly incorporate the three-dimensional nature of the problem to
    the surface state. Fitting the data at different energies, we can recalculate
    the LDOS originating from the Dirac band without the contribution of the bulk
    bands or incoherent tunneling effects. '
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zhanybek
  full_name: Alpichshev, Zhanybek
  id: 45E67A2A-F248-11E8-B48F-1D18A9856A87
  last_name: Alpichshev
  orcid: 0000-0002-7183-5203
- first_name: J G
  full_name: Analytis, J G
  last_name: Analytis
- first_name: J H
  full_name: Chu, J H
  last_name: Chu
- first_name: I R
  full_name: Fisher, I R
  last_name: Fisher
- first_name: A
  full_name: Kapitulnik, A
  last_name: Kapitulnik
citation:
  ama: Alpichshev Z, Analytis JG, Chu JH, Fisher IR, Kapitulnik A. STM imaging of
    a bound state along a step on the surface of the topological insulator Bi2Te3.
    <i>Physical Review B - Condensed Matter and Materials Physics</i>. 2011;84(4).
    doi:<a href="https://doi.org/10.1103/PhysRevB.84.041104">10.1103/PhysRevB.84.041104</a>
  apa: Alpichshev, Z., Analytis, J. G., Chu, J. H., Fisher, I. R., &#38; Kapitulnik,
    A. (2011). STM imaging of a bound state along a step on the surface of the topological
    insulator Bi2Te3. <i>Physical Review B - Condensed Matter and Materials Physics</i>.
    American Physical Society. <a href="https://doi.org/10.1103/PhysRevB.84.041104">https://doi.org/10.1103/PhysRevB.84.041104</a>
  chicago: Alpichshev, Zhanybek, J G Analytis, J H Chu, I R Fisher, and A Kapitulnik.
    “STM Imaging of a Bound State along a Step on the Surface of the Topological Insulator
    Bi2Te3.” <i>Physical Review B - Condensed Matter and Materials Physics</i>. American
    Physical Society, 2011. <a href="https://doi.org/10.1103/PhysRevB.84.041104">https://doi.org/10.1103/PhysRevB.84.041104</a>.
  ieee: Z. Alpichshev, J. G. Analytis, J. H. Chu, I. R. Fisher, and A. Kapitulnik,
    “STM imaging of a bound state along a step on the surface of the topological insulator
    Bi2Te3,” <i>Physical Review B - Condensed Matter and Materials Physics</i>, vol.
    84, no. 4. American Physical Society, 2011.
  ista: Alpichshev Z, Analytis JG, Chu JH, Fisher IR, Kapitulnik A. 2011. STM imaging
    of a bound state along a step on the surface of the topological insulator Bi2Te3.
    Physical Review B - Condensed Matter and Materials Physics. 84(4).
  mla: Alpichshev, Zhanybek, et al. “STM Imaging of a Bound State along a Step on
    the Surface of the Topological Insulator Bi2Te3.” <i>Physical Review B - Condensed
    Matter and Materials Physics</i>, vol. 84, no. 4, American Physical Society, 2011,
    doi:<a href="https://doi.org/10.1103/PhysRevB.84.041104">10.1103/PhysRevB.84.041104</a>.
  short: Z. Alpichshev, J.G. Analytis, J.H. Chu, I.R. Fisher, A. Kapitulnik, Physical
    Review B - Condensed Matter and Materials Physics 84 (2011).
date_created: 2018-12-11T11:46:10Z
date_published: 2011-07-21T00:00:00Z
date_updated: 2021-01-12T07:52:44Z
day: '21'
doi: 10.1103/PhysRevB.84.041104
extern: '1'
external_id:
  arxiv:
  - '1003.2233'
intvolume: '        84'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://arxiv.org/abs/1003.2233
month: '07'
oa: 1
oa_version: Preprint
publication: Physical Review B - Condensed Matter and Materials Physics
publication_status: published
publisher: American Physical Society
publist_id: '7443'
quality_controlled: '1'
status: public
title: STM imaging of a bound state along a step on the surface of the topological
  insulator Bi2Te3
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 84
year: '2011'
...
---
_id: '3965'
abstract:
- lang: eng
  text: The elevation function on a smoothly embedded 2-manifold in R-3 reflects the
    multiscale topography of cavities and protrusions as local maxima. The function
    has been useful in identifying coarse docking configurations for protein pairs.
    Transporting the concept from the smooth to the piecewise linear category, this
    paper describes an algorithm for finding all local maxima. While its worst-case
    running time is the same as of the algorithm used in prior work, its performance
    in practice is orders of magnitudes superior. We cast light on this improvement
    by relating the running time to the total absolute Gaussian curvature of the 2-manifold.
author:
- first_name: Bei
  full_name: Wang, Bei
  last_name: Wang
- first_name: Herbert
  full_name: Edelsbrunner, Herbert
  id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
  last_name: Edelsbrunner
  orcid: 0000-0002-9823-6833
- first_name: Dmitriy
  full_name: Morozov, Dmitriy
  last_name: Morozov
citation:
  ama: Wang B, Edelsbrunner H, Morozov D. Computing elevation maxima by searching
    the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. 2011;16(2.2):1-13.
    doi:<a href="https://doi.org/10.1145/1963190.1970375">10.1145/1963190.1970375</a>
  apa: Wang, B., Edelsbrunner, H., &#38; Morozov, D. (2011). Computing elevation maxima
    by searching the Gauss sphere. <i>Journal of Experimental Algorithmics</i>. ACM.
    <a href="https://doi.org/10.1145/1963190.1970375">https://doi.org/10.1145/1963190.1970375</a>
  chicago: Wang, Bei, Herbert Edelsbrunner, and Dmitriy Morozov. “Computing Elevation
    Maxima by Searching the Gauss Sphere.” <i>Journal of Experimental Algorithmics</i>.
    ACM, 2011. <a href="https://doi.org/10.1145/1963190.1970375">https://doi.org/10.1145/1963190.1970375</a>.
  ieee: B. Wang, H. Edelsbrunner, and D. Morozov, “Computing elevation maxima by searching
    the Gauss sphere,” <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2.
    ACM, pp. 1–13, 2011.
  ista: Wang B, Edelsbrunner H, Morozov D. 2011. Computing elevation maxima by searching
    the Gauss sphere. Journal of Experimental Algorithmics. 16(2.2), 1–13.
  mla: Wang, Bei, et al. “Computing Elevation Maxima by Searching the Gauss Sphere.”
    <i>Journal of Experimental Algorithmics</i>, vol. 16, no. 2.2, ACM, 2011, pp.
    1–13, doi:<a href="https://doi.org/10.1145/1963190.1970375">10.1145/1963190.1970375</a>.
  short: B. Wang, H. Edelsbrunner, D. Morozov, Journal of Experimental Algorithmics
    16 (2011) 1–13.
date_created: 2018-12-11T12:06:09Z
date_published: 2011-05-01T00:00:00Z
date_updated: 2021-01-12T07:53:31Z
day: '01'
department:
- _id: HeEd
doi: 10.1145/1963190.1970375
intvolume: '        16'
issue: '2.2'
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 13
publication: Journal of Experimental Algorithmics
publication_status: published
publisher: ACM
publist_id: '2161'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing elevation maxima by searching the Gauss sphere
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 16
year: '2011'
...
---
OA_place: publisher
_id: '3275'
abstract:
- lang: eng
  text: 'Chemokines organize immune cell trafficking by inducing either directed (tactic)
    or random (kinetic) migration and by activating integrins in order to support
    surface adhesion (haptic). Beyond that the same chemokines can establish clearly
    defined functional areas in secondary lymphoid organs. Until now it is unclear
    how chemokines can fulfill such diverse functions. One decisive prerequisite to
    explain these capacities is to know how chemokines are presented in tissue. In
    theory chemokines could occur either soluble or immobilized, and could be distributed
    either homogenously or as a concentration gradient. To dissect if and how the
    presenting mode of chemokines influences immune cells, I tested the response of
    dendritic cells (DCs) to differentially displayed chemokines. DCs are antigen
    presenting cells that reside in the periphery and migrate into draining lymph
    nodes (LNs) once exposed to inflammatory stimuli to activate naïve T cells. DCs
    are guided to and within the LN by the chemokine receptor CCR7, which has two
    ligands, the chemokines CCL19 and CCL21. Both CCR7 ligands are expressed by fibroblastic
    reticular cells in the LN, but differ in their ability to bind to heparan sulfate
    residues. CCL21 has a highly charged C-terminal extension, which mediates binding
    to anionic surfaces, whereas CCL19 is lacking such residues and likely distributes
    as a soluble molecule. This study shows that surface-bound CCL21 causes random,
    haptokinetic DC motility, which is confined to the chemokine coated area by insideout
    activation of β2 integrins that mediate cell binding to the surface. CCL19 on
    the other hand forms concentration gradients which trigger directional, chemotactic
    movement, but no surface adhesion. In addition DCs can actively manipulate this
    system by recruiting and activating serine proteases on their surfaces, which
    create - by proteolytically removing the adhesive C-terminus - a solubilized variant
    of CCL21 that functionally resembles CCL19. By generating a CCL21 concentration
    gradient DCs establish a positive feedback loop to recruit further DCs from the
    periphery to the CCL21 coated region. In addition DCs can sense chemotactic gradients
    as well as immobilized haptokinetic fields at the same time and integrate these
    signals. The result is chemotactically biased haptokinesis - directional migration
    confined to a chemokine coated track or area - which could explain the dynamic
    but spatially tightly controlled swarming leukocyte locomotion patterns that have
    been observed in lymphatic organs by intravital microscopists. The finding that
    DCs can approach soluble cues in a non-adhesive manner while they attach to surfaces
    coated with immobilized cues raises the question how these cells transmit intracellular
    forces to the environment, especially in the non-adherent migration mode. In order
    to migrate, cells have to generate and transmit force to the extracellular substrate.
    Force transmission is the prerequisite to procure an expansion of the leading
    edge and a forward motion of the whole cell body. In the current conceptions actin
    polymerization at the leading edge is coupled to extracellular ligands via the
    integrin family of transmembrane receptors, which allows the transmission of intracellular
    force. Against the paradigm of force transmission during migration, leukocytes,
    like DCs, are able to migrate in threedimensional environments without using integrin
    transmembrane receptors (Lämmermann et al., 2008). This reflects the biological
    function of leukocytes, as they can invade almost all tissues, whereby their migration
    has to be independent from the extracellular environment. How the cells can achieve
    this is unclear. For this study I examined DC migration in a defined threedimensional
    environment and highlighted actin-dynamics with the probe Lifeact-GFP. The result
    was that chemotactic DCs can switch between integrin-dependent and integrin- independent
    locomotion and can thereby adapt to the adhesive properties of their environment.
    If the cells are able to couple their actin cytoskeleton to the substrate, actin
    polymerization is entirely converted into protrusion. Without coupling the actin
    cortex undergoes slippage and retrograde actin flow can be observed. But retrograde
    actin flow can be completely compensated by higher actin polymerization rate keeping
    the migration velocity and the shape of the cells unaltered. Mesenchymal cells
    like fibroblast cannot balance the loss of adhesive interaction, cannot protrude
    into open space and, therefore, strictly depend on integrinmediated force coupling.
    This leukocyte specific phenomenon of “adaptive force transmission” endows these
    cells with the unique ability to transit and invade almost every type of tissue. '
acknowledgement: "I would like to express my sincere gratitude to the following people
  who made with their continuous support and encouragement this thesis possible: First,
  I want to thank Prof. Dr. Michael Sixt for his excellent supervision and mentoring,
  especially for the nice, relaxed working atmosphere, a lot of brilliant ideas and
  the freedom to work in my own way.\r\n\r\nProf. Dr. Reinhard Fässler for his constant
  support of the Sixt lab and for providing excellent working conditions. \r\n\r\nProf.
  Dr. Sanjiv Luther and Prof. Dr. Tobias Bollenbach for agreeing to be member of my
  thesis committee and to evaluate my work.\r\n\r\nDr. Walther Göhring, Carmen Schmitz,
  the Recombinant Protein Production core facility and the animal care takers for
  providing the “infrastructure” for this thesis. \r\n\r\nProf. Dr. Daniel Legler,
  Markus Bruckner and Dr. Julien Polleux for very fruitful collaborations and discussions.\r\n\r\nMy
  labmates for their help, a lot of discussions and to make the Sixt lab to a convenient
  place to work : Karin Hirsch, Tim Lämmeramnn, Holger Pflicke, Jörg Renkawitz, Michele
  Weber and Alexander Eichner All members of the Department of Molecular Medicine
  for their help. Especially I want to thank Sarah Schmidt, Karin Hirsch and Raphael
  Ruppert for their friendship, nice chats and their uncensored point of view. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Kathrin
  full_name: Schumann, Kathrin
  id: F44D762E-4F9D-11E9-B64C-9EB26CEFFB5F
  last_name: Schumann
citation:
  ama: Schumann K. The role of chemotactic gradients in dendritic cell migration.
    2011.
  apa: Schumann, K. (2011). <i>The role of chemotactic gradients in dendritic cell
    migration</i>. Institute of Science and Technology Austria.
  chicago: Schumann, Kathrin. “The Role of Chemotactic Gradients in Dendritic Cell
    Migration.” Institute of Science and Technology Austria, 2011.
  ieee: K. Schumann, “The role of chemotactic gradients in dendritic cell migration,”
    Institute of Science and Technology Austria, 2011.
  ista: Schumann K. 2011. The role of chemotactic gradients in dendritic cell migration.
    Institute of Science and Technology Austria.
  mla: Schumann, Kathrin. <i>The Role of Chemotactic Gradients in Dendritic Cell Migration</i>.
    Institute of Science and Technology Austria, 2011.
  short: K. Schumann, The Role of Chemotactic Gradients in Dendritic Cell Migration,
    Institute of Science and Technology Austria, 2011.
corr_author: '1'
date_created: 2018-12-11T12:02:24Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2026-04-09T14:36:24Z
day: '01'
ddc:
- '570'
- '579'
degree_awarded: PhD
department:
- _id: MiSi
file:
- access_level: closed
  checksum: e69eee6252660f0b694a2ea8923ddc72
  content_type: application/pdf
  creator: dernst
  date_created: 2019-03-26T08:12:21Z
  date_updated: 2020-07-14T12:46:06Z
  file_id: '6177'
  file_name: 2011_Thesis_Kathrin_Schumann.pdf
  file_size: 4487708
  relation: main_file
- access_level: open_access
  checksum: 71727d63f424b5b446f68f4b87ecadc0
  content_type: application/pdf
  creator: dernst
  date_created: 2021-02-22T11:24:30Z
  date_updated: 2021-02-22T11:24:30Z
  file_id: '9175'
  file_name: 2011_Thesis_Schumann_noS.pdf
  file_size: 4313127
  relation: main_file
  success: 1
file_date_updated: 2021-02-22T11:24:30Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '141'
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '3371'
pubrep_id: '11'
status: public
supervisor:
- first_name: Michael K
  full_name: Sixt, Michael K
  id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
  last_name: Sixt
  orcid: 0000-0002-6620-9179
title: The role of chemotactic gradients in dendritic cell migration
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2011'
...
---
OA_place: publisher
_id: '3273'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Jean-Léon
  full_name: Maître, Jean-Léon
  id: 48F1E0D8-F248-11E8-B48F-1D18A9856A87
  last_name: Maître
  orcid: 0000-0002-3688-1474
citation:
  ama: Maître J-L. Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors.
    2011.
  apa: Maître, J.-L. (2011). <i>Mechanics of adhesion and de‐adhesion in zebrafish
    germ layer progenitors</i>. Institute of Science and Technology Austria.
  chicago: Maître, Jean-Léon. “Mechanics of Adhesion and De‐adhesion in Zebrafish
    Germ Layer Progenitors.” Institute of Science and Technology Austria, 2011.
  ieee: J.-L. Maître, “Mechanics of adhesion and de‐adhesion in zebrafish germ layer
    progenitors,” Institute of Science and Technology Austria, 2011.
  ista: Maître J-L. 2011. Mechanics of adhesion and de‐adhesion in zebrafish germ
    layer progenitors. Institute of Science and Technology Austria.
  mla: Maître, Jean-Léon. <i>Mechanics of Adhesion and De‐adhesion in Zebrafish Germ
    Layer Progenitors</i>. Institute of Science and Technology Austria, 2011.
  short: J.-L. Maître, Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer
    Progenitors, Institute of Science and Technology Austria, 2011.
corr_author: '1'
date_created: 2018-12-11T12:02:23Z
date_published: 2011-12-12T00:00:00Z
date_updated: 2026-04-09T14:36:45Z
day: '12'
degree_awarded: PhD
department:
- _id: CaHe
language:
- iso: eng
month: '12'
oa_version: None
publication_identifier:
  issn:
  - 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '3373'
status: public
supervisor:
- first_name: Carl-Philipp J
  full_name: Heisenberg, Carl-Philipp J
  id: 39427864-F248-11E8-B48F-1D18A9856A87
  last_name: Heisenberg
  orcid: 0000-0002-0912-4566
title: Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2011'
...
---
_id: '9648'
abstract:
- lang: eng
  text: In this paper, we establish a correspondence between the incremental algorithm
    for computing AT-models [8,9] and the one for computing persistent homology [6,14,15].
    We also present a decremental algorithm for computing AT-models that allows to
    extend the persistence computation to a wider setting. Finally, we show how to
    combine incremental and decremental techniques for persistent homology computation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Rocio
  full_name: Gonzalez-Diaz, Rocio
  last_name: Gonzalez-Diaz
- first_name: Adrian
  full_name: Ion, Adrian
  id: 29F89302-F248-11E8-B48F-1D18A9856A87
  last_name: Ion
- first_name: Maria Jose
  full_name: Jimenez, Maria Jose
  last_name: Jimenez
- first_name: Regina
  full_name: Poyatos, Regina
  last_name: Poyatos
citation:
  ama: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. Incremental-decremental algorithm
    for computing AT-models and persistent homology. In: <i>Computer Analysis of Images
    and Patterns</i>. Vol 6854. Springer Nature; 2011:286-293. doi:<a href="https://doi.org/10.1007/978-3-642-23672-3_35">10.1007/978-3-642-23672-3_35</a>'
  apa: 'Gonzalez-Diaz, R., Ion, A., Jimenez, M. J., &#38; Poyatos, R. (2011). Incremental-decremental
    algorithm for computing AT-models and persistent homology. In <i>Computer Analysis
    of Images and Patterns</i> (Vol. 6854, pp. 286–293). Seville, Spain: Springer
    Nature. <a href="https://doi.org/10.1007/978-3-642-23672-3_35">https://doi.org/10.1007/978-3-642-23672-3_35</a>'
  chicago: Gonzalez-Diaz, Rocio, Adrian Ion, Maria Jose Jimenez, and Regina Poyatos.
    “Incremental-Decremental Algorithm for Computing AT-Models and Persistent Homology.”
    In <i>Computer Analysis of Images and Patterns</i>, 6854:286–93. Springer Nature,
    2011. <a href="https://doi.org/10.1007/978-3-642-23672-3_35">https://doi.org/10.1007/978-3-642-23672-3_35</a>.
  ieee: R. Gonzalez-Diaz, A. Ion, M. J. Jimenez, and R. Poyatos, “Incremental-decremental
    algorithm for computing AT-models and persistent homology,” in <i>Computer Analysis
    of Images and Patterns</i>, Seville, Spain, 2011, vol. 6854, pp. 286–293.
  ista: 'Gonzalez-Diaz R, Ion A, Jimenez MJ, Poyatos R. 2011. Incremental-decremental
    algorithm for computing AT-models and persistent homology. Computer Analysis of
    Images and Patterns. CAIP: International Conference on Computer Analysis of Images
    and Patterns, LNCS, vol. 6854, 286–293.'
  mla: Gonzalez-Diaz, Rocio, et al. “Incremental-Decremental Algorithm for Computing
    AT-Models and Persistent Homology.” <i>Computer Analysis of Images and Patterns</i>,
    vol. 6854, Springer Nature, 2011, pp. 286–93, doi:<a href="https://doi.org/10.1007/978-3-642-23672-3_35">10.1007/978-3-642-23672-3_35</a>.
  short: R. Gonzalez-Diaz, A. Ion, M.J. Jimenez, R. Poyatos, in:, Computer Analysis
    of Images and Patterns, Springer Nature, 2011, pp. 286–293.
conference:
  end_date: 2011-08-31
  location: Seville, Spain
  name: 'CAIP: International Conference on Computer Analysis of Images and Patterns'
  start_date: 2011-08-29
date_created: 2021-07-11T22:01:19Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2026-04-16T10:09:19Z
day: '01'
department:
- _id: HeEd
doi: 10.1007/978-3-642-23672-3_35
intvolume: '      6854'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: http://hdl.handle.net/11441/30766
month: '08'
oa: 1
oa_version: Published Version
page: 286-293
publication: Computer Analysis of Images and Patterns
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783642236716'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental-decremental algorithm for computing AT-models and persistent homology
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 6854
year: '2011'
...
---
_id: '3315'
abstract:
- lang: eng
  text: We consider two-player games played in real time on game structures with clocks
    where the objectives of players are described using parity conditions. The games
    are concurrent in that at each turn, both players independently propose a time
    delay and an action, and the action with the shorter delay is chosen. To prevent
    a player from winning by blocking time, we restrict each player to play strategies
    that ensure that the player cannot be responsible for causing a zeno run. First,
    we present an efficient reduction of these games to turn-based (i.e., not concurrent)
    finite-state (i.e., untimed) parity games. Our reduction improves the best known
    complexity for solving timed parity games. Moreover, the rich class of algorithms
    for classical parity games can now be applied to timed parity games. The states
    of the resulting game are based on clock regions of the original game, and the
    state space of the finite game is linear in the size of the region graph. Second,
    we consider two restricted classes of strategies for the player that represents
    the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust
    winning strategies. Using a limit-robust winning strategy, the controller cannot
    choose an exact real-valued time delay but must allow for some nonzero jitter
    in each of its actions. If there is a given lower bound on the jitter, then the
    strategy is bounded-robust winning. We show that exact strategies are more powerful
    than limit-robust strategies, which are more powerful than bounded-robust winning
    strategies for any bound. For both kinds of robust strategies, we present efficient
    reductions to standard timed automaton games. These reductions provide algorithms
    for the synthesis of robust real-time controllers.
author:
- first_name: Krishnendu
  full_name: Chatterjee, Krishnendu
  id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
  last_name: Chatterjee
  orcid: 0000-0002-4561-241X
- 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: Vinayak
  full_name: Prabhu, Vinayak
  last_name: Prabhu
citation:
  ama: 'Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness.
    <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href="https://doi.org/10.2168/LMCS-7(4:8)2011">10.2168/LMCS-7(4:8)2011</a>'
  apa: 'Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games:
    Complexity and robustness. <i>Logical Methods in Computer Science</i>. International
    Federation of Computational Logic. <a href="https://doi.org/10.2168/LMCS-7(4:8)2011">https://doi.org/10.2168/LMCS-7(4:8)2011</a>'
  chicago: 'Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed
    Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>.
    International Federation of Computational Logic, 2011. <a href="https://doi.org/10.2168/LMCS-7(4:8)2011">https://doi.org/10.2168/LMCS-7(4:8)2011</a>.'
  ieee: 'K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity
    and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International
    Federation of Computational Logic, 2011.'
  ista: 'Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity
    and robustness. Logical Methods in Computer Science. 7(4).'
  mla: 'Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.”
    <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation
    of Computational Logic, 2011, doi:<a href="https://doi.org/10.2168/LMCS-7(4:8)2011">10.2168/LMCS-7(4:8)2011</a>.'
  short: K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science
    7 (2011).
corr_author: '1'
date_created: 2018-12-11T12:02:37Z
date_published: 2011-12-14T00:00:00Z
date_updated: 2026-05-22T08:46:08Z
day: '14'
ddc:
- '000'
- '005'
department:
- _id: KrCh
- _id: ToHe
doi: 10.2168/LMCS-7(4:8)2011
ec_funded: 1
file:
- access_level: open_access
  checksum: 3480e1594bbef25ff7462fa93a8a814e
  content_type: application/pdf
  creator: system
  date_created: 2018-12-12T10:16:42Z
  date_updated: 2020-07-14T12:46:07Z
  file_id: '5231'
  file_name: IST-2016-86-v2+1_1011.0688_3_.pdf
  file_size: 588863
  relation: main_file
file_date_updated: 2020-07-14T12:46:07Z
has_accepted_license: '1'
intvolume: '         7'
issue: '4'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
  call_identifier: FP7
  grant_number: '215543'
  name: COMponent-Based Embedded Systems design Techniques
publication: Logical Methods in Computer Science
publication_status: published
publisher: International Federation of Computational Logic
publist_id: '3324'
pubrep_id: '506'
quality_controlled: '1'
related_material:
  record:
  - id: '3876'
    relation: earlier_version
    status: public
scopus_import: 1
status: public
title: 'Timed parity games: Complexity and robustness'
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2011'
...
---
_id: '2701'
abstract:
- lang: eng
  text: We consider N × N Hermitian random matrices with independent identically distributed
    entries (Wigner matrices). The matrices are normalized so that the average spacing
    between consecutive eigenvalues is of order 1/ N. Under suitable assumptions on
    the distribution of the single matrix element, we first prove that, away from
    the spectral edges, the empirical density of eigenvalues concentrates around the
    Wigner semicircle law on energy scales η ≫ N -1. This result establishes the semicircle
    law on the optimal scale and it removes a logarithmic factor from our previous
    result [6]. We then show a Wegner estimate, i.e., that the averaged density of
    states is bounded. Finally, we prove that the eigenvalues of a Wigner matrix repel
    each other, in agreement with the universality conjecture.
author:
- first_name: László
  full_name: László Erdös
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Benjamin
  full_name: Schlein, Benjamin
  last_name: Schlein
- first_name: Horng
  full_name: Yau, Horng-Tzer
  last_name: Yau
citation:
  ama: Erdös L, Schlein B, Yau H. Wegner estimate and level repulsion for Wigner random
    matrices. <i>International Mathematics Research Notices</i>. 2010;(3):436-479.
    doi:<a href="https://doi.org/10.1093/imrn/rnp136">10.1093/imrn/rnp136</a>
  apa: Erdös, L., Schlein, B., &#38; Yau, H. (2010). Wegner estimate and level repulsion
    for Wigner random matrices. <i>International Mathematics Research Notices</i>.
    Oxford University Press. <a href="https://doi.org/10.1093/imrn/rnp136">https://doi.org/10.1093/imrn/rnp136</a>
  chicago: Erdös, László, Benjamin Schlein, and Horng Yau. “Wegner Estimate and Level
    Repulsion for Wigner Random Matrices.” <i>International Mathematics Research Notices</i>.
    Oxford University Press, 2010. <a href="https://doi.org/10.1093/imrn/rnp136">https://doi.org/10.1093/imrn/rnp136</a>.
  ieee: L. Erdös, B. Schlein, and H. Yau, “Wegner estimate and level repulsion for
    Wigner random matrices,” <i>International Mathematics Research Notices</i>, no.
    3. Oxford University Press, pp. 436–479, 2010.
  ista: Erdös L, Schlein B, Yau H. 2010. Wegner estimate and level repulsion for Wigner
    random matrices. International Mathematics Research Notices. (3), 436–479.
  mla: Erdös, László, et al. “Wegner Estimate and Level Repulsion for Wigner Random
    Matrices.” <i>International Mathematics Research Notices</i>, no. 3, Oxford University
    Press, 2010, pp. 436–79, doi:<a href="https://doi.org/10.1093/imrn/rnp136">10.1093/imrn/rnp136</a>.
  short: L. Erdös, B. Schlein, H. Yau, International Mathematics Research Notices
    (2010) 436–479.
date_created: 2018-12-11T11:59:09Z
date_published: 2010-01-01T00:00:00Z
date_updated: 2021-01-12T06:59:09Z
day: '01'
doi: 10.1093/imrn/rnp136
extern: 1
issue: '3'
main_file_link:
- open_access: '1'
  url: http://arxiv.org/abs/0811.2591
month: '01'
oa: 1
page: 436 - 479
publication: International Mathematics Research Notices
publication_status: published
publisher: Oxford University Press
publist_id: '4195'
quality_controlled: 0
status: public
title: Wegner estimate and level repulsion for Wigner random matrices
type: journal_article
year: '2010'
...
---
_id: '2704'
abstract:
- lang: eng
  text: Consider a system of N bosons in three dimensions interacting via a repulsive
    short range pair potential N2V(N(xi-xj)), where x = (x1, ..., xN) denotes the
    positions of the particles. Let HN, denote the Hamiltonian of the system and let
    ψN,t be the solution to the Schrödinger equation. Suppose that the initial data
    ψN,0 satisfies the energy condition 〈 ψ N,0,Hk N ψN,0〉 ≤ CkNk for k =1, 2, ....We
    also assume that the k-particle density matrices of the initial state are asymptotically
    factorized as N →∞1. We prove that the k-particle density matrices of ψN,t are
    also asymptotically factorized and the one particle orbital wave function solves
    the Gross-Pitaevskii equation, a cubic nonlinear Schrödinger equation with the
    coupling constant given by the scattering length of the potential V. We also prove
    the same conclusion if the energy condition holds only for k=1 but the factorization
    of ψN,0 is assumed in a stronger sense.
author:
- first_name: László
  full_name: László Erdös
  id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
  last_name: Erdös
  orcid: 0000-0001-5366-9603
- first_name: Benjamin
  full_name: Schlein, Benjamin
  last_name: Schlein
- first_name: Horng
  full_name: Yau, Horng-Tzer
  last_name: Yau
citation:
  ama: Erdös L, Schlein B, Yau H. Derivation of the Gross-Pitaevskii equation for
    the dynamics of Bose-Einstein condensate. <i>Annals of Mathematics</i>. 2010;172(1):291-370.
    doi:<a href="https://doi.org/10.4007/annals.2010.172.291">10.4007/annals.2010.172.291</a>
  apa: Erdös, L., Schlein, B., &#38; Yau, H. (2010). Derivation of the Gross-Pitaevskii
    equation for the dynamics of Bose-Einstein condensate. <i>Annals of Mathematics</i>.
    Princeton University Press. <a href="https://doi.org/10.4007/annals.2010.172.291">https://doi.org/10.4007/annals.2010.172.291</a>
  chicago: Erdös, László, Benjamin Schlein, and Horng Yau. “Derivation of the Gross-Pitaevskii
    Equation for the Dynamics of Bose-Einstein Condensate.” <i>Annals of Mathematics</i>.
    Princeton University Press, 2010. <a href="https://doi.org/10.4007/annals.2010.172.291">https://doi.org/10.4007/annals.2010.172.291</a>.
  ieee: L. Erdös, B. Schlein, and H. Yau, “Derivation of the Gross-Pitaevskii equation
    for the dynamics of Bose-Einstein condensate,” <i>Annals of Mathematics</i>, vol.
    172, no. 1. Princeton University Press, pp. 291–370, 2010.
  ista: Erdös L, Schlein B, Yau H. 2010. Derivation of the Gross-Pitaevskii equation
    for the dynamics of Bose-Einstein condensate. Annals of Mathematics. 172(1), 291–370.
  mla: Erdös, László, et al. “Derivation of the Gross-Pitaevskii Equation for the
    Dynamics of Bose-Einstein Condensate.” <i>Annals of Mathematics</i>, vol. 172,
    no. 1, Princeton University Press, 2010, pp. 291–370, doi:<a href="https://doi.org/10.4007/annals.2010.172.291">10.4007/annals.2010.172.291</a>.
  short: L. Erdös, B. Schlein, H. Yau, Annals of Mathematics 172 (2010) 291–370.
date_created: 2018-12-11T11:59:10Z
date_published: 2010-07-01T00:00:00Z
date_updated: 2021-01-12T06:59:10Z
day: '01'
doi: 10.4007/annals.2010.172.291
extern: 1
intvolume: '       172'
issue: '1'
main_file_link:
- open_access: '0'
  url: http://xxx.lanl.gov/abs/math-ph/0606017
month: '07'
page: 291 - 370
publication: Annals of Mathematics
publication_status: published
publisher: Princeton University Press
publist_id: '4192'
quality_controlled: 0
status: public
title: Derivation of the Gross-Pitaevskii equation for the dynamics of Bose-Einstein
  condensate
type: journal_article
volume: 172
year: '2010'
...
