The core/periphery structure is ubiquitous in network studies. The discrete version of the concept is that individuals in a group belong to either the core, which has a high density of ties, or to the periphery, which has a low density of ties. The density of ties between the core and the periphery may be either high or low. If the core/periphery structure is given a priori, then there is no pr...

The simulation system JAMES II is aimed at supporting a range of modeling formalisms and simulation engines. The partitioning of models is essential for distributed simulation. A suitable partition depends on model, hardware, and simulation algorithm characteristics. Therefore, a partitioning layer has been created in JAMES II which allows to plug in partitioning algorithms on demand. Three dif...

A new decoder is proposed to decode the (23, 12, 7) binary Golay-code up to five errors. It is based on the algorithm that can correct up to four errors for the (24, 12, 8) extended Golay-code proposed by Lin et al., thereby achieving the soft decoding in the real sense for the Golay-code. For a weight-2 or weight-3 error pattern decoded by the hard decoder for correcting up to three errors, on...

All the recent available graph partitioning packages include the multilevel graph partition algorithm in which the graph is coarsened by a sequence of increasingly smaller graphs. The smallest graph is partitioned using a graph partitioning algorithm and this partition is propagated back through the hierarchy of graphs. A Kernighan –Lin algorithm is applied periodically to refine the partition....

We motivate, derive and implement a multilevel approach to the travelling salesman problem. The resulting algorithm progressively coarsens the problem, initialises a tour and then employs either the LinKernighan (LK) or the Chained Lin-Kernighan (CLK) algorithm to refine the solution on each of the coarsened problems in reverse order. In experiments on a well established test suite of 79 proble...

| All the previous Kernighan-Lin based (KL-based) circuit partitioning algorithms employ the locking mechanism, which enforces each cell to move exactly once per pass. In this paper, we propose two novel approaches for multiway circuit partitioning to overcome this limitation. Our approaches allow each cell to move more than once. Our rst approach still uses the locking mechanism but in a relax...

The shapes of pulse profiles, especially their variations with respect to observing frequencies, are very important to understand emission mechanisms of pulsars, while no previous attempt has been made in interpreting the complicated phenomenology. In this paper, we present theoretical simulations for the integrated pulse profiles and their frequency evolution within the framework of the invers...