O autômato celular Game of LIFE (GL) exibe comportamento coletivo não-trivial (Classe IV de Wolfram) a partir de regras locais simples. Na década de 1990, conjecturou-se que o autômato seria um exemplo de sistema não-conservativo com criticalidade auto-organizada. Nesse trabalho refutamos essa conjectura verificando que o regime transiente para estados absorventes não escala de forma correta para redes grandes. Usando uma aproximação de campo médio com considerações sobre interfaces para a rede quadrada, definimos um parâmetro de controle sigma0 relacionado com a razão de ramificação da interface da fase absorvente. A partir da análise de um grande número de autômatos celulares (6144), encontramos uma transição de fase descontínua no espaço de regras dos autômatos celulares totalistas. Também encontramos que o GL é um autômato celular quasi-crítico, com sigma0=1.006, ou seja, o GL equivale a um processo de nucleação quasi-crítico. Mostramos que essa quasi-criticalidade é resultado da coexistência e competição entre a fase viva e a fase morta: embora o LIFE esteja destinado à extinção (ao estado absorvente morto), o decaimento é adiado devido a um forte ralentamento crítico. / The cellular automaton Game of LIFE exhibits non-trivial collective behavior (Wolfram Class IV) from local simple rules. In the 1990s, it was conjectured that the automaton would be an example of self-organized criticality in non-conservative systems. In this work we refute this conjecture by verifying that the transient regime to absorbing states does not scale for large lattice sizes. By using a mean-field approximation with considerations about interfaces in square lattices, we define a control parameter sigma0 related to the interfacial absorbing phase branching rate. From the analysis of a large number of cellular automata (6144), we find a discontinuous phase transition in the cellular automata rule space. We also find that LIFE is a quasi-critical cellular automaton, with sigma0=1.006, that is, LIFE is a quasi-critical nucleation process. It is shown that this quasi-criticality is a result of coexistence and competition between the living and dead phases: although LIFE is destined to extinction (to the dead absorbing state), this decay is delayed due to a strong critical slowing down.

This work deals with the creation of several interactive web applets for education of vector graphics. Described is the image signal, his discretization, vector and bitmap types of image record. Further they describe selected vector curves, their properties, algorithms for their construction and usage. The principles of rasterization of basic vector objects are explained. Using the Figma tool, graphical user interfaces for each applet are designed. These applets are implemented using HTML and Javascript. The implemented applets are placed on web pages that are used in computer graphics education.

The main idea of this thesis is a propose by designing filters in Mathcad program. This paper deals with a basic principle in filters design and these principles are implemented into the Mathcad program. In the introductory part is described aproximation which was used in Mathcad script. In the other parts of this project is described program which was created on designed filters.

Diploma thesis deals with image interpolation. The aim of this work is to study theoretically and then describe the nature of the various methods of image interpolation and some of them implemented in the program MATLAB. The introductory part of this work theoretically closer to important terms that are closely related to this topic of digital image processing sufficient to understand the principle. In the following of the thesis will be discussed all of today's commonly used method of image interpolation. Will hear all about the method of image interpolation using nearest neightbor interpolation and image help of polynimals such as (bi)linear, (bi)quadratic and (bi)kubic method. Then work theoretically analyzes the theory of individual species curves and splines. More specifically, coming to their most frequently used variants of B-spline curves and ther generalizations called NURBS, with addressing the problem of interpolating these curves. The final chapter consists of the results achieved in the program MATLAB.

In this work we study the solution of linear approximation problems with multiple observations. Particulary we focus on the total least squares method, which belogs to the class of ortogonaly invariant problems. For these problems we describe the so called core reduction. The aim is to reduce dimesions of the problem while preserving the solution, if it exists. We present two ways of constructing core problems. One is based on the singular value decomposition and the other uses the generalized Golub-Kahan iterative bidiago- nalization. Further we investigate properties of the core problem and of the methods for its construction. Finally we preform numerical experiments in the Matlab enviroment in order to test the reliability of the discussed algorithms. 1

O objetivo deste trabalho é estudar aproximação na esfera por uma soma com pesos de harmônicos esféricos. Apresentamos condições necessárias e suficientes sobre os pesos para garantir a convergência, tanto no caso contínuo quanto no caso Lp. Analisamos a ordem de convergência dos processos aproximatórios usando um módulo de suavidade esférico relacionado à derivada forte de Laplace-Beltrami. Incluímos provas para vários resultados sobre a derivada forte de Laplace-Beltrami, já que não conseguimos encontrá-las na literatura / The subject of this work is to study approximation on the sphere by weighted sums of spherical harmonics. We present necessary and sufficient conditions on the weights for convergence in both, the continuous and the Lp cases. We analyse the convergence rates of the approximation processes using a modulus of smoothness related to the strong Laplace- Beltrami derivative. We include proofs for several results related to such a derivative, since we were unable to find them in the literature

O objetivo deste trabalho é estudar aproximação na esfera por uma soma com pesos de harmônicos esféricos. Apresentamos condições necessárias e suficientes sobre os pesos para garantir a convergência, tanto no caso contínuo quanto no caso Lp. Analisamos a ordem de convergência dos processos aproximatórios usando um módulo de suavidade esférico relacionado à derivada forte de Laplace-Beltrami. Incluímos provas para vários resultados sobre a derivada forte de Laplace-Beltrami, já que não conseguimos encontrá-las na literatura / The subject of this work is to study approximation on the sphere by weighted sums of spherical harmonics. We present necessary and sufficient conditions on the weights for convergence in both, the continuous and the Lp cases. We analyse the convergence rates of the approximation processes using a modulus of smoothness related to the strong Laplace- Beltrami derivative. We include proofs for several results related to such a derivative, since we were unable to find them in the literature

This thesis focuses on description of the current state of research in the detection of network attacks and subsequently on the improvement of detection capabilities of specific attacks by establishing a formal definition of network metrics. These metrics approximate the progress of network connection and create a signature, based on behavioral characteristics of the analyzed connection. The aim of this work is not the prevention of ongoing attacks, or the response to these attacks. The emphasis is on the analysis of connections to maximize information obtained and definition of the basis of detection system that can minimize the size of data collected from the network, leaving the most important information for subsequent analysis. The main goal of this work is to create the concept of the detection system by using defined metrics for reduction of the network traffic to signatures with an emphasis on the behavioral aspects of the communication. Another goal is to increase the autonomy of the detection system by developing an expert knowledge of honeypot system, with the condition of independence to the technological aspects of analyzed data (e.g. encryption, protocols used, technology and environment). Defining the concept of honeypot system's expert knowledge in the role of the teacher of classification algorithms creates autonomy of the~system for the detection of unknown attacks. This concept also provides the possibility of independent learning (with no human intervention) based on the knowledge collected from attacks on these systems. The thesis describes the process of creating laboratory environment and experiments with the defined network connection signature using collected data and downloaded test database. The results are compared with the state of the art of the network detection systems and the benefits of the proposed approximation methods are highlighted.