Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(combinatorial group testing). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Royal Holloway, University of London

1. Kalogridis, Georgios. Preemptive mobile code protection using spy agents.

Degree: PhD, 2011, Royal Holloway, University of London

This thesis introduces 'spy agents' as a new security paradigm for evaluating trust in remote hosts in mobile code scenarios. In this security paradigm, a spy agent, i.e. a mobile agent which circulates amongst a number of remote hosts, can employ a variety of techniques in order to both appear 'normal' and suggest to a malicious host that it can 'misuse' the agent's data or code without being held accountable. A framework for the operation and deployment of such spy agents is described. Subsequently, a number of aspects of the operation of such agents within this framework are analysed in greater detail. The set of spy agent routes needs to be constructed in a manner that enables hosts to be identified from a set of detectable agent-specific outcomes. The construction of route sets that both reduce the probability of spy agent detection and support identification of the origin of a malicious act is analysed in the context of combinatorial group testing theory. Solutions to the route set design problem are proposed. A number of spy agent application scenarios are introduced and analysed, including: a) the implementation of a mobile code email honeypot system for identifying email privacy infringers, b) the design of sets of agent routes that enable malicious host detection even when hosts collude, and c) the evaluation of the credibility of host classification results in the presence of inconsistent host behaviour. Spy agents can be used in a wide range of applications, and it appears that each application creates challenging new research problems, notably in the design of appropriate agent route sets.

Subjects/Keywords: 500; Spy agents; Group testing; Combinatorial designs; Kalogridis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kalogridis, G. (2011). Preemptive mobile code protection using spy agents. (Doctoral Dissertation). Royal Holloway, University of London. Retrieved from https://pure.royalholloway.ac.uk/portal/en/publications/preemptive-mobile-code-protection-using-spy-agents(9206cfe5-3bee-452b-8962-557f4e0c414a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.549588

Chicago Manual of Style (16th Edition):

Kalogridis, Georgios. “Preemptive mobile code protection using spy agents.” 2011. Doctoral Dissertation, Royal Holloway, University of London. Accessed September 29, 2020. https://pure.royalholloway.ac.uk/portal/en/publications/preemptive-mobile-code-protection-using-spy-agents(9206cfe5-3bee-452b-8962-557f4e0c414a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.549588.

MLA Handbook (7th Edition):

Kalogridis, Georgios. “Preemptive mobile code protection using spy agents.” 2011. Web. 29 Sep 2020.

Vancouver:

