MA348exam 1999

Exam questions and solutions in LaTex

Exercise sheet 3 pdf

Exercises and solutions in PDF

Exercise sheet 3

Exercises and solutions in LaTex

MA348exam 2000 pdf

Exam questions and solutions in PDF

MA348exam 2000

Exam questions and solutions in LaTex

MA348exam 1999 pdf

Exam questions and solutions in PDF

Láser Excimer en Vitiligo. ¿Tratamiento efectivo y seguro para esta enfermedad? Revisión sistemática de la literatura

Introducción: El vitíligo es una enfermedad prevalente en nuestro medio con una prevalencia del 2% de la población mundial. Los síntomas de esta enfermedad son principalmente estéticos al manifestarse como máculas acrómicas, simétricas en las extremidades y en rostro donde genera la mayor estigmatización de los pacientes. Actualmente ningún tratamiento provee mejoría pronta y permanente de los síntomas. Objetivo: Determinar la efectividad del Láser Excimer 308 nm en el tratamiento del vitíligo por medio de una revisión sistemática de la literatura. Métodos: Búsqueda sistemática de ensayos clínicos y estudios cuasiexperimentales en las bases de datos más importantes acerca de la efectividad del Láser Excimer 308 nm en la repigmentación de los pacientes adultos con vitíligo. Se evaluó su calidad metodológica. Resultados: De 862 artículos encontrados se escogieron 40 artículos potenciales de los cuales dos fueron incluidos en esta revisión. El láser Excimer 308 nm como monoterapia presenta una pigmentación efectiva (≥50%) en 28.03% de las áreas tratadas, de los cuales 72.9% se localizaron en áreas sensibles a radiación ultravioleta y 27.02% en zonas no sensibles. Inicio de pigmentación a la sesión número 13 (un mes post inicio del tratamiento). El láser fue seguro y bien tolerado. Conclusión: La evidencia sugiere que el tratamiento con Láser Excimer 308 nm, como monoterapia, es una alternativa terapéutica para lograr repigmentación pronta de las máculas acrómicas del vitíligo en áreas sensibles a radiación ultravioleta. Deben considerarse estudios que evalúen combinaciones de fármacos y Láser en el tratamiento de vitíligo.

Abordajes teóricos en la comprensión de la influencia de los recursos económicos en la actividad física

Estudio cualitativo que analiza los abordajes teóricos utilizados por diferentes autores en la comprensión de la influencia de los recursos económicos en la actividad física desde los modelos de determinantes y determinación social.

A fast identification algorithm for Box-Cox transformation based radial basis function neural network

In this letter, a Box-Cox transformation-based radial basis function (RBF) neural network is introduced using the RBF neural network to represent the transformed system output. Initially a fixed and moderate sized RBF model base is derived based on a rank revealing orthogonal matrix triangularization (QR decomposition). Then a new fast identification algorithm is introduced using Gauss-Newton algorithm to derive the required Box-Cox transformation, based on a maximum likelihood estimator. The main contribution of this letter is to explore the special structure of the proposed RBF neural network for computational efficiency by utilizing the inverse of matrix block decomposition lemma. Finally, the Box-Cox transformation-based RBF neural network, with good generalization and sparsity, is identified based on the derived optimal Box-Cox transformation and a D-optimality-based orthogonal forward regression algorithm. The proposed algorithm and its efficacy are demonstrated with an illustrative example in comparison with support vector machine regression.

Morphological decomposition in Broca's aphasia

Background: Few studies have investigated how individuals diagnosed with post-stroke Broca’s aphasia decompose words into their constituent morphemes in real-time processing. Previous research has focused on morphologically complex words in non-time-constrained settings or in syntactic frames, but not in the lexicon. Aims: We examined real-time processing of morphologically complex words in a group of five Greek-speaking individuals with Broca’s aphasia to determine: (1) whether their morphological decomposition mechanisms are sensitive to lexical (orthography and frequency) vs. morphological (stem-suffix combinatory features) factors during visual word recognition, (2) whether these mechanisms are different in inflected vs. derived forms during lexical access, and (3) whether there is a preferred unit of lexical access (syllables vs. morphemes) for inflected vs. derived forms. Methods & Procedures: The study included two real-time experiments. The first was a semantic judgment task necessitating participants’ categorical judgments for high- and low-frequency inflected real words and pseudohomophones of the real words created by either an orthographic error at the stem or a homophonous (but incorrect) inflectional suffix. The second experiment was a letter-priming task at the syllabic or morphemic boundary of morphologically transparent inflected and derived words whose stems and suffixes were matched for length, lemma and surface frequency. Outcomes & Results: The majority of the individuals with Broca’s aphasia were sensitive to lexical frequency and stem orthography, while ignoring the morphological combinatory information encoded in the inflectional suffix that control participants were sensitive to. The letter-priming task, on the other hand, showed that individuals with aphasia—in contrast to controls—showed preferences with regard to the unit of lexical access, i.e., they were overall faster on syllabically than morphemically parsed words and their morphological decomposition mechanisms for inflected and derived forms were modulated by the unit of lexical access. Conclusions: Our results show that in morphological processing, Greek-speaking persons with aphasia rely mainly on stem access and thus are only sensitive to orthographic violations of the stem morphemes, but not to illegal morphological combinations of stems and suffixes. This possibly indicates an intact orthographic lexicon but deficient morphological decomposition mechanisms, possibly stemming from an underspecification of inflectional suffixes in the participants’ grammar. Syllabic information, however, appears to facilitate lexical access and elicits repair mechanisms that compensate for deviant morphological parsing procedures.

The signature of a rough path: uniqueness

In the context of controlled differential equations, the signature is the exponential function on paths. B. Hambly and T. Lyons proved that the signature of a bounded variation path is trivial if and only if the path is tree-like. We extend Hambly–Lyons' result and their notion of tree-like paths to the setting of weakly geometric rough paths in a Banach space. At the heart of our approach is a new definition for reduced path and a lemma identifying the reduced path group with the space of signatures.

On C(r)-closing for flows on orientable and non-orientable 2-manifolds

We provide an affirmative answer to the C(r)-Closing Lemma, r >= 2, for a large class of flows defined on every closed surface.

Weak hypergraph regularity and linear hypergraphs

We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers l >= k >= 2 and every d > 0 there exists Q > 0 for which the following holds: if His a sufficiently large k-uniform hypergraph with the property that the density of H induced on every vertex subset of size on is at least d, then H contains every linear k-uniform hypergraph F with l vertices. The main ingredient in the proof of this result is a counting lemma for linear hypergraphs, which establishes that the straightforward extension of graph epsilon-regularity to hypergraphs suffices for counting linear hypergraphs. We also consider some related problems. (C) 2009 Elsevier Inc. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

An eigenvalue problem for the biharmonic operator on Z(2)-symmetric regions

In this work we show that the eigenvalues of the Dirichlet problem for the biharmonic operator are generically simple in the set Of Z(2)-symmetric regions of R-n, n >= 2, with a suitable topology. To accomplish this, we combine Baire`s lemma, a generalised version of the transversality theorem, due to Henry [Perturbation of the boundary in boundary value problems of PDEs, London Mathematical Society Lecture Note Series 318 (Cambridge University Press, 2005)], and the method of rapidly oscillating functions developed in [A. L. Pereira and M. C. Pereira, Mat. Contemp. 27 (2004) 225-241].