In this paper we report on our first experiences using the relational analysis provided by the Alloy tool with the theorem prover KIV in the context of specifications of freely generated data types. The presented approach aims at improving KIV’s performance on first-order theories. In theorem proving practice a significant amount of time is spent on unsuccessful proof attempts. An automatic met...

Title of Thesis: Schema Free Querying of Semantic Data Lushan Han, PhD Computer Science, 2014 Thesis directed by: Dr. Tim Finin, Professor Department of Computer Science and Electrical Engineering Developing interfaces to enable casual, non-expert users to query complex structured data has been the subject of much research over the past forty years. We refer to them as schema-free query interfa...

We demonstrate a generic method for visualization of high-resolution unorganized and noisy 3D data points with a surface of significantly lower resolution. To this effect, we feed our algorithm with all the go Light Detection And Ranging (LiDAR) data and approximate it with a triangular mesh that is being deformed iteratively until convergence. Our main contribution is avoiding the direct trian...

We formalise the data race free (DRF) guarantee provided by Java, as captured by the semi-formal Java Memory Model (JMM) [1] and published in the Java Language Specification [2]. The DRF guarantee says that all programs which are correctly synchronised (i.e., free of data races) can only have sequentially consistent behaviours. Such programs can be understood intuitively by programmers. Formali...

Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing ap...

Matching of multiple views is often addressed in 3D-model generation and is normally a two-stage process consisting of a coarse and a fine matching stage. Coarse matching, that is the pre-alignment of the surfaces for the complex forms, which can be positioned far away from each other in 3D space, is a difficult problem to solve. Fine matching on the other hand can be performed accurately using...

Distributed association rule mining is an integral part of data mining that extracts useful information hidden in distributed data sources. As local frequent itemsets are globalized from data sources, sensitive information about individual data sources needs high protection. Different privacy preserving data mining approaches for distributed environment have been proposed but in the existing ap...

Existing depth-based approaches to predicting anthropometric measurements, such as body height, arm span and hip circumference, either directly compute the measurements on 3D point clouds, and thus are sensitive to noise, or fit a model to the observed depth values, which typically is time-consuming. In this paper, we rely on the intuition that, to predict a specific anthropometric measurement,...