Conditional expression of Sry, and Wnt4 by gene-targeting: Studies in sexual and skeletal development

Sry and Wnt4 cDNAs were individually introduced into the ubiquitously-expressed Rosa26 ( R26) locus by gene targeting in embryonic stem (ES) cells to create a conditional gene expression system in mice. In the targeted alleles, expression of these cDNAs should be blocked by a neomycin resistance selection cassette that is flanked by loxP sites. Transgene expression should be activated after the blocking cassette is deleted by Cre recombinase. ^ To test this conditional expression system, I have bred R26-stop- Sry and R26-stop-Wnt4 heterozygotes with a MisRII-Cre mouse line that expresses Cre in the gonads of both sexes. Analysis of these two types of bigenic heterozygotes indicated that their gonads developed normally like those of wild types. However, one XX R26-Sry/R26-Sry; MisR2-Cre/+ showed epididymis-like structures resembling those of males. In contrast, only normal phenotypes were observed in XY R26-Wnt4/R26-Wnt4; MisR2-Cre /+ mice. To interpret these results, I have tested for Cre recombinase activity by Southern blot and transcription of the Sry and Wnt4 transgenes by RT-PCR. Results showed that bigenic mutants had insufficient activation of the transgenes in their gonads at E12.5 and E13.5. Therefore, the failure to observe mutant phenotypes may have resulted from low activity of MisR2-Cre recombination at the appropriate time. ^ Col2a1-Cre transgenic mice express Cre in differentiating chondrocytes. R26-Wnt4; Col2a1-Cre bigenic heterozygous mice were found to exhibit a dramatic alteration in growth presumably caused by Wnt4 overexpression during chondrogenesis. R26-Wnt4; Col2a1-Cre mice exhibited dwarfism beginning approximately 10 days after birth. In addition, they also had craniofacial abnormalities, and had delayed ossification of the lumbar vertebrate and pelvic bones. Histological analysis of the growth plates of R26-Wnt4; Col2a1-Cre mice revealed less structural organization and a delay in onset of the primary and secondary ossification centers. Molecular studies confirmed that overexpression of Wnt4 causes decreased proliferation and early maturation of chondrocytes. In addition, R26-Wnt4; Col2a1-Cre mice had decreased expression of vascular endothelial growth factor (VEGF), suggesting that defects in vascularization may contribute to the dwarf phenotype. Finally, 9-month-old R26-Wnt4; Col2a1-Cre mice had significantly more fat cells in the marrow cavities of their metaphysis long bones, implying that long-term overexpression of Wnt4may cause bone marrow pathologies. In conclusion, Wnt4 was activated by Col2a1-Cre recombinase and was overexpressed in the growth plate, resulting in aberrant proliferation and differentiation of chondrocytes, and ultimately leads to dwarfism in mice. ^

Empirical Analysis of Credit Risk Regime Switching and Temporal Conditional Default Correlation in Credit Default Swap Valuation: The Market liquidity effect

In this paper, we extend the debate concerning Credit Default Swap valuation to include time varying correlation and co-variances. Traditional multi-variate techniques treat the correlations between covariates as constant over time; however, this view is not supported by the data. Secondly, since financial data does not follow a normal distribution because of its heavy tails, modeling the data using a Generalized Linear model (GLM) incorporating copulas emerge as a more robust technique over traditional approaches. This paper also includes an empirical analysis of the regime switching dynamics of credit risk in the presence of liquidity by following the general practice of assuming that credit and market risk follow a Markov process. The study was based on Credit Default Swap data obtained from Bloomberg that spanned the period January 1st 2004 to August 08th 2006. The empirical examination of the regime switching tendencies provided quantitative support to the anecdotal view that liquidity decreases as credit quality deteriorates. The analysis also examined the joint probability distribution of the credit risk determinants across credit quality through the use of a copula function which disaggregates the behavior embedded in the marginal gamma distributions, so as to isolate the level of dependence which is captured in the copula function. The results suggest that the time varying joint correlation matrix performed far superior as compared to the constant correlation matrix; the centerpiece of linear regression models.

Total Factor Productivity and Monetary Policy: Evidence from Conditional Volatility

This paper empirically assesses whether monetary policy affects real economic activity through its affect on the aggregate supply side of the macroeconomy. Analysts typically argue that monetary policy either does not affect the real economy, the classical dichotomy, or only affects the real economy in the short run through aggregate demand new Keynesian or new classical theories. Real business cycle theorists try to explain the business cycle with supply-side productivity shocks. We provide some preliminary evidence about how monetary policy affects the aggregate supply side of the macroeconomy through its affect on total factor productivity, an important measure of supply-side performance. The results show that monetary policy exerts a positive and statistically significant effect on the supply-side of the macroeconomy. Moreover, the findings buttress the importance of countercyclical monetary policy as well as support the adoption of an optimal money supply rule. Our results also prove consistent with the effective role of monetary policy in the Great Moderation as well as the more recent rise in productivity growth.

Analyzing the function of myogenin in adult satellite cells through the construction of a myogenin conditional allele

Although mechanisms regulating the formation of embryonic skeletal muscle are well characterized, less is known about muscle formation in postnatal life. This disparity is unfortunate because the largest increases in skeletal muscle mass occur after birth. Adult muscle stem cells (satellite cells) appear to recapitulate the events that occur in embryonic myoblasts. In particular, the myogenic basic helix-loop-helix factors, which have crucial functions in embryonic muscle development, are assumed to have similar roles in postnatal muscle formation. Here, I test this assumption by determining the role of the myogenic regulator myogenin in postnatal life. Myogenin-null mice die at birth, necessitating the generation of floxed alleles of myogenin and the use of cre-recombinase lines to delete myogenin. Removing myogenin before embryonic muscle development resulted in myofiber deficiencies identical to those observed in myogenin-null mice. However, mice in which myogenin was deleted following embryonic muscle development had normal skeletal muscle, except for modest alterations in MRF4 and MyoD expression. Notably, myogenin-deleted mice were 30% smaller than controls, suggesting that myogenin's absence disrupted general body growth. These results suggest that skeletal muscle growth in postnatal life is controlled by mechanisms distinct from those occurring in embryonic muscle development. ^

A conditional Mdm2 allele shows the importance of Mdm2 in heart development

Over 50% of sporadic tumors in humans have a p53 mutation highlighting its importance as a tumor suppressor. Considering additional mutations in other genes involved in p53 pathways, every tumor probably has mutant p53 or impaired p53-mediated functions. In response to a variety of cellular and genotoxic stresses, p53, mainly through its transcriptional activity, induces pathways involved in apoptosis and growth arrest. In these circumstances and under normal situations, p53 must be tightly regulated. Mdm2 is an important regulator of p53. Mdm2 inhibits p53 function by binding and blocking its transactivation domain. In addition, Mdm2 helps target p53 for degradation through its E3 ligase activity. Mdm2 null mice are embryonic lethal due to apoptosis in the blastocysts. However, a p53 null background rescues this lethality demonstrating the importance of the p53-Mdm2 interaction, particularly during development. The lethality of the Mdm2 null mouse prior to implantation limits the ability to investigate the role of Mdm2 in regulating p53 in a temporal and tissue specific manner. Does p53 need to be regulated in all tissues throughout the life of a mouse? Does Mdm2 always have to regulate it? To address these questions, we created a conditional Mdm2 allele. The conditional allele, Mdm2FM, in the presence of Cre recombinase results in the deletion of exons 5 and 6 of Mdm2 (most of the p53 binding domain) and represents a null allele. ^ The Mdm2FM allele was crossed with a heart muscle specific Cre expressing mouse (α-myosin heavy chain promoter driven Cre) to ask whether Mdm2 acts as a negative regulator of p53 in the heart. The heart is the most prominent organ early in embryogenesis and is shaped by cell death and proliferation. p53 does not appear to be active in the heart in response to some types of stress, so it remained to be determined if it has to be regulated in normal heart development. Loss of Mdm2 in the heart results in heart defects as early as E9.5. Loss of Mdm2 results in stabilized p53 and apoptosis. This apoptosis leads to a thinning of the myocardial wall particularly in the ventricles and abnormal ventricular structure. Eventually the abnormal heart fails resulting in lethality by E13.5. The embryonic lethality is rescued in a p53 null background. Thus, Mdm2 is important in regulating p53 in the development of the heart. ^

