The omnivorous Tyrolean Iceman: colon contents (meat, cereals, pollen, moss and whipworm) and stable isotope analyses

The contents of the colon of the Tyrolean Iceman who lived Ga. 5300 years ago include muscle fibres, cereal remains, a diversity of pollen, and most notably that of the hop hornbeam (Ostrya carpinifolia) retaining cellular contents, as well as a moss leaf (Neckera complanata) and eggs of the parasitic whipworm (Trichuris trichiura). Based almost solely on stable isotope analyses and ignoring the work on the colon contents, two recently published papers on the Iceman's diet draw ill- founded conclusions about vegetarianism and even veganism. Neither the pollen nor the moss is likely to have been deliberately consumed as food by the Iceman. All the available evidence concerning the Iceman's broad-based diet is reviewed and the significance of the colon contents for matters other than assessment of food intake is outlined

Optimality Clue for Graph Coloring Problem

In this paper, we present a new approach which qualifies or not a solution found by a heuristic as a potential optimal solution. Our approach is based on the following observation: for a minimization problem, the number of admissible solutions decreases with the value of the objective function. For the Graph Coloring Problem (GCP), we confirm this observation and present a new way to prove optimality. This proof is based on the counting of the number of different k-colorings and the number of independent sets of a given graph G. Exact solutions counting problems are difficult problems (\#P-complete). However, we show that, using only randomized heuristics, it is possible to define an estimation of the upper bound of the number of k-colorings. This estimate has been calibrated on a large benchmark of graph instances for which the exact number of optimal k-colorings is known. Our approach, called optimality clue, build a sample of k-colorings of a given graph by running many times one randomized heuristic on the same graph instance. We use the evolutionary algorithm HEAD [Moalic et Gondran, 2018], which is one of the most efficient heuristic for GCP. Optimality clue matches with the standard definition of optimality on a wide number of instances of DIMACS and RBCII benchmarks where the optimality is known. Then, we show the clue of optimality for another set of graph instances. Optimality Metaheuristics Near-optimal

Multiphoton radiative recombination of electron assisted by laser field

In the presence of an intensive laser field the radiative recombination of the continuum electron into an atomic bound state generally is accompanied by absorption or emission of several laser quanta. The spectrum of emitted photons represents an equidistant pattern with the spacing equal to the laser frequency. The distribution of intensities in this spectrum is studied employing the Keldysh-type approximation, i.e. neglecting interaction of the impact electron with the atomic core in the initial continuum state. Within the adiabatic approximation the scale of emitted photon frequencies is subdivided into classically allowed and classically forbidden domains. The highest intensities correspond to emission frequencies close to the edges of classically allowed domain. The total cross section of electron recombination summed over all emitted photon channels exhibits negligible dependence on the laser field intensity.Comment: 14 pages, 5 figures (Figs.2-5 have "a" and "b" parts), Phys.Rev.A accepted for publication. Fig.2b is presented correctl