Mejoras de funcionalidades en la gestión de usuariosde la plataforma K-PAX

Esta memoria trata de las mejoras propuestas en la plataforma educativa kPax de la UOC referentes a la gestión de usuarios.

Impaired fast-spiking, suppressed cortical inhibition and increased susceptibility to seizures in mice lacking Kv3.2 K+ channel proteins

Voltage-gated K+ channels of the Kv3 subfamily have unusual electrophysiological properties, including activation at very depolarized voltages (positive to −10 mV) and very fast deactivation rates, suggesting special roles in neuronal excitability. In the brain, Kv3 channels are prominently expressed in select neuronal populations, which include fast-spiking (FS) GABAergic interneurons of the neocortex, hippocampus, and caudate, as well as other high-frequency firing neurons. Although evidence points to a key role in high-frequency firing, a definitive understanding of the function of these channels has been hampered by a lack of selective pharmacological tools. We therefore generated mouse lines in which one of the Kv3 genes, Kv3.2, was disrupted by gene-targeting methods. Whole-cell electrophysiological recording showed that the ability to fire spikes at high frequencies was impaired in immunocytochemically identified FS interneurons of deep cortical layers (5-6) in which Kv3.2 proteins are normally prominent. No such impairment was found for FS neurons of superficial layers (2-4) in which Kv3.2 proteins are normally only weakly expressed. These data directly support the hypothesis that Kv3 channels are necessary for high-frequency firing. Moreover, we found that Kv3.2 −/− mice showed specific alterations in their cortical EEG patterns and an increased susceptibility to epileptic seizures consistent with an impairment of cortical inhibitory mechanisms. This implies that, rather than producing hyperexcitability of the inhibitory interneurons, Kv3.2 channel elimination suppresses their activity. These data suggest that normal cortical operations depend on the ability of inhibitory interneurons to generate high-frequency firing.

K(+) channel expression distinguishes subpopulations of parvalbumin- and somatostatin-containing neocortical interneurons

Kv3.1 and Kv3.2 K+ channel proteins form similar voltage-gated K+ channels with unusual properties, including fast activation at voltages positive to −10 mV and very fast deactivation rates. These properties are thought to facilitate sustained high-frequency firing. Kv3.1 subunits are specifically found in fast-spiking, parvalbumin (PV)-containing cortical interneurons, and recent studies have provided support for a crucial role in the generation of the fast-spiking phenotype. Kv3.2 mRNAs are also found in a small subset of neocortical neurons, although the distribution of these neurons is different. We raised antibodies directed against Kv3.2 proteins and used dual-labeling methods to identify the neocortical neurons expressing Kv3.2 proteins and to determine their subcellular localization. Kv3.2 proteins are prominently expressed in patches in somatic and proximal dendritic membrane as well as in axons and presynaptic terminals of GABAergic interneurons. Kv3.2 subunits are found in all PV-containing neurons in deep cortical layers where they probably form heteromultimeric channels with Kv3.1 subunits. In contrast, in superficial layer PV-positive neurons Kv3.2 immunoreactivity is low, but Kv3.1 is still prominently expressed. Because Kv3.1 and Kv3.2 channels are differentially modulated by protein kinases, these results raise the possibility that the fast-spiking properties of superficial- and deep-layer PV neurons are differentially regulated by neuromodulators. Interestingly, Kv3.2 but not Kv3.1 proteins are also prominent in a subset of seemingly non-fast-spiking, somatostatin- and calbindin-containing interneurons, suggesting that the Kv3.1–Kv3.2 current type can have functions other than facilitating high-frequency firing.

Motivational effects of cannabinoids are mediated by μ-opioid and k-opioid receptor

Repeated THC administration produces motivational and somaticadaptive changes leading to dependence in rodents. Toinvestigate the molecular basis for cannabinoid dependenceand its possible relationship with the endogenous opioid system,we explored Δ9-tetrahydrocannabinol (THC) activity in mice lacking μ-, δ- or κ-opioid receptor genes. Acute THCinduced hypothermia, antinociception, and ypolocomotion remained unaffected in these mice, whereas THC tolerance and withdrawal were minimally modified in mutant animals. In contrast, profound phenotypic changes are observed in several place conditioning protocols that reveal both THC rewarding and aversive properties. Absence of μ receptors abolishes THC place preference. Deletion of κ receptors ablates THC place aversion and furthermore unmasks THC place preference. Thus, an opposing activity of μ- and κ-opioid receptors in modulating reward pathways forms the basis for the dual euphoric–dysphoric activity of THC.

Topological comparison of methods for predicting transcriptional cooperativity in yeast

