Database-friendly random projections: Johnson-Lindenstrauss with binary coins

A classic result of Johnson and Lindenstrauss asserts that any set of n points in d-dimensional Euclidean space can be embedded into k-dimensional Euclidean space—where k is logarithmic in n and independent of d—so that all pairwise distances are maintained within an arbitrarily small factor. All known constructions of such embeddings involve projecting the n points onto a spherically random k-dimensional hyperplane through the origin. We give two constructions of such embeddings with the property that all elements of the projection matrix belong in {−1,0,+1}. Such constructions are particularly well suited for database environments, as the computation of the embedding reduces to evaluating a single aggregate over k random partitions of the attributes.     

Direction relations and two-dimensional range queries: optimisation techniques

This paper defines direction relations (e.g., north, northeast) between two-dimensional objects and shows how they can be efficiently retrieved using B-, KDB- and R- tree-based data structures. Essentially, our work studies optimisation techniques for 2D range queries that arise during the processing of direction relations. We test the efficiency of alternative indexing methods through extensive experimentation and present analytical models that estimate their performance. The analytical estimates are shown to be very close to the actual results and can be used by spatial query optimizers in order to predict the retrieval cost. In addition, we implement modifications of the existing structures that yield better performance for certain queries. We conclude the paper by discussing the most suitable method depending on the type of the range and the properties of the data.     

An artificial neural network-based multiscale method for hybrid atomistic-continuum simulations

This paper presents an artificial neural network-based multiscale method for coupling continuum and molecular simulations. Molecular dynamics modelling is employed as a local “high resolution” refinement of computational data required by the continuum computational fluid dynamics solver. The coupling between atomistic and continuum simulations is obtained by an artificial neural network (ANN) methodology. The ANN aims to optimise the transfer of information through minimisation of (1) the computational cost by avoiding repetitive atomistic simulations of nearly identical states, and (2) the fluctuation strength of the atomistic outputs that are fed back to the continuum solver. Results are presented for prototype flows such as the isothermal Couette flow with slip boundary conditions and the slip Couette flow with heat transfer.     

Development of surrogate models for the prediction of the flow around an aircraft propeller

In the present work, the derivation of two surrogate models (SMs) for modelling the flow around a propeller for small aircrafts is presented. Both methodologies use derived functions based on computations with the detailed propeller geometry. The computations were performed using k–ω shear stress transport for modelling turbulence. In the SMs, the modelling of the propeller was performed in a computational domain of disk-like geometry, where source terms were introduced in the momentum equations. In the first SM, the source terms were polynomial functions of swirl and thrust, mainly related to the propeller radius. In the second SM, regression analysis was used to correlate the source terms with the velocity distribution through the propeller. The proposed SMs achieved faster convergence, in relation to the detail model, by providing also results closer to the available operational data. The regression-based model was the most accurate and required less computational time for convergence.     

Star-like auto-configurable layouts of variable radius for visualizing and exploring RDF/S ontologies

The visualization of ontologies is a challenging task especially if they are large. In this paper we propose a visualization approach which is based on star-like graphs of variable radius which enables users to gradually explore and navigate through the entire ontology without overloading them. The star-like graphs are visualized using a Force Directed Placement algorithm (FDP) specially suited for RDF schemas whose configuration parameters can be adjusted interactively by the end-user via an intuitive on-screen tool bar. In addition, and since each star-like graph exhibits different graph features, we propose a novel automatic configuration method for the FDP algorithm parameters that is based on a number of quality metrics (area density and verticality of subclass hierarchies) and corresponding corrective actions. The experimental evaluation showed the quality of the yielded layout is significantly improved and the proposed approach is acceptably fast for real-time exploration. The user study showed that users prefer these views and perform various very common tasks faster.