The European Union-United States Cybersecurity Relationship : A Transatlantic Functional Cooperation

open access via T&F agreement Acknowledgements The author is grateful to the interviewees for sharing their thoughts and insights. The author would also like to thank the anonymous referees for their comments and feedback and the editorial team for their assistance throughout the publication process.Peer reviewedPublisher PD

Securing the Transatlantic Maritime Supply Chains from Counterterrorism: EU–U.S. Cooperation and the Emergence of a Transatlantic Customs Security Regime

Peer reviewedPostprin

Notes on the genetics of Endothia parasitica.

Notes on the genetics of Endothia parasitica

Σχεδιασμός και κατασκευή δομής πρωτότυπου τρισδιάστατου εκτυπωτή.

Εθνικό Μετσόβιο Πολυτεχνείο--Μεταπτυχιακή Εργασία. Διεπιστημονικό-Διατμηματικό Πρόγραμμα Μεταπτυχιακών Σπουδών (Δ.Π.Μ.Σ.) “Συστήματα Αυτοματισμού

xPF: Packet Filtering for Low-Cost Network Monitoring

The ever-increasing complexity in network infrastructures is making critical the demand for network monitoring tools. While the majority of network operators rely on low-cost open-source tools based on commodity hardware and operating systems, the increasing link speeds and complexity of network monitoring applications have revealed inefficiencies in the existing software organization, which may prohibit the use of such tools in high-speed networks. Although several new architectures have been proposed to address these problems, they require significant effort in re-engineering the existing body of applications. We present an alternative approach that addresses the primary sources of inefficiency without significantly altering the software structure. Specifically, we enhance the computational model of the Berkeley packet filter (BPF) to move much of the processing associated with monitoring into the kernel, thereby removing the overhead associated with context switching between kernel and applications. The resulting packet filter, called xPF, allows new tools to be more efficiently implemented and existing tools to be easily optimized for high-speed networks. We present the design and implementation of xPF as well as several example applications that demonstrate the efficiency of our approach

Action Amplification: A New Approach To Scalable Administration

We present a systems-management approach that enables administrators to effectively handle the challenge of increasing numbers of hosts, routers, users, and services in the networks to manage. Our approach is to map the actions of an administrator on a single host (such as creating a new user account) to the network at large, while maintaining the exact same interface. Our system amplifies the administrator's actions appropriately throughout the network, and confirms the correct propagation of all configuration changes throughout the distributed system. We argue that this approach allows administrators to easily manage several aspects of a large domain, because it provides a familiar and intuitive interface. Such a system can be used as a front-end to any other automation system used to manage large domains. To determine the feasibility of our approach, we implemented it on the OpenBSD system. We discuss the prototype implementation, along with the limitations to our approach that it exposes

The counterterrorism agreements of Europol with third countries:data protection and power asymmetry

Peer reviewedPostprin

Functional convergence to the local time of sticky diffusions

We prove the convergence of a class of high frequency path-functionals of a sticky diffusion to its local time. First, we prove this for the sticky Brownian motion. Then, we extend the result to sticky stochastic differential equations. We combine the local time approximation with an approximation of the occupation time to set up a consistent stickiness estimator. Last, we perform numerical experiments to assess the properties of the stickiness estimator and the local time approximation

A multi-objective, decomposition-based algorithm design methodology and its application to runaway operations planning

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2004.Includes bibliographical references (p. 283-296).(cont.) to the design of a heuristic decomposed algorithm for solving the ROP problem. This decomposition methodology offers an original paradigm potentially applicable to the design of solution algorithms for a class of problems with functions and parameters that, similar to those of the ROP problem, can be parsed in subsets. The potential merit in decomposing the ROP problem in two stages and the resulting utility of the two-stage solution algorithm are evaluated by performing benefits analysis across specific dimensions related to airport efficiency, as well as stability and robustness analysis of the algorithm output.Significant delays and resulting environmental impacts are commonly observed during departure operations at major US and European airports. One approach for mitigating airport congestion and delays is to exercise tactical operations planning and control with an objective to improve the efficiency of surface and terminal area operations. As a subtask of planning airport surface operations, this thesis presents a thorough study of the structure and properties of the Runway Operations Planning (ROP) problem. Runway Operations Planning is a workload-intensive task for controllers because airport operations involve many parameters, such as departure demand level and timing that are typically characterized by a highly dynamic behavior. This research work provides insight to the nature of this task, by analyzing the different parameters involved in it and illuminating how they interact with each other and how they affect the main functions in the problem of planning operations at the runway, such as departure runway throughput and runway queuing delays. Analysis of the Runway Operations Planning problem revealed that there is a parameter of the problem, namely the demand "weight class mix", which: a) is more "dominant" on the problem performance functions that other parameters, b) changes value much slower than other parameters and c) its value is available earlier and with more certainty than the value of other parameters. These observations enabled the parsing of the set of functions and the set of parameters in subsets, so that the problem can be addressed sequentially in more than one stage where different parameter subsets are treated in different stages. Thus, a decomposition-based algorithm design technique was introduced and appliedby Ioannis D. Anagnostakis.Ph.D