Creation and Growth of Components in a Random Hypergraph Process

Denote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(b-1) - \ell$ vertices. We prove that the expected number of creations of $\ell$-component during a random hypergraph process tends to 1 as $\ell$ and $b$ tend to $\infty$ with the total number of vertices $n$ such that $\ell = o(\sqrt[3]{\frac{n}{b}})$. Under the same conditions, we also show that the expected number of vertices that ever belong to an $\ell$-component is approximately $12^{1/3} (b-1)^{1/3} \ell^{1/3} n^{2/3}$. As an immediate consequence, it follows that with high probability the largest $\ell$-component during the process is of size $O((b-1)^{1/3} \ell^{1/3} n^{2/3})$. Our results give insight about the size of giant components inside the phase transition of random hypergraphs.Comment: R\'{e}sum\'{e} \'{e}tend

A simple two-module problem to exemplify building-block assembly under crossover

Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa in other landscapes. Despite an extensive literature on the subject, and recent proofs of a principled distinction in the abilities of crossover and non-crossover algorithms for a particular theoretical landscape, building general intuitions about when and why crossover performs well when it does is a different matter. In particular, the proposal that crossover might enable the assembly of good building-blocks has been difficult to verify despite many attempts at idealized building-block landscapes. Here we show the first example of a two-module problem that shows a principled advantage for cross-over. This allows us to understand building-block assembly under crossover quite straightforwardly and build intuition about more general landscape classes favoring crossover or disfavoring it

Kernel density classification and boosting: an L2 sub analysis

Kernel density estimation is a commonly used approach to classification. However, most of the theoretical results for kernel methods apply to estimation per se and not necessarily to classification. In this paper we show that when estimating the difference between two densities, the optimal smoothing parameters are increasing functions of the sample size of the complementary group, and we provide a small simluation study which examines the relative performance of kernel density methods when the final goal is classification. A relative newcomer to the classification portfolio is “boosting”, and this paper proposes an algorithm for boosting kernel density classifiers. We note that boosting is closely linked to a previously proposed method of bias reduction in kernel density estimation and indicate how it will enjoy similar properties for classification. We show that boosting kernel classifiers reduces the bias whilst only slightly increasing the variance, with an overall reduction in error. Numerical examples and simulations are used to illustrate the findings, and we also suggest further areas of research

Dominance Based Crossover Operator for Evolutionary Multi-objective Algorithms

In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to the particular context of the quest for the Pareto-optimal set. The only exceptions are some mating restrictions that take in account the distance between the potential mates - but contradictory conclusions have been reported. This paper introduces a particular mating restriction for Evolutionary Multi-objective Algorithms, based on the Pareto dominance relation: the partner of a non-dominated individual will be preferably chosen among the individuals of the population that it dominates. Coupled with the BLX crossover operator, two different ways of generating offspring are proposed. This recombination scheme is validated within the well-known NSGA-II framework on three bi-objective benchmark problems and one real-world bi-objective constrained optimization problem. An acceleration of the progress of the population toward the Pareto set is observed on all problems

Faster Approximate String Matching for Short Patterns

We study the classical approximate string matching problem, that is, given strings $P$ and $Q$ and an error threshold $k$, find all ending positions of substrings of $Q$ whose edit distance to $P$ is at most $k$. Let $P$ and $Q$ have lengths $m$ and $n$, respectively. On a standard unit-cost word RAM with word size $w \geq \log n$ we present an algorithm using time $$O(nk \cdot \min(\frac{\log^2 m}{\log n},\frac{\log^2 m\log w}{w}) + n)$$ When $P$ is short, namely, $m = 2^{o(\sqrt{\log n})}$ or $m = 2^{o(\sqrt{w/\log w})}$ this improves the previously best known time bounds for the problem. The result is achieved using a novel implementation of the Landau-Vishkin algorithm based on tabulation and word-level parallelism.Comment: To appear in Theory of Computing System

Precision Measurement of the Proton and Deuteron Spin Structure Functions g2 and Asymmetries A2

We have measured the spin structure functions g2p and g2d and the virtual photon asymmetries A2p and A2d over the kinematic range 0.02 < x < 0.8 and 0.7 < Q^2 < 20 GeV^2 by scattering 29.1 and 32.3 GeV longitudinally polarized electrons from transversely polarized NH3 and 6LiD targets. Our measured g2 approximately follows the twist-2 Wandzura-Wilczek calculation. The twist-3 reduced matrix elements d2p and d2n are less than two standard deviations from zero. The data are inconsistent with the Burkhardt-Cottingham sum rule if there is no pathological behavior as x->0. The Efremov-Leader-Teryaev integral is consistent with zero within our measured kinematic range. The absolute value of A2 is significantly smaller than the sqrt[R(1+A1)/2] limit.Comment: 12 pages, 4 figures, 2 table

Finding a moral homeground: appropriately critical religious education and transmission of spiritual values

Values-inspired issues remain an important part of the British school curriculum. Avoiding moral relativism while fostering enthusiasm for spiritual values and applying them to non-curricular learning such as school ethos or children's home lives are challenges where spiritual, moral, social and cultural (SMSC) development might benefit from leadership by critical religious education (RE). Whether the school's model of spirituality is that of an individual spiritual tradition (schools of a particular religious character) or universal pluralistic religiosity (schools of plural religious character), the pedagogy of RE thought capable of leading SMSC development would be the dialogical approach with examples of successful implementation described by Gates, Ipgrave and Skeie. Marton's phenomenography, is thought to provide a valuable framework to allow the teacher to be appropriately critical in the transmission of spiritual values in schools of a particular religious character as evidenced by Hella's work in Lutheran schools

A system of ODEs for a Perturbation of a Minimal Mass Soliton

We study soliton solutions to a nonlinear Schrodinger equation with a saturated nonlinearity. Such nonlinearities are known to possess minimal mass soliton solutions. We consider a small perturbation of a minimal mass soliton, and identify a system of ODEs similar to those from Comech and Pelinovsky (2003), which model the behavior of the perturbation for short times. We then provide numerical evidence that under this system of ODEs there are two possible dynamical outcomes, which is in accord with the conclusions of Pelinovsky, Afanasjev, and Kivshar (1996). For initial data which supports a soliton structure, a generic initial perturbation oscillates around the stable family of solitons. For initial data which is expected to disperse, the finite dimensional dynamics follow the unstable portion of the soliton curve.Comment: Minor edit

Mountain maple and balsam fir early response to partial and clear-cut harvesting under aspen stands of northern Quebec

This study is a component of the Sylviculture et am