Use of a novel Hill-climbing genetic algorithm in protein folding simulations

We have developed a novel Hill-climbing genetic algorithm (GA) for simulation of protein folding. The program (written in C) builds a set of Cartesian points to represent an unfolded polypeptide's backbone. The dihedral angles determining the chain's configuration are stored in an array of chromosome structures that is copied and then mutated. The fitness of the mutated chain's configuration is determined by its radius of gyration. A four-helix bundle was used to optimise simulation conditions, and the program was compared with other, larger, genetic algorithms on a variety of structures. The program ran 50% faster than other GA programs. Overall, tests on 100 non-redundant structures gave comparable results to other genetic algorithms, with the Hill-climbing program running from between 20 and 50% faster. Examples including crambin, cytochrome c, cytochrome B and hemerythrin gave good secondary structure fits with overall alpha carbon atom rms deviations of between 5 and 5.6 Angstrom with an optimised hydrophobic term in the fitness function. (C) 2003 Elsevier Ltd. All rights reserved.

Full-dimensional quantum calculations of ground-state tunneling splitting of malonaldehyde using an accurate ab initio potential energy surface

Quantum calculations of the ground vibrational state tunneling splitting of H-atom and D-atom transfer in malonaldehyde are performed on a full-dimensional ab initio potential energy surface (PES). The PES is a fit to 11 147 near basis-set-limit frozen-core CCSD(T) electronic energies. This surface properly describes the invariance of the potential with respect to all permutations of identical atoms. The saddle-point barrier for the H-atom transfer on the PES is 4.1 kcal/mol, in excellent agreement with the reported ab initio value. Model one-dimensional and "exact" full-dimensional calculations of the splitting for H- and D-atom transfer are done using this PES. The tunneling splittings in full dimensionality are calculated using the unbiased "fixed-node" diffusion Monte Carlo (DMC) method in Cartesian and saddle-point normal coordinates. The ground-state tunneling splitting is found to be 21.6 cm(-1) in Cartesian coordinates and 22.6 cm(-1) in normal coordinates, with an uncertainty of 2-3 cm(-1). This splitting is also calculated based on a model which makes use of the exact single-well zero-point energy (ZPE) obtained with the MULTIMODE code and DMC ZPE and this calculation gives a tunneling splitting of 21-22 cm(-1). The corresponding computed splittings for the D-atom transfer are 3.0, 3.1, and 2-3 cm(-1). These calculated tunneling splittings agree with each other to within less than the standard uncertainties obtained with the DMC method used, which are between 2 and 3 cm(-1), and agree well with the experimental values of 21.6 and 2.9 cm(-1) for the H and D transfer, respectively. (C) 2008 American Institute of Physics.

Generation, description and storage of dendritic morphology data

It is generally assumed that the variability of neuronal morphology has an important effect on both the connectivity and the activity of the nervous system, but this effect has not been thoroughly investigated. Neuroanatomical archives represent a crucial tool to explore structure–function relationships in the brain. We are developing computational tools to describe, generate, store and render large sets of three–dimensional neuronal structures in a format that is compact, quantitative, accurate and readily accessible to the neuroscientist. Single–cell neuroanatomy can be characterized quantitatively at several levels. In computer–aided neuronal tracing files, a dendritic tree is described as a series of cylinders, each represented by diameter, spatial coordinates and the connectivity to other cylinders in the tree. This ‘Cartesian’ description constitutes a completely accurate mapping of dendritic morphology but it bears little intuitive information for the neuroscientist. In contrast, a classical neuroanatomical analysis characterizes neuronal dendrites on the basis of the statistical distributions of morphological parameters, e.g. maximum branching order or bifurcation asymmetry. This description is intuitively more accessible, but it only yields information on the collective anatomy of a group of dendrites, i.e. it is not complete enough to provide a precise ‘blueprint’ of the original data. We are adopting a third, intermediate level of description, which consists of the algorithmic generation of neuronal structures within a certain morphological class based on a set of ‘fundamental’, measured parameters. This description is as intuitive as a classical neuroanatomical analysis (parameters have an intuitive interpretation), and as complete as a Cartesian file (the algorithms generate and display complete neurons). The advantages of the algorithmic description of neuronal structure are immense. If an algorithm can measure the values of a handful of parameters from an experimental database and generate virtual neurons whose anatomy is statistically indistinguishable from that of their real counterparts, a great deal of data compression and amplification can be achieved. Data compression results from the quantitative and complete description of thousands of neurons with a handful of statistical distributions of parameters. Data amplification is possible because, from a set of experimental neurons, many more virtual analogues can be generated. This approach could allow one, in principle, to create and store a neuroanatomical database containing data for an entire human brain in a personal computer. We are using two programs, L–NEURON and ARBORVITAE, to investigate systematically the potential of several different algorithms for the generation of virtual neurons. Using these programs, we have generated anatomically plausible virtual neurons for several morphological classes, including guinea pig cerebellar Purkinje cells and cat spinal cord motor neurons. These virtual neurons are stored in an online electronic archive of dendritic morphology. This process highlights the potential and the limitations of the ‘computational neuroanatomy’ strategy for neuroscience databases.