Kalogridis G. Preemptive mobile code protection using spy agents. [Internet] [Doctoral dissertation]. Royal Holloway, University of London; 2011. [cited 2020 Sep 29]. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/preemptive-mobile-code-protection-using-spy-agents(9206cfe5-3bee-452b-8962-557f4e0c414a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.549588.

Council of Science Editors:

Kalogridis G. Preemptive mobile code protection using spy agents. [Doctoral Dissertation]. Royal Holloway, University of London; 2011. Available from: https://pure.royalholloway.ac.uk/portal/en/publications/preemptive-mobile-code-protection-using-spy-agents(9206cfe5-3bee-452b-8962-557f4e0c414a).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.549588


Virginia Tech

2. Aprahamian, Hrayer Yaznek Berg. Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations.

Degree: PhD, Industrial and Systems Engineering, 2018, Virginia Tech

Group (pooled) testing, i.e., testing multiple subjects simultaneously with a single test, is essential for classifying a large population of subjects as positive or negative for a binary characteristic (e.g., presence of a disease, genetic disorder, or a product defect). While group testing is used in various contexts (e.g., screening donated blood or for sexually transmitted diseases), a lack of understanding of how an optimal grouping scheme should be designed to maximize classification accuracy under a budget constraint hampers screening efforts. We study Dorfman and Array group testing designs under subject-specific risk characteristics, operational constraints, and imperfect tests, considering classification accuracy-, efficiency-, robustness-, and equity-based objectives, and characterize important structural properties of optimal testing designs. These properties provide us with key insights and allow us to model the testing design problems as network flow problems, develop efficient algorithms, and derive insights on equity and robustness versus accuracy trade-off. One of our models reduces to a constrained shortest path problem, for a special case of which we develop a polynomial-time algorithm. We also show that determining an optimal risk-based Dorfman testing scheme that minimizes the expected number of tests is tractable, resolving an open conjecture. Our case studies, on chlamydia screening and screening of donated blood, demonstrate the value of optimal risk-based testing designs, which are shown to be less expensive, more accurate, more equitable, and more robust than current screening practices. Advisors/Committee Members: Bish, Ebru K. (committeechair), Bish, Douglas R. (committeechair), Moran Ramirez, Diego (committee member), Bansal, Manish (committee member).

Subjects/Keywords: Public Health Screening; Group Testing; Risk-based Testing; Robust Optimization; Combinatorial Optimization; Dilution effect of Pooling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Aprahamian, H. Y. B. (2018). Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/95169

Chicago Manual of Style (16th Edition):

Aprahamian, Hrayer Yaznek Berg. “Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations.” 2018. Doctoral Dissertation, Virginia Tech. Accessed September 29, 2020. http://hdl.handle.net/10919/95169.

MLA Handbook (7th Edition):

Aprahamian, Hrayer Yaznek Berg. “Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations.” 2018. Web. 29 Sep 2020.

Vancouver:

Aprahamian HYB. Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations. [Internet] [Doctoral dissertation]. Virginia Tech; 2018. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10919/95169.

Council of Science Editors:

Aprahamian HYB. Optimal Risk-based Pooled Testing in Public Health Screening, with Equity and Robustness Considerations. [Doctoral Dissertation]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/95169

3. Chodoriwsky, Jacob N. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .

Degree: 2012, University of Ottawa

Combinatorial Group Testing (CGT) is a process of identifying faulty interactions (“errors”) within a particular set of items. Error Locating Arrays (ELAs) are combinatorial designs that can be built from Covering Arrays (CAs) to not only cover all errors in a system (each involving up to a certain number of items), but to locate and identify the errors as well. In this thesis, we survey known results for CGT, as well as CAs, ELAs, and some other types of related arrays. More importantly, we give several new results. First, we give a new algorithm that can be used to test a system in which each component (factor) has two options (values), and at most two errors are present. We show that, for systems with at most two errors, our algorithm improves upon a related algorithm by Mart´ınez et al. in terms of both robustness and efficiency. Second, we give the first adaptive CGT algorithm that can identify, among a given set of k items, all faulty interactions involving up to three items. We then compare it, performance-wise, to current-best nonadaptive method that can identify faulty interactions involving up to three items. We also give the first adaptive ELA-building algorithm that can identify all faulty interactions involving up to three items when safe values are known. Both of our new algorithms are generalizations of ones previously given by Mart´ınez et al. for identifying all faulty interactions involving up to two items.

Subjects/Keywords: combinatorial group testing; CGT; error locating arrays; ELA; covering arrays; CA; adaptive; algorithm; testing problem; software testing; CAFE; forbidden edges; forbidden hyperedges; hypergraph testing; group testing for complexes; safe values

…or in an equivalent one. In Chapter 4, we introduce combinatorial group testing (CGT… …Throughout the combinatorial design and testing literature, tests are often defined in terms of… …List of Tables 1.1 A desktop computer testing problem… …theatre testing problem. 4 . . . . 25 . . . . . . . . . . . . . . . . . . . 29 5.1… …require us to organize a finite set according to some constraints. Combinatorial designs allow us… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chodoriwsky, J. N. (2012). Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/23083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Thesis, University of Ottawa. Accessed September 29, 2020. http://hdl.handle.net/10393/23083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chodoriwsky, Jacob N. “Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing .” 2012. Web. 29 Sep 2020.

Vancouver:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Internet] [Thesis]. University of Ottawa; 2012. [cited 2020 Sep 29]. Available from: http://hdl.handle.net/10393/23083.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chodoriwsky JN. Error Locating Arrays, Adaptive Software Testing, and Combinatorial Group Testing . [Thesis]. University of Ottawa; 2012. Available from: http://hdl.handle.net/10393/23083

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.