A FAMILY OF CATION ATPASE-LIKE MOLECULES FROM PLASMODIUM-FALCIPARUM

Abstract. We report the nucleotide and derived amino acid sequence of the ATPase 1 gene from Plasmodium falciparum. The amino acid sequence shares homology with the family of "P-type cation transloeating ATPases in conserved regions important for nucleotide binding, conformational change, or phosphorylation. The gene, which is present on chromosome 5, has a product longer than any other reported for a P-type ATPase. Interstrain analysis from 12 parasite isolates by the polymerase chain reaction reveals that a 330-bp nucleotide sequence encoding three cytoplasmic regions conserved in cation ATPases (regions a-c) is of constant length. By contrast, another 360-bp sequence which is one of four regions we refer to as

The Divisive Power of Humour: Comedy, Taste and Symbolic Boundaries

Using British and Dutch interview data, this article demonstrates how people from different social classes draw strong symbolic boundaries on the basis of comedy taste. Eschewing the omnivorousness described in recent studies of cultural consumption, comedy audiences make negative aesthetic and moral judgements on the basis of comedy taste, and often make harsh judgements without the disclaimers, apologies and ambivalence so typical of ‘taste talk’ in contemporary culture. The article demonstrates how, in particular, Dutch and British middle class audiences use their comedy taste to communicate distinction and cultural superiority. We discuss several reasons why such processes of social distancing exist in comedy taste and not other cultural areas: the traditionally low status of comedy; the strong relation between humour and personhood; the continuity between comedy tastes and humour styles in everyday life; as well as the specific position of comedy in the British and Dutch cultural fields

The Extremes of Thermonuclear Supernovae

The majority of thermonuclear explosions in the Universe seem to proceed in a rather standardised way, as explosions of carbon-oxygen (CO) white dwarfs in binary systems, leading to 'normal' Type Ia supernovae (SNe Ia). However, over the years a number of objects have been found which deviate from normal SNe Ia in their observational properties, and which require different and not seldom more extreme progenitor systems. While the 'traditional' classes of peculiar SNe Ia - luminous '91T-like' and faint '91bg-like' objects - have been known since the early 1990s, other classes of even more unusual transients have only been established 20 years later, fostered by the advent of new wide-field SN surveys such as the Palomar Transient Factory. These include the faint but slowly declining '02es-like' SNe, 'Ca-rich' transients residing in the luminosity gap between classical novae and supernovae, extremely short-lived, fast-declining transients, and the very luminous so-called 'super-Chandrasekhar' SNe Ia. Not all of them are necessarily thermonuclear explosions, but there are good arguments in favour of a thermonuclear origin for most of them. The aim of this chapter is to provide an overview of the zoo of potentially thermonuclear transients, reviewing their observational characteristics and discussing possible explosion scenarios.Comment: Author version of a chapter for the 'Handbook of Supernovae', edited by A. Alsabti and P. Murdin, Springer. 50 pages, 7 figure

ciliaFA : a research tool for automated, high-throughput measurement of ciliary beat frequency using freely available software

Background: Analysis of ciliary function for assessment of patients suspected of primary ciliary dyskinesia (PCD) and for research studies of respiratory and ependymal cilia requires assessment of both ciliary beat pattern and beat frequency. While direct measurement of beat frequency from high-speed video recordings is the most accurate and reproducible technique it is extremely time consuming. The aim of this study was to develop a freely available automated method of ciliary beat frequency analysis from digital video (AVI) files that runs on open-source software (ImageJ) coupled to Microsoft Excel, and to validate this by comparison to the direct measuring high-speed video recordings of respiratory and ependymal cilia. These models allowed comparison to cilia beating between 3 and 52 Hz. Methods: Digital video files of motile ciliated ependymal (frequency range 34 to 52 Hz) and respiratory epithelial cells (frequency 3 to 18 Hz) were captured using a high-speed digital video recorder. To cover the range above between 18 and 37 Hz the frequency of ependymal cilia were slowed by the addition of the pneumococcal toxin pneumolysin. Measurements made directly by timing a given number of individual ciliary beat cycles were compared with those obtained using the automated ciliaFA system. Results: The overall mean difference (± SD) between the ciliaFA and direct measurement high-speed digital imaging methods was −0.05 ± 1.25 Hz, the correlation coefficient was shown to be 0.991 and the Bland-Altman limits of agreement were from −1.99 to 1.49 Hz for respiratory and from −2.55 to 3.25 Hz for ependymal cilia. Conclusions: A plugin for ImageJ was developed that extracts pixel intensities and performs fast Fourier transformation (FFT) using Microsoft Excel. The ciliaFA software allowed automated, high throughput measurement of respiratory and ependymal ciliary beat frequency (range 3 to 52 Hz) and avoids operator error due to selection bias. We have included free access to the ciliaFA plugin and installation instructions in Additional file 1 accompanying this manuscript that other researchers may use

