Risk management with regard to dioxin residues in pork meat

Maximum levels for dioxins have been established in 2001 in feed (feed materials and compound feed) and food of animal origin (fish, meat, eggs, milk and derived products). They are in force since 1 January 2002. These maximum levels were complemented in 2006 with maximum levels for the sum of dioxins and dioxin-like PCBs in feed and food. By the Regulation (EC) No 183/2005 of the European Parliament and of the Council of 12 January 2005 feed business operators have to put in place, implement and maintain procedures based on the Hazard Analysis Critical Control Points (HACCP) principles. This means the identification of critical control points and the identification of, inter alia, possible chemical contamination

On arrangements of hyperplanes from connected subgraphs

We investigate arrangements of hyperplanes whose normal vectors are given by connected subgraphs of a fixed graph. These include the resonance arrangement and certain ideal subarrangements of Weyl arrangements. We characterize those which are free, simplicial, factored, or supersolvable. In particular, such an arrangement is free if and only if the graph is a cycle, a path, an almost path, or a path with a triangle attached to it.Comment: 22 pages, 7 figures, minor edit

A Massively Parallel Algorithm for the Approximate Calculation of Inverse p-th Roots of Large Sparse Matrices

We present the submatrix method, a highly parallelizable method for the approximate calculation of inverse p-th roots of large sparse symmetric matrices which are required in different scientific applications. We follow the idea of Approximate Computing, allowing imprecision in the final result in order to be able to utilize the sparsity of the input matrix and to allow massively parallel execution. For an n x n matrix, the proposed algorithm allows to distribute the calculations over n nodes with only little communication overhead. The approximate result matrix exhibits the same sparsity pattern as the input matrix, allowing for efficient reuse of allocated data structures. We evaluate the algorithm with respect to the error that it introduces into calculated results, as well as its performance and scalability. We demonstrate that the error is relatively limited for well-conditioned matrices and that results are still valuable for error-resilient applications like preconditioning even for ill-conditioned matrices. We discuss the execution time and scaling of the algorithm on a theoretical level and present a distributed implementation of the algorithm using MPI and OpenMP. We demonstrate the scalability of this implementation by running it on a high-performance compute cluster comprised of 1024 CPU cores, showing a speedup of 665x compared to single-threaded execution

What characterizes helpful personal practice in psychotherapy training? : results of an online survey

Background: Personal practice (PP) is often considered as a central component in psychotherapy training aiming to promote personal and therapeutic competences. However, its implementation varies considerably in practice. Aims: The purpose of this exploratory study was to examine the current practice of PP regarding the frequency/occurrence and perceived usefulness/impairment of topics, techniques and effects, as well as its helpful characteristics in psychotherapy training. Method: 407 German psychotherapy trainees (214 cognitive behavioural therapy; 178 psychodynamic therapy) were surveyed online as to their current practice of PP. Results: For trainees, personal and therapeutic related topics were discussed. Reflection techniques and self-experiential practice were among the most frequently reported strategies, while the fostering of personal and interpersonal competences was among the effects with the strongest occurrence. However, negative PP effects were recorded as well. Differences in PP practice emerged between therapeutic orientations. Conclusions: As certain techniques which are central to PP (e.g. self-experience) were also rarely or not used, and negative effects reported, its potential might not be fully utilized

What a MESS: Multi-Domain Evaluation of Zero-Shot Semantic Segmentation

While semantic segmentation has seen tremendous improvements in the past, there is still significant labeling efforts necessary and the problem of limited generalization to classes that have not been present during training. To address this problem, zero-shot semantic segmentation makes use of large self-supervised vision-language models, allowing zero-shot transfer to unseen classes. In this work, we build a benchmark for Multi-domain Evaluation of Semantic Segmentation (MESS), which allows a holistic analysis of performance across a wide range of domain-specific datasets such as medicine, engineering, earth monitoring, biology, and agriculture. To do this, we reviewed 120 datasets, developed a taxonomy, and classified the datasets according to the developed taxonomy. We select a representative subset consisting of 22 datasets and propose it as the MESS benchmark. We evaluate eight recently published models on the proposed MESS benchmark and analyze characteristics for the performance of zero-shot transfer models. The toolkit is available at https://github.com/blumenstiel/MESS