Word-based lottery game

Information

  • Patent Grant
  • 7601059
  • Patent Number
    7,601,059
  • Date Filed
    Friday, January 20, 2006
    19 years ago
  • Date Issued
    Tuesday, October 13, 2009
    15 years ago
Abstract
A method for hosting a word-based lottery game having a plurality of players is disclosed. A player selects a plurality of cells from a playslip and these cells will be converted to a plurality of letters and symbols by a lottery game machine. The player will use these letters and symbols along with one or more letter(s) drawn by the lottery to form words and compare these words with a list of words. For each formed word that is on the list, a point is awarded and extra bonus points may be awarded to some special words. The total points obtained by the player is compared with a prize table and the player is awarded a prize according to the prize table.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The invention relates in general to lottery game methods. More particularly, the invention relates to an on-line lottery wagering game.


2. Description of the Related Art


Lotteries and lottery theory are well known in the art. Generally a prize is awarded when an assigned or chosen series of numbers is matched with corresponding numbers that have been randomly chosen. Most lotteries are based on numbers. Lotteries also incorporate other indicia, such as letters in a superficial way. What would be interesting would be a lottery game that incorporated letters in a meaningful way, such as a lottery game for which drawn letters form words and prizes are based thereon.


Therefore, it is to a word-based lottery game for which randomly drawn letters are used to form words and for which prizes are awarded that the present invention is primarily directed.


SUMMARY OF THE INVENTION

In one embodiment, there is provided a method for playing a word-based lottery game. The game comprises receiving a plurality of player indicia from a player, randomly generating one or more game indicia, forming a plurality of words using the plurality of player indicia and the game indicia, comparing the plurality of words with a list of predefined words, and awarding a prize to the player according to a comparison result.


In another embodiment, there is provided a method for playing a word-based lottery game. The game comprises assigning a plurality of words to a player, each word being assigned a point value, randomly generating game indicia, summing the point values for the words that can be formed with the randomly generated game indicia, and awarding a prize based on that total.


In another embodiment, there is provided a system for playing a word-based lottery game. The system comprises a communication network, at least one gaming machine in communication with the communication network, and a server in communication with the at least one gaming machine through the communication network. The server hosting the lottery game is capable of receiving a plurality of player indicia from a player, generating one or more game indicia, forming a plurality of words using the plurality of player indicia and the game indicia, comparing the plurality of words with a list of predefined words, and awarding a prize to the player according to a comparison result.


In yet another embodiment, there is provided yet another method of playing a word-based lottery game. The method comprises receiving a plurality of cells from a player, populating a ticket with numbers and symbols, matching the plurality of cells from the player with the ticket populated with letters and symbols, and issuing the ticket with a list of numbers and symbols matched to the plurality of cells to the player.


Other objects, features, and advantages of the present invention will become apparent after review of the Brief Description of the Drawings, Detailed Description of the Invention, and the Claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1A-1E illustrate an word list according to one embodiment of the invention.



FIG. 2 illustrates a sample playslip with a player selection.



FIG. 3 illustrates a sample ticket with a player selection.



FIG. 4 illustrates a sample prize table.



FIG. 5 illustrates a lottery process according to one embodiment of the invention.



FIG. 6 illustrates a network architecture supporting the present invention.



FIG. 7 illustrates a ticket composed of a set of words and a randomly produced set of letters.



FIG. 8 illustrates a prize table for the ticket in FIG. 7, wherein prizes are awarded based on the number of words that can be formed with the given letters.



FIG. 9 illustrates a ticket composed of a set of words and a randomly produced set of letters, wherein the set of words form sentences.



FIG. 10 illustrates a prize table for the ticket in FIG. 9 wherein prizes are awarded based on the number of words that can be formed with the given letters.



FIG. 11 is a distribution table of letters independently and randomly generated for the lottery game.





DETAILED DESCRIPTION OF THE INVENTION

