CCP1/Nna1 functions in protein turnover in mouse brain: Implications for cell death in Purkinje cell degeneration mice

Purkinje cell degeneration (pcd) mice have a mutation within the gene encoding cytosolic carboxypeptidase 1 (CCP1/Nna1), which has homology to metallocarboxypeptidases. To assess the function of CCP1/Nna1, quantitative proteomics and peptidomics approaches were used to compare proteins and peptides in mutant and wild-type mice. Hundreds of peptides derived from cytosolic and mitochondrial proteins are greatly elevated in pcd mouse hypothalamus, amygdala, cortex, prefrontal cortex, and striatum. However, the major proteins detected on 2-D gel electrophoresis were present in mutant and wild-type mouse cortex and hypothalamus at comparable levels, and proteasome activity is normal in these brain regions of pcd mice, suggesting that the increase in cellular peptide levels in the pcd mice is due to reduced degradation of the peptides downstream of the proteasome. Both nondegenerating and degenerating regions of pcd mouse brain, but not wild-type mouse brain, show elevated autophagy, which can be triggered by a decrease in amino acid levels. Taken together with previous studies on CCP1/Nna1, these data suggest that CCP1/Nna1 plays a role in protein turnover by cleaving proteasome-generated peptides into amino acids and that decreased peptide turnover in the pcd mice leads to cell death.-Berezniuk, I., Sironi, J., Callaway, M. B., Castro, L. M., Hirata, I. Y., Ferro, E. S., Fricker, L. D. CCP1/Nna1 functions in protein turnover in mouse brain: Implications for cell death in Purkinje cell degeneration mice. FASEB J. 24, 1813-1823 (2010). www.fasebj.org

Exact Search Directions for Optimization of Linear and Nonlinear Models Based on Generalized Orthonormal Functions

A novel technique for selecting the poles of orthonormal basis functions (OBF) in Volterra models of any order is presented. It is well-known that the usual large number of parameters required to describe the Volterra kernels can be significantly reduced by representing each kernel using an appropriate basis of orthonormal functions. Such a representation results in the so-called OBF Volterra model, which has a Wiener structure consisting of a linear dynamic generated by the orthonormal basis followed by a nonlinear static mapping given by the Volterra polynomial series. Aiming at optimizing the poles that fully parameterize the orthonormal bases, the exact gradients of the outputs of the orthonormal filters with respect to their poles are computed analytically by using a back-propagation-through-time technique. The expressions relative to the Kautz basis and to generalized orthonormal bases of functions (GOBF) are addressed; the ones related to the Laguerre basis follow straightforwardly as a particular case. The main innovation here is that the dynamic nature of the OBF filters is fully considered in the gradient computations. These gradients provide exact search directions for optimizing the poles of a given orthonormal basis. Such search directions can, in turn, be used as part of an optimization procedure to locate the minimum of a cost-function that takes into account the error of estimation of the system output. The Levenberg-Marquardt algorithm is adopted here as the optimization procedure. Unlike previous related work, the proposed approach relies solely on input-output data measured from the system to be modeled, i.e., no information about the Volterra kernels is required. Examples are presented to illustrate the application of this approach to the modeling of dynamic systems, including a real magnetic levitation system with nonlinear oscillatory behavior.

On the Barnes double zeta and Gamma functions

We present a complete description of the analytic properties of the Barnes double zeta and Gamma functions. (C) 2009 Elsevier Inc. All rights reserved.

THE IMPLICIT FUNCTION THEOREM FOR CONTINUOUS FUNCTIONS

In the present paper we obtain a new homological version of the implicit function theorem and some versions of the Darboux theorem. Such results are proved for continuous maps on topological manifolds. As a consequence. some versions of these classic theorems are proved when we consider differenciable (not necessarily C-1) maps.

UNIFORM DISSIPATIVENESS, ROBUST SYNCHRONIZATION AND LOCATION OF THE ATTRACTOR OF PARAMETRIZED NONAUTONOMOUS DISCRETE SYSTEMS

