Paper Abstract and Keywords |
Presentation |
2011-12-16 14:45
Minimizing the Number of Heald Frames under the Constraint of Uniform Tension Isamu Matsuura (AITEC), Tomio Hirata (Nagoya Univ.) COMP2011-43 |
Abstract |
(in Japanese) |
(See Japanese page) |
(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) |
(in English) |
long-eye heald / number of heald frames / exclusive Boolean rank / bipartite clique partition problem / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 111, no. 360, COMP2011-43, pp. 53-60, Dec. 2011. |
Paper # |
COMP2011-43 |
Date of Issue |
2011-12-09 (COMP) |
ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2011-43 |
Conference Information |
Committee |
COMP |
Conference Date |
2011-12-16 - 2011-12-16 |
Place (in Japanese) |
(See Japanese page) |
Place (in English) |
Nagoya Univ. |
Topics (in Japanese) |
(See Japanese page) |
Topics (in English) |
|
Paper Information |
Registration To |
COMP |
Conference Code |
2011-12-COMP |
Language |
Japanese |
Title (in Japanese) |
(See Japanese page) |
Sub Title (in Japanese) |
(See Japanese page) |
Title (in English) |
Minimizing the Number of Heald Frames under the Constraint 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 |
Keyword(5) |
|
Keyword(6) |
|
Keyword(7) |
|
Keyword(8) |
|
1st Author's Name |
Isamu Matsuura |
1st Author's Affiliation |
Aichi Industrial Technology Institute (AITEC) |
2nd Author's Name |
Tomio Hirata |
2nd Author's Affiliation |
Nagoya University (Nagoya Univ.) |
3rd Author's Name |
|
3rd Author's Affiliation |
() |
4th Author's Name |
|
4th Author's Affiliation |
() |
5th Author's Name |
|
5th Author's Affiliation |
() |
6th Author's Name |
|
6th Author's Affiliation |
() |
7th Author's Name |
|
7th Author's Affiliation |
() |
8th Author's Name |
|
8th Author's Affiliation |
() |
9th Author's Name |
|
9th Author's Affiliation |
() |
10th Author's Name |
|
10th Author's Affiliation |
() |
11th Author's Name |
|
11th Author's Affiliation |
() |
12th Author's Name |
|
12th Author's Affiliation |
() |
13th Author's Name |
|
13th Author's Affiliation |
() |
14th Author's Name |
|
14th Author's Affiliation |
() |
15th Author's Name |
|
15th Author's Affiliation |
() |
16th Author's Name |
|
16th Author's Affiliation |
() |
17th Author's Name |
|
17th Author's Affiliation |
() |
18th Author's Name |
|
18th Author's Affiliation |
() |
19th Author's Name |
|
19th Author's Affiliation |
() |
20th Author's Name |
|
20th Author's Affiliation |
() |
Speaker |
Author-1 |
Date Time |
2011-12-16 14:45:00 |
Presentation Time |
30 minutes |
Registration for |
COMP |
Paper # |
COMP2011-43 |
Volume (vol) |
vol.111 |
Number (no) |
no.360 |
Page |
pp.53-60 |
#Pages |
8 |
Date of Issue |
2011-12-09 (COMP) |
|