[Objective] The aim was to explore the measurement of coordinate parameter by multi-baseline digital close-range photogrammetry system.[Method] The 3-dimensional coordinate of 8-year-old Jujube was measured by using L...[Objective] The aim was to explore the measurement of coordinate parameter by multi-baseline digital close-range photogrammetry system.[Method] The 3-dimensional coordinate of 8-year-old Jujube was measured by using Lensphoto multi-baseline digital close-range photogrammetry system,and through comparing with measured data of Total Station,the error and accuracy of photogrammetry data were analyzed.[Result] The absolute error of X,Y and Z coordinate was 0-0.014,0-0.018 and 0-0.004 m respectively,and the relative error of X,Y and Z coordinate was less than 0.145%.The significance test of pairs for the photogrammetry data and measured data of Total Station indicated that the space coordinate data of stumpage were accurately measured by using the multi-baseline digital close-range photogrammetry method,and the photogrammetry data meet the need of space coordinate measurement for virtual plant growth simulation.[Conclusion] This study had provided theoretical basis for the growth measurement of virtual plant growth simulation.展开更多
A subset S of V is called a k-connected dominating set if S is a dominating set and the induced subgraph S has at most k components.The k-connected domination number γck（G） of G is the minimum cardinality taken ove...A subset S of V is called a k-connected dominating set if S is a dominating set and the induced subgraph S has at most k components.The k-connected domination number γck（G） of G is the minimum cardinality taken over all minimal k-connected dominating sets of G.In this paper,we characterize trees and unicyclic graphs with equal connected domination and 2-connected domination numbers.展开更多
Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical...Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical clustering were investigated. Both theoretical analysis and detailed experimental results were given. It is shown that a distance function greatly affects clustering results and can be used to detect the outlier of a cluster by the comparison of such different results and give the shape information of clusters. In practice situation, it is suggested to use different distance function separately, compare the clustering results and pick out the 搒wing points? And such points may leak out more information for data analysts.展开更多
A blind and readable image watermarking scheme using wavelet tree quantization is proposed. In order to increase the algorithm robustness and ensure the watermark integrity,error correction coding techniques are used ...A blind and readable image watermarking scheme using wavelet tree quantization is proposed. In order to increase the algorithm robustness and ensure the watermark integrity,error correction coding techniques are used to encode the embedded watermark. In the watermark embedding process, the wavelet coefficients of the host image are grouped into wavelet trees and each watermark bit is embedded by using two trees. The trees are so quantized that they exhibit a large enough statistical difference, which will later be used for watermark extraction. The experimental results show that the proposed algorithm is effective and robust to common image processing operations and some geometric operations such as JPEG compression, JPEG2000 compression, filtering, Gaussian noise attack, and row-column removal. It is demonstrated that the proposed technique is practical.展开更多
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ...The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.展开更多
In coffee breeding practice, two quantitative traits, namely cherry and green bean characters are the important phenotypic selection index. The synchronous of cherry maturation, size, weight and shape of green bean ar...In coffee breeding practice, two quantitative traits, namely cherry and green bean characters are the important phenotypic selection index. The synchronous of cherry maturation, size, weight and shape of green bean are desirable traits for the future breeding. In order to increase the breeding efficiency, a set of quantitative trait loci （QTLs） analysis controlling these traits was carried out. The QTL analysis was performanced in cross pollinated population of Coffea canephora using single nucleotide polymorphisms （SNPs） and simple sequence repeats （SSRs） markers. Totally 12 QTLs determined desirable cherry and green bean traits were identified on 9 linkage groups （LG）, where these QTLs mapped forming clusters in 11 different chromosomal regions. The desirable traits which can be detected by their QTLs are synchronous of cherry maturation （LG B and LG G）, cherry size （LG A, LG F and LG G）, bean shape （LG B, LG D and LG J）, bean weight （LG H）, bean size （LG A and LG E） and cherry-bean size （LG K） The gene action of these QTLs was dominance or an interaction of alleles （epistasis between alleles at the studied locus） effect. The yielded linkage map and the detected QTL can provide a tool for further genetic analysis of two traits and be potential for maker-assisted selection in C. canephora breeding.展开更多
This paper discusses the asymptotic stability and Riesz basis generation for a general tree-shaped network of vibrating strings. All exterior vertices are assumed to be fixed and interior vertices are imposed linear d...This paper discusses the asymptotic stability and Riesz basis generation for a general tree-shaped network of vibrating strings. All exterior vertices are assumed to be fixed and interior vertices are imposed linear damping feedbacks. This paper shows that the system is well-posed and asymptotically stable by C0-semigroup theory. With some additional conditions, the spectrum of the system is shown to be located in a strip that is parallel to the imaginary axis and the set of all generalized eigenfunctions is completed in the state space. These lead to the conclusion that there is a sequence of generalized eigenfunctions of the system, which forms a Riesz basis with parenthesis for the state space.展开更多
Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simula...Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simulations, which are in good accordance with each other. Then weighted GFTN is studied using cumulative distributions of its Farey number value, edge weight, and node strength. These results maybe helpful for future theoretical development of hybrid models.展开更多
基金Supported by National Natural Science Foundation of China(30770401)National Eleventh Five-Year Plan for Forestry Scienceand Technology Support Topics(2006BADO3A0505)~~
文摘[Objective] The aim was to explore the measurement of coordinate parameter by multi-baseline digital close-range photogrammetry system.[Method] The 3-dimensional coordinate of 8-year-old Jujube was measured by using Lensphoto multi-baseline digital close-range photogrammetry system,and through comparing with measured data of Total Station,the error and accuracy of photogrammetry data were analyzed.[Result] The absolute error of X,Y and Z coordinate was 0-0.014,0-0.018 and 0-0.004 m respectively,and the relative error of X,Y and Z coordinate was less than 0.145%.The significance test of pairs for the photogrammetry data and measured data of Total Station indicated that the space coordinate data of stumpage were accurately measured by using the multi-baseline digital close-range photogrammetry method,and the photogrammetry data meet the need of space coordinate measurement for virtual plant growth simulation.[Conclusion] This study had provided theoretical basis for the growth measurement of virtual plant growth simulation.
文摘A subset S of V is called a k-connected dominating set if S is a dominating set and the induced subgraph S has at most k components.The k-connected domination number γck（G） of G is the minimum cardinality taken over all minimal k-connected dominating sets of G.In this paper,we characterize trees and unicyclic graphs with equal connected domination and 2-connected domination numbers.
文摘Most clustering algorithms need to describe the similarity of objects by a predefined distance function. Three distance functions which are widely used in two traditional clustering algorithms k-means and hierarchical clustering were investigated. Both theoretical analysis and detailed experimental results were given. It is shown that a distance function greatly affects clustering results and can be used to detect the outlier of a cluster by the comparison of such different results and give the shape information of clusters. In practice situation, it is suggested to use different distance function separately, compare the clustering results and pick out the 搒wing points? And such points may leak out more information for data analysts.
文摘A blind and readable image watermarking scheme using wavelet tree quantization is proposed. In order to increase the algorithm robustness and ensure the watermark integrity,error correction coding techniques are used to encode the embedded watermark. In the watermark embedding process, the wavelet coefficients of the host image are grouped into wavelet trees and each watermark bit is embedded by using two trees. The trees are so quantized that they exhibit a large enough statistical difference, which will later be used for watermark extraction. The experimental results show that the proposed algorithm is effective and robust to common image processing operations and some geometric operations such as JPEG compression, JPEG2000 compression, filtering, Gaussian noise attack, and row-column removal. It is demonstrated that the proposed technique is practical.
基金supported by Overseas Scholars Research Fund of Heilongjiang Provinicial Education Department
文摘The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
文摘In coffee breeding practice, two quantitative traits, namely cherry and green bean characters are the important phenotypic selection index. The synchronous of cherry maturation, size, weight and shape of green bean are desirable traits for the future breeding. In order to increase the breeding efficiency, a set of quantitative trait loci （QTLs） analysis controlling these traits was carried out. The QTL analysis was performanced in cross pollinated population of Coffea canephora using single nucleotide polymorphisms （SNPs） and simple sequence repeats （SSRs） markers. Totally 12 QTLs determined desirable cherry and green bean traits were identified on 9 linkage groups （LG）, where these QTLs mapped forming clusters in 11 different chromosomal regions. The desirable traits which can be detected by their QTLs are synchronous of cherry maturation （LG B and LG G）, cherry size （LG A, LG F and LG G）, bean shape （LG B, LG D and LG J）, bean weight （LG H）, bean size （LG A and LG E） and cherry-bean size （LG K） The gene action of these QTLs was dominance or an interaction of alleles （epistasis between alleles at the studied locus） effect. The yielded linkage map and the detected QTL can provide a tool for further genetic analysis of two traits and be potential for maker-assisted selection in C. canephora breeding.
基金This research is supported in part by the Natural Science Foundation of China under Grant No. 60874035 and by the Scientific Research Initiation Foundation of Civil Aviation University of China （08QD09X）.
文摘This paper discusses the asymptotic stability and Riesz basis generation for a general tree-shaped network of vibrating strings. All exterior vertices are assumed to be fixed and interior vertices are imposed linear damping feedbacks. This paper shows that the system is well-posed and asymptotically stable by C0-semigroup theory. With some additional conditions, the spectrum of the system is shown to be located in a strip that is parallel to the imaginary axis and the set of all generalized eigenfunctions is completed in the state space. These lead to the conclusion that there is a sequence of generalized eigenfunctions of the system, which forms a Riesz basis with parenthesis for the state space.
基金supported by the Nature Science Foundation of China under Grand Nos. 70431002, 60874087, 60773120, and 10647001the Nature Science Foundation of Beijing under Grand No. 4092040
文摘Generalized Farey tree network （GFTN） and generalized Farey organized pyramid network （CFOPN） model are proposed, and their topological characteristics are studied by both theoretical analysis and numerical simulations, which are in good accordance with each other. Then weighted GFTN is studied using cumulative distributions of its Farey number value, edge weight, and node strength. These results maybe helpful for future theoretical development of hybrid models.
