A common developmental process, called branching morphogenesis, generates the epithelial trees in a variety of organs, including lungs, kidneys, and glands. How morphogenesis can create architectures very different shapes functions remains elusive. In this review, we compare its regulation lungs kidneys discuss role signaling pathways, mesenchyme, extracellular matrix, cytoskeleton as potential...

Two types of branching grammars are introduced inspired from Havel's works about branching automata. They naturally define two infinite hierarchies into the family of regular, respectively, linear languages. Homomorphic characterisations of regular and linear languages >n terms of branching languages are obtained. Finally, the relations between branching grammars and contextual grammars of [5] ...

We study the impact of having a non-spatial branching mechanism with infinite variance on some parameters (height, width and first hitting time) of an underlying Bienaymé-Galton-Watson branching process. Aiming at providing a comparative study of the spread of an epidemics whose dynamics is given by the modulus of a branching Brownian motion (BBM) we then consider spatial branching processes in...

Branching programs are a well-established computation model for boolean functions, especially read-once branching programs have been studied intensively. Exponential lower bounds for deterministic and nondeterministic read-once branching programs are known for a long time. On the other hand, the problem of proving superpolynomial lower bounds for parity read-once branching programs is still ope...

We study the impact on shape parameters of an underlying Bienaymé-Galton-Watson branching process (height, width and first hitting time), of having a non-spatial branching mechanism with infinite variance. Aiming at providing a comparative study of the spread of an epidemics whose dynamics is given by the modulus of a branching Brownian motion (BBM) we then consider spatial branching processes ...

Most state-of-the-art satisfiability (SAT) solvers are capable of solving large application instances with efficient branching heuristics. The VSIDS heuristic is widely used because of its robustness. This paper focuses on the inherent ties in VSIDS and proposes a new branching heuristic called TBVSIDS, which attempts to break the ties with the consideration of the interplay between the branchi...

This thesis proposes using an integrated hardware-software solution for improving Single-Instruction Multiple-Thread branching efficiency. Unlike current SIMT hardware branching architectures, this hardware-software solution allows programmers the ability to fine tune branching behavior for their application or allow the compiler to implement a generic software solution. To support a wide range...