Complete robot-eye calibration without special calibration objects

A robot mounted camera is useful in many machine vision tasks as it allows control over view direction and position. In this paper we report a technique for calibrating both the robot and the camera using only a single corresponding point. All existing head-eye calibration systems we have encountered rely on using pre-calibrated robots, pre- calibrated cameras, special calibration objects or combinations of these. Our method avoids using large scale non-linear optimizations by recovering the parameters in small dependent groups. This is done by performing a series of planned, but initially uncalibrated robot movements. Many of the kinematic parameters are obtained using only camera views in which the calibration feature is at, or near the image center, thus avoiding errors which could be introduced by lens distortion. The calibration is shown to be both stable and accurate. The robotic system we use consists of camera with pan-tilt capability mounted on a Cartesian robot, providing a total of 5 degrees of freedom.

View-based modelling of human visual navigation errors

View-based and Cartesian representations provide rival accounts of visual navigation in humans, and here we explore possible models for the view-based case. A visual “homing” experiment was undertaken by human participants in immersive virtual reality. The distributions of end-point errors on the ground plane differed significantly in shape and extent depending on visual landmark configuration and relative goal location. A model based on simple visual cues captures important characteristics of these distributions. Augmenting visual features to include 3D elements such as stereo and motion parallax result in a set of models that describe the data accurately, demonstrating the effectiveness of a view-based approach.

Calculating the tetrahedral bond angle using spherical polars and the dot product

A proof using the methane tetrahedroid bond angle can be obtained by using spherical polar coordinates to calculate the Cartesian coordinates of the hydrogen atoms, then using the dot product of vectors.

Reflections on Beckett: a centenary celebration

The essays in this collection were originally delivered as part of the Samuel Beckett lecture series at Trinity College Dublin, Samuel Beckett's alma mater. The contributors include eminent Beckett scholars such as Linda Ben-Zvi, Enoch Brater, Ruby Cohn and Stan Gontarski, theatre scholars such as Herbert Blau and Joseph Roach, practitioners such as the Irish actor, Barry McGovern, and cultural critics such as Marina Warner and Terry Eagleton. The collection sheds new light on Beckett's enigmatic theater, offering new perspectives on Beckett's use of language and silence, on his attitudes toward the body, on those who influenced him and on those he has influenced (including Suzan-Lori Parks and Femi Osofisan), and on Beckett and the art of self-collaboration. Each contributor places the playwright into a network of genealogies and legacies and his work into important historical, cultural, and aesthetic contexts. Together, the essays demonstrate Beckett's impact on theater, performance, and visual arts during the latter half of the twentieth century and serve to open up new directions for Beckett studies.

The Spanish Ambassador and Samuel Daniel's Vision of the Twelve Goddesses: A New Document [with text]

The performance of Samuel Daniel's masque The Vision of the Twelve Goddesses at court on January 8, 1604 took place in the midst of the preliminary negotiations that would lead to the signing of the Anglo-Spanish peace at Somerset House the following August. Philip III sent a special ambassador to England to congratulate James on his accession, and a series of tussles between Juan de Tassis and his French counterpart ensued. As a recently-discovered document in the Archivo General de Simancas reveals, Anna of Denmark intervened personally to insure that de Tassis, and not the Frenchman, attended the masque. This was a clear signal of James and Anna's peace aims, which de Tassis conveyed to the King of Spain; moreover, he enclosed in his dispatch a text of Daniel's masque which he clearly considered both political intelligence and of interest to the theater-loving Hapsburg monarch. The Simancas text of the Daniel masque is a new version, hitherto unknown, which adds to our knowledge of the circumstances in which the first Stuart masque was performed. Here we present a transcription and annotated translation of both de Tassis' letter and the text of the masque he had compiled for Philip III. (B. C.-E. and M. H.)

Voice, body and the transmission of the real in documentary theatre

This article analyses how listening is used to develop performances in Alecky Blythe’s verbatim theatre. Listening includes Blythe’s use of recorded oral interviews for devising performances, and also the actors’ creation of performance by precisely imitating an interviewee’s voice. The article focuses on listening, speaking and embodiment in London Road, Blythe’s recent musical play at London’s National Theatre, which adopted and modified theatre strategies used in her other plays, especially The Girlfriend Experience and Do We look Like Refugees. The article draws on interviews with performers and with Blythe herself, in its critical analysis of how voice legitimates claims to authenticity in performance. The work on Blythe is contextualised by brief comparative analyses. One is Clio Barnard’s film The Arbor, a ‘quasi-documentary’ on the playwright, Andrea Dunbar which makes use of an oral script to which the actors lip-sync. The other comparator is the Wooster Group’s Poor Theater, which attempts to recreate Grotowski's Akropolis via vocal impersonation. The article argues that voice in London Road both claims and defers authenticity and authority, inasmuch as voice signifies presence and embodied identity but the reworking of speech into song signals the absence of the real. The translation of voice into written surtitles works similarly in Do We Look Like Refugees. Blythe’s theatre, Barnard’s film and The Wooster Group’s performances are a useful framework for addressing questions of voice and identity, and authenticity and replication in documentary theatre. The article concludes by placing Blythe’s oral texts amid current debates around theatre’s textual practices.

