Search

What is already known on this topic? Triatomines, also known as kissing bugs, are widespread vectors for Chagas disease which affects 6–8 million people worldwide. Two species of triatomines have been previously reported in China. What is added by this report? This study showed data from the first investigation of triatomine distribution in China. Triatoma rubrofasciata and a novel species of triatomine in 170 habitats in 30 cities in southern China were recorded in this investigation. What are the implications for public health practice? Considering the worldwide spread of Chagas disease and new species of trypanosomiasis, strengthening the monitoring of triatomines and their associated diseases in southern China is vital to prevent and control these diseases.

We develop fast algorithms to construct space-optimal constrained 2D multibit tries for Internet packet classifier applications. Experimental evidence suggests that space-optimal 2D multibit tries and their extensions using a bucket scheme are superior to existing 2D and multidimensional packet classification schemes in terms of both memory requirement and number of memory accesses requirement. We propose a heuristic for 2D multibit tries with switch pointers, which may be used for 2D packet classification.

We develop algorithms for the compact representation of the 1- and 2-dimensional tries that are used for Internet packet classification. Our compact representations are experimentally compared with competing compact representations for 1- and multi-dimensional packet classifiers and found to simultaneously reduce the number of memory accesses required for a lookup as well as the memory required to store the classifier.

We propose heuristics for the construction of variable-stride one-dimensional as well as fixed and variable-stride two- dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The variable-stride one-dimensional tries constructed by our heuristic require significantly less per-stage memory than what is required by optimal pipelined fixed-stride tries. In addition, the pipelined two-dimensional multibit tries constructed by our proposed heuristics are superior, for pipelined architectures, to two-dimensional multibit tries constructed by the best algorithms proposed for nonpipelined architectures.

Objectives: The effectiveness of Gil-Vernet’s trigonoplasty, with technical modifications, was studied in treating vesicoureteral reflux (VUR) in neurogenic bladders. Methods: Modified Gil-Vernet’s trigonoplasty, making the transmural ureters advance over the midline and cross each other in the trigone, was applied in patients with neurogenic bladder dysfunction and VUR, diagnosed by voiding cystourethrogram. Most of the patients were sufficiently followed up by cystourethrogram. Results: 26 patients with neurogenic bladder dysfunction were diagnosed as having 43 refluxing units and underwent modified Gil-Vernet’s trigonoplasty. Reflux was grade I in 5 units, grade II in 7, grade III in 5, grade IV in 18, and grade V in 8, with unilateral reflux in 9 patients and bilateral reflux in 17. Surgery was successful in 95.3% of 43 refluxing units. 22 patients were followed 3–6 months after the operation, and the cure rate was 90.9% (no reflux under voiding cystourethrogram). 18 patients were followed up for more than 2 years without recurrence of VUR. Conclusions: Modified Gil-Vernet’s trigonoplasty might be a useful technique in the management of patients with VUR secondary to neurogenic bladder dysfunction.

ArcGIS Geoprocessing is an important part of ArcGIS, which is a large-scale geographic information system software launched by ESRI corporation. The ArcGIS Geoprocessing provides an application-oriented and Process-oriented spatial analysis modeling method, so it's a very useful assistant decision-making and programming tools. Project Site location is a typical multifactor comprehensive evaluation and decision-making based on geographic position. In this paper, we have taken a new paper mill site selection of somewhere for example, explored the basic approach and implementation technique of site selection decision-making supported by GIS, carried out the modeling of site selection based on ArcGIS Processing. Integrating the spatial analysis tools, such as buffer analysis, slope analysis, reclassify, raster-to-vector conversion, feature extraction, overlay analysis, space calculator and query and so on, into a workflow model, we realized the target extraction met some certain conditions. Then we selected the optimal area, which provided decision basis for the programming of paper mill.

In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based scheme, we implement a set associative SRAM based cache. We organize the IP routing table as a supernode tree (a tree bitmap structure) [5]. We add a small supernode cache in-between the processor and the low level memory containing the IP routing table in a tree structure. The supernode cache stores recently visited supernodes of the longest matched prefixes in the IP routing tree. A supernode hitting in the cache reduces the number of accesses to the low level memory, leading to a fast IP lookup. According to our simulations, up to 72% memory accesses can be avoided by a 128KB supernode cache for the selected three trace files. Average supernode cache miss ratio is as low as 4%. Compared to a TCAM with the same size, 77% of energy consumption can be reduced.

We develop algorithms for the compact representation of the trie structures that are used for Internet packet forwarding. Our compact representations are experimentally compared with competing compact representations for packet forwarding tables and found to simultaneously reduce the number of memory accesses required for a lookup as well as the memory required to store the forwarding table.

We propose heuristics for the construction of fixedand variable-stride two-dimensional multibit tries. These multibit tries are suitable for the classification of Internet packets using a pipelined architecture. The pipelined two-dimensional multibit tries constructed by our proposed heuristics are superior, for pipelined architectures, to twodimensional multibit tries constructed by the best algorithms proposed for non-pipelined architectures.

We propose a heuristic for the construction of variablestride multibit tries. These multibit tries are suitable for packet forwarding using a pipelined architecture. The variable-stride tries constructed by our heuristic require upto 1/32 of the per-stage memory required by optimal pipelined fixed-stride tries. We also develop a tree packing heuristic, which dramatically reduces the per-stage memory required by fixed- and variable-stride multibit tries constructed for pipelined architectures. On publicly available router databases, our tree packing heuristic reduces the maximum per-stage memory required by optimal pipelined fixed-stride tries

We develop fast algorithms to construct space-optimal constrained two-dimensional multibit tries for Internet packet classifier applications. Experimental evidence suggests that using the same memory budget, space-optimal two-dimensional multibit tries require 1/4 to 1/3 the memory accesses required by two-dimensional one-bit tries for table lookup.

BACKGROUND: With the migration of human beings, advances of agricultural sciences, evolution of planting patterns and global warming, soybeans have expanded to both tropical and high-latitude cold regions (HCRs). Unlike other regions, HCRs have much more significant and diverse photoperiods and temperature conditions over seasons or across latitudes, and HCR soybeans released there show rich diversity in maturity traits. However, HCR soybeans have not been as well classified into maturity groups (MGs) as other places. Therefore, it is necessary to identify MGs in HCRs and to genotype the maturity loci. METHODS: Local varieties were collected from the northern part of Northeast China and the far-eastern region of Russia. Maturity group reference (MGR) soybeans of MGs MG000, MG00, and MG0 were used as references during field experiments. Both local varieties and MGR soybeans were planted for two years (2010-2011) in Heihe (N 50°15', E 127°27', H 168.5 m), China. The days to VE (emergence), R1 (beginning bloom) and R7 (beginning maturity) were recorded and statistically analyzed. Furthermore, some varieties were further genotyped at four molecularly-identified maturity loci E1, E2, E3 and E4. RESULTS: The HCR varieties were classified into MG0 or even more early-maturing. In Heihe, some varieties matured much earlier than MG000, which is the most early-maturing known MG, and clustered into a separate group. We designated the group as MG0000, following the convention of MGs. HCR soybeans had relatively stable days to beginning bloom from emergence. The HCR varieties diversified into genotypes of E1, E2, E3 and E4. These loci had different effects on maturity. CONCLUSION: HCRs diversify early-maturing MGs of soybean. MG0000, a new MG that matures much earlier than known MGs, was developed. HCR soybean breeding should focus more on shortening post-flowering reproductive growth. E1, E2, E3, and E4 function differentially.