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 ...

In this paper, the diagonal majorization algorithm (DMA) has been investigated. The research focuses on the possibilities to increase the efficiency of the algorithm by disclosing its properties. The diagonal majorization algorithm is oriented at the multidimensional data visualization. The experiments have proved that, when visualizing large data set with DMA, it is possible to save the comput...

This paper aims to generalize and unify classical criteria for comparisons of balanced lattice designs, including fractional factorial designs, supersaturated designs and uniform designs. We present a general majorization framework for assessing designs, which includes a stringent criterion of majorization via pairwise coincidences and flexible surrogates via convex functions. Classical orthogo...


 In this paper, we give a complete, explicit and constructive solution to the double generalized majorization problem. Apart from purely combinatorial interest, problem has strong impact in Matrix Pencils Completion Problems, Bounded Rank Perturbation it additional nice interpretation Representation Theory of Kronecker Quivers.

This paper establishes a strong connection between evolutionary algorithms and majorization theory, using replicator models as a bridge. The relationship between replicator selection systems and majorization theory suggests new selection operators, convergence results and theoretical gains such as the availability of convergence results from the well developed theory of inhomogeneous doubly sto...

Miranda-Thompson majorization is a group-induced cone ordering on $mathbb{R}^{n}$ induced by the group of generalized permutation with determinants equal to 1. In this paper, we generalize Miranda-Thompson majorization on the matrices. For $X$, $Yin M_{m,n}$, $X$ is said to be  Miranda-Thompson majorized by $Y$ (denoted by $Xprec_{mt}Y$) if there exists some $Din rm{Conv(G)}$ s...

We explore the combinatorial properties of a particular type of extension monoid product of preinjective Kronecker modules. The considered extension monoid product plays an important role in matrix completion problems. We state theorems which characterize this product in both implicit and explicit ways and we prove that the conditions given in the definition of the generalized majorization are ...