THE LOGIC OF NOMINAL RECORD LINKAGE WITH A CASE STUDY FROM LAREDO, TEXAS

The Laredo Epidemiology Project is a study of the patterns of degenerative disease, particularly cancer, in the families of Laredo, Texas. The genealogical history of Laredo was reconstructed by the grouping of 350,000 individual church and civil vital event records into multi-generational families, with record linkage based on matching names. Mortality data from death records are mapped onto these pedigrees for analysis. This dissertation describes the construction of the data base and the logic upon which decisions were based. ^

Bcr: A conditional inhibitor of Bcr -Abl oncoprotein

Chronic myelogenous leukemia (CML) is characterized cytogenetically by the presence of the Philadelphia chromosome and clinically by the clonal expansion of the hematopoietic stem cells and the accumulation of large numbers of myeloid cells. Philadelphia chromosome results from the reciprocal translocation between chromosomes 9 and 22 [t(9;22)(324;q11)], which fuses parts of the ABL proto-oncogene to 5′ portions of the BCR gene. The product of the fused gene is Bcr-Abl oncoprotein. Bcr-Abl oncoprotein has elevated protein tyrosine kinase activity, and is the cause of Philadelphia chromosome associated leukemias. The Bcr sequence in the fusion protein is crucial for the activation of Abl kinase activity and transforming phenotype of Bcr-Abl oncoprotein. Although the Bcr-Abl oncoprotein has been studied extensively, its normal counterpart, the Bcr protein, has been less studied and its function is not well understood. At this point, Bcr is known to encode a novel serine/threonine protein kinase. In Bcr-Abl positive leukemia cells, we found that the serine kinase activity of Bcr is impaired by tyrosine phosphorylation. Both the Bcr protein sequences within Bcr-Abl and the normal cellular Bcr protein lack serine/threonine kinase activity when they become phosphorylated on tyrosine residues by Bcr-Abl. Therefore, the goal of this study was to investigate the role of Bcr in Bcr-Abl positive leukemia cells. We found that overexpression of Bcr can inhibit Bcr-Abl tyrosine kinase activity, and the inhibition is dependent on its intact serine/threonine kinase function. Using the tet repressible promoter system, we demonstrated that Bcr when induced in Bcr-Abl positive leukemia cells inhibited the Bcr-Abl oncoprotein tyrosine kinase. Furthermore, induction of Bcr also increased the number of cells undergoing apoptosis and inhibited the transforming ability of Bcr-Abl. In contrast to the wild-type Bcr, the kinase-inactive mutant of Bcr (Y328F/Y360F) had no effects on Bcr-Abl tyrosine kinase in cells. Results from other experiments indicated that phosphoserine-containing Bcr sequences within the first exon, which are known to bind to the Abl SH2 domain, are responsible for observed inhibition of the Bcr-Abl tyrosine kinase. Several lines of evidence suggest that the phosphoserine form of Bcr, which binds to the Abl SH2 domain, strongly inhibits the Abl tyrosine kinase domain of Bcr-Abl Previously published findings from our laboratory have also shown that Bcr is phosphorylated on tyrosine residue 177 in Bcr-Abl positive cells and that this form of Bcr recruits the Grb2 adaptor protein, which is known to activate the Ras pathway. These findings implicate Bcr as an effector of Bcr-Abl's oncogenic activity. Therefore based on the findings presented above, we propose a model for dual Function of Bcr in Bcr-Abl positive leukemia cells. Bcr, when active as a serine/threonine kinase and thus autophosphorylating its own serine residues, inhibits Bcr-Abl's oncogenic functions. However, when Ber is tyrosine phosphorylated, its Bcr-Abl inhibitory function is neutralized thus allowing Bcr-Abl to exert its full oncogenic potential. Moreover, tyrosine phosphorylated Bcr would compliment Bcr-Abl's neoplastic effects by the activation of the Ras signaling pathway. ^

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

El Test de Ramsey y las lógicas condicionales

