Quelques théorèmes ergodiques pour des suites de fonctions

Le théorème ergodique de Birkhoff nous renseigne sur la convergence de suites de fonctions. Nous nous intéressons alors à étudier la convergence en moyenne et presque partout de ces suites, mais dans le cas où la suite est une suite strictement croissante de nombres entiers positifs. C’est alors que nous définirons les suites uniformes et étudierons la convergence presque partout pour ces suites. Nous regarderons également s’il existe certaines suites pour lesquelles la convergence n’a pas lieu. Nous présenterons alors un résultat dû en partie à Alexandra Bellow qui dit que de telles suites existent. Finalement, nous démontrerons une équivalence entre la notion de transformatiuon fortement mélangeante et la convergence d'une certaine suite qui utilise des “poids” qui satisfont certaines propriétés.

Examining random number generators used in stochastic iteration algorithms

This paper investigates random number generators in stochastic iteration algorithms that require infinite uniform sequences. We take a simple model of the general transport equation and solve it with the application of a linear congruential generator, the Mersenne twister, the mother-of-all generators, and a true random number generator based on quantum effects. With this simple model we show that for reasonably contractive operators the theoretically not infinite-uniform sequences perform also well. Finally, we demonstrate the power of stochastic iteration for the solution of the light transport problem.

Analysis of nonlinear sequences and streamciphers

Streamciphers are common cryptographic algorithms used to protect the confidentiality of frame-based communications like mobile phone conversations and Internet traffic. Streamciphers are ideal cryptographic algorithms to encrypt these types of traffic as they have the potential to encrypt them quickly and securely, and have low error propagation. The main objective of this thesis is to determine whether structural features of keystream generators affect the security provided by stream ciphers.These structural features pertain to the state-update and output functions used in keystream generators. Using linear sequences as keystream to encrypt messages is known to be insecure. Modern keystream generators use nonlinear sequences as keystream.The nonlinearity can be introduced through a keystream generator's state-update function, output function, or both. The first contribution of this thesis relates to nonlinear sequences produced by the well-known Trivium stream cipher. Trivium is one of the stream ciphers selected in a final portfolio resulting from a multi-year project in Europe called the ecrypt project. Trivium's structural simplicity makes it a popular cipher to cryptanalyse, but to date, there are no attacks in the public literature which are faster than exhaustive keysearch. Algebraic analyses are performed on the Trivium stream cipher, which uses a nonlinear state-update and linear output function to produce keystream. Two algebraic investigations are performed: an examination of the sliding property in the initialisation process and algebraic analyses of Trivium-like streamciphers using a combination of the algebraic techniques previously applied separately by Berbain et al. and Raddum. For certain iterations of Trivium's state-update function, we examine the sets of slid pairs, looking particularly to form chains of slid pairs. No chains exist for a small number of iterations.This has implications for the period of keystreams produced by Trivium. Secondly, using our combination of the methods of Berbain et al. and Raddum, we analysed Trivium-like ciphers and improved on previous on previous analysis with regards to forming systems of equations on these ciphers. Using these new systems of equations, we were able to successfully recover the initial state of Bivium-A.The attack complexity for Bivium-B and Trivium were, however, worse than exhaustive keysearch. We also show that the selection of stages which are used as input to the output function and the size of registers which are used in the construction of the system of equations affect the success of the attack. The second contribution of this thesis is the examination of state convergence. State convergence is an undesirable characteristic in keystream generators for stream ciphers, as it implies that the effective session key size of the stream cipher is smaller than the designers intended. We identify methods which can be used to detect state convergence. As a case study, theMixer streamcipher, which uses nonlinear state-update and output functions to produce keystream, is analysed. Mixer is found to suffer from state convergence as the state-update function used in its initialisation process is not one-to-one. A discussion of several other streamciphers which are known to suffer from state convergence is given. From our analysis of these stream ciphers, three mechanisms which can cause state convergence are identified.The effect state convergence can have on stream cipher cryptanalysis is examined. We show that state convergence can have a positive effect if the goal of the attacker is to recover the initial state of the keystream generator. The third contribution of this thesis is the examination of the distributions of bit patterns in the sequences produced by nonlinear filter generators (NLFGs) and linearly filtered nonlinear feedback shift registers. We show that the selection of stages used as input to a keystream generator's output function can affect the distribution of bit patterns in sequences produced by these keystreamgenerators, and that the effect differs for nonlinear filter generators and linearly filtered nonlinear feedback shift registers. In the case of NLFGs, the keystream sequences produced when the output functions take inputs from consecutive register stages are less uniform than sequences produced by NLFGs whose output functions take inputs from unevenly spaced register stages. The opposite is true for keystream sequences produced by linearly filtered nonlinear feedback shift registers.

