Skip to main content

Anomaly Detection and Three Anomalous Coins Problem

  • Chapter
  • First Online:
  • 742 Accesses

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 396))

Abstract

Counterfeit coin problem has been considered for a very long time and is a topic of great significance in Mathematics as well as in Computer Science. In this problem, out of n given coins, one or more false coins (the coins are classified as false because of their different weight from a standard coin) are present which have the same appearance as the other coins. The word counterfeit or anomalous means something deviated from the standard one. In this respect, finding out these anomalous objects from a given set of data items is of utmost importance in data learning problem. Thus, representing coins as any data items, we have introduced an algorithm to determine three false coins out of n given coins. In addition, our objective is to solve the problem in minimum number of comparisons with the help of an equal arm balance.

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

Buying options

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 EPUB and 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

References

  1. Ghosh, J., Senmajumdar, P., Maitra, S., Dhal, D., Pal, R.K.: A generalized algorithm for solving n coins problem. In: Proceedings of the 2011 IEEE International Conference on Computer Science and Automation Engineering (CSAE 2011), vol. 2, pp. 411–415. Shanghai (2011)

    Google Scholar 

  2. Ghosh, J., Senmajumdar, P., Maitra, S., Dhal, D., Pal, R.K.: Yet another algorithm for solving n coins problem. Assam Univ. J. Sci. Technol.: Phys. Sci. Technol. 8(II), 118–125 (2011). ISSN: 0975-2773

    Google Scholar 

  3. Tošić, R.: Two counterfeit coins. Discrete Math. 46, 295–298 (1983) (North-Holland)

    Google Scholar 

  4. Manvel, B.: Counterfeit coin problems, mathematics magazine, mathematical association of America 50(2), 90–92 (1977)

    Google Scholar 

  5. Bellman, R., Gluss, B.: On various versions of the defective coin problem. Inf. Control 4(2–3), 118–131 (1961)

    Article  MATH  Google Scholar 

  6. Ghosh, J., Dey, L., Nandy, A., Chakraborty, A., Datta, P., Pal, R.K., Samanta, R.K.: An advanced approach to solve two counterfeit coins problem. Proc. Ann. Pure Appl. Math. 7(1), 77–82 (2014). ISSN:2279-087X (P), 2279-0888 (online)

    Google Scholar 

  7. Ghosh, J., Datta, P., Chakraborty, A., Nandy, A., Dey, L., Pal, R.K., Samanta, R.K.: An endeavour to find two unequal false coins. In: Proceedings of the 8th International Conference on Electrical and Computer Engineering (ICECE 2014), pp. 333–336. Dhaka (2014)

    Google Scholar 

  8. Ghosh, J., Chakraborty, A., Datta, P., Dey, L., Nandy, A., Pal, R.K., Samanta, R.K.: The first algorithm for solving two coins counterfeiting with ω(ΔH) = ω(ΔL). In: Proceedings of the 8th International Conference on Electrical and Computer Engineering (ICECE 2014), pp. 337–340. Dhaka (2014)

    Google Scholar 

  9. Ghosh, J., Nandy, A., Dey, L., Datta, P., Chakraborty, A., Pal, R.K., Samanta, R.K.: An algorithm for identifying two unequal heavier / lighter coins out of n given coins. In: Proceedings of the 3rd International Conference on Computer, Communication, Control and Information Technology (C3IT2015), pp. 1–6. Academy of Technology, West Bengal (2015)

    Google Scholar 

  10. Kim, J.H.: Finding Weighted Graphs by Combinatorial Search (2012). arXiv:1201.3793v1 [math.CO]

    Google Scholar 

  11. Lim, E.W.C.: On Anomaly Identification and the Counterfeit Coin Problem (2009) arXiv:0905.0085

    Google Scholar 

  12. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications Series on Applied Mathematics, vol. 3. World Scientific Publishing Co. Pvt. Ltd., Singapore (1993)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arpan Chakraborty .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this chapter

Cite this chapter

Chakraborty, A., Ghosh, J., Datta, P., Nandy, A., Pal, R.K. (2016). Anomaly Detection and Three Anomalous Coins Problem. In: Chaki, R., Cortesi, A., Saeed, K., Chaki, N. (eds) Advanced Computing and Systems for Security. Advances in Intelligent Systems and Computing, vol 396. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2653-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2653-6_20

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2651-2

  • Online ISBN: 978-81-322-2653-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics