Le travail que nous développons dans le cadre de cette thèse s'articule autour des problèmes de recherche de structure de recouvrement de graphes sous contrainte sur le degré des sommets. Comme l'arbre de recouvrement couvre les sommets d'un graphe connexe avec un minimum de liens, il est généralement proposé comme solution à ce type de problèmes. Cependant, pour certaines applications telles que le routage dans les réseaux optiques, les solutions ne sont pas nécessairement des sous-graphes. Nous supposons dans cette thèse que la contrainte sur le degré est due à une capacité limitée instantanée des sommets et que la seule exigence sur le recouvrement est sa connexité. Dans ce cas, la solution peut être différente d'un arbre. Nous reformulons ces problèmes de recouvrement en nous appuyant sur une extension du concept d'arbre appelée hiérarchie de recouvrement. Notre objectif principal est de démontrer son intérêt vis-à-vis de l'arbre en termes de faisabilité et de coût du recouvrement. Nous considérons deux types de contraintes sur le degré : des bornes sur le degré des sommets ou une borne sur le nombre de sommets de branchement et cherchons dans les deux cas un recouvrement de coût minimum. Nous illustrons aussi l'applicabilité des hiérarchies en étudiant un problème prenant davantage en compte la réalité du routage optique. Pour ces différents problèmes NP-difficiles, nous montrons, tant sur le coût des solutions optimales que sur la garantie de performance des solutions approchées, l'intérêt des hiérarchies de recouvrement. Ce constat se voit conforté par des expérimentations sur des graphes aléatoires. / The work conducted in this thesis is focused on the minimum spanning problems in graphs under constraints on the vertex degrees. As the spanning tree covers the vertices of a connected graph with a minimum number of links, it is generally proposed as a solution for this kind of problems. However, for some applications such as the routing in optical networks, the solution is not necessarily a sub-graph. In this thesis, we assume that the degree constraints are due to a limited instantaneous capacity of the vertices and that the only pertinent requirement on the spanning structure is its connectivity. In that case, the solution may be different from a tree. We propose the reformulation of this kind of spanning problems. To find the optimal coverage of the vertices, an extension of the tree concept called hierarchy is proposed. Our main purpose is to show its interest regarding the tree in term of feasibility and costs of the coverage. Thus, we take into account two types of degree constraints: either an upper bound on the degree of vertices and an upper bound on the number of branching vertices. We search a minimum cost spanning hierarchy in both cases. Besides, we also illustrate the applicability of hierarchies by studying a problem that takes more into account the reality of the optical routing. For all those NP-hard problems, we show the interest of the spanning hierarchy for both costs of optimal solutions and performance guarantee of approximate solutions. These results are confirmed by several experimentations on random graphs.