Tentative study of the coding sequences without 3-base periodicity

Fourier spectra of 120 short coding sequences (<1 200 bp) show that not all coding sequences are characterized by 3-base periodicity. Statistical analysis suggests that whether a coding sequence has 3-base periodicity may be related to the composition and distribution of bases, the usage and the order of the amino acids of the encoded protein as well as the synonymous codon usage. Generally, the content of A+U is higher than that of G+C in non-period-3 sequences, inversely in period-3 sequences. In the three codon positions, the base distribution in the non-periodic-3 sequences is more uniform than in the periodic-3 sequences. The usage biases of the amino acids and the codons in non-period-3 sequences are weaker than that in period-3 sequences. All of these phenomena should be considered sufficiently in predicting the genes and exons of DNA sequences by Fourier analysis method.

Development of Hierarchical Clustering Techniques for Gridded Data from Mixed Data Sequences

Knowledge discovery in databases is the non-trivial process of identifying valid, novel potentially useful and ultimately understandable patterns from data. The term Data mining refers to the process which does the exploratory analysis on the data and builds some model on the data. To infer patterns from data, data mining involves different approaches like association rule mining, classification techniques or clustering techniques. Among the many data mining techniques, clustering plays a major role, since it helps to group the related data for assessing properties and drawing conclusions. Most of the clustering algorithms act on a dataset with uniform format, since the similarity or dissimilarity between the data points is a significant factor in finding out the clusters. If a dataset consists of mixed attributes, i.e. a combination of numerical and categorical variables, a preferred approach is to convert different formats into a uniform format. The research study explores the various techniques to convert the mixed data sets to a numerical equivalent, so as to make it equipped for applying the statistical and similar algorithms. The results of clustering mixed category data after conversion to numeric data type have been demonstrated using a crime data set. The thesis also proposes an extension to the well known algorithm for handling mixed data types, to deal with data sets having only categorical data. The proposed conversion has been validated on a data set corresponding to breast cancer. Moreover, another issue with the clustering process is the visualization of output. Different geometric techniques like scatter plot, or projection plots are available, but none of the techniques display the result projecting the whole database but rather demonstrate attribute-pair wise analysis

Tests of sunspot number sequences: 1. Using ionosonde data

More than 70 years ago it was recognised that ionospheric F2-layer critical frequencies [foF2] had a strong relationship to sunspot number. Using historic datasets from the Slough and Washington ionosondes, we evaluate the best statistical fits of foF2 to sunspot numbers (at each Universal Time [UT] separately) in order to search for drifts and abrupt changes in the fit residuals over Solar Cycles 17-21. This test is carried out for the original composite of the Wolf/Zürich/International sunspot number [R], the new “backbone” group sunspot number [RBB] and the proposed “corrected sunspot number” [RC]. Polynomial fits are made both with and without allowance for the white-light facular area, which has been reported as being associated with cycle-to-cycle changes in the sunspot number - foF2 relationship. Over the interval studied here, R, RBB, and RC largely differ in their allowance for the “Waldmeier discontinuity” around 1945 (the correction factor for which for R, RBB and RC is, respectively, zero, effectively over 20 %, and explicitly 11.6 %). It is shown that for Solar Cycles 18-21, all three sunspot data sequences perform well, but that the fit residuals are lowest and most uniform for RBB. We here use foF2 for those UTs for which R, RBB, and RC all give correlations exceeding 0.99 for intervals both before and after the Waldmeier discontinuity. The error introduced by the Waldmeier discontinuity causes R to underestimate the fitted values based on the foF2 data for 1932-1945 but RBB overestimates them by almost the same factor, implying that the correction for the Waldmeier discontinuity inherent in RBB is too large by a factor of two. Fit residuals are smallest and most uniform for RC and the ionospheric data support the optimum discontinuity multiplicative correction factor derived from the independent Royal Greenwich Observatory (RGO) sunspot group data for the same interval.

Kurzweil integral for Riesz space-valued functions: Uniform convergence theorem

Our objective here is to prove that the uniform convergence of a sequence of Kurzweil integrable functions implies the convergence of the sequence formed by its corresponding integrals.

Gene sequences of the lichen Cetraria aculeata

