Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Prospective evaluation of interferon-α in treatment of chronic active Crohn's disease (1995)
    Springer
    Digestive diseases and sciences 40 (1995), S. 800-804 
    Details
    ISSN: 1573-2568
    Keywords: Crohn's disease ; interferon-α ; interleukin-6
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Several case reports suggested good effects of interferon-α in patients with Crohn's disease. In addition, a decreased production of interferon-α in Crohn's disease has been shownin vitro. Treatment with interferon-α may activate intestinal natural killer cells and down-regulate the overproduction of inflammatory cytokines like interleukin-6 in Crohn's disease. To evaluate the clinical efficacy of interferon-α, we treated 12 patients with a chronic active course of Crohn's disease with recombinant human interferon-α prospectively for 24 weeks. Prednisolone was continuously tapered and discontinued at week 12. The end point of the study was the prevention of worsening of clinical symptoms defined with the Crohn's disease activity index and was monitored by acute-phase proteins, interleukin-6 serum concentrations, and endoscopy. The biochemical activity of interferon-α was measured by 2′,5′-oligo adenylate serum levels. The end point of the study was reached in four patients (33%). In these patients the final Crohn's disease activity index was above 150, which means that they did not achieve clinical remission. All other patients (66%) did not respond to interferon-α and had to be withdrawn prematurely. Interferon-α did not show any beneficial effect on interleukin-6 or acute-phase protein concentrations and on endoscopic activity. The 2′,5′-oligo adenylate levels continuously increased during interferon therapy. Considerable side effects were noted. These results fail to demonstrate a therapeutic role of interferon-α in chronic active Crohn's disease.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02064982
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Gasreinigung mit Reinigungsmassen auf KohlebasisVortrag auf dem 11. Tutzing-Symposium der DECHEMA über „Grenzflächenvorgänge an festen Oberflächen“, 18./21. Februar 1974. (1974)
    Weinheim : Wiley-Blackwell
    Chemie Ingenieur Technik - CIT 46 (1974), S. 757-762 
    Details
    ISSN: 0009-286X
    Keywords: Chemistry ; Industrial Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: Die Adsorption an Aktivkohle hat großtechnische Bedeutung vor allem bei der Lösemittel-Rückgewinnung, der Gasgemisch-Trennung, der Gasreinigung und in letzter Zeit in verstärktem Maße bei der Luftreinhaltung erlangt. Dabei ist neben der reinen Adsorption oft auch die Kapillarkondensation wesentlich und auch der Grund für die hohe Beladefähigkeit der Aktivkohle. Zur Abscheidung geringer Substanzmengen ist manchmal auch das Aufbringen einer Imprägnierung vorteilhaft, die sowohl durch rein chemische Umsetzung als auch in anderen Fällen durch katalytische Eigenschaften wirken kann. Es werden abschließend mehrere großtechnische Verfahren erläutert, und zwar das Supersorbon-Verfahren zur Lösemittel-Rückgewinnung, das Sulfosorbon-Verfahren zur Viskoseabluft-Reinigung sowie das Sulfreen-Verfahren zur Reinigung der Restgase von Claus-Öfen.
    Additional Material: 7 Ill.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1002/cite.330461803
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    facet.materialart.
    Unknown
    Graphentheoretische Konzepte und Algorithmen (2000)
    Details
    Publication Date: 2020-11-13
    Description: Das vorliegende Skript bietet eine Einf{ü}hrung in die Graphentheorie und graphentheoretische Algorithmen. Im zweiten Kapitel werden Grundbegriffe der Graphentheorie vorgestellt. Das dritte Kapitel besch{ä}ftigt sich mit der Existenz von Wegen in Graphen. Hier wird auch die L{ö}suung des ber{ü}hmten K{ö}nigsberger Br{ü}ckenproblems aufgezeigt und der Satz von Euler bewiesen. Im vierten Kapitel wird gezeigt, wie man auf einfache Weise die Zusammenhangskomponenten eines Graphen bestimmen kann. Im Kapitel sechs wird dann sp{ä}ter mit der Tiefensuche ein Verfahren vorgestellt, das schneller arbeitet und mit dessen Hilfe man noch mehr Informationen {ü}ber die Struktur eines Graphen gewinnen kann. In den folgenden Kapiteln werden Algorithmen vorgestellt, um minimale aufspannenden B{ä}ume, k{ü}rzeste Wege und maximale Fl{ü}sse in Graphen zu bestimmen. Am Ende des Skripts wird ein kurzer Einblick in die planaren Graphen und Graphhomomorphismen geboten.
    Keywords: ddc:000
    Language: German
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 4
    facet.materialart.
    Unknown
    Euler is Standing in Line (1999)
    Details
    Publication Date: 2020-11-13
    Description: In this paper we study algorithms for ``Dial-a-Ride'' transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be NP-hard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorithm on paths and an approximation algorithm on general graphs with a performance of~$9/4$. For trees we improve the performance to~$5/3$.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 5
    facet.materialart.
    Unknown
    Budgeted Maximal Graph Coverage (2002)
    Details
    Publication Date: 2020-11-17
    Description: An instance of the \emph{maximum coverage} problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground elements is specified by the nodes of a graph, while the family of covering sets is restricted to connected subgraphs. We show that on general graphs the problem is polynomial time solvable if restricted to sets of size at most~$2$, but becomes NP-hard if sets of size~$3$ are permitted. On trees, we prove polynomial time solvability if each node appears in a fixed number of sets. In contrast, if vertices are allowed to appear an unbounded number of times, the problem is NP-hard even on stars. We finally give polynomial time algorithms for special cases where the subgraphs form paths and the host graph is a line, a cycle or a star.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...