Användning av cookies

Lunds universitet använder cookies för att se till att webbplatsen fungerar korrekt och för att förbättra din upplevelse.

Läs mer i vår cookiepolicy

Sökresultat

Filtrera

Nollställ filter

Filtyp

Din sökning på "*" gav 563650 sökträffar

No title

An adaptive resource management system combined with a thermal controller is presented. The aim of the system is to dynamically allocate computing resources to applications competing for the same computing resources in such a way that the system is not overheated. The approach has been implemented on a mobile robot. Experimental results are presented showing the feasibility of the approach.

No title

Nuclear magnetic resonance (NMR) diffusometry provides important information about molecular motion on a microscopic scale. The advantage of NMR diffusometry is its ability to characterise microstructures non-invasively. This has made the method important not only in chemistry, biochemistry and materials science, but also in medicine. Diffusion-weighted magnetic resonance imaging (DW-MRI) has been

No title

The uprisings in the Middle East in 2011 had repercussions in Morocco too, where demonstrators demanded a reform of the political system. The king managed to diffuse the protests by presenting a new constitution which was accepted by 98,5 percent of the voters in a referendum in July 2011. While the new constitution introduces some limited restrictions on the king’s power, the bulk of executive po

No title

Paper 1: Convergent validity of K‐SADS‐PL by comparison with MASC and TRF in a Norwegian clinical sample by M. Villabø and colleagues; Paper 2: Exploring the effectiveness of working memory training in reducing anxiety and improving educational achievement in young people by H. J. Richards and colleagues; Paper 3: OCD in children and adolescents: Effect of treatment and predictors for the results

No title

In the graph motif problem, we are given as input a vertex-colored graph H (the host graph) and a multiset of colors M (the motif). Our task is to decide whether H has a connected set of vertices whose multiset of colors agrees with M. The graph motif problem is NP-complete but known to admit parameterized algorithms that run in linear time in the size of H. We demonstrate that algorithms based on