Background Central America is one of the most diverse floristic provinces in the world,but comprehensive plant lists for the region are incomplete and need frequent updating.Full geographic ranges of individual specie...Background Central America is one of the most diverse floristic provinces in the world,but comprehensive plant lists for the region are incomplete and need frequent updating.Full geographic ranges of individual species are seldom known.Our detailed forest inventory plots of Panama thus lack a global geographic perspective.In order to provide one,we assembled a thoroughly vetted checklist of all tree species of Panama,along with an estimate of each one’s range size based on published specimen records.Results 1)Panama has 3043 tree species in 141 families and 752 genera;57.6%were≥10 m tall and 16.9%were 3-5 m tall.2)The widest ranges were>1.5×107 km2,covering the entire neotropics and reaching>30∘latitude;12.4%of the species had ranges exceeding 107 km2.The median range was 6.9×105 km2.3)At the other extreme,16.2%of the species had a range<20,000 km2,a criterion suggesting endangered status.4)Range size increased with a tree species’height and varied significantly among families.5)Tree census plots,where we mapped and measured all individuals,captured 27.5%of the tree species,but a biased selection relative to range size;only 4.5%of the species in plots had ranges<20,000 km2.Conclusions Our checklist of the trees of Panama,based on rigorous criteria aimed at matching plot censuses,is 20%larger than previous.By recording species’maximum heights,we allow comparisons with other regions based on matching definitions,and the range sizes provide a quantitative basis for assessing extinction risk.Our next goal is to merge population density from plot censuses to add rigor to predictions of extinction risk of poorly-studied tropical tree species.展开更多
This paper presents a simple complete K level tree (CKT) architecture for text database organization and rapid data filtering. A database is constructed as a CKT forest and each CKT contains data of the same length. T...This paper presents a simple complete K level tree (CKT) architecture for text database organization and rapid data filtering. A database is constructed as a CKT forest and each CKT contains data of the same length. The maximum depth and the minimum depth of an individual CKT are equal and identical to data’s length. Insertion and deletion operations are defined; storage method and filtering algorithm are also designed for good compensation between efficiency and complexity. Applications to computer aided teaching of Chinese and protein selection show that an about 30% reduction of storage consumption and an over 60% reduction of computation may be easily obtained.展开更多
This paper presents a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “esti...This paper presents a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “estimating connectivity from spanning tree completions” (ECSTC) is specifically designed to address situations where only spanning tree(s) of a network are known, such as those obtained through respondent driven sampling (RDS). Using repeated random completions derived from degree information, this method forgoes the usual step of trying to obtain final edge or vertex rosters, and instead aims to estimate network-centric properties of vertices probabilistically from the spanning trees themselves. In this paper, we discuss the problem of missing data and describe the protocols of our completion method, and finally the results of an experiment where ECSTC was used to estimate graph dependent vertex properties from spanning trees sampled from a graph whose characteristics were known ahead of time. The results show that ECSTC methods hold more promise for obtaining network-centric properties of individuals from a limited set of data than researchers may have previously assumed. Such an approach represents a break with past strategies of working with missing data which have mainly sought means to complete the graph, rather than ECSTC’s approach, which is to estimate network properties themselves without deciding on the final edge set.展开更多
针对标签特定特征多标签学习算法(multi-label learning with label-specific features,LIFT)未能在聚类以及分类阶段考虑标签相关性问题,提出一种基于标签相关性的标签特定特征多标签学习算法(multi-label learning with label-specifi...针对标签特定特征多标签学习算法(multi-label learning with label-specific features,LIFT)未能在聚类以及分类阶段考虑标签相关性问题,提出一种基于标签相关性的标签特定特征多标签学习算法(multi-label learning with label-specific features via label correlations,LFLC).将标签空间加入特征空间进行聚类构建分类模型,采用考虑标签相关性的聚类集成技术为每个标签构造标签特定特征,使用相关性矩阵构建无向完全图并挖掘图中标签集合相关性,通过树集成表达标签间多种不同结构的强相关性.在试验部分,采用涵盖不同领域的10个数据集,以Hamming Loss、Ranking Loss、One-error、Coverage、Average Precision和macroAUC为评估指标,进行了参数敏感性分析和统计假设检验.结果表明:结合聚类集成与标签间强相关性的LFLC算法较其他对比多标签算法整体上能取得较好的效果.展开更多
The harmonious chromatic number of a graph G, denoted by h(G), is the leastnumber of colors needed to color the vertices of G in such a way that adarent verticesare colored by different colors and any two distinct edg...The harmonious chromatic number of a graph G, denoted by h(G), is the leastnumber of colors needed to color the vertices of G in such a way that adarent verticesare colored by different colors and any two distinct edges receive dmerent color pairs- D.Johnson has shown that the problem of determiniug h(G) is a NP-hard problem. In thispaper we determine the exact value of the harmonious chromatic number of a completetrinary tree.展开更多
基金The Center for Tree Science at the Morton Arboretum provided financial support for the lead authorFunding for various phases of the work was provided by the Smithsonian Institutionthe National Science Foundation(US)。
文摘Background Central America is one of the most diverse floristic provinces in the world,but comprehensive plant lists for the region are incomplete and need frequent updating.Full geographic ranges of individual species are seldom known.Our detailed forest inventory plots of Panama thus lack a global geographic perspective.In order to provide one,we assembled a thoroughly vetted checklist of all tree species of Panama,along with an estimate of each one’s range size based on published specimen records.Results 1)Panama has 3043 tree species in 141 families and 752 genera;57.6%were≥10 m tall and 16.9%were 3-5 m tall.2)The widest ranges were>1.5×107 km2,covering the entire neotropics and reaching>30∘latitude;12.4%of the species had ranges exceeding 107 km2.The median range was 6.9×105 km2.3)At the other extreme,16.2%of the species had a range<20,000 km2,a criterion suggesting endangered status.4)Range size increased with a tree species’height and varied significantly among families.5)Tree census plots,where we mapped and measured all individuals,captured 27.5%of the tree species,but a biased selection relative to range size;only 4.5%of the species in plots had ranges<20,000 km2.Conclusions Our checklist of the trees of Panama,based on rigorous criteria aimed at matching plot censuses,is 20%larger than previous.By recording species’maximum heights,we allow comparisons with other regions based on matching definitions,and the range sizes provide a quantitative basis for assessing extinction risk.Our next goal is to merge population density from plot censuses to add rigor to predictions of extinction risk of poorly-studied tropical tree species.
文摘This paper presents a simple complete K level tree (CKT) architecture for text database organization and rapid data filtering. A database is constructed as a CKT forest and each CKT contains data of the same length. The maximum depth and the minimum depth of an individual CKT are equal and identical to data’s length. Insertion and deletion operations are defined; storage method and filtering algorithm are also designed for good compensation between efficiency and complexity. Applications to computer aided teaching of Chinese and protein selection show that an about 30% reduction of storage consumption and an over 60% reduction of computation may be easily obtained.
文摘This paper presents a new method for obtaining network properties from incomplete data sets. Problems associated with missing data represent well-known stumbling blocks in Social Network Analysis. The method of “estimating connectivity from spanning tree completions” (ECSTC) is specifically designed to address situations where only spanning tree(s) of a network are known, such as those obtained through respondent driven sampling (RDS). Using repeated random completions derived from degree information, this method forgoes the usual step of trying to obtain final edge or vertex rosters, and instead aims to estimate network-centric properties of vertices probabilistically from the spanning trees themselves. In this paper, we discuss the problem of missing data and describe the protocols of our completion method, and finally the results of an experiment where ECSTC was used to estimate graph dependent vertex properties from spanning trees sampled from a graph whose characteristics were known ahead of time. The results show that ECSTC methods hold more promise for obtaining network-centric properties of individuals from a limited set of data than researchers may have previously assumed. Such an approach represents a break with past strategies of working with missing data which have mainly sought means to complete the graph, rather than ECSTC’s approach, which is to estimate network properties themselves without deciding on the final edge set.
文摘针对标签特定特征多标签学习算法(multi-label learning with label-specific features,LIFT)未能在聚类以及分类阶段考虑标签相关性问题,提出一种基于标签相关性的标签特定特征多标签学习算法(multi-label learning with label-specific features via label correlations,LFLC).将标签空间加入特征空间进行聚类构建分类模型,采用考虑标签相关性的聚类集成技术为每个标签构造标签特定特征,使用相关性矩阵构建无向完全图并挖掘图中标签集合相关性,通过树集成表达标签间多种不同结构的强相关性.在试验部分,采用涵盖不同领域的10个数据集,以Hamming Loss、Ranking Loss、One-error、Coverage、Average Precision和macroAUC为评估指标,进行了参数敏感性分析和统计假设检验.结果表明:结合聚类集成与标签间强相关性的LFLC算法较其他对比多标签算法整体上能取得较好的效果.
文摘The harmonious chromatic number of a graph G, denoted by h(G), is the leastnumber of colors needed to color the vertices of G in such a way that adarent verticesare colored by different colors and any two distinct edges receive dmerent color pairs- D.Johnson has shown that the problem of determiniug h(G) is a NP-hard problem. In thispaper we determine the exact value of the harmonious chromatic number of a completetrinary tree.
