Contributions to the relativistic mechanics of continuous media

This is a translation from German of an article originally published inProceedings of the Mathematical-Natural Science Section of the Mainz Academy of Science and Literature, Nr. 11, 1961 (pp. 792–837) (printed by Franz Steiner and Co, Wiesbaden), which is Paper IV in the series ldquoExact Solutions of the Field Equations of General Relativity Theoryrdquo by Pascual Jordan, Jürgen Ehlers, Wolfgang Kundt and Rainer K. Sachs. The translation has been carried out by G. F. R. Ellis (Department of Applied Mathematics, University of Cape Town), assisted by P. K. S. Dunsby, so that this outstanding review paper can be readily accessible to workers in the field today. As far as possible, the translation has preserved both the spirit and the form of the original paper. Despite its age, it remains one of the best reviews available in this area

Efficient Bayesian Nonparametric Modelling of Structured Point Processes

This paper presents a Bayesian generative model for dependent Cox point processes, alongside an efficient inference scheme which scales as if the point processes were modelled independently. We can handle missing data naturally, infer latent structure, and cope with large numbers of observed processes. A further novel contribution enables the model to work effectively in higher dimensional spaces. Using this method, we achieve vastly improved predictive performance on both 2D and 1D real data, validating our structured approach.Comment: Presented at UAI 2014. Bibtex: @inproceedings{structcoxpp14_UAI, Author = {Tom Gunter and Chris Lloyd and Michael A. Osborne and Stephen J. Roberts}, Title = {Efficient Bayesian Nonparametric Modelling of Structured Point Processes}, Booktitle = {Uncertainty in Artificial Intelligence (UAI)}, Year = {2014}

Exploiting Domain Knowledge in Making Delegation Decisions

@inproceedings{conf/admi/EmeleNSP11, added-at = {2011-12-19T00:00:00.000+0100}, author = {Emele, Chukwuemeka David and Norman, Timothy J. and Sensoy, Murat and Parsons, Simon}, biburl = {http://www.bibsonomy.org/bibtex/20a08b683088443f1fd36d6ef28bf6615/dblp}, booktitle = {ADMI}, crossref = {conf/admi/2011}, editor = {Cao, Longbing and Bazzan, Ana L. C. and Symeonidis, Andreas L. and Gorodetsky, Vladimir and Weiss, Gerhard and Yu, Philip S.}, ee = {http://dx.doi.org/10.1007/978-3-642-27609-5_9}, interhash = {1d7e7f8554e8bdb3d43c32e02aeabcec}, intrahash = {0a08b683088443f1fd36d6ef28bf6615}, isbn = {978-3-642-27608-8}, keywords = {dblp}, pages = {117-131}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2011-12-19T00:00:00.000+0100}, title = {Exploiting Domain Knowledge in Making Delegation Decisions.}, url = {http://dblp.uni-trier.de/db/conf/admi/admi2011.html#EmeleNSP11}, volume = 7103, year = 2011 }Postprin

Approximate Decentralized Bayesian Inference

This paper presents an approximate method for performing Bayesian inference in models with conditional independence over a decentralized network of learning agents. The method first employs variational inference on each individual learning agent to generate a local approximate posterior, the agents transmit their local posteriors to other agents in the network, and finally each agent combines its set of received local posteriors. The key insight in this work is that, for many Bayesian models, approximate inference schemes destroy symmetry and dependencies in the model that are crucial to the correct application of Bayes' rule when combining the local posteriors. The proposed method addresses this issue by including an additional optimization step in the combination procedure that accounts for these broken dependencies. Experiments on synthetic and real data demonstrate that the decentralized method provides advantages in computational performance and predictive test likelihood over previous batch and distributed methods.Comment: This paper was presented at UAI 2014. Please use the following BibTeX citation: @inproceedings{Campbell14_UAI, Author = {Trevor Campbell and Jonathan P. How}, Title = {Approximate Decentralized Bayesian Inference}, Booktitle = {Uncertainty in Artificial Intelligence (UAI)}, Year = {2014}

Using Links to prototype a Database Wiki

Both relational databases and wikis have strengths that make them attractive for use in collaborative applications. In the last decade, database-backed Web applications have been used extensively to develop valuable shared biological references called curated databases. Databases offer many advantages such as scalability, query optimization and concurrency control, but are not easy to use and lack other features needed for collaboration. Wikis have become very popular for early-stage biocuration projects because they are easy to use, encourage sharing and collaboration, and provide built-in support for archiving, history-tracking and annotation. However, curation projects often outgrow the limited capabilities of wikis for structuring and efficiently querying data at scale, necessitating a painful phase transition to a database-backed Web application. We perceive a need for a new class of general-purpose system, which we call a Database Wiki, that combines flexible wiki-like support for collaboration with robust database-like capabilities for structuring and querying data. This paper presents DBWiki, a design prototype for such a system written in the Web programming language Links. We present the architecture, typical use, and wiki markup language design for DBWiki and discuss features of Links that provided unique advantages for rapid Web/database application prototyping

Domain transfer for deep natural language generation from abstract meaning representations

Stochastic natural language generation systems that are trained from labelled datasets are often domainspecific in their annotation and in their mapping from semantic input representations to lexical-syntactic outputs. As a result, learnt models fail to generalize across domains, heavily restricting their usability beyond single applications. In this article, we focus on the problem of domain adaptation for natural language generation. We show how linguistic knowledge from a source domain, for which labelled data is available, can be adapted to a target domain by reusing training data across domains. As a key to this, we propose to employ abstract meaning representations as a common semantic representation across domains. We model natural language generation as a long short-term memory recurrent neural network encoderdecoder, in which one recurrent neural network learns a latent representation of a semantic input, and a second recurrent neural network learns to decode it to a sequence of words. We show that the learnt representations can be transferred across domains and can be leveraged effectively to improve training on new unseen domains. Experiments in three different domains and with six datasets demonstrate that the lexical-syntactic constructions learnt in one domain can be transferred to new domains and achieve up to 75-100% of the performance of in-domain training. This is based on objective metrics such as BLEU and semantic error rate and a subjective human rating study. Training a policy from prior knowledge from a different domain is consistently better than pure in-domain training by up to 10%

Pattern based processing of XPath queries

As the popularity of areas including document storage and distributed systems continues to grow, the demand for high performance XML databases is increasingly evident. This has led to a number of research eorts aimed at exploiting the maturity of relational database systems in order to in- crease XML query performance. In our approach, we use an index structure based on a metamodel for XML databases combined with relational database technology to facilitate fast access to XML document elements. The query process involves transforming XPath expressions to SQL which can be executed over our optimised query engine. As there are many dierent types of XPath queries, varying processing logic may be applied to boost performance not only to indi- vidual XPath axes, but across multiple axes simultaneously. This paper describes a pattern based approach to XPath query processing, which permits the execution of a group of XPath location steps in parallel

Human evaluation of Kea, an automatic keyphrasing system.

This paper describes an evaluation of the Kea automatic keyphrase extraction algorithm. Tools that automatically identify keyphrases are desirable because document keyphrases have numerous applications in digital library systems, but are costly and time consuming to manually assign. Keyphrase extraction algorithms are usually evaluated by comparison to author-specified keywords, but this methodology has several well-known shortcomings. The results presented in this paper are based on subjective evaluations of the quality and appropriateness of keyphrases by human assessors, and make a number of contributions. First, they validate previous evaluations of Kea that rely on author keywords. Second, they show Kea's performance is comparable to that of similar systems that have been evaluated by human assessors. Finally, they justify the use of author keyphrases as a performance metric by showing that authors generally choose good keywords

A Semi-Supervised Approach to Detecting Stance in Tweets

Stance classification aims to identify, for a particular issue under discussion, whether the speaker or author of a conversational turn has Pro (Favor) or Con (Against) stance on the issue. Detecting stance in tweets is a new task proposed for SemEval-2016 Task6, involving predicting stance for a dataset of tweets on the topics of abortion, atheism, climate change, feminism and Hillary Clinton. Given the small size of the dataset, our team created our own topic-specific training corpus by developing a set of high precision hashtags for each topic that were used to query the twitter API, with the aim of developing a large training corpus without additional human labeling of tweets for stance. The hashtags selected for each topic were predicted to be stance-bearing on their own. Experimental results demonstrate good performance for our features for opinion-target pairs based on generalizing dependency features using sentiment lexicons.Comment: @InProceedings{S16-1068, title = "NLDS-UCSC at SemEval-2016 Task 6: A Semi-Supervised Approach to Detecting Stance in Tweets", "Misra, Amita and Ecker, Brian and Handleman, Theodore and Hahn, Nicolas and Walker, Marilyn",booktitle = "Proceedings of the 10th International Workshop on Semantic Evaluation (SemEval-2016) ", year = "2016",publisher = "Association for Computational Linguistics"