Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Mathematical Methods for Destabilizing Terrorist Activities - Methods and Practical Algorithms

Mathematical Methods for Destabilizing Terrorist Activities

Methods and Practical Algorithms for Analysis and Visualization

Memon, Nasrullah, Wiil, Uffe (Eds.)

2014, 300 p. 30 illus. in color.


Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

ISBN 978-3-211-99441-2

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items

  • About this book

  • Shows how mathematics and computer science can be utilized to counteract terrorism
  • Provides new algorithms for finding direct and indirect relations in networks
  • Features contributions from leading counterterrorism experts who offer their views and strategies on the topic
  • Combines theoretical and practical aspects with case studies
  • Offers a tool-box for Intelligence and Law Enforcement agencies
The primary objective of this research is to develop the underlying theory and associated methodologies used to generate and analyze terrorist networks and propose mathematical methods and practical algorithms for destabilizing these adversaries. It aims to develop a new centrality-like measure, via extensions of several others in use to screen networks for agents of interest. Presents the theoretical bases that make this measure more amenable to terrorist networks, and their advantages. Provides a theory of detecting command structures of terrorist networks. The algorithms for detecting hidden hierarchy of terrorist network are discussed. Results of command structure obtained by using new algorithms and other centralities with related SNA literature like N-Clique, K-Core, etc. are compared. Includes new algorithms for finding direct and indirect relations in a network. Combines the most promising techniques into a prototype tool-set to assist intelligence agencies / law enforcement and others.

Content Level » Research

Keywords » Algorithms - Clique - Homeland security - K-Core - K-Plex - Mathematical Methods - N-Clique - Practical methods - SNA - Terrorist cells - Terrorist destabilization

Related subjects » Computational Science & Engineering - Criminology & Criminal Justice - Game Theory / Mathematical Methods - Social Sciences & Law - Theoretical Computer Science

Table of contents 

Table of Contents.- Part 1: Understanding Terrorism,Terrorist and Terrorist Organization.- Chapter 1: Terrorism and Terrorists.- Chapter 2: Terrorist Organizations and groups.- Chapter 3: How it all begun.- Chapter 4: Investigative Data Mining.- Chapter 5: Terrorist Network Analysis.- Chapter 6: Visualizing Networks.- Chapter 7: Cohesion analysis and detecting critical regions.- Chapter 8: Extending Social Network Analysis.- Chapter 9: Detecting Hidden Hierarchy.- Chapter 10: Investigative Data Mining Tool Kit (iMiner).- Chapter 11: Practical Data Sets.

Popular Content within this publication 



Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Probability and Statistics in Computer Science.