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
    Algorithmen zum automatischen Zeichnen von Graphen (1997)
    Springer
    Informatik-Spektrum 20 (1997), S. 199-207 
    Details
    ISSN: 1432-122X
    Keywords: Schlüsselwörter  Automatisches Graphenzeichnen ; Algorithmen ; Planarisierung ; Kreuzungsminimierung ; Grapheneditoren ; Key words  Automatic graph drawing ; Algorithms ; Planarization ; Crossing minimization ; Graph editors
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Summary   Graph drawing is a new and growing area in Computer Science. It is concerned with the design, analysis, implementation and evaluation of new algorithms for aesthetically nice drawings of graphs. Through the use of some selected examples of applications, typical problems, and solutions, we would like to provide an introduction into this still relatively unknown field. And we survey activities and goals of a working group consisting of members of the universities of Halle, Köln and Passau and the Max-Planck-Institut für Informatik in Saarbrücken, that is funded by the German Science Foundation DFG under the program „Efficient Algorithms for Discrete Problems and their Applications“.
    Notes: Zusammenfassung   Das Zeichnen von Graphen ist ein junges aufblühendes Gebiet der Informatik. Es befaßt sich mit Entwurf, Analyse, Implementierung und Evaluierung von neuen Algorithmen für ästhetisch schöne Zeichnungen von Graphen. Anhand von selektierten Anwendungsbeispielen, Problemstellungen und Lösungsansätzen wollen wir in dieses noch relativ unbekannte Gebiet einführen und gleichzeitig einen Überblick über die Aktivitäten und Ziele einer von der DFG im Rahmen des Schwerpunktprogramms „Effiziente Algorithmen für Diskrete Probleme und ihre Anwendungen“ geförderten Arbeitsgruppe aus Mitgliedern der Universitäten Halle, Köln und Passau und des Max-Planck-Instituts für Informatik in Saarbrücken geben.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s002870050066
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Gefäßsport zur ambulanten Therapie venöser Durchblutungsstörungen der Beine Diagnostische, therapeutische und prognostische Aspekte (1997)
    Springer
    Der Hautarzt 48 (1997), S. 384-390 
    Details
    ISSN: 1432-1173
    Keywords: Schlüsselwörter Arthrogenes Stauungssyndrom ; Chronische Veneninsuffizienz ; Gefäßsport ; Gelenkbeweglichkeit ; Ulcus cruris ; Muskelpumpe ; Key words Arthrogenic congestive syndrome ; Chronic venous insufficiency ; Physical exercise training ; Ankle joint mobility ; Calf muscle pump ; Venous ulcer
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Description / Table of Contents: Summary In 33 patients with chronic venous incompetence (CVI) caused by primary varicoses or postthrombotic syndrome stage I–III (according to Widmer) the therapeutic benefit of 6 months of medically supervised physical exercise training was documented. During the training penud there was an improvement in subjective complains such as pain and tendency for edema in the legs. Mobility in the upper ankle joint was improved asuss as venous drainage function. Clinical benefit was achieved in the reduction of ulcer size; 7 of 10 ulcers completely healed. Medically supervised physical exercise training and optimized compression therapy are basic therapeutic approaches in conservative treatment in chronic venous insufficiency. Costs are covered by the patient’s health insurance company in Germany, as long as the exercise training is medically supervised.
    Notes: Zusammenfassung In einer klinischen Untersuchung bei 33 Patienten mit chronischer Veneninsuffizienz aufgrund primärer Varikose oder eines postthrombotischen Syndroms in den klinischen Stadien I bis III nach Widmer konnte der Therapieerfolg eines halbjährigen krankheitsspezifischen ambulanten Bewegungstrainings dokumentiert werden. Während des Trainings kam es zu einer deutlichen Besserung stauungsbedingter subjektiver Beschwerden wie Schmerzen und Ödemneigung sowie zu einer Verbesserung von Sprunggelenkbeweglichkeit und venöser Abpumpleistung. Der klinische Erfolg zeigte sich in einer kompletten Abheilung venöser Ulzera bei 7 von 10 Patienten. In Verbindung mit einer optimierten Kompressionstherapie stellt die Gefäßsporttherapie eine effiziente und kostengünstige Basistherapie bei der CVI dar. Auf der Grundlage des novellierten Deutschen Behindertensportabkommens aus dem Jahre 1994 werden die Kosten von den gesetzlichen Krankenkassen getragen, solange das Training unter qualifizierter Anleitung indiziert ist.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/s001050050598
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    facet.materialart.
    Unknown
    Quadratic 0/1 Optimization and a Decomposition Approach for the Placement of Electronic Circuits. (1992)
    Details
    Publication Date: 2020-10-05
    Description: The placement in the layout design of electronic circiuts consists of finding a non- overlapping assignment of rectangular cells to positions on the chip so what wireability is guaranteed and certain technical constraints are met.This problem can be modelled as a quadratic 0/1- program subject to linear constraints. We will present a decomposition approach to the placement problem and give results about $NP$-hardness and the existence of $\varepsilon$-approximative algorithms for the involved optimization problems. A graphtheoretic formulation of these problems will enable us to develop approximative algorithms. Finally we will present details of the implementation of our approach and compare it to industrial state of the art placement routines. {\bf Keywords:} Quadratic 0/1 optimization, Computational Complexity, VLSI-Design.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/pdf
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    OPUS
  • 4
    facet.materialart.
    Unknown
    A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints (1997)
    Details
    Publication Date: 2020-08-05
    Description: In this paper we consider a variant of the classical ATSP, namely the asymmetric Hamiltonian path problem (or equivalently ATSP) with precedence constraints. In this problem precedences among the nodes are present, stating that a certain node has to precede others in any feasible sequence. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing[Timlin89], sequencing in flexible manufacturing [AscheuerEscuderoGroetschelStoer90,AscheuerEscuderoGroetschelStoer93], to stacker crane routing in an automatic storage system[Ascheuer95]. We give an integer programming model and summarize known classes of valid inequalities. We describe in detail the implementation of a branch&-cut algorithm and give computational results on real world instances and benchmark problems from TSPLIB. The results we achieve indicate that our implementation outperforms other implementations found in the literature. Real world instances up to 174 nodes could be solved to optimality within a few minutes of CPU-time. As a side product we obtained a branch&cut-algorithm for the ATSP. All instances in TSPLIB could be solved to optimality in a reasonable amount of computing time.
    Keywords: ddc:000
    Language: English
    Type: reportzib , doc-type:preprint
    Format: application/postscript
    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...