Secondary structure prediction with support vector machines

Motivation: A new method that uses support vector machines (SVMs) to predict protein secondary structure is described and evaluated. The study is designed to develop a reliable prediction method using an alternative technique and to investigate the applicability of SVMs to this type of bioinformatics problem. Methods: Binary SVMs are trained to discriminate between two structural classes. The binary classifiers are combined in several ways to predict multi-class secondary structure. Results: The average three-state prediction accuracy per protein (Q3) is estimated by cross-validation to be 77.07 ± 0.26% with a segment overlap (Sov) score of 73.32 ± 0.39%. The SVM performs similarly to the 'state-of-the-art' PSIPRED prediction method on a non-homologous test set of 121 proteins despite being trained on substantially fewer examples. A simple consensus of the SVM, PSIPRED and PROFsec achieves significantly higher prediction accuracy than the individual methods. Availability: The SVM classifier is available from the authors. Work is in progress to make the method available on-line and to integrate the SVM predictions into the PSIPRED server.

Parkinson’s Disease tremor classification – a comparison between Support Vector Machines and neural networks

Deep Brain Stimulation has been used in the study of and for treating Parkinson’s Disease (PD) tremor symptoms since the 1980s. In the research reported here we have carried out a comparative analysis to classify tremor onset based on intraoperative microelectrode recordings of a PD patient’s brain Local Field Potential (LFP) signals. In particular, we compared the performance of a Support Vector Machine (SVM) with two well known artificial neural network classifiers, namely a Multiple Layer Perceptron (MLP) and a Radial Basis Function Network (RBN). The results show that in this study, using specifically PD data, the SVM provided an overall better classification rate achieving an accuracy of 81% recognition.

Turing, Kasparov and the future

The 'Turing 100' Conference in Manchester was the main event of the Turing Centenary Year in 2012. This is a report and reflection on Kasparov's popular talk. Within it, he explained how Turing and influenced computer chess, his career and the chess community. Kasparov also played Chessbase's 'TURING' emulation of Turing's second paper chess engine, here labelled 'AT2'. Quasi Turing-tests, computer contributions to world championship chess, and suspected cheating in chess are also mentioned.

People or machines? Assessing the impacts of smart meters and load controllers in Italian office spaces

Government initiatives in several developed and developing countries to roll-out smart meters call for research on the sustainability impacts of these devices. In principle smart meters bring about higher control over energy theft and lower consumption, but require a high level of engagement by end-users. An alternative consists of load controllers, which control the load according to pre-set parameters. To date, research has focused on the impacts of these two alternatives separately. This study compares the sustainability impacts of smart meters and load controllers in an occupied office building in Italy. The assessment is carried out on three different floors of the same building. Findings show that demand reductions associated with a smart meter device are 5.2% higher than demand reductions associated with the load controller.

Effects of lying in practical Turing tests

Interpretation of utterances affects an interrogator’s determination of human from machine during live Turing tests. Here, we consider transcripts realised as a result of a series of practical Turing tests that were held on 23 June 2012 at Bletchley Park, England. The focus in this paper is to consider the effects of lying and truth-telling on the human judges by the hidden entities, whether human or a machine. Turing test transcripts provide a glimpse into short text communication, the type that occurs in emails: how does the reader determine truth from the content of a stranger’s textual message? Different types of lying in the conversations are explored, and the judge’s attribution of human or machine is investigated in each test.

The new localism, anti-political development machines, and the role of planning consultants: lessons from London's South Bank

This paper draws on a study of the politics of development planning in London’s South Bank to examine wider trends in the governance of contemporary cities. It assesses the impacts and outcomes of so-called new localist reforms and argues that we are witnessing two principal trends. First, governance processes are increasingly dominated by anti-democratic development machines, characterized by new assemblages of public- and private-sector experts. These machines reflect and reproduce a type of development politics in which there is a greater emphasis on a pragmatic realism and a politics of delivery. Second, the presence of these machines is having a significant impact on the politics of planning. Democratic engagement is not seen as the basis for new forms of localism and community control. Instead, it is presented as a potentially disruptive force that needs to be managed by a new breed of skilled private-sector consultant. The paper examines these wider shifts in urban politics before focusing on the connections between emerging development machines and local residential and business communities. It ends by highlighting some of the wider implications of change for democratic modes of engagement and nodes of resistance in urban politics.

Transmathematical basis of infinitely scalable pipeline machines

We describe infinitely scalable pipeline machines with perfect parallelism, in the sense that every instruction of an inline program is executed, on successive data, on every clock tick. Programs with shared data effectively execute in less than a clock tick. We show that pipeline machines are faster than single or multi-core, von Neumann machines for sufficiently many program runs of a sufficiently time consuming program. Our pipeline machines exploit the totality of transreal arithmetic and the known waiting time of statically compiled programs to deliver the interesting property that they need no hardware or software exception handling.