Search for dissertations about: "inductive"
Showing result 1 - 5 of 349 swedish dissertations containing the word inductive.
-
1. Inductive Pulse Generation
Abstract : Pulsed power generators are a key component in compact systems for generation of high-power microwaves (HPM). HPM generation by virtual cathode devices such as Vircators put high demands on the source. The rise time and the pulse length of the source voltage are two key issues in the generation of HPM radiation. READ MORE
-
2. Respiratory inductive plethysmography (RIP) : calibration, breathing pattern analysis and external CO2 dead space measurement
Abstract : Respiratory inductive plethysmography (RIP) is an important tool for ventilatory monitoring in research studies because it has minimal influence on the spontaneous breathing pattern and because the rib cage and abdominal contributions to the breaths are measured. RIP measures changes in rib cage and abdominal cross-sectional areas which are translated into lung volume estimates via RIP calibration against e. READ MORE
-
3. Tree Transformations in Inductive Dependency Parsing
Abstract : This licentiate thesis deals with automatic syntactic analysis, or parsing, of natural languages. A parser constructs the syntactic analysis, which it learns by looking at correctly analyzed sentences, known as training data. The general topic concerns manipulations of the training data in order to improve the parsing accuracy. READ MORE
-
4. Tree Transformations in Inductive Dependency Parsing
Abstract : This licentiate thesis deals with automatic syntactic analysis, or parsing, of natural languages. A parser constructs the syntactic analysis, which it learns by looking at correctly analyzed sentences, known as training data. The general topic concerns manipulations of the training data in order to improve the parsing accuracy. READ MORE
-
5. Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them
Abstract : This thesis consists of two parts. Both concern reasoning about non-strict functional programming languages with partial and infinite values and lifted types, including lifted function spaces.The first part is a case study in program verification: We have written a simple parser and a corresponding pretty-printer in Haskell. READ MORE