269 research outputs found

    G.M.C. Balayogi fish landing jetty, Savithri Nagar, Yanam, U.T. of Pondicherry

    Get PDF
    The Pondicherry Government took initiative to con- struct a fish landing jetty for the benefit of Savitrinagar and Bhairavapalem fishers named G.M.C. Balayogi fish landing jetty.At an average about 140 Trawlers utilize this facility for berthing and sale of fish

    Subventricular zone stem cells are heterogeneous with respect to their embryonic origins and neurogenic fates in the adult olfactory bulb

    Get PDF
    Wedetermined the embryonic origins of adult forebrain subventricular zone (SVZ) stem cells by Cre-lox fate mapping in transgenic mice. We found that all parts of the telencephalic neuroepithelium, including the medial ganglionic eminence and lateral ganglionic eminence (LGE) and the cerebral cortex, contribute multipotent, self-renewing stem cells to the adult SVZ. Descendants of the embryonic LGE and cortex settle in ventral and dorsal aspects of the dorsolateral SVZ, respectively. Both populations contribute new (5-bromo-2(')-deoxyuridine- labeled) tyrosine hydroxylase- and calretinin-positive interneurons to the adult olfactory bulb. However, calbindin-positive interneurons in the olfactory glomeruli were generated exclusively by LGE- derived stem cells. Thus, different SVZ stem cells have different embryonic origins, colonize different parts of the SVZ, and generate different neuronal progeny, suggesting that some aspects of embryonic patterning are preserved in the adult SVZ. This could have important implications for the design of endogenous stem cell-based therapies in the future

    On the recent Introduction of outboard engines along the Coromandal coast

    Get PDF
    Introduction of outboard engines along the Coromandal coast and Pondicherry were studied. A total number of 232 outboard engines have been introduced at 16 fish landing centres in the South Arcot District. The outboard engines are fitted exclusively to catamarans with a length range of 8-10 m operating mainly gill nets, Pannu valai and Mani valai and the encircling bag-net, Eda valai

    'Thoorivala' and its multi use

    Get PDF
    Thoorivalai' seems to be profitable as the man power used is less and catch landed is high. They get a large quantity of fish with a minimum of 600 kg to a maximum of 800 kg. The fishermen using this type of fishing at Kadathukkuppam (Tanjore Dt.) got a maximum of 700 kg fish by putting 9 hauls and engaging 10 persons a unit during July, 1988

    An instance of mass mortality in the Muttukadu farm near Madras during April 1983

    Get PDF
    An unusual mortality of fishes and other organisms was observed in the open site surrounding the farm at Mariculture Centre of CMFRI, Muttukadu.at 1983. During this season the prevailing high temperature and salinity and the enclosed nature of the water body, all resulted in an intense bloom of dinophytes. This led to oxygen depletion of the waters and then, very likely, of the mud. The regular operation of drag nets and gill nets has stirred up the mud and created large scale disturbance which, combined with the oxygen depletion, must have precipitated the crisis and led to the mortality of prawns and fishes

    Euclidean Greedy Drawings of Trees

    Full text link
    Greedy embedding (or drawing) is a simple and efficient strategy to route messages in wireless sensor networks. For each source-destination pair of nodes s, t in a greedy embedding there is always a neighbor u of s that is closer to t according to some distance metric. The existence of greedy embeddings in the Euclidean plane R^2 is known for certain graph classes such as 3-connected planar graphs. We completely characterize the trees that admit a greedy embedding in R^2. This answers a question by Angelini et al. (Graph Drawing 2009) and is a further step in characterizing the graphs that admit Euclidean greedy embeddings.Comment: Expanded version of a paper to appear in the 21st European Symposium on Algorithms (ESA 2013). 24 pages, 20 figure

    On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs

    Full text link
    In this paper we study the area requirements of planar greedy drawings of triconnected planar graphs. Cao, Strelzoff, and Sun exhibited a family H\cal H of subdivisions of triconnected plane graphs and claimed that every planar greedy drawing of the graphs in H\mathcal H respecting the prescribed plane embedding requires exponential area. However, we show that every nn-vertex graph in H\cal H actually has a planar greedy drawing respecting the prescribed plane embedding on an O(n)×O(n)O(n)\times O(n) grid. This reopens the question whether triconnected planar graphs admit planar greedy drawings on a polynomial-size grid. Further, we provide evidence for a positive answer to the above question by proving that every nn-vertex Halin graph admits a planar greedy drawing on an O(n)×O(n)O(n)\times O(n) grid. Both such results are obtained by actually constructing drawings that are convex and angle-monotone. Finally, we consider α\alpha-Schnyder drawings, which are angle-monotone and hence greedy if α30\alpha\leq 30^\circ, and show that there exist planar triangulations for which every α\alpha-Schnyder drawing with a fixed α<60\alpha<60^\circ requires exponential area for any resolution rule
    corecore