Ideal matrices and clutters are prevalent in combinatorial optimization, ranging from balanced matrices, of T-joins, to rooted arborescences. Most the known examples ideal nature. In this paper, rendered by recently developed theory cuboids, we provide a different class clutters, one that is geometric The advantage new it allows for infinitely many minimally nonpacking clutters. We characterize...

In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional sp...

A new scalable interconnection topology suitable for massively parallel systems called the Spanning Bus Connected Hypercube (SBCH) is proposed. The SBCH uses the hypercube topology as a basic building block and connects such building blocks using multi-dimensional spanning buses. In doing so, the SBCH combines positive features of both the hypercube (small diameter, high connectivity, symmetry,...

1 Distributed Tuple Spaces Tuple spaces have been conceived [3] and extended under the influence of databases and messaging systems. However, there is no notion of data schemes, and queries are specified by templates, that may wildcard arbitrary fields of a tuple. Therefore, indexing tuples is a highly non trivial task, which is complicated even more by the advent of field hierarchies. As a res...