Climate sensitivity across marine domains of life: limits to evolutionary adaptation shape species interactions, supplementary material

Organisms in all domains, Archaea, Bacteria, and Eukarya will respond to climate change with differential vulnerabilities resulting in shifts in species distribution, coexistence, and interactions. The identification of unifying principles of organism functioning across all domains would facilitate a cause and effect understanding of such changes and their implications for ecosystem shifts. For example, the functional specialization of all organisms in limited temperature ranges leads us to ask for unifying functional reasons. Organisms also specialize in either anoxic or various oxygen ranges, with animals and plants depending on high oxygen levels. Here, we identify thermal ranges, heat limits of growth, and critically low (hypoxic) oxygen concentrations as proxies of tolerance in a meta-analysis of data available for marine organisms, with special reference to domain-specific limits. For an explanation of the patterns and differences observed, we define and quantify a proxy for organismic complexity across species from all domains. Rising complexity causes heat (and hypoxia) tolerances to decrease from Archaea to Bacteria to uni- and then multicellular Eukarya. Within and across domains, taxon-specific tolerance limits likely reflect ultimate evolutionary limits of its species to acclimatization and adaptation. We hypothesize that rising taxon-specific complexities in structure and function constrain organisms to narrower environmental ranges. Low complexity as in Archaea and some Bacteria provide life options in extreme environments. In the warmest oceans, temperature maxima reach and will surpass the permanent limits to the existence of multicellular animals, plants and unicellular phytoplankter. Smaller, less complex unicellular Eukarya, Bacteria, and Archaea will thus benefit and predominate even more in a future, warmer, and hypoxic ocean.

Computational Schemes for Optimizing Domains of Attraction in Dynamical Systems

In this paper, several computational schemes are presented for the optimal tuning of the global behavior of nonlinear dynamical sys- tems. Specifically, the maximization of the size of domains of attraction associated with invariants in parametrized dynamical sys- tems is addressed. Cell Mapping (CM) tech- niques are used to estimate the size of the domains, and such size is then maximized via different optimization tools. First, a ge- netic algorithm is tested whose performance shows to be good for determining global maxima at the expense of high computa- tional cost. Secondly, an iterative scheme based on a Stochastic Approximation proce- dure (the Kiefer-Wolfowitz algorithm) is eval- uated showing acceptable performance at low cost. Finally, several schemes combining neu- ral network based estimations and optimiza- tion procedures are addressed with promising results. The performance of the methods is illus- trated with two applications: first on the well-known van der Pol equation with stan- dard parametrization, and second the tuning of a controller for saturated systems.

On the efficiency of a dedicated LMA for multicast traffic distribution in PMIPv6 domains

IP multicast allows the efficient support of group communication services by reducing the number of IP flows needed for such communication. The increasing generalization in the use of multicast has also triggered the need for supporting IP multicast in mobile environments. Proxy Mobile IPv6 (PMIPv6) is a network-based mobility management solution, where the functionality to support the terminal movement resides in the network. Recently, a baseline solution has been adopted for multicast support in PMIPv6. Such base solution has inefficiencies in multicast routing because it may require multiple copies of a single stream to be received by the same access gateway. Nevertheless, there is an alternative solution to support multicast in PMIPv6 that avoids this issue. This paper evaluates by simulation the scalability of both solutions under realistic conditions, and provides an analysis of the sensitivity of the two proposals against a number of parameters.

A common mechanism of defective channel trafficking underlying DFNA2 hearing loss result in different cell surface expression levels of KCNQ4 mutants