Frank Ramsey (1931) estableció ciertas condiciones que deberían cumplirse a fin de evaluar las proposiciones condicionales, conocidas hoy como Test de Ramsey (TR) En este trabajo se muestra que las teorías sobre condicionales contrafácticos de Chisholmj, Stalnaker y D. Lewis, satisfacen el TR y la incompatibilidad de TR con la Teoría de la revisión de creencias (AGM). En la última sección se analiza el comportamiento del TR en la propuesta de G. Grocco y L. Fariñas del Cerro, basada en una generalización del cálculo de Secuentes pero introduciendo la novedad de secuencias auxiliares cuya noción de consecuencia es no-monótona.

Exploring the logic of mobile search

After more than a decade of development work and hopes, the usage of mobile Internet has finally taken off. Now, we are witnessing the first signs of evidence of what might become the explosion of mobile content and applications that will be shaping the (mobile) Internet of the future. Similar to the wired Internet, search will become very relevant for the usage of mobile Internet. Current research on mobile search has applied a limited set of methodologies and has also generated a narrow outcome of meaningful results. This article covers new ground, exploring the use and visions of mobile search with a users' interview-based qualitative study. Its main conclusion builds upon the hypothesis that mobile search is sensitive to a mobile logic different than today's one. First, (advanced) users ask for accessing with their mobile devices the entire Internet, rather than subsections of it. Second, success is based on new added-value applications that exploit unique mobile functionalities. The authors interpret that such mobile logic involves fundamentally the use of personalised and context-based services.

A Precharge-Absorbed DPL Logic for Reducing Early Propagation Effects on FPGA Implementations

In this paper, a new countermeasure against power and electromagnetic (EM) Side Channel Attacks (SCA) on FPGA implemented cryptographic algorithms is proposed. This structure mainly focuses on a critical vulnerability, Early Evaluation, also known as Early Propagation Effect (EPE), which exists in most conventional SCA-hardened DPL (Dual-rail with Precharge Logic) solutions. The main merit of this proposal is that the EPE can be effectively prevented by using a synchronized non regular precharge network, which maintains identical routing between the original and mirror parts, where costs and design complexity compared with previous EPE-resistant countermeasures are reduced, while security level is not sacrificed. Another advantage for our Precharge Absorbed(PA) - DPL method is that its Dual-Core style (independent architecture for true and false parts) could be generated using partial reconfiguration. This helps to get a dynamic security protection with better energy planning. That means system only keeps the true part which fulfills the normal en/decryption task in low security level, and reconfigures the false parts once high security level is required. A relatively limited clock speed is a compromise, since signal propagation is restricted to a portion of the clock period. In this paper, we explain the principles of PA-DPL and provide the guidelines to design this structure. We experimentally validate our methods in a minimized AES co-processor on Xilinx Virtex-5 board using electromagnetic (EM) attacks.

Light and Logic

Publicación de la Sede del Consejo Consultor de Castilla y León en Zamora en la revista de arquitectura IA&B (Mumbai). El proyecto de Zamora se centra en el diálogo entre una pieza cristina de vidrio y el grueso muro de piedra perimetral. Estas dos fachadas entran en relación gracias a un patio perimetral que tensa el contacto entre entre el vidrio y la piedra. Se hace especial mención de la estricta precisión y racionalidad del proyecto. La publicación contiene textos, dibujos planimétricos, fotografías y materiales del proceso de investigación en el proyecto (croquis y fotografías de maquetas).

Relational and Allegorical Semantics for Constraint Logic Programming

