One of the central questions of developmental biology is how cells of equivalent potential-an equivalence group-come to adopt specific cellular fates. In this study we have used a combination of live imaging, single cell lineage analyses, and perturbation of specific signaling pathways to dissect the specification of the adaxial cells of the zebrafish embryo. We show that the adaxial cells are ...

An equivalence graph is a disjoint union of cliques. For a graph G let eq(G) be the minimum number of equivalence subgraphs of G needed to cover all edges of G. We call eq( G) the equivalence covering number of G. It was shown in [ 81 that computing the equivalence covering number is NP-hard, even when restricted to graphs in which no two triangles have a vertex in common. We show that the equi...

Any belief function can be decomposed into a confidence and a diffidence components. Each components is uniquely decomposable into simple support functions that represent the impact of the simplest form of evidence, the one that only partially supports a given subset of the frame of discernment. The nature of the inverse of Dempster's rule of combination is detailed. The confidence component tr...

We prove that various concrete analytic equivalence relations arising in model theory or analysis are complete, i.e. maximum in the Borel reducibility ordering. The proofs use some general results concerning the wider class of analytic quasi-orders.

The paper presents a selection of recently developed and/or used techniques for equivalencechecking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004).

We provide a very simple model of a reeective facility based on the pure-calculus, and we show that its theory of contextual equivalence is trivial: two terms in the language are contextually equivalent ii they are-congruent.

In this draft we extend the theoretical development in [1, Appendix C] to enable the Decomposition Algorithm to compute equilibria with arbitrary accuracy.