TY - THES A1 - Wirth, Hans-Christoph T1 - Multicriteria Approximation of Network Design and Network Upgrade Problems T1 - Mehrkriterien-Approximation von Netzwerk-Design- und Netzwerk-Ausbau-Problemen N2 - Network planning has come to great importance during the past decades. Today's telecommunication, traffic systems, and logistics would not have been evolved to the current state without careful analysis of the underlying network problems and precise implementation of the results obtained from those examinations. Graphs with node and arc attributes are a very useful tool to model realistic applications, while on the other hand they are well understood in theory. We investigate network design problems which are motivated particularly from applications in communication networks and logistics. Those problems include the search for homogeneous subgraphs in edge labeled graphs where either the total number of labels or the reload cost are subject to optimize. Further, we investigate some variants of the dial a ride problem. On the other hand, we use node and edge upgrade models to deal with the fact that in many cases one prefers to change existing networks rather than implementing a newly computed solution from scratch. We investigate the construction of bottleneck constrained forests under a node upgrade model, as well as several flow cost problems under a edge based upgrade model. All problems are examined within a framework of multi-criteria optimization. Many of the problems can be shown to be NP-hard, with the consequence that, under the widely accepted assumption that P is not equal to NP, there cannot exist efficient algorithms for solving the problems. This motivates the development of approximation algorithms which compute near-optimal solutions with provable performance guarantee in polynomial time. N2 - Netzplanung hat in den vergangenen Jahrzehnten an Bedeutung zugenommen. Der heutige Stand im Bereich von Telekommunikation, Verkehrsnetzen und in der Logistik wäre nicht in dem Maße erreicht worden, wenn nicht die zugrundeliegenden Netzplanungsprobleme sorgfältig analysiert und die daraus gewonnenen Erkenntnisse in die Realisierung eingeflossen wären. Für die Modellierung der durch die Praxis vorgegebenen Probleme erweisen sich Graphen mit Knoten- und Kantenbewertungen als gut geeignet, zumal diese Strukturen auch in der Theorie bereits gut untersucht sind. Wir betrachten Netzwerk-Design-Probleme aus dem Bereich der Planung von Kommunikations- und Logistiknetzwerken. Gegenstand ist zunächst die Suche nach homogenen Teilgraphen in Graphen mit Kantenlabels, wobei einerseits die Gesamtszahl der benutzten Labels minimiert wird, andererseits die Kosten unter einem Umladekosten-Modell optimiert werden. Weiter werden einige Varianten des Dial-A-Ride-Problems untersucht. Im zweiten Teil der Arbeit werden Netzwerk-Ausbau-Probleme betrachtet. Dies trägt der Tatsache Rechung, dass in vielen praktischen Fällen nur die Abänderung bestehender Netze und nicht die Neukonstruktion von Netzen in Frage kommt. Alle Probleme werden im Rahmen der Mehrkriterien-Optimierung betrachtet. Viele der betrachteten Probleme lassen sich als NP-hart nachweisen. Dies hat zur Folge, dass es - unter der gängigen Annahme, dass P ungleich NP ist - keine effizienten Lösungsalgorithmen geben kann. Daher entwickeln wir Approximationsalgorithmen, die in Polynomialzeit Näherungslösungen mit beweisbarer Gütegarantie berechnen. KW - Netzplantechnik KW - Rechnernetz KW - Approximation KW - network design KW - network upgrade KW - approximation algorithms KW - edge labeled graphs KW - reload cost KW - spanning tree KW - dial a ride KW - constrained forest Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-2845 ER - TY - JOUR A1 - Bohnert, Simone A1 - Wirth, Christoph A1 - Schmitz, Werner A1 - Trella, Stefanie A1 - Monoranu, Camelia-Maria A1 - Ondruschka, Benjamin A1 - Bohnert, Michael T1 - Myelin basic protein and neurofilament H in postmortem cerebrospinal fluid as surrogate markers of fatal traumatic brain injury JF - International Journal of Legal Medicine N2 - The aim of this study was to investigate if the biomarkers myelin basic protein (MBP) and neurofilament-H (NF-H) yielded informative value in forensic diagnostics when examining cadaveric cerebrospinal fluid (CSF) biochemically via an enzyme-linked immunosorbent assay (ELISA) and comparing the corresponding brain tissue in fatal traumatic brain injury (TBI) autopsy cases by immunocytochemistry versus immunohistochemistry. In 21 trauma and 19 control cases, CSF was collected semi-sterile after suboccipital puncture and brain specimens after preparation. The CSF MBP (p = 0.006) and NF-H (p = 0.0002) levels after TBI were significantly higher than those in cardiovascular controls. Immunohistochemical staining against MBP and against NF-H was performed on cortical and subcortical samples from also biochemically investigated cases (5 TBI cases/5 controls). Compared to the controls, the TBI cases showed a visually reduced staining reaction against MBP or repeatedly ruptured neurofilaments against NF-H. Immunocytochemical tests showed MBP-positive phagocytizing macrophages in CSF with a survival time of > 24 h. In addition, numerous TMEM119-positive microglia could be detected with different degrees of staining intensity in the CSF of trauma cases. As a result, we were able to document that elevated levels of MBP and NF-H in the CSF should be considered as useful neuroinjury biomarkers of traumatic brain injury. KW - biofluid KW - CSF KW - cerebrospinal fluid KW - forensic neuropathology KW - forensic neurotraumatology KW - biomarker Y1 - 2021 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:bvb:20-opus-266929 SN - 1437-1596 VL - 135 IS - 4 ER -