In this paper,an approach to improving consistency of judgement matrix in the Analytic Hierarchy Process (AHP) is presented,which utilizes the eigenvector to revise a pair of entries of judgement matrix each time.By u...In this paper,an approach to improving consistency of judgement matrix in the Analytic Hierarchy Process (AHP) is presented,which utilizes the eigenvector to revise a pair of entries of judgement matrix each time.By using this method,any judgement matrix with a large C.R.can be modified to a matrix which can both tally with the consistency requirement and reserve the most information that the original matrix contains.An algorithm to derive a judgement matrix with acceptable consistency (i.e.,C.R.<0.1) and two criteria of evaluating modificatory effectiveness are also given.展开更多
Let f be a full-level cusp form for GLm(Z) with Fourier coefficients Af(n1,..., nm-1). In this paper,an asymptotic expansion of Voronoi's summation formula for Af(n1,..., nm-1) is established. As applications of t...Let f be a full-level cusp form for GLm(Z) with Fourier coefficients Af(n1,..., nm-1). In this paper,an asymptotic expansion of Voronoi's summation formula for Af(n1,..., nm-1) is established. As applications of this formula, a smoothly weighted average of Af(n, 1,..., 1) against e(α|n|β) is proved to be rapidly decayed when 0 < β < 1/m. When β = 1/m and α equals or approaches ±mq1/mfor a positive integer q, this smooth average has a main term of the size of |Af(1,..., 1, q) + Af(1,..., 1,-q)|X1/(2m)+1/2, which is a manifestation of resonance of oscillation exhibited by the Fourier coefficients Af(n, 1,..., 1). Similar estimate is also proved for a sharp-cut sum.展开更多
Let G be a graph with degree sequence ( dv). If the maximum degree of any subgraph induced by a neighborhood of G is at most m, then the independence number of G is at least $\sum\limits_v {f_{m + 1} \left( {d_v } \ri...Let G be a graph with degree sequence ( dv). If the maximum degree of any subgraph induced by a neighborhood of G is at most m, then the independence number of G is at least $\sum\limits_v {f_{m + 1} \left( {d_v } \right)} $ , where fm+1( x) is a function greater than $\frac{{log\left( {x/\left( {m + 1} \right)} \right) - 1}}{x}for x > 0$ for x> 0. For a weighted graph G = ( V, E, w), we prove that its weighted independence number (the maximum sum of the weights of an independent set in G) is at least $\sum\limits_v {\frac{{w_v }}{{1 + d_v }}} $ where wv is the weight of v.展开更多
We study positive solutions of the following polyharmonic equation with Hardy weights associated to Navier boundary conditions on a half space：where rn is any positive integer satisfying 0 〈 2m 〈 n. We first prove ...We study positive solutions of the following polyharmonic equation with Hardy weights associated to Navier boundary conditions on a half space：where rn is any positive integer satisfying 0 〈 2m 〈 n. We first prove that the positive solutions of （0.1） are super polyharmonic, i.e.,where x＊ = （x1,... ,Xn-1, --Xn） is the reflection of the point x about the plane Rn-1. Then, we use the method of moving planes in integral forms to derive rotational symmetry and monotonicity for the positive solution of （0.3）, in which α can be any real number between 0 and n. By some Pohozaev type identities in integral forms, we prove a Liouville type theorem--the non-existence of positive solutions for （0.1）.展开更多
Let A be a j x d (0,1) matrix. It is known that if j = 2k - 1 is odd, then det(AAT) ≤ (j+1)((j+1)d/4j)j; if j is even, then det(AAT) ≤ (j+1)((j+2)d/4(j+1))j. A is called a regular D-optimal matrix if it satisfies th...Let A be a j x d (0,1) matrix. It is known that if j = 2k - 1 is odd, then det(AAT) ≤ (j+1)((j+1)d/4j)j; if j is even, then det(AAT) ≤ (j+1)((j+2)d/4(j+1))j. A is called a regular D-optimal matrix if it satisfies the equality of the above bounds. In this note, it is proved that if j = 2k - 1 is odd, then A is a regular D-optimal matrix if and only if A is the adjacent matrix of a (2k - 1, k, (j + l)d/4j)-BIBD; if j = 2k is even, then A is a regular D-optimal matrix if and only if A can be obtained from the adjacent matrix B of a (2k + 1,k + 1,(j + 2)d/4(j +1))-BIBD by deleting any one row from B. Three 21 x 42 regular D-optimal matrices, which were unknown in [11], are also provided.展开更多
基金This research is supported by the National Natural Science Foundation of China under Project 79970093, the Ph.D. Dissertation Foundation of Southeast University-NARI-Relays Electric Co. Ltd.
文摘In this paper,an approach to improving consistency of judgement matrix in the Analytic Hierarchy Process (AHP) is presented,which utilizes the eigenvector to revise a pair of entries of judgement matrix each time.By using this method,any judgement matrix with a large C.R.can be modified to a matrix which can both tally with the consistency requirement and reserve the most information that the original matrix contains.An algorithm to derive a judgement matrix with acceptable consistency (i.e.,C.R.<0.1) and two criteria of evaluating modificatory effectiveness are also given.
基金supported by National Natural Science Foundation of China(Grant No.10971119)Program for Changjiang Scolars and Innovative Research Team in University(Grant No.1264)
文摘Let f be a full-level cusp form for GLm(Z) with Fourier coefficients Af(n1,..., nm-1). In this paper,an asymptotic expansion of Voronoi's summation formula for Af(n1,..., nm-1) is established. As applications of this formula, a smoothly weighted average of Af(n, 1,..., 1) against e(α|n|β) is proved to be rapidly decayed when 0 < β < 1/m. When β = 1/m and α equals or approaches ±mq1/mfor a positive integer q, this smooth average has a main term of the size of |Af(1,..., 1, q) + Af(1,..., 1,-q)|X1/(2m)+1/2, which is a manifestation of resonance of oscillation exhibited by the Fourier coefficients Af(n, 1,..., 1). Similar estimate is also proved for a sharp-cut sum.
基金Li is supported in part by the National Natural Science Foundation of China (Grant No. 19871023) Science Foundation of the Education Ministry of China "333" Foundation and NSF of Jiangsu Province. Zang is supported in part by an RGC earmarked researc
文摘Let G be a graph with degree sequence ( dv). If the maximum degree of any subgraph induced by a neighborhood of G is at most m, then the independence number of G is at least $\sum\limits_v {f_{m + 1} \left( {d_v } \right)} $ , where fm+1( x) is a function greater than $\frac{{log\left( {x/\left( {m + 1} \right)} \right) - 1}}{x}for x > 0$ for x> 0. For a weighted graph G = ( V, E, w), we prove that its weighted independence number (the maximum sum of the weights of an independent set in G) is at least $\sum\limits_v {\frac{{w_v }}{{1 + d_v }}} $ where wv is the weight of v.
文摘We study positive solutions of the following polyharmonic equation with Hardy weights associated to Navier boundary conditions on a half space：where rn is any positive integer satisfying 0 〈 2m 〈 n. We first prove that the positive solutions of （0.1） are super polyharmonic, i.e.,where x＊ = （x1,... ,Xn-1, --Xn） is the reflection of the point x about the plane Rn-1. Then, we use the method of moving planes in integral forms to derive rotational symmetry and monotonicity for the positive solution of （0.3）, in which α can be any real number between 0 and n. By some Pohozaev type identities in integral forms, we prove a Liouville type theorem--the non-existence of positive solutions for （0.1）.
基金Project supported by the Science Foundation of China for Postdoctors (No.5(2001)).
文摘Let A be a j x d (0,1) matrix. It is known that if j = 2k - 1 is odd, then det(AAT) ≤ (j+1)((j+1)d/4j)j; if j is even, then det(AAT) ≤ (j+1)((j+2)d/4(j+1))j. A is called a regular D-optimal matrix if it satisfies the equality of the above bounds. In this note, it is proved that if j = 2k - 1 is odd, then A is a regular D-optimal matrix if and only if A is the adjacent matrix of a (2k - 1, k, (j + l)d/4j)-BIBD; if j = 2k is even, then A is a regular D-optimal matrix if and only if A can be obtained from the adjacent matrix B of a (2k + 1,k + 1,(j + 2)d/4(j +1))-BIBD by deleting any one row from B. Three 21 x 42 regular D-optimal matrices, which were unknown in [11], are also provided.
