We present a distributed cyclic reference counting algorithm which incorporates both, the correct management of cyclic data structures and the improvement of lazy mark-scan. The algorithm allows processors to run local mark-scan simultaneously without any need of synchronisation between phases of di erent local mark-scans either on the same processor or on di erent processors.

In this paper, we develop a polynomial time algorithm to find out all the minilnum cyclic edge cutsets of a 3-regular graph, and therefore to determine the cyclic edge connectivity of a cubic graph. The algorithm is recursive, with complexity bounded by O(n31og2 n). The algorithm shows that the number of mini~um cyclic edge cut sets of a 3-regular graph G is polynornial in v( G) and that the mi...

Cyclic or non-cyclic planning policies are traditionally used to manage inventories in a multiechelon supply chain. Evaluation of the difference between performances of cyclic and non-cyclic planning policies allows analysing an efficiency of a specific planning policy at the product life cycle specific stage, and provides a control mechanism to switch from one to another policy. The paper is a...

Thomas Richardson1 Logic and Computation Programme CMU, Pittsburgh PA 15213

The study introduces an enhanced cyclic descent algorithm for nurse rostering. The algorithm is compared to four other rostering algorithms and to manually generated roster solutions obtained from the Gold Coast Hospital. Three criteria are developed with which the roster generation methods are assessed: these are roster schedule quality, roster shift allocation quality and execution time. A st...

We propose a practical algorithm of best rational approximation of a given order to a function in the Hardy H space on the unit circle or on the real line. The type approximation is proved to be equivalent with Blaschke form approximation. The algorithm is called Cyclic AFD as it adaptively selects one parameter during each cycle based on the Maximal Selection Principle used in adaptive Fourier...

Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1’s. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swaps needed to convert A into B, minimized over all rotations of B. We show that this distance may be approximated in O(n + k2) time.

We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may observe seasonal variation where certain rules are true at approximately the same month each year. Similarly, association rules can also display regular hourly, daily, weekly, etc., variation that is cyclical in natur...

Although cyclic LDPC codes constructed based on finite geometries achieve excellent performance, the relatively high densities of their parity-check matrices make the hardware implementation complexity of the decoders quite large. An effective algorithm for decoding cyclic finite geometry LDPC codes based on the cyclic structure and appropriate partition of their parity check matrices is presen...

Implementation of an algorithm for the automated determination of the magnitude and time delay of the cardiac cycle-dependent variation of integrated backscatter is reported. This algorithm has been implemented in the experimental firmware of a commercially-available echocardiographic imaging system. Integrated backscatter and the cardiac cycle-dependent variation (cyclic variation) of integrat...