Intradermal and subcutaneous leiomyosarcoma: a clinicopathological and immunohistochemical study of 41 cases

Superficial leiomyosarcomas are rare tumours. The lesions confined to the dermis, contrary to those involving the subcutis, have been reported to carry a favourable prognosis. A retrospective study of 41 consecutive cases of surgically treated intradermal and subcutaneous leiomyosarcomas was undertaken in order to determine the prognostic factors that may influence the survival of these patients. Seven tumours were predominantly intradermal and 34 involved the subcutaneous tissue. Fifty-four percent of the tumours were located in the lower extremities. All cases stained positively for smooth muscle antigen and 66% for desmin. The tumours were classified with regard to tumour grade I (low grade, 3%), II (intermediate, 12%), IIIA (high grade, 46%) and IIIB (high grade, 39%). In all patients, follow-up information was available. Mean follow-up time was 5 years. The patients with intradermal tumours were all alive without signs of recurrence, whereas 14 of those with leiomyosarcomas involving the subcutis have died with pulmonary metastases. Our study confirms that "pure" intradermal leiomyosarcomas independent of tumour grade behave in a benign fashion, probably due to small tumour size. Tumour size > or = 5 cm, deep localization with fascia involvement, and high malignancy grade (IIIB) were found to deteriorate survival based on a univariate analysis. However, in a multivariate analysis only tumour size was found to be an independent prognostic factor.     

Socio-technical IS design science research: developing design theory for IS integration management

Design science research is an essential part of IS research since the field should not only try to understand how the world is, but also how to change it. We argue that the aim of IS design science research should be to develop practical knowledge not only for the design of novel information technology (IT), but also for IS governance and management. Whereas at least some methodological support exists for researchers engaged in IT-centric design science research, limited support is available for researchers who want to develop design knowledge and theory for IS governance and management. To overcome this shortcoming, we suggest a socio-technical IS design science research approach. The approach has four main activities: (1) identifying problem situations and desired outcomes, (2) reviewing extant theories, knowledge and data, (3) proposing/refining design theory and knowledge, and (4) testing design theory and knowledge. The applicability and usefulness of the proposed approach is shown by means of a design science research project concerning IS integration management in the context of mergers and acquisitions.     

Distinguishing attacks on stream ciphers based on arrays of pseudo-random words

In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, while the output key-stream is a relatively simple function of the state. It has been heuristically shown in several situations [3], [8], [9], [10], [11] and [14] that this structure may lead to distinguishing attacks on the cipher. In this note we present a more rigorous treatment of this structural attack. First, we present a rigorous proof of the main probabilistic claim behind it in the basic cases. We then apply it concretely to the cipher sn3 [12], and demonstrate that the heuristic assumptions of the attack are remarkably precise in more complicated cases.     

Efficient high order matching

We present a computational approach to high-order matching of data sets in IR(d). Those are matchings based on data affinity measures that score the matching of more than two pairs of points at a time. High-order affinities are represented by tensors and the matching is then given by a rank-one approximation of the affinity tensor and a corresponding discretization. Our approach is rigorously justified by extending Zass and Shashua's hypergraph matching to high-order spectral matching. This paves the way for a computationally efficient dual-marginalization spectral matching scheme. We also show that, based on the spectral properties of random matrices, affinity tensors can be randomly sparsified while retaining the matching accuracy. Our contributions are experimentally validated by applying them to synthetic as well as real data sets.     

Illustrative stream surfaces

Stream surfaces are an intuitive approach to represent 3D vector fields. In many cases, however, they are challenging objects to visualize and to understand, due to a high degree of self-occlusion. Despite the need for adequate rendering methods, little work has been done so far in this important research area. In this paper, we present an illustrative rendering strategy for stream surfaces. In our approach, we apply various rendering techniques, which are inspired by the traditional flow illustrations drawn by Dallmann and Abraham \& Shaw in the early 1980s. Among these techniques are contour lines and halftoning to show the overall surface shape. Flow direction as well as singularities on the stream surface are depicted by illustrative surface streamlines. ;To go beyond reproducing static text book images, we provide several interaction features, such as movable cuts and slabs allowing an interactive exploration of the flow and insights into subjacent structures, e.g., the inner windings of vortex breakdown bubbles. These methods take only the parameterized stream surface as input, require no further preprocessing, and can be freely combined by the user. We explain the design, GPU-implementation, and combination of the different illustrative rendering and interaction methods and demonstrate the potential of our approach by applying it to stream surfaces from various flow simulations. ;     

On packing shortest cycles in graphs

We study the problems to find a maximum packing of shortest edge-disjoint cycles in a graph of given girth g (g-ESCP) and its vertex-disjoint analogue g-VSCP. In the case g=3, Caprara and Rizzi (2001) have shown that g-ESCP can be solved in polynomial time for graphs with maximum degree 4, but is APX-hard for graphs with maximum degree 5, while g-VSCP can be solved in polynomial time for graphs with maximum degree 3, but is APX-hard for graphs with maximum degree 4. For g∈{4,5}, we show that both problems allow polynomial time algorithms for instances with maximum degree 3, but are APX-hard for instances with maximum degree 4. For each g?6, both problems are APX-hard already for graphs with maximum degree 3.     

Textures on Rank‐1 Lattices

Storing textures on orthogonal tensor product lattices is predominant in computer graphics, although it is known that their sampling efficiency is not optimal. In two dimensions, the hexagonal lattice provides the maximum sampling efficiency. However, handling these lattices is difficult, because they are not able to tile an arbitrary rectangular region and have an irrational basis. By storing textures on rank‐1 lattices, we resolve both problems: Rank‐1 lattices can closely approximate hexagonal lattices, while all coordinates of the lattice points remain integer. At identical memory footprint texture quality is improved as compared to traditional orthogonal tensor product lattices due to the higher sampling efficiency. We introduce the basic theory of rank‐1 lattice textures and present an algorithmic framework which easily can be integrated into existing off‐line and real‐time rendering systems.