Repository logo
Communities & Collections
All of DSpace
  • English
  • العربية
  • বাংলা
  • Català
  • Čeština
  • Deutsch
  • Ελληνικά
  • Español
  • Suomi
  • Français
  • Gàidhlig
  • हिंदी
  • Magyar
  • Italiano
  • Қазақ
  • Latviešu
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Српски
  • Svenska
  • Türkçe
  • Yкраї́нська
  • Tiếng Việt
Log In
Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Makkar, T."

Filter results by typing the first few letters
Now showing 1 - 3 of 3
  • Results Per Page
  • Sort Options
  • No Thumbnail Available
    Item
    Extended game theoretic dirichlet based collaborative intrusion detection systems
    (2016) Paul, S.; Makkar, T.; Chandrasekaran, K.
    Security has always been one of the key issues of any man-made system, this paved the way for a submodule or application or a device to monitor or system for malicious activities. This system or submodule or device is known as Intrusion Detection System (IDS). As technology evolves so does the associated threats and thus the intrusion detection system needs to evolve. Game theory throws in a different perspective which have not been looked upon much. Game theory provides a way of mathematically formalizing the decision making process of policy establishment and execution. Notion of game theory can be used in intrusion detection system in assisting in defining and reconfiguring security policies given the severity of attacks dynamically. We are trying to formulate a robust model for the theoretical limits of a game theoretic approach to IDS. The most important flaw of game theory is that it assumes the adversary�s rationality and doesn�t take into consideration multiple simultaneous attacks. Therefore, a collaborative trust and Dirichlet distribution based robust game theoretic approach is proposed which will try to resolve this issue. Reinforced learning approaches using Markov Decision Process will be utilized to make it robust to multiple simultaneous attacks. � Springer Science+Business Media Singapore 2016.
  • No Thumbnail Available
    Item
    Extended game theoretic dirichlet based collaborative intrusion detection systems
    (Springer Verlag service@springer.de, 2016) Paul, S.; Makkar, T.; Chandrasekaran, K.
    Security has always been one of the key issues of any man-made system, this paved the way for a submodule or application or a device to monitor or system for malicious activities. This system or submodule or device is known as Intrusion Detection System (IDS). As technology evolves so does the associated threats and thus the intrusion detection system needs to evolve. Game theory throws in a different perspective which have not been looked upon much. Game theory provides a way of mathematically formalizing the decision making process of policy establishment and execution. Notion of game theory can be used in intrusion detection system in assisting in defining and reconfiguring security policies given the severity of attacks dynamically. We are trying to formulate a robust model for the theoretical limits of a game theoretic approach to IDS. The most important flaw of game theory is that it assumes the adversary’s rationality and doesn’t take into consideration multiple simultaneous attacks. Therefore, a collaborative trust and Dirichlet distribution based robust game theoretic approach is proposed which will try to resolve this issue. Reinforced learning approaches using Markov Decision Process will be utilized to make it robust to multiple simultaneous attacks. © Springer Science+Business Media Singapore 2016.
  • No Thumbnail Available
    Item
    Software development using context aware searching of components in large repositories
    (2015) Paul, S.; Makkar, T.; Chandrasekaran, K.
    This paper proposes a new approach to locate software components from large component online open source repositories which encompasses the inherent features of context-aware browsing, ranking and semantic tagging. Tagging of individual components helps making search fast and efficient. We are trying to improvise the results of context aware browsing by ranking them on the basis of Hidden Markov Models. The inputs to Hidden Markov Models consists of auto generated contextual queries. These queries formulate the resource set of our Hidden Markov model. The queries are ameliorated using reformulation, specialization, generalization and general association. This automation not only reduces the search space of components for an efficient browsing but also it enables developers to use those components whose existence they do not even prognosticate. � 2015 IEEE.

Maintained by Central Library NITK | DSpace software copyright © 2002-2026 LYRASIS

  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify