Loanword Phonology, Lexical Exceptions, Morphologically Driven Underapplication, and the Nature of Positionally Biased Constraints

In this paper we provide a formal account for underapplication of vowel reduction to schwa in Majorcan Catalan loanwords and learned words. On the basis of the comparison of these data with those concerning productive derivation and verbal inflection, which show analogous patterns, in this paper we also explore the existing and not yet acknowledged correlation between those processes that exhibit a particular behaviour in the loanword phonology with respect to the native phonology of the language, those processes that show lexical exceptions and those processes that underapply due to morphological reasons. In light of the analysis of the very same data and taking into account the aforementioned correlation, we show how there might exist a natural diachronic relation between two kinds of Optimality Theory constraints which are commonly used but, in principle, mutually exclusive: positional faithfulness and contextual markedness constraints. Overall, phonological productivity is proven to be crucial in three respects: first, as a context of the grammar, given that «underapplication» is systematically found in what we call the productive phonology of the dialect (including loanwords, learned words, productive derivation and verbal inflection); second, as a trigger or blocker of processes, in that the productivity or the lack of productivity of a specific process or constraint in the language is what explains whether it is challenged or not in any of the depicted situations, and, third, as a guiding principle which can explain the transition from the historical to the synchronic phonology of a linguistic variety.

Design and Validation of a Novel Generic Platform for the Production of Tetravalent IgG1-like Bispecific Antibodies.

We have designed and validated a novel generic platform for production of tetravalent IgG1-like chimeric bispecific Abs. The VH-CH1-hinge domains of mAb2 are fused through a peptidic linker to the N terminus of mAb1 H chain, and paired mutations at the CH1-CL interface mAb1 are introduced that force the correct pairing of the two different free L chains. Two different sets of these CH1-CL interface mutations, called CR3 and MUT4, were designed and tested, and prototypic bispecific Abs directed against CD5 and HLA-DR were produced (CD5xDR). Two different hinge sequences between mAb1 and mAb2 were also tested in the CD5xDR-CR3 or -MUT4 background, leading to bispecific Ab (BsAbs) with a more rigid or flexible structure. All four Abs produced bound with good specificity and affinity to CD5 and HLA-DR present either on the same target or on different cells. Indeed, the BsAbs were able to efficiently redirect killing of HLA-DR(+) leukemic cells by human CD5(+) cytokine-induced killer T cells. Finally, all BsAbs had a functional Fc, as shown by their capacity to activate human complement and NK cells and to mediate phagocytosis. CD5xDR-CR3 was chosen as the best format because it had overall the highest functional activity and was very stable in vitro in both neutral buffer and in serum. In vivo, CD5xDR-CR3 was shown to have significant therapeutic activity in a xenograft model of human leukemia.

Contribución de la Tecnología en la Gestión del Conocimiento entre los grupos de investigación del área de Informática

Una de las bases de la innovación es elconocimiento. Éste se genera mediante una serie deprocesos que conforman el denominado ciclo delconocimiento. Para soportar la Gestión del Conocimientohan surgido diferentes herramientas y plataformastecnológicas. En este contexto surge el actual trabajofocalizado en los grupos de investigación en el área deInformática en la Ciudad de Montería (Colombia). Laparte empírica está basada en metodologías cualitativas, yla recogida de datos se ha efectuado mediante entrevistasen profundidad realizadas a ocho personas, representantesde los grupos de investigación. El objetivo es doble: a)presentar el mapa del conocimiento de los grupos deinvestigación, identificando las Áreas de Conocimiento deestos grupos y la terminología asociada; b) obtenerelementos para el diseño de una plataforma tecnológicaque soporte la Gestión del Conocimiento entre los grupos.Por último se señalan líneas futuras de investigación paracontribuir al desarrollo regional.

Numbers and Languages

The thesis presents results obtained during the authors PhD-studies. First systems of language equations of a simple form consisting of just two equations are proved to be computationally universal. These are systems over unary alphabet, that are seen as systems of equations over natural numbers. The systems contain only an equation X+A=B and an equation X+X+C=X+X+D, where A, B, C and D are eventually periodic constants. It is proved that for every recursive set S there exists natural numbers p and d, and eventually periodic sets A, B, C and D such that a number n is in S if and only if np+d is in the unique solution of the abovementioned system of two equations, so all recursive sets can be represented in an encoded form. It is also proved that all recursive sets cannot be represented as they are, so the encoding is really needed. Furthermore, it is proved that the family of languages generated by Boolean grammars is closed under injective gsm-mappings and inverse gsm-mappings. The arguments apply also for the families of unambiguous Boolean languages, conjunctive languages and unambiguous languages. Finally, characterizations for morphisims preserving subfamilies of context-free languages are presented. It is shown that the families of deterministic and LL context-free languages are closed under codes if and only if they are of bounded deciphering delay. These families are also closed under non-codes, if they map every letter into a submonoid generated by a single word. The family of unambiguous context-free languages is closed under all codes and under the same non-codes as the families of deterministic and LL context-free languages.

Lactobacillus delbrueckii UFV-H2b20 induces type 1 cytokine production by mouse cells in vitro and in vivo

Lactobacillus delbrueckii UFV-H2b20 has been shown to increase clearance of bacteria injected into the blood of germ-free mice. Moreover, it induces the production of type 1 cytokines by human peripheral mononuclear cells. The objective of the present study was to investigate the production of inflammatory cytokines [interleukin-12 (IL-12 p40), tumor necrosis factor-α (TNF-α), and interferon-γ (IFN-γ)] triggered in vitro by live, heat-killed or lysozyme-treated L. delbrueckii UFV-H2b20 and in vivo by a live preparation. Germ-free, L. delbrueckii-monoassociated and lipopolysaccharide (LPS)-resistant C3H/HeJ mice were used as experimental models. UFV-H2b20 induced the production of IL-12 p40 and TNF-α by peritoneal cells and IFN-γ by spleen cells from germ-free or monoassociated Swiss/NIH mice and LPS-hyporesponsive mice (around 40 ng/mL for IL-12 p40, 200 pg/mL for TNF-α and 10 ng/mL for IFN-γ). Heat treatment of L. delbrueckii did not affect the production of these cytokines. Lysozyme treatment decreased IL-12 p40 production by peritoneal cells from C3H/HeJ mice, but did not affect TNF-α production by these cells or IFN-γ production by spleen cells from the same mouse strain. TNF-α production by peritoneal cells from Swiss/NIH L. delbrueckii-monoassociated mice was inhibited by lysozyme treatment. When testing IL-12 p40 and IFN-γ levels in sera from germ-free or monoassociated Swiss/NIH mice systemically challenged with Escherichia coli we observed that IL-12 p40 was produced at marginally higher levels by monoassociated mice than by germ-free mice (40 vs 60 ng/mL), but IFN-γ was produced earlier and at higher levels by monoassociated mice (monoassociated 4 and 14 ng/mL 4 and 8 h after infection, germfree 0 and 7.5 ng/mL at the same times). These results show that L. delbrueckii UFV-H2b20 stimulates the production of type 1 cytokines in vitro and in vivo, therefore suggesting that L. delbrueckii might have adjuvant properties in infection in which these cytokines play a major role.

Du bien-être psychologique au travail : fondements théoriques, conceptualisation et instrumentation du construit

Malgré la préoccupation croissante des chercheurs et praticiens pour la santé psychologique au travail, le concept de bien-être vécu au travail est encore mal compris de la communauté scientifique. En effet, peu d’efforts ont été consacrés à ce jour pour développer des connaissances sur le bien-être psychologique au travail arrimées à la réalité des employés. Cette thèse a donc pour objectif de développer une conceptualisation du bien-être psychologique au travail et une instrumentation psychométriquement fiable lui étant rattachée. Pour ce faire, deux études ont été réalisées. La première, de nature qualitative et exploratoire, fut menée auprès de 20 travailleurs canadiens francophones afin de répertorier, à partir d’incidents critiques vécus par ceux-ci, des manifestations de bien-être psychologique au travail. Celles-ci ont pu être classifiées selon un modèle en 2 axes, soit la sphère de référence dans laquelle le bien-être psychologique au travail se vit et la directionnalité selon laquelle il se développe. Ce modèle a ensuite été comparé aux conceptualisations génériques du bien-être psychologique existantes, et cette analyse a permis d’étayer la validité convergente et divergente du modèle. Dans un deuxième temps, l’Indice de bien-être psychologique au travail (IBEPT) a été créé sur la base des manifestations relevées lors de l’étude qualitative, afin d’en assurer la validité de contenu. Une version expérimentale de l’instrument a ensuite été soumise à une expérimentation auprès de 1080 travailleurs québécois. Les analyses factorielles exploratoires révèlent une structure interne en 25 items reflétant 5 dimensions, représentant elles-mêmes un construit de second ordre. La validité de construit de cette conceptualisation a ensuite été étudiée par l’analyse des intercorrélations avec une série de mesures du bien-être et de la détresse psychologique génériques. Les résultats appuient la validité convergente de l’instrument, et démontrent également sa validité divergente. Enfin, l’instrument affiche une cohérence interne satisfaisante. Au terme de cette recherche doctorale, les résultats des deux études sont interprétés en fonction de l’état actuel des connaissances sur le bien-être psychologique, les limites des études sont énoncées, et des pistes de recherche future sont avancées.

Restarting automata with restricted utilization of auxiliary symbols

The restarting automaton is a restricted model of computation that was introduced by Jancar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspect of the analysis by reduction. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the number of auxiliary symbols in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the number of occurrences of auxiliary symbols on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.

On the Gap-Complexity of Simple RL-Automata

Analysis by reduction is a method used in linguistics for checking the correctness of sentences of natural languages. This method is modelled by restarting automata. All types of restarting automata considered in the literature up to now accept at least the deterministic context-free languages. Here we introduce and study a new type of restarting automaton, the so-called t-RL-automaton, which is an RL-automaton that is rather restricted in that it has a window of size one only, and that it works under a minimal acceptance condition. On the other hand, it is allowed to perform up to t rewrite (that is, delete) steps per cycle. Here we study the gap-complexity of these automata. The membership problem for a language that is accepted by a t-RL-automaton with a bounded number of gaps can be solved in polynomial time. On the other hand, t-RL-automata with an unbounded number of gaps accept NP-complete languages.

The Degree of Word-Expansion of Lexicalized RRWW-Automata

Restarting automata can be seen as analytical variants of classical automata as well as of regulated rewriting systems. We study a measure for the degree of nondeterminism of (context-free) languages in terms of deterministic restarting automata that are (strongly) lexicalized. This measure is based on the number of auxiliary symbols (categories) used for recognizing a language as the projection of its characteristic language onto its input alphabet. This type of recognition is typical for analysis by reduction, a method used in linguistics for the creation and verification of formal descriptions of natural languages. Our main results establish a hierarchy of classes of context-free languages and two hierarchies of classes of non-context-free languages that are based on the expansion factor of a language.

CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store

We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.

Innovar con blogs en la enseñanza universitaria presencial.

Resumen tomado del autor. Incluye tablas de datos con los resultados obtenidos del cuestionario de valoración de la experiencia realizado por el alumnado de la asignatura

MA348exam 1998

Exam questions and solutions in LaTex

MA348exam 1998 pdf

Exam questions and solutions in PDF

El programa de policia tutor a les Illes Balears. 'El programa de policía tutor en las Islas Baleares'.

Resumen tomado del autor

La intervenció de Joan Coromines en alguns dels grans episodis de la història de la llengua catalana del S. XX (amb un apèndix d'observacions sobre la llengua catalana de Joan Coromines)

La tesi doctoral LA INTERVENCIÓ DE JOAN COROMINES EN ALGUNS DELS GRANS EPISODIS DE LA HISTÒRIA DE LA LLENGUA CATALANA DEL S. XX (AMB UN APÈNDIX D'OBSERVACIONS SOBRE LA LLENGUA CATALANA DE JOAN COROMINES) estudia l'aportació de Joan Coromines en la història de la llengua catalana del segle XX. El treball del lingüista és situat en el context de l'obra codificadora i modernitzadora de la llengua catalana realitzada per Pompeu Fabra durant les tres primeres dècades del segle passat i descriu la intervenció i les aportacions de Coromines en la continuació del treball normativitzador del català. La tesi demostra que Coromines és una figura indispensable per comprendre la dinàmica, la fesomia i la tessitura de la llengua catalana al llarg del crucial segle XX.