排序方式: 共有2条查询结果,搜索用时 78 毫秒
1
1.
王照南 《山西农业大学学报(自然科学版)》1996,(2)
我们将我院黑线仓鼠(也叫中国地鼠)A30家系1只雌鼠(第28代)和B502家系154只(从第10—15代)地鼠(其中雌性138只;雄性15只),解剖观察了其主动脉弓分支的类型,共见到3个类型,A型97.42%,C型1.29%,F型0.64%,并发现一例罕见畸型。而A型为中国地鼠主动脉弓分支的基本类型,但基本型中又有各个亚型。 相似文献
2.
Karolien Scheerlinck Bernard De Baets 《Computers and Electronics in Agriculture》2010,73(2):200-12783
The development of routine analyses to allow for the handling of large amounts of samples and to avoid cost and time expensive analytical techniques is of high value. These routine analyses most often require calibration using the detailed analyses as reference values. A representative subset reflecting the complete range of the variables of interest is required for this purpose. In this paper this subset selection problem is tackled for multi-experiment data sets. Conventional techniques such as the Kennard and Stone algorithm and OptiSim are compared to a new approach based on Genetic Algorithms. The challenge here is to find an adequate objective function and to modify the standard crossover and mutation operators to keep the number of desired samples fixed. These techniques are applied on a data set containing the concentration of 45 fatty acids, determined by a simplified reference method, in 1033 milk samples, stemming from six different experiments. The objective is to select a subset of 100 samples in which each of the six different experiments is sufficiently represented. While there is no obvious way to generalize the conventional methods for multi-experiment data sets, this can quite easily be accomplished for Genetic Algorithms by modifying the objective function. Our results indicate that Genetic Algorithms are very capable of handling the subset selection problem for multi-experiment data sets. 相似文献
1