| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To maintain data exchangeability at a high level. <P>SOLUTION: The number of candidates in data transfer request candidate data is counted for each row as the number of candidates at a grid point of a grid of N rows×N columns, a minimum value among counted values for which the counted result is 1 or more is retrieved and one row indicating the minimum value is selected and stored. For the candidate in the selected row, the number of the candidates in the column where the candidate is present is counted for each column, the minimum value among the counted values for which the counted result is 1 or more is retrieved and one column indicating the minimum value is selected and stored. The candidates on the decided row and the candidates on the column are all eliminated and the procedures are repeated until there is no more candidate. At the point of time at which there is no more candidate, a combination of the stored row and column is decided as the combination of data transfer at the time of transferring data. <P>COPYRIGHT: (C)2003,JPO</p> |
