The weight hierarchy of a linear [n, k;q] code C over GF(q) is the sequence (d1,d2,..., dk) where dr is the size of the smallest support of an r-dimensional subcode of C. An [n,k;q] code satisfies the chain condition ...The weight hierarchy of a linear [n, k;q] code C over GF(q) is the sequence (d1,d2,..., dk) where dr is the size of the smallest support of an r-dimensional subcode of C. An [n,k;q] code satisfies the chain condition if there exists subcodes D1 D2 … Dk = C of C such that Dr has dimension r and support of size dr for all r. Further, C satisfies the almost chain condition if it does not satisfy the chain condition, but there exist subcodes Dr of dimension r and support of size dr for all r such that D2 D3 Dk = C and D1 D3. A simple necessary condition for a sequence to be the weight hierarchy of a code satisfying the almost chain condition is given. Further, explicit constructions of such codes are given, showing that in almost all cases, the necessary conditions are also sufficient.展开更多
Purpose–The purpose of this paper is to propose a grey clustering evaluation model based on analytic hierarchy process(AHP)and interval grey number(IGN)to solve the clustering evaluation problem with IGNs.Design/meth...Purpose–The purpose of this paper is to propose a grey clustering evaluation model based on analytic hierarchy process(AHP)and interval grey number(IGN)to solve the clustering evaluation problem with IGNs.Design/methodology/approach–First,the centre-point triangular whitenisation weight function with real numbers is built,and then by using interval mean function,the whitenisation weight function is extended to IGNs.The weights of evaluation indexes are determined by AHP.Finally,this model is used to evaluate the flight safety of a Chinese airline.The results indicate that the model is effective and reasonable.Findings–When IGN meets certain conditions,the centre-point triangular whitenisation weight function based on IGN is not multiple-cross and it is normative.It provides a certain standard and basis for obtaining the effective evaluation indexes and determining the scientific evaluation of the grey class.Originality/value–The traditional grey clustering model is extended to the field of IGN.It can make full use of all the information of the IGN,so the result of the evaluation is more objective and reasonable,which provides supports for solving practical problems.展开更多
By analyzing the existing methods for the bridge bearing capacity assessment, an analytic hierarchy pro cess estimation model with a variable weight and fuzzy description is proposed based on the nondestructive infor ...By analyzing the existing methods for the bridge bearing capacity assessment, an analytic hierarchy pro cess estimation model with a variable weight and fuzzy description is proposed based on the nondestructive infor mation. Considering the actual strength, the bearing capacity is first calculated from its design state, and then modified based on the detection information. The modification includes the section reduction and the structure deterioration. The section reduction involves the concrete section and the steel cross-section reduction. The structure deterioration is decided by six factors, i.e. , the concrete surface damage, the actual concrete strength, the steel corrosion electric potential, the chloride ion content, the carbonization depth, and the protective layer depth. The initial weight of each factor is calculated by the expert judgment matrix using an analytic hierarchy process. The consistency approximation and the error transfer theory are used. Then, the variable weight is in- troduced to expand the influences of factors in the worse state. Finally, an actual bridge is taken as an example to verify the proposed method. Results show that the estimated capacity agrees well with that of the load test, thus the method is objective and credible展开更多
The weight hierarchy of a [n, k; q] linear code C over Fq is the sequence （d1,…, dr,… , dk）, where dr is the smallest support weight of an r-dimensional subcode of C. In this paper, by using the finite projective ...The weight hierarchy of a [n, k; q] linear code C over Fq is the sequence （d1,…, dr,… , dk）, where dr is the smallest support weight of an r-dimensional subcode of C. In this paper, by using the finite projective geometry method, we research a class of weight hierarchy of linear codes with dimension 5. We first find some new pre- conditions of this class. Then we divide its weight hierarchies into six subclasses, and research one subclass to determine nearly all the weight hierarchies of this subclass of weight hierarchies of linear codes with dimension 5.展开更多
The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and...The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries. The possible weight hierarchies in class A, B, C, D are determined in Part (I). The possible weight hierarchies in class E, F, G, H, I are determined in Part (II).展开更多
基金supported by the Norwegian Research Council and the National Natural Science Foundation of China(Grant No.10271116).
文摘The weight hierarchy of a linear [n, k;q] code C over GF(q) is the sequence (d1,d2,..., dk) where dr is the size of the smallest support of an r-dimensional subcode of C. An [n,k;q] code satisfies the chain condition if there exists subcodes D1 D2 … Dk = C of C such that Dr has dimension r and support of size dr for all r. Further, C satisfies the almost chain condition if it does not satisfy the chain condition, but there exist subcodes Dr of dimension r and support of size dr for all r such that D2 D3 Dk = C and D1 D3. A simple necessary condition for a sequence to be the weight hierarchy of a code satisfying the almost chain condition is given. Further, explicit constructions of such codes are given, showing that in almost all cases, the necessary conditions are also sufficient.
基金supported by National Natural Science Foundation of China under the project of 71601050 and Civil Aviation Administration of China Science Planned Projects under the project of MHRD20150211.
文摘Purpose–The purpose of this paper is to propose a grey clustering evaluation model based on analytic hierarchy process(AHP)and interval grey number(IGN)to solve the clustering evaluation problem with IGNs.Design/methodology/approach–First,the centre-point triangular whitenisation weight function with real numbers is built,and then by using interval mean function,the whitenisation weight function is extended to IGNs.The weights of evaluation indexes are determined by AHP.Finally,this model is used to evaluate the flight safety of a Chinese airline.The results indicate that the model is effective and reasonable.Findings–When IGN meets certain conditions,the centre-point triangular whitenisation weight function based on IGN is not multiple-cross and it is normative.It provides a certain standard and basis for obtaining the effective evaluation indexes and determining the scientific evaluation of the grey class.Originality/value–The traditional grey clustering model is extended to the field of IGN.It can make full use of all the information of the IGN,so the result of the evaluation is more objective and reasonable,which provides supports for solving practical problems.
基金Supported by the Jiangshu Province Communication Scientific Research Project(06Y21)Zhejiang Province Road Scientific Research Project(2007-013-11L)~~
文摘By analyzing the existing methods for the bridge bearing capacity assessment, an analytic hierarchy pro cess estimation model with a variable weight and fuzzy description is proposed based on the nondestructive infor mation. Considering the actual strength, the bearing capacity is first calculated from its design state, and then modified based on the detection information. The modification includes the section reduction and the structure deterioration. The section reduction involves the concrete section and the steel cross-section reduction. The structure deterioration is decided by six factors, i.e. , the concrete surface damage, the actual concrete strength, the steel corrosion electric potential, the chloride ion content, the carbonization depth, and the protective layer depth. The initial weight of each factor is calculated by the expert judgment matrix using an analytic hierarchy process. The consistency approximation and the error transfer theory are used. Then, the variable weight is in- troduced to expand the influences of factors in the worse state. Finally, an actual bridge is taken as an example to verify the proposed method. Results show that the estimated capacity agrees well with that of the load test, thus the method is objective and credible
基金supported by the National Natural Science Foundation of China (Nos. 61303212 and 61170080)the State Key Program of the National Natural Science of China (Nos. 61332019 and U1135004)the Fundamental Research Funds for the Central Universities, South-Central University for Nationalities (No. CZY14019)
文摘The weight hierarchy of a [n, k; q] linear code C over Fq is the sequence （d1,…, dr,… , dk）, where dr is the smallest support weight of an r-dimensional subcode of C. In this paper, by using the finite projective geometry method, we research a class of weight hierarchy of linear codes with dimension 5. We first find some new pre- conditions of this class. Then we divide its weight hierarchies into six subclasses, and research one subclass to determine nearly all the weight hierarchies of this subclass of weight hierarchies of linear codes with dimension 5.
基金supported by The Norwegian Research Councilthe National Science Foundation of China(10271116)
文摘The weight hierarchy of a binary linear [n, k] code C is the sequence (d 1, d 2, . . . , d k ), where d r is the smallest support of an r-dimensional subcode of C. The codes of dimension 4 are collected in classes and the possible weight hierarchies in each class is determined by finite projective geometries. The possible weight hierarchies in class A, B, C, D are determined in Part (I). The possible weight hierarchies in class E, F, G, H, I are determined in Part (II).
