A Radio Frequency Identification System for accurate indoor localization

In this paper we present a novel Radio Frequency Identification (RFID) system for accurate indoor localization. The system is composed of a standard Ultra High Frequency (UHF), ISO-18006C compliant RFID reader, a large set of standard passive RFID tags whose locations are known, and a newly developed tag-like RFID component that is attached to the items that need to be localized. The new semi-passive component, referred to as sensatag (sense-a-tag), has a dual functionality wherein it can sense the communication between the reader and standard tags which are in its proximity, and also communicate with the reader like standard tags using backscatter modulation. Based on the information conveyed by the sensatags to the reader, localization algorithms based on binary sensor principles can be developed. We present results from real measurements that show the accuracy of the proposed system.

Distributed collaborative processing in wireless sensor networks with application to target localization and beamforming

Abstract The proliferation of wireless sensor networks and the variety of envisioned applications associated with them has motivated the development of distributed algorithms for collaborative processing over networked systems. One of the applications that has attracted the attention of the researchers is that of target localization where the nodes of the network try to estimate the position of an unknown target that lies within its coverage area. Particularly challenging is the problem of estimating the target’s position when we use received signal strength indicator (RSSI) due to the nonlinear relationship between the measured signal and the true position of the target. Many of the existing approaches suffer either from high computational complexity (e.g., particle filters) or lack of accuracy. Further, many of the proposed solutions are centralized which make their application to a sensor network questionable. Depending on the application at hand and, from a practical perspective it could be convenient to find a balance between localization accuracy and complexity. Into this direction we approach the maximum likelihood location estimation problem by solving a suboptimal (and more tractable) problem. One of the main advantages of the proposed scheme is that it allows for a decentralized implementation using distributed processing tools (e.g., consensus and convex optimization) and therefore, it is very suitable to be implemented in real sensor networks. If further accuracy is needed an additional refinement step could be performed around the found solution. Under the assumption of independent noise among the nodes such local search can be done in a fully distributed way using a distributed version of the Gauss-Newton method based on consensus. Regardless of the underlying application or function of the sensor network it is al¬ways necessary to have a mechanism for data reporting. While some approaches use a special kind of nodes (called sink nodes) for data harvesting and forwarding to the outside world, there are however some scenarios where such an approach is impractical or even impossible to deploy. Further, such sink nodes become a bottleneck in terms of traffic flow and power consumption. To overcome these issues instead of using sink nodes for data reporting one could use collaborative beamforming techniques to forward directly the generated data to a base station or gateway to the outside world. In a dis-tributed environment like a sensor network nodes cooperate in order to form a virtual antenna array that can exploit the benefits of multi-antenna communications. In col-laborative beamforming nodes synchronize their phases in order to add constructively at the receiver. Some of the inconveniences associated with collaborative beamforming techniques is that there is no control over the radiation pattern since it is treated as a random quantity. This may cause interference to other coexisting systems and fast bat-tery depletion at the nodes. Since energy-efficiency is a major design issue we consider the development of a distributed collaborative beamforming scheme that maximizes the network lifetime while meeting some quality of service (QoS) requirement at the re¬ceiver side. Using local information about battery status and channel conditions we find distributed algorithms that converge to the optimal centralized beamformer. While in the first part we consider only battery depletion due to communications beamforming, we extend the model to account for more realistic scenarios by the introduction of an additional random energy consumption. It is shown how the new problem generalizes the original one and under which conditions it is easily solvable. By formulating the problem under the energy-efficiency perspective the network’s lifetime is significantly improved. Resumen La proliferación de las redes inalámbricas de sensores junto con la gran variedad de posi¬bles aplicaciones relacionadas, han motivado el desarrollo de herramientas y algoritmos necesarios para el procesado cooperativo en sistemas distribuidos. Una de las aplicaciones que suscitado mayor interés entre la comunidad científica es la de localization, donde el conjunto de nodos de la red intenta estimar la posición de un blanco localizado dentro de su área de cobertura. El problema de la localization es especialmente desafiante cuando se usan niveles de energía de la seal recibida (RSSI por sus siglas en inglés) como medida para la localization. El principal inconveniente reside en el hecho que el nivel de señal recibida no sigue una relación lineal con la posición del blanco. Muchas de las soluciones actuales al problema de localization usando RSSI se basan en complejos esquemas centralizados como filtros de partículas, mientas que en otras se basan en esquemas mucho más simples pero con menor precisión. Además, en muchos casos las estrategias son centralizadas lo que resulta poco prácticos para su implementación en redes de sensores. Desde un punto de vista práctico y de implementation, es conveniente, para ciertos escenarios y aplicaciones, el desarrollo de alternativas que ofrezcan un compromiso entre complejidad y precisión. En esta línea, en lugar de abordar directamente el problema de la estimación de la posición del blanco bajo el criterio de máxima verosimilitud, proponemos usar una formulación subóptima del problema más manejable analíticamente y que ofrece la ventaja de permitir en¬contrar la solución al problema de localization de una forma totalmente distribuida, convirtiéndola así en una solución atractiva dentro del contexto de redes inalámbricas de sensores. Para ello, se usan herramientas de procesado distribuido como los algorit¬mos de consenso y de optimización convexa en sistemas distribuidos. Para aplicaciones donde se requiera de un mayor grado de precisión se propone una estrategia que con¬siste en la optimización local de la función de verosimilitud entorno a la estimación inicialmente obtenida. Esta optimización se puede realizar de forma descentralizada usando una versión basada en consenso del método de Gauss-Newton siempre y cuando asumamos independencia de los ruidos de medida en los diferentes nodos. Independientemente de la aplicación subyacente de la red de sensores, es necesario tener un mecanismo que permita recopilar los datos provenientes de la red de sensores. Una forma de hacerlo es mediante el uso de uno o varios nodos especiales, llamados nodos “sumidero”, (sink en inglés) que actúen como centros recolectores de información y que estarán equipados con hardware adicional que les permita la interacción con el exterior de la red. La principal desventaja de esta estrategia es que dichos nodos se convierten en cuellos de botella en cuanto a tráfico y capacidad de cálculo. Como alter¬nativa se pueden usar técnicas cooperativas de conformación de haz (beamforming en inglés) de manera que el conjunto de la red puede verse como un único sistema virtual de múltiples antenas y, por tanto, que exploten los beneficios que ofrecen las comu¬nicaciones con múltiples antenas. Para ello, los distintos nodos de la red sincronizan sus transmisiones de manera que se produce una interferencia constructiva en el recep¬tor. No obstante, las actuales técnicas se basan en resultados promedios y asintóticos, cuando el número de nodos es muy grande. Para una configuración específica se pierde el control sobre el diagrama de radiación causando posibles interferencias sobre sis¬temas coexistentes o gastando más potencia de la requerida. La eficiencia energética es una cuestión capital en las redes inalámbricas de sensores ya que los nodos están equipados con baterías. Es por tanto muy importante preservar la batería evitando cambios innecesarios y el consecuente aumento de costes. Bajo estas consideraciones, se propone un esquema de conformación de haz que maximice el tiempo de vida útil de la red, entendiendo como tal el máximo tiempo que la red puede estar operativa garantizando unos requisitos de calidad de servicio (QoS por sus siglas en inglés) que permitan una decodificación fiable de la señal recibida en la estación base. Se proponen además algoritmos distribuidos que convergen a la solución centralizada. Inicialmente se considera que la única causa de consumo energético se debe a las comunicaciones con la estación base. Este modelo de consumo energético es modificado para tener en cuenta otras formas de consumo de energía derivadas de procesos inherentes al funcionamiento de la red como la adquisición y procesado de datos, las comunicaciones locales entre nodos, etc. Dicho consumo adicional de energía se modela como una variable aleatoria en cada nodo. Se cambia por tanto, a un escenario probabilístico que generaliza el caso determinista y se proporcionan condiciones bajo las cuales el problema se puede resolver de forma eficiente. Se demuestra que el tiempo de vida de la red mejora de forma significativa usando el criterio propuesto de eficiencia energética.