Dans cette thèse, nous concentrons sur les sujets suivants: super-eulérien graphe, hamiltonien ligne graphes, le tolerant aux pannes hamiltonien laceabilité de Cayley graphe généré par des transposition arbres et plusieurs problèmes extrémaux concernant la (minimum et/ou maximum) taille des graphes qui ont la même propriété.Cette thèse comprend six chapitres. Le premier chapitre introduit des définitions et indique la conclusion des resultants principaux de cette thèse, et dans le dernier chapitre, nous introduisons la recherche de furture de la thèse. Les travaux principaux sont montrés dans les chapitres 2-5 comme suit:Dans le chapitre 2, nous explorons les conditions pour qu'un graphe soit super-eulérien.Dans la section 1, nous caractérisons des graphes dont le dégrée minimum est au moins de 2 et le nombre de matching est au plus de 3. Dans la section 2, nous prouvons que si pour tous les arcs xy∈E(G), d(x)+d(y)≥n-1-p(n), alors G est collapsible sauf quelques bien définis graphes qui ont la propriété p(n)=0 quand n est impair et p(n)=1 quand n est pair.Dans la section 3 de la Chapitre 2, nous trouvons les conditions suffisantes pour que un graphe de 3-arcs connectés soit pliable.Dans le chapitre 3, nous considérons surtout l'hamiltonien de 3-connecté ligne graphe.Dans la première section de Chapitre 3, nous montrons que chaque 3-connecté, essentiellement11-connecté ligne graphe est hamiltonien-connecté. Cela renforce le résultat dans [91]. Dans la seconde section de Chapitre 3, nous montrons que chaque 3-connecté, essentiellement 10-connecté ligne graphe est hamiltonien-connecté.Dans la troisième section de Chapitre 3, nous montrons que 3-connecté, essentiellement 4-connecté ligne graphe venant d'un graphe qui comprend au plus 9 sommets de degré 3 est hamiltonien. Dans le chapitre 4, nous montrons d'abord que pour tous $F\subseteq E(Cay(B:S_{n}))$, si $|F|\leq n-3$ et $n\geq 4$, il existe un hamiltonien graphe dans $Cay(B:S_{n})-F$ entre tous les paires de sommets qui sont dans les différents partite ensembles. De plus, nous renforçons le résultat figurant ci-dessus dans la seconde section montrant que $Cay(S_n,B)-F$ est bipancyclique si $Cay(S_n,B)$ n'est pas un star graphe, $n\geq 4$ et $|F|\leq n-3$.Dans le chapitre 5, nous considérons plusieurs problems extrémaux concernant la taille des graphes.Dans la section 1 de Chapitre 5, nous bornons la taille de sous-graphe provoqué par $m$ sommets de hypercubes ($n$-cubes). Dans la section 2 de Chapitre 5, nous étudions partiellement la taille minimale d'un graphe savant son degré minimum et son degré d'arc. Dans la section 3 de Chapitre 5, nous considérons la taille minimale des graphes satisfaisants la Ore-condition. / In this thesis, we focus on the following topics: supereulerian graphs, hamiltonian line graphs, fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees, and several extremal problems on the (minimum and/or maximum) size of graphs under a given graph property. The thesis includes six chapters. The first one is to introduce definitions and summary the main results of the thesis, and in the last chapter we introduce the furture research of the thesis. The main studies in Chapters 2 - 5 are as follows. In Chapter 2, we explore conditions for a graph to be supereulerian.In Section 1 of Chapter 2, we characterize the graphs with minimum degree at least 2 and matching number at most 3. By using the characterization, we strengthen the result in [93] and we also address a conjecture in the paper.In Section 2 of Chapter 2, we prove that if $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$, then $G$ is collapsible except for several special graphs, where $p(n)=0$ for $n$ even and $p(n)=1$ for $n$ odd. As a corollary, a characterization for graphs satisfying $d(x)+d(y)\geq n-1-p(n)$ for any edge $xy\in E(G)$ to be supereulerian is obtained. This result extends the result in [21].In Section 3 of Chapter 2, we focus on a conjecture posed by Chen and Lai [Conjecture~8.6 of [33]] that every 3-edge connected and essentially 6-edge connected graph is collapsible. We find a kind of sufficient conditions for a 3-edge connected graph to be collapsible.In Chapter 3, we mainly consider the hamiltonicity of 3-connected line graphs.In the first section of Chapter 3, we give several conditions for a line graph to be hamiltonian, especially we show that every 3-connected, essentially 11-connected line graph is hamilton- connected which strengthens the result in [91].In the second section of Chapter 3, we show that every 3-connected, essentially 10-connected line graph is hamiltonian-connected.In the third section of Chapter 3, we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is hamiltonian. Moreover, if $G$ has 10 vertices of degree 3 and its line graph is not hamiltonian, then $G$ can be contractible to the Petersen graph.In Chapter 4, we consider edge fault-tolerant hamiltonicity of Cayley graphs generated by transposition trees. We first show that for any $F\subseteq E(Cay(B:S_{n}))$, if $|F|\leq n-3$ and $n\geq4$, then there exists a hamiltonian path in $Cay(B:S_{n})-F$ between every pair of vertices which are in different partite sets. Furthermore, we strengthen the above result in the second section by showing that $Cay(S_n,B)-F$ is bipancyclic if $Cay(S_n,B)$ is not a star graph, $n\geq4$ and $|F|\leq n-3$.In Chapter 5, we consider several extremal problems on the size of graphs.In Section 1 of Chapter 5, we bounds the size of the subgraph induced by $m$ vertices of hypercubes. We show that a subgraph induced by $m$ (denote $m$ by $\sum\limits_{i=0}^ {s}2^{t_i}$, $t_0=[\log_2m]$ and $t_i= [\log_2({m-\sum\limits_{r=0}^{i-1}2 ^{t_r}})]$ for $i\geq1$) vertices of an $n$-cube (hypercube) has at most $\sum\limits_{i=0}^{s}t_i2^{t_i-1} +\sum\limits_{i=0}^{s} i\cdot2^{t_i}$ edges. As its applications, we determine the $m$-extra edge-connectivity of hypercubes for $m\leq2^{[\frac{n}2]}$ and $g$-extra edge-connectivity of the folded hypercube for $g\leq n$.In Section 2 of Chapter 5, we partially study the minimum size of graphs with a given minimum degree and a given edge degree. As an application, we characterize some kinds of minimumrestricted edge connected graphs.In Section 3 of Chapter 5, we consider the minimum size of graphs satisfying Ore-condition.

