Skip to main content
SpringerLink
Log in
Book cover

International Conference on Intelligence and Security Informatics

ISI 2006: Intelligence and Security Informatics pp 319–330Cite as

Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3975))

Abstract

Following work of Stroud and Saeger, we investigate the formulation of the port of entry inspection algorithm problem as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on an experimental analysis of the robustness of the conclusions of the Stroud-Saeger analysis and show that the optimal inspection strategy is remarkably insensitive to variations in the parameters needed to apply the Stroud-Saeger method.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boros, E., Ibaraki, T., Makino, K.: Logical Analysis of Binary Data with Missing Bits. Artificial Intelligence 107, 219–263 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Boros, E., Ibaraki, T., Makino, K.: Variations on Extending Partially Defined Boolean Functions with Missing Bits. Information and Computation 180, 53–70 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chiu, S.Y., Cox, L.A., Sun, X.: Least-Cost Failure Diagnosis in Uncertain Reliability Systems. Reliability Engineering and System Safety 54, 203–216 (1996)

    Article  Google Scholar 

  4. Duffuaa, S.O., Raouf, A.: An Optimal Sequence in Multicharacteristics Sequence. Journal of Optimization Theory and Applications 67, 79–87 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hyafil, L., Rivest, R.L.: Constructing Optimal Binary Decision Trees is NP-Complete. Information Processing Letters 5, 15–17 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lauritzen, S.N., Nilsson, D.: Representing and Solving Decision Problems with Limited Information. Management Science 47, 1238–1251 (2001)

    Article  Google Scholar 

  7. Simon, H.A., Kadane, J.B.: Optimal Problem-Solving Search: All-or-None Solutions. Artificial Intelligence 6, 235–247 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  8. Stroud, P.D., Saeger, K.J.: Enumeration of Increasing Boolean Expressions and Alternative Digraph Implementations for Diagnostic Applications. In: Proceedings Volume IV, Computer, Communication and Control Technologies, pp. 328–333 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Rutgers University, Piscataway, NJ, 08854

    Saket Anand, David Madigan, Richard Mammone, Saumitr Pathak & Fred Roberts

Authors
  1. Saket Anand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David Madigan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard Mammone
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saumitr Pathak
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fred Roberts
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information and Computer Science, University of California, Irvine

    Sharad Mehrotra

  2. MIS Department, University of Arizona, 85721, Tucson, AZ, USA

    Daniel D. Zeng

  3. Department of Management Information Systems, Eller College of Management, The University of Arizona, 85721, AZ, USA

    Hsinchun Chen

  4. University of Texas at Dallas,  

    Bhavani Thuraisingham

  5. Chinese Academy of Sciences, 100190, Beijing, China

    Fei-Yue Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Anand, S., Madigan, D., Mammone, R., Pathak, S., Roberts, F. (2006). Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures. In: Mehrotra, S., Zeng, D.D., Chen, H., Thuraisingham, B., Wang, FY. (eds) Intelligence and Security Informatics. ISI 2006. Lecture Notes in Computer Science, vol 3975. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11760146_28

Download citation

  • DOI: https://doi.org/10.1007/11760146_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34478-0

  • Online ISBN: 978-3-540-34479-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation