European mobility and local political incorporation: The case of British and Romanian residents in Spain

This paper analyses the impact of European mobility in the field of the political nomination of intra-EU migrants in local elections. The study contributes to the debates in the literature related to immigrant nomination and representation by showing how group resources and political opportunities in the country of residence interact with the political opportunities of the European citizenship regime. It argues that the symbolic and legal status of European identity, representation in the European Parliament and strong links between political institutions in the countries of destination and origin play a positive role in boosting immigrant political entrepreneurs’ visibility vis-à-vis host country political actors. In order to illustrate these findings, the paper provides a qualitative comparison of British and Romanian residents in Spain.

Molecular mechanisms of prostacyclin receptor signaling: The intracellular domains in G protein coupling

To better understand the mechanisms of how the human prostacyclin receptor (1P) mediates vasodilation and platelet anti-aggregation through Gs protein coupling, a strategy integrating multiple approaches including high resolution NMR experiments, synthetic peptide, fluorescence spectroscopy, molecular modeling, and recombinant protein was developed and used to characterize the structure/function relationship of important segments and residues of the IP receptor and the α-subunit of the Gs protein (Gαs). The first (iLP1) and third (iLP3) intracellular loops of the IP receptor, as well as the Gαs C-terminal domain, relevant to the Gs-mediated IP receptor signaling, were first identified by observation of the effects of the mini gene-expressed corresponding protein segments in HEK293 cells which co-expressed the receptor and Gαs. Evidence of the IP iLP1 domain interacted with the Gαs C-terminal domain was observed by fluorescence and NMR spectroscopic studies using a constrained synthetic peptide, which mimicked the IP iLP1 domain, and the synthetic peptide, which mimicked Gαs C-terminal domain. The solution structural models and the peptide-peptide interaction of the two synthetic protein segments were determined by high resolution NMR spectroscopy. The important residues in the corresponding domains of the IP receptor and the Gαs predicted by NMR chemical shift mapping were used to guide the identification of their protein-protein interaction in cells. A profile of the residues Arg42 - Ala48 of the IP iLP1 domain and the three residues Glu392 ∼ Leu394 of the Gαs C-terminal domain involved in the IP/Gs protein coupling were confirmed by recombinant proteins. The data revealed an intriguing speculation on the mechanisms of how the signal of the ligand-activated IP receptor is transmitted to the Gs protein in regulating vascular functions and homeostasis, and also provided substantial insights into other prostanoid receptor signaling. ^

BIOCHEMICAL CHARACTERIZATION OF BINDING PARTNERS OF TWO HSP70 CO-CHAPERONES IN SACCHAROMYCES CEREVISIAE

Cells are exposed to a variety of environmental and physiological changes including temperature, pH and nutrient availability. These changes cause stress to cells, which results in protein misfolding and altered cellular protein homeostasis. How proteins fold into their three-dimensional functional structure is a fundamental biological process with important relevance to human health. Misfolded and aggregated proteins are linked to multiple neurodegenerative diseases, cardiovascular disease and cystic fibrosis. To combat proteotoxic stress, cells deploy an array of molecular chaperones that assist in the repair or removal of misfolded proteins. Hsp70, an evolutionarily conserved molecular chaperone, promotes protein folding and helps maintain them in a functional state. Requisite co-chaperones, including nucleotide exchange factors (NEFs) strictly regulate and serve to recruit Hsp70 to distinct cellular processes or locations. In yeast and human cells, three structurally non-related cytosolic NEFs are present: Sse1 (Hsp110), Fes1 (HspBP1) and Snl1 (Bag-1). Snl1 is unique among the cytosolic NEFs as it is localized at the ER membrane with its Hsp70 binding (BAG) domain exposed to the cytosol. I discovered that Snl1 distinctly interacts with assembled ribosomes and several lines of evidence indicate that this interaction is both independent of and concurrent with binding to Hsp70 and is not dependent on membrane localization. The ribosome-binding site is identified as a short lysine-rich motif within the amino terminus of the Snl1 BAG domain distinct from the Hsp70 interaction region. In addition, I demonstrate ribosome association with the Snl1 homolog in the pathogenic fungus, Candida albicans and localize this putative NEF to a perinuclear/ER membrane, suggesting functional conservation in fungal BAG domain-containing proteins. As a first step in determining specific domain architecture in fungal BAG proteins, I present the preliminary steps of protein purification and analysis of the minimal Hsp70 binding region in in both S.cerevisiae and C. albicans Snl1. Contrary to previous in vitro evidence which showed the Fes1 NEF to interact with both cytosolic Hsp70s, Ssa and Ssb, Fes1 is shown to interact specifically with Ssa when expressed under normal cellular conditions in S. cerevisiae. This is the first reported evidence of Hsp70 binding selectivity for a cytosolic NEF, and suggests a possible mechanism to achieve specificity in Hsp70-dependent functions. Taken together, the work presented in this dissertation highlights the striking divergence among Hsp70 co-chaperones in selecting binding partners, which may correlate with their specific roles in the cell.

Formalizing a Conceptual Framework of Work Domain Knowledge

Background: The failure rate of health information systems is high, partially due to fragmented, incomplete, or incorrect identification and description of specific and critical domain requirements. In order to systematically transform the requirements of work into real information system, an explicit conceptual framework is essential to summarize the work requirements and guide system design. Recently, Butler, Zhang, and colleagues proposed a conceptual framework called Work Domain Ontology (WDO) to formally represent users’ work. This WDO approach has been successfully demonstrated in a real world design project on aircraft scheduling. However, as a top level conceptual framework, this WDO has not defined an explicit and well specified schema (WDOS) , and it does not have a generalizable and operationalized procedure that can be easily applied to develop WDO. Moreover, WDO has not been developed for any concrete healthcare domain. These limitations hinder the utility of WDO in real world information system in general and in health information system in particular. Objective: The objective of this research is to formalize the WDOS, operationalize a procedure to develop WDO, and evaluate WDO approach using Self-Nutrition Management (SNM) work domain. Method: Concept analysis was implemented to formalize WDOS. Focus group interview was conducted to capture concepts in SNM work domain. Ontology engineering methods were adopted to model SNM WDO. Part of the concepts under the primary goal “staying healthy” for SNM were selected and transformed into a semi-structured survey to evaluate the acceptance, explicitness, completeness, consistency, experience dependency of SNM WDO. Result: Four concepts, “goal, operation, object and constraint”, were identified and formally modeled in WDOS with definitions and attributes. 72 SNM WDO concepts under primary goal were selected and transformed into semi-structured survey questions. The evaluation indicated that the major concepts of SNM WDO were accepted by 41 overweight subjects. SNM WDO is generally independent of user domain experience but partially dependent on SNM application experience. 23 of 41 paired concepts had significant correlations. Two concepts were identified as ambiguous concepts. 8 extra concepts were recommended towards the completeness of SNM WDO. Conclusion: The preliminary WDOS is ready with an operationalized procedure. SNM WDO has been developed to guide future SNM application design. This research is an essential step towards Work-Centered Design (WCD).

Using modular neural networks to model self-consciousness and self-representation for artificial entities

Self-consciousness implies not only self or group recognition, but also real knowledge of one’s own identity. Self-consciousness is only possible if an individual is intelligent enough to formulate an abstract self-representation. Moreover, it necessarily entails the capability of referencing and using this elf-representation in connection with other cognitive features, such as inference, and the anticipation of the consequences of both one’s own and other individuals’ acts. In this paper, a cognitive architecture for self-consciousness is proposed. This cognitive architecture includes several modules: abstraction, self-representation, other individuals'representation, decision and action modules. It includes a learning process of self-representation by direct (self-experience based) and observational learning (based on the observation of other individuals). For model implementation a new approach is taken using Modular Artificial Neural Networks (MANN). For model testing, a virtual environment has been implemented. This virtual environment can be described as a holonic system or holarchy, meaning that it is composed of autonomous entities that behave both as a whole and as part of a greater whole. The system is composed of a certain number of holons interacting. These holons are equipped with cognitive features, such as sensory perception, and a simplified model of personality and self-representation. We explain holons’ cognitive architecture that enables dynamic self-representation. We analyse the effect of holon interaction, focusing on the evolution of the holon’s abstract self-representation. Finally, the results are explained and analysed and conclusions drawn.

