Logarithmical hopping encoding: a low computational complexity algorithm for image compression

LHE (logarithmical hopping encoding) is a computationally efficient image compression algorithm that exploits the Weber–Fechner law to encode the error between colour component predictions and the actual value of such components. More concretely, for each pixel, luminance and chrominance predictions are calculated as a function of the surrounding pixels and then the error between the predictions and the actual values are logarithmically quantised. The main advantage of LHE is that although it is capable of achieving a low-bit rate encoding with high quality results in terms of peak signal-to-noise ratio (PSNR) and image quality metrics with full-reference (FSIM) and non-reference (blind/referenceless image spatial quality evaluator), its time complexity is O( n) and its memory complexity is O(1). Furthermore, an enhanced version of the algorithm is proposed, where the output codes provided by the logarithmical quantiser are used in a pre-processing stage to estimate the perceptual relevance of the image blocks. This allows the algorithm to downsample the blocks with low perceptual relevance, thus improving the compression rate. The performance of LHE is especially remarkable when the bit per pixel rate is low, showing much better quality, in terms of PSNR and FSIM, than JPEG and slightly lower quality than JPEG-2000 but being more computationally efficient.

Extending the expressiveness of fuzzy logic languages

En el trabajo que aquí presentamos se incluye la base teórica (sintaxis y semántica) y una implementación de un framework para codificar el razonamiento de la representación difusa o borrosa del mundo (tal y como nosotros, seres humanos, entendemos éste). El interés en la realización de éste trabajo parte de dos fuentes: eliminar la complejidad existente cuando se realiza una implementación con un lenguaje de programación de los llamados de propósito general y proporcionar una herramienta lo suficientemente inteligente para dar respuestas de forma constructiva a consultas difusas o borrosas. El framework, RFuzzy, permite codificar reglas y consultas en una sintaxis muy cercana al lenguaje natural usado por los seres humanos para expresar sus pensamientos, pero es bastante más que eso. Permite representar conceptos muy interesantes, como fuzzificaciones (funciones usadas para convertir conceptos no difusos en difusos), valores por defecto (que se usan para devolver resultados un poco menos válidos que los que devolveríamos si tuviésemos la información necesaria para calcular los más válidos), similaridad entre atributos (característica que utilizamos para buscar aquellos individuos en la base de datos con una característica similar a la buscada), sinónimos o antónimos y, además, nos permite extender el numero de conectivas y modificadores (incluyendo modificadores de negación) que podemos usar en las reglas y consultas. La personalización de la definición de conceptos difusos (muy útil para lidiar con el carácter subjetivo de los conceptos borrosos, donde nos encontramos con que cualificar a alguien de “alto” depende de la altura de la persona que cualifica) es otra de las facilidades incluida. Además, RFuzzy implementa la semántica multi-adjunta. El interés en esta reside en que introduce la posibilidad de obtener la credibilidad de una regla a partir de un conjunto de datos y una regla dada y no solo el grado de satisfacción de una regla a partir de el universo modelado en nuestro programa. De esa forma podemos obtener automáticamente la credibilidad de una regla para una determinada situación. Aún cuando la contribución teórica de la tesis es interesante en si misma, especialmente la inclusión del modificador de negacion, sus multiples usos practicos lo son también. Entre los diferentes usos que se han dado al framework destacamos el reconocimiento de emociones, el control de robots, el control granular en computacion paralela/distribuída y las busquedas difusas o borrosas en bases de datos. ABSTRACT In this work we provide a theoretical basis (syntax and semantics) and a practical implementation of a framework for encoding the reasoning and the fuzzy representation of the world (as human beings understand it). The interest for this work comes from two sources: removing the existing complexity when doing it with a general purpose programming language (one developed without focusing in providing special constructions for representing fuzzy information) and providing a tool intelligent enough to answer, in a constructive way, expressive queries over conventional data. The framework, RFuzzy, allows to encode rules and queries in a syntax very close to the natural language used by human beings to express their thoughts, but it is more than that. It allows to encode very interesting concepts, as fuzzifications (functions to easily fuzzify crisp concepts), default values (used for providing results less adequate but still valid when the information needed to provide results is missing), similarity between attributes (used to search for individuals with a characteristic similar to the one we are looking for), synonyms or antonyms and it allows to extend the number of connectives and modifiers (even negation) we can use in the rules. The personalization of the definition of fuzzy concepts (very useful for dealing with the subjective character of fuzziness, in which a concept like tall depends on the height of the person performing the query) is another of the facilities included. Besides, RFuzzy implements the multi-adjoint semantics. The interest in them is that in addition to obtaining the grade of satisfaction of a consequent from a rule, its credibility and the grade of satisfaction of the antecedents we can determine from a set of data how much credibility we must assign to a rule to model the behaviour of the set of data. So, we can determine automatically the credibility of a rule for a particular situation. Although the theoretical contribution is interesting by itself, specially the inclusion of the negation modifier, the practical usage of it is equally important. Between the different uses given to the framework we highlight emotion recognition, robocup control, granularity control in parallel/distributed computing and flexible searches in databases.