A practical approach for outdoors distributed target localization in wireless sensor networks

Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate.

Localization and Tracking in Energy-Constrained Networks with Dynamic Connectivity

Systems used for target localization, such as goods, individuals, or animals, commonly rely on operational means to meet the final application demands. However, what would happen if some means were powered up randomly by harvesting systems? And what if those devices not randomly powered had their duty cycles restricted? Under what conditions would such an operation be tolerable in localization services? What if the references provided by nodes in a tracking problem were distorted? Moreover, there is an underlying topic common to the previous questions regarding the transfer of conceptual models to reality in field tests: what challenges are faced upon deploying a localization network that integrates energy harvesting modules? The application scenario of the system studied is a traditional herding environment of semi domesticated reindeer (Rangifer tarandus tarandus) in northern Scandinavia. In these conditions, information on approximate locations of reindeer is as important as environmental preservation. Herders also need cost-effective devices capable of operating unattended in, sometimes, extreme weather conditions. The analyses developed are worthy not only for the specific application environment presented, but also because they may serve as an approach to performance of navigation systems in absence of reasonably accurate references like the ones of the Global Positioning System (GPS). A number of energy-harvesting solutions, like thermal and radio-frequency harvesting, do not commonly provide power beyond one milliwatt. When they do, battery buffers may be needed (as it happens with solar energy) which may raise costs and make systems more dependent on environmental temperatures. In general, given our problem, a harvesting system is needed that be capable of providing energy bursts of, at least, some milliwatts. Many works on localization problems assume that devices have certain capabilities to determine unknown locations based on range-based techniques or fingerprinting which cannot be assumed in the approach considered herein. The system presented is akin to range-free techniques, but goes to the extent of considering very low node densities: most range-free techniques are, therefore, not applicable. Animal localization, in particular, uses to be supported by accurate devices such as GPS collars which deplete batteries in, maximum, a few days. Such short-life solutions are not particularly desirable in the framework considered. In tracking, the challenge may times addressed aims at attaining high precision levels from complex reliable hardware and thorough processing techniques. One of the challenges in this Thesis is the use of equipment with just part of its facilities in permanent operation, which may yield high input noise levels in the form of distorted reference points. The solution presented integrates a kinetic harvesting module in some nodes which are expected to be a majority in the network. These modules are capable of providing power bursts of some milliwatts which suffice to meet node energy demands. The usage of harvesting modules in the aforementioned conditions makes the system less dependent on environmental temperatures as no batteries are used in nodes with harvesters--it may be also an advantage in economic terms. There is a second kind of nodes. They are battery powered (without kinetic energy harvesters), and are, therefore, dependent on temperature and battery replacements. In addition, their operation is constrained by duty cycles in order to extend node lifetime and, consequently, their autonomy. There is, in turn, a third type of nodes (hotspots) which can be static or mobile. They are also battery-powered, and are used to retrieve information from the network so that it is presented to users. The system operational chain starts at the kinetic-powered nodes broadcasting their own identifier. If an identifier is received at a battery-powered node, the latter stores it for its records. Later, as the recording node meets a hotspot, its full record of detections is transferred to the hotspot. Every detection registry comprises, at least, a node identifier and the position read from its GPS module by the battery-operated node previously to detection. The characteristics of the system presented make the aforementioned operation own certain particularities which are also studied. First, identifier transmissions are random as they depend on movements at kinetic modules--reindeer movements in our application. Not every movement suffices since it must overcome a certain energy threshold. Second, identifier transmissions may not be heard unless there is a battery-powered node in the surroundings. Third, battery-powered nodes do not poll continuously their GPS module, hence localization errors rise even more. Let's recall at this point that such behavior is tight to the aforementioned power saving policies to extend node lifetime. Last, some time is elapsed between the instant an identifier random transmission is detected and the moment the user is aware of such a detection: it takes some time to find a hotspot. Tracking is posed as a problem of a single kinetically-powered target and a population of battery-operated nodes with higher densities than before in localization. Since the latter provide their approximate positions as reference locations, the study is again focused on assessing the impact of such distorted references on performance. Unlike in localization, distance-estimation capabilities based on signal parameters are assumed in this problem. Three variants of the Kalman filter family are applied in this context: the regular Kalman filter, the alpha-beta filter, and the unscented Kalman filter. The study enclosed hereafter comprises both field tests and simulations. Field tests were used mainly to assess the challenges related to power supply and operation in extreme conditions as well as to model nodes and some aspects of their operation in the application scenario. These models are the basics of the simulations developed later. The overall system performance is analyzed according to three metrics: number of detections per kinetic node, accuracy, and latency. The links between these metrics and the operational conditions are also discussed and characterized statistically. Subsequently, such statistical characterization is used to forecast performance figures given specific operational parameters. In tracking, also studied via simulations, nonlinear relationships are found between accuracy and duty cycles and cluster sizes of battery-operated nodes. The solution presented may be more complex in terms of network structure than existing solutions based on GPS collars. However, its main gain lies on taking advantage of users' error tolerance to reduce costs and become more environmentally friendly by diminishing the potential amount of batteries that can be lost. Whether it is applicable or not depends ultimately on the conditions and requirements imposed by users' needs and operational environments, which is, as it has been explained, one of the topics of this Thesis.

