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

No title

Background: Metabolic complications with obesity are frequent in childhood acute lymphoblastic leukemia (ALL) survivors treated with cranial radiotherapy (CRT). Childhood onset Craniopharyngioma (CP) survivors without hypothalamic (HT) involvement are spared gross obesity. Magnetic resonance diffusion tensor imaging (DTI) provides information of microstructure function of the brain and quantified

No title

Many industrially relevant emulsification devices are of the high-energy type, where drop deformation and subsequent breakup, take place due to intense turbulent fluid–drop interactions. This includes high-pressure homogenizers as well as rotor-stator mixers (also known as high-shear mixers) of various designs. The stress acting on a drop in a turbulent flow field varies over time, occasionally re

No title

In this comment we show that a recently proposed public key cryptosystem is not safe for most of the practical cases. Furthermore, it is shown that the security of this system is closely connected with the problem of computing logarithms over a finite field.

No title

Various constructions of authentication codes using spaces related to the general linear group have been proposed and analyzed. In the paper the authors describe two new constructions of Cartesian authentication codes using symplectic spaces. This illustrates the feasibility of codes from spaces based on geometries of the other classical groups.

No title

Group authentication schemes as introduced by Boyd and by Desmedt and Frankel are cryptographic schemes in which only certain designated groups can provide messages with authentication information. In this paper we study unconditionally secure group authentication schemes based on linear perfect secret sharing and authentication schemes, for which we give expressions for the probabilities of succe

No title

The long standing question whether the free distance of fixed rate convolutional codes is as good as the Costello bound was almost solved by K.S. Zigangirov and J.L. Massey (1987). They proved that this is indeed the case for codes with long branch length and rates 2/c, c>or=5. It is shown that there exist fixed convolutional codes of rate 2/4 whose free distance d/sub free/ meets the Costello bou