The Experts below are selected from a list of 32025 Experts worldwide ranked by ideXlab platform

Sébastien Gaboury - One of the best experts on this subject based on the ideXlab platform.

  • Graph Methods for Generating Test Cases with Universal and Existential Constraints
    2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$Φ of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.

  • ICTSS - Graph Methods for Generating Test Cases with Universal and Existential Constraints
    Testing Software and Systems, 2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$i¾? of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.

G.c. Nandi - One of the best experts on this subject based on the ideXlab platform.

  • A rough set based reasoning approach for criminal identification
    International Journal of Machine Learning and Cybernetics, 2019
    Co-Authors: Avinash Kumar Singh, Neha Baranwal, G.c. Nandi
    Abstract:

    As a supplement to mugshot detection, a new approach is proposed to capture the eyewitness’s visual perception in the form of symbolic representation. It reveals physiological and facial characteristics of criminal which help in their identification. A rough set theory based technique is introduced to model those symbolic representations. This approach provides an intuitive insight to process criminal’s imprecise and imperfect knowledge. We used a benchmark mug-shot dataset consisting of 300 criminals faces from the Chinese University of Hong Kong (CUHK) to study the correctness of our proposed model. We took the help of 105 students of Indian Institute of Information Technology, Allahabad, who were treated as eyewitness to depict the visual perception about 300 criminal faces of CUHK. The experimental verification is composed of two modes which are analogous to viewed sketches and forensic sketches. Like viewed sketches we have Generated Test Case-I, where perception is given while looking at the photo whereas Test Case-II is like the forensic sketches where the description is given by recalling the memory. We have achieved encouraging results on the viewed sketch database as well as forensic sketch database.

Sylvain Hallé - One of the best experts on this subject based on the ideXlab platform.

  • Graph Methods for Generating Test Cases with Universal and Existential Constraints
    2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$Φ of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.

  • ICTSS - Graph Methods for Generating Test Cases with Universal and Existential Constraints
    Testing Software and Systems, 2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$i¾? of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.

Avinash Kumar Singh - One of the best experts on this subject based on the ideXlab platform.

  • A rough set based reasoning approach for criminal identification
    International Journal of Machine Learning and Cybernetics, 2019
    Co-Authors: Avinash Kumar Singh, Neha Baranwal, G.c. Nandi
    Abstract:

    As a supplement to mugshot detection, a new approach is proposed to capture the eyewitness’s visual perception in the form of symbolic representation. It reveals physiological and facial characteristics of criminal which help in their identification. A rough set theory based technique is introduced to model those symbolic representations. This approach provides an intuitive insight to process criminal’s imprecise and imperfect knowledge. We used a benchmark mug-shot dataset consisting of 300 criminals faces from the Chinese University of Hong Kong (CUHK) to study the correctness of our proposed model. We took the help of 105 students of Indian Institute of Information Technology, Allahabad, who were treated as eyewitness to depict the visual perception about 300 criminal faces of CUHK. The experimental verification is composed of two modes which are analogous to viewed sketches and forensic sketches. Like viewed sketches we have Generated Test Case-I, where perception is given while looking at the photo whereas Test Case-II is like the forensic sketches where the description is given by recalling the memory. We have achieved encouraging results on the viewed sketch database as well as forensic sketch database.

Edmond Chance - One of the best experts on this subject based on the ideXlab platform.

  • Graph Methods for Generating Test Cases with Universal and Existential Constraints
    2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$Φ of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.

  • ICTSS - Graph Methods for Generating Test Cases with Universal and Existential Constraints
    Testing Software and Systems, 2015
    Co-Authors: Sylvain Hallé, Edmond Chance, Sébastien Gaboury
    Abstract:

    We introduce a generalization of the t-way Test Case generation problem, where parameter t is replaced by a set $$\varPhi $$i¾? of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of Tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every Generated Test Case, and those that must be true for at least one Test Case. Experimental results show that the proposed solution produces Test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over Test Cases.