846 research outputs found
Signal-averaged electrocardiogram in patients with arrhythmogenic right ventricular cardiomyopathy and ventricular arrhythmias
No full textOBJECTIVE:
The aim of the study was to assess the prevalence, sensitivity, specificity and predictive value of the signal-averaged ECG in patients with arrhythmogenic right ventricular cardiomyopathy and different forms of ventricular arrhythmias.
METHODS:
The signal averaged ECG in 138 patients and 146 healthy subjects (control group), using a three bandpass filter system (25-250, 40-250, 80-250 Hz), was considered abnormal when at least two parameters were abnormal at each filter setting. Patients were divided into three groups according to the extent of the right ventricular enlargement (mild, moderate, extensive), and into five groups according to the type of ventricular arrhythmia.
RESULTS:
The signal averaged ECG was abnormal in 57% of the patients and in 4% of the healthy subjects. The sensitivity was 57%, specificity 95% and positive predictive value 92%. The signal averaged ECG was abnormal in 94.4% of patients with the extensive form of the disease, in 77.7% of patients with the moderate form and in 31.8% of patients with the minor form, demonstrating good correlation with the extent of the disease. According to the type of ventricular arrhythmia, a higher correlation was found between signal averaged ECG abnormality and sustained ventricular tachycardia with superior axis (94.4%, P<0. 02); the correlation for the other arrhythmias varied from 16.6% to 55.8%.
CONCLUSION:
There is a closer correlation between the signal averaged ECG and extent of disease than with the presence of ventricular arrhythmias. The signal averaged ECG is not helpful in diagnosing minor forms of the disease, but since it is a non-invasive method, it may be useful in evaluating progression of the disease
Complete A-V block after heart transplantation: incidence, cause and clinical-electrophysiologic features
No full textLanguage Engineering in Grammatical Framework (GF)
No full textThis 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 textThis 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 textThe 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 textThis 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 textSummary 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 textSummary 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
- …
