Removal of the PsaF Polypeptide Biases Electron Transfer in Favor of the PsaB Branch of Cofactors in Triton X‐100 Photosystem I Complexes from Synechococcus sp. PCC 7002†

Continuous wave (CW) and transient electron paramagnetic resonance studies have implied that when PsaF is removed genetically, the double reduction of A_1A is facile, the lifetime of A_1A^? is shorter and the ratio of fast to slow kinetic phases increases in PS I complexes isolated with Triton X‐100 (Van der Est, A., A. I. Valieva, Y. E. Kandrashkin, G. Shen, D. A. Bryant and J. H. Golbeck [2004] Biochemistry 43 , 1264–1275). Changes in the lifetimes of A_1A^? and A_1B^? are characteristic of mutants involving the quinone binding sites, but changes in the relative amplitudes of A_1A^? and A_1B^? are characteristic of mutants involving the primary electron acceptors, A_0A and A_0B. Here, we measured the fast and slow phases of electron transfer from A_1B^? and A_1A^? to F_X in psaF and psaE psaF null mutants using time‐resolved CW and pump‐probe optical absorption spectroscopy. The lifetime of the fast kinetic phase was found to be unaltered, but the lifetime of the slow kinetic phase was shorter in the psaF null mutant and even more so in the psaE psaF null mutant. Concomitantly, the amplitude of the fast kinetic phase increased by a factor of 1.8 and 2.0 in the psaF and psaE psaF null mutants, respectively, at the expense of the slow kinetic phase. The change in ratio of the fast to slow kinetic phases is explained as either a redirection of electron transfer through A_1B at the expense of A_1A, or a shortening of the lifetime of A_1A^? to become identical to that of A_1B^?. The constant lifetime and the characteristics of the near‐UV spectrum of the fast kinetic phase favor the former explanation. A unified hypothesis is presented of a displacement of the A‐jk(1) α‐helix and switchback loop, which would weaken the H‐bond from Leu₇₂₂ to A_1A, accounting for the acceleration of the slow kinetic phase, as well as weaken the H‐bond from Tyr₆₉₆ to A_0A, accounting for the bias of electron transfer in favor of the PsaB branch of cofactors.     

Stationary Analysis of a Fluid Queue Driven by Some Countable State Space Markov Chain

Motivated by queueing systems playing a key role in the performance evaluation of telecommunication networks, we analyze in this paper the stationary behavior of a fluid queue, when the instantaneous input rate is driven by a continuous-time Markov chain with finite or infinite state space. In the case of an infinite state space and for particular classes of Markov chains with a countable state space, such as quasi birth and death processes or Markov chains of the G/M/1 type, we develop an algorithm to compute the stationary probability distribution function of the buffer level in the fluid queue. This algorithm relies on simple recurrence relations satisfied by key characteristics of an auxiliary queueing system with normalized input rates.      

Brownian Chen series and Atiyah-Singer theorem

The purpose of this work is to give a new and short proof of the Atiyah-Singer local index theorem for the Dirac operator on the spin bundle. This proof is obtained by using heat semigroups approximations based on the truncation of Brownian Chen series.     

Descent algorithm for nonsmooth stochastic multiobjective optimization

An algorithm for solving nearly-separable quadratic optimization problems (QPs) is presented. The approach is based on applying a semismooth Newton method to solve the implicit complementarity problem arising as the first-order stationarity conditions of such a QP. An important feature of the approach is that, as in dual decomposition methods, separability of the dual function of the QP can be exploited in the search direction computation. Global convergence of the method is promoted by enforcing decrease in component(s) of a Fischer–Burmeister formulation of the complementarity conditions, either via a merit function or through a filter mechanism. The results of numerical experiments when solving convex and nonconvex instances are provided to illustrate the efficacy of the method.     

Quaternionic Brownian Windings

Journal of Theoretical Probability - We define and study the three-dimensional windings along Brownian paths in the quaternionic Euclidean, projective and hyperbolic spaces. In particular, the...     

Automata and logics over finitely varying functions

We extend some of the classical connections between automata and logic due to Büchi (1960) [5] and McNaughton and Papert (1971) [12] to languages of finitely varying functions or “signals”. In particular, we introduce a natural class of automata for generating finitely varying functions called ’s, and show that it coincides in terms of language definability with a natural monadic second-order logic interpreted over finitely varying functions Rabinovich (2002) [15]. We also identify a “counter-free” subclass of ’s which characterise the first-order definable languages of finitely varying functions. Our proofs mainly factor through the classical results for word languages. These results have applications in automata characterisations for continuously interpreted real-time logics like Metric Temporal Logic (MTL) Chevalier et al. (2006, 2007) [6] and [7].     

Estimation consistante des paramètres d'un modèle non linéaire pour des données fonctionnelles discrétisées aléatoirement

We study a class of nonlinear regression models for scalar or vectorial response when the explanatory variable is a function. We introduce a consistent estimator of the parameters of models in this class when functions are evaluated at randomly chosen observation points. To cite this article: F. Rossi, B. Conan-Guez, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

On the Topology of Real Algebraic Plane Curves

We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of singular and critical points, is also relevant. A challenge is to compute efficiently this information for the given coordinate system even if the curve is not in generic position. Previous methods based on the cylindrical algebraic decomposition use sub-resultant sequences and computations with polynomials with algebraic coefficients. A novelty of our approach is to replace these tools by Gröbner basis computations and isolation with rational univariate representations. This has the advantage of avoiding computations with polynomials with algebraic coefficients, even in non-generic positions. Our algorithm isolates critical points in boxes and computes a decomposition of the plane by rectangular boxes. This decomposition also induces a new approach for computing an arrangement of polylines isotopic to the input curve. We also present an analysis of the complexity of our algorithm. An implementation of our algorithm demonstrates its efficiency, in particular on high-degree non-generic curves.