The Kohonen Self-Organizing Map (SOM) is a popular algorithm for constructing a nearest neighbor codebook in pattern space. The algorithm utilizes a prede ned ordering on the codebook to distribute the codes proportionally on the input manifold. In the end this ordering should re ect the structure of the input. Prototypical application of the SOM uses the codebook but neglects the ordering. We ...

Considering the high costs of the implementation and maintenance of gas distribution networks in urban areas, optimal design of such networks is vital. Today, urban gas networks are implemented within a tree structure. These networks receive gas from City Gate Stations (CGS) and deliver it to the consumers. This study presents a comprehensive model based on Mixed Integer Nonlinear Programming (...

AMD is a set of routines for permuting sparse matrices prior to numerical factorization, using the approximate minimum degree ordering algorithm. There are versions written in both C and Fortran 77. A MATLAB interface is included.

| This article describes a topological routing path search algorithm embedded in our autorouter for printed circuit boards. The algorithm searches for a topological path that is guaranteed to be transformable into a physical wire satisfying design rules. We propose a method for incrementally verifying design rules during topological path search in a graph based on constrained Delaunay triangula...

This paper proposes a practical approach for discovering the network topology within an administrative domain. Two discovery algorithms, network layer discovery algorithm and link layer discovery algorithm, are presented in the paper. Network layer discovery algorithm generates the network layer topology within the domain which displays the relationship among subnets. Because the devices and th...

This paper presents a new algorithm to implement causal ordering. Causal ordering was first proposed in the ISIS system developed at Cornell University. The interest of causal ordering in a distr ibuted system is that it is cheaper to realize than total ordering. The implementation of causal ordering proposed in this paper uses logical clocks of Mat te rn-Fidge (which define a partial order bet...