← Back to Patent Explorer
US4466499A Expired / Lapsed US ⏱️ 0.0 years remaining

Combinatorial counting method

Assignee: ISHIDA KOKI SEISAKUSHO 44 SHOGOIN SANNOU-CHO SAKYO-KU KYOTO-SHI KYOTO JAPAN A CORP OF KK
•
Filing: 1982-09-20
•
Granted: 1984-08-21
•
Expires: 2002-09-20
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers, finding combinations of these numbers to compute combined numbers, finding the single combination of which the combined numbers are equal or closest to a set number and of which the combined weight is equal or closest to a set weight, and renewing the set weight every counting operation or whenever predetermined conditions are satisfied to use said set weight when the next counting operation is performed.

Inventors

  • 👤 Kazukiyo Minamida
  • 👤 Kouichi Ohta

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-30 05:50
CPC Classifications
G; G01; G01G; G01G13/00; G01G19/00; G01G19/40; G01G19/42

Claims Analysis

Total Claims: 14
Claim 1
Independent Claim 122 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of discriminating whether the combined number of an optimum combination is equal to the set number and, when equality is discriminated, employing the combined weight of said optimum combination as the set weight in the next combinatorial counting operation.
Claim 2
Dependent Claim 122 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of discriminating whether the combined number of an optimum combination is equal to the set number and, when equality is discriminated, employing the combined weight of said optimum combination as the set weight in the next combinatorial counting operation.
Claim 3
Dependent Claim 65 words
A combinatorial counting method according to claim 1, further comprising the steps of counting the number of times combinatorial counting operations are performed and, when said number of times attains a preset number of times N c , employing the combined weight of the optimum combination obtained in the N c -th combinatorial counting operation as a set weight in the next combinatorial counting operation.
Claim 4
Dependent Claim 45 words
A combinatorial counting method according to claim 1, further comprising the steps of measuring the duration of combinatorial counting operations and, when the duration exceeds a preset duration, employing the combined weight of the optimum combination which prevails at that time as a set weight.
Claim 5
Dependent Claim 37 words
A combinatorial counting method according to claim 1, in which a unit weight obtained by dividing the combined weight of said optimum combination number thereof is employed as the unit weight in the next combinatorial counting operation.
Claim 6
Dependent Claim 151 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; discriminating whether the combined weight of said optimum combination lies within a preset range; and when the combined number is equal to the set number and the combined weight lies within the preset range, employing the combined weight of said optimum combination as a set weight in the next combinatorial counting operation.
Claim 7
Dependent Claim 151 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; discriminating whether the combined weight of said optimum combination lies within a preset range; and when the combined number is equal to the set number and the combined weight lies within the preset range, employing the combined weight of said optimum combination as a set weight in the next combinatorial counting operation.
Claim 8
Dependent Claim 61 words
A combinatorial counting method according to claim 5, further comprising the steps of counting the number of times combinatorial counting operations are performed and, when said number of times exceeds a preset number of times N c , employing the combined weight of the optimum combination which prevails at that time as a set weight in the next combinatorial counting operation.
Claim 9
Dependent Claim 45 words
A combinatorial counting method according to claim 5, further comprising the steps of measuring the duration of combinatorial counting operations and, when the duration exceeds a preset duration, employing the combined weight of the optimum combination which prevails at that time as a set weight.
Claim 10
Dependent Claim 40 words
A combinatorial counting method according to claim 5, in which a unit weight obtained by dividing the combined weight of said optimum combination by the combined number thereof is employed as the unit weight in the next combinatorial counting operation.
Claim 11
Dependent Claim 144 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; dividing the combined weight of the optimum combination by the combined number thereof when equality is not discriminated; and employing a value, obtained by multiplying the quotient obtained from said dividing step by the set number,as a set weight in the next combinatorial counting operation.
Claim 12
Dependent Claim 144 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; dividing the combined weight of the optimum combination by the combined number thereof when equality is not discriminated; and employing a value, obtained by multiplying the quotient obtained from said dividing step by the set number,as a set weight in the next combinatorial counting operation.
Claim 13
Dependent Claim 169 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; discriminating whether the combined weight of said optimum combination lies with a preset range; when the combined number is not equal to the set number and the combined weight lies within the preset range, dividing the combined weight of the optimum combination by the combined number thereof; and employing a value, obtained by multiplying the quotient by the set number, as a set weight in the next combinatorial counting operation.
Claim 14
Dependent Claim 169 words
A combinatorial counting method for weighing a multiplicity of articles by one or a plurality of weighing machines, dividing the resulting plurality of weights by a unit weight to convert the weights into respective numbers of the articles, finding combinations of these numbers to compute combined numbers, and finding optimum combinations of which the combined numbers are equal or closest to a set number and of which the combined weights are equal or closest to a set weight, said method comprising the steps of: discriminating whether the combined number of an optimum combination is equal to the set number; discriminating whether the combined weight of said optimum combination lies with a preset range; when the combined number is not equal to the set number and the combined weight lies within the preset range, dividing the combined weight of the optimum combination by the combined number thereof; and employing a value, obtained by multiplying the quotient by the set number, as a set weight in the next combinatorial counting operation.

References Cited (Backward Citations)

US3862666A Cited
US4157738A Cited
US4360070A Cited
JPS56142419A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-08-21 1988-02-20 1988-08-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-08-21 1992-02-20 1992-08-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-08-21 1996-02-20 1996-08-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag