968 resultados para brain size
Resumo:
Boeckx C., M.C. Horno & J.L. Mendívil (Eds.)
Resumo:
Mature adult Clarias gariepinus were obtained at the ABRU hatchery in Sonning (UK), where they had beenbred and reared for several years. These were exposed to two concentrations of dieldrin in water (2.4 mu g super(-1) and 4.0 mu g super(-1). The residue analysis of diedrin in three tissues exposed for on moth at two concentrations was carried out. These were subjected to GLC analytical process. The results indicated significantly (P<0.05) higher residues in liver than in muscle and brain. The results also showed that residue levels were dependant on exposure concentration
Resumo:
A variety of molecular approaches have been used to investigate the structural and enzymatic properties of rat brain type ll Ca^(2+) and calmodulin-dependent protein kinase (type ll CaM kinase). This thesis describes the isolation and biochemical characterization of a brain-region specific isozyme of the kinase and also the regulation the kinase activity by autophosphorylation.
The cerebellar isozyme of the type ll CaM kinase was purified and its biochemical properties were compared to the forebrain isozyme. The cerebellar isozyme is a large (500-kDa) multimeric enzyme composed of multiple copies of 50-kDa α subunits and 60/58-kDa β/β’ subunits. The holoenzyme contains approximately 2 α subunits and 8 β subunits. This contrasts to the forebrain isozyme, which is also composed of and β/β'subunits, but they are assembled into a holoenzyme of approximately 9 α subunits and 3 β/β ' subunits. The biochemical and enzymatic properties of the two isozymes are similar. The two isozymes differ in their association with subcellular structures. Approximately 85% of the cerebellar isozyme, but only 50% of the forebrain isozyme, remains associated with the particulate fraction after homogenization under standard conditions. Postsynaptic densities purified from forebrain contain the forebrain isozyme, and the kinase subunits make up about 16% of their total protein. Postsynaptic densities purified from cerebellum contain the cerebellar isozyme, but the kinase subunits make up only 1-2% of their total protein.
The enzymatic activity of both isozymes of the type II CaM kinase is regulated by autophosphorylation in a complex manner. The kinase is initially completely dependent on Ca^(2+)/calmodulin for phosphorylation of exogenous substrates as well as for autophosphorylation. Kinase activity becomes partially Ca^(2+) independent after autophosphorylation in the presence of Ca^(2+)/calmodulin. Phosphorylation of only a few subunits in the dodecameric holoenzyme is sufficient to cause this change, suggesting an allosteric interaction between subunits. At the same time, autophosphorylation itself becomes independent of Ca^(2+) These observations suggest that the kinase may be able to exist in at least two stable states, which differ in their requirements for Ca^(2+)/calmodulin.
The autophosphorylation sites that are involved in the regulation of kinase activity have been identified within the primary structure of the α and β subunits. We used the method of reverse phase-HPLC tryptic phosphopeptide mapping to isolate individual phosphorylation sites. The phosphopeptides were then sequenced by gas phase microsequencing. Phosphorylation of a single homologous threonine residue in the α and β subunits is correlated with the production of the Ca^(2+) -independent activity state of the kinase. In addition we have identified several sites that are phosphorylated only during autophosphorylation in the absence of Ca^(2+)/ calmodulin.
Resumo:
The brain is perhaps the most complex system to have ever been subjected to rigorous scientific investigation. The scale is staggering: over 10^11 neurons, each making an average of 10^3 synapses, with computation occurring on scales ranging from a single dendritic spine, to an entire cortical area. Slowly, we are beginning to acquire experimental tools that can gather the massive amounts of data needed to characterize this system. However, to understand and interpret these data will also require substantial strides in inferential and statistical techniques. This dissertation attempts to meet this need, extending and applying the modern tools of latent variable modeling to problems in neural data analysis.
It is divided into two parts. The first begins with an exposition of the general techniques of latent variable modeling. A new, extremely general, optimization algorithm is proposed - called Relaxation Expectation Maximization (REM) - that may be used to learn the optimal parameter values of arbitrary latent variable models. This algorithm appears to alleviate the common problem of convergence to local, sub-optimal, likelihood maxima. REM leads to a natural framework for model size selection; in combination with standard model selection techniques the quality of fits may be further improved, while the appropriate model size is automatically and efficiently determined. Next, a new latent variable model, the mixture of sparse hidden Markov models, is introduced, and approximate inference and learning algorithms are derived for it. This model is applied in the second part of the thesis.
The second part brings the technology of part I to bear on two important problems in experimental neuroscience. The first is known as spike sorting; this is the problem of separating the spikes from different neurons embedded within an extracellular recording. The dissertation offers the first thorough statistical analysis of this problem, which then yields the first powerful probabilistic solution. The second problem addressed is that of characterizing the distribution of spike trains recorded from the same neuron under identical experimental conditions. A latent variable model is proposed. Inference and learning in this model leads to new principled algorithms for smoothing and clustering of spike data.
Resumo:
Previous studies have shown that the glycoproteins containing the fucose moiety are involved in neuronal communication phenomena such as long-term potentiation and memory formation. These results imply that fucose containing glycoproteins might play an important role in learning and memory. To understand the role of fucose in neuronal communication, and the mechanisms by which fucose may be involved in information storage, the identification of fucosylproteins is essential. This report describes the identification and characterization of fucosylproteins in the brain, which will provide new insights into the role of the fucose involved molecular interactions.
Resumo:
Generally, wetlands are thought to perform water purification functions, removing contaminants as water flows through sediment and vegetation. This paradigm was challenged when Grant et al. (2001) reported that Talbert Salt Marsh (Figure 1.) increased fecal indicator bacteria (FIB) output to coastal waters, contributing to poor coastal water quality. Like most southern California wetlands, Talbert Salt Marsh has been severely degraded. It is a small (10 ha), restored wetland, only 1/100th its original size, and located at the base of a highly urbanized watershed. Is it reasonable to expect that this or any severely altered wetland will perform the same water purification benefits as a natural wetland? To determine how a more pristine southern California coastal wetland attenuated bacterial contaminants, we investigated FIB concentrations entering and exiting Carpinteria Salt Marsh (Figure 2.), a 93 ha, moderate-sized, relatively natural wetland.(PDF contains 4 pages)
Resumo:
The relative catch performance and selectively of gillnets and trammel nets were investigated in 12 sampling stations in Lake Kainji, Nigeria. 3 types of nets with dimensions 50mx3m were constructed using 76mm and 178mm meshsizes for two gillnets, 76mm and 178mm meshsizes for the lint and ar mour nets of the trammelnets respectively. All the nets were randomly ganged together to form a fleet of nine nets each, and were set twice in each of the 12 stations which gave a total of 24 fishing operations. A total of 365 fish weighing 88.9kg and belonging to 16 different species were caught in all the nets. The trammelnet had the highest catch by number and weight constituting 60% and 69.22% of the total catch and weight respectively with a relative species Diversity Index of 0.82. This was followed by 76mm gillnet which constituted 38.63% by number, 28.09% by weight, 0.69 relative Species Diversity Index. The 178mm gillnet had the least catch of 1.37% and 2.9% by number and weight respectively with 0.25 relative Species Diversity Index. There was significant difference (P<0.05) in the number and weight of fish caught in the different nets. The minimum selection length for these species caught were the same for each net. The trammel net had a wider selection range that skewed to the right, a higher modal and median length indicating larger individual species being entangled in the net
Resumo:
The dissertation is concerned with the mathematical study of various network problems. First, three real-world networks are considered: (i) the human brain network (ii) communication networks, (iii) electric power networks. Although these networks perform very different tasks, they share similar mathematical foundations. The high-level goal is to analyze and/or synthesis each of these systems from a “control and optimization” point of view. After studying these three real-world networks, two abstract network problems are also explored, which are motivated by power systems. The first one is “flow optimization over a flow network” and the second one is “nonlinear optimization over a generalized weighted graph”. The results derived in this dissertation are summarized below.
Brain Networks: Neuroimaging data reveals the coordinated activity of spatially distinct brain regions, which may be represented mathematically as a network of nodes (brain regions) and links (interdependencies). To obtain the brain connectivity network, the graphs associated with the correlation matrix and the inverse covariance matrix—describing marginal and conditional dependencies between brain regions—have been proposed in the literature. A question arises as to whether any of these graphs provides useful information about the brain connectivity. Due to the electrical properties of the brain, this problem will be investigated in the context of electrical circuits. First, we consider an electric circuit model and show that the inverse covariance matrix of the node voltages reveals the topology of the circuit. Second, we study the problem of finding the topology of the circuit based on only measurement. In this case, by assuming that the circuit is hidden inside a black box and only the nodal signals are available for measurement, the aim is to find the topology of the circuit when a limited number of samples are available. For this purpose, we deploy the graphical lasso technique to estimate a sparse inverse covariance matrix. It is shown that the graphical lasso may find most of the circuit topology if the exact covariance matrix is well-conditioned. However, it may fail to work well when this matrix is ill-conditioned. To deal with ill-conditioned matrices, we propose a small modification to the graphical lasso algorithm and demonstrate its performance. Finally, the technique developed in this work will be applied to the resting-state fMRI data of a number of healthy subjects.
Communication Networks: Congestion control techniques aim to adjust the transmission rates of competing users in the Internet in such a way that the network resources are shared efficiently. Despite the progress in the analysis and synthesis of the Internet congestion control, almost all existing fluid models of congestion control assume that every link in the path of a flow observes the original source rate. To address this issue, a more accurate model is derived in this work for the behavior of the network under an arbitrary congestion controller, which takes into account of the effect of buffering (queueing) on data flows. Using this model, it is proved that the well-known Internet congestion control algorithms may no longer be stable for the common pricing schemes, unless a sufficient condition is satisfied. It is also shown that these algorithms are guaranteed to be stable if a new pricing mechanism is used.
Electrical Power Networks: Optimal power flow (OPF) has been one of the most studied problems for power systems since its introduction by Carpentier in 1962. This problem is concerned with finding an optimal operating point of a power network minimizing the total power generation cost subject to network and physical constraints. It is well known that OPF is computationally hard to solve due to the nonlinear interrelation among the optimization variables. The objective is to identify a large class of networks over which every OPF problem can be solved in polynomial time. To this end, a convex relaxation is proposed, which solves the OPF problem exactly for every radial network and every meshed network with a sufficient number of phase shifters, provided power over-delivery is allowed. The concept of “power over-delivery” is equivalent to relaxing the power balance equations to inequality constraints.
Flow Networks: In this part of the dissertation, the minimum-cost flow problem over an arbitrary flow network is considered. In this problem, each node is associated with some possibly unknown injection, each line has two unknown flows at its ends related to each other via a nonlinear function, and all injections and flows need to satisfy certain box constraints. This problem, named generalized network flow (GNF), is highly non-convex due to its nonlinear equality constraints. Under the assumption of monotonicity and convexity of the flow and cost functions, a convex relaxation is proposed, which always finds the optimal injections. A primary application of this work is in the OPF problem. The results of this work on GNF prove that the relaxation on power balance equations (i.e., load over-delivery) is not needed in practice under a very mild angle assumption.
Generalized Weighted Graphs: Motivated by power optimizations, this part aims to find a global optimization technique for a nonlinear optimization defined over a generalized weighted graph. Every edge of this type of graph is associated with a weight set corresponding to the known parameters of the optimization (e.g., the coefficients). The motivation behind this problem is to investigate how the (hidden) structure of a given real/complex valued optimization makes the problem easy to solve, and indeed the generalized weighted graph is introduced to capture the structure of an optimization. Various sufficient conditions are derived, which relate the polynomial-time solvability of different classes of optimization problems to weak properties of the generalized weighted graph such as its topology and the sign definiteness of its weight sets. As an application, it is proved that a broad class of real and complex optimizations over power networks are polynomial-time solvable due to the passivity of transmission lines and transformers.
Resumo:
[EN] The objective of this study was to determine whether a short training program, using real foods, would decreased their portion-size estimation errors after training. 90 student volunteers (20.18±0.44 y old) of the University of the Basque Country (Spain) were trained in observational techniques and tested in food-weight estimation during and after a 3-hour training period. The program included 57 commonly consumed foods that represent a variety of forms (125 different shapes). Estimates of food weight were compared with actual weights. Effectiveness of training was determined by examining change in the absolute percentage error for all observers and over all foods over time. Data were analyzed using SPSS vs. 13.0. The portion-size errors decreased after training for most of the foods. Additionally, the accuracy of their estimates clearly varies by food group and forms. Amorphous was the food type estimated least accurately both before and after training. Our findings suggest that future dietitians can be trained to estimate quantities by direct observation across a wide range of foods. However this training may have been too brief for participants to fully assimilate the application.
Resumo:
Fucose-α(1-2)-galactose (Fucα(1-2)Gal) carbohydrates have been implicated in cognitive functions. However, the underlying molecular mechanisms that govern these processes are not well understood. While significant progress has been made toward identifying glycoconjugates bearing this carbohydrate epitope, a major challenge remains the discovery of interactions mediated by these sugars. Here, we employ the use of multivalent glycopolymers to enable the proteomic identification of weak affinity, low abundant Fucα(1-2)Gal-binding proteins (i.e. lectins) from the brain. End-biotinylated glycopolymers containing photoactivatable crosslinkers were used to capture and enrich potential Fucα(1-2)Gal-specific lectins from rat brain lysates. Candidate lectins were tested for their ability to bind Fucα(1-2)Gal, and the functional significance of the interaction was investigated for one such candidate, SV2a, using a knock-out mouse system. Our results suggest an important role for this glycan-lectin interaction in facilitating synaptic changes necessary for neuronal communication. This study highlights the use of glycopolymer mimetics to discover novel lectins and identify functional interactions between fucosyl carbohydrates and lectins in the brain.
Resumo:
89 ripe female brooders of the catfish, Clarias anguillaris (Body wt. Range 150g-1, 200g) were induced to spawn by hormone (Ovaprim) induced natural spawning technique over a period of 10 weeks. Matching ripe males were used for pairing the females at the ratio of two males to a female. Six ranges of brood stock body weights were considered as follows; <200g; 200g-399g; 400g-599g; 600-799g; 800g-999g; > 1000g and the number of fry produced by each female brooder was scored/recorded against the corresponding body weight range. The number of fry per unit quantity of hormone and the cost of production a fry based on the current price of Ovaprim (hormon) were determined so as to ascertain most economic size range. The best and most economic size range was between 400g-599g body weight with about 20,000 fry per ml of hormone and N0.028 per fry, while the females above 1000g gave the poorest results of 9,519 fry per ml of hormone and N0.059 per fry. For optimum production of Clarias anguillaris fry and maximum return on investment female brooders of body weights ranging between 400g-599g are recommended for hormone induced natural breeding exercises
Resumo:
The paper traces the different management practices adopted for Nigerian inland water bodies from the Colonial era to independence. It observes that the full potentials of these waters have never been realized over the years due to the absence of an effective management. The replacement of the traditional fisheries management by the centralized top-down approach by government after independence has not helped matters. Lately, the cooperative/community-based management approach has taken the centre stage worldwide. This has been identified to offer the most viable and equitable option towards the attainment of an optimum utilization of the fisheries resource. The entire community sensing security of tenure and enjoying some of the benefits from access control will actively take responsibility and enforcement. The paper drew experiences from some water bodies in Bangladesh, Philippines, Benin Republic and Malawi showing sound management strategy that, if adopted for our small and medium size reservoirs and other water bodies, would help optimize on an sustainable manner the benefits from those water bodies
Resumo:
The effect of the laser spot size on the neutron yield of table-top nuclear fusion from explosions of a femtosecond intense laser pulse heated deuterium clusters is investigated by using a simplified model, in which the cluster size distribution and the energy attenuation of the laser as it propagates through the cluster jet are taken into account. It has been found that there exists a proper laser spot size for the maximum fusion neutron yield for a given laser pulse and a specific deuterium gas cluster jet. The proper spot size, which is dependent on the laser parameters and the cluster jet parameters, has been calculated and compared with the available experimental data. A reasonable agreement between the calculated results and the published experimental results is found.