In this series of papers, we study issues related to the synchronization of two coupled chaotic discrete systems arising from secured communication. The first part deals with uniform dissipativeness with respect to parameter variation via the Liapunov direct method. We obtain uniform estimates of the global attractor for a general discrete nonautonomous system, that yields a uniform invariance principle in the autonomous case. The Liapunov function is allowed to have positive derivative along solutions of the system inside a bounded set, and this reduces substantially the difficulty of constructing a Liapunov function for a given system. In particular, we develop an approach that incorporates the classical Lagrange multiplier into the Liapunov function method to naturally extend those Liapunov functions from continuous dynamical system to their discretizations, so that the corresponding uniform dispativeness results are valid when the step size of the discretization is small. Applications to the discretized Lorenz system and the discretization of a time-periodic chaotic system are given to illustrate the general results. We also show how to obtain uniform estimation of attractors for parametrized linear stable systems with nonlinear perturbation.

Periodic window arising in the parameter space of an impact oscillator

In the bi-dimensional parameter space of an impact-pair system, shrimp-shaped periodic windows are embedded in chaotic regions. We show that a weak periodic forcing generates new periodic windows near the unperturbed one with its shape and periodicity. Thus, the new periodic windows are parameter range extensions for which the controlled periodic oscillations substitute the chaotic oscillations. We identify periodic and chaotic attractors by their largest Lyapunov exponents. (C) 2010 Elsevier B.V. All rights reserved.

Reaction functions for weakly bound systems

We propose a new technique to analyze total reaction cross sections. In this technique, which has been previously applied to fusion reactions, the experimental data are used to build a dimensionless reaction function, which does not depend oil the system size or details of the optical potential. In this way, total reaction cross sections for different systems can be directly compared. We employ this technique to perform a systematic study of reaction cross sections of weakly bound systems in different mass ranges, and compare their reaction functions with the ones of tightly bound systems with similar masses. We show that breakup reactions and neutron transfers in halo systems lead to large reaction functions, well above the ones of typical tightly or weakly bound stable systems. (C) 2009 Elsevier B.V. All rights reserved.

Dependence of Response Functions and Orbital Functionals on Occupation Numbers

Explicitly orbital-dependent approximations to the exchange-correlation energy functional of density functional theory typically not only depend on the single-particle Kohn-Sham orbitals but also on their occupation numbers in the ground-state Slater determinant. The variational calculation of the corresponding exchange-correlation potentials with the optimized effective potential (OEP) method therefore also requires a variation of the occupation numbers with respect to a variation in the effective single-particle potential, which is usually not taken into account. Here it is shown under which circumstances this procedure is justified.

The defensive functions of plant inhibitors are not restricted to insect enzyme inhibition

Three plant proteinase inhibitors BbKI (kallikrein inhibitor) and BbCI (cruzipain inhibitor) from Bauhinia bouhinioides, and a BrTI (trypsin inhibitor) from B. rufa, were examined for other effects in Callosobruchus maculatus development; of these only BrTI affected bruchid emergence. BrTI and BbKI share 81% identities in their primary sequences and the major differences between them are the regions comprising the RGD and RGE motifs in BrTI. These sequences were shown to be essential for BrTI insecticidal activity, since a modified BbKI [that is a recombinant form (BbKIm) with some amino acid residues replaced by those found in BrTI sequence] also strongly inhibited insect development. By using synthetic peptides related to the BrTI sequence, YLEAPVARGDGGLA-NH(2) (RGE) and IVYYPDRGETGL-NH(2) (RGE), it was found that the peptide with an RGE sequence was able to block normal development of C. maculatus larvae (ED(50) 0.16% and LD(50) 0.09%), this being even more effective than the native protein. (C) 2009 Elsevier Ltd. All rights reserved.

A note on a practical relationship between filter coefficients and scaling and wavelet functions of Discrete Wavelet Transforms