knOWLearn: a reuse-based approach for building ontologies in a semi-automatic way

In this poster paper we present an overview of knOWLearn, a novel approach for building domain ontologies in a semi-automatic fashion.

Optical digital chaos cryptography

In this work we present a new way to mask the data in a one-user communication system when direct sequence - code division multiple access (DS-CDMA) techniques are used. The code is generated by a digital chaotic generator, originally proposed by us and previously reported for a chaos cryptographic system. It is demonstrated that if the user's data signal is encoded with a bipolar phase-shift keying (BPSK) technique, usual in DS-CDMA, it can be easily recovered from a time-frequency domain representation. To avoid this situation, a new system is presented in which a previous dispersive stage is applied to the data signal. A time-frequency domain analysis is performed, and the devices required at the transmitter and receiver end, both user-independent, are presented for the optical domain.

Integración de SSN con una ontología de servicios

Los servicios en red que conocemos actualmente están basados en documentos y enlaces de hipertexto que los relacionan entre sí sin aportar verdadera información acerca de los contenidos que representan. Podría decirse que se trata de “una red diseñada por personas para ser interpretada por personas”. El objetivo principal de los últimos años es encaminar esta red hacia una web de conocimiento, en la que la información pueda ser interpretada por agentes computerizados de manera automática. Para llevar a cabo esta transformación es necesaria la utilización de nuevas tecnologías especialmente diseñadas para la descripción de contenidos como son las ontologías. Si bien las redes convencionales están evolucionando, no son las únicas que lo están haciendo. El rápido crecimiento de las redes de sensores y el importante aumento en el número de dispositivos conectados a internet, hace necesaria la incorporación de tecnologías de la web semántica a este tipo de redes. Para la realización de este Proyecto de Fin de Carrera se utilizará la ontología SSN, diseñada para la descripción semántica de sensores y las redes de las que forman parte con el fin de permitir una mejor interacción entre los dispositivos y los sistemas que hacen uso de ellos. El trabajo desarrollado a lo largo de este Proyecto de Fin de Carrera gira en torno a esta ontología, siendo el principal objetivo la generación semiautomática de código a partir de un modelo de sistemas descrito en función de las clases y propiedades proporcionadas por SSN. Para alcanzar este fin se dividirá el proyecto en varias partes. Primero se realizará un análisis de la ontología mencionada. A continuación se describirá un sistema simulado de sensores y por último se implementarán las aplicaciones para la generación automática de interfaces y la representación gráfica de los dispositivos del sistema a partir de la representación del éste en un fichero de tipo OWL. ABSTRACT. The web we know today is based on documents and hypertext links that relate these documents with each another, without providing consistent information about the contents they represent. It could be said that its a network designed by people to be used by people. The main goal of the last couple of years is to guide this network into a web of knowledge, where information can be automatically processed by machines. This transformation, requires the use of new technologies specially designed for content description such as ontologies. Nowadays, conventional networks are not the only type of networks evolving. The use of sensor networks and the number of sensor devices connected to the Internet is rapidly increasing, making the use the integration of semantic web technologies to this kind of networks completely necessary. The SSN ontology will be used for the development of this Final Degree Dissertation. This ontology was design to semantically describe sensors and the networks theyre part of, allowing a better interaction between devices and the systems that use them. The development carried through this Final Degree Dissertation revolves around this ontology and aims to achieve semiautomatic code generation starting from a system model described based on classes and properties provided by SSN. To reach this goal, de Dissertation will be divided in several parts. First, an analysis about the mentioned ontology will be made. Following this, a simulated sensor system will be described, and finally, the implementation of the applications will take place. One of these applications will automatically generate de interfaces and the other one will graphically represents the devices in the sensor system, making use of the system representation in an OWL file.

Strong Connectivity in Directed Hypergraphs and its Application to the Atomic Decomposition of Ontologies

