Angiostrongylus cantonensis: morphological and behavioral investigation within the freshwater snail Pomacea canaliculata

An infection with Angiostrongylus cantonensis, the main causative agent for human eosinophilic encephalitis, can be acquired through the consumption of the freshwater snail Pomacea canaliculata. This snail also provides a suitable model to study the developmental morphology and behavior of A. cantonensis larvae, facilitated by the snail's distinct lung structure. We used microanatomy for studying the natural appearance and behavior of A. cantonensis larvae while developing within P. canaliculata. The distribution of refractile granules in the larval body and characteristic head structures changed during the developmental cycle. Two well-developed, rod-like structures with expanded knob-like tips at the anterior part were observed under the buccal cavity as early as the late second developmental stage. A "T”-shaped structure at the anterior end and its tenacity distinguished the outer sheath from that shed during the second molting. Early first-stage larvae obtained from fresh rat feces are free moving and characterized by a coiled tail, whereas a mellifluous "Q”-movement was the behavioral trait of third-stage A. cantonensis larvae outside the host tissue. In combination, the distribution of refractive granules, distinct head features, variations in sheaths, and behavioral characteristics can be utilized for differentiation of larval stages, and for distinguishing A. cantonensis larvae from those of other free-living nematode

A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network

This paper is concerned with the scheduling of Electrical Multiple Units (EMUs) under the condition of their utilization on one sector or within several interacting sectors. Based on the introduction of the train connection graph which describes the possible connection relationship between trains, the integer programming model of EMU circulation planning is constructed. In order to analyzing the resolution of the model, a heuristic which shares the characteristics with the existing methods is introduced first. This method consists of two stages: one is a greedy strategy to construct a feasible circulation plan fragment, and another is to apply a stochastic disturbance to it to generate a whole feasible solution or get a new feasible solution. Then, an exact branch and bound method which is based on graph designing is proposed. Due to the complexity, the lower bound is computed through a polynomial approximation algorithm which is a modification from the one solving the degree constraint minimum 1-tree problem. Then, a branching strategy is designed to cope with the maintenance constraints. Finally, we report extensive computational results on a railway corridor in which the sectors possess the basic feature of railway networks