We describe a new optimization scheme for finding highquality clusterings in planar graphs that uses weighted perfect matching as a subroutine. Our method provides lower-bounds on the energy of the optimal correlation clustering that are typically fast to compute and tight in practice. We demonstrate our algorithm on the problem of image segmentation where this approach outperforms existing glo...

This paper presents the first polynomial time algorithm to compute geodesics in a CAT(0) cubical complex in general dimension. The algorithm is a simple iterative method to update breakpoints of a path joining two points using Owen and Provan’s algorithm (2011) as a subroutine. Our algorithm is applicable to any CAT(0) space in which geodesics between two close points can be computed, not limit...

The 68HC12 is the latest family of Motorola 8-bit microcontrollers. It is upward compatible from the 68HC11 (at the source code level but not the object code level) but contains many new instructions and addressing modes which considerably enhance its speed and code efficiency. This paper describes the implementation of a subroutine-threaded Forth called WHYP on the MC68HC812A4 and MC68HC912B32...

We propose a very simple preprocessing algorithm for semidefinite programming. Our algorithm inspects the constraints of the problem, deletes redundant rows and columns in the constraints, and reduces the size of the variable matrix. It often detects infeasibility. Our algorithm does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be imp...

The TOMS paper ”A Fully Portable High Performance Minimal Storage Hybrid Format Cholesky Algorithm” by Andersen, Gunnels, Gustavson, Reid, and Waśniewski, used a level 3 Cholesky kernel subroutine instead of level 2 LAPACK routine POTF2. We discuss the merits of this approach and show that its performance over POTRF is considerably improved on a variety of common platforms when POTRF is solely ...

We provide a brief overview of a set of analytical results regarding some very simple randomized protocols, called dynamics, for solving the plurality consensus problem, together with some examples on how to build efficient and robust distributed algorithms for other fundamental tasks using these protocols as a core subroutine. More specifically, we look at the 3-Majority and the Undecided-Stat...

We discuss solvers for Sylvester, Lyapunov, and Stein equations that are available in the SLICOT Library (Subroutine Library In COntrol Theory). These solvers offer improved efficiency, reliability, and functionality compared to corresponding solvers in other computer-aided control system design packages. The performance of the SLICOT solvers is compared with the corresponding MATLAB solvers. T...

Correlation dimension is attained from the correlations between random points on the attractor. For an one dimensional discrete dynamical system with initial condition, x0 Lyapunov exponent (x0) is defined. The Henon map is a discrete time dynamical system. In logistic map is quadratic. The Kaplan-Yorke map is a discrete -time dynamical system. A nnr ( ) subroutine is written to find all mean n...

In this paper the mechanism of Default Rules for narrowing-based languages proposed in 24] is adapted to lazy narrowing. Every partial deenition of a function can be completed with a default rule. In a concrete function call, the default rule is applicable when the normal ones determine that they cannot compute the value of the call. Furthermore , when the goal has variables the evaluation mech...

In this paper, we propose a methodology to address an important aspect of software porting that receives little attention, namely planning support. When a scientific application consisting of many subroutines is to be ported, the selection of key subroutines greatly impacts the productivity and overall porting strategy because these subroutines may represent a significant aspect of the code in ...