Software defect prediction aims to use measurement data of code and historical defects to predict potential problems,optimize testing resources and defect management.However,current methods face challenges:(1)Coarse-g...Software defect prediction aims to use measurement data of code and historical defects to predict potential problems,optimize testing resources and defect management.However,current methods face challenges:(1)Coarse-grained file level detection cannot accurately locate specific defects.(2)Fine-grained line-level defect prediction methods rely solely on local information of a single line of code,failing to deeply analyze the semantic context of the code line and ignoring the heuristic impact of line-level context on the code line,making it difficult to capture the interaction between global and local information.Therefore,this paper proposes a telecontext-enhanced recursive interactive attention fusion method for line-level defect prediction(TRIA-LineDP).Firstly,using a bidirectional hierarchical attention network to extract semantic features and contextual information from the original code lines as the basis.Then,the extracted contextual information is forwarded to the telecontext capture module to aggregate the global context,thereby enhancing the understanding of broader code dynamics.Finally,a recursive interaction model is used to simulate the interaction between code lines and line-level context,passing information layer by layer to enhance local and global information exchange,thereby achieving accurate defect localization.Experimental results from within-project defect prediction(WPDP)and cross-project defect prediction(CPDP)conducted on nine different projects(encompassing a total of 32 versions)demonstrated that,within the same project,the proposed methods will respectively recall at top 20%of lines of code(Recall@Top20%LOC)and effort at top 20%recall(Effort@Top20%Recall)has increased by 11%–52%and 23%–77%.In different projects,improvements of 9%–60%and 18%–77%have been achieved,which are superior to existing advanced methods and have good detection performance.展开更多
The importance of the zeros of multwariable linear systems is well-knoiun in terms of measure obstructions to the controllability and the. observability. In this paper, a recursive decarnposi Am oj interconnected syst...The importance of the zeros of multwariable linear systems is well-knoiun in terms of measure obstructions to the controllability and the. observability. In this paper, a recursive decarnposi Am oj interconnected systems is outlined by taking into account the sequential structure of the connnections. The paper extends the, coordinate, module-theoretic studies from the elementary algebraic systems theory to include the case oj such linear interconnected systems which need not to be controllable or observable. Also, the properties of controllability and observability, the decoupling zeros and the signal Making issues are characterized.展开更多
It is difficult to analyze semantic relations automatically, especially the semantic relations of Chinese special sentence patterns. In this paper, we apply a novel model feature structure to represent Chinese semanti...It is difficult to analyze semantic relations automatically, especially the semantic relations of Chinese special sentence patterns. In this paper, we apply a novel model feature structure to represent Chinese semantic relations, which is formalized as ＂recursive directed graph＂. We focus on Chinese special sentence patterns, including the complex noun phrase, verb-complement structure, pivotal sentences, serial verb sentence and subject-predicate predicate sentence. Feature structure facilitates a richer Chinese semantic information extraction when compared with dependency structure. The results show that using recursive directed graph is more suitable for extracting Chinese complex semantic relations.展开更多
For any given 0 〈α 〈 β 〈 ∞, we construct a tree such that under tree metric, the Hausdorff dimension of the corresponding boundary is α, but both the Packing dimension and the boxing dimension are β. Applying ...For any given 0 〈α 〈 β 〈 ∞, we construct a tree such that under tree metric, the Hausdorff dimension of the corresponding boundary is α, but both the Packing dimension and the boxing dimension are β. Applying the connection between tree and iterated functions system, non- regular fractal sets on real line are constructed. Moreover, the method adopted in our paper is different from those which have been used before for constructing non-regular fractal set in general metric space.展开更多
Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper,...Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.展开更多
基金supported by National Natural Science Foundation of China(no.62376240).
文摘Software defect prediction aims to use measurement data of code and historical defects to predict potential problems,optimize testing resources and defect management.However,current methods face challenges:(1)Coarse-grained file level detection cannot accurately locate specific defects.(2)Fine-grained line-level defect prediction methods rely solely on local information of a single line of code,failing to deeply analyze the semantic context of the code line and ignoring the heuristic impact of line-level context on the code line,making it difficult to capture the interaction between global and local information.Therefore,this paper proposes a telecontext-enhanced recursive interactive attention fusion method for line-level defect prediction(TRIA-LineDP).Firstly,using a bidirectional hierarchical attention network to extract semantic features and contextual information from the original code lines as the basis.Then,the extracted contextual information is forwarded to the telecontext capture module to aggregate the global context,thereby enhancing the understanding of broader code dynamics.Finally,a recursive interaction model is used to simulate the interaction between code lines and line-level context,passing information layer by layer to enhance local and global information exchange,thereby achieving accurate defect localization.Experimental results from within-project defect prediction(WPDP)and cross-project defect prediction(CPDP)conducted on nine different projects(encompassing a total of 32 versions)demonstrated that,within the same project,the proposed methods will respectively recall at top 20%of lines of code(Recall@Top20%LOC)and effort at top 20%recall(Effort@Top20%Recall)has increased by 11%–52%and 23%–77%.In different projects,improvements of 9%–60%and 18%–77%have been achieved,which are superior to existing advanced methods and have good detection performance.
文摘The importance of the zeros of multwariable linear systems is well-knoiun in terms of measure obstructions to the controllability and the. observability. In this paper, a recursive decarnposi Am oj interconnected systems is outlined by taking into account the sequential structure of the connnections. The paper extends the, coordinate, module-theoretic studies from the elementary algebraic systems theory to include the case oj such linear interconnected systems which need not to be controllable or observable. Also, the properties of controllability and observability, the decoupling zeros and the signal Making issues are characterized.
基金Supported by the National Natural Science Foundation of China(61202193,61202304)the Major Projects of Chinese National Social Science Foundation(11&ZD189)+2 种基金the Chinese Postdoctoral Science Foundation(2013M540593,2014T70722)the Accomplishments of Listed Subjects in Hubei Prime Subject Developmentthe Open Foundation of Shandong Key Lab of Language Resource Development and Application
文摘It is difficult to analyze semantic relations automatically, especially the semantic relations of Chinese special sentence patterns. In this paper, we apply a novel model feature structure to represent Chinese semantic relations, which is formalized as ＂recursive directed graph＂. We focus on Chinese special sentence patterns, including the complex noun phrase, verb-complement structure, pivotal sentences, serial verb sentence and subject-predicate predicate sentence. Feature structure facilitates a richer Chinese semantic information extraction when compared with dependency structure. The results show that using recursive directed graph is more suitable for extracting Chinese complex semantic relations.
文摘For any given 0 〈α 〈 β 〈 ∞, we construct a tree such that under tree metric, the Hausdorff dimension of the corresponding boundary is α, but both the Packing dimension and the boxing dimension are β. Applying the connection between tree and iterated functions system, non- regular fractal sets on real line are constructed. Moreover, the method adopted in our paper is different from those which have been used before for constructing non-regular fractal set in general metric space.
基金the National Natural Science Foundation of China under grant No.69903003,Defence Science and Technology Key Laboratory Foundat
文摘Pointer analysis is a technique to identify at compile-time the potential values of the pointer expressions in a program, which promises significant benefits for optimizing and parallelizing compilers. In this paper, a new approach to pointer analysis for assignments is presented. In this approach, assignments are classified into three categories: pointer assignments, structure (union) assignments and normal assignments which don't affect the point-to information. Pointer analyses for these three kinds of assignments respectively make up the integrated algorithm. When analyzing a pointer assignment, a new method called expression expansion is used to calculate both the left targets and the right targets. The integration of recursive data structure analysis into pointer analysis is a significant originality of this paper, which uniforms the pointer analysis for heap variables and the pointer analysis for stack variables. This algorithm is implemented in Agassiz, an analyzing tool for C programs developed by institute of Parallel Processing, Fudan University. Its accuracy and effectiveness are illustrated by experimental data.
