Evolution of plant reproduction: from fusion and dispersal to interaction and communication

Based on the existing data concerning the evolution of the sexual reproduction, it is argued that the processes of sex differentiation and interactions play a key role in evolution. From the beginning environment and organism are unified. In a changing dynamic environment life originates and the interaction between life and environment develops from simple to more complex organisms. Sexual reproduction is introduced after the origin of meiosis and is a key process in evolution. The asexual reproduction process prepares to dispersal. Sexual reproduction process adds the genome renewal and the gamete-gamete interaction. Reproduction and dispersal are connected and the process of reproduction has similarities between asexual and sexual reproduction. Unicellular algae develop the physiological and morphological sex differentiation. Sex differentiation is connected with the way of dispersal. The step to multicellular plants introduces cell isolation after meiosis and by the stay on the mother plant within a cell or organ, plant-cell apoplastic interaction originates and by prolonged stay the plant-plant interaction. This stay influences the type of dispersal. A life cycle with alternation of generations and two moments of dispersal permits plants to go on land. In ferns a shift in the moment of sex differentiation to meiospore happens and the stay of the macrospore leads to the seed plants. In water all types of sexual reproduction, interactions and the alternation of generations are prepared and these are used to conquest land. On land the biotic dispersal is realized. The phylogeny of sexual reproduction reveals that the sex differentiation and interaction are the main causes in the evolution of sexual reproduction. Sexual reproduction shows interactions during gamete fusion, between organism and environment and in multicellular plants between organisms. With respect to other types of interaction as in symbiosis or the nutrient chain, interaction is considered as an important action which is based on a persisting cooperation and points to a push during evolution. The push is expressed as communication: the driving force in the evolution. Based on the interactions between organisms and interactions between organisms and the dynamic environment, communication is considered as a driving force leading to the evolution as explained in the development of plant reproduction. Consequences for reproduction, its regulation and the process of evolution are discusse

Effective viscosity of dispersions approached by a statistical continuum method

The problem of the determination of the effective viscosity of disperse systems (emulsions, suspensions) is considered. On the basis of the formal solution of the equations governing creeping flow in a statistically homogeneous dispersion, the effective viscosity is expressed in a series expansion in terms of correlation functions. The contribution of the interfacial tension to the effective viscosity is also considered and finally bounds for the effective viscosity are indicated

Strategy Derivation for Small Progress Measures

Small Progress Measures is one of the most efficient parity game solving algorithms. The original algorithm provides the full solution (winning regions and strategies) in $O(dm \cdot (n/\lceil d / 2 \rceil)^{\lceil d/2 \rceil})$ time, and requires a re-run of the algorithm on one of the winning regions. We provide a novel operational interpretation of progress measures, and modify the algorithm so that it derives the winning strategies for both players in one pass. This reduces the upper bound on strategy derivation for SPM to $O(dm \cdot (n/\lfloor d / 2 \rfloor)^{\lfloor d/2 \rfloor})$.Comment: polished the tex

Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds

Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We investigate the complexity of Zielonka's Recursive algorithm for solving these special games, showing that the algorithm runs in O(d (n + m)) on weak games, and, somewhat surprisingly, that it requires exponential time to solve dull games and (nested) solitaire games. For the latter classes, we provide a family of games G, allowing us to establish a lower bound of 2^(n/3). We show that an optimisation of Zielonka's algorithm permits solving games from all three classes in polynomial time. Moreover, we show that there is a family of (non-special) games M that permits us to establish a lower bound of 2^(n/3), improving on the previous lower bound for the algorithm.Comment: In Proceedings GandALF 2013, arXiv:1307.416

X-ray residual stress measurements on cold-drawn steel wire

The interplanar spacing d{hkl} versus sin2 ψ distributions were measured for the 211, 310, 220 and 200 reflections from severely cold-drawn 0.7% C steel wire with a diameter of 0.25 mm. From the shape of the curves it was concluded that, as well as a 110 fibre texture and elastic anisotropy, plastic anisotropy of the ferrite crystals may be an important cause of the non-linearity in d{hkl} versus sin2 ψ. The shape of the curves, and therefore the residual state of stress of the wire, is influenced by the drawing parameters, i.e. the drawing die cone angle and the number of stages

Macroeconomic price indexes

Price Indexes allow one to compare the average levels of prices at different times. Despite their widespread use, price indexes do not answer all questions as well as analysts might wish. Macroeconomic Price Indexes is a guide for users of major price indexes. It provides details about several price indexes to help users intelligently decide what they can learn by using particular indexes.Macroeconomics ; Prices

Analysis of Boolean Equation Systems through Structure Graphs

We analyse the problem of solving Boolean equation systems through the use of structure graphs. The latter are obtained through an elegant set of Plotkin-style deduction rules. Our main contribution is that we show that equation systems with bisimilar structure graphs have the same solution. We show that our work conservatively extends earlier work, conducted by Keiren and Willemse, in which dependency graphs were used to analyse a subclass of Boolean equation systems, viz., equation systems in standard recursive form. We illustrate our approach by a small example, demonstrating the effect of simplifying an equation system through minimisation of its structure graph

A Comparison of BDD-Based Parity Game Solvers

Parity games are two player games with omega-winning conditions, played on finite graphs. Such games play an important role in verification, satisfiability and synthesis. It is therefore important to identify algorithms that can efficiently deal with large games that arise from such applications. In this paper, we describe our experiments with BDD-based implementations of four parity game solving algorithms, viz. Zielonka's recursive algorithm, the more recent Priority Promotion algorithm, the Fixpoint-Iteration algorithm and the automata based APT algorithm. We compare their performance on several types of random games and on a number of cases taken from the Keiren benchmark set.Comment: In Proceedings GandALF 2018, arXiv:1809.0241