In this paper, the relationship between the filter coefficients and the scaling and wavelet functions of the Discrete Wavelet Transform is presented and exemplified from a practical point-of-view. The explanations complement the wavelet theory, that is well documented in the literature, being important for researchers who work with this tool for time-frequency analysis. (c) 2011 Elsevier Ltd. All rights reserved.

U-curve: A branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem

This paper presents the formulation of a combinatorial optimization problem with the following characteristics: (i) the search space is the power set of a finite set structured as a Boolean lattice; (ii) the cost function forms a U-shaped curve when applied to any lattice chain. This formulation applies for feature selection in the context of pattern recognition. The known approaches for this problem are branch-and-bound algorithms and heuristics that explore partially the search space. Branch-and-bound algorithms are equivalent to the full search, while heuristics are not. This paper presents a branch-and-bound algorithm that differs from the others known by exploring the lattice structure and the U-shaped chain curves of the search space. The main contribution of this paper is the architecture of this algorithm that is based on the representation and exploration of the search space by new lattice properties proven here. Several experiments, with well known public data, indicate the superiority of the proposed method to the sequential floating forward selection (SFFS), which is a popular heuristic that gives good results in very short computational time. In all experiments, the proposed method got better or equal results in similar or even smaller computational time. (C) 2009 Elsevier Ltd. All rights reserved.

Density-Profile Processes Describing Biological Signaling Networks: Almost Sure Convergence to Deterministic Trajectories

We introduce jump processes in R(k), called density-profile processes, to model biological signaling networks. Our modeling setup describes the macroscopic evolution of a finite-size spin-flip model with k types of spins with arbitrary number of internal states interacting through a non-reversible stochastic dynamics. We are mostly interested on the multi-dimensional empirical-magnetization vector in the thermodynamic limit, and prove that, within arbitrary finite time-intervals, its path converges almost surely to a deterministic trajectory determined by a first-order (non-linear) differential equation with explicit bounds on the distance between the stochastic and deterministic trajectories. As parameters of the spin-flip dynamics change, the associated dynamical system may go through bifurcations, associated to phase transitions in the statistical mechanical setting. We present a simple example of spin-flip stochastic model, associated to a synthetic biology model known as repressilator, which leads to a dynamical system with Hopf and pitchfork bifurcations. Depending on the parameter values, the magnetization random path can either converge to a unique stable fixed point, converge to one of a pair of stable fixed points, or asymptotically evolve close to a deterministic orbit in Rk. We also discuss a simple signaling pathway related to cancer research, called p53 module.

Metastable Periodic Patterns in Singularly Perturbed Delayed Equations

We consider the scalar delayed differential equation epsilon(x) over dot(t) = -x(t) + f(x(t-1)), where epsilon > 0 and f verifies either df/dx > 0 or df/dx < 0 and some other conditions. We present theorems indicating that a generic initial condition with sign changes generates a solution with a transient time of order exp(c/epsilon), for some c > 0. We call it a metastable solution. During this transient a finite time span of the solution looks like that of a periodic function. It is remarkable that if df/dx > 0 then f must be odd or present some other very special symmetry in order to support metastable solutions, while this condition is absent in the case df/dx < 0. Explicit epsilon-asymptotics for the motion of zeroes of a solution and for the transient time regime are presented.

On the Hamilton-Jacobi equation in the framework of generalized functions

In this work we study, in the framework of Colombeau`s generalized functions, the Hamilton-Jacobi equation with a given initial condition. We have obtained theorems on existence of solutions and in some cases uniqueness. Our technique is adapted from the classical method of characteristics with a wide use of generalized functions. We were led also to obtain some general results on invertibility and also on ordinary differential equations of such generalized functions. (C) 2011 Elsevier Inc. All rights reserved.

An indecomposable Banach space of continuous functions which has small density

Using the method of forcing we construct a model for ZFC where CH does not hold and where there exists a connected compact topological space K of weight omega(1) < 2(omega) such that every operator on the Banach space of continuous functions on K is multiplication by a continuous function plus a weakly compact operator. In particular, the Banach space of continuous functions on K is indecomposable.