Learn More
In this study, we examine the use of graph ordering algorithms for visual analysis of data sets using visual similarity matrices. Visual similarity matrices display the relationships between data items in a dot-matrix plot format, with the axes labeled with the data items and points drawn if there is a relationship between two data items. The biggest(More)
Simple elbow dislocations may present complications that are anything but simple. Although occurring less frequently, these complications are identical to those associated with more complex fracture-dislocations: contracture, heterotopic ossification, Essex-Lopresti injury, neurovascular injury, and residual instability. Each complication is discussed,(More)
Visual similarity matrices (VSMs) are a common technique for visualizing graphs and other types of relational data. While traditionally used for small data sets or well-ordered large data sets, they have recently become popular for visualizing large graphs. However , our experience with users has revealed that large VSMs are difficult to interpret. In this(More)
In this paper we consider various problems involving the action of a reductive group G on an affine variety V. We prove some general rationality results about the G-orbits in V. In addition, we extend fundamental results of Kempf and Hesselink regarding optimal destabilizing parabolic subgroups of G for such general G-actions. We apply our general(More)
Let H be a reductive subgroup of a reductive group G over an algebraically closed field k. We consider the action of H on G n , the n-fold Cartesian product of G with itself, by simultaneous conjugation. We give a purely algebraic characterization of the closed H-orbits in G n , generalizing work of Richardson which treats the case H = G. This(More)