Essays about: "K2"
Showing result 1 - 5 of 43 essays containing the word K2.
-
1. Påverkan av tid och temperatur vid analys av pH i träckprov från häst
University essay from SLU/Dept. of Clinical SciencesAbstract : Mätning av pH i träck är vanligt förekommande i vetenskapliga artiklar om nutrition och magtarmhälsa på häst. Metoderna för mätning av fekalt pH som beskrivs i litteraturen varierar mellan olika studier vilket gör att det finns en efterfrågan av ett mer standardiserat protokoll för mätning av fekalt pH. READ MORE
-
2. Kaolin-based coating colors with different rheological and water retention properties : Runnability on a lab-and pilot scale
University essay from Karlstads universitet/Institutionen för ingenjörs- och kemivetenskaper (from 2013)Abstract : Food packaging plays a crucial role in protecting and storing food to keep the products fresh and reduce waste. There is a need to increase the number of paper packages in the food industry to meet the growing demand. READ MORE
-
3. Multi-state and Time-varying Covariate Survival Models for Multiple Knee Contractures in People with Cerebral Palsy
University essay from Lunds universitet/Matematisk statistikAbstract : Cerebral palsy is an umbrella term for a group of neurological disorders, affecting motor function, movement and posture. Contractures, restrictions in the range of motion of joints, are a common problem affecting people living with cerebral palsy. READ MORE
-
4. Swedish Concrete Roads : Performance, Damages and Rehabilitation 10-30 Years after Construction
University essay from KTH/BetongbyggnadAbstract : This thesis presents a comprehensive investigation on the performance and durability of five concrete roads in Sweden focusing on the time after 2010. The studied roads include Arlanda, Falkenberg Part 1 (Heberg-Långås), Falkenberg Part 2 (Heberg-Fastarp), Eskilstuna, and Uppsala. READ MORE
-
5. Distance Consistent Labellings and the Local List Number
University essay from Linköpings universitet/Algebra, geometri och diskret matematik; Linköpings universitet/Tekniska fakultetenAbstract : We study the local list number of graphs introduced by Lennerstad and Eriksson. A labelling of a graph on n vertices is a bijection from vertex set to the set {1,…, n}. Given such a labelling c a vertex u is distance consistent if for all vertices v and w |c(u)-c(v)|=|c(u)-c(w)|+1 implies d(u,w)≤ d(u,v). READ MORE