Image processing methods for human brain connectivity analysis from in-vivo diffusion MRI

The structural connectivity of the brain is considered to encode species-wise and subject-wise patterns that will unlock large areas of understanding of the human brain. Currently, diffusion MRI of the living brain enables to map the microstructure of tissue, allowing to track the pathways of fiber bundles connecting the cortical regions across the brain. These bundles are summarized in a network representation called connectome that is analyzed using graph theory. The extraction of the connectome from diffusion MRI requires a large processing flow including image enhancement, reconstruction, segmentation, registration, diffusion tracking, etc. Although a concerted effort has been devoted to the definition of standard pipelines for the connectome extraction, it is still crucial to define quality assessment protocols of these workflows. The definition of quality control protocols is hindered by the complexity of the pipelines under test and the absolute lack of gold-standards for diffusion MRI data. Here we characterize the impact on structural connectivity workflows of the geometrical deformation typically shown by diffusion MRI data due to the inhomogeneity of magnetic susceptibility across the imaged object. We propose an evaluation framework to compare the existing methodologies to correct for these artifacts including whole-brain realistic phantoms. Additionally, we design and implement an image segmentation and registration method to avoid performing the correction task and to enable processing in the native space of diffusion data. We release PySDCev, an evaluation framework for the quality control of connectivity pipelines, specialized in the study of susceptibility-derived distortions. In this context, we propose Diffantom, a whole-brain phantom that provides a solution to the lack of gold-standard data. The three correction methodologies under comparison performed reasonably, and it is difficult to determine which method is more advisable. We demonstrate that susceptibility-derived correction is necessary to increase the sensitivity of connectivity pipelines, at the cost of specificity. Finally, with the registration and segmentation tool called regseg we demonstrate how the problem of susceptibility-derived distortion can be overcome allowing data to be used in their original coordinates. This is crucial to increase the sensitivity of the whole pipeline without any loss in specificity.

Un estudio del adjetivo en un corpus de textos escritos en inglés y español pertenecientes al discurso de especialidad de las Tecnologías de la Información y las Comunicaciones

