The theta-join as a join with theta

We present an algebra for the classical database operators. Contrary to most approaches we use (inner) join and projection as the basic operators. Theta joins result by representing theta as a database table itself and defining theta-join as a join with that table. The same technique works for selection. With this, (point-free) proofs of the standard optimisation laws become very simple and uniform. The approach also applies to proving join/projection laws for preference queries. Extending the earlier approach of [16], we replace disjointness assumptions on the table types by suitable consistency conditions. Selected results have been machine-verified using the CALCCHECK tool

Assessor Differences and User Preferences in Tweet Timeline Generation

In information retrieval evaluation, when presented with an effectiveness difference between two systems, there are three relevant questions one might ask. First, are the differences statistically significant? Second, is the comparison stable with respect to assessor differences? Finally, is the differ-ence actually meaningful to a user? This paper tackles the last two questions about assessor differences and user prefer-ences in the context of the newly-introduced tweet timeline generation task in the TREC 2014 Microblog track, where the system’s goal is to construct an informative summary of non-redundant tweets that addresses the user’s informa-tion need. Central to the evaluation methodology is human-generated semantic clusters of tweets that contain substan-tively similar information. We show that the evaluation is stable with respect to assessor differences in clustering and that user preferences generally correlate with effectiveness metrics even though users are not explicitly aware of the semantic clustering being performed by the systems. Al-though our analyses are limited to this particular task, we believe that lessons learned could generalize to other eval-uations based on establishing semantic equivalence between information units, such as nugget-based evaluations in ques-tion answering and temporal summarization

Analysis of parametric biological models with non-linear dynamics

In this paper we present recent results on parametric analysis of biological models. The underlying method is based on the algorithms for computing trajectory sets of hybrid systems with polynomial dynamics. The method is then applied to two case studies of biological systems: one is a cardiac cell model for studying the conditions for cardiac abnormalities, and the second is a model of insect nest-site choice.Comment: In Proceedings HSB 2012, arXiv:1208.315

Genera of fungivorous Phlaeothripinae (Thysanoptera) from dead branches and leaf-litter in Australia

An illustrated key is provided for the identification of 39 genera of Thysanoptera-Phlaeothripinae with species that live in association with dead branches and leaf-litter in Australia and are considered to be fungus-feeding. Seven of these gen-era are not previously recorded from this continent, including un-named species of Deplorothrips, Malacothrips, Mystro-thrips, Preeriella and Tylothrips, together with Azaleothrips lepidus Okajima and Terthrothrips ananthakrishnani Kudo. A brief generic diagnosis is provided for each genus, together with comments on systematic problems and numbers of species. Copyright © 2013 Magnolia Press

Describing and Processing Topology and Quality of Service Parameters of Applications in the Cloud

Typical cloud applications require high-level policy driven orchestration to achieve efficient resource utilisation and robust security to support different types of users and user scenarios. However, the efficient and secure utilisation of cloud resources to run applications is not trivial. Although there have been several efforts to support the coordinated deployment, and to a smaller extent the run-time orchestration of applications in the Cloud, no comprehensive solution has emerged until now that successfully leverages applications in an efficient, secure and seamless way. One of the major challenges is how to specify and manage Quality of Service (QoS) properties governing cloud applications. The solution to address these challenges could be a generic and pluggable framework that supports the optimal and secure deployment and run-time orchestration of applications in the Cloud. A specific aspect of such a cloud orchestration framework is the need to describe complex applications incorporating several services. These application descriptions must specify both the structure of the application and its QoS parameters, such as desired performance, economic viability and security. This paper proposes a cloud technology agnostic approach to application descriptions based on existing standards and describes how these application descriptions can be processed to manage applications in the Cloud