Cette thèse se propose de souligner la proximité et la complémentarité des méthodes d'analyse de texte en droit international et en sciences du langage, particulièrement en traductologie, pour produire une analyse de discours du Conseil de sécurité de l'ONU dans ses résolutions de 1946 à 2015 inclus, qui soit pertinente dans les deux domaines et de ce fait, interdisciplinaire. Une telle analyse de corpus, utilisant des outils textométriques sur le texte mais également sur les données contextuelles des résolutions, nous permet de produire des résultats exploitables dans ces deux champs scientifiques, ce qui est un des buts des humanités numériques. Nous montrons ainsi le sens ordinaire de la version anglaise de la résolution 242 (1967) en établissant, dans notre corpus, les fréquences des différentes traductions en français du déterminant zéro pluriel anglais pour établir son sens le plus commun. Ce faisant, nous aidons à résoudre un vieux problème d'interprétation de droit international, et nous modélisons par ailleurs l'usage de ce déterminant en anglais. Par ailleurs, nous montrons comment une modélisation de la traduction permet de faire émerger l'extension sémantique de certains termes et comment une analyse juridique des résolutions du Conseil de sécurité peut être modélisée en bonne approximation à partir d'un algorithme se basant sur des données purement linguistiques. Les données sont disponibles en ligne : https://hdl.handle.net/11403/csonu / This thesis tries to first show how close text analysis methods in International Law and in Language Sciences are, and how well they complement each other, particularly in the field of Translation studies, to produce a discourse analysis of the UN Security Council resolutions from 1946 to 2015 included, that is relevant in both fields, and as such, truly interdisciplinary. Such corpus analysis using textometric tools onto the text itself as well as on various contextual data allows us to produce actionable results in both scientific fields, which is a stated goal of Digital Humanities.We show one such result by establishing the ordinary meaning of the English version of Resolution 242 (1967) by figuring out for our corpus the translation frequency into French of the English plural zero determiner in order to determine its ordinary meaning. By doing so, we help resolving a long-standing issue of interpretation in International Law, as well as produce a model of the usage of this determiner in English. Furthermore, we show how translation characteristics can reveal semantic extension of certain words and how a legal analysis of the UN Security Council resolutions can be approximated with an algorithm based on purely linguistic features. Online data : https://hdl.handle.net/11403/csonu