Fetishizing the Holocaust: comedy and transatlantic connections in Howard Jacobson's 'Kalooki Nights'

The British Jewish novelist Howard Jacobson has, from the start of his career, found himself saddled with the unenviable label of 'the English Philip Roth'. For many years, Jacobson bristled at the Roth comparisons, offering the alternative label 'the Jewish Jane Austen' and insisting that he had not read Roth at all, though more recently he has put on record his admiration for Roth's comic masterpiece, Sabbath's Theater.If Jacobson's early work was certainly imbued with a Rothian Jewish humour, its cultural reference points were almost invariably English. In contrast, Kalooki Nights is saturated with allusions to American culture, in particular Jewish American culture. This article traces some of the ways in which Kalooki Nights explores and exploits these transatlantic connections in a comic novel that both participates in and satirizes what will be called here the fetishization of the Holocaust. It is concluded that Kalooki Nights is Jacobson's audacious attempt to produce a piece of Holocaust literature that exploits the tension between the desire of some Jews of his generation to know all the 'gory details', and the necessity of recognizing that their own historical situation prevents them from ever doing so. The result is to make people laugh not at the events of the Holocaust itself but at the attempt to fetishize them.

A geometric mass-preserving redistancing scheme for the level set function

In this paper we describe and evaluate a geometric mass-preserving redistancing procedure for the level set function on general structured grids. The proposed algorithm is adapted from a recent finite element-based method and preserves the mass by means of a localized mass correction. A salient feature of the scheme is the absence of adjustable parameters. The algorithm is tested in two and three spatial dimensions and compared with the widely used partial differential equation (PDE)-based redistancing method using structured Cartesian grids. Through the use of quantitative error measures of interest in level set methods, we show that the overall performance of the proposed geometric procedure is better than PDE-based reinitialization schemes, since it is more robust with comparable accuracy. We also show that the algorithm is well-suited for the highly stretched curvilinear grids used in CFD simulations. Copyright (C) 2010 John Wiley & Sons, Ltd.

Two-Phase Mapping for Projecting Massive Data Sets

Most multidimensional projection techniques rely on distance (dissimilarity) information between data instances to embed high-dimensional data into a visual space. When data are endowed with Cartesian coordinates, an extra computational effort is necessary to compute the needed distances, making multidimensional projection prohibitive in applications dealing with interactivity and massive data. The novel multidimensional projection technique proposed in this work, called Part-Linear Multidimensional Projection (PLMP), has been tailored to handle multivariate data represented in Cartesian high-dimensional spaces, requiring only distance information between pairs of representative samples. This characteristic renders PLMP faster than previous methods when processing large data sets while still being competitive in terms of precision. Moreover, knowing the range of variation for data instances in the high-dimensional space, we can make PLMP a truly streaming data projection technique, a trait absent in previous methods.

Resampling Strategies for Deforming MLS Surfaces

Moving-least-squares (MLS) surfaces undergoing large deformations need periodic regeneration of the point set (point-set resampling) so as to keep the point-set density quasi-uniform. Previous work by the authors dealt with algebraic MLS surfaces, and proposed a resampling strategy based on defining the new points at the intersections of the MLS surface with a suitable set of rays. That strategy has very low memory requirements and is easy to parallelize. In this article new resampling strategies with reduced CPU-time cost are explored. The basic idea is to choose as set of rays the lines of a regular, Cartesian grid, and to fully exploit this grid: as data structure for search queries, as spatial structure for traversing the surface in a continuation-like algorithm, and also as approximation grid for an interpolated version of the MLS surface. It is shown that in this way a very simple and compact resampling technique is obtained, which cuts the resampling cost by half with affordable memory requirements.

A discontinuous-Galerkin-based immersed boundary method

A numerical method to approximate partial differential equations on meshes that do not conform to the domain boundaries is introduced. The proposed method is conceptually simple and free of user-defined parameters. Starting with a conforming finite element mesh, the key ingredient is to switch those elements intersected by the Dirichlet boundary to a discontinuous-Galerkin approximation and impose the Dirichlet boundary conditions strongly. By virtue of relaxing the continuity constraint at those elements. boundary locking is avoided and optimal-order convergence is achieved. This is shown through numerical experiments in reaction-diffusion problems. Copyright (c) 2008 John Wiley & Sons, Ltd.