Los hipergrafos dirigidos se han empleado en problemas relacionados con lógica proposicional, bases de datos relacionales, linguística computacional y aprendizaje automático. Los hipergrafos dirigidos han sido también utilizados como alternativa a los grafos (bipartitos) dirigidos para facilitar el estudio de las interacciones entre componentes de sistemas complejos que no pueden ser fácilmente modelados usando exclusivamente relaciones binarias. En este contexto, este tipo de representación es conocida como hiper-redes. Un hipergrafo dirigido es una generalización de un grafo dirigido especialmente adecuado para la representación de relaciones de muchos a muchos. Mientras que una arista en un grafo dirigido define una relación entre dos de sus nodos, una hiperarista en un hipergrafo dirigido define una relación entre dos conjuntos de sus nodos. La conexión fuerte es una relación de equivalencia que divide el conjunto de nodos de un hipergrafo dirigido en particiones y cada partición define una clase de equivalencia conocida como componente fuertemente conexo. El estudio de los componentes fuertemente conexos de un hipergrafo dirigido puede ayudar a conseguir una mejor comprensión de la estructura de este tipo de hipergrafos cuando su tamaño es considerable. En el caso de grafo dirigidos, existen algoritmos muy eficientes para el cálculo de los componentes fuertemente conexos en grafos de gran tamaño. Gracias a estos algoritmos, se ha podido averiguar que la estructura de la WWW tiene forma de “pajarita”, donde más del 70% del los nodos están distribuidos en tres grandes conjuntos y uno de ellos es un componente fuertemente conexo. Este tipo de estructura ha sido también observada en redes complejas en otras áreas como la biología. Estudios de naturaleza similar no han podido ser realizados en hipergrafos dirigidos porque no existe algoritmos capaces de calcular los componentes fuertemente conexos de este tipo de hipergrafos. En esta tesis doctoral, hemos investigado como calcular los componentes fuertemente conexos de un hipergrafo dirigido. En concreto, hemos desarrollado dos algoritmos para este problema y hemos determinado que son correctos y cuál es su complejidad computacional. Ambos algoritmos han sido evaluados empíricamente para comparar sus tiempos de ejecución. Para la evaluación, hemos producido una selección de hipergrafos dirigidos generados de forma aleatoria inspirados en modelos muy conocidos de grafos aleatorios como Erdos-Renyi, Newman-Watts-Strogatz and Barabasi-Albert. Varias optimizaciones para ambos algoritmos han sido implementadas y analizadas en la tesis. En concreto, colapsar los componentes fuertemente conexos del grafo dirigido que se puede construir eliminando ciertas hiperaristas complejas del hipergrafo dirigido original, mejora notablemente los tiempos de ejecucion de los algoritmos para varios de los hipergrafos utilizados en la evaluación. Aparte de los ejemplos de aplicación mencionados anteriormente, los hipergrafos dirigidos han sido también empleados en el área de representación de conocimiento. En concreto, este tipo de hipergrafos se han usado para el cálculo de módulos de ontologías. Una ontología puede ser definida como un conjunto de axiomas que especifican formalmente un conjunto de símbolos y sus relaciones, mientras que un modulo puede ser entendido como un subconjunto de axiomas de la ontología que recoge todo el conocimiento que almacena la ontología sobre un conjunto especifico de símbolos y sus relaciones. En la tesis nos hemos centrado solamente en módulos que han sido calculados usando la técnica de localidad sintáctica. Debido a que las ontologías pueden ser muy grandes, el cálculo de módulos puede facilitar las tareas de re-utilización y mantenimiento de dichas ontologías. Sin embargo, analizar todos los posibles módulos de una ontología es, en general, muy costoso porque el numero de módulos crece de forma exponencial con respecto al número de símbolos y de axiomas de la ontología. Afortunadamente, los axiomas de una ontología pueden ser divididos en particiones conocidas como átomos. Cada átomo representa un conjunto máximo de axiomas que siempre aparecen juntos en un modulo. La decomposición atómica de una ontología es definida como un grafo dirigido de tal forma que cada nodo del grafo corresponde con un átomo y cada arista define una dependencia entre una pareja de átomos. En esta tesis introducimos el concepto de“axiom dependency hypergraph” que generaliza el concepto de descomposición atómica de una ontología. Un modulo en una ontología correspondería con un componente conexo en este tipo de hipergrafos y un átomo de una ontología con un componente fuertemente conexo. Hemos adaptado la implementación de nuestros algoritmos para que funcionen también con axiom dependency hypergraphs y poder de esa forma calcular los átomos de una ontología. Para demostrar la viabilidad de esta idea, hemos incorporado nuestros algoritmos en una aplicación que hemos desarrollado para la extracción de módulos y la descomposición atómica de ontologías. A la aplicación la hemos llamado HyS y hemos estudiado sus tiempos de ejecución usando una selección de ontologías muy conocidas del área biomédica, la mayoría disponibles en el portal de Internet NCBO. Los resultados de la evaluación muestran que los tiempos de ejecución de HyS son mucho mejores que las aplicaciones más rápidas conocidas. ABSTRACT Directed hypergraphs are an intuitive modelling formalism that have been used in problems related to propositional logic, relational databases, computational linguistic and machine learning. Directed hypergraphs are also presented as an alternative to directed (bipartite) graphs to facilitate the study of the interactions between components of complex systems that cannot naturally be modelled as binary relations. In this context, they are known as hyper-networks. A directed hypergraph is a generalization of a directed graph suitable for representing many-to-many relationships. While an edge in a directed graph defines a relation between two nodes of the graph, a hyperedge in a directed hypergraph defines a relation between two sets of nodes. Strong-connectivity is an equivalence relation that induces a partition of the set of nodes of a directed hypergraph into strongly-connected components. These components can be collapsed into single nodes. As result, the size of the original hypergraph can significantly be reduced if the strongly-connected components have many nodes. This approach might contribute to better understand how the nodes of a hypergraph are connected, in particular when the hypergraphs are large. In the case of directed graphs, there are efficient algorithms that can be used to compute the strongly-connected components of large graphs. For instance, it has been shown that the macroscopic structure of the World Wide Web can be represented as a “bow-tie” diagram where more than 70% of the nodes are distributed into three large sets and one of these sets is a large strongly-connected component. This particular structure has been also observed in complex networks in other fields such as, e.g., biology. Similar studies cannot be conducted in a directed hypergraph because there does not exist any algorithm for computing the strongly-connected components of the hypergraph. In this thesis, we investigate ways to compute the strongly-connected components of directed hypergraphs. We present two new algorithms and we show their correctness and computational complexity. One of these algorithms is inspired by Tarjan’s algorithm for directed graphs. The second algorithm follows a simple approach to compute the stronglyconnected components. This approach is based on the fact that two nodes of a graph that are strongly-connected can also reach the same nodes. In other words, the connected component of each node is the same. Both algorithms are empirically evaluated to compare their performances. To this end, we have produced a selection of random directed hypergraphs inspired by existent and well-known random graphs models like Erd˝os-Renyi and Newman-Watts-Strogatz. Besides the application examples that we mentioned earlier, directed hypergraphs have also been employed in the field of knowledge representation. In particular, they have been used to compute the modules of an ontology. An ontology is defined as a collection of axioms that provides a formal specification of a set of terms and their relationships; and a module is a subset of an ontology that completely captures the meaning of certain terms as defined in the ontology. In particular, we focus on the modules computed using the notion of syntactic locality. As ontologies can be very large, the computation of modules facilitates the reuse and maintenance of these ontologies. Analysing all modules of an ontology, however, is in general not feasible as the number of modules grows exponentially in the number of terms and axioms of the ontology. Nevertheless, the modules can succinctly be represented using the Atomic Decomposition of an ontology. Using this representation, an ontology can be partitioned into atoms, which are maximal sets of axioms that co-occur in every module. The Atomic Decomposition is then defined as a directed graph such that each node correspond to an atom and each edge represents a dependency relation between two atoms. In this thesis, we introduce the notion of an axiom dependency hypergraph which is a generalization of the atomic decomposition of an ontology. A module in the ontology corresponds to a connected component in the hypergraph, and the atoms of the ontology to the strongly-connected components. We apply our algorithms for directed hypergraphs to axiom dependency hypergraphs and in this manner, we compute the atoms of an ontology. To demonstrate the viability of this approach, we have implemented the algorithms in the application HyS which computes the modules of ontologies and calculate their atomic decomposition. In the thesis, we provide an experimental evaluation of HyS with a selection of large and prominent biomedical ontologies, most of which are available in the NCBO Bioportal. HyS outperforms state-of-the-art implementations in the tasks of extracting modules and computing the atomic decomposition of these ontologies.

