| Presentation | 2011-12-16 Minimizing the Number of Heald Frames under the Constraints of Uniform Tension Isamu MATSUURA, Tomio HIRATA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A dobby loom is a weaving machine prevailing in the textile industry. The more heald frames a dobby loom is equipped with, the more complicated designs of cloth can be woven. By introducing long-eye healds into a dobby loom, we can reduce the number of heald frames required for a given weave design. The problem of finding the minimum number of heald frames is NP-hard. Heuristic and exhaustive algorithms have been proposed so far. In this paper, we consider a more realistic version of the problem and show that the number of necessary heald frames equals the exclusive Boolean rank of the matrix associating to the textile design. Next, we transform the problem of finding the exclusive Boolean rank to the bipartite clique partition problem of a graph and give a heuristic algorithm. Finally, we experimentally show that there are weave diagrams for which our algorithm decreases the number of required heald frames. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | long-eye heald / number of heald frames / exclusive Boolean rank / bipartite clique partition problem |
| Paper # | COMP2011-43 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2011/12/9(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Minimizing the Number of Heald Frames under the Constraints of Uniform Tension |
| Sub Title (in English) | |
| Keyword(1) | long-eye heald |
| Keyword(2) | number of heald frames |
| Keyword(3) | exclusive Boolean rank |
| Keyword(4) | bipartite clique partition problem |
| 1st Author's Name | Isamu MATSUURA |
| 1st Author's Affiliation | Aichi Industrial Technology Institute() |
| 2nd Author's Name | Tomio HIRATA |
| 2nd Author's Affiliation | School of Information Science, Nagoya University |
| Date | 2011-12-16 |
| Paper # | COMP2011-43 |
| Volume (vol) | vol.111 |
| Number (no) | 360 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |