On the cardinality and complexity of the set of codings for self-similar sets with positive Lebesgue measure

Let λ1,…,λn be real numbers in (0,1) and p1,…,pn be points in Rd. Consider the collection of maps fj:Rd→Rd given by fj(x)=λjx+(1−λj)pj. It is a well known result that there exists a unique nonempty compact set Λ⊂Rd satisfying Λ=∪nj=1fj(Λ). Each x∈Λ has at least one coding, that is a sequence (ϵi)∞i=1 ∈{1,…,n}N that satisfies limN→∞fϵ1…fϵN(0)=x. We study the size and complexity of the set of codings of a generic x∈Λ when Λ has positive Lebesgue measure. In particular, we show that under certain natural conditions almost every x∈Λ has a continuum of codings. We also show that almost every x∈Λ has a universal coding. Our work makes no assumptions on the existence of holes in Λ and improves upon existing results when it is assumed Λ contains no holes.

Preparation of consistent soil data sets for modelling purposes: Secondary SOTER data for four case study areas

The common GIS-based approach to regional analyses of soil organic carbon (SOC) stocks and changes is to define geographic layers for which unique sets of driving variables are derived, which include land use, climate, and soils. These GIS layers, with their associated attribute data, can then be fed into a range of empirical and dynamic models. Common methodologies for collating and formatting regional data sets on land use, climate, and soils were adopted for the project Assessment of Soil Organic Carbon Stocks and Changes at National Scale (GEFSOC). This permitted the development of a uniform protocol for handling the various input for the dynamic GEFSOC Modelling System. Consistent soil data sets for Amazon-Brazil, the Indo-Gangetic Plains (IGP) of India, Jordan and Kenya, the case study areas considered in the GEFSOC project, were prepared using methodologies developed for the World Soils and Terrain Database (SOTER). The approach involved three main stages: (1) compiling new soil geographic and attribute data in SOTER format; (2) using expert estimates and common sense to fill selected gaps in the measured or primary data; (3) using a scheme of taxonomy-based pedotransfer rules and expert-rules to derive soil parameter estimates for similar soil units with missing soil analytical data. The most appropriate approach varied from country to country, depending largely on the overall accessibility and quality of the primary soil data available in the case study areas. The secondary SOTER data sets discussed here are appropriate for a wide range of environmental applications at national scale. These include agro-ecological zoning, land evaluation, modelling of soil C stocks and changes, and studies of soil vulnerability to pollution. Estimates of national-scale stocks of SOC, calculated using SOTER methods, are presented as a first example of database application. Independent estimates of SOC stocks are needed to evaluate the outcome of the GEFSOC Modelling System for current conditions of land use and climate. (C) 2007 Elsevier B.V. All rights reserved.

Copper(II) complexes of tetradentate N2S2 donor sets: synthesis, crystal structure characterization and reactivity

Two mononuclear and one dinuclear copper(II) complexes, containing neutral tetradentate NSSN type ligands, of formulation [Cu-II(L-1)Cl]ClO4 (1), [Cu-II(L-2)Cl]ClO4 (2) and [Cu-2(II)(L-3)(2)Cl-2](ClO4)(2) (3) were synthesized and isolated in pure form [where L-1 = 1,2-bis(2-pyridylmethylthio)ethane, L-2 = 1,3-bis(2-pyridylmethylthio)propane and L-3 = 1,4-bis(2-pyridylmethylthio)butane]. All these green colored copper(II) complexes were characterized by physicochemical and spectroscopic methods. The dinuclear copper(II) complex 3 changed to a colorless dinuclear copper(I) species of formula [Cu-2(1)(L-3)(2)](ClO4)(2),0.5H(2)O (4) in dimethylformamide even in the presence of air at ambient temperature, while complexes I and 2 showed no change under similar conditions. The solid-state structures of complexes 1, 2 and 4 were established by X-ray crystallography. The geometry about the copper in complexes 1 and 2 is trigonal bipyramidal whereas the coordination environment about the copper(I) in dinuclear complex 4 is distorted tetrahedral. (C) 2008 Elsevier Ltd. All rights reserved.

Complex formation of bovine serum albumin with a poly(ethylene glycol) lipid conjugate

