This paper summarized the classification of colorful tree species and the application principles on landscape architecture and briefly introduced the present application situation of colorful tree species in China. It...This paper summarized the classification of colorful tree species and the application principles on landscape architecture and briefly introduced the present application situation of colorful tree species in China. It also raised suggestions related to the introduction and application of the colorful tree species.展开更多
By using biological five points,expert consultation and fuzzy comprehensive evaluation,the species,phenological ornamental characteristics,and landscape application of colored-leaf trees in Lhasa City were surveyed sy...By using biological five points,expert consultation and fuzzy comprehensive evaluation,the species,phenological ornamental characteristics,and landscape application of colored-leaf trees in Lhasa City were surveyed systematically. The results show that there are 42 species of colored-leaf trees in Lhasa City,belonging to 31 genera and 18 families,of which there are 5,19,and 18 species of spring,autumn,and common colored-leaf trees,accounting for 11.90%,45.24% and 42.86% of total number of the investigated tree species respectively. It is clearly seen that there are too few species of spring colored-leaf trees in the city. There are 19 and 17 species of trees possessing red and yellow leaves,while the leaves of other 6 species of colored-leaf trees are shown in other colors,and the number of their species accounts for 45.24%,40.48% and 14.28% of total number of the investigated tree species respectively. The best ornamental periods of spring,autumn and common colored-leaf trees in Lhasa City average 38.4,41.8 and 251.8 d respectively. Prunus cerasifera Ehrhar f. atropurpurea Rehd.,Ulmus pumila L.,Populus × beijingensis W. Y. Hsu,and Salix alba are applied most frequently in Lhasa City,and their relative frequency is 18.67%,10.29%,9.91% and 8.95% respectively. According to the comprehensive assessment value of their ornamental characteristics,the ornamental characteristics of 15 species of colored-leaf trees in Lhasa City are good or very good,and there is a positive correlation between the comprehensive assessment value and relative frequency. Based on the investigation,the current application situation and problems of colored-leaf trees in Lhasa City were analyzed,and solutions to the problems were proposed.展开更多
It has been known that determining the exact value of vertex distinguishing edge index X '8(G) of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete...It has been known that determining the exact value of vertex distinguishing edge index X '8(G) of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid(G) denote the number of vertices of degree d in G, and let X'es(G) be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl (T) ≤ X 's (T) ≤ n1 (T) + 1 and X's(T) = X'es(T) if T satisfies one of the following conditions (i) n2(T) ≤△(T) or (ii) there exists a constant c with respect to 0 〈 c 〈 1 such that n2(T) △ cn1(T) and ∑3 ≤d≤△(T)nd(T) ≤ (1 - c)n1(T) + 1.展开更多
In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tr...In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.展开更多
The multinomial wood surface roughness parameters and wood color parameters of 5 kinds of species of trees were measured in working operation by the stylus surface roughness meter and colorimeter, and the measurement ...The multinomial wood surface roughness parameters and wood color parameters of 5 kinds of species of trees were measured in working operation by the stylus surface roughness meter and colorimeter, and the measurement results were compared. The results indicated: The variations of wood surface roughness had the effect on the wood color of some kinds of species of trees on working operation, with the surface roughness decreasing, the brightness and luminance exponent increased, the hue angle increased lightly, but the variation of color saturation was different to the different wood color hue of species of trees.展开更多
<span style="font-family:Verdana;">This study examined the relationship between tree frog</span> (<i><i><span style="font-family:Verdana;">Hyla</span></i>&...<span style="font-family:Verdana;">This study examined the relationship between tree frog</span> (<i><i><span style="font-family:Verdana;">Hyla</span></i><span> <i><span style="font-family:Verdana;">savignyi</span></i><span style="font-family:Verdana;"></span></span></i><span style="font-family:Verdana;">)</span><span style="font-family:Verdana;"> coloring and its different seasonal habitats at the southern border of its distribution. The results show that tree frog color is affected by the dominant colors in its habitat, which vary seasonally, especially between winter and summer. Tree frog colors were various shades of green, white, brown, and black. No genetic marker was found to characterize the color. The ability of a small frog to infer its own time with the help of color changes occurring in the habitat on the southern border of its distribution, which are relatively broad, gives this species an advantage.</span>展开更多
针对传统Petri网(P/T系统)无法根据后继标识确定系统失效部位的问题,采用着色Petri网(Colored Petri Net,CPN)建立动车组列控车载子系统的故障传播模型。首先,通过CPN与传统Petri网理论的对比说明采用CPN建模的可行性。其次,根据车载子...针对传统Petri网(P/T系统)无法根据后继标识确定系统失效部位的问题,采用着色Petri网(Colored Petri Net,CPN)建立动车组列控车载子系统的故障传播模型。首先,通过CPN与传统Petri网理论的对比说明采用CPN建模的可行性。其次,根据车载子系统的结构组成及工作模式建立故障树模型,并通过Petri网描述故障树逻辑门事件之间的逻辑关系,给出故障树的Petri网表示方法,建立车载子系统的P/T系统模型;进一步根据CPN理论确定托肯染色方法、权函数等模型参数,将P/T系统转化为着色网系统,并举例说明后继标识的计算规则。最后,通过与传统Petri网推理及故障识别过程的对比,证明了采用CPN分析系统故障机理的正确性及在故障识别过程中的高效性。所提方法可为车载子系统的故障识别提供一定依据。展开更多
Random amplified polymorphic DNA (RAPD) was used to analyze genetic polymophism of 35 Tree Peony cultivars with 7 different color groups. Thirty four primers amplified 418 DNA fragments and 337 polymorphic bands (80.6...Random amplified polymorphic DNA (RAPD) was used to analyze genetic polymophism of 35 Tree Peony cultivars with 7 different color groups. Thirty four primers amplified 418 DNA fragments and 337 polymorphic bands (80.6%), including specific DNA markers for 18 cultivars that could be used to differentiate cultivars. The UPCMA method was used to analyze the genetic relationship among cultivars. The results showed that 35 Peony cultivars could be divided into 2 cluster groups when using similarity criteria of 1.5, and into 4 cluster groups when using similarity criteria of 1.0. The result confirmed that the flower color has no relation to the genetic clusters and the Tree Peony cultivars originated from the same area has close genetic relationship. Therefore, genetic background has no large effect on the genetic relationship. The sequence based on polymorphic rate from high to low was Blue groups > Yellow groups > Bark red groups > Blake groups > White groups>Green groups>Red groups.展开更多
Let G be a graph, in which each vertex (job) v has a positive integer weight (processing time) p(v) and eachedge (u,v) represented that the pair of jobs u and v cannot be processed in the same slot. In this paper we a...Let G be a graph, in which each vertex (job) v has a positive integer weight (processing time) p(v) and eachedge (u,v) represented that the pair of jobs u and v cannot be processed in the same slot. In this paper we assume that every job is non-preemptive. Let C={1,2,...} be a color set. A multicoloring (scheduling) F of G is to assign each job v a set of p(v) consecutive positive integers (processing consecutive time slots) in C so that any pair of adjacent vertices receive disjoint sets. Such a multicoloring is called a non-preemptive scheduling. The cost non-preemptive scheduling problem is to find an optimal multicoloring of G.展开更多
文摘This paper summarized the classification of colorful tree species and the application principles on landscape architecture and briefly introduced the present application situation of colorful tree species in China. It also raised suggestions related to the introduction and application of the colorful tree species.
基金Sponsored by National Natural Science Foundation of China(51568059)
文摘By using biological five points,expert consultation and fuzzy comprehensive evaluation,the species,phenological ornamental characteristics,and landscape application of colored-leaf trees in Lhasa City were surveyed systematically. The results show that there are 42 species of colored-leaf trees in Lhasa City,belonging to 31 genera and 18 families,of which there are 5,19,and 18 species of spring,autumn,and common colored-leaf trees,accounting for 11.90%,45.24% and 42.86% of total number of the investigated tree species respectively. It is clearly seen that there are too few species of spring colored-leaf trees in the city. There are 19 and 17 species of trees possessing red and yellow leaves,while the leaves of other 6 species of colored-leaf trees are shown in other colors,and the number of their species accounts for 45.24%,40.48% and 14.28% of total number of the investigated tree species respectively. The best ornamental periods of spring,autumn and common colored-leaf trees in Lhasa City average 38.4,41.8 and 251.8 d respectively. Prunus cerasifera Ehrhar f. atropurpurea Rehd.,Ulmus pumila L.,Populus × beijingensis W. Y. Hsu,and Salix alba are applied most frequently in Lhasa City,and their relative frequency is 18.67%,10.29%,9.91% and 8.95% respectively. According to the comprehensive assessment value of their ornamental characteristics,the ornamental characteristics of 15 species of colored-leaf trees in Lhasa City are good or very good,and there is a positive correlation between the comprehensive assessment value and relative frequency. Based on the investigation,the current application situation and problems of colored-leaf trees in Lhasa City were analyzed,and solutions to the problems were proposed.
基金supported by the National Natural Science Foundation of China (61163054),supported by the National Natural Science Foundation of China (61163037)
文摘It has been known that determining the exact value of vertex distinguishing edge index X '8(G) of a graph G is difficult, even for simple classes of graphs such as paths, cycles, bipartite complete graphs, complete, graphs, and graphs with maximum degree 2. Let rid(G) denote the number of vertices of degree d in G, and let X'es(G) be the equitable vertex distinguishing edge index of G. We show that a tree T holds nl (T) ≤ X 's (T) ≤ n1 (T) + 1 and X's(T) = X'es(T) if T satisfies one of the following conditions (i) n2(T) ≤△(T) or (ii) there exists a constant c with respect to 0 〈 c 〈 1 such that n2(T) △ cn1(T) and ∑3 ≤d≤△(T)nd(T) ≤ (1 - c)n1(T) + 1.
文摘In this paper, the concepts of tree chromatic numbers and uniquely tree colorable graphs are introduced. After discussion some fundamental properties, three necessary conditions for a simple graph to be uniquely tree colorable are given. Moreover, a series of uniquely tree colorable graphs are constructed.
文摘The multinomial wood surface roughness parameters and wood color parameters of 5 kinds of species of trees were measured in working operation by the stylus surface roughness meter and colorimeter, and the measurement results were compared. The results indicated: The variations of wood surface roughness had the effect on the wood color of some kinds of species of trees on working operation, with the surface roughness decreasing, the brightness and luminance exponent increased, the hue angle increased lightly, but the variation of color saturation was different to the different wood color hue of species of trees.
文摘<span style="font-family:Verdana;">This study examined the relationship between tree frog</span> (<i><i><span style="font-family:Verdana;">Hyla</span></i><span> <i><span style="font-family:Verdana;">savignyi</span></i><span style="font-family:Verdana;"></span></span></i><span style="font-family:Verdana;">)</span><span style="font-family:Verdana;"> coloring and its different seasonal habitats at the southern border of its distribution. The results show that tree frog color is affected by the dominant colors in its habitat, which vary seasonally, especially between winter and summer. Tree frog colors were various shades of green, white, brown, and black. No genetic marker was found to characterize the color. The ability of a small frog to infer its own time with the help of color changes occurring in the habitat on the southern border of its distribution, which are relatively broad, gives this species an advantage.</span>
文摘针对传统Petri网(P/T系统)无法根据后继标识确定系统失效部位的问题,采用着色Petri网(Colored Petri Net,CPN)建立动车组列控车载子系统的故障传播模型。首先,通过CPN与传统Petri网理论的对比说明采用CPN建模的可行性。其次,根据车载子系统的结构组成及工作模式建立故障树模型,并通过Petri网描述故障树逻辑门事件之间的逻辑关系,给出故障树的Petri网表示方法,建立车载子系统的P/T系统模型;进一步根据CPN理论确定托肯染色方法、权函数等模型参数,将P/T系统转化为着色网系统,并举例说明后继标识的计算规则。最后,通过与传统Petri网推理及故障识别过程的对比,证明了采用CPN分析系统故障机理的正确性及在故障识别过程中的高效性。所提方法可为车载子系统的故障识别提供一定依据。
文摘Random amplified polymorphic DNA (RAPD) was used to analyze genetic polymophism of 35 Tree Peony cultivars with 7 different color groups. Thirty four primers amplified 418 DNA fragments and 337 polymorphic bands (80.6%), including specific DNA markers for 18 cultivars that could be used to differentiate cultivars. The UPCMA method was used to analyze the genetic relationship among cultivars. The results showed that 35 Peony cultivars could be divided into 2 cluster groups when using similarity criteria of 1.5, and into 4 cluster groups when using similarity criteria of 1.0. The result confirmed that the flower color has no relation to the genetic clusters and the Tree Peony cultivars originated from the same area has close genetic relationship. Therefore, genetic background has no large effect on the genetic relationship. The sequence based on polymorphic rate from high to low was Blue groups > Yellow groups > Bark red groups > Blake groups > White groups>Green groups>Red groups.
文摘Let G be a graph, in which each vertex (job) v has a positive integer weight (processing time) p(v) and eachedge (u,v) represented that the pair of jobs u and v cannot be processed in the same slot. In this paper we assume that every job is non-preemptive. Let C={1,2,...} be a color set. A multicoloring (scheduling) F of G is to assign each job v a set of p(v) consecutive positive integers (processing consecutive time slots) in C so that any pair of adjacent vertices receive disjoint sets. Such a multicoloring is called a non-preemptive scheduling. The cost non-preemptive scheduling problem is to find an optimal multicoloring of G.