Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • 1990-1994  (2)
  • 1993  (1)
  • 1991  (1)
Materialart
Erscheinungszeitraum
  • 1990-1994  (2)
Jahr
  • 1
    ISSN: 1420-908X
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Medizin
    Notizen: Abstract Protein kinase C (PKC) mediates a number of intracellular signal transduction pathways implicated in the pathogenesis of inflammation, including phospholipase A2-dependent arachidonic acid release and eicosanoid production. Recent studies demonstrate that the PKC inhibitor GF109203X significantly reduces a number of inflammatory processes resulting from PKC activation by the topical application of phorbol myristate acetate (PMA) to mouse ears. In this model, GF109203X significantly reduced edema at doses similar to the PKC inhibitor staurosporine, and more effectively than indomethacin, zileuton, or sodium meclofenamate. Histological and biochemical analysis of biopsies from control and drug-treated ears revealed a marked reduction in edema, infiltrating neutrophils, and levels of the neutrophil-specific marker, myeloperoxidase, in GF109203X-treated mice. Prostaglandin E2 levels were also reduced in ears treated with GF109203X. These data suggest that GF109203X is an effective antiinflammatory agent as evaluated in the PMA model of edema, and implicates PKC as a potential target in the development of novel anti-inflammatory agents.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 50 (1991), S. 113-121 
    ISSN: 1436-4646
    Schlagwort(e): Matching problem ; two-phase approach ; fast matching algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we describe computational results for a modification of the shortest augmenting path approach for solving large scale matching problems. Using a new assignment start procedure and the two-phase strategy, where first the problem is solved on a sparse subgraph and then reoptimization is used, matching problems on complete graphs with 1000 nodes are solved in about 10–15 seconds on an IBM 4361.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...