KCNQ4 mutations underlie DFNA2, a subtype of autosomal dominant hearing loss. We had previously identified the pore-region p.G296S mutation that impaired channel activity in two manners: it greatly reduced surface expression and abolished channel function. Moreover, G296S mutant exerted a strong dominant-negative effect on potassium currents by reducing the channel expression at the cell surface representing the first study to identify a trafficking-dependent dominant mechanism for the loss of KCNQ4 channel function in DFNA2. Here, we have investigated the pathogenic mechanism associated with all the described KCNQ4 mutations (F182L, W242X, E260K, D262V, L274H, W276S, L281S, G285C, G285S and G321S) that are located in different domains of the channel protein. F182L mutant showed a wild type-like cell-surface distribution in transiently transfected NIH3T3 fibroblasts and the recorded currents in Xenopus oocytes resembled those of the wild-type. The remaining KCNQ4 mutants abolished potassium currents, but displayed distinct levels of defective cell-surface expression in NIH3T3 as quantified by flow citometry. Co-localization studies revealed these mutants were retained in the ER, unless W242X, which showed a clear co-localization with Golgi apparatus. Interestingly, this mutation results in a truncated KCNQ4 protein at the S5 transmembrane domain, before the pore region, that escapes the protein quality control in the ER but does not reach the cell surface at normal levels. Currently we are investigating the trafficking behaviour and electrophysiological properties of several KCNQ4 truncated proteins artificially generated in order to identify specific motifs involved in channel retention/exportation. Altogether, our results indicate that a defect in KCNQ4 trafficking is the common mechanism underlying DFNA2

Improving abstract interpretations by combining domains

This article considers static analysis based on abstract interpretation of logic programs over combined domains. It is known that analyses over combined domains provide more information potentially than obtained by the independent analyses. However, the construction of a combined analysis often requires redefining the basic operations for the combined domain. A practical approach to maintain precision in combined analyses of logic programs which reuses the individual analyses and does not redefine the basic operations is illustrated. The advantages of the approach are that proofs of correctness for the new domains are not required and implementations can be reused. The approach is demonstrated by showing that a combined sharing analysis — constructed from "old" proposals — compares well with other "new" proposals suggested in recent literature both from the point of view of efficiency and accuracy.

An abstract interpretation-based approach to mobile code safety

Recent approaches to mobile code safety, like proof- arrying code, involve associating safety information to programs. The code supplier provides a program and also includes with it a certifícate (or proof) whose validity entails compliance with a predefined safety policy. The intended benefit is that the program consumer can locally validate the certifícate w.r.t. the "untrusted" program by means of a certifícate checker—a process which should be much simpler, eflicient, and automatic than generating the original proof. We herein introduce a novel approach to mobile code safety which follows a similar scheme, but which is based throughout on the use of abstract interpretation techniques. In our framework the safety policy is specified by using an expressive assertion language defined over abstract domains. We identify a particular slice of the abstract interpretation-based static analysis results which is especially useful as a certifícate. We propose an algorithm for checking the validity of the certifícate on the consumer side which is itself in fact a very simplified and eflicient specialized abstract-interpreter. Our ideas are illustrated through an example implemented in the CiaoPP system. Though further experimentation is still required, we believe the proposed approach is of interest for bringing the automation and expressiveness which is inherent in the abstract interpretation techniques to the área of mobile code safety.

Treatment of singularities in 2-D domains using BIEM

The singularities which arise when there is a sudden change of boundary conditions are modelled using spectral shape interpolation functions. The procedure can be used for elasticity as well as potential theory and to any degree of accuracy with respect to the smooth part of the curve.

First passages in bounded domains: When is the mean first passage time meaningful?

We study the first passage statistics to adsorbing boundaries of a Brownian motion in bounded two-dimensional domains of different shapes and configurations of the adsorbing and reflecting boundaries. From extensive numerical analysis we obtain the probability P(ω) distribution of the random variable ω=τ1/(τ1+τ2), which is a measure for how similar the first passage times τ1 and τ2 are of two independent realizations of a Brownian walk starting at the same location. We construct a chart for each domain, determining whether P(ω) represents a unimodal, bell-shaped form, or a bimodal, M-shaped behavior. While in the former case the mean first passage time (MFPT) is a valid characteristic of the first passage behavior, in the latter case it is an insufficient measure for the process. Strikingly we find a distinct turnover between the two modes of P(ω), characteristic for the domain shape and the respective location of absorbing and reflective boundaries. Our results demonstrate that large fluctuations of the first passage times may occur frequently in two-dimensional domains, rendering quite vague the general use of the MFPT as a robust measure of the actual behavior even in bounded domains, in which all moments of the first passage distribution exist.