Learn More
Asymmetric cell division is a widespread mechanism in developing tissues that leads to the generation of cell diversity. In the embryonic central nervous system of Drosophila melanogaster, secondary precursor cells-ganglion mother cells (GMCs)-divide and produce postmitotic neurons that take on different cell fates. In this study, we show that binary fate(More)
The approximately 200 distinct neurons comprising each hemisegment of the Drosophila embryonic CNS are derived from a stereotypic array of approximately 30 progenitor stem cells, called neuroblasts (NBs). Each NB undergoes repeated asymmetric divisions to produce several smaller ganglion mother cells (GMCs), each of which, in turn, divides to produce two(More)
We have characterized two Drosophila POU genes designated dPOU-19 and dPOU-28. These genes are transcribed as 3.1- and 2.2-kilobase mRNAs, respectively, which accumulate maximally during the first 12 hr of embryogenesis. The mRNAs encode 601- and 475-amino acid deduced proteins; their POU domains are most related to those of the human OCT1 and OCT2. Both(More)
The Drosophila embryonic central nervous system (CNS) is derived from a stereotypic array of progenitor stem cells called neuroblasts (NBs). Each of the approximately 25 NBs per hemisegment undergoes repeated asymmetric divisions to produce, on average, 5-10 smaller ganglion mother cells (GMCs); each GMC, in turn, divides to produce two neurons. We(More)
—Seamless handover over multiple access points is highly desirable to mobile nodes, but ensuring security and efficiency of this process is challenging. This paper shows that prior handover authentication schemes incur high communication and computation costs, and are subject to a few security attacks. Further, a novel handover authentication protocol named(More)
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the el-liptic curve discrete logarithm problem (ECDLP) in small characteristic. However the claims of quasi-polynomial time attacks on the HFE systems and the subexponential time algorithm for the ECDLP depend on various heuristic(More)
In this correspondence, we present 129 new linear codes over F<sub>8</sub> and F<sub>9</sub> based on the construction by Xing and Niederreiter using algebraic function fields and places of small degrees. In addition, we construct some global function fields in which the number of rational places improves the lower bounds given by van der Geer and van der(More)
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gröbner basis computations and the heuristic first fall degree assumption and is not based on any heuristic. This method relies on the new concept of last fall degree. Let k be a finite field of cardinality q n and let k(More)