Lone wolf terrorists pose a large threat to modern society. The current ability to identify and stop these kinds of terrorists before they commit a terror act is limited since they are hard to detect using traditional methods. However, these individuals often make use of Internet to spread their beliefs and opinions, and to obtain information and knowledge to plan an attack. Therefore there is a good possibility that they leave digital traces in the form of weak signals that can be gathered, fused, and analyzed. In this article we present an analysis method that can be used to analyze extremist forums to detect digital traces of possible lone wolf terrorists. This method is conceptually demonstrated using the FOI Impactorium fusion platform. We also present a number of different technologies which can be used to harvest and analyze pieces of information from Internet that may serve as weak digital traces that can be fused using the suggested analysis method in order to discover possible lone wolf terrorists.

No abstract

We study damage spreading in the ferromagnetic Ising model on small world networks using Monte Carlo simulation with Glauber dynamics. The damage spreading temperature T(d) is determined as a function of rewiring probability p for small world networks obtained by rewiring the two-dimensional square and three dimensional cubic lattices. We find that the damage for different values of p collapse onto master curves when plotted against a rescaled temperature and that the distance between T(d) and the critical temperature T(c) increases with p. We argue that when using the Ising model to study social systems, it is necessary to place the spins on a small world network rather than on a regular lattice.

Using T=0 Monte Carlo and simulated annealing simulation, we study the energy relaxation of ferromagnetic Ising and Potts models on random graphs. In addition to the expected exponential decay to a zero energy ground state, a range of connectivities for which there is power law relaxation and freezing to a metastable state is found. For some connectivities this freezing persists even using simulated annealing to find the ground state. The freezing is caused by dynamic frustration in the graphs, and is a feature of the local search nature of the Monte Carlo dynamics used. The implications of the freezing on agent-based complex system models are briefly considered.

Using T = 0 Monte Carlo simulation, we study the relaxation of graph coloring (K-COL) and satisfiability (K-SAT), two hard problems that have recently been shown to possess a phase transition in solvability as a parameter is varied. A change from exponentially fast to power law relaxation, and a transition to freezing behavior are found. These changes take place for smaller values of the parameter than the solvability transition. Results for the coloring problem for colorable and clustered graphs and for the fraction of persistent spins for satisfiability are also presented.