An algorithm for logit network loading problem by topological sorting

This paper presents a topological sorting based algorithm for logit network loading problem to exclude all cycles by removing certain links from loops. The new algorithm calculates the link weights and flows according to topological order. It produces the theoretical results for networks without loops. Numerical examples show that the new algorithm can reduce errors introduced by the strict definition of 'reasonable route' in Dial's algorithm.

The effects of topological inaccuracy in evolutionary trees on the phylogenetic comparative method of independent contrasts

Computer simulations were used to test the effect of increasing phylogenetic topological inaccuracy on the results obtained from correlation tests of independent contrasts. Predictably, increasing the number of disruptions in the tree increases the likelihood of significant error in the r values produced and in the statistical conclusions drawn from the analysis. However, the position of the disruption in the tree is important: Disruptions closer to the tips of the tree have a greater effect than do disruptions that are close to the root of the tree. Independent contrasts derived from inaccurate topologies are more likely to lead to erroneous conclusions when there is a true significant relationship between the variables being tested (i.e., they tend to be conservative). The results also suggest that random phylogenies perform no better than nonphylogenetic analyses and, under certain conditions, may perform even worse than analyses using raw species data. Therefore, the use of random phylogenies is not beneficial in the absence of knowledge of the true phylogeny.

Locating defense positions for thwarting the propagation of topological worms

A common view for the preferable positions of thwarting worm propagation is at the highly connected nodes. However, in certain conditions, such as when some popular users (highly connected nodes in the network) have more vigilance on the malicious codes, this may not always be the truth. In this letter, we propose a measure of betweenness and closeness to locate the most suitable positions for slowing down the worm propagation. This work provides practical values to the defense of topological worms.

Beyond the topological map : developing alternate mappings in self organisation

The self organising map is a well established unsupervised
learning technique which is able to form sophisticated representations of an input data set. However, conventional Self Organising Map (SOM) algorithms are limited to the production of topological maps — that is, maps where distance between points on the map have a direct relationship to the Euclidean distance between the training vectors corresponding to those points.

It would be desirable to be able to create maps which form clusters on primitive attributes other than Euclidean distance; for example, clusters based upon orientation or shape. Such maps could provide a novel approach to pattern recognition tasks by providing a new method to associate groups of data.

In this paper, it is shown that the type of map produced by SOM algorithms is a direct consequence of the lateral connection strategy employed. Given this knowledge, a technique is required to establish the feasability of using an alternative lateral connection strategy. Such a technique is presented. Using this technique, it is possible to rule out lateral connection strategies that will not produce output states useful to the organisation process. This technique is demonstrated using conventional Laplacian interconnection as well as a number of novel interconnection strategies.