In brief description, the present invention is a method for a word-based lottery game that allows a player to blindly select a series of letters as game indicia and a lottery authority conducts a lottery drawing comprising a random pick of a group of letters. The lottery authority has created in advance a list of prize words with various point values weighted for each prize word based upon the likelihood of formation from randomly-drawn letters, or other predetermined odds. A win is determined by the combination of the player-selected letters and the lottery-picked letters to form words, and the player is then awarded winnings based upon the total points of all prize words from the list of prize words that are created in the combination. The player selection process is blind, meaning that though the player determines through some process the series of letters, he does not know in advance what these letters are. So it is the case that the player's selection is effectively random. Therefore the player's selection, the lottery's selection, and the combination of the two can be assigned probabilities of occurrence. In some embodiments, the player providing indicia is omitted and only the letters randomly produced by the lottery are used to form words.


In one embodiment, the set of words is a sample list of 696 words, as illustrated in FIGS. 1A-1E. Those skilled in the art will appreciate that lists with other words may also be used. The draw is a composite event. The first part of the event is that of the player blindly selecting seven tiles (indicia) from a playslip 200 illustrated in FIG. 2 by marking 7 cells on the playslip 200. The playslip 200 has 100 cells; each cell is associated with either a letter or a special symbol, such as a wildcard symbol. The letters and symbols will be revealed on the ticket issued to the player. The second part of the event is that of the lottery drawing one letter (game indicia) out of 26 letters in the alphabet. This part of the draw applies to all players. The outcome is that of the letters blindly selected by the player plus the letter the lottery randomly drew form a total of 8 “characters.” The odds for such a game can be computed as if the draw were a single event, i.e., 8 letters being randomly drawn.


After the player makes the selection and purchases a ticket, the ticket is issued to the player. FIG. 3 illustrates an exemplary ticket 300 with player selection. Among the symbols in the ticket 300, there is a “?” that is a wildcard symbol and can be used in place of any letter. The ticket 300 also illustrates that the player may have selected a letter, such as “L,” more than once. The player will use the letter he selected and the letter drawn by the lottery to form words for comparison with the list of prize words. For example, for the ticket 300, the player's selection is “A C O O W Y ?,” where “?” is a wildcard symbol and can replace any letter. The rule for forming words is simple: each letter, including the letter drawn by the lottery, can be used at most once and not all of the letters need to be in a word. For example, if the lottery draws “N,” the words on the list of words that can be formed by seven letters (A C O O W Y N) and one wildcard symbol (?) are CLAN, DAWN, LAWN, SWAN, WAND, WOW, DOWN, NOSY, ONLY, SNOW, CROW, PONY, COAX, OKAY, COOL, WOOD, WOOL, CANOPY, CANYON, CONVOY, and COWBOY. One point is awarded to the player for each word. In this example, 21 points are awarded to the player. Other words, such as COOK, formed by the letters and wildcard symbol but not on the list do not earn any point for the player.


Besides awarding points for each matching word, bonus points may be assigned to select words. In the list of words shown in FIGS. 1A-1E, can be seen bonus points assigned to certain words. For example, in FIG. 1A, word “aardvark” is assigned 100 bonus points, and word “abstract” is assigned 10 bonus points. It is noted that not all words are assigned bonus points, for example, word “absurd” is not assigned any bonus point.


The particular set of 21 words in the above example includes a word (COWBOY) with 5 bonus points assigned to it. Therefore, the player would be awarded a score of 26 points (21 matches and 5 bonus points). According to the prize table illustrates on FIG. 4, the player would win $100. The overall odds of winning for the exemplary embodiment are 1 in 4.9 and return would be 61.8%.


To determine the return to the player for such a game it is necessary to know the probabilities associated with each of the prize tiers. As an example, one can compute the probability for winning a prize of $100 as follows. By the prize table, a prize of $100 is awarded for scores of at least 25 and less than 100. A computer program cycles through all the possible outcomes (i.e., the player blindly selected letters and the lottery drawn letter) and identifies those for which the score is at least 25 and less than 100 as successes. For example, the score for player's selection “A C O O W Y ?” and the lottery draw “N” is 26 points and is identified as one such outcome.


The probabilities for these individual outcomes considered successes are computed. For example, the probability of the aforementioned outcome is (using basic probability theory):

(9×2×(8×7/2)×2×2×2)/(100×99×98×97×96×95×94)×1/26=0.0000000096877297556


The sum of the probabilities for these outcomes is totaled. In this case, the sum is 0.010 to the nearest thousandth. That is, the probability of winning a prize of $100, which is the probability that an outcome can format least 25 but no more than 99 words on the list, which is the sum of the probabilities of individual outcomes each comprising 7 player blindly selected letters and the lottery's one selected letter, is 1.0%.