Nonparametric generalized belief propagation based on pseudo-junction tree for cooperative localization in wireless networks

Non-parametric belief propagation (NBP) is a well-known message passing method for cooperative localization in wireless networks. However, due to the over-counting problem in the networks with loops, NBP’s convergence is not guaranteed, and its estimates are typically less accurate. One solution for this problem is non-parametric generalized belief propagation based on junction tree. However, this method is intractable in large-scale networks due to the high-complexity of the junction tree formation, and the high-dimensionality of the particles. Therefore, in this article, we propose the non-parametric generalized belief propagation based on pseudo-junction tree (NGBP-PJT). The main difference comparing with the standard method is the formation of pseudo-junction tree, which represents the approximated junction tree based on thin graph. In addition, in order to decrease the number of high-dimensional particles, we use more informative importance density function, and reduce the dimensionality of the messages. As by-product, we also propose NBP based on thin graph (NBP-TG), a cheaper variant of NBP, which runs on the same graph as NGBP-PJT. According to our simulation and experimental results, NGBP-PJT method outperforms NBP and NBP-TG in terms of accuracy, computational, and communication cost in reasonably sized networks.

Human carbonic anhydrase XII: cDNA cloning, expression, and chromosomal localization of a carbonic anhydrase gene that is overexpressed in some renal cell cancers