An isoform of the rod photoreceptor cyclic nucleotide-gated channel β subunit expressed in olfactory neurons

Sensory transduction in olfactory neurons involves the activation of a cyclic nucleotide-gated (CNG) channel by cAMP. Previous studies identified a CNG channel α subunit (CNG2) and a β subunit (CNG5), which when heterologously expressed form a channel with properties similar but not identical to those of native olfactory neurons. We have cloned a new type of CNG channel β subunit (CNG4.3) from rat olfactory epithelium. CNG4.3 derives from the same gene as the rod photoreceptor β subunit (CNG4.1) but lacks the long, glutamic acid-rich domain found in the N terminus of CNG4.1. Northern blot and in situ hybridization revealed that CNG4.3 is expressed specifically in olfactory neurons. Expression of CNG4.3 in human embryonic kidney 293 cells did not lead to detectable currents. Coexpression of CNG4.3 with CNG2 induced a current with significantly increased sensitivity for cAMP whereas cGMP affinity was not altered. Additionally, CNG4.3 weakened the outward rectification of the current in the presence of extracellular Ca2+, decreased the relative permeability for Ca2+, and enhanced the sensitivity for l-cis diltiazem. Upon coexpression of CNG2, CNG4.3, and CNG5, a conductance with a cAMP sensitivity greater than that of either the CNG2/CNG4.3 or the CNG2/CNG5 channel and near that of native olfactory channel was observed. Our data suggest that CNG4.3 forms a subunit of the native olfactory CNG channel. The expression of various CNG4 isoforms in retina and olfactory epithelium indicates that the CNG4 subunit may be necessary for normal function of both photoreceptor and olfactory CNG channels.

