No description available.

In this thesis, we present analytical analysis of key distribution schemes on wireless sensor networks. Since wireless sensor network is under unreliable environment, many random key pre-distribution based schemes have been developed to enhance security. Most of these schemes need to guarantee the existence of specific properties, such as disjoint secure paths or disjoint secure cliques, to achieve a secure cooperation among nodes. Two of the basic questions are as follows: 1. Under what conditions does a large-scale sensor network contain a certain structure? 2. How can one give a quantitative analysis behave as n grows to the infinity? However, analyzing such a structure or combinatorial problem is complicated in classical wireless network models such as percolation theories or random geometric graphs. Particularly, proofs in geometric setting models often blend stochastic geometric and combinatorial techniques and are more technically challenging. To overcome this problem, an approximative quasi-random graph is employed to eliminate some properties that are difficult to tackle. The most well-known solutions of this kind problems are probably Szemeredi's regularity lemma for embedding. The main difficulty from the fact that the above questions involve extremely small probabilities. These probabilities are too small to estimate by means of classical tools from probability theory, and thus a specific counting methods is inevitable.

By exploiting the Projection Lemma, this thesis provides less conservative LMI-like conditions for mixed H2 and H_inf control of continuous-time systems than those appeared in the current literature. The same technique has been extended to problems with time-invariant polytopic uncertainties. Numerical examples are illustrated to show improvement of the proposed results. Finally, an attempt is made to apply the Projection Lemma to stability analysis and design of systems with time-varying polytopic uncertainties.

A topological space X, is shown to be compact if and only if every net in X has a cluster point. If s is a net in a product Q 2A X, where each Xis a compact topological space, then, for every subset B of A, such that the restriction of s to B has a cluster point in the partial product Q 2B X, it is found that the restriction of s to B [ fg – extending B by one element 2 A n B – has a cluster point in its respective partial product Q 2B[fg X, as well. By invoking Zorn’s lemma, the whole of s can be shown to have a cluster point. It follows that the product of any family of compact topological spaces is compact with respect to the product topology. This is Tychono’s theorem. The aim of this text is to set forth a self contained presentation of this proof. Extra attention is given to highlight the deep dependency on the axiom of choice.

University, Diss., 2003--Kiel.

Teste de propriedades em grafos consiste no estudo de algoritmos aleatórios sublineares que determinam se um grafo $G$ de entrada com $n$ vértices satisfaz uma dada propriedade ou se é necessário adicionar ou remover mais do que $\\epsilon{n \\choose 2}$ arestas para fazer $G$ satisfazê-la, para algum parâmetro $\\epsilon$ de erro fixo. Uma propriedade de grafos $P$ é dita testável se, para todo $\\epsilon > 0$, existe um tal algoritmo para $P$ cujo tempo de execução é independente de $n$. Um dos resultados de maior importância nesta área, provado por Alon e Shapira, afirma que toda propriedade hereditária de grafos é testável. Neste trabalho, apresentamos resultados análogos para torneios --- grafos completos nos quais são dadas orientações para cada aresta. / Graph property testing is the study of randomized sublinear algorithms which decide if an input graph $G$ with $n$ vertices satisfies a given property or if it is necessary to add or remove more than $\\epsilon{n \\choose 2}$ edges to make $G$ satisfy it, for some fixed error parameter $\\epsilon$ . A graph property $P$ is called testable if, for every $\\epsilon > 0$, there is such an algorithm for $P$ whose run time is independent of $n$. One of the most important results in this area is due to Alon and Shapira, who showed that every hereditary graph property is testable. In this work, we show analogous results for tournaments --- complete graphs in which every edge is given an orientation.

Coordinated missions with platoons of autonomous agents are rapidly becoming popular because of technological advances in computing, networking, miniaturization and combination of electromechanical systems. These multi-agents networks coordinate their actions to perform challenging spatially-distributed tasks such as search, survey, exploration, and mapping. Environmental monitoring and locational optimization are among the main applications of the emerging technology of wireless sensor networks where the optimality refers to the assignment of sub-regions to each agent, in such a way that a suitable coverage metric is maximized. Usually the coverage metric encodes a distribution of risk defined on the area, and a measure of the performance of individual robots with respect to points inside the region of interest. The risk density can be used to quantify spatial distributions of risk in the domain. The solution of the optimal control problem in which the risk measure is not time varying is well known in the literature, with the optimal con figuration of the robots given by the centroids of the Voronoi regions forming a centroidal Voronoi tessellation of the area. In other words, when the set of mobile robots converge to the corresponding centroids of the Voronoi tessellation dictated by the coverage metric, the coverage itself is maximized. In this work, it is considered a time-varying risk density evolving according to a diffusion equation with varying boundary conditions that quantify a time-varying risk on the border of the workspace. Boundary conditions model a time varying flux of external threats coming into the area, averaged over the boundary length, so that rather than considering individual kinematics of incoming threats it is considered an averaged, distributed effect. This approach is similar to the one commonly adopted in continuum physics, in which kinematic descriptors are averaged over spatial domain and suitable continuum fields are introduced to describe their evolution. By adopting a first gradient constitutive relation between the flux and the density, a simple diffusion equation is obtained. Asymptotic convergence and optimality of the non-autonomous system are studied by means of Barbalat's lemma and connections with varying boundary conditions are established. Some criteria on time-varying boundary conditions and evolution are established to guarantee the stabilities of agents' trajectories. A set of numerical simulations illustrate theoretical results.

A quasi-order is a relation on a set which is both reflexive and transitive, while a well-quasi-order has the additional property that there exist no infinite strictly descending chains nor infinite antichains. Well-quasi-orderings have many interesting applications to a variety of areas which includes the strength of certain logical systems, the termination of algorithms, and the classification of sets of graphs in terms of excluded minors. My thesis explores how well-quasi-orderings are related to these topics through examples of four known well-quasi-orderings which are given by Dickson's Lemma, Higmans's Lemma, Kruskal's Tree Theorem, and the Robertson-Seymour Theorem. The well-quasi-ordering conjecture for matroids is also discussed, and an original proof of Higman's Lemma is presented.

No description available.

In this thesis we will consider and investigate the properties of analytic functions via their behavior near the boundary of the domain on which they are defined. To do that we introduce the notion of the hyperbolic distortion and the hyperbolic derivative. Classical results state that the hyperbolic derivative is bounded from above by 1, and we will consider the case when it is bounded from below by some positive constant. Boundedness from below of the hyperbolic derivative implies some nice properties of the function near the boundary. For instance Krauss & all in 2007 proved that, if the function is defined on a domain bounded by analytic curve, then boundedness from below of the hyperbolic derivative implies that the function has an analytic continuation across the boundary. We extend this result for the domains with slightly more general boundary, namely for smooth Jordan domains, and get that in this case the function and its derivative will have only continuous extensions to the boundary.