Relatively Coherent Sets as a Hierarchical Partition Method

Finite time coherent sets [8] have recently been defined by a measure based objective function describing the degree that sets hold together, along with a Frobenius-Perron transfer operator method to produce optimally coherent sets. Here we present an extension to generalize the concept to hierarchially defined relatively coherent sets based on adjusting the finite time coherent sets to use relative mesure restricted to sets which are developed iteratively and hierarchically in a tree of partitions. Several examples help clarify the meaning and expectation of the techniques, as they are the nonautonomous double gyre, the standard map, an idealized stratospheric flow, and empirical data from the Mexico Gulf during the 2010 oil spill. Also for sake of analysis of computational complexity, we include an appendic concerning the computational complexity of developing the Ulam-Galerkin matrix extimates of the Frobenius-Perron operator centrally used here

Quantifying the Extent of Lateral Gene Transfer Required to Avert a `Genome of Eden'

The complex pattern of presence and absence of many genes across different species provides tantalising clues as to how genes evolved through the processes of gene genesis, gene loss and lateral gene transfer (LGT). The extent of LGT, particularly in prokaryotes, and its implications for creating a `network of life' rather than a `tree of life' is controversial. In this paper, we formally model the problem of quantifying LGT, and provide exact mathematical bounds, and new computational results. In particular, we investigate the computational complexity of quantifying the extent of LGT under the simple models of gene genesis, loss and transfer on which a recent heuristic analysis of biological data relied. Our approach takes advantage of a relationship between LGT optimization and graph-theoretical concepts such as tree width and network flow

Complexity Information Flow in a Multi-threaded Imperative Language

We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. We demonstrate that a safe multi-threaded program runs in polynomial time if (i) it is strongly terminating wrt a non-deterministic scheduling policy or (ii) it terminates wrt a deterministic and quiet scheduling policy. As a consequence, we also characterize the set of polynomial time functions. The type system presented is based on the fundamental notion of data tiering, which is central in implicit computational complexity. It regulates the information flow in a computation. This aspect is interesting in that the type system bears a resemblance to typed based information flow analysis and notions of non-interference. As far as we know, this is the first characterization by a type system of polynomial time multi-threaded programs

Stream-Based IP Flow Analysis

As the complexity of Internet services, transmission speed, and data volume increases, current IP flow monitoring and analysis approaches cease to be sufficient, especially within high-speed and large-scale networks. Although IP flows consist only of selected network traffic features, their processing faces high computational demands, analysis delays, and large storage requirements. To address these challenges, we propose to improve the IP flow monitoring workflow by stream-based collection and analysis of IP flows utilizing a distributed data stream processing. This approach requires changing the paradigm of IP flow data monitoring and analysis, which is the main goal of our research. We analyze distributed stream processing systems, for which we design a novel performance benchmark to determine their suitability for stream-based processing of IP flow data. We define a stream-based workflow of IP flow collection and analysis based on the benchmark results, which we also implement as a publicly available and open-source framework Stream4Flow. Furthermore, we propose new analytical methods that leverage the stream-based IP flow data processing approach and extend network monitoring and threat detection capabilities

Navier-Stokes, flight, and wind tunnel flow analysis for the F/A-18 aircraft

Computational analysis of flow over the F/A-18 aircraft is presented along with complementary data from both flight and wind tunnel experiments. The computational results are based on the three-dimensional thin-layer Navier-Stokes formulation and are obtained from an accurate surface representation of the fuselage, leading-edge extension (LEX), and the wing geometry. However, the constraints imposed by either the flow solver and/or the complexity associated with the flow-field grid generation required certain geometrical approximations to be implemented in the present numerical model. In particular, such constraints inspired the removal of the empennage and the blocking (fairing) of the inlet face. The results are computed for three different free-stream flow conditions and compared with flight test data of surface pressure coefficients, surface tuft flow, and off-surface vortical flow characteristics that included breakdown phenomena. Excellent surface pressure coefficient correlations, both in terms of magnitude and overall trend, are obtained on the forebody throughout the range of flow conditions. Reasonable pressure agreement was obtained over the LEX; the general correlation tends to improve at higher angles of attack. The surface tuft flow and the off-surface vortex flow structures compared qualitatively well with the flight test results. To evaluate the computational results, a wind tunnel investigation was conducted to determine the effects of existing configurational differences between the flight vehicle and the numerical model on aerodynamic characteristics. In most cases, the geometrical approximations made to the numerical model had very little effect on overall aerodynamic characteristics

Actuator disc methods for open propellers: assessments of numerical methods

The paper describes the assessment of two different actuator disc models as applied to the flow around open propellers. The first method is based on a semi-analytical approach returning the solution for the nonlinear differential equation governing the axisymmetric, steady, inviscid and incompressible flow around an actuator disc. Despite its low computational cost, the method does not require simplifying assumptions regarding the shape of the slipstream, e.g. the wake contraction is not disregarded or prescribed in advance. Moreover, the presence of a tangential velocity in the wake as well as the spanwise variation of the load are taken into account. The second one is a commonly used procedure based on CFD techniques in which the effects of the propeller are synthetically described through a set of body forces distributed over the disc surface. Both methods avoid the difficulties and the computational costs associated with the resolution of the propeller blades geometrical details. The comparison is based on an in-depth error analysis of the two procedures which results in a set of reference data with controlled accuracy. An excellent agreement has been documented between the two methods while the computational complexity is obviously very different. Among other things the comparison is also aimed at verifying the accuracy of the semi-analytical approach at each point of the computational domain and at quantifying the effect of the errors embodied in the two methods on the quality of the solution, both in terms of global and local performance parameters. Furthermore, the paper provides a set of reference solutions with controlled accuracy that could be used for the verification of new and existing computational methods. Finally, the computational cost of the semi-analytical model is quantified, thus providing a valuable information to designers who need to select a cost effective and reliable analysis tool

An Enhanced Dataflow Analysis to Automatically Tailor Side Channel Attack Countermeasures to Software Block Ciphers

Protecting software implementations of block ciphers from side channel attacks is a significant concern to realize secure embedded computation platforms. The relevance of the issue calls for the automation of the side channel vulnerability assessment of a block cipher implementation, and the automated application of provably secure defenses. The most recent methodology in the field is an application of a specialized data-flow analysis, performed by means of the LLVM compiler framework, detecting in the AES cipher the portions of the code amenable to key extraction via side channel analysis. The contribution of this work is an enhancement to the existing data-flow analysis which extending it to tackle any block cipher implemented in software. In particular, the extended strategy takes fully into account the data dependencies present in the key schedule of a block cipher, regardless of its complexity, to obtain consistently sound results. This paper details the analysis strategy and presents new results on the tailored application of power and electro-magnetic emission analysis countermeasures, evaluating the performances on both the ARM Cortex-M and the MIPS ISA. The experimental evaluation reports a case study on two block ciphers: the first designed to achieve a high security margin at a non-negligible computational cost, and a lightweight one. The results show that, when side-channel-protected implementations are considered, the high-security block cipher is indeed more efficient than the lightweight one