Filetype
The presented work is motivated by Free Space Optics (FSO) communications. FSO is a well established wireless optical transmission technology considered as an alternative to radio communications for example in metropolitan wireless mesh networks. An FSO link is established by means of a laser beam between the transmitter and the receiver placed in the line of sight. A major disadvantage of FSO lin
Numerous current efforts seek to improve the representation of ecosystem ecology and vegetation demographic processes within Earth System Models (ESMs). These developments are widely viewed as an important step in developing greater realism in predictions of future ecosystem states and fluxes. Increased realism, however, leads to increased model complexity, with new features raising a suite of eco
Intel Software Guard Extensions (SGX) provides a trusted execution environment (TEE) to run code and operate sensitive data.SGX provides runtime hardware protection where both code and data are protected even if other code components are malicious.However, recently many attacks targeting SGX have been identified and introduced that can thwart the hardware defence provided by SGX.In this paper we p
Efficient protection of huge amount of IoT produced data is key for wide scale data analytic services. The most efficient way is to use pure symmetric encryption as that allows both fast decryption at the analytic engine side as well as energy efficient encryption at the IoT side. However, symmetric encryption can only be performed if there is a way to directly map an encrypted object to the corre
The Bit Flipping algorithm is a hard decision decoding algorithm originally designed by Gallager in 1962 to decode Low Density Parity Check Codes (LDPC). It has recently proved to be much more versatile, for Moderate Parity Check Codes (MDPC) or Euclidean metric. We further demonstrate its power by proposing a noisy Euclidean version of it. This tweak allows to construct a lattice based key exchan
In this paper we present a new method for creating polynomialsolvers for problems where a (possibly infinite) subsetof the solutions are undesirable or uninteresting. Thesesolutions typically arise from simplifications made duringmodeling, but can also come from degeneracies which areinherent to the geometry of the original problem.The proposed approach extends the standard action matrixmethod to
There is a significant interest in scene reconstructionfrom underwater images given its utility for oceanic researchand for recreational image manipulation. In this paperwe propose a novel algorithm for two view camera motionestimation for underwater imagery. Our method leveragesthe constraints provided by the attenuation propertiesof water and its effects on the appearance of the color todetermin
Indoor localisation is a currently a key issue, from robotics to the Internet of Things. With hardware advancements making Ultra-Wideband devices more accurate and low powered (potentially even passive), this unlocks the potential of having such devices in common place around factories and homes, enabling an alternative method of navigation. Therefore, anchor calibration indoors becomes a key prob
Flow thinning (FT) is a traffic routing and protection strategy for communication networks whose links experience fluctuations in available capacity (as, e.g., in wireless networks). To cope with this phenomenon, end-to-end traffic demands are assigned dedicated tunnels (e.g., MPLS tunnels) whose nominal capacity is subject to thinning in order to account for variable capacity of the links, fluctu
In this paper we address the problem of registering and merging two maps in two dimensions, given covariance estimates of the two maps. We show that if two maps are given in the same coordinate system, then the problem of merging them in a statistically optimal way can be formulated as a linear least squares problem, but if they are given in different coordinate systems as well the problem becomes
In this paper, we describe a new system to extract, index, search, and visualize entities in Wikipedia. To carry out the entity extraction, we designed a high-performance, multilingual, entity linker and we used a document model to store the resulting linguistic annotations. The entity linker, HEDWIG, extracts the mentions from text usinga string matching Engine and links them toentities with a co
In this paper we present new techniques for constructing compact and robust minimal solvers for absolute pose estimation. We focus on the P4Pfr problem, but the methods we propose are applicable to a more general setting. Previous approaches to P4Pfr suffer from artificial degeneracies which come from their formulation and not the geometry of the original problem. In this paper we show how to avoi
Robust fitting of geometric models is a core problem in computer vision. The most common approach is to use a hypothesize-and-test framework, such as RANSAC. In these frameworks the model is estimated from as few measurements as possible, which minimizes the risk of selecting corrupted measurements. These estimation problems are called minimal problems, and they can often be formulated as systems
For the 21st century, carbon cycle models typically project an increase of terrestrial carbon with increasing atmospheric CO2 and a decrease with the accompanying climate change. However, these estimates are poorly constrained, primarily because they typically rely on a limited number of emission and climate scenarios. Here we explore a wide range of combinations of CO2 rise and climate change and
Searchable symmetric encryption (SSE) schemes are commonly proposed to enable search in a protected unstructured documents such as email archives or any set of sensitive text files. However, some SSE schemes have been recently proposed in order to protect relational databases. Most of the previous attacks on SSE schemes have only targeted its common use case, protecting unstructured data. In this
We present a method for complex frequency estimation in several variables, extending the classical one-dimensional ESPRIT algorithm, and consider how to work with data sampled on nonstandard domains, i.e., going beyond multirectangles.
In this paper, we consider a mobile platform with two cameras directed towards the floor. In earlier work, this specific problem geometry has been considered under the assumption that the cameras have been mounted at the same height. This paper extends the previous work by removing the height constraint, as it is hard to realize in real-life applications. We develop a method based on an equivalent
In this paper I use Kenneth Burke's theory of aesthetic form from Counter-Statement (1931) to analyze how the gourmet chef Mathias Dahlgren creates a gourmet dinner.