El cálculo de relaciones binarias fue creado por De Morgan en 1860 para ser posteriormente desarrollado en gran medida por Peirce y Schröder. Tarski, Givant, Freyd y Scedrov demostraron que las álgebras relacionales son capaces de formalizar la lógica de primer orden, la lógica de orden superior así como la teoría de conjuntos. A partir de los resultados matemáticos de Tarski y Freyd, esta tesis desarrolla semánticas denotacionales y operacionales para la programación lógica con restricciones usando el álgebra relacional como base. La idea principal es la utilización del concepto de semántica ejecutable, semánticas cuya característica principal es el que la ejecución es posible utilizando el razonamiento estándar del universo semántico, este caso, razonamiento ecuacional. En el caso de este trabajo, se muestra que las álgebras relacionales distributivas con un operador de punto fijo capturan toda la teoría y metateoría estándar de la programación lógica con restricciones incluyendo los árboles utilizados en la búsqueda de demostraciones. La mayor parte de técnicas de optimización de programas, evaluación parcial e interpretación abstracta pueden ser llevadas a cabo utilizando las semánticas aquí presentadas. La demostración de la corrección de la implementación resulta extremadamente sencilla. En la primera parte de la tesis, un programa lógico con restricciones es traducido a un conjunto de términos relacionales. La interpretación estándar en la teoría de conjuntos de dichas relaciones coincide con la semántica estándar para CLP. Las consultas contra el programa traducido son llevadas a cabo mediante la reescritura de relaciones. Para concluir la primera parte, se demuestra la corrección y equivalencia operacional de esta nueva semántica, así como se define un algoritmo de unificación mediante la reescritura de relaciones. La segunda parte de la tesis desarrolla una semántica para la programación lógica con restricciones usando la teoría de alegorías—versión categórica del álgebra de relaciones—de Freyd. Para ello, se definen dos nuevos conceptos de Categoría Regular de Lawvere y _-Alegoría, en las cuales es posible interpretar un programa lógico. La ventaja fundamental que el enfoque categórico aporta es la definición de una máquina categórica que mejora e sistema de reescritura presentado en la primera parte. Gracias al uso de relaciones tabulares, la máquina modela la ejecución eficiente sin salir de un marco estrictamente formal. Utilizando la reescritura de diagramas, se define un algoritmo para el cálculo de pullbacks en Categorías Regulares de Lawvere. Los dominios de las tabulaciones aportan información sobre la utilización de memoria y variable libres, mientras que el estado compartido queda capturado por los diagramas. La especificación de la máquina induce la derivación formal de un juego de instrucciones eficiente. El marco categórico aporta otras importantes ventajas, como la posibilidad de incorporar tipos de datos algebraicos, funciones y otras extensiones a Prolog, a la vez que se conserva el carácter 100% declarativo de nuestra semántica. ABSTRACT The calculus of binary relations was introduced by De Morgan in 1860, to be greatly developed by Peirce and Schröder, as well as many others in the twentieth century. Using different formulations of relational structures, Tarski, Givant, Freyd, and Scedrov have shown how relation algebras can provide a variable-free way of formalizing first order logic, higher order logic and set theory, among other formal systems. Building on those mathematical results, we develop denotational and operational semantics for Constraint Logic Programming using relation algebra. The idea of executable semantics plays a fundamental role in this work, both as a philosophical and technical foundation. We call a semantics executable when program execution can be carried out using the regular theory and tools that define the semantic universe. Throughout this work, the use of pure algebraic reasoning is the basis of denotational and operational results, eliminating all the classical non-equational meta-theory associated to traditional semantics for Logic Programming. All algebraic reasoning, including execution, is performed in an algebraic way, to the point we could state that the denotational semantics of a CLP program is directly executable. Techniques like optimization, partial evaluation and abstract interpretation find a natural place in our algebraic models. Other properties, like correctness of the implementation or program transformation are easy to check, as they are carried out using instances of the general equational theory. In the first part of the work, we translate Constraint Logic Programs to binary relations in a modified version of the distributive relation algebras used by Tarski. Execution is carried out by a rewriting system. We prove adequacy and operational equivalence of the semantics. In the second part of the work, the relation algebraic approach is improved by using allegory theory, a categorical version of the algebra of relations developed by Freyd and Scedrov. The use of allegories lifts the semantics to typed relations, which capture the number of logical variables used by a predicate or program state in a declarative way. A logic program is interpreted in a _-allegory, which is in turn generated from a new notion of Regular Lawvere Category. As in the untyped case, program translation coincides with program interpretation. Thus, we develop a categorical machine directly from the semantics. The machine is based on relation composition, with a pullback calculation algorithm at its core. The algorithm is defined with the help of a notion of diagram rewriting. In this operational interpretation, types represent information about memory allocation and the execution mechanism is more efficient, thanks to the faithful representation of shared state by categorical projections. We finish the work by illustrating how the categorical semantics allows the incorporation into Prolog of constructs typical of Functional Programming, like abstract data types, and strict and lazy functions.