soc-2 encodes a leucine-rich repeat protein implicated in fibroblast growth factor receptor signaling

Activation of fibroblast growth factor (FGF) receptors elicits diverse cellular responses including growth, mitogenesis, migration, and differentiation. The intracellular signaling pathways that mediate these important processes are not well understood. In Caenorhabditis elegans, suppressors of clr-1 identify genes, termed soc genes, that potentially mediate or activate signaling through the EGL-15 FGF receptor. We demonstrate that three soc genes, soc-1, soc-2, and sem-5, suppress the activity of an activated form of the EGL-15 FGF receptor, consistent with the soc genes functioning downstream of EGL-15. We show that soc-2 encodes a protein composed almost entirely of leucine-rich repeats, a domain implicated in protein–protein interactions. We identified a putative human homolog, SHOC-2, which is 54% identical to SOC-2. We find that shoc-2 maps to 10q25, shoc-2 mRNA is expressed in all tissues assayed, and SHOC-2 protein is cytoplasmically localized. Within the leucine-rich repeats of both SOC-2 and SHOC-2 are two YXNX motifs that are potential tyrosine-phosphorylated docking sites for the SEM-5/GRB2 Src homology 2 domain. However, phosphorylation of these residues is not required for SOC-2 function in vivo, and SHOC-2 is not observed to be tyrosine phosphorylated in response to FGF stimulation. We conclude that this genetic system has allowed for the identification of a conserved gene implicated in mediating FGF receptor signaling in C. elegans.

Structure of the Ets-1 pointed domain and mitogen-activated protein kinase phosphorylation site

The Pointed (PNT) domain and an adjacent mitogen-activated protein (MAP) kinase phosphorylation site are defined by sequence conservation among a subset of ets transcription factors and are implicated in two regulatory strategies, protein interactions and posttranslational modifications, respectively. By using NMR, we have determined the structure of a 110-residue fragment of murine Ets-1 that includes the PNT domain and MAP kinase site. The Ets-1 PNT domain forms a monomeric five-helix bundle. The architecture is distinct from that of any known DNA- or protein-binding module, including the helix-loop-helix fold proposed for the PNT domain of the ets protein TEL. The MAP kinase site is in a highly flexible region of both the unphosphorylated and phosphorylated forms of the Ets-1 fragment. Phosphorylation alters neither the structure nor monomeric state of the PNT domain. These results suggest that the Ets-1 PNT domain functions in heterotypic protein interactions and support the possibility that target recognition is coupled to structuring of the MAP kinase site.

