TY - JOUR
T1 - A detection theoretic approach to modeling aviation security problems using the knapsack problem
AU - Jacobson, Sheldon H.
AU - Kobza, J. E.
AU - Easterling, Amy S.
PY - 2001
Y1 - 2001
N2 - Designers, operators and users of multiple-device, access-control security systems are challenged by the false alarm, false clear tradeoff. Given a particular access control security system, and a prescribed false clear standard, there is an optimal (minimal) false alarm rate that can be achieved. The objective of this research is to develop a new methodology for determining this false alarm rate. A static grid estimation procedure is used to estimate the joint conditional probability density functions for the security device responses. The concept of a system response function is introduced and the problem of determining a system response function that minimizes the false alarm rate, while meeting the false clear standard, is formulated as a decision problem and proven to be NP-complete. A Greedy Algorithm and a Dynamic Programming algorithm are presented to address this problem. Computational results using simulated security data are reported. These results are compared to analytical results obtained for a pre-specified system response function form. Directions for future research are also discussed.
AB - Designers, operators and users of multiple-device, access-control security systems are challenged by the false alarm, false clear tradeoff. Given a particular access control security system, and a prescribed false clear standard, there is an optimal (minimal) false alarm rate that can be achieved. The objective of this research is to develop a new methodology for determining this false alarm rate. A static grid estimation procedure is used to estimate the joint conditional probability density functions for the security device responses. The concept of a system response function is introduced and the problem of determining a system response function that minimizes the false alarm rate, while meeting the false clear standard, is formulated as a decision problem and proven to be NP-complete. A Greedy Algorithm and a Dynamic Programming algorithm are presented to address this problem. Computational results using simulated security data are reported. These results are compared to analytical results obtained for a pre-specified system response function form. Directions for future research are also discussed.
UR - http://www.scopus.com/inward/record.url?scp=85023792716&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85023792716&partnerID=8YFLogxK
U2 - 10.1080/07408170108936870
DO - 10.1080/07408170108936870
M3 - Article
AN - SCOPUS:85023792716
SN - 0740-817X
VL - 33
SP - 747
EP - 759
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 9
ER -