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

Reduced maximal oxygen consumption and overproduction of proinflammatory cytokines in athletes

Objective: It was the aim of this study to evaluate whether chronic pain in athletes is related to performance, measured by the maximum oxygen consumption and production of hormones and cytokines. Methods: Fifty-five athletes with a mean age of 31.9 +/- 4.2 years engaged in regular competition and showing no symptoms of acute inflammation, particularly fever, were studied. They were divided into 2 subgroups according to the occurrence of pain. Plasma concentrations of adrenaline, noradrenaline, cortisol, prolactin, growth hormone and dopamine were measured by radioimmunoassay, and the production of the cytokines interleukin (IL)-1, IL-2, IL-4, IL-6, tumor necrosis factor-alpha, interferon-alpha and prostaglandin E-2 by whole-blood culture. Maximal oxygen consumption was determined during an incremental treadmill test. Results: There was no change in the concentration of stress hormones, but the athletes with chronic pain showed a reduction in maximum oxygen consumption (22%) and total consumption at the anaerobic threshold (25%), as well as increased cytokine production. Increases of 2.7-, 8.1-, 1.7- and 3.7-fold were observed for IL-1, IL-2, tumor necrosis factor-alpha and interferon-alpha, respectively. Conclusions: Our data show that athletes with chronic pain have enhanced production of proinflammatory cytokines and lipid mediators and reduced performance in the ergospirometric test. Copyright (c) 2008 S. Karger AG, Basel.

Maximal inflammatory response benefits syngeneic skin graft acceptance

Objective: We investigated the influence of acute inflammation in skin isograft acceptance. Methods: Two mouse lines selected for maximal (AIR(MAX)) or minimal inflammatory response (AIR(MIN)) were transplanted with syngeneic skin. Cellular infiltrates and cytokine production were measured 1, 3, 7 or 14 days post-transplantation. The percentage of CD4(+) CD25(+) Foxp3(+) cells in the lymph nodes was also evaluated. Results: Grafts were totally accepted in 100% of AIR(MAX) and in 26% of AIR(MIN) mice. In the latter, partial acceptance was observed in 74% of the animals. Emigrated cells were basically PMN and were enhanced in AIR(MAX) transplants. IL-10 production by graft infiltrating cells showed no interline differences. IFN-gamma was increased in AIR(MIN) grafts at day 14 and lower percentages of CD4(+)CD25(+)Foxp3(+) cells in the lymph nodes were observed in these mice. Conclusions: Our data suggest that differences in graft acceptance might be due to a lack of appropriate regulation of the inflammatory response in AIR(MIN) mice compromising the self/non-self recognition.

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.

Cyclic Maximal Ideals of Rings of Differential Operators over Power Series Rings

In [3], Bratti and Takagi conjectured that a first order differential operator S=11 +...+ nn+ with 1,..., n, {x1,..., xn} does not generate a cyclic maximal left (or right) ideal of the ring of differential operators. This is contrary to the case of the Weyl algebra, i.e., the ring of differential operators over the polynomial ring [x1,..., xn]. In this case, we know that such cyclic maximal ideals do exist. In this article, we prove several special cases of the conjecture of Bratti and Takagi.

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.

Classification of quantum relativistic orientable objects

Extending our previous work `Fields on the Poincare group and quantum description of orientable objects` (Gitman and Shelepin 2009 Eur. Phys. J. C 61 111-39), we consider here a classification of orientable relativistic quantum objects in 3 + 1 dimensions. In such a classification, one uses a maximal set of ten commuting operators (generators of left and right transformations) in the space of functions on the Poincare group. In addition to the usual six quantum numbers related to external symmetries (given by left generators), there appear additional quantum numbers related to internal symmetries (given by right generators). Spectra of internal and external symmetry operators are interrelated, which, however, does not contradict the Coleman-Mandula no-go theorem. We believe that the proposed approach can be useful for the description of elementary spinning particles considered as orientable objects. In particular, it gives a group-theoretical interpretation of some facts of the existing phenomenological classification of spinning particles.

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.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

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.

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.