1. Field of the Invention
The present invention is directed to the innovation of control mechanisms for enabling Instant Ticket Vending Machines (ITVMs), or instant tickets to offer conditional probability prizes of a higher value than are typically available for fixed or parimutuel games of chance. Specifically, this innovation resolves the problem of offering larger prizes on common games with a relatively small sales base. The common games are preferably implemented on ITVMs.
2. Background
“Class II” ITVMs enable games of chance to be played with enhanced entertainment and appeal resulting in millions of dollars in revenue worldwide. ITVMs rely on instant ticket's or pull-tab's prize awards dispensed at the time of play and generate profit by essentially allocating a portion of play revenue for prizes with the remainder allocated to expenses and yield.
Over the years companies have come to appreciate the virtues of producing games with more entertainment value of higher prizes that can be sold at a premium price. However, in the special case of ITVMs, these premium games are still limited to payout percentages established by law that are typically 65% for instant games. Thus, while higher prices can support higher prizes, the overall payout percentage remains the same, which can limit a game's appeal to a broader audience compared to other gaming venues that have much higher payout percentages.
In attempts to enhance player interest and participation in ITVMs, gaming manufacturers have added numerous kinds of additional game play to the primary game. One type of additional game play provides extra or bonus winnings from “progressive bonuses” or simply “progressives.” Progressive machines are designed to overcome the small payout associated with the bonus or secondary games discussed above. Progressive bonus play differs from other types of prior art bonus play in that multiple machines contribute to a common pool, winnable by a player of an individual machine upon the occurrence of specified randomized events. Progressives are funded by taking a fixed portion (percentage) of each wager made by players at individual machines, where the fixed portion of the wagers are collected into a single pool or pot to be won by a single player. Because a large number of machines are contributing to this common pool (amount of money collected), it is significantly larger than that available on a single machine. It is the larger pools that create the additional player interest and excitement.
However, progressive jackpot machines are most effective in large networks where the progressive jackpot can grow quickly and become a substantial amount to entice “Punter” and “Jackpot” players. In small networks or isolated gaming machines, progressive jackpots tend to not be appealing to these types of players and consequently tend to not increase sales. Additionally, in the case of a progressive jackpot operating in a large network, there is a corresponding smaller amount of likelihood an individual will be the winner of the larger pool.
Thus, there is a need to increase player interest and participation in ITVMs through the use of incentives that pay larger amounts than bonus game play, but are perceived by the players as having a higher likelihood of winning as compared to the large, but very infrequently won, progressive and draw game tickets.
Objects and advantages of the present invention will be set forth in part in the following description, or may be obvious from the description, or may be learned through practice of the invention.
Described are mechanisms, systems, and methodologies related to conditional probability prize fund accelerators enabling hitherto unknown methods of expanding the consumer perceived prize fund in ITVMs that do not necessitate increasing the basic prize fund beyond its existing standard or legal maximum.
In a particular embodiment, conditional probabilities are linked to specific levels of a common fixed prize fund where the prize payout is within predefined limits, yet offering chances at larger prizes (e.g., $1,200; $5,000; $100,000) on games over a predefined number of plays or “buy-ins.” This conditional probability enabler feature is implemented at the time of the prize fund generation. This embodiment is particularly desirable for “Class II” ITVM instant tickets or pull-tabs where all prize awards are determined during the instant ticket or pull-tab printing process. In an alternative embodiment, the conditional probabilities can be added to a fixed prize fund where when a fixed prize fund enhanced conditional probability prize tier is selected at a later time, the actual conditional probability drawing occurs at this time using its own prize table via some form of Random Number Generator (RNG).
In another embodiment, conditional probabilities are linked to specific levels of a dynamic prize fund where the prize payout is within prescribed limits of risk while still offering chances at large prizes on games with a relatively small number of plays or buy-ins. This embodiment differs from the previous embodiments in that the conditional probabilities are linked to specific levels associated with dynamic prize funds. Dynamic prize funds differ from static prize funds in that dynamic prize fund systems typically employ a random or pseudorandom event (e.g., RNG, player selection) to select a standard (one dimensional) prize level in approximately real time (e.g., when the consumer “pulls” the play on a “Class II” machine). The (second or other dimension) conditional probability function is applied when a given prize tier is selected near real time. In contrast, with static prize funds, prize tiers are essentially awarded when the instant tickets are generated and printed.
In yet another embodiment, conditional probabilities are linked to specific levels of a static or dynamic prize fund where the conditional probabilities itself is dynamic or fluid depending on the total plays or buy-ins at any given moment in time. In this embodiment, the static or dynamic prize fund and associated payouts are maintained within prescribed limits of risk with the aid of real world feedback.
A number of mechanisms and methodologies that provide practical details for reliably producing conditional probability enhanced prize funds and associated secondary games are described below. Although the examples provided herein are primarily related to ITVMs, it is clear that the same methods are applicable to any type of small number specialized games with a common prize fund.
Reference will now be made in detail to examples of the present invention, one or more embodiments of which are illustrated in the figures. Each example is provided by way of explanation of the invention, and not as a limitation of the invention. For instance, features illustrated or described with respect to one embodiment may be used with another embodiment to yield still a further embodiment. It is intended that the present application encompass these and other modifications and variations as come within the scope and spirit of the invention.
Providing a conditional probability enhancement to either a static or dynamic prize fund requires determination of: (i) a buy-in amount for each enhanced prize sub-level, (ii) at least a first order approximation of the anticipated number of trials, and (iii) a proper set of enhanced prize sub-levels that is both exhaustive and mutually-exclusive (i.e., the set of enhanced prize sub-levels must include all possibilities and each event in the set must be so defined that its occurrence excludes the occurrence of any other in the set). By applying these inputs to a conditional probability enhancement algorithm, an enhanced conditional probability prize structure can be realized, thereby providing higher potential prizes without significant risk to the expected profit of the game.
In statistics, the standard deviation (typically abbreviated by the Greek letter sigma, σ) for a population is a measure that is used to quantify the amount of variation or dispersion of a set of data values. A standard deviation close to zero indicates that the data points tend to be very close to the mean (typically abbreviated by the Greek letter mu, μ) of the set, while a high standard deviation indicates that the data points are spread out over a wider range of values. For the normal (Gaussian) distribution, the values less than one standard deviation (σ) away from the mean (μ) account for 68.27% of the set; while two standard deviations (2σ) from the mean (μ) account for 95.45%; and three standard deviations (3σ) account for 99.73%. In the context of this invention, the mean (μ) is the average jackpot prize or the Expected Value (EV). The mean (μ) average jackpot prize or EV is the probability-weighted average of all possible values. In other words, each possible value the outcome can assume is multiplied by its probability of occurring, and the resulting products are summed to produce the mean (μ) average jackpot prize or EV.
In one embodiment, the conditional probability enhancement algorithm accepts the previously described inputs, calculates the mean (μ) average jackpot prize or EV for the overall conditional probability enhancement, the sum of the total buy-ins (Σ Buy-Ins) anticipated for a game, the sum total of the individual sub-prize levels EV (Σμ), as well as 3σ for the conditional probability enhancement. Thus, so long as sum of 3σ and Σμ (i.e., 3σ+Σμ) is less than Σ Buy-Ins there is at least a 99.73% probability that the conditional probability enhancement payouts will not exceed the budgeted prize fund for a given game. Due to the biasing of conditional probability enhanced prize sub-levels, the redeemed prize curve is not truly Gaussian, hence some deviation from the ideal is to be expected. However, due to the inherent nature of the enhanced prize sub-levels quantization, the deviation should always take the conservative form of less money fluctuation from μ. Additionally, while the 3σ value reflects the expected fluctuation plus or minus from μ, as a practical manner the game operator is only concerned with the asymmetry of exceeding the plus side and not the minus. But, nevertheless the 3σ+Σμ value provides an excellent (worst case) approximation assuming 99.7% of the expected cases.
For example,
This is not to imply that a secondary conditional probability drawing must offer significantly enhanced top prizes whenever a player wins a “Jackpot” 106 in the standard game 100. It is also possible, and in some embodiments desirable, for the secondary conditional probability drawing to only offer marginally higher top prizes—e.g., see
Consequently, in the above-described embodiments, by adding a conditional probability drawing 125, the standard “Jackpot Win” is enhanced to offer higher top prizes comprised of a variable number of sub-tiers (six 150-155 in
There are other methodologies for calculating risk associated with conditional probability enhanced prize funds (e.g., confidence intervals, Monte Carlo methods, 2σ+Σμ) that may under some circumstances be more desirable. The disclosed 3σ+Σμ model is merely one possible example of this embodiment with other methodologies possible. Again, the significant concept is to charge the standard prize fund a fee for at least one prize level with conditional probability enhancements being associated to that prize level at an acceptable risk level. Thus, with conditional probability enhancements, the perceived prize fund is enhanced (i.e., higher top prizes) without impacting the prize fund's overall EV over a minimum specified number of trials.
In yet another embodiment, a majority of the jackpot tickets have a value that is slightly higher than the EV and the remaining jackpot tickets have a value that is significantly lower than the EV. The prize structure in this embodiment is adjusted accordingly based on the concepts disclosed above to create the prize structures of the other embodiments.
The third component of the enhancement algorithmic generator 580 then algorithmically determines the Minimum number of Trials (Mt) necessary to provide the acceptable level of risk for providing an enhanced conditional probability payout at a given prize level. As previously stated, the actual methodology for determining the enhanced conditional probability acceptable risk can vary (e.g., confidence intervals, Monte Carlo methods, 2σ+Σμ). However, in this preferred embodiment when the difference between the Buy-Ins value minus the 3σ+Σμ value turns positive with respect to the number of trials, this constitutes the lowest threshold of acceptable risk or “Mt” (e.g., 254 in
The fourth component of the enhancement algorithmic generator 582 functions as a risk assessment gatekeeper by simply testing to determine if Mt is less than Et. Once the fourth gatekeeping component is satisfied, the candidate conditional probabilities payouts are promoted to actual probabilities payouts and a flag is created for the prize level(s) to be enhanced and passed to the standard game generator 583.
The standard game generator 583 creates the image files for all of the tickets/pull-tabs to be printed for ITVMs. This basic process is not significantly different with the addition of enhanced prize levels. The only difference occurs when game generator 583 determines that a given pending ticket/pull-tab image is associated with a prize level to be enhanced. When this occurs, a call is made to the fifth component of the enhancement algorithmic generator 584 that accesses the actual probabilities payouts file 579 associated with the game and prize level being imaged and conducts its own drawing determining which sub-level prize will be associated with the ticket/pull-tab to be imaged. The drawing conducted by the conditional probability sub-generator 584 weighs each sub-prize level according to its probability assigned in the database. In a preferred embodiment, the conditional probability sub-generator 584 performs the drawing based on a, preferably, digitally signed seed or random number from an external device 588 such as a True Random Number Generator (TRNG). The optional external hardware TRNG provides a virtually infinite source of random numbers that can be, preferably, audited to verify that that the sub-prize level drawing was authentic.
Once all of the enhanced prizes have been determined 584 and the ticket/pull-tab image generation is completed 583, the tickets or pull-tabs are printed in the traditional manner 585, with any validation and ship files 586 also generated, and ultimately loaded into the ITVMs 587 in the field. The prize codes printed on the tickets or pull-tabs are expanded to include all of the possible sub-tier prizes from the actual probabilities payouts file 579. For security considerations well known in the art, at least one embodiment of the prize codes printed on the tickets or pull-tabs are typically printed in cryptographically secure machine readable variable indicia—preferably in an encrypted machine readable format using a symmetrical encryption algorithm such as the Advanced Encryption Algorithm (AES). Optionally, in addition to the machine readable cryptographically secure variable indicia, human readable (i.e., cleartext) indicia indicating the ticket's prize and/or jackpot status may also be added to the ticket or pull-tab. Typically, when human readable prize indicia are included, it is further secured by being hidden under a Scratch Off Coating (SOC).
As shown in the embodiment's 500 associated system architecture diagram
The enhancement algorithmic generator server 526 receives game prize structure data 576 from an outside source directly into its Central Processing Unit (CPU) 527. Additionally, the enhancement algorithmic generator server 526 CPU 527 receives Et 581 data. Aside from the CPU 527, the enhancement algorithmic generator server 526 also includes memory 528, as well as a database of conditional probability payouts 579. The memory 528 is sufficient to embody and run the enhancement algorithmic generator's four component (i.e., prize levels 577′, conditional probabilities 578′, Mt 580′, and gate keeper 582′) algorithms.
Game generator server 529 CPU 530 also receives this same game prize structure data 576 as well as a secure and authenticated interface—e.g., Secure Socket Layer (SSL), Virtual Private Network (VPN)—to the remote enhancement algorithmic generator server's 526 CPU 527. Preferably, memory in the game generation server 529 is functionally divided into two segments: (i) the standard game generation memory 531 and the (ii) conditional probability memory 532. By functionally dividing memory into these two functional components (531 and 532), the traditional game generation software is minimally impacted and therefore has a lower probability of any bugs being introduced by the added conditional probability algorithm. Optionally, game generation server's 529 CPU 530 may also receive random shuffle seeds from an external hardware TRNG 588. In a preferred embodiment, the random shuffle seeds are digitally signed and originate from a Dallas Semiconductor DS5250 cryptographic microprocessor 588.
After the digital game generation is complete with the conditional probabilities inserted into all appropriate prize levels, the game generation server's 529 CPU 530 will transmit the instant ticket and/or pull-tab indicia (i.e., win or lose imagery and associated barcode with cryptographically secure machine readable win or lose indicia) data through a buffer 532 to printing press imager 585 that physically prints the game's tickets. As part of this printing process, typically the game generation server's 529 CPU 530 will also create validation and ship files 586 that are ultimately transmitted to the ITVMs 535 in the field for play and validation of the printed tickets 585 loaded into the ITVMs 535.
In an alternative embodiment, the conditional probability enhancement feature is reserved for real time conditional probability drawings via some form of random or pseudorandom event (e.g., RNG, player choice). With this embodiment, the conditional probabilities are flagged in the fixed prize fund such that when a fixed prize fund enhanced conditional probability prize tier ticket is drawn by the ITVM 535, the actual conditional probability drawing occurs in real time using its own prize table with a random or pseudorandom event. This embodiment has the advantage of allowing for flexibility of the conditional probability prize fund over time. This flexibility may further include the option for a player to select one of a multiplicity of potential conditional probability prize funds (e.g., higher chance of winning a nominal sum greater than the buy-in thereby appealing to “Grind” players, higher top prize with lower odds thereby appealing to “Punter” and “Jackpot” players) or to even allow the player to elect not to play the conditional prize fund feature and take the buy-in amount as the prize. In a preferred embodiment, this real time conditional drawing feature alters the choices available to the player based on how the conditional probability feature has been historically functioning in the real world. This preferred embodiment thereby has the ability to fine-tune the actual conditional probability payout to be closer to theoretical (e.g., 3σ+Σμ in the previous embodiment) as the game progresses.
Referring to
Next, the third component of the enhancement generator 605 algorithmically determines the Mt necessary to provide the acceptable level of risk for providing an enhanced conditional probability payout at a given prize level. In addition to calculating Mt, the third component 605 also accepts the Et as an additional input 606. Et is supplied in this embodiment by a source outside of the conditional enhancement generator. This source may be from human input or in a preferred embodiment, a separate server, or an application with a unique Application Programming Interface (API) to the enhancement algorithmic generator.
As previously described, the fourth component of the enhancement algorithmic generator 607 functions as a risk assessment gatekeeper by simply testing to determine if Mt is sufficiently less than Et. Once the fourth gatekeeping component is satisfied, the candidate conditional probabilities payouts are promoted to actual probabilities payouts and the calculated payouts are transmitted to a separate audit function 653.
After the conditional probabilities payouts and associated game prize structure are audited and verified 653, the corresponding data is then passed to the game or deal generator portion 652. This portion 652 starts by importing 654 the prize structure and conditional probabilities payouts through an established secure API that authenticates the data, thereby confirming its integrity and origin 655. The authenticated conditional probabilities payouts and associated game prize structure, along with the game type, are then used to create records of all plays in the candidate game 656. This generated game data is then algorithmically verified and audited 657 and passed onto a separate process that generates 658 the forms describing the entire game payout and imaging. These forms are then audited by an external source 659 separate from the game or deal generator portion 652. Assuming the audit is successful, the form data is then utilized to create the actual deals 660 or images that are utilized to print the tickets for the ITVMs with cryptographically secure machine readable variable indicia—preferably in an encrypted machine readable format using a symmetrical encryption algorithm such as the AES. In a preferred optional embodiment, the shuffling of the deals and correspondingly the distribution of prizes is determined from seed data provided from a separate TRNG 610.
Once the deal is generated, a final pre-print audit is conducted 661. After a successful audit is completed 661, the deal data is utilized to print the physical tickets and generate and deliver the ship and validation files that will ultimately be sold and validated on file ITVMs 662.
As before, in the embodiment's 600 associated system architecture diagram
The enhancement algorithmic generator server 626 receives game prize structure data 676 from an outside source directly into its CPU 627. Additionally, the enhancement algorithmic generator server 626 CPU 627 receives Et 681 data. Aside from the CPU 627, the enhancement algorithmic generator server 626 also includes memory 628 as well as a database of conditional probability payouts 679. The memory 628 is sufficient to embody and run the enhancement algorithmic generator's four component algorithms.
Game generator server 629 CPU 630 also receives this same game prize structure data 676 as the enhancement server 626 as well as a secure and authenticated interface to the remote enhancement algorithmic generator server's 626 CPU 627 assuming the conditional probabilities payouts and associated game prize structure are audited and verified 636 successfully. Preferably, memory in the game generation server 629 is functionally divided into two segments, namely, standard game generation memory 631 and conditional probability memory 632. By functionally dividing memory into these two functional components (631 and 632), the traditional game generation software is minimally impacted and therefore has a lower probability of any bugs being introduced by the added conditional probability algorithm. In a preferred embodiment, the prize structure and conditional probabilities are first validated 690 by a third party (e.g., external auditor, audit algorithm) prior to being loaded into game generation server's 629 memory 631 and 632. Optionally, game generation server's 629 CPU 630 may also receive random shuffle seeds from an external hardware TRNG 688.
After the digital game generation is complete with the conditional probabilities inserted into all appropriate prize levels, the game generation server's 629 CPU 630 transmits the instant ticket or pull-tab indicia data through a buffer 633 to printing press imager 685 that physically prints the game's tickets. As part of this printing process, typically the game generation server's 629 CPU 630 will also create validation and ship files 686 that are ultimately transmitted to the ITVMs 635 in the field for play and validation of the printed tickets 685 loaded into the ITVMs 635.
As before, the process of
The third component of the enhancement algorithmic generator 705 then algorithmically determines the Mt necessary to provide the acceptable level of risk for providing an enhanced conditional probability payout at a given prize level. As before, the actual methodology for determining the enhanced conditional probability acceptable risk can vary. In addition to calculating A, the third component 705 also accepts the Et as an additional input 706. Et is determined in this embodiment by the anticipated number of total pulls or plays times the probability of triggering an enhanced prize fund prize tier.
The fourth component of the enhancement algorithmic generator 707 functions, as before, as a risk assessment gatekeeper by simply testing to determine if Mt is less than Et. If not, then the candidate conditional probabilities payouts are discarded and the process repeats itself in a cyclical fashion until candidate conditional probabilities payouts are developed that pass the Mt<Et test 707. Once the fourth gatekeeping component is satisfied, the candidate conditional probabilities payouts are promoted to actual probabilities payouts and a flag is created for the prize level(s) to be enhanced and passed to the field machine's local memory 708.
Next, the field machine accepts the enhanced conditional probabilities payouts in its database 708. Thus, the machine's basic functionality is not impacted, with the enhanced conditional probability payout only being triggered when the machine 709 selects an enhanced prize level via its drawing 710. This drawing process can vary (e.g., RNG, player choice) the significant point being that the drawing outcome is not determined a priori until the play or pull. When an enhanced conditional probability prize level is selected, the game play parameters 711 for the conditional probability enhanced game are invoked with the conditional probability drawing occurring and the results displayed to the player 712.
This dynamic embodiment's 700 associated system architecture diagram
Field machine's 735 CPU 730 also receives this same game prize structure data 776. Preferably, memory in the field machine 735 is functionally divided into two segments, namely, standard game generation memory 731 and conditional probability memory 732. By functionally dividing memory into these two functional components (731 and 732), the traditional game generation software is minimally impacted and therefore has a lower probability of any bugs being introduced by the added conditional probability algorithm. In a preferred embodiment, the prize structure and conditional probabilities are first validated 736 by a third party (e.g., external auditor, audit algorithm) prior to being loaded into field machine's 735 memory 731 and 732.
When play is initiated on field machine 735, random or pseudorandom data from a source 788 (e.g., RNG, human interaction) is used to determine the particular play's outcome 786. In the event a winning tier was selected associated with a conditional probability enhancement, the conditional probability algorithm is executed in its partitioned memory 732 with its outcome determined, real time, by a RNG or other random or pseudorandom source.
If feedback is added to the previous embodiment, the resulting preferred embodiment 800 of
Aside from developing multiplicities of sub-level probabilities pairs 804, the basic process for conditional probability enhancement remains the same through the fourth component functioning as a risk assessment gatekeeper by testing that Mt<Et 807. Once the fourth gatekeeping component is satisfied, the candidate conditional probabilities payouts are promoted to actual probabilities payouts and a flag is created for the prize level(s) to be enhanced and passed to the field machine's local database 808.
As before, the field machine 835 accepts the enhanced conditional probabilities payouts in its database 808 along with the normal prize structure 801. Once this data is loaded into the machine's 835 game play parameter database 808, the game can be made active and placed on sale 812. As before, the enhanced conditional probability payout is only triggered when the game play portion of the machine 809 selects an enhanced prize via its localized random or pseudorandom event (e.g., RNG, player choice) 810. Whenever that occurs, the game play parameters 808 for the conditional probability enhanced game is invoked. However, in this preferred embodiment, network statistics 814 and/or local machine game play history 325 are evaluated to determine which enhanced controlled probability prize fund from the database 811 should be employed for the conditional probability drawing. The overriding concept is to ensure that the actual payout for multiplicities of games remains in the boundaries of the previously calculated acceptable risk (e.g., 3σ+Σμ as described in a previous embodiment).
To clearly differentiate the mechanism for integrating conditional probability enhancements into the standard process for dynamic enhanced conditional probability prizes, the alerted portion for dynamic payout is highlighted in dashed area 813 in
As before, this dynamic feedback embodiment's 800 associated system architecture diagram
Field machine's 835 CPU 830 also receives this same game prize structure data 876. Memory in the field machine 835 is functionally divided into two segments, namely, standard game generation memory 831 and conditional probability memory 832. By functionally dividing memory into these two functional components (831 and 832), the traditional game generation software is minimally impacted and therefore has a lower probability of any bugs being introduced by the added conditional probability algorithm. In a preferred embodiment, the prize structure and conditional probabilities are first validated 836 by a third party (e.g., external auditor, audit algorithm) prior to being loaded into field machine's 835 memory 831 and 732. Game play parameters are stored in either the standard game generation memory 831 or the conditional probability memory 832 depending on which portion the parameters impacts.
When play is initiated on field machine 835, random or pseudorandom data from a source 888 (e.g., RNG, human interaction) is used to determine the particular play's outcome 886. In the event a winning tier was selected associated with a conditional probability enhancement, the conditional probability algorithm is executed in its partitioned memory 832 with its outcome determined, real time, by a RNG or other random/pseudorandom source.
In a preferred embodiment, this dynamic feedback feature alters the choices available to the player based on how the conditional probability feature has been historically functioning in the real world. This preferred embodiment thereby has the ability to fine-tune the actual conditional probability payout to be closer to theoretical (e.g., 3σ+Σμ in the previous embodiment) as the game progresses.
It should be appreciated by those skilled in the art that various modifications and variations may be made present invention without departing from the scope and spirit of the invention. It is intended that the present invention include such modifications and variations as come within the scope of the appended claims.
The present application claims priority to U.S. Provisional Application No. 62/240,301, filed on Oct. 12, 2015, which is hereby incorporated by reference.
Number | Name | Date | Kind |
---|---|---|---|
5048833 | Lamle | Sep 1991 | A |
5249800 | Hilgendorf et al. | Oct 1993 | A |
5280909 | Tracy | Jan 1994 | A |
5951011 | Potter et al. | Sep 1999 | A |
5980385 | Clapper, Jr. | Nov 1999 | A |
6565436 | Baerlocher | May 2003 | B1 |
6588747 | Seelig | Jul 2003 | B1 |
6793219 | Higginson | Sep 2004 | B2 |
6827646 | Adams | Dec 2004 | B2 |
7074127 | Cuddy et al. | Jul 2006 | B2 |
7201657 | Baerlocher et al. | Apr 2007 | B2 |
7213811 | Bozeman | May 2007 | B2 |
7407436 | Groz | Aug 2008 | B2 |
7635302 | Wright | Dec 2009 | B2 |
7635304 | Wright | Dec 2009 | B2 |
8052148 | Kelly et al. | Nov 2011 | B1 |
8216045 | Wright et al. | Jul 2012 | B2 |
8308551 | Bennett, III et al. | Nov 2012 | B2 |
8348754 | Jackson et al. | Jan 2013 | B2 |
8845409 | Kane et al. | Sep 2014 | B2 |
20030080507 | Higginson | May 2003 | A1 |
20030125108 | Groz | Jul 2003 | A1 |
20050164767 | Wright | Jul 2005 | A1 |
20060287072 | Walker et al. | Dec 2006 | A1 |
20070123340 | Vancura | May 2007 | A1 |
20080015005 | Yaldoo et al. | Jan 2008 | A1 |
20100093419 | Wright et al. | Apr 2010 | A1 |
20100124967 | Lutnick et al. | May 2010 | A1 |
20100144418 | Luciano, Jr. et al. | Jun 2010 | A1 |
20130102372 | Lutnick et al. | Apr 2013 | A1 |
20130172062 | Amaitis et al. | Jul 2013 | A1 |
20130210510 | Mahaffey et al. | Aug 2013 | A1 |
20140187303 | Irwin, Jr. | Jul 2014 | A1 |
Number | Date | Country | |
---|---|---|---|
20170103611 A1 | Apr 2017 | US |
Number | Date | Country | |
---|---|---|---|
62240301 | Oct 2015 | US |