SASEGASA: A New Generic Parallel Evolutionary Algorithm for Achieving Highest Quality Results

This paper presents a new generic Evolutionary Algorithm (EA) for retarding the unwanted effects of premature convergence. This is accomplished by a combination of interacting generic methods. These generalizations of a Genetic Algorithm (GA) are inspired by population genetics and take advantage of the interactions between genetic drift and migration. In this regard a new selection scheme is introduced, which is designed to directedly control genetic drift within the population by advantageous self-adaptive selection pressure steering. Additionally this new selection model enables a quite intuitive heuristics to detect premature convergence. Based upon this newly postulated basic principle the new selection mechanism is combined with the already proposed Segregative Genetic Algorithm (SEGA), an advanced Genetic Algorithm (GA) that introduces parallelism mainly to improve global solution quality. As a whole, a new generic evolutionary algorithm (SASEGASA) is introduced. The performance of the algorithm is evaluated on a set of characteristic benchmark problems. Computational results show that the new method is capable of producing highest quality solutions without any problem-specific additions.     

Pentopyranosyl Oligonucleotide Systems. 9th Communication

Pyranosyl‐RNA (‘p‐RNA’ ) is an oligonucleotide system isomeric to natural RNA and composed of the very same building blocks as RNA. Its generational, chemical, and informational properties are deemed to be those of an alternative nucleic acid system that could have been a candidate in Nature's evolutionary choice of the molecular basis of genetic function. We consider the study of the chemistry of p‐RNA as etiologically relevant in the sense that knowledge of its structural, chemical, and informational properties on the chemical level offers both a perspective and reference points for the recognition of specific structural assets of the RNA structure that made it the (supposedly) superior system among possible alternatives and, therefore, the system that became part of biology as we know it today. The paper describes the chemical synthesis of β‐d‐ (and L )‐ribopyranosyl‐(4′→2′)‐oligonucleotide sequences, presents a resume of their structural and chemical properties, and cautiously discusses what we may and may not have learned from the pyranosyl isomer of RNA with respect to the conundrum of RNA's origin.     

Pt(IV)-catalyzed cyclization of arene-alkyne substrates via C-H bond functionalization

We herein report that PtCl₄ has proven to be a hydroarylation catalyst with an efficiency and substrate scope superior to previously known methods. This catalyst demonstrated consistent performance with arene-yne substrates of diverse structural features, including propargyl ethers, propargylamines, and alkynoate esters, providing good to excellent yields of the 6-endo products (chromenes, dihydroquinolines, and coumarins). In contrast, Pt(II), Pd(II), and Ga(III) salts were shown to be sensitive to the substitution on the alkyne moiety. PtCl₄ is compatible with both terminal and disubstituted alkynes, as well as with various functionalities on the arene ring, including methyl, methoxyl, hydroxyl, protected amine, and halide.     

Calibration of a basket option model applied to company valuation

Applying real options thinking to company valuation seems theoretically and intuitively appealing. However, the real option analogy of a single European option as well as the compound option proxy perform poorly when applied to company valuation. We therefore suggest to rework the building blocks of real option applications to corporate valuation.  We introduce a framework to delineate the distribution of the underlying asset in the risk neutral world, which is important in order to value any derivative. This is achieved by an algorithm to calibrate a basket option model using real world data of observed share prices. The fitting takes account of the class of stable distributions. The index of stability of asymmetric α stable distribution serves as an over-all parameter to characterise the specific distribution.     

On K1 and K2 of Algebraic Surfaces

In this paper we study higher Chow groups of smooth, projective surfaces over a field k of characteristic zero, using some new Hodge theoretic methods which we develop for this purpose. In particular we investigate the subgroup of CH ^r+1 (X,r) with r = 1,2 consisting of cycles that are supported over a normal crossing divisor Z on X. In this case, the Hodge theory of the complement forms an interesting variation of mixed Hodge structures in any geometric deformation of the situation. Our main result is a structure theorem in the case where X is a very general hypersurface of degree d in projective 3-space for d sufficiently large and Z is a union of very general hypersurface sections of X. In this case we show that the subgroup of CH ^r+1 (X,r) we consider is generated by obvious cycles only arising from rational functions on X with poles along Z. This can be seen as a generalization of the Noether–Lefschetz theorem for r = 0. In the case r = 1 there is a similar generalization by Müller-Stach, but our result is more precise than it, since it is geometric and not only cohomological. The case r = 2 is entirely new and original in this paper. For small d, we construct some explicit examples for r = 1 and 2 where the corresponding higher Chow groups are indecomposable, i.e. not the image of certain products of lower order groups. In an appendix Alberto Collino constructs even more indecomposable examples in CH ³ (X,2) which move in a one-dimensional family on the surface X.Contribution to appendix.     

The combination technique and some generalisations

The combination technique has repeatedly been shown to be an effective tool for the approximation with sparse grid spaces. Little is known about the reasons of this effectiveness and in some cases the combination technique can even break down. It is known, however, that the combination technique produces an exact result in the case of a projection into a sparse grid space if the involved partial projections commute.

The performance of the combination technique is analysed using a projection framework and the C/S decomposition. Error bounds are given in terms of angles between the spanning subspaces or the projections onto these subspaces. Based on this analysis modified combination coefficients are derived which are optimal in a certain sense and which can substantially extend the applicability and performance of the combination technique.