We present a new formalism for data packetization in Network Calculus. Packet curves are introduced to model constraints on the packet lengths of data flows. Indeed, a more precise knowledge of the packet characteristics can be efficiently exploited to get tighter performance bounds, specially when dealing with scheduling policies based on packet count, such as round-robin. A second use of pack...

Introduction When designing quantum key distribution (QKD) protocols, measurement outcomes produced by an incompatible choice of basis are usually discarded by the protocol specification. However, it has been shown that these mismatched measurement outcomes can actually be useful in better determining E’s attack, leading potentially to an improved key-rate bound. For instance, in [1], it was sh...

Abstract This article explores what it can mean to navigate notions of productive idiocy with aspects mātauranga Māori (Māori knowledge), through some recent art-as-activism practices the author, Aotearoa/New Zealand artist Mark Harvey. The works explicated include Waitākere Drag and Auau in Te Wao Nui ā Tiriwa forest ranges Productive Promises, which was part TEZA (Trans Economic Zone Aotearoa...

We show that the Cantor-Bendixson rank of a limit group is finite as well as that of a limit group of a linear group. Let T be a universal theory. If T has at most countably many finitely generated models, then one can associate to each finitely generated model M of T an ordinal rank, denoted Rk(M), as defined in [7]. We reformulate the definition of Rk in the context of topological spaces. Let...

Let S be a finite set. Given a function f : S → S and an element a ∈ S, define f(a) = a and f (a) = f(f i−1(a)) for all i ≥ 1. Let s ≥ 0 and r > 0 be the smallest integers such that f(a) = f(a). Determining s and r, given a ∈ S and a black-box oracle to f , is the cycle-detection problem. When f is bijective (i.e., f is a permutation of S), the order-finding problem is to find the smallest r > ...

In this series of lectures, we will a) introduce the basics of ominimality, b) describe the manifold topology of groups definable in o-minimal structures, and c) present a structure theorem for the special case of semi-linear groups, exemplifying their relation with real Lie groups. The structure of these lectures is as follows: (1) Basics of o-minimality: definition, Cell Decomposition Theorem...

We study Λb → Λπ+π−. The branching fraction is predicted to be about 4.38 ×10−6%. Within the standard model, we compute T -odd triple product asymmetries to be about 1.4, 4.3, 6.5 and 7.2% respectively due to ~sΛb(Λ) · (~ pΛ × ~ pπ) and ~ pΛ,π · (~sΛ × ~sΛb). PACS number(s): 11.30.Er, 13.30.Eg, 14.20.Mr [email protected] [email protected] 1 In this paper, we consider Λb → Λππ decay and ...