SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "(db:Swepub) lar1:(lu) srt2:(1990-1999)"

Search: (db:Swepub) lar1:(lu) > (1990-1999)

  • Result 1-10 of 14495
Sort/group result
   
EnumerationReferenceCoverFind
1.
  •  
2.
  •  
3.
  • Abdel-Motal, Ussama M., et al. (author)
  • Major histocompatibility complex class I binding glycopeptides for the estimation of 'empty' class I molecules
  • 1995
  • In: Journal of Immunological Methods. - : Elsevier BV. - 0022-1759. ; 188:1, s. 21-31
  • Journal article (peer-reviewed)abstract
    • Different forms of major histocompatibility complex (MHC) class I heavy chains are known to be expressed on the cell surface, including molecules which are functionally 'empty'. Direct peptide binding to cells is obvious during sensitization of target cells in vitro for cytotoxic T lymphocyte killing and 'empty' MHC-I molecules are comparatively abundant on TAP- 1 2 peptide transporter mutant cells. In the present work we have estimated the fraction of 'empty' MHC class I molecules using glycosylated peptides and cellular staining with carbohydrate specific monoclonal antibodies. Synthetic Db and Kb binding peptides were coupled at different positions with different di- or trisaccharides, using different spacing between the carbohydrate and the peptide backbone. Binding of sugar specific mAbs was compared in ELISA and cellular assays. An optimal Db binding glycopeptide was used for comparative staining with anti-Db and anti-carbohydrate monoclonal antibodies to estimate fractions of 'empty' molecules on different T lymphoid cells. On activated normal T cells, a large fraction of Db molecules were found to be 'empty'. The functional cole of such 'empty' MHC class I molecules on T cells is presently unclear. However, on antigen presenting cells they might participate in the antigen presentation process.
  •  
4.
  •  
5.
  •  
6.
  • Aberg, Jan, et al. (author)
  • Multialphabet coding with separate alphabet description
  • 1997
  • In: Proceedings. Compression and Complexity of SEQUENCES 1997. - 0818681322 ; , s. 56-65
  • Conference paper (peer-reviewed)abstract
    • For lossless universal source coding of memoryless sequences with an a priori unknown alphabet size (multialphabet coding), the alphabet of the sequence must be described as well as the sequence itself. Usually an efficient description of the alphabet can be made only by taking into account some additional information. We show that these descriptions can be separated in such a way that the encoding of the actual sequence can be performed independently of the alphabet description, and present sequential coding methods for such sequences. Such methods have applications in coding methods where the alphabet description is made available sequentially, such as PPM.
  •  
7.
  • Aberg, J., et al. (author)
  • Non-uniform PPM and context tree models
  • 1998
  • In: Proceedings DCC '98 Data Compression Conference. - 0818684062 ; , s. 279-288
  • Conference paper (peer-reviewed)abstract
    • The problem of optimizing PPM with the help of different choices of estimators and their parameters for different subsets of nodes in the context tree is considered. Methods of such optimization for Markov chain and context tree models for individual files and over given sets of files are presented, and it is demonstrated that the extension from Markov chain models to context tree models is necessary to receive significant improvements of the compression ratio.
  •  
8.
  • Aberg, J., et al. (author)
  • Towards understanding and improving escape probabilities in PPM
  • 1997
  • In: Proceedings DCC '97. Data Compression Conference. - 0818677619 ; , s. 22-31
  • Conference paper (peer-reviewed)abstract
    • The choice of expressions for the coding probabilities in general, and the escape probability in particular, is of great importance in the family of PPM algorithms. We present a parameterized version of the escape probability estimator which, together with a 'compactness' criterion, provides guidelines for the estimator design given a 'representative' set of files. This parameterization also makes it possible to adapt the expression of the escape probability during one-pass coding. Finally, we present results for one such compression scheme that illustrates the usefulness of our approach.
  •  
