A new interpretation of the bonding properties and UV–vis spectra of [M3(CO)12] clusters (M = Ru, Os): a TD-DFT study

DFT and TD-DFT calculations (ADF program) were performed in order to analyze the electronic structure of the [M-3(CO)(12)] clusters (M = Ru, Os) and interpret their electronic spectra. The highest occupied molecular orbitals are M-M bonding (sigma) involving different M-M bonds, both for Ru and Os. They participate in low-energy excitation processes and their depopulation should weaken M-M bonds in general. While the LUMO is M-NI and M-CO anti-bonding (sigma*), the next, higher-lying empty orbitals have a main contribution from CO (pi*) and either a small (Ru) or an almost negligible one (Os) from the metal atoms. The main difference between the two clusters comes from the different nature of these low-energy unoccupied orbitals that have a larger metal contribution in the case of ruthenium. The photochemical reactivity of the two clusters is reexamined and compared to earlier interpretations.

Phylogenies reveal new interpretation of speciation and the Red Queen

The Red Queen metaphor has species accumulating small changes to keep up with a continually changing environment, with speciation occurring at a constant rate. This constant-rate claim is now tested against four competing models, using 101 phylogenies of animal, plant and fungal taxa. The results provide a new interpretation of the Red Queen; a view linking speciation to rare stochastic events that cause reproductive isolation.

Cumulant-based deconvolution and identification: several new families of linear equations

This paper presents several new families of cumulant-based linear equations with respect to the inverse filter coefficients for deconvolution (equalisation) and identification of nonminimum phase systems. Based on noncausal autoregressive (AR) modeling of the output signals and three theorems, these equations are derived for the cases of 2nd-, 3rd and 4th-order cumulants, respectively, and can be expressed as identical or similar forms. The algorithms constructed from these equations are simpler in form, but can offer more accurate results than the existing methods. Since the inverse filter coefficients are simply the solution of a set of linear equations, their uniqueness can normally be guaranteed. Simulations are presented for the cases of skewed series, unskewed continuous series and unskewed discrete series. The results of these simulations confirm the feasibility and efficiency of the algorithms.