In this work, we report the formation of complexes by self-assembly of bovine serum albumin (BSA) with a poly(ethylene glycol) lipid conjugate (PEG(2000)-PE) in phosphate saline buffer solution (pH 7.4). Three different sets of samples have been studied. The BSA concentration remained fixed (1, 0.01, or 0.001 wt % BSA) within each set of samples, while the PEG(2000)-PE concentration was varied. Dynamic light scattering (DLS), rheology, and small-angle X-ray scattering (SAXS) were used to study samples with 1 wt % BSA. DLS showed that BSA/PEG(2000)-PE aggregates have a size intermediate between a BSA monomer and a PEG(2000)-PE micelle. Rheology suggested that BSA/PEG(2000)-PE complexes might be surrounded by a relatively compact PEG-lipid shell, while SAXS results showed that depletion forces do not take an important role in the stabilization of the complexes. Samples containing 0.01 wt % BSA were studied by circular dichroism (CD) and ultraviolet fluorescence spectroscopy (UV). UV results showed that at low concentrations of PEG-lipid, PEG(2000)-PE binds to tryptophan (Trp) groups in BSA, while at high concentrations of PEG-lipid the Trp groups are exposed to water. CD results showed that changes in Trp environment take place with a minimal variation of the BSA secondary structure elements. Finally, samples containing 0.001 wt % BSA were studied by zeta-potential experiments. Results showed that steric interactions might play an important role in the stabilization of the BSA/PEG(2000)-PE complexes.

A kernel-based two-class classifier for imbalanced data sets

Many kernel classifier construction algorithms adopt classification accuracy as performance metrics in model evaluation. Moreover, equal weighting is often applied to each data sample in parameter estimation. These modeling practices often become problematic if the data sets are imbalanced. We present a kernel classifier construction algorithm using orthogonal forward selection (OFS) in order to optimize the model generalization for imbalanced two-class data sets. This kernel classifier identification algorithm is based on a new regularized orthogonal weighted least squares (ROWLS) estimator and the model selection criterion of maximal leave-one-out area under curve (LOO-AUC) of the receiver operating characteristics (ROCs). It is shown that, owing to the orthogonalization procedure, the LOO-AUC can be calculated via an analytic formula based on the new regularized orthogonal weighted least squares parameter estimator, without actually splitting the estimation data set. The proposed algorithm can achieve minimal computational expense via a set of forward recursive updating formula in searching model terms with maximal incremental LOO-AUC value. Numerical examples are used to demonstrate the efficacy of the algorithm.

Compact cosmic ray detector for unattended atmospheric ionisation monitoring

Two vertical cosmic ray telescopes for atmospheric cosmic ray ionization event detection are compared. Counter A, designed for low power remote use, was deployed in the Welsh mountains; its event rate increased with altitude as expected from atmospheric cosmic ray absorption. Independently, Counter B’s event rate was found to vary with incoming particle acceptance angle. Simultaneous colocated comparison of both telescopes exposed to atmospheric ionization showed a linear relationship between their event rates.

Computer generation and quantitative morphometric analysis of virtual neurons

An important goal in computational neuroanatomy is the complete and accurate simulation of neuronal morphology. We are developing computational tools to model three-dimensional dendritic structures based on sets of stochastic rules. This paper reports an extensive, quantitative anatomical characterization of simulated motoneurons and Purkinje cells. We used several local and global algorithms implemented in the L-Neuron and ArborVitae programs to generate sets of virtual neurons. Parameters statistics for all algorithms were measured from experimental data, thus providing a compact and consistent description of these morphological classes. We compared the emergent anatomical features of each group of virtual neurons with those of the experimental database in order to gain insights on the plausibility of the model assumptions, potential improvements to the algorithms, and non-trivial relations among morphological parameters. Algorithms mainly based on local constraints (e.g., branch diameter) were successful in reproducing many morphological properties of both motoneurons and Purkinje cells (e.g. total length, asymmetry, number of bifurcations). The addition of global constraints (e.g., trophic factors) improved the angle-dependent emergent characteristics (average Euclidean distance from the soma to the dendritic terminations, dendritic spread). Virtual neurons systematically displayed greater anatomical variability than real cells, suggesting the need for additional constraints in the models. For several emergent anatomical properties, a specific algorithm reproduced the experimental statistics better than the others did. However, relative performances were often reversed for different anatomical properties and/or morphological classes. Thus, combining the strengths of alternative generative models could lead to comprehensive algorithms for the complete and accurate simulation of dendritic morphology.

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.