In this thesis the novel concept of Sycophant Wireless Sensors (SWS) is introduced. A SWS network is a static ectoparasitic clandestine sensor network mounted incognito on a mobile agent using only the agent&rsquo / s mobility without intervention. SWS networks not only communicate with each other through mobileWireless Sensor Networks (WSN) but also cooperate with them to form a global hybrid Wireless Sensor Network. Such a hybrid network has its own problems and opportunities, some of which have been studied in this thesis work. Assuming that direct position measurements are not always feasible tracking performance of the sycophant using range only measurements for various communication intervals is studied. Then this framework was used to create a hybrid 2D map of the environment utilizing the capabilities of the mobile network the sycophant. In order to show possible applications of a sycophant deployment, the sycophant sensor node was equipped with a laser ranger as its sensor, and it was let to create a 2D map of its environment. This 2D map, which corresponds to a height dierent than the follower network, was merged with the 2D map of the mobile network forming a novel rough 3D map. Then by giving up from the need to properly localize the sycophant even when it is disconnected to the rest of the network, a full 3D map of the environment is obtained by fusing 2D map and tracking capabilities of the mobile network with the 2D vertical scans of the environment by the sycophant. And finally connectivity problems that arise from the hybrid sensor/actuator network were solved. For this 2 new connectivity maintenance algorithms, one based on the helix structures of the proteins, and the other based on the acute triangulation of the space forming a Gabriel Graph, were introduced. In this new algorithms emphasis has been given to sparseness in order to increase fault tolerance to regional problems. To better asses sparseness a new measure, called Resistance was introduced, as well as another called updistance.

For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s. / February 2008

This thesis deals with optimizing extremal eigenvalues of weighted graph Laplacian matrices. In general, the Laplacian matrix of a (weighted) graph is of particular importance in spectral graph theory and combinatorial optimization (e.g., graph partition like max-cut and graph bipartition). Especially the pioneering work of M. Fiedler investigates extremal eigenvalues of weighted graph Laplacians and provides close connections to the node- and edge-connectivity of a graph. Motivated by Fiedler, Göring et al. were interested in further connections between structural properties of the graph and the eigenspace of the second smallest eigenvalue of weighted graph Laplacians using a semidefinite optimization approach. By redistributing the edge weights of a graph, the following three optimization problems are studied in this thesis: maximizing the second smallest eigenvalue (based on the mentioned work of Göring et al.), minimizing the maximum eigenvalue and minimizing the difference of maximum and second smallest eigenvalue of the weighted Laplacian. In all three problems a semidefinite optimization formulation allows to interpret the corresponding semidefinite dual as a graph realization problem. That is, to each node of the graph a vector in the Euclidean space is assigned, fulfilling some constraints depending on the considered problem. Optimal realizations are investigated and connections to the eigenspaces of corresponding optimized eigenvalues are established. Furthermore, optimal realizations are closely linked to the separator structure of the graph. Depending on this structure, on the one hand folding properties of optimal realizations are characterized and on the other hand the existence of optimal realizations of bounded dimension is proven. The general bounds depend on the tree-width of the graph. In the case of minimizing the maximum eigenvalue, an important family of graphs are bipartite graphs, as an optimal one-dimensional realization may be constructed. Taking the symmetry of the graph into account, a particular optimal edge weighting exists. Considering the coupled problem, i.e., minimizing the difference of maximum and second smallest eigenvalue and the single problems, i.e., minimizing the maximum and maximizing the second smallest eigenvalue, connections between the feasible (optimal) sets are established.

