Collective traffic-like movement of ants on a trail: dynamical phases and phase transitions

The traffic-like collective movement of ants on a trail can be described by a stochastic cellular automaton model. We have earlier investigated its unusual flow-density relation by using various mean field approximations and computer simulations. In this paper, we study the model following an alternative approach based on the analogy with the zero range process, which is one of the few known exactly solvable stochastic dynamical models. We show that our theory can quantitatively account for the unusual non-monotonic dependence of the average speed of the ants on their density for finite lattices with periodic boundary conditions. Moreover, we argue that the model exhibits a continuous phase transition at the critial density only in a limiting case. Furthermore, we investigate the phase diagram of the model by replacing the periodic boundary conditions by open boundary conditions.Comment: 8 pages, 6 figure

A Family of Controllable Cellular Automata for Pseudorandom Number Generation

In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs. The ENT and DIEHARD test suites are used to evaluate the randomness of these CCA PRNGs. The results show that their randomness is better than that of conventional CA and PCA PRNGs while they do not lose the structure simplicity of 1-d CA. Moreover, their randomness can be comparable to that of 2-d CA PRNGs. Furthermore, we integrate six different types of CCA PRNGs to form CCA PRNG groups to see if the randomness quality of such groups could exceed that of any individual CCA PRNG. Genetic Algorithm (GA) is used to evolve the configuration of the CCA PRNG groups. Randomness test results on the evolved CCA PRNG groups show that the randomness of the evolved groups is further improved compared with any individual CCA PRNG

Semiclassical Methods for Hawking Radiation from a Vaidya Black Hole

We derive the general form of Hawking temperature for Vaidya black hole in the tunneling pictures. This kind of black hole is regarded as the description of a more realistic one since it's time dependent decreasing mass due to the evaporation process. Clearly, the temperature would be time dependent as our findings. We use the semiclassical methods, namely radial null geodesic and complex paths methods. Both methods are found to give the same results. Then, we discuss the possible form of corresponding entropy.Comment: REVTeX 4, 11 pages, no figures, accepted for publication in IJMPA; v2: eq.5 is correcte

More security or less insecurity

We depart from the conventional quest for ‘Completely Secure Systems’ and ask ‘How can we be more Secure’. We draw heavily from the evolution of the Theory of Justice and the arguments against the institutional approach to Justice. Central to our argument is the identification of redressable insecurity, or weak links. Our contention is that secure systems engineering is not really about building perfectly secure systems but about redressing manifest insecurities.Final Accepted Versio