Gut organisiert und kosteneffizient

Wie muss eine IT organisiert sein, damit sie einerseits Geschäftsprozesse bestmöglich unterstützt, andererseits aber auch stets kosteneffizient agiert? Der Business-Driven-IT-Management-Ansatz hilft bei der Beantwortung dieser Frag

Adverse events related to low dose corticosteroids in autoimmune hepatitis

Background: Autoimmune hepatitis requires long-term therapy, and systemic corticosteroids are the backbone of therapeutic management. Prolonged use of corticosteroids may lead to adverse events but data from long-term studies are mainly derived from studies in rheumatic diseases. Aim: To assess cataract, diabetes and fractures in relation to corticosteroid doses in the long-term maintenance treatment of patients with autoimmune hepatitis. Methods: We retrospectively collected data on 476 patients (77% women) with an established diagnosis of autoimmune hepatitis. Binary logistic regression with a generalised estimating equation was used to analyse the association between current corticosteroid use and the incidence of cataract, diabetes and fractures with onset after autoimmune hepatitis diagnosis. We corrected for sex, age, cirrhosis at diagnosis and predniso(lo)ne use in the prior 3 years to account for possible ongoing effects. Results: A total of 6634 years, with a median of 13 (range 1-40) per patient were recorded. The median age at diagnosis was 44 years (range 2-88). Adverse events were documented in 120 (25%) patients. Low-dose predniso(lo)ne (0.1-5.0 mg/d) increased the odds of fractures whereas higher doses (>5.0 mg/d) increased the odds of cataracts and diabetes. Budesonide increased the odds of cataract and fractures; this effect was independent of predniso(lo)ne use in the prior 1, 2 or 3 years. Conclusions: Even low doses of corticosteroids frequently lead to substantial adverse events refuting the assumption that adverse events are prevented by administering low doses

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO-PARTIALCOL). which is based on tabu search, considers feasible but partial solutions and tries to increase the size of the cur-rent partial solution. A solution consists of k disjoint stable sets (and, therefore, is a feasible, partial k-coloring) and a set of uncolored vertices. We introduce a reactive tabu tenure which Substantially enhances the performance of both our heuristic as well as the classical tabu algorithm (called TABUCOL) proposed by Hertz and de Werra I Using tabu search techniques for graph coloring, Computing 1987:39:345-51]. We will report numerical results on different benchmark graphs and we will observe that FOO-PARTIALCOL, though very simple. outperforms TABUCOL on some instances, provides very competitive results on a set of benchmark graphs which are known to be difficult, and outperforms the best-known methods on the graph flat300_28_0. For this graph, FOO-PARTIALCOL finds an optimal coloring with 28 colors. The best coloring achieved to date uses 31 colors. Algorithms very close to TABUCOL are still used as intensification procedures in the best coloring methods, which are evolutionary heuristics. FOO-PARTIALCOL could then be a powerful alternative. In conclusion FOO-PARTIALCOL is one of the most efficient simple local search coloring methods yet available. (c) 2006 Elsevier Ltd. All rights reserved

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOOPARTIALCOL), which is based on tabu search, considers feasible but partial solutions and tries to increase the size of the current partial solution. A solution consists of k disjoint stable sets (and, therefore, is a feasible, partial k-coloring) and a set of uncolored vertices. We introduce a reactive tabu tenure which substantially enhances the performance of both our heuristic as well as the classical tabu algorithm (called TABUCOL) proposed by Hertz and de Werra [Using tabu search techniques for graph coloring, Computing 1987;39:345–51].We will report numerical results on different benchmark graphs and we will observe that FOO-PARTIALCOL, though very simple, outperforms TABUCOL on some instances, provides very competitive results on a set of benchmark graphs which are known to be difficult, and outperforms the best-known methods on the graph flat300_28_0. For this graph, FOO-PARTIALCOL finds an optimal coloring with 28 colors. The best coloring achieved to date uses 31 colors. Algorithms very close to TABUCOL are still used as intensification procedures in the best coloring methods, which are evolutionary heuristics. FOO-PARTIALCOL could then be a powerful alternative. In conclusion FOO-PARTIALCOL is one of the most efficient simple local search coloring methods yet available