998 resultados para micromechanical damage theory
Resumo:
A modified version of the metallic-phase pseudofermion dynamical theory (PDT) of the 1D Hubbard model is introduced for the spin dynamical correlation functions of the half-filled 1D Hubbard model Mott– Hubbard phase. The Mott–Hubbard insulator phase PDT is applied to the study of the model longitudinal and transverse spin dynamical structure factors at finite magnetic field h, focusing in particular on the sin- gularities at excitation energies in the vicinity of the lower thresholds. The relation of our theoretical results to both condensed-matter and ultra-cold atom systems is discussed.
Resumo:
We study the low frequency absorption cross section of spherically symmetric nonextremal d-dimensional black holes. In the presence of α′ corrections, this quantity must have an explicit dependence on the Hawking temperature of the form 1/TH. This property of the low frequency absorption cross section is shared by the D1-D5 system from type IIB superstring theory already at the classical level, without α′ corrections. We apply our formula to the simplest example, the classical d-dimensional Reissner-Nordstr¨om solution, checking that the obtained formula for the cross section has a smooth extremal limit. We also apply it for a d-dimensional Tangherlini-like solution with α′3 corrections.
Resumo:
We analyze the low frequency absorption cross section of minimally coupled massless scalar fields by different kinds of charged static black holes in string theory, namely the D1–D5 system in d=5 and a four dimensional dyonic four-charged black hole. In each case we show that this cross section always has the form of some parameter of the solution divided by the black hole Hawking temperature. We also verify in each case that, despite its explicit temperature dependence, such quotient is finite in the extremal limit, giving a well defined cross section. We show that this precise explicit temperature dependence also arises in the same cross section for black holes with string \alpha' corrections: it is actually induced by them.
Resumo:
Spinocerebellar ataxia type 3 (SCA3), also known as Machado-Joseph disease (MJD), is an untreatable autosomal dominant neurodegenerative disease, and the most common such inherited ataxia worldwide. The mutation in SCA3 is the expansion of a polymorphic CAG tri-nucleotide repeat sequence in the C-terminal coding region of the ATXN3 gene at chromosomal locus 14q32.1. The mutant ATXN3 protein encoding expanded glutamine (polyQ) sequences interacts with multiple proteins in vivo, and is deposited as aggregates in the SCA3 brain. A large body of literature suggests that the loss of function of the native ATNX3-interacting proteins that are deposited in the polyQ aggregates contributes to cellular toxicity, systemic neurodegeneration and the pathogenic mechanism in SCA3. Nonetheless, a significant understanding of the disease etiology of SCA3, the molecular mechanism by which the polyQ expansions in the mutant ATXN3 induce neurodegeneration in SCA3 has remained elusive. In the present study, we show that the essential DNA strand break repair enzyme PNKP (polynucleotide kinase 3'-phosphatase) interacts with, and is inactivated by, the mutant ATXN3, resulting in inefficient DNA repair, persistent accumulation of DNA damage/strand breaks, and subsequent chronic activation of the DNA damage-response ataxia telangiectasia-mutated (ATM) signaling pathway in SCA3. We report that persistent accumulation of DNA damage/strand breaks and chronic activation of the serine/threonine kinase ATM and the downstream p53 and protein kinase C-d pro-apoptotic pathways trigger neuronal dysfunction and eventually neuronal death in SCA3. Either PNKP overexpression or pharmacological inhibition of ATM dramatically blocked mutant ATXN3-mediated cell death. Discovery of the mechanism by which mutant ATXN3 induces DNA damage and amplifies the pro-death signaling pathways provides a molecular basis for neurodegeneration due to PNKP inactivation in SCA3, and for the first time offers a possible approach to treatment.
Resumo:
Chloroquine has been widely used in rheumatological treatment, but potential severe side effects require careful follow-up. Cardiac damage is not a common consequence, but its clinical relevance has not yet been described. We report the case of a 58-year-old woman with rheumatoid arthritis, in whom chronic chloroquine use resulted in major irreversible cardiac damage. She presented with syncopal episodes due to complete atrioventricular block confirmed by electrophysiological study whose changes were concluded to be irreversible and a permanent pacemaker was indicated. Endomyocardial biopsy was also performed to search for histopathological and ultrastructural cardiac damage. We also reviewed the 22 cases of chloroquine-induced cardiopathy described to date as well as its pathophysiology.
Resumo:
Este proyecto se enmarca en la utlización de métodos formales (más precisamente, en la utilización de teoría de tipos) para garantizar la ausencia de errores en programas. Por un lado se plantea el diseño de nuevos algoritmos de chequeo de tipos. Para ello, se proponen nuevos algoritmos basados en la idea de normalización por evaluación que sean extensibles a otros sistemas de tipos. En el futuro próximo extenderemos resultados que hemos conseguido recientemente [16,17] para obtener: una simplificación de los trabajos realizados para sistemas sin regla eta (acá se estudiarán dos sistemas: a la Martin Löf y a la PTS), la formulación de estos chequeadores para sistemas con variables, generalizar la noción de categoría con familia utilizada para dar semántica a teoría de tipos, obtener una formulación categórica de la noción de normalización por evaluación y finalmente, aplicar estos algoritmos a sistemas con reescrituras. Para los primeros resultados esperados mencionados, nos proponemos como método adaptar las pruebas de [16,17] a los nuevos sistemas. La importancia radica en que permitirán tornar más automatizables (y por ello, más fácilmente utilizables) los asistentes de demostración basados en teoría de tipos. Por otro lado, se utilizará la teoría de tipos para certificar compiladores, intentando llevar adelante la propuesta nunca explorada de [22] de utilizar un enfoque abstracto basado en categorías funtoriales. El método consistirá en certificar el lenguaje "Peal" [29] y luego agregar sucesivamente funcionalidad hasta obtener Forsythe [23]. En este período esperamos poder agregar varias extensiones. La importancia de este proyecto radica en que sólo un compilador certificado garantiza que un programa fuente correcto se compile a un programa objeto correcto. Es por ello, crucial para todo proceso de verificación que se base en verificar código fuente. Finalmente, se abordará la formalización de sistemas con session types. Los mismos han demostrado tener fallas en sus formulaciones [30], por lo que parece conveniente su formalización. Durante la marcha de este proyecto, esperamos tener alguna formalización que dé lugar a un algoritmo de chequeo de tipos y a demostrar las propiedades usuales de los sistemas. La contribución es arrojar un poco de luz sobre estas formulaciones cuyos errores revelan que el tema no ha adquirido aún suficiente madurez o comprensión por parte de la comunidad. This project is about using type theory to garantee program correctness. It follows three different directions: 1) Finding new type-checking algorithms based on normalization by evaluation. First, we would show that recent results like [16,17] extend to other type systems like: Martin-Löf´s type theory without eta rule, PTSs, type systems with variables (in addition to systems in [16,17] which are a la de Bruijn), systems with rewrite rules. This will be done by adjusting the proofs in [16,17] so that they apply to such systems as well. We will also try to obtain a more general definition of categories with families and normalization by evaluation, formulated in categorical terms. We expect this may turn proof-assistants more automatic and useful. 2) Exploring the proposal in [22] to compiler construction for Algol-like languages using functorial categories. According to [22] such approach is suitable for verifying compiler correctness, claim which was never explored. First, the language Peal [29] will be certified in type theory and we will gradually add funtionality to it until a correct compiler for the language Forsythe [23] is obtained. 3) Formilizing systems for session types. Several proposals have shown to be faulty [30]. This means that a formalization of it may contribute to the general understanding of session types.
Resumo:
3
Resumo:
2
Resumo:
1
Resumo:
1916:Feb.-Mar.