Esta investigación se enmarca dentro de los denominados lenguajes de especialidad que para esta tesis será el de las Tecnologías de la Información y la Comunicación (TIC). De todos los aspectos relacionados con el estudio de estos lenguajes que pudieran tener interés lingüístico ha primado el análisis del componente terminológico. Tradicionalmente la conceptualización de un campo del saber se representaba mayoritariamente a través del elemento nominal, así lo defiende la Teoría General de la Terminología (Wüster, 1968). Tanto la lexicología como la lexicografía han aportado importantes contribuciones a los estudios terminológicos para la identificación del componente léxico a través del cual se transmite la información especializada. No obstante esos primeros estudios terminológicos que apuntaban al sustantivo como elmentos denominativo-conceptual, otras teorías más recientes, entre las que destacamos la Teoría Comunicativa de la Terminología (Cabré, 1999) identifican otras estructuras morfosintácticas integradas por otros elementos no nominales portadores igualmente de esa carga conceptual. A partir de esta consideración, hemos seleccionado para este estudio el adjetivo relacional en tanto que representa otra categoría gramatical distinta al sustantivo y mantiene un vínculo con éste debido a su procedencia. Todo lo cual puede suscitar cierto interés terminológico. A través de esta investigación, nos hemos propuesto demostrar las siguientes hipótesis: 1. El adjetivo relacional aporta contenido especializado en su asociación con el componente nominal. 2. El adjetivo relacional es portador de un valor semántico que hace posible identificar con más precisión la relación conceptual de los elementos -adjetivo y sustantivo - de la combinación léxica resultante, especialmente en algunas formaciones ambiguas. 3. El adjetivo relacional, como modificador natural del sustantivo al que acompaña, podría imponer cierta restricción en sus combinaciones y, por tanto, hacer una selección discriminada de los integrantes de la combinación léxica especializada. Teniendo en cuenta las anteriores hipótesis, esta investigación ha delimitado y caracterizado el segmento léxico objeto de estudio: la ‘combinación léxica especializada (CLE)’ formalmente representada por la estructura sintáctica [adjR+n], en donde adjR es el adjetivo y n el sustantivo al que acompaña. De igual forma hemos descrito el marco teórico desde el que abordar nuestro análisis. Se trata de la teoría del Lexicón Generatvio (LG) y de la representación semántica (Pustojovsky, 1995) que propone como explicación de la generación de significados. Hemos analizado las distintas estructuras de representación léxica y en especial la estructura qualia a través de la cual hemos identificado la relación semántica que mantienen los dos ítems léxicos [adjR+n] de la estructura sintáctica de nuestro estudio. El estudio semántico de las dos piezas léxicas ha permitido, además, comprobar el valor denominativo del adjetivo en la combinación. Ha sido necesario elaborar un corpus de textos escritos en inglés y español pertenecientes al discurso de especialidad de las TIC. Este material ha sido procesado para nuestros fines utilizando distintas herramientas electrónicas. Se ha hecho uso de lexicones electrónicos, diccionarios online generales y de especialidad y corpus de referencia online, estos últimos para poder eventualmente validad nuetros datos. Asimismo se han utilizado motores de búsqueda, entre ellos WordNet Search 3.1, para obtener la información semántica de nuestros elementos léxicos. Nuestras conclusiones han corroborado las hipótesis que se planteaban en esta tesis, en especial la referente al valor denominativo-conceptual del adjetivo relacional el cual, junto con el sustantivo al que acompaña, forma parte de la representación cognitiva del lenguaje de especialidad de las TIC. Como continuación a este estudio se proponen sugerencias sobre líneas futuras de investigación así como el diseño de herramientas informáticas que pudieran incorporar estos datos semánticos como complemento de los ítems léxicos dotados de valor denominativo-conceptual. ABSTRACT This research falls within the field of the so-called Specialized Languages which for the purpose of this study is the Information and Communication Technology (ICT) discourse. Considering their several distinguishing features terminology concentrates our interest from the point of view of linguistics. It is broadly assumed that terms represent concepts of a subject field. For the classical view of terminology (Wüster, 1968) these terms are formally represented by nouns. Both lexicology and terminology have made significant contributions to the study of terms. Later research as well as other theories on Terminology such as the Communicative Theory of Terminology (Cabré, 1993) have shown that other lexical units can also represent knowledge organization. On these bases, we have focused our research on the relational adjective which represents a functional unit different from a noun while still connected to the noun by means of its nominal root. This may have a potential terminological interest. Therefore the present research is based on the next hypotheses: 1. The relational adjective conveys specialized information when combined with the noun. 2. The relational adjective has a semantic meaning which helps understand the conceptual relationship between the adjective and the noun being modified and disambiguate certain senses of the resulting lexical combination. 3. The relational adjective may impose some restrictions when choosing the nouns it modifies. Considering the above hypotheses, this study has identified and described a multi-word lexical unit pattern [Radj+n] referred to as a Specialized Lexical Combination (SLC) linguistically realized by a relational adjective, Radj, and a noun, n. The analysis of such a syntactic pattern is addressed from the framework of the Generative Lexicon (Pustojovsky, 1995). Such theory provides several levels of semantic description which help lexical decomposition performed generatively. These levels of semantic representation are connected through generative operations or generative devices which account for the compositional interpretation of any linguistic utterance in a given context. This study analyses these different levels and focuses on one of them, i.e. the qualia structure since it may encode the conceptual meaning of the syntactic pattern [Radj+n]. The semantic study of these two lexical items has ultimately confirmed the conceptual meaning of the relational adjective. A corpus made of online ICT articles from magazines written in English and Spanish – some being their translations - has been used for the word extraction. For this purpose some word processing software packages have been employed. Moreover online general language and specialized language dictionaries have been consulted. Search engines, namely WordNet Search 3.1, have been also exploited to find the semantic information of our lexical units. Online reference corpora in English and Spanish have been used for a contrastive analysis of our data. Finally our conclusions have confirmed our initial hypotheses, i.e. relational adjectives are specialized lexical units which together with the nouns are part of the knowledge representation of the ICT subject field. Proposals for new research have been made together with some other suggestions for the design of computer applications to visually show the conceptual meaning of certain lexical units.

Nepfix: on-demand cloud elastic simulation of networks of evolutionary processors