FIG. 7 illustrates a simplified version of the current invention. A ticket costs $5. The player component of the letter-selection process is omitted. The player does not select any letters, blindly or otherwise. Instead, the player is assigned a set of words. A set of letters is randomly produced and displayed at the bottom of the ticket. Prizes are based on the number of words that can be formed by these letters, as opposed to prizes being assigned to individual words. This is equivalent to each word being assigned a score of 1 and the prize being based on the total score. There are 36 words on the ticket. The set of words is produced by some random process, independently of the set of words. In this example, the 14 letters are randomly produced equivalent to the following process: 14 letters are independently and randomly generated based on the distribution in FIG. 11 with replacement. A set of letters is rejected if there are any repeated letters or if the set of letters does not contain all of the letters A E I N R T or if the set of letters contains a Q without a U. The official draw is the first set of letters produced that is not rejected. This random selection of letters occurs at the time of the purchase and is printed on the ticket under the 36 words. Those skilled in the art of mathematics can confirm that given a positive integer n, a probability can be assigned to the event that a set of letters produced by the described process can be assigned a probability. Therefore, a prize table can be derived as in FIG. 8, for which prizes are based on the number of words that can be formed with the letters. For example, for the ticket in FIG. 7, the player is able to form the words BANANA, BRAIN, CART, DANCER, EARTH, HAIR, MINER, MINT, TRAIN and ZEBRA, with the drawn letters A B C D E H I L M N R S T Z. By the prize table in FIG. 8, the player is awarded $500. The inverse probabilities in FIG. 8 are correct and mathematicians can verify that the return is 68.2% for this ticket. Another example, of this embodiment is in FIG. 9. Such a ticket costs $5. For this ticket, the words have meaning as a group as they form sentences. The 14 letters are randomly produced based on the above described process. The inverse probabilities of being able to form 6, 7, 8, 9, or 10 or more is illustrated in FIG. 10. Prizes are assigned based on these probabilities. Those skilled in the art of mathematics can confirm that the return for this ticket is 58.4%.



FIG. 5 illustrates a lottery process 500 according to one embodiment of the invention. A player marks his selection on a playslip 200 and purchases a lottery ticket 300. The player may purchase the ticket from a standalone lottery station, which may be connected to a lottery server through a communication network. The player's selection is received by the lottery station, step 502, and the lottery station will populate a ticket with random letters and wildcard symbols, step 504. The lottery may set the number of wildcard symbols that can be placed on a ticket. After generating a ticket with random numbers and symbols, the lottery station matches the player selection with the ticket, step 506, and issues a ticket with player selection to the player, step 508. The player selection is stored by the lottery station, either locally or remotely at the lottery server, step 510. The lottery station will send both the player selection along with player's wage information to the lottery server. Alternatively, the player may choose to have the lottery station to randomly pick a set of cells instead of picking them individually.


At a predetermined time, the lottery draws a letter, step 512, which will be sent to the lottery stations and made available to all players. After the lottery's draw is known, the lottery server may retrieve player selection from all the players, step 514, and form words with each player selection and the letter drawn by the lottery, step 516. The lottery server then compares all the words formed with words on the list of words, step 518, and determines a score for each player selection, step 520. The score for the player selection is compared with a prize table, step 522, and if the score is high enough, the player wins a prize, step 524.


The invention can be implemented on a standalone lottery station (gaming device) or a lottery server. A standalone lottery station may include a display unit, a scanning unit (also known as a player input device) for scanning playslips containing player selection, and a ticket issuing unit for issuing tickets to players. The lottery station has a controller with a random number generator capable of generating sets of letters for the player. The controller also takes player-selected information, if applicable, from the scanning device and issues a ticket to the player. The controller determines a number of matches for the player's ticket as described above. The lottery station may also be connected to a game server as illustrated in FIG. 6. The lottery station 602 is connected to the server 606 through a communication network 604. In the embodiment illustrated in FIG. 6, each gaming device receives wagers and selections from players, passes betting information to the server 606, and issues tickets to the players. The server 606 receives player selections and determines winners based on the numbers selected by the lottery authority.