Increasing societal demand for automation has led to considerable efforts to control large-scale complex systems, especially in the area of autonomous intelligent control methods. The control system of a large-scale complex system needs to satisfy four system level requirements: robustness, flexibility, reusability, and scalability. Corresponding to the four system level requirements, there arise four major challenges. First, it is difficult to get accurate and complete information. Second, the system may be physically highly distributed. Third, the system evolves very quickly. Fourth, emergent global behaviors of the system can be caused by small disturbances at the component level. The Multi-Agent Based Control (MABC) method as an implementation of distributed intelligent control has been the focus of research since the 1970s, in an effort to solve the above-mentioned problems in controlling large-scale complex systems. However, to the author's best knowledge, all MABC systems for large-scale complex systems with significant uncertainties are problem-specific and thus difficult to extend to other domains or larger systems. This situation is partly due to the control architecture of multiple agents being determined by agent to agent coupling and interaction mechanisms. Therefore, the research objective of this dissertation is to develop a comprehensive, generalized framework for the control system design of general large-scale complex systems with significant uncertainties, with the focus on distributed control architecture design and distributed inference engine design. A Hybrid Multi-Agent Based Control (HyMABC) architecture is proposed by combining hierarchical control architecture and module control architecture with logical replication rings. First, it decomposes a complex system hierarchically; second, it combines the components in the same level as a module, and then designs common interfaces for all of the components in the same module; third, replications are made for critical agents and are organized into logical rings. This architecture maintains clear guidelines for complexity decomposition and also increases the robustness of the whole system. Multiple Sectioned Dynamic Bayesian Networks (MSDBNs) as a distributed dynamic probabilistic inference engine, can be embedded into the control architecture to handle uncertainties of general large-scale complex systems. MSDBNs decomposes a large knowledge-based system into many agents. Each agent holds its partial perspective of a large problem domain by representing its knowledge as a Dynamic Bayesian Network (DBN). Each agent accesses local evidence from its corresponding local sensors and communicates with other agents through finite message passing. If the distributed agents can be organized into a tree structure, satisfying the running intersection property and d-sep set requirements, globally consistent inferences are achievable in a distributed way. By using different frequencies for local DBN agent belief updating and global system belief updating, it balances the communication cost with the global consistency of inferences. In this dissertation, a fully factorized Boyen-Koller (BK) approximation algorithm is used for local DBN agent belief updating, and the static Junction Forest Linkage Tree (JFLT) algorithm is used for global system belief updating. MSDBNs assume a static structure and a stable communication network for the whole system. However, for a real system, sub-Bayesian networks as nodes could be lost, and the communication network could be shut down due to partial damage in the system. Therefore, on-line and automatic MSDBNs structure formation is necessary for making robust state estimations and increasing survivability of the whole system. A Distributed Spanning Tree Optimization (DSTO) algorithm, a Distributed D-Sep Set Satisfaction (DDSSS) algorithm, and a Distributed Running Intersection Satisfaction (DRIS) algorithm are proposed in this dissertation. Combining these three distributed algorithms and a Distributed Belief Propagation (DBP) algorithm in MSDBNs makes state estimations robust to partial damage in the whole system. Combining the distributed control architecture design and the distributed inference engine design leads to a process of control system design for a general large-scale complex system. As applications of the proposed methodology, the control system design of a simplified ship chilled water system and a notional ship chilled water system have been demonstrated step by step. Simulation results not only show that the proposed methodology gives a clear guideline for control system design for general large-scale complex systems with dynamic and uncertain environment, but also indicate that the combination of MSDBNs and HyMABC can provide excellent performance for controlling general large-scale complex systems.

