D-subgenome bias of Xcm resistance genes in tetraploid Gossypium (cotton) suggests that polyploid formation has created novel avenues for evolution

A detailed RFLP map was used to determine the chromosomal locations and subgenomic distributions of cotton (Gossypium) genes/QTLs that confer resistance to the bacterial blight pathogen, Xanthomonas campestris pv. malvacearum (Xcm). Genetic mapping generally corroborated classic predictions regarding the number and dosage effects of genes conferring Xcm resistance. One recessive allele (b6) was a noteworthy exception to the genetic dominance of most plant resistance alleles. This recessive allele appeared to uncover additional QTLs from both resistant and ostensibly susceptible genotypes, some of which corresponded in location to resistance (R)-genes effective against other Xcm races. One putatively "defeated" resistance allele (B3) reduced severity of Xcm damage by "virulent" races. Among the six resistance genes derived from tetraploid cottons, five (83%) mapped to D-subgenome chromosomes-if each subgenome were equally likely to evolve new R-gene alleles, this level of bias would occur in only about 1.6% of cases. Possible explanations of this bias include biogeographic factors, differences in evolutionary rates between subgenomes, gene conversion or other intergenomic exchanges that escaped detection by genetic mapping, or other factors. A significant D-subgenome bias of Xcm resistance genes may suggest that polyploid formation has offered novel avenues for phenotypic response to selection.     

The simple genetic algorithm and the Walsh transform: Part I, Theory

This paper is the first part of a two-part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary representation, the Walsh transform is the Fourier transform). The results are of a theoretical nature and are based on the analysis of mutation and crossover. The Fourier transform of the mixing matrix is shown to be sparse. An explicit formula is given for the spectrum of the differential of the mixing transformation. By using the Fourier representation and the fast Fourier transform, one generation of the infinite population simple genetic algorithm can be computed in time O(cllog2(3)), where c is arity of the alphabet and l is the string length. This is in contrast to the time of O(c3l) for the algorithm as represented in the standard basis. There are two orthogonal decompositions of population space that are invariant under mixing. The sequel to this paper will apply the basic theoretical results obtained here to inverse problems and asymptotic behavior.     

The simple genetic algorithm and the Walsh transform: Part II, The inverse

This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially "triangularized" when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.     

Temperature distributions in laser-heated semi-infinite and finite-thickness media with convective surface losses

The temperature distributions produced within semi-infinite and finite-thickness media heated by a moving laser beam with a Gaussian power-density profile are examined by use of a time-domain method. Convective losses, described by Newton's law of cooling, from the medium surfaces are included. Various medium absorption models are considered. The solutions are given as single integrals with respect to time of simple functions. The resulting expressions have been used to examine the role of surface losses in information storage and medical applications. The role of convective losses in optical recording systems is found to be insignificant. However, for medical applications, combined convective and evaporative surface losses represent an important surface-heat-loss mechanism.     

Laparoscopic versus open appendectomy

BACKGROUND: Clinical manifestations and course of sickle-cell anemia are variable. Knowledge about the factors, possibly geographic, that influence prognosis are still scanty. POPULATION AND METHODS: Data of hospitalization and management of children with sickle-cell disease were studied during two years (1992-1993) in the Pediatric Unit of Libreville Hospital. They concerned 205 admissions of 171 children and 131 outpatients. RESULTS: The main causes of hospitalization were: acute anemia (36 cases before the age of 5 years); painful crisis whose frequency increased with age (23% before 5 years, 35% between 5 and 10, 42% after 10 years); infections, essentially pulmonary occurring early, and bone infections at any age. Eight children died (because a complication of their disease). Among the 131 outpatients, half were detected because pyrexia, anemia and/or more often "hand-foot syndrome". More than 60% had hepatomegaly, one third still had splenomegaly after five years of age and more than one third was icteric. More than half children older than ten years had growth disorders. Mean hemoglobin level was 7 g/dL. 21 of the 83 tested children for HBsAg were positive and only one out of 79 was positive for HIV. CONCLUSIONS: Clinical manifestations and course of sickle-cell anemia in our patients are similar to those reported in Congolese children. Genetic and environmental factors may be responsible for differences with children from other, in particular French, cohorts.     

Enabledness and termination in refinement algebra

Refinement algebras are abstract algebras for reasoning about programs in a total correctness framework. We extend a reduct of von Wright’s demonic refinement algebra with two operators for modelling enabledness and termination of programs. We show how the operators can be used for expressing relations between programs and apply the algebra to reasoning about action systems.     

One-sided multiple comparisons for treatment means with a control mean

We study comparisons of several treatments with a common control when it is believed a priori that the treatment means, μ_i, are at least as large as the control mean, μ₀. In this setting, which is called a tree ordering, we study multiple comparisons that determine whether μ_i>μ₀ or μ_i=μ₀ for each treatment. The classical procedure by Dunnett (1955) and the step-down and step-up techniques by [Dunnett and Tamhane, 1991] and [Dunnett and Tamhane, 1992] are well known. The results in Marcus and Talpaz (1992) provide multiple comparisons based on the maximum likelihood estimates restricted by the tree ordering. We also study two-stage procedures that consist of the likelihood ratio test of homogeneity with the alternative constrained by the tree ordering followed by two-sample t comparisons with possibly different critical values for the two-sample comparisons. Marcus et al. (1976) discuss the use of closed tests in such situations and propose using a closed version of the restricted likelihood ratio test. We describe step-down versions of the Marcus-Talpaz, the two-stage, and the likelihood ratio procedures, as well as a closed version of the Marcus-Talpaz multiple comparison procedure. Using Monte Carlo techniques, we study the familywise errors and powers of these procedures and make some recommendations concerning techniques that perform well for all tree ordered mean vectors.     

Assessing the Impact of Security Education Initiatives on Critical Infrastructure Protection

The need to protect US critical infrastructures has been the primary motivation behind two of the US Federal Government’s security education initiatives: the National Security Agency’s Centers of Academic Excellence in Information Assurance Education (CAE/IAE) programme, and the National Science Foundation’s Federal Cyber Service: Scholarship for Service (SFS) programme. This article assesses the strength of these education programmes with respect to improving the level of critical infrastructure security.     

The experience of enchantment in human–computer interaction

Improving user experience is becoming something of a rallying call in human–computer interaction but experience is not a unitary thing. There are varieties of experiences, good and bad, and we need to characterise these varieties if we are to improve user experience. In this paper we argue that enchantment is a useful concept to facilitate closer relationships between people and technology. But enchantment is a complex concept in need of some clarification. So we explore how enchantment has been used in the discussions of technology and examine experiences of film and cell phones to see how enchantment with technology is possible. Based on these cases, we identify the sensibilities that help designers design for enchantment, including the specific sensuousness of a thing, senses of play, paradox and openness, and the potential for transformation. We use these to analyse digital jewellery in order to suggest how it can be made more enchanting. We conclude by relating enchantment to varieties of experience.An earlier version of this paper was presented at Chi’2004 Fringe.     

The ultrastructural characteristics of the changes in the rat liver in the dynamics of experimental endotoxemia

Electron microscopic study was performed in the experiments on the rat liver while intravenously administering E. coli endotoxin. The dynamics of ultrastructural disorders during endotoxemia has been established and the role of "Kupffer cell-hepatocyte" microsystem in the liver detoxification function is shown.