Classes are the basic modules in object-oriented (OO) software, which consist of attributes and methods. Thus, in OO environment, the cohesion is mainly about the tightness of the attributes and methods of classes. Th...Classes are the basic modules in object-oriented (OO) software, which consist of attributes and methods. Thus, in OO environment, the cohesion is mainly about the tightness of the attributes and methods of classes. This paper discusses the relationships between attributes and attributes, attributes and methods, methods and methods of a class based on dependence analysis. Then the paper presents methods to compute these dependencies. Based on these, the paper proposes a method to measure the class cohesion, which satisfies the properties that a good measurement should have. The approach overcomes the limitations of previous class cohesion measures, which consider only one or two of the three relationships in a class. Keywords cohesion - object-orientation - class - program complexity - dependence analysis Supported by the National Natural Science Foundation of China under Grant No.60073012; the National Basic Research 973 Program of China under Grant No.2002CB312000; the Program for Cross-Century Outstanding Teachers of the Ministry of Education; the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20020286004; the Natural Science Foundation of Jiangsu, China, under Grant No.BK2001004; the Jiangsu Key Science and Technology Project under Grant No.BE2001025; the Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University; the Opening Foundation of Jiangsu Key Laboratory of Computer Information Processing Technology in Soochow University.Zheng-Qiang Chen was born in 1976. He received the M.S. and Ph.D. degrees in computer science in 2000 and 2003, respectively. His current research interests include program analysis, understanding and testing as well as other topics related to reverse engineering. He has published more than 30 technical papers.Bao-Wen Xu was born in 1961. He received the M.S. and Ph.D. degrees in computer science in 1984 and 2002, respectively. He is a professor in the Computer Science & Engineering Department of Southeast 展开更多
In order to evaluate the structural complexity of class diagrams systematically and deeply, a new guiding framework of structural complexity is presented. An index system of structural complexity for class diagrams is...In order to evaluate the structural complexity of class diagrams systematically and deeply, a new guiding framework of structural complexity is presented. An index system of structural complexity for class diagrams is given. This article discusses the formal description of class diagrams, and presents the method of formally structural complexity metrics for class diagrams from associations, dependencies, aggregations, generalizations and so on. An applicable example proves the feasibility of the presented method.展开更多
This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number... This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number of processors, the rquired precision. This result seems to be new even in serial case.展开更多
In this paper, we present a neighborhood following primal-dual interior-point algorithm for solving symmetric cone convex quadratic programming problems, where the objective function is a convex quadratic function and...In this paper, we present a neighborhood following primal-dual interior-point algorithm for solving symmetric cone convex quadratic programming problems, where the objective function is a convex quadratic function and the feasible set is the intersection of an affine subspace and a symmetric cone attached to a Euclidean Jordan algebra. The algorithm is based on the [13] broad class of commutative search directions for cone of semidefinite matrices, extended by [18] to arbitrary symmetric cones. Despite the fact that the neighborhood is wider, which allows the iterates move towards optimality with longer steps, the complexity iteration bound remains as the same result of Schmieta and Alizadeh for symmetric cone optimization problems.展开更多
文摘Classes are the basic modules in object-oriented (OO) software, which consist of attributes and methods. Thus, in OO environment, the cohesion is mainly about the tightness of the attributes and methods of classes. This paper discusses the relationships between attributes and attributes, attributes and methods, methods and methods of a class based on dependence analysis. Then the paper presents methods to compute these dependencies. Based on these, the paper proposes a method to measure the class cohesion, which satisfies the properties that a good measurement should have. The approach overcomes the limitations of previous class cohesion measures, which consider only one or two of the three relationships in a class. Keywords cohesion - object-orientation - class - program complexity - dependence analysis Supported by the National Natural Science Foundation of China under Grant No.60073012; the National Basic Research 973 Program of China under Grant No.2002CB312000; the Program for Cross-Century Outstanding Teachers of the Ministry of Education; the National Research Foundation for the Doctoral Program of Higher Education of China under Grant No.20020286004; the Natural Science Foundation of Jiangsu, China, under Grant No.BK2001004; the Jiangsu Key Science and Technology Project under Grant No.BE2001025; the Opening Foundation of State Key Laboratory of Software Engineering in Wuhan University; the Opening Foundation of Jiangsu Key Laboratory of Computer Information Processing Technology in Soochow University.Zheng-Qiang Chen was born in 1976. He received the M.S. and Ph.D. degrees in computer science in 2000 and 2003, respectively. His current research interests include program analysis, understanding and testing as well as other topics related to reverse engineering. He has published more than 30 technical papers.Bao-Wen Xu was born in 1961. He received the M.S. and Ph.D. degrees in computer science in 1984 and 2002, respectively. He is a professor in the Computer Science & Engineering Department of Southeast
基金Science and Technology Department Term of Education of Heilongjiang Province(Grant No.11511127)
文摘In order to evaluate the structural complexity of class diagrams systematically and deeply, a new guiding framework of structural complexity is presented. An index system of structural complexity for class diagrams is given. This article discusses the formal description of class diagrams, and presents the method of formally structural complexity metrics for class diagrams from associations, dependencies, aggregations, generalizations and so on. An applicable example proves the feasibility of the presented method.
基金this work was supported by china State Major Key Project for Basic Researchers
文摘 This paper deals with the parallel information-based complexity of numerical integration on Sobolev class. We obtain tight bounds on the complexity, considered as a function of two variables simultaneously:the number of processors, the rquired precision. This result seems to be new even in serial case.
基金Shahrekord University for financial supportpartially supported by the Center of Excellence for Mathematics, University of Shahrekord, Shahrekord, Iran
文摘In this paper, we present a neighborhood following primal-dual interior-point algorithm for solving symmetric cone convex quadratic programming problems, where the objective function is a convex quadratic function and the feasible set is the intersection of an affine subspace and a symmetric cone attached to a Euclidean Jordan algebra. The algorithm is based on the [13] broad class of commutative search directions for cone of semidefinite matrices, extended by [18] to arbitrary symmetric cones. Despite the fact that the neighborhood is wider, which allows the iterates move towards optimality with longer steps, the complexity iteration bound remains as the same result of Schmieta and Alizadeh for symmetric cone optimization problems.