9.
  • Abkar, Ali (author)
  • Invariant Subspaces in Spaces of Analytic Functions
  • 1999
  • Doctoral thesis (other academic/artistic)abstract
    • Let D be a finitely connected bounded domain with smooth boundary in the complex plane. We first study Banach spaces of analytic functions on D . The main result is a theorem which converts the study of hyperinvariant subspaces on multiply connected domains into the study of hyperinvariant subspaces on domains with fewer holes. The Banach spaces are defined by a natural set of axioms fulfilled by the familiar Hardy, Dirichlet, and Bergman spaces. Let D_1 be a bounded domain obtained from D by adding some of the connectivity components of the complement of D ; hence D_1 has fewer holes. Let B and B_1 be the Banach spaces of analytic functions on the domains D and D_1 , respectively. Assume that I is a hyperinvariant subspace of B_1 , and consider the smallest hyperinvariant subspace of B containing I ; this is Lambda (I) , the closure in B of the span of I cdot M(B) , where M(B) denotes the space of multipliers of B . Under reasonable assumptions, we prove that I mapsto Lambda (I) gives a one-to-one correspondence between a class of hyperinvariant subspaces of B_1 , and a class of hyperinvariant subspaces of B . The inverse mapping is given by J mapsto J cap B_1 . We then generalize the above result to the setting of the quasi-Banach spaces of analytic functions on D . In Chapter IV, we shall establish a Riesz-type representation formula for super-biharmonic functions satisfying certain growth conditions on the unit disk. This representation formula can be regarded as an analogue of the Poisson-Jensen representation formula for subharmonic functions. In Chapter V, this representation formula will be used to prove an approximation theorem in certain weighted Bergman spaces. More precisely, we consider those weighted Bergman spaces whose (non-radial) weights are super-biharmonic and fulfill a certain growth condition. We shall prove that the polynomials are dense in such weighted Bergman spaces.
  •  
10.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-10 of 14495
Type of publication
journal article (7808)
conference paper (1641)
book chapter (1286)
doctoral thesis (1217)
reports (1147)
book (428)
show more...
review (254)
other publication (251)
editorial collection (172)
research review (116)
licentiate thesis (116)
editorial proceedings (40)
artistic work (23)
patent (8)
show less...
Type of content
peer-reviewed (8840)
other academic/artistic (4886)
pop. science, debate, etc. (769)
Author/Editor
Åström, Karl Johan (169)
Svanberg, Sune (156)
Johansson, Rolf (112)
Adlercreutz, Patrick (103)
Hedling, Erik (103)
Tapper, Michael (103)
show more...
Persson, Bertil (88)
Andersson-Engels, St ... (84)
Kärnefelt, Ingvar (84)
Abrahamson, Magnus (81)
Agardh, Carl-David (79)
Persson, Anders (78)
Nyholm, R. (75)
Rantzer, Anders (74)
Mattiasson, Bo (74)
Fagerlund, Göran (73)
Olsson, Håkan (72)
Kristensson, Gerhard (72)
Årzén, Karl-Erik (64)
Baldetorp, Bo (64)
Johannesson, Rolf (64)
Ekberg, Olle (63)
Jönsson, Bodil (62)
Holtås, Stig (62)
Bernhardsson, Bo (62)
Steen, Stig (60)
Andersson, Lars Gust ... (60)
Akselsson, Roland (57)
Hornborg, Alf (55)
Wittenmark, Björn (54)
Jonung, Lars (54)
Widell, Anders (53)
Bengtsson, Lars (52)
Åström, Karl (52)
Andersen, J. N. (52)
Elding, Lars Ivar (52)
Lilja, Hans (50)
Andersson, Greger (50)
Magnusson, Måns (49)
Ståhl, Agneta (49)
Heyden, Anders (49)
Owman, Christer (49)
Svanberg, Katarina (48)
Bohgard, Mats (48)
Hägglund, Tore (47)
Fernö, Mårten (47)
Saxne, Tore (47)
Enkvist, Inger (47)
Olsson, Gustaf (46)
Zander, Ulf (46)
show less...
University
Lund University (14495)
Karolinska Institutet (95)
Linnaeus University (89)
Luleå University of Technology (71)
Uppsala University (70)
Royal Institute of Technology (53)
show more...
Mid Sweden University (24)
Stockholm University (20)
Linköping University (17)
University of Gothenburg (16)
Kristianstad University College (13)
Umeå University (13)
Chalmers University of Technology (12)
Örebro University (10)
Jönköping University (10)
RISE (7)
Malmö University (6)
Swedish National Heritage Board (6)
Blekinge Institute of Technology (6)
Red Cross University College (6)
Södertörn University (5)
Halmstad University (4)
Karlstad University (4)
Högskolan Dalarna (3)
University of Skövde (2)
University of Gävle (1)
Mälardalen University (1)
Stockholm School of Economics (1)
University of Borås (1)
Marie Cederschiöld högskola (1)
VTI - The Swedish National Road and Transport Research Institute (1)
The Institute for Language and Folklore (1)
show less...
Language
English (11048)
Swedish (3172)
Danish (83)
German (81)
French (46)
Spanish (21)
show more...
Chinese (8)
Italian (7)
Norwegian (6)
Russian (5)
Arabic (4)
Latin (2)
Polish (2)
Czech (2)
Other language (2)
Icelandic (1)
Japanese (1)
Greek, Modern (1)
Persian (1)
Korean (1)
Indonesian (1)
show less...
Research subject (UKÄ/SCB)
Medical and Health Sciences (3936)
Engineering and Technology (3314)
Natural sciences (2916)
Humanities (2141)
Social Sciences (1945)
Agricultural Sciences (36)

Year

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view