Background: The cooperative interaction between transcription factors has a decisive role in the control of the fate of the eukaryotic cell. Computational approaches for characterizing cooperative transcription factors in yeast, however, are based on different rationales and provide a low overlap between their results. Because the wealth of information contained in protein interaction networks and regulatory networks has proven highly effective in elucidating functional relationships between proteins, we compared different sets of cooperative transcription factor pairs (predicted by four different computational methods) within the frame of those networks. Results: Our results show that the overlap between the sets of cooperative transcription factors predicted by the different methods is low yet significant. Cooperative transcription factors predicted by all methods are closer and more clustered in the protein interaction network than expected by chance. On the other hand, members of a cooperative transcription factor pair neither seemed to regulate each other nor shared similar regulatory inputs, although they do regulate similar groups of target genes. Conclusion: Despite the different definitions of transcriptional cooperativity and the different computational approaches used to characterize cooperativity between transcription factors, the analysis of their roles in the framework of the protein interaction network and the regulatory network indicates a common denominator for the predictions under study. The knowledge of the shared topological properties of cooperative transcription factor pairs in both networks can be useful not only for designing better prediction methods but also for better understanding the complexities of transcriptional control in eukaryotes.

K. Iran i la proliferació nuclear

Conté: ¿Irán, potencia nuclear?; El reto nuclear de Irán; Dos respuestas al reto nuclear; Con la vista puesta en Irán; La provocación nuclear norcoreana; Irán y la oferta de Obama

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.

On some geometry and equivalence classes of normal form games

Equivalence classes of normal form games are defined using the geometryof correspondences of standard equilibiurm concepts like correlated, Nash,and robust equilibrium or risk dominance and rationalizability. Resultingequivalence classes are fully characterized and compared across differentequilibrium concepts for 2 x 2 games. It is argued that the procedure canlead to broad and game-theoretically meaningful distinctions of games aswell as to alternative ways of viewing and testing equilibrium concepts.Larger games are also briefly considered.

Distributional equivalence and subcompositional coherence in the analysis of contingency tables, ratio-scale measurements and compositional data

We consider two fundamental properties in the analysis of two-way tables of positive data: the principle of distributional equivalence, one of the cornerstones of correspondence analysis of contingency tables, and the principle of subcompositional coherence, which forms the basis of compositional data analysis. For an analysis to be subcompositionally coherent, it suffices to analyse the ratios of the data values. The usual approach to dimension reduction in compositional data analysis is to perform principal component analysis on the logarithms of ratios, but this method does not obey the principle of distributional equivalence. We show that by introducing weights for the rows and columns, the method achieves this desirable property. This weighted log-ratio analysis is theoretically equivalent to spectral mapping , a multivariate method developed almost 30 years ago for displaying ratio-scale data from biological activity spectra. The close relationship between spectral mapping and correspondence analysis is also explained, as well as their connection with association modelling. The weighted log-ratio methodology is applied here to frequency data in linguistics and to chemical compositional data in archaeology.

Comparing Random-based and k-Anonymity-Based Algorithms for Graph Anonymization

Recently, several anonymization algorithms have appeared for privacy preservation on graphs. Some of them are based on random-ization techniques and on k-anonymity concepts. We can use both of them to obtain an anonymized graph with a given k-anonymity value. In this paper we compare algorithms based on both techniques in orderto obtain an anonymized graph with a desired k-anonymity value. We want to analyze the complexity of these methods to generate anonymized graphs and the quality of the resulting graphs.

Topological computation of local cohomology multiplicities.

We express the Lyubeznik numbers of the local ring of a complex isolated singularity in terms of Betti numbers of the associated real link.

UBVRI photometry of G, K, M Hipparcos stars

UBVRI data are presented for a set of 229 late-type stars, most of them being high proper motion stars. All these data are part of the Input Catalog planned observations for the Hipparcos mission.

UBVRI photometry of G, K, M Hipparcos stars. II.

As indicated by Grenon (1989), the data of the present series of reports on the UBVRI photometry of late-type stars in the Hipparcos Input Catalog are to be employed in computations of Hipparcos observing time, as well as in evaluating the observability of faint stars by the satellite. Attention is here given to late type stars in the V = 8-12 range, including distant red giants in the Galactic plane (Hipparcos proposal 189), as well as high proper motion stars included in the G, LTT, LP, and MCC catalogs.

Medida de reflectancias en inmersión en aceite mediante el método directo y cálculo de n y k de 400 a 1100 nm.

Se ha centrado el problema en las mediciones en aceite en el directo para calcular n y k. Para ello se ha colocado una gota de aceite que se mantiene en contacto con la muestra mediante un cubreobjetos. Éste provoca una reflectancia adicional (efecto glare) que es necesario corregir. Se plantea el desarrollo matemático para esta corrección, y se realizan las comprobaciones con un sistema estándar.