We report the cloning and characterization of a tumor-associated carbonic anhydrase (CA) that was identified in a human renal cell carcinoma (RCC) by serological expression screening with autologous antibodies. The cDNA sequence predicts a 354-amino acid polypeptide with a molecular mass of 39,448 Da that has features of a type I membrane protein. The predicted sequence includes a 29-amino acid signal sequence, a 261-amino acid CA domain, an additional short extracellular segment, a 26-amino acid hydrophobic transmembrane domain, and a hydrophilic C-terminal cytoplasmic tail of 29 amino acids that contains two potential phosphorylation sites. The extracellular CA domain shows 30–42% homology with known human CAs, contains all three Zn-binding histidine residues found in active CAs, and contains two potential sites for asparagine glycosylation. When expressed in COS cells, the cDNA produced a 43- to 44-kDa protein in membranes that had around one-sixth the CA activity of membranes from COS cells transfected with the same vector expressing bovine CA IV. We have designated this human protein CA XII. Northern blot analysis of normal tissues demonstrated a 4.5-kb transcript only in kidney and intestine. However, in 10% of patients with RCC, the CA XII transcript was expressed at much higher levels in the RCC than in surrounding normal kidney tissue. The CA XII gene was mapped by using fluorescence in situ hybridization to 15q22. CA XII is the second catalytically active membrane CA reported to be overexpressed in certain cancers. Its relationship to oncogenesis and its potential as a clinically useful tumor marker clearly merit further investigation.

Mitochondrial localization of a NADR-dependent isocitrate dehydrogenase isoenzyme by using the green fluorescent protein as a marker

