Let A and B be n × m matrices. The matrix B is said to be g-row majorized (respectively g-column majorized) by A, if every row (respectively column) of B, is g-majorized by the corresponding row (respectively column) of A. In this paper all kinds of g-majorization are studied on Mn,m, and the possible structure of their linear preservers will be found. Also all linear operators T : Mn,m ---> Mn...

The adoption of the stress-majorization method frommulti-dimensional scaling into graph layout has provided an improved mathematical basis and better convergence properties for so-called “force-directed placement” techniques. In this paper we give an algorithm for augmenting such stress-majorization techniques with orthogonal ordering constraints and we demonstrate several graphdrawing applicat...

A new notion of coneigenvalue was introduced by Ikramov in [On pseudo-eigenvalues and singular numbers of a complex square matrix, (in Russian), Zap. Nauchn. Semin. POMI 334 (2006), 111-120]. This paper presents some majorization inequalities for coneigenvalues, which extend some classical majorization relations for eigenvalues and singular values, and may serve as a basis for further investiga...

In this paper, the static analysis of programs in the functional programming language Miranda* is described based on two graph models. A new control-flow graph model of Miranda definitions is presented, and a model with four classes of caligraphs. Standard software metrics are applicable to these models. A Miranda front end for Prometrixt, a tool for the automated analysis of flowgraphs and cal...

Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly improve the speed and convergence properties of the constrained stress-majorization technique for graph layout by employing a diagonal scaling of the stress function. Diagonal scaling requires the active-set quadratic programming ...

We present a fundamentally different approach to orthogonal layout of data flow diagrams with ports. This is based on extending constrained stress majorization to cater for ports and flow layout. Because we are minimizing stress we are able to better display global structure, as measured by several criteria such as stress, edge-length variance, and aspect ratio. Compared to the layered approach...

In this series of papers we study subspaces of de Branges spaces of entire functions which are generated by majorization on subsets D of the closed upper half-plane. The present, first, part is addressed to the question which subspaces of a given de Branges space can be represented by means of majorization. Results depend on the set D where majorization is permitted. Significantly different sit...

We characterize the (continuous) majorization of integrable functions introduced by Hardy, Littlewood, and Pólya in terms of the (discrete) majorization of finite-dimensional vectors, introduced by the same authors. The most interesting version of this result is the characterization of the (increasing) convex order for integrable random variables in terms of majorization of vectors of expected ...

BACKGROUND Asymmetric cell divisions generate daughter cells with distinct fates by polarizing fate determinants into separate cortical domains. Atypical protein kinase C (aPKC) is an evolutionarily conserved regulator of cell polarity. In Drosophila neuroblasts, apically restricted aPKC is required for segregation of neuronal differentiation factors such as Numb and Miranda to the basal cortic...