Pyramidal neurones in macaque visual cortex: Interareal phenotypic variation of dendritic branching patterns

The basal dendritic arbors of over 500-layer III pyramidal neurones of the macaque cortex were compared by fractal analyses, which provides a measure of the space filling (or branching pattern) of dendritic arbors. Fractal values (D) of individual cells were compared between the cytochrome oxidase (CO)-rich blobs and CO-poor interblobs, of middle and upper layer III, and between sublaminae, in the primary visual area (Vi). These data were compared with those in the CO compartments in the second visual area (V2), and seven other extrastriate cortical areas. (V4, MT, LIP, 7a, TEO, TE and STP). There were significant differences in the fractal dimensions, and therefore the dendritic branching patterns, of cells in striate and extrastriate areas. Of the 55 possible pairwise comparisons of fractal dimension of neurones in different cortical areas (or CO compartments), 39 proved to be significantly different. The markedly different morphologies of pyramidal cells in the different cortical areas may be one of the features that determine the functional signatures of these cells by influencing the number of inputs received by, and propagation of potentials through, their dendritic arbors.

Fitting a mixture model to three-mode three-way data with missing information

When the data consist of certain attributes measured on the same set of items in different situations, they would be described as a three-mode three-way array. A mixture likelihood approach can be implemented to cluster the items (i.e., one of the modes) on the basis of both of the other modes simultaneously (i.e,, the attributes measured in different situations). In this paper, it is shown that this approach can be extended to handle three-mode three-way arrays where some of the data values are missing at random in the sense of Little and Rubin (1987). The methodology is illustrated by clustering the genotypes in a three-way soybean data set where various attributes were measured on genotypes grown in several environments.

Optimal patch-leaving behaviour: a case study using the parasitoid Cotesia rubecular

1. Parasitoids are predicted to spend longer in patches with more hosts, but previous work on Cotesia rubecula (Marshall) has not upheld this prediction, Tests of theoretical predictions may be affected by the definition of patch leaving behaviour, which is often ambiguous. 2. In this study whole plants were considered as patches and assumed that wasps move within patches by means of walking or flying. Within-patch and between-patch flights were distinguished based on flight distance. The quality of this classification was tested statistically by examination of log-survivor curves of flight times. 3. Wasps remained longer in patches with higher host densities, which is consistent with predictions of the marginal value theorem (Charnov 1976). tinder the assumption that each flight indicates a patch departure, there is no relationship between host density and leaving tendency. 4. Oviposition influences the patch leaving behaviour of wasps in a count down fashion (Driessen et al. 1995), as predicted by an optimal foraging model (Tenhumberg, Keller & Possingham 2001). 5. Wasps spend significantly longer in the first patch encountered following release, resulting in an increased rate of superparasitism.

Using clusters of computers for large QU-GENE simulation experiments

The QU-GENE Computing Cluster (QCC) is a hardware and software solution to the automation and speedup of large QU-GENE (QUantitative GENEtics) simulation experiments that are designed to examine the properties of genetic models, particularly those that involve factorial combinations of treatment levels. QCC automates the management of the distribution of components of the simulation experiments among the networked single-processor computers to achieve the speedup.

Stochastic Schrodinger equation approach to quantum noise in resonant tunneling current

We apply the quantum trajectory method to current noise in resonant tunneling devices. The results from dynamical simulation are compared with those from unconditional master equation approach. We show that the stochastic Schrodinger equation approach is useful in modeling the dynamical processes in mesoscopic electronic systems.

A bacterial artificial chromosome library of Lotus japonicus constructed in an Agrobacterium tumefaciens-transformable vector

We constructed a BAC library of the model legume Lotus japonicus with a 6-to 7-fold genome coverage. We used vector PCLD04541, which allows direct plant transformation by BACs. The average insert size is 94 kb. Clones were stable in Escherichia coli and Agrobacterium tumefaciens.

Certain cyclically presented groups are infinite