In this work, we describe the isolation of a new cDNA encoding an NADP-dependent isocitrate dehydrogenase (ICDH). The nucleotide sequence in its 5′ region gives a deduced amino acid sequence indicative of a targeting peptide. However, even if this cDNA clearly encodes a noncytosolic ICDH, it is not possible to say from the targeting peptide sequence to which subcellular compartment the protein is addressed. To respond to this question, we have transformed tobacco plants with a construct containing the entire targeting signal-encoding sequence in front of a modified green fluorescent protein (GFP) gene. This construct was placed under the control of the cauliflower mosaic virus 35S promoter, and transgenic tobacco plants were regenerated. At the same time, and as a control, we also have transformed tobacco plants with the same construct but lacking the nucleotide sequence corresponding to the ICDH-targeting peptide, in which the GFP is retained in the cytoplasm. By optical and confocal microscopy of leaf epiderm and Western blot analyses, we show that the putative-targeting sequence encoded by the cDNA addresses the GFP exclusively into the mitochondria of plant cells. Therefore, we conclude that this cDNA encodes a mitochondrial ICDH.

A transformation-associated complex involving tyrosine kinase signal adapter proteins and caldesmon links v-ErbB signaling to actin stress fiber disassembly

The avian erythroblastosis viral oncogene (v-erbB) encodes a receptor tyrosine kinase that possesses sarcomagenic and leukemogenic potential. We have expressed transforming and nontransforming mutants of v-erbB in fibroblasts to detect transformation-associated signal transduction events. Coimmunoprecipitation and affinity chromatography have been used to identify a transformation-associated, tyrosine phosphorylated, multiprotein complex. This complex consists of Src homologous collagen protein (Shc), growth factor receptor binding protein 2 (Grb2), son of sevenless (Sos), and a novel tyrosine phosphorylated form of the cytoskeletal regulatory protein caldesmon. Immunofluorescence localization studies further reveal that, in contrast to the distribution of caldesmon along actin stress fibers in normal fibroblasts, caldesmon colocalizes with Shc in plasma membrane blebs in transformed fibroblasts. This colocalization of caldesmon and Shc correlates with actin stress fiber disassembly and v-erbB-mediated transformation. The tyrosine phosphorylation of caldesmon, and its association with the Shc–Grb2–Sos signaling complex directly links tyrosine kinase oncogenic signaling events with cytoskeletal regulatory processes, and may define one mechanism regulating actin stress fiber disassembly in transformed cells.

An alternative pathway for rod signals in the rodent retina: Rod photoreceptors, cone bipolar cells, and the localization of glutamate receptors

In the mammalian retina, extensive processing of spatiotemporal and chromatic information occurs. One key principle in signal transfer through the retina is parallel processing. Two of these parallel pathways are the ON- and OFF-channels transmitting light and dark signals. This dual system is created in the outer plexiform layer, the first relay station in retinal signal transfer. Photoreceptors release glutamate onto ON- and OFF-type bipolar cells, which are functionally distinguished by their postsynaptic expression of different types of glutamate receptors, namely ionotropic and metabotropic glutamate receptors. In the current concept, rod photoreceptors connect only to rod bipolar cells (ON-type) and cone photoreceptors connect only to cone bipolar cells (ON- and OFF-type). We have studied the distribution of (RS)-α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid (AMPA) glutamate receptor subunits at the synapses in the outer plexiform layer of the rodent retina by immunoelectron microscopy and serial section reconstruction. We report a non-classical synaptic contact and an alternative pathway for rod signals in the retina. Rod photoreceptors made synaptic contact with putative OFF-cone bipolar cells that expressed the AMPA glutamate receptor subunits GluR1 and GluR2 on their dendrites. Thus, in the retina of mouse and rat, an alternative pathway for rod signals exists, where rod photoreceptors bypass the rod bipolar cell and directly excite OFF-cone bipolar cells through an ionotropic sign-conserving AMPA glutamate receptor.

A Modulatory Role for Clathrin Light Chain Phosphorylation in Golgi Membrane Protein Localization during Vegetative Growth and during the Mating Response of Saccharomyces cerevisiae