Identification by mass spectrometry of the phosphorylated residue responsible for activation of the catalytic domain of myosin I heavy chain kinase, a member of the PAK/STE20 family

Myosin I heavy chain kinase from Acanthamoeba castellanii is activated in vitro by autophosphorylation (8–10 mol of P per mol). The catalytically active C-terminal domain produced by trypsin cleavage of the phosphorylated kinase contains 2–3 mol of P per mol. However, the catalytic domain expressed in a baculovirus–insect cell system is fully active as isolated without autophosphorylation in vitro. We now show that the expressed catalytic domain is inactivated by incubation with acid phosphatase and regains activity upon autophosphorylation. The state of phosphorylation of all of the hydroxyamino acids in the catalytic domain were determined by mass spectrometry of unfractionated protease digests. Ser-627 was phosphorylated in the active, expressed catalytic domain, lost its phosphate when the protein was incubated with phosphatase, and was rephosphorylated when the dephosphorylated protein was incubated with ATP. No other residue was significantly phosphorylated in any of the three samples. Thus, phosphorylation of Ser-627, which is in the same position as the Ser and Thr residues that are phosphorylated in many other kinases, is necessary and sufficient for full activity of the catalytic domain. Ser-627 is also phosphorylated when full-length, native kinase is activated by autophosphorylation.

Orderly cortical representation of vowels based on formant interaction

Psychophysical experiments have shown that the discrimination of human vowels chiefly relies on the frequency relationship of the first two peaks F1 and F2 of the vowel’s spectral envelope. It has not been possible, however, to relate the two-dimensional (F1,F2)-relationship to the known organization of frequency representation in auditory cortex. We demonstrate that certain spectral integration properties of neurons are topographically organized in primary auditory cortex in such a way that a transformed (F1,F2) relationship sufficient for vowel discrimination is realized.

Proteolytic processing of the Alzheimer disease-associated presenilin-1 generates an in vivo substrate for protein kinase C

The majority of familial Alzheimer disease mutations are linked to the recently cloned presenilin (PS) genes, which encode two highly homologous proteins (PS-1 and PS-2). It was shown that the full-length PS-2 protein is phosphorylated constitutively within its N-terminal domain by casein kinases, whereas the PS-1 protein is not. Full-length PS proteins undergo endoproteolytic cleavage within their hydrophilic loop domain resulting in the formation of ≈20-kDa C-terminal fragments (CTF) and ≈30-kDa N-terminal fragments [Thinakaran, G., et al. (1996) Neuron 17, 181–190]. Here we describe the surprising finding that the CTF of PS-1 is phosphorylated by protein kinase C (PKC). Stimulation of PKC causes a 4- to 5-fold increase of the phosphorylation of the ≈20-kDa CTF of PS-1 resulting in reduced mobility in SDS gels. PKC-stimulated phosphorylation occurs predominantly on serine residues and can be induced either by direct stimulation of PKC with phorbol-12,13-dibutyrate or by activation of the m1 acetylcholine receptor-signaling pathway with the muscarinic agonist carbachol. However, phosphorylation of full-length PS-1 and PS-2 is not altered upon PKC stimulation. In addition, a mutant form of PS-1 lacking exon 10, which does not undergo endoproteolytic cleavage [Thinakaran, G., et al. (1996) Neuron 17, 181–190] is not phosphorylated by PKC, although it still contains all PKC phosphorylation sites conserved between different species. These results show that PKC phosphorylates the PS-1 CTF. Therefore, endoproteolytic cleavage of full-length PS-1 results in the generation of an in vivo substrate for PKC. The selective phosphorylation of the PS-1 CTF indicates that the physiological and/or pathological properties of the CTF are regulated by PKC activity.