One Dimensional nnary Density Classification Using Two Cellular Automaton Rules

Suppose each site on a one-dimensional chain with periodic boundary condition may take on any one of the states $0,1,..., n-1$, can you find out the most frequently occurring state using cellular automaton? Here, we prove that while the above density classification task cannot be resolved by a single cellular automaton, this task can be performed efficiently by applying two cellular automaton rules in succession.Comment: Revtex, 4 pages, uses amsfont

Role based behavior analysis

Tese de mestrado, Segurança Informática, Universidade de Lisboa, Faculdade de Ciências, 2009Nos nossos dias, o sucesso de uma empresa depende da sua agilidade e capacidade de se adaptar a condições que se alteram rapidamente. Dois requisitos para esse sucesso são trabalhadores proactivos e uma infra-estrutura ágil de Tecnologias de Informacão/Sistemas de Informação (TI/SI) que os consiga suportar. No entanto, isto nem sempre sucede. Os requisitos dos utilizadores ao nível da rede podem nao ser completamente conhecidos, o que causa atrasos nas mudanças de local e reorganizações. Além disso, se não houver um conhecimento preciso dos requisitos, a infraestrutura de TI/SI poderá ser utilizada de forma ineficiente, com excessos em algumas áreas e deficiências noutras. Finalmente, incentivar a proactividade não implica acesso completo e sem restrições, uma vez que pode deixar os sistemas vulneráveis a ameaças externas e internas. O objectivo do trabalho descrito nesta tese é desenvolver um sistema que consiga caracterizar o comportamento dos utilizadores do ponto de vista da rede. Propomos uma arquitectura de sistema modular para extrair informação de fluxos de rede etiquetados. O processo é iniciado com a criação de perfis de utilizador a partir da sua informação de fluxos de rede. Depois, perfis com características semelhantes são agrupados automaticamente, originando perfis de grupo. Finalmente, os perfis individuais são comprados com os perfis de grupo, e os que diferem significativamente são marcados como anomalias para análise detalhada posterior. Considerando esta arquitectura, propomos um modelo para descrever o comportamento de rede dos utilizadores e dos grupos. Propomos ainda métodos de visualização que permitem inspeccionar rapidamente toda a informação contida no modelo. O sistema e modelo foram avaliados utilizando um conjunto de dados reais obtidos de um operador de telecomunicações. Os resultados confirmam que os grupos projectam com precisão comportamento semelhante. Além disso, as anomalias foram as esperadas, considerando a população subjacente. Com a informação que este sistema consegue extrair dos dados em bruto, as necessidades de rede dos utilizadores podem sem supridas mais eficazmente, os utilizadores suspeitos são assinalados para posterior análise, conferindo uma vantagem competitiva a qualquer empresa que use este sistema.In our days, the success of a corporation hinges on its agility and ability to adapt to fast changing conditions. Proactive workers and an agile IT/IS infrastructure that can support them is a requirement for this success. Unfortunately, this is not always the case. The user’s network requirements may not be fully understood, which slows down relocation and reorganization. Also, if there is no grasp on the real requirements, the IT/IS infrastructure may not be efficiently used, with waste in some areas and deficiencies in others. Finally, enabling proactivity does not mean full unrestricted access, since this may leave the systems vulnerable to outsider and insider threats. The purpose of the work described on this thesis is to develop a system that can characterize user network behavior. We propose a modular system architecture to extract information from tagged network flows. The system process begins by creating user profiles from their network flows’ information. Then, similar profiles are automatically grouped into clusters, creating role profiles. Finally, the individual profiles are compared against the roles, and the ones that differ significantly are flagged as anomalies for further inspection. Considering this architecture, we propose a model to describe user and role network behavior. We also propose visualization methods to quickly inspect all the information contained in the model. The system and model were evaluated using a real dataset from a large telecommunications operator. The results confirm that the roles accurately map similar behavior. The anomaly results were also expected, considering the underlying population. With the knowledge that the system can extract from the raw data, the users network needs can be better fulfilled, the anomalous users flagged for inspection, giving an edge in agility for any company that uses it

Finding The Sign Of A Function Value By Binary Cellular Automaton

Given a continuous function $f(x)$, suppose that the sign of $f$ only has finitely many discontinuous points in the interval $[0,1]$. We show how to use a sequence of one dimensional deterministic binary cellular automata to determine the sign of $f(\rho)$ where $\rho$ is the (number) density of 1s in an arbitrarily given bit string of finite length provided that $f$ satisfies certain technical conditions.Comment: Revtex, uses amsfonts, 10 page

Density Classification Quality of the Traffic-majority Rules

The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic transition rules depending on a parameter $\eta$, the traffic-majority rules. Here I derive a simplified model for these cellular automata. It is valid for a subset of the initial configurations and uses random walks and generating functions. I compare its prediction with computer simulations and show that it expresses recognition quality and time correctly for a large range of $\eta$ values.Comment: 40 pages, 9 figures. Accepted by the Journal of Cellular Automata. (Some typos corrected; the numbers for theorems, lemmas and definitions have changed with respect to version 1.

Cellular Automata Models of Road Traffic

In this paper, we give an elaborate and understandable review of traffic cellular automata (TCA) models, which are a class of computationally efficient microscopic traffic flow models. TCA models arise from the physics discipline of statistical mechanics, having the goal of reproducing the correct macroscopic behaviour based on a minimal description of microscopic interactions. After giving an overview of cellular automata (CA) models, their background and physical setup, we introduce the mathematical notations, show how to perform measurements on a TCA model's lattice of cells, as well as how to convert these quantities into real-world units and vice versa. The majority of this paper then relays an extensive account of the behavioural aspects of several TCA models encountered in literature. Already, several reviews of TCA models exist, but none of them consider all the models exclusively from the behavioural point of view. In this respect, our overview fills this void, as it focusses on the behaviour of the TCA models, by means of time-space and phase-space diagrams, and histograms showing the distributions of vehicles' speeds, space, and time gaps. In the report, we subsequently give a concise overview of TCA models that are employed in a multi-lane setting, and some of the TCA models used to describe city traffic as a two-dimensional grid of cells, or as a road network with explicitly modelled intersections. The final part of the paper illustrates some of the more common analytical approximations to single-cell TCA models.Comment: Accepted for publication in "Physics Reports". A version of this paper with high-quality images can be found at: http://phdsven.dyns.cx (go to "Papers written"