Dongmei Liu

Hong Zhu, Ian Bayley, Dongmei Liu et al.

This paper presents an automated tool called Morphy for datamorphic testing. It classifies software test artefacts into test entities and test morphisms, which are mappings on testing entities. In addition to datamorphisms, metamorphisms and seed test case makers, Morphy also employs a set of other test morphisms including test case metrics and filters, test set metrics and filters, test result analysers and test executers to realise test automation. In particular, basic testing activities can be automated by invoking test morphisms. Test strategies can be realised as complex combinations of test morphisms. Test processes can be automated by recording, editing and playing test scripts that invoke test morphisms and strategies. Three types of test strategies have been implemented in Morphy: datamorphism combination strategies, cluster border exploration strategies and strategies for test set optimisation via genetic algorithms. This paper focuses on the datamorphism combination strategies by giving their definitions and implementation algorithms. The paper also illustrates their uses for testing both traditional software and AI applications with three case studies.

Hong Zhu, Dongmei Liu, Ian Bayley et al.

With the rapid growth of the applications of machine learning (ML) and other artificial intelligence (AI) techniques, adequate testing has become a necessity to ensure their quality. This paper identifies the characteristics of AI applications that distinguish them from traditional software, and analyses the main difficulties in applying existing testing methods. Based on this analysis, we propose a new method called datamorphic testing and illustrate the method with an example of testing face recognition applications. We also report an experiment with four real industrial application systems of face recognition to validate the proposed approach.

Huai-An Diao, Dongmei Liu, Sanzheng Qiao

This paper is devoted to a structured perturbation analysis of the symmetric algebraic Riccati equations by exploiting the symmetry structure. Based on the analysis, the upper bounds for the structured normwise, mixed and componentwise condition numbers are derived. Due to the exploitation of the symmetry structure, our results are improvements of the previous work on the perturbation analysis and condition numbers of the symmetric algebraic Riccati equations. Our preliminary numerical experiments demonstrate that our condition numbers provide accurate estimates for the change in the solution caused by the perturbations on the data. Moreover, by applying the small sample condition estimation method, we propose a statistical algorithm for practically estimating the condition numbers of the symmetric algebraic Riccati equations.