Una Red de Procesadores Evolutivos o NEP (por sus siglas en ingles), es un modelo computacional inspirado por el modelo evolutivo de las celulas, específicamente por las reglas de multiplicación de las mismas. Esta inspiración hace que el modelo sea una abstracción sintactica de la manipulation de information de las celulas. En particu¬lar, una NEP define una maquina de cómputo teorica capaz de resolver problemas NP completos de manera eficiente en tóerminos de tiempo. En la praóctica, se espera que las NEP simuladas en móaquinas computacionales convencionales puedan resolver prob¬lemas reales complejos (que requieran ser altamente escalables) a cambio de una alta complejidad espacial. En el modelo NEP, las cóelulas estóan representadas por palabras que codifican sus secuencias de ADN. Informalmente, en cualquier momento de cómputo del sistema, su estado evolutivo se describe como un coleccion de palabras, donde cada una de ellas representa una celula. Estos momentos fijos de evolucion se denominan configuraciones. De manera similar al modelo biologico, las palabras (celulas) mutan y se dividen en base a bio-operaciones sencillas, pero solo aquellas palabras aptas (como ocurre de forma parecida en proceso de selection natural) seran conservadas para la siguiente configuracióon. Una NEP como herramienta de computation, define una arquitectura paralela y distribuida de procesamiento simbolico, en otras palabras, una red de procesadores de lenguajes. Desde el momento en que el modelo fue propuesto a la comunidad científica en el año 2001, múltiples variantes se han desarrollado y sus propiedades respecto a la completitud computacional, eficiencia y universalidad han sido ampliamente estudiadas y demostradas. En la actualidad, por tanto, podemos considerar que el modelo teórico NEP se encuentra en el estadio de la madurez. La motivación principal de este Proyecto de Fin de Grado, es proponer una aproxi-mación práctica que permita dar un salto del modelo teórico NEP a una implantación real que permita su ejecucion en plataformas computacionales de alto rendimiento, con el fin de solucionar problemas complejos que demanda la sociedad actual. Hasta el momento, las herramientas desarrolladas para la simulation del modelo NEP, si bien correctas y con resultados satisfactorios, normalmente estón atadas a su entorno de ejecucion, ya sea el uso de hardware específico o implementaciones particulares de un problema. En este contexto, el propósito fundamental de este trabajo es el desarrollo de Nepfix, una herramienta generica y extensible para la ejecucion de cualquier algo¬ritmo de un modelo NEP (o alguna de sus variantes), ya sea de forma local, como una aplicación tradicional, o distribuida utilizando los servicios de la nube. Nepfix es una aplicacion software desarrollada durante 7 meses y que actualmente se encuentra en su segunda iteration, una vez abandonada la fase de prototipo. Nepfix ha sido disenada como una aplicacion modular escrita en Java 8 y autocontenida, es decir, no requiere de un entorno de ejecucion específico (cualquier maquina virtual de Java es un contenedor vólido). Nepfix contiene dos componentes o móodulos. El primer móodulo corresponde a la ejecución de una NEP y es por lo tanto, el simulador. Para su desarrollo, se ha tenido en cuenta el estado actual del modelo, es decir, las definiciones de los procesadores y filtros mas comunes que conforman la familia del modelo NEP. Adicionalmente, este componente ofrece flexibilidad en la ejecucion, pudiendo ampliar las capacidades del simulador sin modificar Nepfix, usando para ello un lenguaje de scripting. Dentro del desarrollo de este componente, tambióen se ha definido un estóandar de representacióon del modelo NEP basado en el formato JSON y se propone una forma de representation y codificación de las palabras, necesaria para la comunicación entre servidores. Adicional-mente, una característica importante de este componente, es que se puede considerar una aplicacion aislada y por tanto, la estrategia de distribution y ejecución son total-mente independientes. El segundo moódulo, corresponde a la distribucióon de Nepfix en la nube. Este de-sarrollo es el resultado de un proceso de i+D, que tiene una componente científica considerable. Vale la pena resaltar el desarrollo de este modulo no solo por los resul-tados prócticos esperados, sino por el proceso de investigation que se se debe abordar con esta nueva perspectiva para la ejecución de sistemas de computación natural. La principal característica de las aplicaciones que se ejecutan en la nube es que son gestionadas por la plataforma y normalmente se encapsulan en un contenedor. En el caso de Nepfix, este contenedor es una aplicacion Spring que utiliza el protocolo HTTP o AMQP para comunicarse con el resto de instancias. Como valor añadido, Nepfix aborda dos perspectivas de implementation distintas (que han sido desarrolladas en dos iteraciones diferentes) del modelo de distribution y ejecucion, que tienen un impacto muy significativo en las capacidades y restricciones del simulador. En concreto, la primera iteration utiliza un modelo de ejecucion asincrono. En esta perspectiva asincrona, los componentes de la red NEP (procesadores y filtros) son considerados como elementos reactivos a la necesidad de procesar una palabra. Esta implementation es una optimization de una topologia comun en el modelo NEP que permite utilizar herramientas de la nube para lograr un escalado transparente (en lo ref¬erente al balance de carga entre procesadores) pero produce efectos no deseados como indeterminacion en el orden de los resultados o imposibilidad de distribuir eficiente-mente redes fuertemente interconectadas. Por otro lado, la segunda iteration corresponde al modelo de ejecucion sincrono. Los elementos de una red NEP siguen un ciclo inicio-computo-sincronizacion hasta que el problema se ha resuelto. Esta perspectiva sincrona representa fielmente al modelo teórico NEP pero el proceso de sincronizacion es costoso y requiere de infraestructura adicional. En concreto, se requiere un servidor de colas de mensajes RabbitMQ. Sin embargo, en esta perspectiva los beneficios para problemas suficientemente grandes superan a los inconvenientes, ya que la distribuciín es inmediata (no hay restricciones), aunque el proceso de escalado no es trivial. En definitiva, el concepto de Nepfix como marco computacional se puede considerar satisfactorio: la tecnología es viable y los primeros resultados confirman que las carac-terísticas que se buscaban originalmente se han conseguido. Muchos frentes quedan abiertos para futuras investigaciones. En este documento se proponen algunas aproxi-maciones a la solucion de los problemas identificados como la recuperacion de errores y la division dinamica de una NEP en diferentes subdominios. Por otra parte, otros prob-lemas, lejos del alcance de este proyecto, quedan abiertos a un futuro desarrollo como por ejemplo, la estandarización de la representación de las palabras y optimizaciones en la ejecucion del modelo síncrono. Finalmente, algunos resultados preliminares de este Proyecto de Fin de Grado han sido presentados recientemente en formato de artículo científico en la "International Work-Conference on Artificial Neural Networks (IWANN)-2015" y publicados en "Ad-vances in Computational Intelligence" volumen 9094 de "Lecture Notes in Computer Science" de Springer International Publishing. Lo anterior, es una confirmation de que este trabajo mas que un Proyecto de Fin de Grado, es solo el inicio de un trabajo que puede tener mayor repercusion en la comunidad científica. Abstract Network of Evolutionary Processors -NEP is a computational model inspired by the evolution of cell populations, which might model some properties of evolving cell communities at the syntactical level. NEP defines theoretical computing devices able to solve NP complete problems in an efficient manner. In this model, cells are represented by words which encode their DNA sequences. Informally, at any moment of time, the evolutionary system is described by a collection of words, where each word represents one cell. Cells belong to species and their community evolves according to mutations and division which are defined by operations on words. Only those cells are accepted as surviving (correct) ones which are represented by a word in a given set of words, called the genotype space of the species. This feature is analogous with the natural process of evolution. Formally, NEP is based on an architecture for parallel and distributed processing, in other words, a network of language processors. Since the date when NEP was pro¬posed, several extensions and variants have appeared engendering a new set of models named Networks of Bio-inspired Processors (NBP). During this time, several works have proved the computational power of NBP. Specifically, their efficiency, universality, and computational completeness have been thoroughly investigated. Therefore, we can say that the NEP model has reached its maturity. The main motivation for this End of Grade project (EOG project in short) is to propose a practical approximation that allows to close the gap between theoretical NEP model and a practical implementation in high performing computational platforms in order to solve some of high the high complexity problems society requires today. Up until now tools developed to simulate NEPs, while correct and successful, are usu¬ally tightly coupled to the execution environment, using specific software frameworks (Hadoop) or direct hardware usage (GPUs). Within this context the main purpose of this work is the development of Nepfix, a generic and extensible tool that aims to execute algorithms based on NEP model and compatible variants in a local way, similar to a traditional application or in a distributed cloud environment. Nepfix as an application was developed during a 7 month cycle and is undergoing its second iteration once the prototype period was abandoned. Nepfix is designed as a modular self-contained application written in Java 8, that is, no additional external dependencies are required and it does not rely on an specific execution environment, any JVM is a valid container. Nepfix is made of two components or modules. The first module corresponds to the NEP execution and therefore simulation. During the development the current state of the theoretical model was used as a reference including most common filters and processors. Additionally extensibility is provided by the use of Python as a scripting language to run custom logic. Along with the simulation a definition language for NEP has been defined based on JSON as well as a mechanisms to represent words and their possible manipulations. NEP simulator is isolated from distribution and as mentioned before different applications that include it as a dependency are possible, the distribution of NEPs is an example of this. The second module corresponds to executing Nepfix in the cloud. The development carried a heavy R&D process since this front was not explored by other research groups until now. It's important to point out that the development of this module is not focused on results at this point in time, instead we focus on feasibility and discovery of this new perspective to execute natural computing systems and NEPs specifically. The main properties of cloud applications is that they are managed by the platform and are encapsulated in a container. For Nepfix a Spring application becomes the container and the HTTP or AMQP protocols are used for communication with the rest of the instances. Different execution perspectives were studied, namely asynchronous and synchronous models were developed for solving different kind of problems using NEPs. Different limitations and restrictions manifest in both models and are explored in detail in the respective chapters. In conclusion we can consider that Nepfix as a computational framework is suc-cessful: Cloud technology is ready for the challenge and the first results reassure that the properties Nepfix project pursued were met. Many investigation branches are left open for future investigations. In this EOG implementation guidelines are proposed for some of them like error recovery or dynamic NEP splitting. On the other hand other interesting problems that were not in the scope of this project were identified during development like word representation standardization or NEP model optimizations. As a confirmation that the results of this work can be useful to the scientific com-munity a preliminary version of this project was published in The International Work- Conference on Artificial Neural Networks (IWANN) in May 2015. Development has not stopped since that point and while Nepfix in it's current state can not be consid¬ered a final product the most relevant ideas, possible problems and solutions that were produced during the seven months development cycle are worthy to be gathered and presented giving a meaning to this EOG work.

