Learn More
In this paper we present a new parallelization of an efficient best-first branch-and-bound algorithm to solve the constrained two-dimensional single stock guillotine cutting stock problem (CSP) to optimality. The underlying sequential branch-and-bound algorithm is based on an exact version of Wang's heuristic suggested by Viswanathan and Bagchi. In our(More)
To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances of these problems or those with a lot of hard constraints even fast heuristics require a considerable amount of computational time. At the same time, especially for sensitivity(More)
BACKGROUND Self-directed and other violence as well as subsequent coercive interventions occur in a substantial proportion of patients with personality disorders during in-patient treatment. Different strategies may be required to reduce coercive interventions for patients of different diagnostic groups. METHODS We specialised one of our acute admission(More)
This paper is the rst to present a parallelization of a highly eecient best-rst branch-and-bound algorithm to solve large symmetric traveling salesman problems on a massively parallel computer containing 1024 processors. The underlying sequential branch & bound algorithm is based on 1-tree relaxation introduced by Held and Karp (Lagrangean approach) and(More)
Load distribution is essential for eecient use of processors in parallel branch-and-bound computations because the computation generates and consumes non-uniform subproblems at runtime. This paper presents six decentralized load distribution strategies. They are incorporated in a runtime support system, and evaluated in the solution of set partitioning(More)
The aim of the study was to identify psychopathological similarities and differences in borderline personality disorder (BPD) and schizophrenia. We compared 23 female patients with a BPD and 21 female patients with schizophrenia according to auditory verbal hallucinations (AVHs), dissociation, childhood trauma, and additional psychotic symptoms. The(More)
We approach the problem of bisectioning the de Bruijn network into two parts of equal size and minimal number of edges connecting the two parts (cross-edges). We introduce a general method that is based on required substrings. A partition is deened by taking as one part all the nodes containing a certain string and as the other part all the other nodes.(More)
The case of a young woman with still ongoing incest and forced prostitution is presented. The criteria for a dissociative identity disorder (DID) were met. Due to persistent contact to the perpetrator she was repeatedly revictimized. Based on the model of trauma-related dissociation we discuss to what extent she was capable of self-determined decision(More)
We present a case of dissociative identity disorder in which Schneiderian first rank symptoms were present besides of various states of consciousness. Thus the diagnosis of schizophrenia had to be considered. Formally, the symptoms met ICD-10 criteria for schizophrenia. However, taking into account the lack of formal thought disorder and of negative(More)