Search for dissertations about: "functional limitations"
Showing result 1 - 5 of 218 swedish dissertations containing the words functional limitations.
-
1. Functional association networks for disease gene prediction
Abstract : Mapping of the human genome has been instrumental in understanding diseasescaused by changes in single genes. However, disease mechanisms involvingmultiple genes have proven to be much more elusive. Their complexityemerges from interactions of intracellular molecules and makes them immuneto the traditional reductionist approach. READ MORE
-
2. Atomistic modelling of functional solid oxides for industrial applications : Density Functional Theory, hybrid functional and GW-based studies
Abstract : In this Thesis a set of functional solid oxides for industrial applications have been addressed by first principles and thermodynamical modelling. More specificially, measurable quantities such as Gibbs free energy, geometry and electronic structure have been calculated and compared when possible with experimental data. READ MORE
-
3. Egressibility : Applying the concept of accessibility to the self-evacuation of people with functional limitations
Abstract : The population is getting increasingly older, and old age is correlated with decreased functional capacity. In society, continuous improvements in accessibility of public environments is apparent. READ MORE
-
4. Lean in the Public Sector : Possibilities and Limitations
Abstract : The demands on efficiency and quality in the public sector have increased over the past few years, which have raised the need for strategies on how the public sector can be improved (Denhardt and Denhardt, 2000). Consequently, the concept of Lean production, or just Lean, have become increasingly spread, especially in health care, but also in government agencies, police, military and social services. READ MORE
-
5. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
Abstract : In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal algebra. READ MORE