In this paper, we propose the use of cyclic interval graphs as an alternative representation for register allocation. The \thickness" of the cyclic interval graph captures the notion of overlap between live ranges of variables relative to each particular point of time in the program execution. We demonstrate that cyclic interval graphs provide a feasible and e ective representation that accurat...

This paper defines flows (or discrete dynamical systems) and cyclic flows in a category and investigates how the trajectories of a point might approach a cycle. The paper considers cyclic flows in the categories of Sets and of Boolean algebras and their duals and characterizes the Stone representation of a cyclic flow in Boolean algebras. A cyclic spectrum is constructed for Boolean flows. Exam...

A cycle in a multipartite graph G is gregarious if it contains at most one vertex from each partite set of G. The complete n-partite graph with partite sets of size m, denoted by Kn(m) is shown to have a decomposition into gregarious 4-cycles. The notion of a gregarious 4-cycle decomposition of this type was introduced in [3]. A 4-cycle decomposition of Kn(m) is circular if it is it is invarian...

Cyclic scheduling problems concerning multimodal processes are usually observed in FMSs producing multi-type parts where the Automated Guided Vehicles System (AGVS) plays a role of a material handling system. Schedulability analysis of concurrently flowing cyclic processes (SCCP) executed in these kinds of systems can be considered using a declarative modeling framework. Proposed representation...

We present a useful new characterization of the automorphisms of the regular wreath product group P of a finite cyclic p-group by a finite cyclic p-group, for any prime p, and we discuss an application. We also present a short new proof, based on representation theory, for determining the order of the automorphism group Aut P , where P is the regular wreath product of a finite cyclic p-group by...

We show that cyclic structures, i.e., finite or possibly infinite structures with backpointers, unwindable into possibly infinite structures, can be elegantly represented as nested datatypes. This representation is free of the various deficiencies characterizing the more naive representation as mixed-variant datatypes. It is inspired by the representation of lambda-terms as a nested datatype vi...

Chemoinformatics aims to predict molecule’s properties through informational methods. Some methods base their prediction model on the comparison of molecular graphs. Considering such a molecular representation, graph kernels provide a nice framework which allows to combine machine learning techniques with graph theory. Despite the fact that molecular graph encodes all structural information of ...