-
Yu Haiqing,
Zhang Chun,
Mei Zhiqiang,
Wang Li,
Li Juan,
Duan Chenggang,
Liu Xiaoyan,
Gong Shu,
Gan Lin,
Tao Zhonghua, [......],
Liu Youping,
Zhang Chunyan,
Chen Chuanning,
Zheng Xiaoli,
Zhao Hongxian,
Cheng Jiyan,
Tang Xiaojun, Zhang Yong,
Zhang Yingxi,
Fu Junjiang
[show abstract]
[hide abstract]
ABSTRACT: As a traditional medicinal herb in China, Penthorum chinense Push from Gulin county is regarded as genuine regional drug with better clinical effects. To discriminate the geographical origin of six P . chinense samples cultivated in three provinces, Randomly Amplified Polymorphic DNA (RAPD) analysis was carried out with an improved method to increase the resolution and production using 10 mer-random primers. Similarity index was ranged from 0.61 to 0.97, which demonstrated that samples from different localities displayed similar band patterns. However, based on the analysis of selected 13 primers, primers SBS-I9, SBS-I20 and SBS-Q9 produced distinguishable bands among Sichuan, Yunnan and Hubei P . chinense . T-test of mean S.I. values of six accessions demonstrated the significant differences between Luzhou or Sichuan samples and others. Cluster analysis indicated that cultivars with close geographic distributions were clustered together consequently. This suggested that there are RAPD site variations and local specialized genotypes among the six samples. The results indicated that RAPD analysis is effective in distinguishing the geographical origin of genuine regional drug P . chinense grown in Luhzou, Sichuan. The approach is a valuable tool to authenticate other morphologically similar herbal medicinal materials.
International Journal of Botany. 01/2011;
-
[show abstract]
[hide abstract]
ABSTRACT: This paper presents a new method for odor source localization using a Wireless Sensor Network (WSN) by means of collaboration with a mobile robot. The method has two steps: an initial estimation of the position of odor-source is obtained centrally by robot and is based on particle filtering. It does not require any prior information about the position of the nodes. In the second stage, the nodes refine their position estimates employing a decentralized information filter. The paper includes several implementation aspects and experimental results.
Control Conference (CCC), 2010 29th Chinese; 08/2010
-
[show abstract]
[hide abstract]
ABSTRACT: Sensor deployment is an important problem in mobile wireless sensor networks, which affects the performance and lifetime of the network. This paper presents a distributed deployment algorithm for mobile sensors. Our algorithm is compared with a simulated annealing based algorithm for deployment with the metrics such as coverage, uniformity, time and distance and the Simulation results are presented to demonstrate the effectiveness of the proposed approach.
Control and Decision Conference, 2009. CCDC '09. Chinese; 07/2009
-
[show abstract]
[hide abstract]
ABSTRACT: Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. This paper presents a new method for the localization of a wireless sensor network (WSN) by means of collaboration with a robot, using both Monte Carlo and Kalman filtering techniques. The proposed methods are demonstrated in a laboratory environment where stationary camera nodes self-localized in real-time by observing Pioneer robots moving about within their field of view. The robots take observations of surveyed beacons in the environment and provide estimates of their poses to the rest of the network. The paper includes several implementation aspects and experimental results.
Control and Decision Conference, 2009. CCDC '09. Chinese; 07/2009
-
[show abstract]
[hide abstract]
ABSTRACT: To support high bandwidth with high mobility is the predominant objective of next-generation networks. As some networks such as UMTS (universal mobile telecommunication system) can offer a wide geographical coverage with relatively low data rate, while other networks such as WLAN (wireless local area network) can support much higher bandwidth at a local level, network selection is becoming one of the most significant challenges for the next-generation networks. In this paper we propose an efficient network selection mechanism which combines two mathematical techniques. Analysis hierarchy progress is utilized to achieve the weights of QoS factors based on the user preference, and genetic algorithm can solve the multi-objective optimization problem. As pure genetic algorithm has weak local search capabilities and low efficiency around the Pareto optimal solutions , it may even cannot reach the Pareto optimal solution. To solve this problem, we propose the enhanced Pareto genetic algorithm combined with Tchebycheff method, which can improve efficiency of optimization and ensure a better convergence to the true optimal network.
Communication Networks and Services Research Conference, 2009. CNSR '09. Seventh Annual; 06/2009