The Critically Endangered black crested gibbon Nomascus concolor on Wuliang Mountain, Yunnan, China: the role of forest types in the species' conservation

The Critically Endangered black crested gibbon Nomascus concolor of China, Laos and Vietnam is threatened by deforestation and habitat destruction but there have been no studies of how it uses its forest habitat, probably because of the typically rugged t

New insights into the karyotypic relationships of Chinese muntjac (Muntiacus reevesi), forest musk deer (Moschus berezovskii) and gayal (Bos frontalis)

To investigate the karyotypic relationships between Chinese muntjac (Muntiacus reevesi), forest musk deer (Moschus berezovskii) and gayal (Bos frontalis), a complete set of Chinese muntjac chromosome-specific painting probes has been assigned to G-banded chromosomes of these three species. Sixteen autosomal probes (i.e. 6-10, 12-22) of the Chinese muntjac each delineated one pair of conserved segments in the forest musk deer and gayal, respectively. The remaining six autosomal probes (1-5, and 11) each delineated two to five pairs of conserved segments. In total, the 22 autosomal painting probes of Chinese muntjac delineated 33 and 34 conserved chromosomal segments in the genomes of forest musk deer and gayal, respectively. The combined analysis of comparative chromosome painting and G-band comparison reveals that most interspecific homologous segments show a high degree of conservation in G-banding patterns. Eleven chromosome fissions and five chromosome fusions differentiate the karyotypes of Chinese muntjac and forest musk deer; twelve chromosome fissions and six fusions are required to convert the Chinese muntjac karyotype to that of gayal; one chromosome fission and one fusion separate the forest musk deer and gayal. The musk deer has retained a highly conserved karyotype that closely resembles the proposed ancestral pecoran karyotype but shares none of the rearrangements characteristic for the Cervidae and Bovidae. Our results substantiate that chromosomes 1-5 and 11 of Chinese muntjac originated through exclusive centromere-to-telomere fusions of ancestral acrocentric chromosomes. Copyright (C) 2005 S. Karger AG, Basel.

Optimum temperature for the growth performance of juvenile orange-spotted grouper (Epinephelus coioides H.)

Effects of water temperature (17, 21, 25, 30 and 35 degrees C) and body size (14.75-281.41 g initial body weight) on food consumption, growth, feed conversion, and dry matter content in orange-spotted grouper fed to satiation were investigated. The combined effect of temperature (T, degrees C) and body weight (W, g) on maximum food consumption (C-max, g/day) was described as: InCmax= -7.411+0.828 lnW+0.317T-0.004 7T(2), and the optimum feeding temperature was 33.9 degrees C. The combined effect of temperature and body weight on growth (G) was described as: InG= -4.461-0.208lnW+0.394T-0.006 3T(2). The optimum growth temperature was 31.4 degrees C, whereas overall growth rates were high at 25, 30 and 35 degrees C. Feed conversion efficiencies (FCE, %), increasing first and then decreasing with increasing temperature, averaged from 1.8 to 2.1 in terms of dry weight of food fish. The optimum temperature for FCE tended to be lower than that for growth or feeding. Dry matter content increased with both increasing water temperature (17, 25, 30 and 35 degrees C) and body weight, and the combined effect of temperature and body weight on dry matter content (DM, %) was described as: lnDM =3.232+0.01 4 lnW-0.004 4T+0.001 2TlnW.

Exact quantum master equation via the calculus on path integrals

An exact quantum master equation formalism is constructed for the efficient evaluation of quantum non-Markovian dissipation beyond the weak system-bath interaction regime in the presence of time-dependent external field. A novel truncation scheme is further proposed and compared with other approaches to close the resulting hierarchically coupled equations of motion. The interplay between system-bath interaction strength, non-Markovian property, and required level of hierarchy is also demonstrated with the aid of simple spin-boson systems. (C) 2005 American Institute of Physics.

Design and path planning for a remote-brained service robot

This paper presents a novel robot named "TUT03-A" with expert systems, speech interaction, vision systems etc. based on remote-brained approach. The robot is designed to have the brain and body separated. There is a cerebellum in the body. The brain with the expert systems is in charge of decision and the cerebellum control motion of the body. The brain-body. interface has many kinds of structure. It enables a brain to control one or more cerebellums. The brain controls all modules in the system and coordinates their work. The framework of the robot allows us to carry out different kinds of robotics research in an environment that can be shared and inherited over generations. Then we discuss the path planning method for the robot based on ant colony algorithm. The mathematical model is established and the algorithm is achieved with the Starlogo simulating environment. The simulation result shows that it has strong robustness and eligible pathfinding efficiency.

Design and path planning for a remote-brained service robot

This article introduced an effective design method of robot called remote-brain, which is made the brain and body separated. It leaves the brain in the mother environment, by which we mean the environment in which the brain's software is developed, and talks with its body by wireless links. It also presents a real robot TUT06-B based on this method which has human-machine interaction, vision systems, manipulator etc. Then it discussed the path planning method for the robot based on ant colony algorithm in details, especially the Ant-cycle model. And it also analyzed the parameter of the algorithm which can affect the convergence. Finally, it gives the program flow chat of this algorithm.

an efficient method to generate feasible paths for basis path testing

Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

a real-time path planning approach without the computation of cspace obstacles

An important concept proposed in the early stage of robot path planning field is the shrinking of the robot to a point and meanwhile expanding of the obstacles in the workspace as a set of new obstacles. The resulting grown obstacles are called the Configuration Space (Cspace) obstacles. The find-path problem is then transformed into that of finding a collision free path for a point robot among the Cspace obstacles. However, the research experiences obtained so far have shown that the calculation of the Cspace obstacles is very hard work when the following situations occur: 1. both the robot and obstacles are not polygons and 2. the robot is allowed to rotate. This situation is even worse when the robot and obstacles are three dimensional (3D) objects with various shapes. Obviously a direct path planning approach without the calculation of the Cspace obstacles is strongly needed. This paper presents such a new real-time robot path planning approach which, to the best of our knowledge, is the first one in the robotic community. The fundamental ideas are the utilization of inequality and optimization technique. Simulation results have been presented to show its merits.

A shortest path algorithm for moving objects in spatial network databases

One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels,gas station, and car, the shortest path query returns the shortest path from the query object to interested objects. The studies of shortest path query have two kinds of ways, online processing and preprocessing. The studies of preprocessing suppose that the interest objects are static. This paper proposes a shortest path algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm’s complexity is O(klog2 i), and traditional Dijkstra’s complexity is O((i + k)2).

a shortest path algorithm for moving objects in spatial network databases

中国计算机学会

SBS-based slow light in optical fibers: optimum design considerations for undistorted slow-light signal propagation in steady-state and transient regimes

SPIE

Analysis of the lateral displacement and optical path difference in wide-field-of-view polarization interference imaging spectrometer

The mechanism of beam splitting and principle of wide-field-of-view compensation of modified Savart polariscope in the wide-field-of-view polarization interference imaging spectrometer (WPIIS) are analyzed and discussed. Formulas for the lateral displacement and optical path difference (OPD) produced by the modified Savart polariscope are derived by ray-tracing method. The theoretical and practical guidance is thereby provided for the study, design, modulation, experiment and engineering of the polarization interference imaging spectrometers and other birefringent Fourier-transform spectrometers based on Savart polariscopes. (c) 2006 Elsevier B.V. All rights reserved.