A model for the periodic water wave problem and its long wave amplitude equations

We are interested in the validity of the KdV and of the long wave NLS approximation for the water wave problem over a periodic bottom. Approximation estimates are non-trivial, since solutions of order O(ε^2 ), resp. O(ε), have to be controlled on an O(1/ε^3 ), resp. O(1/ε^2 ), time scale. In contrast to the spatially homogeneous case, in the periodic case new quadratic resonances occur and make a more involved analysis necessary. For a phenomenological model we present some results and explain the underlying ideas. The focus is on results which are robust in the sense that they hold under very weak non-resonance conditions without a detailed discussion of the resonances. This robustness is achieved by working in spaces of analytic functions. We explain that, if analyticity is dropped, the KdV and the long wave NLS approximation make wrong predictions in case of unstable resonances and suitably chosen periodic boundary conditions. Finally we outline, how, we think, the presented ideas can be transferred to the water wave problem

Modulational Instability in Equations of KdV Type

It is a matter of experience that nonlinear waves in dispersive media, propagating primarily in one direction, may appear periodic in small space and time scales, but their characteristics --- amplitude, phase, wave number, etc. --- slowly vary in large space and time scales. In the 1970's, Whitham developed an asymptotic (WKB) method to study the effects of small "modulations" on nonlinear periodic wave trains. Since then, there has been a great deal of work aiming at rigorously justifying the predictions from Whitham's formal theory. We discuss recent advances in the mathematical understanding of the dynamics, in particular, the instability of slowly modulated wave trains for nonlinear dispersive equations of KdV type.Comment: 40 pages. To appear in upcoming title in Lecture Notes in Physic

Design and Reliability Performance Evaluation of Network Coding Schemes for Lossy Wireless Networks

This thesis investigates lossy wireless networks, which are wireless communication networks consisting of lossy wireless links, where the packet transmission via a lossy wireless link is successful with a certain value of probability. In particular, this thesis analyses all-to-all broadcast in lossy wireless networks, where every node has a native packet to transmit to all other nodes in the network. A challenge of all-to-all broadcast in lossy wireless networks is the reliability, which is defined as the probability that every node in the network successfully obtains a copy of the native packets of all other nodes. In this thesis, two novel network coding schemes are proposed, which are the neighbour network coding scheme and the random neighbour network coding scheme. In the two proposed network coding schemes, a node may perform a bit-wise exclusive or (XOR) operation to combine the native packet of itself and the native packet of its neighbour, called the coding neighbour, into an XOR coded packet. The reliability of all-to-all broadcast under both the proposed network coding schemes is investigated analytically using Markov chains. It is shown that the reliability of all-to-all broadcast can be improved considerably by employing the proposed network coding schemes, compared with non-coded networks with the same link conditions, i.e. same probabilities of successful packet transmission via wireless channels. Further, the proposed schemes take the link conditions of each node into account to maximise the reliability of a given network. To be more precise, the first scheme proposes the optimal coding neighbour selection method while the second scheme introduces a tuning parameter to control the probability that a node performs network coding at each transmission. The observation that channel condition can have a significant impact on the performance of network coding schemes is expected to be applicable to other network coding schemes for lossy wireless networks

Hyper-precarious lives : Migrants, work and forced labour in the Global North

This paper unpacks the contested inter-connections between neoliberal work and welfare regimes, asylum and immigration controls, and the exploitation of migrant workers. The concept of precarity is explored as a way of understanding intensifying and insecure post-Fordist work in late capitalism. Migrants are centrally implicated in highly precarious work experiences at the bottom end of labour markets in Global North countries, including becoming trapped in forced labour. Building on existing research on the working experiences of migrants in the Global North, the main part of the article considers three questions. First, what is precarity and how does the concept relate to working lives? Second, how might we understand the causes of extreme forms of migrant labour exploitation in precarious lifeworlds? Third, how can we adequately theorize these particular experiences using the conceptual tools of forced labour, slavery, unfreedom and precarity? We use the concept of ‘hyper-precarity’ alongside notions of a ‘continuum of unfreedom’ as a way of furthering human geographical inquiry into the intersections between various terrains of social action and conceptual debate concerning migrants’ precarious working experiences

FourQ on Embedded Devices with Strong Countermeasures Against Side-Channel Attacks

This work deals with the energy-efficient, high-speed and high-security implementation of elliptic curve scalar multiplication, elliptic curve Diffie-Hellman (ECDH) key exchange and elliptic curve digital signatures on embedded devices using FourQ and incorporating strong countermeasures to thwart a wide variety of side-channel attacks. First, we set new speed records for constant-time curve-based scalar multiplication, DH key exchange and digital signatures at the 128-bit security level with implementations targeting 8, 16 and 32-bit microcontrollers. For example, our software computes a static ECDH shared secret in 6.9 million cycles (or 0.86 seconds @8MHz) on a low-power 8-bit AVR microcontroller which, compared to the fastest Curve25519 and genus-2 Kummer implementations on the same platform, offers 2x and 1.4x speedups, respectively. Similarly, it computes the same operation in 496 thousand cycles on a 32-bit ARM Cortex-M4 microcontroller, achieving a factor-2.9 speedup when compared to the fastest Curve25519 implementation targeting the same platform. A similar speed performance is observed in the case of digital signatures. Second, we engineer a set of side-channel countermeasures taking advantage of FourQ\u27s rich arithmetic and propose a secure implementation that offers protection against a wide range of sophisticated side-channel attacks, including differential power analysis (DPA). Despite the use of strong countermeasures, the experimental results show that our FourQ software is still efficient enough to outperform implementations of Curve25519 that only protect against timing attacks. Finally, we perform a differential power analysis evaluation of our software running on an ARM Cortex-M4, and report that no leakage was detected with up to 10 million traces. These results demonstrate the potential of deploying FourQ on low-power applications such as protocols for the Internet of Things

Symmetric gravitational closure

We show how to exploit symmetry assumptions to determine the dynamical equations for the particular geometry that underpins given matter field equations. The procedure builds on the gravitational closure equations for matter models without any a priori assumption of symmetry. It suffices to illustrate the symmetrization procedure for a Klein-Gordon field equation on a Lorentzian background, for which one obtains the Friedmann equations, without ever having known Einstein's equations, by careful imposition of maximal cosmological symmetry directly on the pertinent gravitational closure equations. This method of finding the family of symmetry-reduced gravitational field equations that are compatible with given matter dynamics directly generalizes to any Killing symmetry algebra, matter models beyond the standard model and indeed tensorial spacetime geometries beyond Lorentzian metrics