Differential patterns of acquired virulence genes distinguish Salmonella strains

Analysis of several Salmonella typhimurium in vivo-induced genes located in regions of atypical base composition has uncovered acquired genetic elements that cumulatively engender pathogenicity. Many of these regions are associated with mobile elements, encode predicted adhesin and invasin-like functions, and are required for full virulence. Some of these regions distinguish broad host range from host-adapted Salmonella serovars and may contribute to inherent differences in host specificity, tissue tropism, and disease manifestation. Maintenance of this archipelago of acquired sequence by selection in specific hosts reveals a fossil record of the evolution of pathogenic species.

Membrane voltage initiates Ca2+ waves and potentiates Ca2+ increases with abscisic acid in stomatal guard cells

In higher plants changes and oscillations in cytosolic free Ca2+ concentration ([Ca2+]i) are central to hormonal physiology, including that of abscisic acid (ABA), which signals conditions of water stress and alters ion channel activities in guard cells of higher-plant leaves. Such changes in [Ca2+]i are thought to encode for cellular responses to different stimuli, but their origins and functions are poorly understood. Because transients and oscillations in membrane voltage also occur in guard cells and are elicited by hormones, including ABA, we suspected a coupling of [Ca2+]i to voltage and its interaction with ABA. We recorded [Ca2+]i by Fura2 fluorescence ratio imaging and photometry while bringing membrane voltage under experimental control with a two-electrode voltage clamp in intact Vicia guard cells. Free-running oscillations between voltages near −50 mV and −200 mV were associated with oscillations in [Ca2+]i, and, under voltage clamp, equivalent membrane hyperpolarizations caused [Ca2+]i to increase, often in excess of 1 μM, from resting values near 100 nM. Image analysis showed that the voltage stimulus evoked a wave of high [Ca2+]i that spread centripetally from the peripheral cytoplasm within 5–10 s and relaxed over 40–60 s thereafter. The [Ca2+]i increases showed a voltage threshold near −120 mV and were sensitive to external Ca2+ concentration. Substituting Mn2+ for Ca2+ to quench Fura2 fluorescence showed that membrane hyperpolarization triggered a divalent influx. ABA affected the voltage threshold for the [Ca2+]i rise, its amplitude, and its duration. In turn, membrane voltage determined the ability of ABA to raise [Ca2+]i. These results demonstrate a capacity for voltage to evoke [Ca2+]i increases, they point to a dual interaction with ABA in triggering and propagating [Ca2+]i increases, and they implicate a role for voltage in “conditioning” [Ca2+]i signals that regulate ion channels for stomatal function.