Lichens are symbioses between fungi (mycobionts) and photoautotrophic green algae or cyanobacteria (photobionts). Many lichens occupy large distributional ranges covering several climatic zones. So far, little is known about the large-scale phylogeography of lichen photobionts and their role in shaping the distributional ranges of lichens. We studied south polar, temperate and north polar populations of the widely distributed fruticose lichen Cetraria aculeata. Based on the DNA sequences from three loci for each symbiont, we compared the genetic structure of mycobionts and photobionts. Phylogenetic reconstructions and Bayesian clustering methods divided the mycobiont and photobiont data sets into three groups. An AMOVA shows that the genetic variance of the photobiont is best explained by differentiation between temperate and polar regions and that of the mycobiont by an interaction of climatic and geographical factors. By partialling out the relative contribution of climate, geography and codispersal, we found that the most relevant factors shaping the genetic structure of the photobiont are climate and a history of codispersal. Mycobionts in the temperate region are consistently associated with a specific photobiont lineage. We therefore conclude that a photobiont switch in the past enabled C. aculeata to colonize temperate as well as polar habitats. Rare photobiont switches may increase the geographical range and ecological niche of lichen mycobionts by associating them with locally adapted photobionts in climatically different regions and, together with isolation by distance, may lead to genetic isolation between populations and thus drive the evolution of lichens.

On the uniform approximation of Cauchy continuous functions

In the context of real-valued functions defined on metric spaces, it is known that the locally Lipschitz functions are uniformly dense in the continuous functions and that the Lipschitz in the small functions - the locally Lipschitz functions where both the local Lipschitz constant and the size of the neighborhood can be chosen independent of the point - are uniformly dense in the uniformly continuous functions. Between these two basic classes of continuous functions lies the class of Cauchy continuous functions, i.e., the functions that map Cauchy sequences in the domain to Cauchy sequences in the target space. Here, we exhibit an intermediate class of Cauchy continuous locally Lipschitz functions that is uniformly dense in the real-valued Cauchy continuous functions. In fact, our result is valid when our target space is an arbitrary Banach space.

On Averaging Null Sequences of Real-Valued Functions

If ξ is a countable ordinal and (fk) a sequence of real-valued functions we define the repeated averages of order ξ of (fk). By using a partition theorem of Nash-Williams for families of finite subsets of positive integers it is proved that if ξ is a countable ordinal then every sequence (fk) of real-valued functions has a subsequence (f'k) such that either every sequence of repeated averages of order ξ of (f'k) converges uniformly to zero or no sequence of repeated averages of order ξ of (f'k) converges uniformly to zero. By the aid of this result we obtain some results stronger than Mazur’s theorem.

(Table 1) Individual codes, haplotype codes, GenBank accession numbers for DNA sequences and sample locality of the analysed Betamorpha fusiformis specimens from the ANDEEP III expedition

Based on our current knowledge about population genetics, phylogeography and speciation, we begin to understand that the deep sea harbours more species than suggested in the past. Deep-sea soft-sediment environment in particular hosts a diverse and highly endemic invertebrate fauna. Very little is known about evolutionary processes that generate this remarkable species richness, the genetic variability and spatial distribution of deep-sea animals. In this study, phylogeographic patterns and the genetic variability among eight populations of the abundant and widespread deep-sea isopod morphospecies Betamorpha fusiformis [Barnard, K.H., 1920. Contributions to the crustacean fauna of South Africa. 6. Further additions to the list of marine isopods. Annals of the South African Museum 17, 319-438] were examined. A fragment of the mitochondrial 16S rRNA gene of 50 specimens and the complete nuclear 18S rRNA gene of 7 specimens were sequenced. The molecular data reveal high levels of genetic variability of both genes between populations, giving evidence for distinct monophyletic groups of haplotypes with average p-distances ranging from 0.0470 to 0.1440 (d-distances: 0.0592-0.2850) of the 16S rDNA, and 18S rDNA p-distances ranging between 0.0032 and 0.0174 (d-distances: 0.0033-0.0195). Intermediate values are absent. Our results show that widely distributed benthic deep-sea organisms of a homogeneous phenotype can be differentiated into genetically highly divergent populations. Sympatry of some genotypes indicates the existence of cryptic speciation. Flocks of closely related but genetically distinct species probably exist in other widespread benthic deep-sea asellotes and other Peracarida. Based on existing data we hypothesize that many widespread morphospecies are complexes of cryptic biological species (patchwork hypothesis).