Although several preferred embodiments of the invention have been disclosed in the foregoing specification, it is understood by those skilled in the art that many modifications and other embodiments of the invention will come to mind to which the invention pertains, having the benefit of the teaching presented in the foregoing description and associated drawings. It is thus understood that the invention is not limited to the specific embodiments disclosed herein, and that many modifications and other embodiments of the inventions are intended to be included within the scope of the appended claims. Moreover, although specific terms are employed herein, as well as in the claims, they are used in a generic and descriptive sense only, and not for the purposes of limiting the described invention, nor the claims which follow below.

Claims
  • 1. A method for conducting a word-based lottery game, comprising the steps of: having a player designate a plurality of player indicia from a set of hidden indicia, the number of player indicia being less than the number of hidden indicia, and the player indicia remaining unknown to the player;randomly generating game indicia that is also unknown to the player;revealing the player indicia and the game indicia to the player;forming a plurality of words using the plurality of player indicia and the game indicia;comparing the plurality of words for matches with a list of predefined prize words that is less than all possible words that may be formed from the player indicia and game indicia, each of the prize words having a value assigned thereto; andawarding a prize to the player according to a total value for the matched prize words.
  • 2. The method of claim 1, wherein a nominal base value is assigned for each match between the plurality of words and the list of predefined prize words.
  • 3. The method of claim 2, wherein certain words in the list of predefined prize words have additional bonus value above the nominal value.
  • 4. The method of claim 1, wherein the plurality of player indicia is randomly selected by the player from the set of hidden indicia.
  • 5. The method of claim 1, wherein the step of generating a game indicia further comprises the step of randomly selecting the indicia from a predefined set of indicia that includes letters and wildcard symbols.
  • 6. The method of claim 1 further comprising the steps of: designating the plurality of player indicia from the set of hidden indicia by the player inputting a selection on a ticket and then randomly populating the ticket with indicia such that the player indicia corresponds to the indicia assigned to the player's selection on the ticket.
  • 7. A system for hosting a word-based lottery game for a plurality of players, comprising: a communication network;at least one gaming machine in communication with the communication network; anda server in communication with the at least one gaming machine through the communication network, wherein the server hosting the lottery game is configured forreceiving a plurality of player indicia from each of the players, the player indicia selected by the player from a set of hidden indicia that includes any combination of letters and symbols, the number of player indicia being less than the number of indicia in the set of hidden indicia, the player indicia being unknown to the player,randomly generating game indicia that is common to all of the players and also unknown to the players,revealing the respective player indicia and the common game indicia to the players,each of the players forming a plurality of words using the plurality of player indicia and the game indicia,comparing the plurality of words with a limited list of predefined words that is less than all possible words that may be formed from the player indicia and game indicia, each of the predefined words having a value assigned thereto, andawarding a prize to the player according to a comparison result.
  • 8. The system of claim 7, wherein the server assigns a nominal base value for each match between the plurality of words and the list of predefined words.
  • 9. The system of claim 8, wherein certain of the words in the list of predefined words have a bonus value, and the server assigns the bonus value for any matched words between the plurality of words and the list of predefined words.
  • 10. The system of claim 7, wherein the server randomly generates the plurality of player indicia from the set of indicia upon receipt of instructions from the player.
  • 11. The system of claim 7, wherein the server randomly generates the game indicia from a predefined set of letters.
  • 12. The system of claim 7, wherein the server is configured to randomly populate a ticket with the set of hidden indicia, and to recognize a player's selection of player indicia from a player input to the ticket.
  • 13. The method of claim 1, wherein the player designates the plurality of player indicia player by selecting a plurality of cell positions from a set of cell positions on a game ticket, and then randomly populating all of the cell positions on the game ticket with any combination of letters and symbols, the player indicia corresponding to the letters or symbols in the plurality of player-selected cell positions.
CROSS REFERENCE TO RELATED APPLICATION

This application claims the benefit of U.S. Provisional Application No. 60/645,795, Word-based Lottery Game, filed on Jan. 21, 2005, the entirety of which is incorporated herein by this reference.

