Patent US5893099A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5893099A Expired / Lapsed US ⏱️ 0.0 years remaining

System and method for processing electronic mail status rendezvous

Assignee: International Business Machines Corp
•
Filing: 1997-11-10
•
Granted: 1999-04-06
•
Expires: 2017-11-10
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system and method for processing electronic mail status rendezvous. A system for processing electronic mail status rendezvous includes an object for receiving a status message having incomplete reported recipient information; an object for initiating a candidate list of a plurality of candidates, the candidates being selected according to an identification in the status message; an object for preparing a search list of object identifiers; an object for eliminating non-matching candidates; and an object for selecting a matching candidate. A method for processing electronic mail status rendezvous includes the steps of receiving a status message having incomplete reported recipient information; preparing a candidate list of a plurality of candidates; the candidates selected according to an identification in the status message, preparing a search list of object identifiers; eliminating non-matching candidates; and selecting a matching candidate.

Inventors

  • 👤 Robert W. Schreiber
  • 👤 Gordon K. Arnold
  • 👤 Robert S. Miles

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 15:24
CPC Classifications
G; G06; G06Q; G06Q10/00; G06Q10/10; G06Q10/107

Claims Analysis

Total Claims: 23
Claim 1
Independent Claim 54 words
A method for processing electronic mail status rendezvous comprising: receiving a status message having incomplete reported recipient information; preparing a candidate list of a plurality of intended recipients, said candidates selected according to an identification in said status message; preparing a search list of object identifiers; eliminating non-matching candidates; and selecting a matching candidate.
Claim 2
Independent Claim 54 words
A method for processing electronic mail status rendezvous comprising: receiving a status message having incomplete reported recipient information; preparing a candidate list of a plurality of intended recipients, said candidates selected according to an identification in said status message; preparing a search list of object identifiers; eliminating non-matching candidates; and selecting a matching candidate.
Claim 3
Dependent Claim 35 words
The method of claim 1, wherein said search list comprises an elimination rate and a weight for each of said object identifiers; and wherein said candidate list comprises a score for each of said candidates.
Claim 4
Dependent Claim 34 words
The method of claim 2, wherein said step of preparing a candidate list comprises: creating an empty candidate list; and filling said empty candidate list with identifying information for each of said intended recipients.
Claim 5
Dependent Claim 53 words
The method of claim 2, wherein said step of preparing a search list of object identifiers comprises: creating a list of said object identifiers; calculating said elimination rate for each of said object identifier; sorting said object identifiers in descending elimination rate order; and establishing said weight for each of said object identifiers.
Claim 6
Dependent Claim 78 words
The method of claim 2, wherein said step of performing elimination comprises: selecting one of said object identifiers based on the elimination rate; determining a matching attribute for said selected object identifier; raising said score by said weight for said candidates having a value matching said matching attribute for said selected object identifier; eliminating said candidates not matching said matching attribute for said selected object identifier; and bypassing said candidates not having a value for said matching attribute.
Claim 7
Dependent Claim 19 words
The method of claim 5, wherein said step of performing elimination is repeated until no further eliminations are possible.
Claim 8
Dependent Claim 24 words
The method of claim 2, wherein said step of selecting a matching candidate comprises counting the number of candidates having a highest non-zero score.
Claim 9
Dependent Claim 24 words
The method of claim 7, further comprising selecting a candidate having a highest non-zero score when only one candidate has a highest non-zero score.
Claim 10
Dependent Claim 25 words
The method of claim 7, further comprising selecting all candidates having a highest non-zero score when more than one candidate has a highest non-zero score.
Claim 11
Dependent Claim 16 words
The method of claim 9, further comprising determining if all selected candidates are the same candidate.
Claim 12
Independent Claim 63 words
A system for processing electronic mail status rendezvous comprising: means for receiving a status message having incomplete reported recipient information; means for initiating a candidate list of a plurality of candidates, said candidates selected according to an identification in said status message; means for preparing a search list of object identifiers; means for eliminating non-matching candidates; and means for selecting a matching candidate.
Claim 13
Independent Claim 63 words
A system for processing electronic mail status rendezvous comprising: means for receiving a status message having incomplete reported recipient information; means for initiating a candidate list of a plurality of candidates, said candidates selected according to an identification in said status message; means for preparing a search list of object identifiers; means for eliminating non-matching candidates; and means for selecting a matching candidate.
Claim 14
Dependent Claim 34 words
The system of claim 11, wherein said search list comprises an elimination rate and a weight for each of said object identifiers; wherein said candidate list comprises a score for each of said candidates.
Claim 15
Dependent Claim 58 words
The system of claim 12, wherein said means for preparing a search list comprises: means for creating a list of said object identifiers; means for calculating said elimination rate for each of said object identifiers; means for sorting said object identifiers in descending elimination rate order; and means for establishing said weight for each of said object identifiers.
Claim 16
Dependent Claim 88 words
The system of claim 12, wherein said means for performing elimination comprises: means for selecting one of said object identifiers based on the elimination rate; means for determining a matching attribute for said selected object identifier; means for raising said score by said weight for said candidates having a value matching said matching attribute for said selected object identifier; means for eliminating said candidates not matching said matching attribute for said selected search attribute; and means for bypassing said candidates not having a value for said matching attribute.
Claim 17
Dependent Claim 46 words
The system of claim 12, wherein said means for selecting a matching candidate comprises: means for counting the number of candidates having a highest non-zero score; and means for selecting a candidate having a highest non-zero score when only one candidate has a highest non-zero score.
Claim 18
Dependent Claim 27 words
The system of claim 15, further comprising means for selecting all candidates having a highest non-zero score when more than one candidate has a highest non-zero score.
Claim 19
Dependent Claim 20 words
The system of claim 15, further comprising means for determining if a plurality of candidates have a highest non-zero score.
Claim 20
Dependent Claim 92 words
A computer usable medium having computer readable program code embodied therein for processing electronic mail status rendezvous, the computer readable program code comprising: computer readable program code for receiving a status message having incomplete reported recipient information; computer readable program code for initiating a candidate list of a plurality of candidates, the candidates selected according to an identification in the status message; computer readable program code for preparing a search list of object identifiers; computer readable program code for eliminating non-matching candidates; and computer readable program code for selecting a matching candidate.
Claim 21
Dependent Claim 92 words
A computer usable medium having computer readable program code embodied therein for processing electronic mail status rendezvous, the computer readable program code comprising: computer readable program code for receiving a status message having incomplete reported recipient information; computer readable program code for initiating a candidate list of a plurality of candidates, the candidates selected according to an identification in the status message; computer readable program code for preparing a search list of object identifiers; computer readable program code for eliminating non-matching candidates; and computer readable program code for selecting a matching candidate.
Claim 22
Dependent Claim 32 words
The computer usable medium of claim 18 further comprising computer readable program code for selecting all candidates having a highest non-zero score when more than one candidate has a highest non-zero score.
Claim 23
Dependent Claim 25 words
The computer usable medium of claim 18 further comprising computer readable program code for determining if a plurality of candidates have a highest non-zero score.

References Cited (Backward Citations)

US5764898A Cited
US5537543A Cited
US5613108A Cited
US5765170A Cited
US5715393A Cited
US5590178A Cited
US5786817A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-04-05 2002-10-05 2003-04-06 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-04-05 2006-10-05 2007-04-06 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-04-05 2010-10-05 2011-04-06 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag