期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Differentiation of coral trout (Plectropomus leopardus) based on an analysis of morphology and complete mitochondrial DNA: Are cryptic species present? 被引量:2
1
作者 CAI Xiaopeng QU Meng +4 位作者 DING Shaoxiong WANG Hangjun WANG Hongjie HU Luyi SU Yongquan 《Acta Oceanologica Sinica》 SCIE CAS CSCD 2013年第6期40-46,共7页
Two morphotypes of Plectropomus leopardus have been identified; morphometric and meristic analyses show that there is no diagnostic difference between them. A difference in color pattern was the most ap- propriate phe... Two morphotypes of Plectropomus leopardus have been identified; morphometric and meristic analyses show that there is no diagnostic difference between them. A difference in color pattern was the most ap- propriate phenotypic character with which to distinguish between the two morphotypes. Complete mito- chondrial DNA sequencing, however, indicated a clear difference between the two morphotypes. Barcoding analysis revealed no significant difference (P〉0.05) in CO1 or ND2 divergence among intramorphotypic individuals, even between geographically separated populations, whereas the intermorphotypic CO1 and ND2 divergences were large enough (averaging 0.95% for CO1 and 1.37% for ND2) to clearly discriminate between the two morphotypes. The color pattern difference, geographical distribution, together with the mtDNA and barcode sequencing data, suggest that the two morphotypes should be of two subspecies or even two species. 展开更多
关键词 Plectropomus leopardus MORPHOTYPE omplete mitochondrial DNA BARCODING
下载PDF
Task-assignment problem;Ternary variables;Binary variables;Mixed integer programming problem
2
作者 Ran Ma Jin-Jiang Yuan 《Journal of the Operations Research Society of China》 EI CSCD 2016年第1期111-119,共9页
We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected jobs.In the problem,a set of independent jobs ... We consider the online scheduling with job rejection to minimize the total weighted completion time of the scheduled jobs plus the total rejection penalty of the rejected jobs.In the problem,a set of independent jobs arriving online over time has to be scheduled with the flexibility of rejecting some of the jobs,where preemption is not allowed and the information of each job,including its processing time,release date,weight,and rejection penalty,is not known in advance.For this problem,using a technique named Greedy-Interval-Rejection,we provide an online algorithm with a competitive ratio of at most 4+εon identical machines and an online algorithm with a competitive ratio of at most 8 on unrelated machines,respectively。 展开更多
关键词 Scheduling Online algorithms Total weightedc ompletion time REJECTION
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部