Benchmarking 2D hydraulic models for urban flood simulations

This paper describes benchmark testing of six two-dimensional (2D) hydraulic models (DIVAST, DIVASTTVD, TUFLOW, JFLOW, TRENT and LISFLOOD-FP) in terms of their ability to simulate surface flows in a densely urbanised area. The models are applied to a 1·0 km × 0·4 km urban catchment within the city of Glasgow, Scotland, UK, and are used to simulate a flood event that occurred at this site on 30 July 2002. An identical numerical grid describing the underlying topography is constructed for each model, using a combination of airborne laser altimetry (LiDAR) fused with digital map data, and used to run a benchmark simulation. Two numerical experiments were then conducted to test the response of each model to topographic error and uncertainty over friction parameterisation. While all the models tested produce plausible results, subtle differences between particular groups of codes give considerable insight into both the practice and science of urban hydraulic modelling. In particular, the results show that the terrain data available from modern LiDAR systems are sufficiently accurate and resolved for simulating urban flows, but such data need to be fused with digital map data of building topology and land use to gain maximum benefit from the information contained therein. When such terrain data are available, uncertainty in friction parameters becomes a more dominant factor than topographic error for typical problems. The simulations also show that flows in urban environments are characterised by numerous transitions to supercritical flow and numerical shocks. However, the effects of these are localised and they do not appear to affect overall wave propagation. In contrast, inertia terms are shown to be important in this particular case, but the specific characteristics of the test site may mean that this does not hold more generally

Parallel Search with no Coordination

We consider a parallel version of a classical Bayesian search problem. $k$ agents are looking for a treasure that is placed in one of the boxes indexed by $\mathbb{N}^+$ according to a known distribution $p$. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can "peek" into a box. A basic family of algorithms which are inherently robust is \emph{non-coordinating} algorithms. Such algorithms act independently at each searcher, differing only by their probabilistic choices. We are interested in the price incurred by employing such algorithms when compared with the case of full coordination. We first show that there exists a non-coordination algorithm, that knowing only the relative likelihood of boxes according to $p$, has expected running time of at most $10+4(1+\frac{1}{k})^2 T$, where $T$ is the expected running time of the best fully coordinated algorithm. This result is obtained by applying a refined version of the main algorithm suggested by Fraigniaud, Korman and Rodeh in STOC'16, which was designed for the context of linear parallel search.We then describe an optimal non-coordinating algorithm for the case where the distribution $p$ is known. The running time of this algorithm is difficult to analyse in general, but we calculate it for several examples. In the case where $p$ is uniform over a finite set of boxes, then the algorithm just checks boxes uniformly at random among all non-checked boxes and is essentially $2$ times worse than the coordinating algorithm.We also show simple algorithms for Pareto distributions over $M$ boxes. That is, in the case where $p(x) \sim 1/x^b$ for $0< b < 1$, we suggest the following algorithm: at step $t$ choose uniformly from the boxes unchecked in ${1, . . . ,min(M, \lfloor t/\sigma\rfloor)}$, where $\sigma = b/(b + k - 1)$. It turns out this algorithm is asymptotically optimal, and runs about $2+b$ times worse than the case of full coordination

Shearlets and Optimally Sparse Approximations

Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field.Comment: in "Shearlets: Multiscale Analysis for Multivariate Data", Birkh\"auser-Springe

Maximal superintegrability of Benenti systems

For a class of Hamiltonian systems naturally arising in the modern theory of separation of variables, we establish their maximal superintegrability by explicitly constructing the additional integrals of motion.Comment: 5 pages, LaTeX 2e, to appear in J. Phys. A: Math. Ge

The level set method for the two-sided eigenproblem

We consider the max-plus analogue of the eigenproblem for matrix pencils Ax=lambda Bx. We show that the spectrum of (A,B) (i.e., the set of possible values of lambda), which is a finite union of intervals, can be computed in pseudo-polynomial number of operations, by a (pseudo-polynomial) number of calls to an oracle that computes the value of a mean payoff game. The proof relies on the introduction of a spectral function, which we interpret in terms of the least Chebyshev distance between Ax and lambda Bx. The spectrum is obtained as the zero level set of this function.Comment: 34 pages, 4 figures. Changes with respect to the previous version: we explain relation to mean-payoff games and discrete event systems, and show that the reconstruction of spectrum is pseudopolynomia