The one sided crossing minimization problem consists of placing the vertices of one part of a bipartite graph on prescribed positions on a straight line and finding the positions of the vertices of the second part on a parallel line and drawing the edges as straight lines such that the number of pairwise edge crossings is minimized. This problem represents the basic building block used for draw...

This article is devoted to the problem of ordering in linkage groups with many dozens or even hundreds of markers. The ordering problem belongs to the field of discrete optimization on a set of all possible orders, amounting to n!/2 for n loci; hence it is considered an NP-hard problem. Several authors attempted to employ the methods developed in the well-known traveling salesman problem (TSP) ...

We propose a new method for finding a parallel ordering needed in the parallel two-sided block-Jacobi EVD/SVD method. For a given matrix A, partitioned into block columns and block rows, such an ordering defines the subproblems that are solved in parallel in each parallel iteration step. Our approach is based on modeling the matrix block partition as a complete, edge-weighted graph, where the w...

The advent of multi-core processors has brought parallel programming to the mainstream. Memory ordering plays a fundamental role in writing efficient and correct parallel programs. This talk will discuss the recently released Intel 64 architecture memory ordering. We will discuss the motivation, and the guarantees provided by this ordering. We will also discuss how it relates to language level ...

The workstation model of parallel processing presents speciic challenges caused by the latency of the communications network and the workload imbalance that arises from the heterogeneity of the nodes. Data partitioning is critically important for parallel processing in this environment. We mathematically characterize the communication costs for four data decomposition schemes: scatter, contiguo...

In this paper we present a method for calculation timeoptimal movements for parking of non-holonomic mobile platforms. The parking problem is considered as specialization of the general problem of path planning for nonholonomic robots. This is formulated as a non-linear optimal control problem and solved using advanced numerical methods. The concept of artificial potential field is used for acc...

A common information representation task in research as well as educational and statistical practice is to comprehensively and intuitively express data in two-dimensional tables. Examples include tables in scientific papers, as well as reports and the popular press. Data is often simple enough for users to reorder. In many other cases though, there are complex data patterns that make finding th...

An infinite row of periodically spaced, identical rigid circular cylinders is excited by an acoustic line source, which is parallel to the generators of the cylinders. A method for calculating the scattered field accurately and efficiently is presented. When the cylinders are sufficiently close together, Rayleigh–Bloch surface waves, which propagate energy to infinity along the array are excite...

In earlier work, we presented a one-dimensional cache-oblivious sparse matrix–vector (SpMV) multiplication scheme which has its roots in one-dimensional sparse matrix partitioning. Partitioning is often used in distributed-memory parallel computing for the SpMV multiplication, an important kernel in many applications. A logical extension is to move towards using a two-dimensional partitioning. ...