Characterization of genes modulated during pheomelanogenesis using differential display

Molecular and biochemical mechanisms that modulate the production of eumelanin or pheomelanin pigments involve the opposing effects of two intercellular signaling molecules, α-melanocyte stimulating hormone (MSH) and agouti signal protein (ASP). ASP is an antagonist of MSH signaling through the melanocyte-specific MSH receptor, although its mechanism(s) of action is controversial. We previously have reported significant down-regulation of all known melanogenic genes during the eumelanin to pheomelanin switch in murine hair follicle melanocytes and in cultured melanocytes treated with recombinant ASP. To identify factors that might be involved in the switch to pheomelanogenesis, we screened ASP-treated melanocytes by using differential display and identified three up-regulated genes: a DNA replication control protein, a basic helix–loop–helix transcription factor, and a novel gene. We have simultaneously identified six down-regulated genes in ASP-treated melanocytes; two of those encode tyrosinase and TRP2, melanogenic genes known to be down-regulated during pheomelanogenesis, which provide good internal controls for this approach. These results suggest that there are complex mechanisms involved in the switch to pheomelanin production, and that these modulated genes might be involved in the pleiotropic changes seen in yellow mice, including the change in coat color.

Cloning and characterization of human inducible nitric oxide synthase splice variants: A domain, encoded by exons 8 and 9, is critical for dimerization

