Search for dissertations about: "General Linear Model"
Showing result 1 - 5 of 405 swedish dissertations containing the words General Linear Model.
-
1. Regular Model Checking
Abstract : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. READ MORE
-
2. The Quest for Robust Model Selection Methods in Linear Regression
Abstract : A fundamental requirement in data analysis is fitting the data to a model that can be used for the purpose of prediction and knowledge discovery. A typical and favored approach is using a linear model that explains the relationship between the response and the independent variables. READ MORE
-
3. A new non-linear GARCH model
Abstract : This dissertation contains four papers in the field of financial econometrics. In the first paper, A Smooth Transition ARCH Model for Asset Returns, a new class of ARCH models is introduced. The model class allows for non-linearity in the equation for the conditional variance. READ MORE
-
4. Stochastic model updating and model selection with application to structural dynamics
Abstract : Uncertainty induced by our incomplete state of knowledge about engineering systems and their surrounding environment give rise to challenging problems in the process of building predictive models for the system behavior. One such challenge is the model selection problem, which arises due to the existence of invariably multiple candidate models with different mathematical forms to represent the system behavior, and so there is a need to assess their plausibility based on experimental data. READ MORE
-
5. Regular model checking
Abstract : We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings. READ MORE