The role of clathrin light chain phosphorylation in regulating clathrin function has been examined in Saccharomyces cerevisiae. The phosphorylation state of yeast clathrin light chain (Clc1p) in vivo was monitored by [32P]phosphate labeling and immunoprecipitation. Clc1p was phosphorylated in growing cells and also hyperphosphorylated upon activation of the mating response signal transduction pathway. Mating pheromone-stimulated hyperphosphorylation of Clc1p was dependent on the mating response signal transduction pathway MAP kinase Fus3p. Both basal and stimulated phosphorylation occurred exclusively on serines. Mutagenesis of Clc1p was used to map major phosphorylation sites to serines 52 and 112, but conversion of all 14 serines in Clc1p to alanines [S(all)A] was necessary to eliminate phosphorylation. Cells expressing the S(all)A mutant Clc1p displayed no defects in Clc1p binding to clathrin heavy chain, clathrin trimer stability, sorting of a soluble vacuolar protein, or receptor-mediated endocytosis of mating pheromone. However, the trans-Golgi network membrane protein Kex2p was not optimally localized in mutant cells. Furthermore, pheromone treatment exacerbated the Kex2p localization defect and caused a corresponding defect in Kex2p-mediated maturation of the α-factor precursor. The results reveal a novel requirement for clathrin during the mating response and suggest that phosphorylation of the light chain subunit modulates the activity of clathrin at the trans-Golgi network.

Plasma Membrane Localization of Gαz Requires Two Signals

Three covalent attachments anchor heterotrimeric G proteins to cellular membranes: the α subunits are myristoylated and/or palmitoylated, whereas the γ chain is prenylated. Despite the essential role of these modifications in membrane attachment, it is not clear how they cooperate to specify G protein localization at the plasma membrane, where the G protein relays signals from cell surface receptors to intracellular effector molecules. To explore this question, we studied the effects of mutations that prevent myristoylation and/or palmitoylation of an epitope-labeled α subunit, αz. Wild-type αz (αz-WT) localizes specifically at the plasma membrane. A mutant that incorporates only myristate is mistargeted to intracellular membranes, in addition to the plasma membrane, but transduces hormonal signals as well as does αz-WT. Removal of the myristoylation site produced a mutant αz that is located in the cytosol, is not efficiently palmitoylated, and does not relay the hormonal signal. Coexpression of βγ with this myristoylation defective mutant transfers it to the plasma membrane, promotes its palmitoylation, and enables it to transmit hormonal signals. Pulse-chase experiments show that the palmitate attached to this myristoylation-defective mutant turns over much more rapidly than does palmitate on αz-WT, and that the rate of turnover is further accelerated by receptor activation. In contrast, receptor activation does not increase the slow rate of palmitate turnover on αz-WT. Together these results suggest that myristate and βγ promote stable association with membranes not only by providing hydrophobicity, but also by stabilizing attachment of palmitate. Moreover, palmitoylation confers on αz specific localization at the plasma membrane.

Tyrosine Phosphorylation Regulates Cell Cycle-dependent Nuclear Localization of Cdc48p

Cdc48p from Saccharomyces cerevisiae and its highly conserved mammalian homologue VCP (valosin-containing protein) are ATPases with essential functions in cell division and homotypic fusion of endoplasmic reticulum vesicles. Both are mainly attached to the endoplasmic reticulum, but relocalize in a cell cycle-dependent manner: Cdc48p enters the nucleus during late G1; VCP aggregates at the centrosome during mitosis. The nuclear import signal sequence of Cdc48p was localized near the amino terminus and its function demonstrated by mutagenesis. The nuclear import is regulated by a cell cycle-dependent phosphorylation of a tyrosine residue near the carboxy terminus. Two-hybrid studies indicate that the phosphorylation results in a conformational change of the protein, exposing the nuclear import signal sequence previously masked by a stretch of acidic residues.

Characterization of Fus3 Localization: Active Fus3 Localizes in Complexes of Varying Size and Specific Activity