The inducible nitric oxide synthase (iNOS) contains an amino-terminal oxygenase domain, a carboxy-terminal reductase domain, and an intervening calmodulin-binding region. For the synthesis of nitric oxide (NO), iNOS is active as a homodimer. The human iNOS mRNA is subject to alternative splicing, including deletion of exons 8 and 9 that encode amino acids 242–335 of the oxygenase domain. In this study, iNOS8−9− and full-length iNOS (iNOSFL) were cloned from bronchial epithelial cells. Expression of iNOS8−9− in 293 cell line resulted in generation of iNOS8−9− mRNA and protein but did not lead to NO production. In contrast to iNOSFL, iNOS8−9− did not form dimers. Similar to iNOSFL, iNOS8−9− exhibited NADPH-diaphorase activity and contained tightly bound calmodulin, indicating that the reductase and calmodulin-binding domains were functional. To identify sequences in exons 8 and 9 that are critical for dimerization, iNOSFL was used to construct 12 mutants, each with deletion of eight residues in the region encoded by exons 8 and 9. In addition, two “control” iNOS deletion mutants were synthesized, lacking either residues 45–52 of the oxygenase domain or residues 1131–1138 of the reductase domain. Whereas both control deletion mutants generated NO and formed dimers, none of the 12 other mutants formed dimers or generated NO. The region encoded by exons 8 and 9 is critical for iNOS dimer formation and NO production but not for reductase activity. This region could be a potential target for therapeutic interventions aimed at inhibiting iNOS dimerization and hence NO synthesis.

The ability of HIV type 1 to use CCR-3 as a coreceptor is controlled by envelope V1/V2 sequences acting in conjunction with a CCR-5 tropic V3 loop

Although infection by primary HIV type 1 (HIV-1) isolates normally requires the functional interaction of the viral envelope protein with both CD4 and the CCR-5 coreceptor, a subset of such isolates also are able to use the distinct CCR-3 receptor. By analyzing the ability of a series of wild-type and chimeric HIV-1 envelope proteins to mediate CCR-3-dependent infection, we have determined that CCR-3 tropism maps to the V1 and V2 variable region of envelope. Although substitution of the V1/V2 region of a CCR-3 tropic envelope into the context of a CCR-5 tropic envelope is both necessary and sufficient to confer CCR-3 tropism, this same substitution has no phenotypic effect when inserted into a CXCR-4 tropic HIV-1 envelope context. However, this latter chimera acquires both CCR-3 and CCR-5 tropism when a CCR-5 tropic V3 loop sequence also is introduced. These data demonstrate that the V1/2 region of envelope can, like the V3 loop region, encode a particular coreceptor requirement and suggest that a functional envelope:CCR-3 interaction may depend on the cooperative interaction of CCR-3 with both the V1/V2 and the V3 region of envelope.

A negative regulator mediates quorum-sensing control of exopolysaccharide production in Pantoea stewartii subsp. stewartii

Classical quorum-sensing (autoinduction) regulation, as exemplified by the lux system of Vibrio fischeri, requires N-acyl homoserine lactone (AHL) signals to stimulate cognate transcriptional activators for the cell density-dependent expression of specific target gene systems. For Pantoea stewartii subsp. stewartii, a bacterial pathogen of sweet corn and maize, the extracellular polysaccharide (EPS) stewartan is a major virulence factor, and its production is controlled by quorum sensing in a population density-dependent manner. Two genes, esaI and esaR, encode essential regulatory proteins for quorum sensing. EsaI is the AHL signal synthase, and EsaR is the cognate gene regulator. esaI, ΔesaR, and ΔesaI-esaR mutations were constructed to establish the regulatory role of EsaR. We report here that strains containing an esaR mutation produce high levels of EPS independently of cell density and in the absence of the AHL signal. Our data indicate that quorum-sensing regulation in P. s. subsp. stewartii, in contrast to most other described systems, uses EsaR to repress EPS synthesis at low cell density, and that derepression requires micromolar amounts of AHL. In addition, derepressed esaR strains, which synthesize EPS constitutively at low cell densities, were significantly less virulent than the wild-type parent. This finding suggests that quorum sensing in P. s. subsp. stewartii may be a mechanism to delay the expression of EPS during the early stages of infection so that it does not interfere with other mechanisms of pathogenesis.

A site-specific recombinase is required for competitive root colonization by Pseudomonas fluorescens WCS365

