Sökresultat
Filtrera
Filtyp
Din sökning på "*" gav 534696 sökträffar
Coded IDMA system performance with parallel interleavers
In this paper we evaluate the use of parallel interleavers for user separation in coded IDMA systems. The parallel interleavers have previously been evaluated for uncoded systems, and we here present extended results for the coded case. The new results are important for real systems, as they will most likely use performance enhancing channel coding. The parallel interleavers are designed to remove
Discources, actors and instruments in international forest governance
Politics are not only about interests and institutions but discourses as well. Discourses are (dominant) ideas, concepts and categorisations in a society that give meaning to reality and that shape the identities, interests and preferences of individuals and groups. The assumption of this chapter is that forest discourses are constitutive to global forest politics. Three forest-related types of di
Marketing in start-ups
Nerve injury and repair: from molecule to man
High bandwidth iterative decoding in a fading environment
Meet the Pioneers: Early Lindsay Anderson
Study of rare industrial films directed by Lindsay Anderson in the 1940s and early 1950s.
No title
Det röda Lund
Introduction
Do as I say, not as I do
Ethanol production by recombinant and natural xylose-utilising yeasts
The xylose-fermenting capacity of recombinant Saccharomyces cerevisiae carrying XYL1 and XYL2 from Pichia stipitis, which encode xylose reductase (XR) and xylitol dehydrogenase (XDH), respectively, is poor due to high xylitol formation. Whereas, P. stipitis exhibits high ethanol yield on xylose, the tolerance towards inhibitors in the lignocellulosic hydrolysate is low. A recombinant strain posses
Paradiset bland bergen? Ladakh som imaginär geografi
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
Go'morgen Danmark!
No title
The Empty Left Edge Condition
Collective Identities in an Era of Transformations. Analysing Developments in East and Central Europe and the Former Soviet Union
Abstract is not available