Modelling and simulation are essential ingredients of the analysis and design process in power electronics. It helps a design engineer gain an increased understanding of circuit operation. Accordingly, for a set of specifications given, the designer will choose a particular topology, select component types and values, estimate circuit performance etc. Typically hierarchical modelling, analysis and simulation rather than full detailed simulation of the system provides a crucial insight and understanding. The combination of these insights with hardware prototyping and experiments constitutes a powerful and effective approach to design. Obtaining the mathematical model of the power electronic systems is a major task before any analysis or synthesis or simulation can be performed. There are circuit oriented simulators which uses inbuilt mathematical models for components. Simulation with equation solver needs mathematical models for simulation which are trimmed according to user requirement. There are various methods in the literature to obtain these mathematical models. However, the issues of multi-domain system modelling and causality of the energy variables are not sufficiently addressed. Further, specifically to power converter systems, the issue of switching power models with fixed causality is not addressed. Therefore, our research focuses on obtaining solutions to the above using relatively untouched bond graph method to obtain models for power electronic systems. The power electronic system chosen for the present work is Switched Mode Power Converters (SMPC’s) and in particular PWM DC-DC converters. Bond graph is a labelled and directed graphical representation of physical systems. The basis of bond graph modelling is energy/power flow in a system. As energy or power flow is the underlying principle for bond graph modelling, there is seamless integration across multiple domains. As a consequence, different domains (such as electrical, mechanical, thermal, fluid, magnetic etc.) can be represented in a unified way. The power or the energy flow is represented by a half arrow, which is called the power bond or the energy bond. The causality for each bond is a significant issue that is inherently addressed in bond graph modelling. As every bond involves two power variables, the decision of setting the cause variable and the effect variable is by natural laws. This has a significant bearing in the resulting state equations of the system. Proper assignment of power direction resolves the sign-placing problem when connecting sub-model structures. The causality will dictate whether a specific power variable is a cause or the effect. Using causal bars on either ends of the power bond, graphically indicate the causality for every bond. Once the causality gets assigned, bond graph displays the structure of state space equations explicitly. The first problem we have encountered in modelling power electronic systems with bond graph is power switching. The essential part of any switched power electronic system is a switch. Switching in the power electronic circuits causes change in the structure of the system. This results in change in dynamic equations of the circuit according to position of the switch. We have proposed the switched power junctions (SPJ) to represent switching phenomena in power electronic systems. The switched power junctions are a generalization of the already existing 0-junction and 1-junction concepts of the bond graph element set. The SPJ’s models ideal switching. These elements maintain causality invariance for the whole system for any operational mode of the system. This means that the state vector of the resulting state equation of the system does not change for any operating mode. As SPJs models ideal power switching, the problem of stiff systems and associated numerical stability problems while simulating the system is eliminated. Further, it maintains one to one correspondence with the physical system displaying all the feasible modes of operation at the same time on the same graph. Using these elements, the switched mode power converters (SMPC's) are modelled in bond graph. Bond graph of the converter is the large signal model of the converter. A graphical procedure is proposed that gives the averaged large signal, steady state and small signal ac models. The procedure is suitable for the converters operating in both Continuous Conduction Mode (CCM) and in Discontinuous Conduction Mode (DCM). For modelling in DCM, the concept of virtual switch is used to model the converter using bond graph. Using the proposed method, converters of any complexity can be modelled incorporating all the advantages of bond graph modelling. Magnetic components are essential part of the power electronic systems. Most common parts are the inductor, transformer and coupled inductors which contain both the electric and magnetic domains. Gyrator-Permeance approach is used to model the magnetic components. Gyrator acts as an interface between electric and magnetic domain and capacitor model the permeance of the magnetic circuits. Components like inductor, tapped inductor, transformer, and tapped transformer are modelled. Interleaved converters with coupled inductor, zero ripple phenomena in coupled inductor converters as well as integrated magnetic Cuk converter are also modelled. Modelling of integrated magnetic converters like integrated magnetic forward converter, integrated magnetic boost converter are also explored. To carry out all the simulations of proposed bond graph models, bond graph toolbox is developed using MATLAB/SIMULINK. The MATLAB/SIMULINK is chosen since it is general simulation platform widely available. Therefore all the analysis and simulation can be carried out using facilities available in MATLAB/SIMULINK. Symbolic equation extraction toolbox is also developed which extracts state equations from bond graph model in SIMULINK in symbolic form.

Στη Διδακτορική Διατριβή μελετώνται 3 κατηγορίες επιθέσεων άρνησης εξυπηρέτησης (Denial-of-Service). Η πρώτη κατηγορία αφορά επιθέσεις τύπου SYN Flood, μια επίθεση που πραγματοποιείται σε χαμηλό επίπεδο και αποτελεί την πιο διαδεδομένη ίσως κατηγορία. Για την αναγνώριση των επιθέσεων αυτών εξήχθησαν 9 στατιστικές παράμετροι οι οποίες τροφοδότησαν τους εξής ταξινομητές: ένα νευρωνικό δίκτυο ακτινικών συναρτήσεων, ένα ταξινομητή κ-κοντινότερων γειτόνων και ένα εξελικτικό νευρωνικό δίκτυο. Ιδιαίτερη σημασία στο σύστημα αναγνώρισης έχουν οι παράμετροι που χρησιμοποιήθηκαν. Για την κατασκευή και επιλογή των παραμέτρων αυτών, προτάθηκε μια νέα τεχνική η οποία χρησιμοποιεί ένα γενετικό αλγόριθμο και μια γραμματική ελεύθερης σύνταξης για να κατασκευάζει νέα σύνολα παραμέτρων από υπάρχοντα σύνολα πρωτογενών χαρακτηριστικών. Στη δεύτερη κατηγορία επιθέσεων, μελετήθηκαν επιθέσεις άρνησης εξυπηρέτησης στην υπηρεσία του παγκόσμιου ιστού (www). Για την αντιμετώπιση των επιθέσεων αυτών προτάθηκε η χρήση υπερσυνδέσμων-παγίδων οι οποίοι τοποθετούνται στον ιστοχώρο και λειτουργούν σαν νάρκες σε ναρκοπέδιο. Οι υπερσύνδεσμοι-παγίδες δεν περιέχουν καμία σημασιολογική πληροφορία και άρα είναι αόρατοι στους πραγματικούς χρήστες ενώ είναι ορατοί στις μηχανές που πραγματοποιούν τις επιθέσεις. Στην τελευταία κατηγορία επιθέσεων, τα μηνύματα ηλεκτρονικού ταχυδρομείου spam, προτάθηκε μια μέθοδος κατασκευής ενός πολύ μικρού αριθμού παραμέτρων και χρησιμοποιήθηκαν για πρώτη φορά νευρωνικά δίκτυα για την αναγνώριση τους. / The dissertation analyzes 3 categories of denial-of-service attacks. The first category concerns SYN Flood attacks, a low level attack which is the most common. For the detection of this type of attacks 9 features were proposed which acted as inputs for the following classifiers: a radial basis function neural network, a k-nearest neighbor classifier and an evolutionary neural network. A crucial part of the proposed system is the parameters that act as inputs for the classifiers. For the selection and construction of those features a new method was proposed that automatically selects constructs new feature sets from a predefined set of primitive characteristics. This new method uses a genetic algorithm and a context-free grammar in order to find the optimal feature set. In the second category, denial-of-service attacks on the World Wide Web service were studied. For the detection of those attacks, the use of decoy-hyperlinks was proposed. Decoy hyperlinks, are hyperlinks that contain no semantic information and thus are invisible to normal users but are transparent to the programs that perform the attacks. The decoys act like mines on a minefield and are placed optimally on the web site so that the detection probability is maximized. In the last type of attack, the email spam problem, a new method was proposed for the construction of a very small number of features which are used to feed a neural network that for the first time is used to detect such attacks.

For a positive integer $r$ and graphs $F$, $G$, and $H$, the graph Ramsey arrow notation $F \longrightarrow (G)^H_r$ means that for every $r$-colouring of the subgraphs of $F$ isomorphic to $H$, there exists a subgraph $G'$ of $F$ isomorphic to $G$ such that all the subgraphs of $G'$ isomorphic to $H$ are coloured the same. Graph Ramsey theory is the study of the graph Ramsey arrow and related arrow notations for other kinds of ``graphs" (\emph{e.g.}, ordered graphs, or hypergraphs). This thesis surveys finite graph Ramsey theory, that is, when all structures are finite. One aspect surveyed here is determining for which $G$, $H$, and $r$, there exists an $F$ such that $F \longrightarrow (G)^H_r$. The existence of such an $F$ is guaranteed when $H$ is complete, whether ``subgraph" means weak or induced, and existence results are also surveyed when $H$ is non-complete. When such an $F$ exists, other aspects are surveyed, such as determining the order of the smallest such $F$, finding such an $F$ in some restricted family of graphs, and describing the set of minimal such $F$'s.