A colonization mutant of the efficient root-colonizing biocontrol strain Pseudomonas fluorescens WCS365 is described that is impaired in competitive root-tip colonization of gnotobiotically grown potato, radish, wheat, and tomato, indicating a broad host range mutation. The colonization of the mutant is also impaired when studied in potting soil, suggesting that the defective gene also plays a role under more natural conditions. A DNA fragment that is able to complement the mutation for colonization revealed a multicistronic transcription unit composed of at least six ORFs with similarity to lppL, lysA, dapF, orf235/233, xerC/sss, and the largely incomplete orf238. The transposon insertion in PCL1233 appeared to be present in the orf235/233 homologue, designated orf240. Introduction of a mutation in the xerC/sss homologue revealed that the xerC/sss gene homologue rather than orf240 is crucial for colonization. xerC in Escherichia coli and sss in Pseudomonas aeruginosa encode proteins that belong to the λ integrase family of site-specific recombinases, which play a role in phase variation caused by DNA rearrangements. The function of the xerC/sss homologue in colonization is discussed in terms of genetic rearrangements involved in the generation of different phenotypes, thereby allowing a bacterial population to occupy various habitats. Mutant PCL1233 is assumed to be locked in a phenotype that is not well suited to compete for colonization in the rhizosphere. Thus we show the importance of phase variation in microbe–plant interactions.

A protein encoded by a group I intron in Aspergillus nidulans directly assists RNA splicing and is a DNA endonuclease

Some group I introns self-splice in vitro, but almost all are thought to be assisted by proteins in vivo. Mutational analysis has shown that the splicing of certain group I introns depends upon a maturase protein encoded by the intron itself. However the effect of a protein on splicing can be indirect. We now provide evidence that a mitochondrial intron-encoded protein from Aspergillus nidulans directly facilitates splicing in vitro. This demonstrates that a maturase is an RNA splicing protein. The protein-assisted reaction is as fast as that of any other known group I intron. Interestingly the protein is also a DNA endonuclease, an activity required for intron mobilization. Mobile elements frequently encode proteins that promote their propagation. Intron-encoded proteins that also assist RNA splicing would facilitate both the transposition and horizontal transmission of introns.

Two-component kinase-like activity of nm23 correlates with its motility-suppressing activity

Nm23 genes, which encode nucleoside diphosphate kinases, have been implicated in suppressing tumor metastasis. The motility of human breast carcinoma cells can be suppressed by transfection with wild-type nm23-H1, but not by transfections with two nm23-H1 mutants, nm23-H1S12OG and nm23-H1P96S. Here we report that nm23-H1 can transfer a phosphate from its catalytic histidine to aspartate or glutamate residues on 43-kDa membrane proteins. One of the 43-kDa membrane proteins was not phosphorylated by either nm23-H1P96S or nm23-H1S120G, and another was phosphorylated much more slowly by nm23-H1P96S and by nm23-H1S120G than by wild-type nm23-H1. Nm23-H1 also can transfer phosphate from its catalytic histidine to histidines on ATP-citrate lyase and succinic thiokinase. The rates of phosphorylation of ATP-citrate lyase by nm23-H1S120G and nm23-H1P96S were similar to that by wild-type nm23-H1. The rate of phosphorylation of succinic thiokinase by nm23-H1S120 was similar to that by wild-type nm23-H1, and the rate of phosphorylation of succinic thiokinase by nm23-H1P96S was about half that by wild-type nm23-H1. Thus, the transfer of phosphate from nm23-H1 to aspartates or glutamates on other proteins appears to correlate better with the suppression of motility than does the transfer to histidines.

Primary structure and tissue distribution of two novel proline-rich γ-carboxyglutamic acid proteins

Two human cDNAs that encode novel vitamin K-dependent proteins have been cloned and sequenced. The predicted amino acid sequences suggest that both are single-pass transmembrane proteins with amino-terminal γ-carboxyglutamic acid-containing domains preceded by the typical propeptide sequences required for posttranslational γ-carboxylation of glutamic acid residues. The polypeptides, with deduced molecular masses of 23 and 17 kDa, are proline-rich within their putative cytoplasmic domains and contain several copies of the sequences PPXY and PXXP, motifs found in a variety of signaling and cytoskeletal proteins. Accordingly, these two proteins have been called proline-rich Gla proteins (PRGP1 and PRGP2). Unlike the γ-carboxyglutamic acid domain-containing proteins of the blood coagulation cascade, the two PRGPs are expressed in a variety of extrahepatic tissues, with PRGP1 and PRGP2 most abundantly expressed in the spinal cord and thyroid, respectively, among those tissues tested. Thus, these observations suggest a novel physiological role for these two new members of the vitamin K-dependent family of proteins.