Search for dissertations about: "klas l"
Showing result 1 - 5 of 7 swedish dissertations containing the words klas l.
-
1. Neural Control of Movement : Motor Neuron Subtypes, Proprioception and Recurrent Inhibition
Abstract : Movement is central for life, and all animals depend on accurate regulation of movement for purposeful behavior. There is great diversity of movements, ranging between simple and vital breathing movements to minute and subtle movements of the face used to communicate emotions. READ MORE
-
2. Bioelectronic Nanosensor Devices for Environmental and Biomedical Analysis
Abstract : A new type of Bioelectronic Nanosensor Device with potential applications in medicine,biotechnology and environmental analysis was designed. The nanosensor is based on RISFET (Regional Ion Sensitive Field Effect Transistor) technology. READ MORE
-
3. Kynurenic acid in psychiatric disorders : studies on the mechanisms of action
Abstract : Kynurenic acid, a metabolite of tryptophan along the kynurenine pathway, is an endogenous antagonist at NMDA- and α7* nicotinic acetylcholine- (α7*nACh) receptors. Previous studies have shown that elevated levels of endogenous kynurenic acid are associated with an increased firing of midbrain dopamine neurons as well as a reduced prepulse inhibition (PPI), a behavioral model for sensorimotor gating. READ MORE
-
4. On avoiding and completing edge colorings
Abstract : These papers are all related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend the precoloring to a proper edge coloring avoiding any list assignment? In the first paper, G is a d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and every list assignment L must satisfy certain sparsity conditions. READ MORE
-
5. On avoiding and completing colorings
Abstract : All of my papers are related to the problem of avoiding and completing an edge precoloring of a graph. In more detail, given a graph G and a partial proper edge precoloring φ of G and a list assignment L for every non-colored edge of G, can we extend φ to a proper edge coloring of G which avoids L? In Paper I, G is the d-dimensional hypercube graph Qd, a partial proper edge precoloring φ and a list assignment L must satisfy certain sparsity conditions. READ MORE