We prove that the groups in two infinite families considered by Johnson, Kim and O'Brien are almost all infinite.

On a theorem of Cooper

In this paper we study some purely mathematical considerations that arise in a paper of Cooper on the foundations of thermodynamics that was published in this journal. Connections with mathematical utility theory are studied and some errors in Cooper's paper are rectified. (C) 2001 Academic Press.

Brief note on the variation of constants formula for fuzzy differential equations

This note gives a theory of state transition matrices for linear systems of fuzzy differential equations. This is used to give a fuzzy version of the classical variation of constants formula. A simple example of a time-independent control system is used to illustrate the methods. While similar problems to the crisp case arise for time-dependent systems, in time-independent cases the calculations are elementary solutions of eigenvalue-eigenvector problems. In particular, for nonnegative or nonpositive matrices, the problems at each level set, can easily be solved in MATLAB to give the level sets of the fuzzy solution. (C) 2002 Elsevier Science B.V. All rights reserved.

Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

Mathematical methods for spatially cohesive reserve design

The problem of designing spatially cohesive nature reserve systems that meet biodiversity objectives is formulated as a nonlinear integer programming problem. The multiobjective function minimises a combination of boundary length, area and failed representation of the biological attributes we are trying to conserve. The task is to reserve a subset of sites that best meet this objective. We use data on the distribution of habitats in the Northern Territory, Australia, to show how simulated annealing and a greedy heuristic algorithm can be used to generate good solutions to such large reserve design problems, and to compare the effectiveness of these methods.

Patchy populations in stochastic environments: Critical number of patches for persistence

We introduce a model for the dynamics of a patchy population in a stochastic environment and derive a criterion for its persistence. This criterion is based on the geometric mean (GM) through time of the spatial-arithmetic mean of growth rates. For the population to persist, the GM has to be greater than or equal to1. The GM increases with the number of patches (because the sampling error is reduced) and decreases with both the variance and the spatial covariance of growth rates. We derive analytical expressions for the minimum number of patches (and the maximum harvesting rate) required for the persistence of the population. As the magnitude of environmental fluctuations increases, the number of patches required for persistence increases, and the fraction of individuals that can be harvested decreases. The novelty of our approach is that we focus on Malthusian local population dynamics with high dispersal and strong environmental variability from year to year. Unlike previous models of patchy populations that assume an infinite number of patches, we focus specifically on the effect that the number of patches has on population persistence. Our work is therefore directly relevant to patchily distributed organisms that are restricted to a small number of habitat patches.

Riddling and invariance for discontinuous maps preserving Lebesgue measure

In this paper we use the mixture of topological and measure-theoretic dynamical approaches to consider riddling of invariant sets for some discontinuous maps of compact regions of the plane that preserve two-dimensional Lebesgue measure. We consider maps that are piecewise continuous and with invertible except on a closed zero measure set. We show that riddling is an invariant property that can be used to characterize invariant sets, and prove results that give a non-trivial decomposion of what we call partially riddled invariant sets into smaller invariant sets. For a particular example, a piecewise isometry that arises in signal processing (the overflow oscillation map), we present evidence that the closure of the set of trajectories that accumulate on the discontinuity is fully riddled. This supports a conjecture that there are typically an infinite number of periodic orbits for this system.

Set-valued Markov chains and negative semitrajectories of discretized dynamical systems

Computer simulation of dynamical systems involves a phase space which is the finite set of machine arithmetic. Rounding state values of the continuous system to this grid yields a spatially discrete dynamical system, often with different dynamical behaviour. Discretization of an invertible smooth system gives a system with set-valued negative semitrajectories. As the grid is refined, asymptotic behaviour of the semitrajectories follows probabilistic laws which correspond to a set-valued Markov chain, whose transition probabilities can be explicitly calculated. The results are illustrated for two-dimensional dynamical systems obtained by discretization of fractional linear transformations of the unit disc in the complex plane.