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 536564 sökträffar

Lars Norén : Dramatikern

Popular Abstract in English Swedish theatre around 1970 was socially committed and experimental, in a vibrant time of new forms within an ideological climate. This context forms a paradoxical and important backdrop to Lars Norén’s great success as a traditional, yet innovative playwright in the 1980s. Lars Norén made his debut as a poet in 1963 and as a playwright in 1973, with Fursteslickaren aSwedish theatre around 1970 was socially committed and experimental, in a vibrant time of new forms within an ideological climate. This context forms a paradoxical and important backdrop to Lars Norén’s great success as a traditional, yet innovative playwright in the 1980s. Lars Norén made his debut as a poet in 1963 and as a playwright in 1973, with Fursteslickaren at the Royal Dramatic Theatre

DemokraIT : regional demokrati och ny informationsteknologi

I en tid där det allmänna politiska intresset tycks vara vikande, har många förhoppningar knutits till de nya kommunikationskanalernas demokratiska potential. Dessa förhoppningars eventuella realiserande är ena utgångspunkten för detta arbete. Den andra stödjepunkten är den pågående regionaliseringsprocessen i Sverige, med särskilt fokus på Skåne- och Kalmarregionerna. Bland andra drivkrafter bako

A fast approximation algorithm for TSP with neighborhoods and red-blue separation

In TSP with neighborhoods (TSPN) we are given a collec-tion X of k polygonal regions, called neighborhoods, with totally n ver-tices, and we seek the shortest tour that visits each neighborhood. TheEuclidean TSP is a special case of the TSPN problem, so TSPN is alsoNP-hard. In this paper we present a simple and fast algorithm that, givena start point, computes a TSPN tour of length O(log k) times

Spatially-Coupled Nearly-Regular LDPC Code Ensembles for Rate-Flexible Code Design

Spatially coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform close to the Shannon limit. In this paper we investigate the suitability of coupled regular LDPC code ensembles with respect to rate-flexibility. Regular ensembles with good performance and low complexity exist for a variety of specific code rates. On the other hand it can be