The MAP kinase Fus3 regulates many different signal transduction outputs that govern the ability of Saccharomyces cerevisiae haploid cells to mate. Here we characterize Fus3 localization and association with other proteins. By indirect immunofluorescence, Fus3 localizes in punctate spots throughout the cytoplasm and nucleus, with slightly enhanced nuclear localization after pheromone stimulation. This broad distribution is consistent with the critical role Fus3 plays in mating and contrasts that of Kss1, which concentrates in the nucleus and is not required for mating. The majority of Fus3 is soluble and not bound to any one protein; however, a fraction is stably bound to two proteins of ∼60 and ∼70 kDa. Based on fractionation and gradient density centrifugation properties, Fus3 exists in a number of complexes, with its activity critically dependent upon association with other proteins. In the presence of α factor, nearly all of the active Fus3 localizes in complexes of varying size and specific activity, whereas monomeric Fus3 has little activity. Fus3 has highest specific activity within a 350- to 500-kDa complex previously shown to contain Ste5, Ste11, and Ste7. Ste5 is required for Fus3 to exist in this complex. Upon α factor withdrawal, a pool of Fus3 retains activity for more than one cell cycle. Collectively, these results support Ste5’s role as a tether and suggest that association of Fus3 in complexes in the presence of pheromone may prevent inactivation in addition to enhancing activation.

Serine and Threonine Phosphorylation of the Paxillin LIM Domains Regulates Paxillin Focal Adhesion Localization and Cell Adhesion to Fibronectin

We have previously shown that the LIM domains of paxillin operate as the focal adhesion (FA)-targeting motif of this protein. In the current study, we have identified the capacity of paxillin LIM2 and LIM3 to serve as binding sites for, and substrates of serine/threonine kinases. The activities of the LIM2- and LIM3-associated kinases were stimulated after adhesion of CHO.K1 cells to fibronectin; consequently, a role for LIM domain phosphorylation in regulating the subcellular localization of paxillin after adhesion to fibronectin was investigated. An avian paxillin-CHO.K1 model system was used to explore the role of paxillin phosphorylation in paxillin localization to FAs. We found that mutations of paxillin that mimicked LIM domain phosphorylation accelerated fibronectin-induced localization of paxillin to focal contacts. Further, blocking phosphorylation of the LIM domains reduced cell adhesion to fibronectin, whereas constitutive LIM domain phosphorylation significantly increased the capacity of cells to adhere to fibronectin. The potentiation of FA targeting and cell adhesion to fibronectin was specific to LIM domain phosphorylation as mutation of the amino-terminal tyrosine and serine residues of paxillin that are phosphorylated in response to fibronectin adhesion had no effect on the rate of FA localization or cell adhesion. This represents the first demonstration of the regulation of protein localization through LIM domain phosphorylation and suggests a novel mechanism of regulating LIM domain function. Additionally, these results provide the first evidence that paxillin contributes to “inside-out” integrin-mediated signal transduction.

Functional Roles for Fatty Acylated Amino-terminal Domains in Subcellular Localization

Several membrane-associating signals, including covalently linked fatty acids, are found in various combinations at the N termini of signaling proteins. The function of these combinations was investigated by appending fatty acylated N-terminal sequences to green fluorescent protein (GFP). Myristoylated plus mono/dipalmitoylated GFP chimeras and a GFP chimera containing a myristoylated plus a polybasic domain were localized similarly to the plasma membrane and endosomal vesicles, but not to the nucleus. Myristoylated, nonpalmitoylated mutant chimeric GFPs were localized to intracellular membranes, including endosomes and the endoplasmic reticulum, and were absent from the plasma membrane, the Golgi, and the nucleus. Dually palmitoylated GFP was localized to the plasma membrane and the Golgi region, but it was not detected in endosomes. Nonacylated GFP chimeras, as well as GFP, showed cytosolic and nuclear distribution. Our results demonstrate that myristoylation is sufficient to exclude GFP from the nucleus and associate with intracellular membranes, but plasma membrane localization requires a second signal, namely palmitoylation or a polybasic domain. The similarity in localization conferred by the various myristoylated and palmitoylated/polybasic sequences suggests that biophysical properties of acylated sequences and biological membranes are key determinants in proper membrane selection. However, dual palmitoylation in the absence of myristoylation conferred significant differences in localization, suggesting that multiple palmitoylation sites and/or enzymes may exist.