858 research outputs found

    Adenocarcinoma vulvare metastatico: un caso diagnosticato tardivamente

    No full text
    The case of a woman aged 80 who had suffered from an "eczematous" , fixed and progressively extending plaque of the external genitalia is reported. After 1 year of inappropriate treatments (topical antimycotic agents and corticosteroids), the condition was properly, but lately, diagnosed as Paget's disease of the vulva. The staging was T3/N2/M1 (FIGO IVB), that is, too late for a timely definitive surgery. Histogenesis, biological basis, and treatment problems of extramammary Paget's disease are briefly discussed, along with the puzzling fact that this diagnosis is still unwarrantedly missed. The necessity to recur to anecdotal, empirical treatments for rare severe conditions is also underlined

    The use of Pimecrolimus cream 1% in the treatment of facial psoriasis.

    No full text
    Aim. To evaluate the efficacy of pimecrolimus cream 1% in patients with facial psoriasis. Methods. In this open study, 40 patients of both sexes (27 males and 13 females) aged between 18 and 75 years (mean age: 48.3 years) with psoriasis vulgaris affecting also the face (PASI ≤12) have been treated with pimecrolimus cream 1%. The drug has been applied to the facial lesions twice daily for 2 months. Results. Upon completion of treatment, the complete resolution of the lesions has been documented in 42.5% of cases (17 patients), and an improvement in all symptoms of erythema, desquamation and infiltration in 52.5% of cases (21 patients). Only 1 patient interrupted the treatment due to intolerance to the drug. Conclusions. In our study pimecrolimus cream 1% has shown a high level of efficacy and good tolerability in the majority of cases treated, revealing itself to be a valid therapeutic option in the treatment of facial psoriasis

    Language Engineering in Grammatical Framework (GF)

    No full text
    This thesis describes a number of practical experiments rather than theoreticalinvestigations in the area of natural language processing. The basis forthe work presented is Grammatical Framework (GF). It is a very complexsystem, which comprises among other things a grammar formalism based ontype theory and its implementation written in Haskell. GF is intended forhigh-quality machine translation (of INTERLINGUA type) in the restrictedlanguage domains.The primary concern of this thesis is however limited to the usage of GFas a piece of software. The main results are: Implementing a syntax editor, which provides a graphical user interface(GUI) for the command-line GF core. Writing a part of code for automatic generation of gramletspure Javaprograms with limited (compared to GF) functionality that can be runon PDA (Portable Device Assistants) and as applets in a browser. Writing the Russian resource grammar that takes care of the most basicmorphological and syntactic rules and serves as a standard libraryfor building application grammars (describing restricted language domains)in Russian.These results contribute to language engineering in GF on two differentlevels: Author level (end-user) constructing sentences in natural languages. Grammarian level building a grammar description, which is laterused on the author level.The last part of the thesis deals with a non-linguistic domain. In thatexperiment we try to apply functional parsing technique to the well-knownproblem of protein secondary structure prediction (bioinformatics)

    Language Engineering in Grammatical Framework (GF)

    No full text
    This thesis describes a number of practical experiments rather than theoreticalinvestigations in the area of natural language processing. The basis forthe work presented is Grammatical Framework (GF). It is a very complexsystem, which comprises among other things a grammar formalism based ontype theory and its implementation written in Haskell. GF is intended forhigh-quality machine translation (of INTERLINGUA type) in the restrictedlanguage domains.The primary concern of this thesis is however limited to the usage of GFas a piece of software. The main results are: Implementing a syntax editor, which provides a graphical user interface(GUI) for the command-line GF core. Writing a part of code for automatic generation of gramletspure Javaprograms with limited (compared to GF) functionality that can be runon PDA (Portable Device Assistants) and as applets in a browser. Writing the Russian resource grammar that takes care of the most basicmorphological and syntactic rules and serves as a standard libraryfor building application grammars (describing restricted language domains)in Russian.These results contribute to language engineering in GF on two differentlevels: Author level (end-user) constructing sentences in natural languages. Grammarian level building a grammar description, which is laterused on the author level.The last part of the thesis deals with a non-linguistic domain. In thatexperiment we try to apply functional parsing technique to the well-knownproblem of protein secondary structure prediction (bioinformatics)

    Language Engineering in Grammatial Framework (GF)

    No full text
    The basis for the work presented is Grammatical Framework (GF)—a grammar formalism based on type theory. It is also a powerful language processor that provides a convenient framework for various multilingual applications. The primary concern of this thesis is the usage of GF as a piece of software. The main results are: • Implementing a syntax editor, which provides a graphical user interface (GUI) for the command-line GF core. • Writing the Russian resource grammar that takes care of the most basic morphological and syntactic rules and serves as a standard library for building application grammars (describing sublanguage domains) in Russian. These results contribute to language engineering in GF on two different levels: • Author level (end-user)—constructing documents in natural languages. • Grammarian level — building a grammar description, which is later used on the author level. One can also distinguish between application and resource grammars. An application grammar focuses of a particular sub-language domain, while resource grammar is a general-purpose grammar that forms a basis for application grammars

    Internship at GoFoton GF Micro Optics Philippines, Inc.

    No full text
    This paper is a compilation of the internship of the author in the 1st semester of the academic year 2012-2013. It serves as a documentation of the activities that transpired in the internship of the author in GF Micro Optics Philippines, Inc. from May, 1012 until August, 2012. Included in this paper are the company profile, experiences of the author in the company, and the tasks assigned while taking the training course. Process flow improvement was the main task of the author as his main role under the Industrial Engineering Department of GF Micro Optics Philippines, Inc. Furthermore, the paper includes problems encountered and lessons learned by the author throughout the training course. These lessons include time management, co-worker management, task management, and enhancement of the authors whole being and skills such as problem solving. All are explained in this manuscript in order to provide self and academic evaluation of the authors training

    Linear complexity profile of sequences over the field GF(Q)

    No full text
    Summary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests

    Linear complexity profile of sequences over the field GF(Q)

    No full text
    Summary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests

    Thesis for the Degree of Doctor of Philosophy Language Engineering in Grammatical Framework (GF)

    No full text
    The basis for the work presented is Grammatical Framework (GF) — a grammar formalism based on type theory. It is also a powerful language processor that provides a convenient framework for various multilingual applications. The primary concern of this thesis is the usage of GF as a piece of software. The main results are: • Implementing a syntax editor, which provides a graphical user interface (GUI) for the command-line GF core. • Writing the Russian resource grammar that takes care of the most basic morphological and syntactic rules and serves as a standard library for building application grammars (describing sublanguage domains) in Russian. These results contribute to language engineering in GF on two different levels: • Author level (end-user) — constructing documents in natural languages. • Grammarian level — building a grammar description, which is later used on the author level. One can also distinguish between application and resource grammars. An application grammar focuses of a particular sub-language domain, while resource grammar is a general-purpose grammar that forms a basis for application grammars
    corecore