Exploring sensor data management

The increasing availability of cheap, small, low-power sensor hardware and the ubiquity of wired and wireless networks has led to the prediction that `smart evironments' will emerge in the near future. The sensors in these environments collect detailed information about the situation people are in, which is used to enhance information-processing applications that are present on their mobile and `ambient' devices.\ud \ud Bridging the gap between sensor data and application information poses new requirements to data management. This report discusses what these requirements are and documents ongoing research that explores ways of thinking about data management suited to these new requirements: a more sophisticated control flow model, data models that incorporate time, and ways to deal with the uncertainty in sensor data

Inference Optimization using Relational Algebra

Exact inference procedures in Bayesian networks can be expressed using relational algebra; this provides a common ground for optimizations from the AI and database communities. Specifically, the ability to accomodate sparse representations of probability distributions opens up the way to optimize for their cardinality instead of the dimensionality; we apply this in a sensor data model.\u

Modelling with measures: Approximation of a mass-emitting object by a point source

We consider a linear diffusion equation on $\Omega:=\mathbb{R}^2\setminus\bar{\Omega_\mathcal{O}}$, where $\Omega_\mathcal{O}$ is a bounded domain. The time-dependent flux on the boundary $\Gamma:=\partial\Omega_\mathcal{O}$ is prescribed. The aim of the paper is to approximate the dynamics by the solution of the diffusion equation on the whole of $\mathbb{R}^2$ with a measure-valued point source in the origin and provide estimates for the quality of approximation. For all time $t$, we derive an $L^2([0,t];L^2(\Gamma))$-bound on the difference in flux on the boundary. Moreover, we derive for all $t>0$ an $L^2(\Omega)$-bound and an $L^2([0,t];H^1(\Omega))$-bound for the difference of the solutions to the two models

Sensor data management with probabilistic models

The anticipated ‘sensing environments’ of the near future pose new requirements to the data management systems that mediate between sensor data supply and demand sides. We identify and investigate one of them: the need to deal with the inherent uncertainty in sensor data due to measurement noise, missing data, the semantic gap between the measured data and relevant information, and the integration of data from different sensors.\ud \ud Probabilistic models of sensor data can be used to deal with these uncertainties in the well-understood and fruitful framework of probability theory. In particular, the Bayesian network formalism proves useful for modeling sensor data in a flexible environment, because its comprehensiveness and modularity. We provide extensive technical argumentation for this claim. As a demonstration case, we define a discrete Bayesian network for location tracking using Bluetooth transceivers.\ud \ud In order to scale up sensor models, efficient probabilistic inference on the Bayesian network is crucial. However, we observe that the conventional inference methods do not scale well for our demonstration case. We propose several optimizations, making it possible to jointly scale up the number of locations and sensors in sublinear time, and to scale up the time resolution in linear time. Moreover, we define a theoretical framework in which these optimizations are derived by translating an inference query into relational algebra. This allows the query to be analyzed and optimized using insights and techniques from the database community; for example, using cost metrics based on cardinality rather than dimensionality.\ud \ud An orthogonal research question investigates the possibility of collecting transition statistics in a local, clustered fashion, in which transitions between states of different clusters cannot be directly observed. We show that this problem can be written as a constrained system of linear equations, for which we describe a specialized solution method

The right expert at the right time and place: From expertise identification to expertise selection

We propose a unified and complete solution for expert finding in organizations, including not only expertise identification, but also expertise selection functionality. The latter two include the use of implicit and explicit preferences of users on meeting each other, as well as localization and planning as important auxiliary processes. We also propose a solution for privacy protection, which is urgently required in view of the huge amount of privacy sensitive data involved. Various parts are elaborated elsewhere, and we look forward to a realization and usage of the proposed system as a whole

Size-Dependent Optical Properties of InP Colloidal Quantum Dots

Indium phosphide colloidal quantum dots (CQDs) are the main alternative for toxic and restricted Cd based CQDs for lighting and display applications. Here we systematically report on the size-dependent optical absorption, ensemble, and single particle photoluminescence (PL) and biexciton lifetimes of core-only InP CQDs. This systematic study is enabled by improvements in the synthesis of InP CQDs to yield a broad size series of monodisperse core-only InP CQDs with narrow absorption and PL line width and significant PL quantum yield