US Referenced Citations (314)
Number Name Date Kind
1527929 Simons Feb 1925 A
3089123 Hennis et al. May 1963 A
3195895 Kropinski Jul 1965 A
3245697 Nugent Apr 1966 A
3582075 Glass et al. Jun 1971 A
3606336 Krause Sep 1971 A
3699311 Dunbar Oct 1972 A
3736368 Vogelman et al. May 1973 A
3826499 Lenkoff Jul 1974 A
3868057 Chavez Feb 1975 A
3876865 Bliss Apr 1975 A
3902253 Sabuzawa et al. Sep 1975 A
3918174 Miller et al. Nov 1975 A
3922529 Orloff Nov 1975 A
3934120 Maymarev Jan 1976 A
4017834 Cuttill et al. Apr 1977 A
4095824 Bachman Jun 1978 A
4105156 Dethloff Aug 1978 A
4176406 Matkan Nov 1979 A
4191376 Goldman et al. Mar 1980 A
4194296 Pagnozzi et al. Mar 1980 A
4195772 Nishimura Apr 1980 A
4206920 Weatherford et al. Jun 1980 A
4241942 Bachman Dec 1980 A
4243216 Mazumber Jan 1981 A
4273362 Carrier et al. Jun 1981 A
4309452 Sachs Jan 1982 A
4313087 Weitzen et al. Jan 1982 A
4350342 Barulich Sep 1982 A
4355300 Weber Oct 1982 A
4375666 Buck et al. Mar 1983 A
4398708 Goldman et al. Aug 1983 A
4407443 McCorkle Oct 1983 A
4451759 Heynisch May 1984 A
4455039 Weitzen et al. Jun 1984 A
4457430 Darling et al. Jul 1984 A
4464423 LaBianca et al. Aug 1984 A
4466614 Bachman et al. Aug 1984 A
4488646 McCorkle Dec 1984 A
4491319 Nelson Jan 1985 A
4494197 Troy et al. Jan 1985 A
4536218 Ganho Aug 1985 A
4544184 Freund et al. Oct 1985 A
4579371 Long et al. Apr 1986 A
4591189 Holmen et al. May 1986 A
4634149 Donovan Jan 1987 A
4665502 Kreisner May 1987 A
4669729 Solitt et al. Jun 1987 A
4689742 Troy et al. Aug 1987 A
4695053 Vazquez et al. Sep 1987 A
4726608 Walton Feb 1988 A
4736109 Dvorzsak Apr 1988 A
4740016 Konecny et al. Apr 1988 A
4760247 Keane et al. Jul 1988 A
4763927 Schneider Aug 1988 A
4775155 Lees Oct 1988 A
4792667 Chen Dec 1988 A
4805907 Hagiwara Feb 1989 A
4817951 Crouch et al. Apr 1989 A
4835624 Black et al. May 1989 A
4836546 Dire et al. Jun 1989 A
4836553 Suttle et al. Jun 1989 A
4837728 Barrie et al. Jun 1989 A
4856787 Itkis Aug 1989 A
4861041 Jones et al. Aug 1989 A
4870260 Niepolomski et al. Sep 1989 A
4880964 Donahue Nov 1989 A
4888244 Masubuchi et al. Dec 1989 A
4891775 McWherter Jan 1990 A
4922522 Scanlon May 1990 A
4923199 Hahn May 1990 A
4943090 Fienberg Jul 1990 A
4960611 Fujisawa et al. Oct 1990 A
4961578 Chateau Oct 1990 A
4964642 Kamille Oct 1990 A
4996705 Entenmann et al. Feb 1991 A
4998010 Chandler et al. Mar 1991 A
4998199 Tashiro et al. Mar 1991 A
5032708 Comerford et al. Jul 1991 A
5033744 Bridgeman et al. Jul 1991 A
5037099 Burtch Aug 1991 A
5046737 Fienberg Sep 1991 A
5069453 Koza et al. Dec 1991 A
5074566 Desbiens Dec 1991 A
5083815 Scrymgeour et al. Jan 1992 A
5092598 Kamille Mar 1992 A
5094458 Kamille Mar 1992 A
5100139 Di Bella Mar 1992 A
5109153 Johnson et al. Apr 1992 A
5112050 Koza et al. May 1992 A
5116049 Sludikoff et al. May 1992 A
5118109 Gumina Jun 1992 A
5119295 Kapur Jun 1992 A
5158293 Mullins Oct 1992 A
5165967 Theno et al. Nov 1992 A
5186463 Marin et al. Feb 1993 A
5189292 Batterman et al. Feb 1993 A
5193815 Pollard Mar 1993 A
5193854 Borowski, Jr. et al. Mar 1993 A
5228692 Carrick et al. Jul 1993 A
5232221 Sludikoff et al. Aug 1993 A
5234798 Heninger et al. Aug 1993 A
5249801 Jarvis Oct 1993 A
5259616 Bergmann Nov 1993 A
5273281 Lovell Dec 1993 A
5276980 Carter et al. Jan 1994 A
5282620 Keesee Feb 1994 A
5308992 Crane et al. May 1994 A
5317135 Finocchio May 1994 A
5326104 Pease et al. Jul 1994 A
5332219 Marnell, II et al. Jul 1994 A
5342047 Hiedel et al. Aug 1994 A
5342049 Wichinsky et al. Aug 1994 A
5344144 Canon Sep 1994 A
5346258 Behn et al. Sep 1994 A
5380007 Travis et al. Jan 1995 A
5393057 Marnell, II et al. Feb 1995 A
5401024 Simunek Mar 1995 A
5401541 Simunek Mar 1995 A
5403039 Borowski, Jr. et al. Apr 1995 A
5407199 Gumina Apr 1995 A
5420406 Izawa et al. May 1995 A
5432005 Tanigami et al. Jul 1995 A
5451052 Behm et al. Sep 1995 A
5453602 Hanada Sep 1995 A
5456465 Durham Oct 1995 A
5471039 May Nov 1995 A
5471040 May Nov 1995 A
5475205 Behm et al. Dec 1995 A
5486005 Neal Jan 1996 A
5513846 Niederlien et al. May 1996 A
5528154 Leichner et al. Jun 1996 A
5536016 Thompson Jul 1996 A
5540442 Orselli et al. Jul 1996 A
5548110 Storch et al. Aug 1996 A
5550746 Jacobs Aug 1996 A
5558328 Krantz Sep 1996 A
5560610 Behm et al. Oct 1996 A
5564700 Celona Oct 1996 A
5564977 Algie Oct 1996 A
5591956 Longacre, Jr. et al. Jan 1997 A
5599046 Behm et al. Feb 1997 A
5602381 Hoshino et al. Feb 1997 A
5621200 Irwin et al. Apr 1997 A
5628684 Bouedec May 1997 A
5630753 Fuchs May 1997 A
5651735 Baba Jul 1997 A
5655961 Acres et al. Aug 1997 A
5657994 O'Connor Aug 1997 A
5667250 Behm et al. Sep 1997 A
5682819 Beatty Nov 1997 A
5690366 Luciano Nov 1997 A
5704647 Desbiens Jan 1998 A
5722891 Inoue Mar 1998 A
5726898 Jacobs Mar 1998 A
5732948 Yoseloff Mar 1998 A
5741183 Acres et al. Apr 1998 A
5743800 Huard et al. Apr 1998 A
5752882 Acres et al. May 1998 A
5756220 Hoshino et al. May 1998 A
5768142 Jacobs Jun 1998 A
5769421 Wakefield Jun 1998 A
5769458 Carides et al. Jun 1998 A
5770533 Franchi Jun 1998 A
5772509 Weiss Jun 1998 A
5772510 Roberts Jun 1998 A
5772511 Smeltzer Jun 1998 A
RE35684 Weingardt Jul 1998 E
5779840 Boris Jul 1998 A
5789459 Inagaki et al. Aug 1998 A
5791990 Schroeder et al. Aug 1998 A
5797794 Angell Aug 1998 A
5803504 Deshiens et al. Sep 1998 A
5816920 Hanai Oct 1998 A
5818019 Irwin, Jr. et al. Oct 1998 A
5820459 Acres et al. Oct 1998 A
5823874 Adams Oct 1998 A
5830063 Byrne Nov 1998 A
5830066 Goden et al. Nov 1998 A
5830067 Graves et al. Nov 1998 A
5833537 Barrie Nov 1998 A
5835576 Katz et al. Nov 1998 A
5836086 Elder Nov 1998 A
5836817 Acres et al. Nov 1998 A
5848932 Adams Dec 1998 A
5863075 Rich et al. Jan 1999 A
5871398 Schneier et al. Feb 1999 A
5876284 Acres et al. Mar 1999 A
5882261 Adams Mar 1999 A
5883537 Luoni et al. Mar 1999 A
5885158 Torango et al. Mar 1999 A
5887906 Sultan Mar 1999 A
5903340 Lawandy et al. May 1999 A
5911418 Adams Jun 1999 A
5915588 Stoken et al. Jun 1999 A
5921864 Walker et al. Jul 1999 A
5934671 Harrison Aug 1999 A
5970143 Shneier et al. Oct 1999 A
5979894 Alexoff Nov 1999 A
5996997 Kamille Dec 1999 A
5997044 Behm et al. Dec 1999 A
6004207 Wilson, Jr. et al. Dec 1999 A
6004208 Wilson, Jr. et al. Dec 1999 A
6007162 Hinz et al. Dec 1999 A
6012982 Piechowiak et al. Jan 2000 A
6014819 Maddix et al. Jan 2000 A
6017032 Grippo et al. Jan 2000 A
6024641 Sarno Feb 2000 A
6033307 Vancura et al. Mar 2000 A
6053405 Irwin, Jr. et al. Apr 2000 A
6077162 Weiss Jun 2000 A
6080062 Olson Jun 2000 A
6086477 Walker et al. Jul 2000 A
6089978 Adams Jul 2000 A
6099407 Parker, Jr. et al. Aug 2000 A
6102400 Scott et al. Aug 2000 A
6107913 Gatto et al. Aug 2000 A
6119364 Elder Sep 2000 A
6125368 Bridge et al. Sep 2000 A
6142872 Walker et al. Nov 2000 A
6146272 Walker et al. Nov 2000 A
6149521 Sanduski Nov 2000 A
6155491 Dueker et al. Dec 2000 A
6168439 Anderson Jan 2001 B1
6168521 Luciano et al. Jan 2001 B1
6168522 Walker et al. Jan 2001 B1
6179710 Sawyer et al. Jan 2001 B1
6203430 Walker et al. Mar 2001 B1
6206373 Garrod Mar 2001 B1
6210275 Olsen Apr 2001 B1
6217448 Olsen Apr 2001 B1
6220961 Keane et al. Apr 2001 B1
6224055 Walker et al. May 2001 B1
6227969 Yoseloff May 2001 B1
6238288 Walker et al. May 2001 B1
6241246 Guttin et al. Jun 2001 B1
6273817 Sultan Aug 2001 B1
6309300 Glavich Oct 2001 B1
6312334 Yoseloff Nov 2001 B1
6315291 Moody Nov 2001 B1
6330976 Dymetman et al. Dec 2001 B1
6331143 Yoseloff Dec 2001 B1
6334814 Adams Jan 2002 B1
6340158 Pierce et al. Jan 2002 B2
6368213 McNabola Apr 2002 B1
6375568 Roffman et al. Apr 2002 B1
6378868 La Bossiere Apr 2002 B1
6379742 Behm et al. Apr 2002 B1
6394899 Walker et al. May 2002 B1
6398214 Moteki et al. Jun 2002 B1
6398643 Knowles et al. Jun 2002 B1
6398644 Perrie et al. Jun 2002 B1
6398645 Yoseloff Jun 2002 B1
6416408 Tracy et al. Jul 2002 B2
6419579 Bennett Jul 2002 B1
6428412 Anderson et al. Aug 2002 B1
6435408 Irwin, Jr. et al. Aug 2002 B1
6435500 Gumina Aug 2002 B2
6435504 Nightingale Aug 2002 B1
6478677 Moody Nov 2002 B1
6491215 Irwin, Jr. et al. Dec 2002 B1
6497408 Walker et al. Dec 2002 B1
6552290 Lawandy Apr 2003 B1
6220596 Walker et al. Jul 2003 B1
6588747 Seelig Jul 2003 B1
6595855 Sako Jul 2003 B2
6599186 Walker et al. Jul 2003 B1
6601772 Rubin et al. Aug 2003 B1
6604997 Saidakovsky et al. Aug 2003 B2
6637747 Garrod Oct 2003 B1
6648735 Miyashita et al. Nov 2003 B2
6648753 Tracy et al. Nov 2003 B1
6648755 Luciano et al. Nov 2003 B1
6676126 Walker et al. Jan 2004 B1
6685561 Anderson et al. Feb 2004 B2
6692354 Tracy et al. Feb 2004 B2
6702047 Huber Mar 2004 B2
6769692 Cavalluzzo Aug 2004 B1
6773345 Walker et al. Aug 2004 B2
6776337 Irwin, Jr. et al. Aug 2004 B2
6786824 Cannon Sep 2004 B2
6823874 Lexcen Nov 2004 B2
6875105 Behm et al. Apr 2005 B1
6889978 Schaefer et al. May 2005 B2
6929186 Lapstun Aug 2005 B2
6966556 Culley et al. Nov 2005 B1
7229350 Baerlocher et al. Jun 2007 B2
20010027130 Namba et al. Oct 2001 A1
20010030978 Holloway et al. Oct 2001 A1
20010033689 Meder Oct 2001 A1
20010034262 Banyai Oct 2001 A1
20010040345 Au-Yeung Nov 2001 A1
20020022511 Eklund et al. Feb 2002 A1
20020084335 Ericson Jul 2002 A1
20020119812 Letang Aug 2002 A1
20020171201 Au-Yeung Nov 2002 A1
20020187825 Tracy et al. Dec 2002 A1
20030050109 Caro et al. Mar 2003 A1
20030114210 Meyer et al. Jun 2003 A1
20030201605 Badger Oct 2003 A1
20040076310 Hersch et al. Apr 2004 A1
20040173965 Stanek Sep 2004 A1
20040178582 Garrod Sep 2004 A1
20040185931 Hartman et al. Sep 2004 A1
20040204222 Roberts Oct 2004 A1
20040242308 Gray Dec 2004 A1
20040259631 Katz et al. Dec 2004 A1
20040266514 Penrice Dec 2004 A1
20050003884 Meyer et al. Jan 2005 A1
20050054415 Kaminkow et al. Mar 2005 A1
20050059465 Bozeman Mar 2005 A1
20050085289 Bozeman Apr 2005 A1
20050261044 Persidsky Nov 2005 A1
20050285336 Ilievski Dec 2005 A1
Foreign Referenced Citations (60)
Number Date Country
B-1842892 Dec 1992 AU
B-2107092 Jul 1993 AU
A-5032796 Feb 1997 AU
B-5249996 Feb 1997 AU
199716432 Sep 1997 AU
A-4540397 Apr 1998 AU
A-6355398 Oct 1998 AU
2938307 Apr 1981 DE
3035898 Apr 1982 DE
3035947 May 1982 DE
2938307 Jun 1982 DE
29803107 Aug 1988 DE
3822636 Jan 1990 DE
2938307 Aug 1990 DE
3822636 Jan 1992 DE
3415114 Oct 1995 DE
19646956 May 1998 DE
19706286 May 1998 DE
29816453 Apr 1999 DE
19751746 May 1999 DE
0122902 Apr 1984 EP
0333934 Sep 1989 EP
0458623 Nov 1991 EP
0798676 Oct 1997 EP
0799649 Oct 1997 EP
0149712 Jul 1998 EP
0874337 Oct 1998 EP
0896304 Feb 1999 EP
0914875 May 1999 EP
0914875 May 1999 EP
0919965 Jun 1999 EP
0983801 Mar 2000 EP
0983801 Mar 2001 EP
1149712 Oct 2001 EP
529535 Jun 1983 ES
529536 Jun 1983 ES
2006400 Apr 1989 ES
2006401 Apr 1989 ES
642892 Sep 1950 GB
2075918 Nov 1981 GB
2222712 Mar 1990 GB
2230373 Oct 1990 GB
2295775 Dec 1996 GB
3328311 Feb 1999 GB
23282311 Feb 1999 GB
02235744 Sep 1990 JP
04132672 May 1992 JP
WO8502250 May 1985 WO
WO9117529 Nov 1991 WO
WO 9803910 Jan 1998 WO
WO 9840138 Sep 1998 WO
WO 9909364 Feb 1999 WO
WO 9926204 May 1999 WO
WO 9939312 Aug 1999 WO
WO0000256 Jan 2000 WO
WO0078418 Dec 2000 WO
WO014460 Nov 2001 WO
WO0193966 Dec 2001 WO
WO02056266 Jul 2002 WO
WO 2005041132 May 2005 WO
Related Publications (1)
Number Date Country
20060178192 A1 Aug 2006 US
Provisional Applications (1)
Number Date Country
60645795 Jan 2005 US