Random perturbations of stochastic processes with unbounded variable length memory

We consider binary infinite order stochastic chains perturbed by a random noise. This means that at each time step, the value assumed by the chain can be randomly and independently flipped with a small fixed probability. We show that the transition probabilities of the perturbed chain are uniformly close to the corresponding transition probabilities of the original chain. As a consequence, in the case of stochastic chains with unbounded but otherwise finite variable length memory, we show that it is possible to recover the context tree of the original chain, using a suitable version of the algorithm Context, provided that the noise is small enough.

Synapsing variable-length crossover: Meaningful crossover for variable-length genomes

The synapsing variable-length crossover (SVLC algorithm provides a biologically inspired method for performing meaningful crossover between variable-length genomes. In addition to providing a rationale for variable-length crossover, it also provides a genotypic similarity metric for variable-length genomes, enabling standard niche formation techniques to be used with variable-length genomes. Unlike other variable-length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC algorithm recurrently "glues" or synapses homogenous genetic subsequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable-length test problem, the SVLC algorithm compares favorably with current variable-length crossover techniques. The variable-length approach is further advocated by demonstrating how a variable-length genetic algorithm (GA) can obtain a high fitness solution in fewer iterations than a traditional fixed-length GA in a two-dimensional vector approximation task.

Chains of Infinite Order, Chains with Memory of Variable Length, and Maps of the Interval

We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order. In particular we characterize the maps corresponding to stochastic chains with memory of variable length. The problem treated here is the converse of the classical construction of the Gibbs formalism for Markov expanding maps of the interval.

EXISTENCE RESULTS FOR NEUTRAL INTEGRO-DIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY

In this paper we discuss the existence of mild, strict and classical solutions for a class of abstract integro-differential equations in Banach spaces. Some applications to ordinary and partial integro-differential equations are considered.

Existence Results for Abstract Partial Neutral Integro-differential Equation with Unbounded Delay

In this paper we study the existence and regularity of mild solutions for a class of abstract partial neutral integro-differential equations with unbounded delay.

Skewed Distribution of Circulating Activated Natural Killer T (NKT) Cells in Patients with Common Variable Immunodeficiency Disorders (CVID)

Common variable immunodeficiency disorder (CVID) is the commonest cause of primary antibody failure in adults and children, and characterized clinically by recurrent bacterial infections and autoimmune manifestations. Several innate immune defects have been described in CVID, but no study has yet investigated the frequency, phenotype or function of the key regulatory cell population, natural killer T (NKT) cells. We measured the frequencies and subsets of NKT cells in patients with CVID and compared these to healthy controls. Our results show a skewing of NKT cell subsets, with CD4+ NKT cells at higher frequencies, and CD8+ NKT cells at lower frequencies. However, these cells were highly activated and expression CD161. The NKT cells had a higher expression of CCR5 and concomitantly expression of CCR5+CD69+CXCR6 suggesting a compensation of the remaining population of NKT cells for rapid effector action.

Synapsing variable length crossover: Biologically inspired crossover for variable length genomes

Biological Crossover occurs during the early stages of meiosis. During this process the chromosomes undergoing crossover are synapsed together at a number of homogenous sequence sections, it is within such synapsed sections that crossover occurs. The SVLC (Synapsing Variable Length Crossover) Algorithm recurrently synapses homogenous genetic sequences together in order of length. The genomes are considered to be flexible with crossover only being permitted within the synapsed sections. Consequently, common sequences are automatically preserved with only the genetic differences being exchanged, independent of the length of such differences. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be utilised. In a simple variable length test problem the SVLC algorithm outperforms current variable length crossover techniques.

Synapsing variable length crossover: An algorithm for crossing and comparing variable length genomes

The Synapsing Variable Length Crossover (SVLC) algorithm provides a biologically inspired method for performing meaningful crossover between variable length genomes. In addition to providing a rationale for variable length crossover it also provides a genotypic similarity metric for variable length genomes enabling standard niche formation techniques to be used with variable length genomes. Unlike other variable length crossover techniques which consider genomes to be rigid inflexible arrays and where some or all of the crossover points are randomly selected, the SVLC algorithm considers genomes to be flexible and chooses non-random crossover points based on the common parental sequence similarity. The SVLC Algorithm recurrently "glues" or synapses homogenous genetic sub-sequences together. This is done in such a way that common parental sequences are automatically preserved in the offspring with only the genetic differences being exchanged or removed, independent of the length of such differences. In a variable length test problem the SVLC algorithm is shown to outperform current variable length crossover techniques. The SVLC algorithm is also shown to work in a more realistic robot neural network controller evolution application.

Ground-state functional for quantum spin chains with bond defects

We have developed a nonlocal functional of the exchange interaction for the ground-state energy of quantum spin chains described by the Heisenberg Hamiltonian. An alternating chain is used to obtain the correlation energy and a local unit-cell approximation is defined in the context of the density-functional theory. The agreement with our exact numerical data, for small chains, is significantly better than a previous formulation, even for chains with several ferromagnetic or antiferromagnetic bond defects. The results can be particularly relevant in the study of finite spin-1/2 Heisenberg chains, with exchange couplings changing, magnitude, or even sign, from bond-to-bond.

Quasistationarity of continuous-time Markov chains with positive drift

We shall study continuous-time Markov chains on the nonnegative integers which are both irreducible and transient, and which exhibit discernible stationarity before drift to infinity sets in. We will show how this 'quasi' stationary behaviour can be modelled using a limiting conditional distribution: specifically, the limiting state probabilities conditional on not having left 0 for the last time. By way of a dual chain, obtained by killing the original process on last exit from 0, we invoke the theory of quasistationarity for absorbing Markov chains. We prove that the conditioned state probabilities of the original chain are equal to the state probabilities of its dual conditioned on non-absorption, thus allowing us to establish the simultaneous existence and then equivalence, of their limiting conditional distributions. Although a limiting conditional distribution for the dual chain is always a quasistationary distribution in the usual sense, a similar statement is not possible for the original chain.

On the construction of integrable closed chains with quantum supersymmetry

We present a general prescription for the construction of integrable one-dimensional systems with closed boundary conditions and quantum supersymmetry.

Allergic asthma in patients with common variable immunodeficiency

P>Background: Many patients with common variable immunodeficiency (CVID) have a clinical history suggestive of allergic respiratory disease. However, in such individuals, the prevalence of asthma and the role of atopy have not been well established. The objective of this study was to evaluate pulmonary function and identify asthma in patients with CVID. We also investigated the role of IgE as a trigger of asthma in these patients. Methods: Sixty-two patients diagnosed with CVID underwent spirometry, as well as skin prick testing and in vitro determination of serum-specific IgE levels for aeroallergens, together with bronchial provocation with histamine and allergen. Results: The most common alteration identified through spirometry was obstructive lung disease, which was observed in 29 (47.5%) of the 62 patients evaluated. Eighteen (29.0%) of the 62 patients had a clinical history suggestive of allergic asthma. By the end of the study, asthma had been diagnosed in nine (14.5%) patients and atopy had been identified in six (9.7%). In addition, allergic asthma had been diagnosed in four patients (6.5% of the sample as a whole; 22.2% of the 18 patients with a clinical history suggestive of the diagnosis). Conclusion: In this study, CVID patients testing negative for specific IgE antibodies and suspected of having allergic asthma presented a positive response to bronchial provocation tests with allergens. To our knowledge, this is the first such study. When CVID patients with a history suggestive of allergic asthma test negative on traditional tests, additional tests designed to identify allergic asthma might be conducted.

On the Oberwolfach problem with two similar length cycles

For all in greater than or equal to 3, the Oberwolfach problem is solved for the case where the 2-factors consist of two cycles of lengths in and m + 1, and for the case where the 2-factors consist of two cycles of lengths m and m + 2.