16 resultados para the mind-brain problem
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)
Resumo:
The central actions of leptin are essential for homeostatic control of adipose tissue mass, glucose metabolism, and many autonomic and neuroendocrine systems. In the brain, leptin acts on numerous different cell types via the long-form leptin receptor (LepRb) to elicit its effects. The precise identification of leptin`s cellular targets is fundamental to understanding the mechanism of its pleiotropic central actions. We have systematically characterized LepRb distribution in the mouse brain using in situ hybridization in wildtype mice as well as by EYFP immunoreactivity in a novel LepRb-IRES-Cre EYFP reporter mouse line showing high levels of LepRb mRNA/EYFP coexpression. We found substantial LepRb mRNA and EYFP expression in hypothalamic and extrahypothalamic sites described before, including the dorsomedial nucleus of the hypothalamus, ventral premammillary nucleus, ventral tegmental area, parabrachial nucleus, and the dorsal vagal complex. Expression in insular cortex, lateral septal nucleus, medial preoptic area, rostral linear nucleus, and in the Edinger-Westphal nucleus was also observed and had been previously unreported. The LepRb-IRES-Cre reporter line was used to chemically characterize a population of leptin receptor-expressing neurons in the midbrain. Tyrosine hydroxylase and Cre reporter were found to be coexpressed in the ventral tegmental area and in other midbrain dopaminergic neurons. Lastly, the LepRbI-RES-Cre reporter line was used to map the extent of peripheral leptin sensing by central nervous system (CNS) LepRb neurons. Thus, we provide data supporting the use of the LepRb-IRES-Cre line for the assessment of the anatomic and functional characteristics of neurons expressing leptin receptor. J. Comp. Neurol. 514:518-532, 2009. (C) 2009 Wiley-Liss, Inc.
Resumo:
Chicken (Gallus gallus) brains were used to investigate the typology and the immunolabel pattern for the subunits composing the AMPA-type glutamate receptors (GluR) of hindbrain neurons of the dorsal (dND) and ventral nuclei (vND) of the Deiter`s vestibular complex (CD), which is the avian correspondent of the lateral vestibular nucleus (LVN) of mammals. Our results revealed that neurons of both divisions were poor in GluR1. The vND, the GluR2/3+ and GluR4+ label presented no area or neuronal size preference, although most neurons were around 75%. The dND neurons expressing GluR2/3 are primarily around 85%, medium to large-sized 85%, and predominantly 60% located in the medial portion of the rostral pole and in the lateral portion of the caudal pole. The majority of dND neurons containing GluR4 are also around 75%, larger (70% are large and giant), exhibiting a distribution that seems to be complementary to that of GluR2/3+ neurons. This distinct arrangement indicates functional differences into and between the DC nuclei, also signaling that such variation could be attributed to the diverse nature of the subunit composition of the GluRs. Discussion addresses the morphological and functional correlation of the avian DC with the LVN of mammals in addition to the high morphological correspondence, To include these data into the modern comparative approach we propose to adopt a similar nomenclature for the avian divisions dND and vND that could be referred as dLVN and vLVN. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
The aim of this study was to analyze the plastic effects of moderate exercise upon the motor cortex (M1 and M2 areas), cerebellum (Cb), and striatum (CPu) of the rat brain This assessment was made by verifying the expression of AMPA type glutamate receptor subunits (GluR1 and GluR2/3) We used adult Wistar rats, divided into 5 groups based on duration of exercise training, namely 3 days (EX3), 7 days (EX7) 15 days (EX15) 30 days (EX30), and sedentary (S) The exercised animals were subjected to a treadmill exercise protocol at the speed of the 10 meters/min for 40 mm After exercise, the brains were subjected to immunohistochemistry and immunoblotting to analyze changes of GluR1 and GluR2/3, and plasma cortcosterone was measured by ELISA in order to verify potential stress induced by physical training Overall the results of immunohistochemistry and immunoblotting were similar and revealed that GluR subunits show distinct responses over the exercise periods and for the different structures analyzed In general, there was increased expression of GluR subunits after longer exercise periods (such as EX30) although some opposite effects were seen after short periods of exercise (Ex3) In a few cases biphasic patterns with decreases and subsequent increases of GluR expression were seen and may represent the outcome of exercise dependent, complex regulatory processes The data show that the protocol used was able to promote plastic GluR changes during exercise, suggesting a specific involvement of these receptors in exercise induced plasticity processes in the brain areas tested (C) 2010 Elsevier B V All rights reserved
Resumo:
Physical exercise is known to enhance brain function in several aspects. We evaluated the acute effects of a moderate forced exercise protocol on synaptic proteins, namely synapsin 1 (SYN) and synaptophysin (SYP), and structural proteins (neurofilaments, NFs) in rat brain regions related to motor function and often affected by neurodegenerative disorders. Immunohistochemistry, Western blotting and real-time PCR were used to analyze the expression of those proteins after 3, 7 and 15 days of exercise (EX3, EX7 and EX15). In the cerebellum, increase of SYN was observed at EX7 and EX15 and of NF68 at EX3. In the substantia nigra, increases of protein levels were observed for NF68 and NF160 at EX3. In the striatum, there was an increase of SYN at EX3 and EX7, of SYP at EX7 and of NF68 at EX3. In the cortex, decreased levels of NF68 and NF160 were observed at EX3, followed by an increase of NF68 at EX15. In the reticular formation, all NF proteins were increased at EX15. The mRNA data for each time-point and region also revealed significant exercise-related changes of SYN, SYP and NF expression. These results suggest that moderate physical exercise modulates synaptic and structural proteins in motor brain areas, which may play an important role in the exercise-dependent brain plasticity. (C) 2010 Elsevier B.V. All rights reserved.
Resumo:
This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.
Resumo:
Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. Journal of the Operational Research Society (2010) 61, 108-114. doi:10.1057/jors.2008.151
Resumo:
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
We present a mathematically rigorous quantum-mechanical treatment of a one-dimensional non-relativistic motion of a particle in the potential field V(x) = g(1)x(-1) + g(2)x(-2), x is an element of R(+) = [0, infinity). For g(2) > 0 and g(1) < 0, the potential is known as the Kratzer potential V(K)(x) and is usually used to describe molecular energy and structure, interactions between different molecules and interactions between non-bonded atoms. We construct all self-adjoint Schrodinger operators with the potential V(x) and represent rigorous solutions of the corresponding spectral problems. Solving the first part of the problem, we use a method of specifying self-adjoint extensions by (asymptotic) self-adjoint boundary conditions. Solving spectral problems, we follow Krein`s method of guiding functionals. This work is a continuation of our previous works devoted to the Coulomb, Calogero and Aharonov-Bohm potentials.
Resumo:
A solution to a version of the Stieltjes moment. problem is presented. Using this solution, we construct a family of coherent states of a charged particle in a uniform magnetic field. We prove that these states form an overcomplete set that is normalized and resolves the unity. By the help of these coherent states we construct the Fock-Bergmann representation related to the particle quantization. This quantization procedure takes into account a circle topology of the classical motion. (C) 2009 Elsevier B.V. All rights reserved.
Resumo:
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.
Resumo:
For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
In this article, we introduce a semi-parametric Bayesian approach based on Dirichlet process priors for the discrete calibration problem in binomial regression models. An interesting topic is the dosimetry problem related to the dose-response model. A hierarchical formulation is provided so that a Markov chain Monte Carlo approach is developed. The methodology is applied to simulated and real data.
Resumo:
Multiple sclerosis (MS) is a progressive inflammatory and/or demyelinating disease of the human central nervous system (CNS). Most of the knowledge about the pathogenesis of MS has been derived from murine models, such as experimental autoimmune encephalomyelitis and vital encephalomyelitis. Here, we infected female C57BL/6 mice with a neurotropic strain of the mouse hepatitis virus (MHV-59A) to evaluate whether treatment with the multifunctional antioxidant tempol (4-hydroxy-2,2,6,6-tetramethyl-1-piperidinyloxy) affects the ensuing encephalomyelitis. In untreated animals, neurological symptoms developed quickly: 90% of infected mice died 10 days after virus inoculation and the few survivors presented neurological deficits. Treatment with tempol (24 mg/kg, ip, two doses on the first day and daily doses for 7 days plus 2 mM tempol in the drinking water ad libitum) profoundly altered the disease outcome: neurological symptoms were attenuated, mouse survival increased up to 70%, and half of the survivors behaved as normal mice. Not Surprisingly, tempol substantially preserved the integrity of the CNS, including the blood-brain barrier. Furthermore, treatment with tempol decreased CNS vital titers, macrophage and T lymphocyte infiltration, and levels of markers of inflammation, such as expression of inducible nitric oxide synthase, transcription of tumor necrosis factor-alpha and interferon-gamma, and protein nitration. The results indicate that tempol ameliorates murine viral encephalomyelitis by altering the redox status of the infectious environment that contributes to an attenuated CNS inflammatory response. overall, our study supports the development of therapeutic strategies based on nitroxides to manage neuroinflammatory diseases, including MS. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
Long-term memory, a persistent form of synaptic plasticity, requires translation of a subset of mRNA present in neuronal dendrites during a short and critical period through a mechanism not yet fully elucidated. Western blotting analysis revealed a high content of eukaryotic translation initiation factor 5A (eIF5A) in the brain of neonatal rats, a period of intense neurogenesis rate, differentiation and synaptic establishment, when compared to adult rats. Immunohistochemistry analysis revealed that eIF5A is present in the whole brain of adult rats showing a variable content among the cells from different areas (e.g. cortex, hippocampus and cerebellum). A high content of eIF5A in the soma and dendrites of Purkinje cells, key neurons in the control of motor long-term memory in the cerebellum, was observed. Detection of high eIF5A content was revealed in dendritic varicosities of Purkinje cells. Evidence is presented herein that a reduction of eIF5A content is associated to brain aging. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.