The present disclosure relates generally to wager-based games and more particularly to keno games. A keno game typically displays to a player a keno board with eighty numbered selection spots. A player wagers by selecting six spots on the keno board. Next, twenty balls are drawn from eighty possible balls, with each ball having a number between one and eighty. The player is paid based on matches found between the drawn balls and the six player-selected spots on the keno board. For example, the player may have selected numbers 5, 21, 34, 36, 49, and 71 of which 5 and 21 match the ball drawn by the keno game. A paytable may dictate the payout amount that is due to the player depending on the number of matches detected. For example, a paytable may indicate that if there are four matches, then the payout amount is seven points.
A method of providing a keno game for plays with duplicate draws, includes, but is not limited to any of the combination of: displaying a keno game including a keno game board having a first predetermined number of keno board spots; receiving a player selection of a second predetermined number of keno board spots; determining drawn balls for a plurality of ball sets; displaying the determined drawn balls with one or more paylines overlaying at least some of the drawn balls in the plurality of ball sets; and calculating a player award based at least in part on evaluation of each payline.
An electronic device for playing a keno game includes a display configured to display the keno game to a player having a keno board with a first predetermined number of keno board spots, a user-input panel and a game controller having one or more data processors and one or more storage devices storing instructions that, when executed by the one or more data processors, cause the one or more data processors to perform various operations. The operations may include receiving a player selection of a second predetermined number of keno board spots; determining drawn balls for a plurality of balls sets; displaying the determined drawn balls with one or more paylines overlaying on top of at least some of the drawn balls in the plurality of drawn ball sets and calculating a player award based at least in part on evaluation of each payline.
A computer-readable storage medium has machine instructions stored therein that are executable by a processor to cause the processor to perform operations including displaying a keno game including a keno game board having a first predetermined number of keno board spots; receiving a player selection of a second predetermined number of keno board spots; determining drawn balls for a plurality of balls sets; displaying the drawn balls in the plurality of ball sets, wherein the plurality of ball sets are visually divided into one or more areas; and calculating player award based at least in part on relative position of drawn balls with respect to each other within each area.
A method of providing a keno game includes displaying a keno game including a keno game board having a first predetermined number of keno board spots; receiving a player selection of a second predetermined number of keno board spots; determining drawn balls for a plurality of balls sets; displaying the drawn balls in the plurality of balls sets, wherein the plurality of balls sets are visually divided into one or more areas; and calculating player award based at least in part on relative position of drawn balls with respect to each other within each area.
The details of one or more implementations are set forth in the accompanying drawings and the description below. Other features, aspects, and advantages of the disclosure will become apparent from the description, the drawings, and the claims, in which:
Numerous specific details may be set forth below to provide a thorough understanding of concepts underlying the described embodiments. It may be apparent, however, to one skilled in the art that the described embodiments may be practiced without some or all of these specific details. In other instances, some process steps have not been described in detail in order to avoid unnecessarily obscuring the underlying concept.
During a keno game, the player may select and mark spots on a keno board shown to the player on an electronic display of a gaming machine or the player's computing device. The player selected keno board spots are numbers selected by the player, which are a sub-set of the total set of available numbers. For example, the total set of available numbers may include eighty unique numbers (i.e., numbers from one to eighty) and the sub-set of numbers selected by the player may be six numbers. The set of available numbers may be shown on the keno board as numbered balls, numbered squares or any other visual representation. Once the player selects the sub-set of numbers, the keno game randomly selects a set of numbers from the available set of numbers. For example, twenty randomly selected numbers may be selected and displayed to the player. The randomly selected numbers may be shown to the player as “ball drops”. After each number in the set of numbers is randomly selected, it may be removed from the set of available numbers and may not be available to be selected again until another keno game. When more than one set of numbers is selected during a single keno game, each randomly selected number is removed from the set of available numbers and is available to be subsequently selected again when the next set of drawn numbers are selected during the same keno game or the next keno game.
According to various embodiments disclosed herein, at least two sets of balls are drawn during a keno game. Any number of drawn ball sets may be drawn (e.g., three, four, five, twenty, etc.). The number of drawn ball sets may vary from one keno game to another. Each set of drawn balls may include the same number of balls. For example, four ball sets are drawn with twenty balls in each set. Each of the drawn ball sets may be drawn from a separate set of, e.g., eighty balls. Furthermore, each set of drawn balls may include uniquely numbered balls (e.g., numbered from one to eighty, with no duplicates within a single drawn ball set). However, duplicate drawn balls may appear across different drawn ball sets. For example, a ball numbered “5” can appear in two drawn ball sets.
Each set of drawn balls may be separately evaluated by comparing the balls in each drawn ball set to the balls selected by the player. Accordingly, the player may have more matches due to a higher number of drawn balls being evaluated. Alternatively, the evaluation criteria may span multiple sets of drawn balls. The sets of drawn balls may be displayed to the player in a grid pattern. For example, the grid pattern may be twenty balls wide and the number of drawn table sets tall (e.g., 3 balls tall). In this example, the drawn balls sets are displayed as three horizontal groups of drawn balls, with each horizontal group containing twenty drawn balls from one of the drawn ball sets. As another example, instead of three 1×20 grids stacked vertically, other grid patterns may be used. For example, for three sets of drawn balls, three 4×5 grids placed side-by-side next to each other may be displayed.
One or more paylines may be overlayed on top of at least some of the shown drawn balls. The total number of balls that each payline touches may be equal to the number of balls in a drawn ball set (e.g., twenty). The shapes of the paylines may vary (e.g., horizontal, vertical, angled, or any combination thereof). As a result, a high number of possible paylines may be used for determining payout to the player. In some embodiments, the number of lines may be limited to a predetermined number (e.g., 5, 10, 15). Additionally, the use of angled paylines, for example, may cause the award evaluation criteria to span more than one of the drawn ball sets. That is, balls from more than one of the drawn ball sets may be considered in determining the payout to the player.
Each payline may be evaluated individually to determine the player payout. In some embodiments, the balls that a payline hits may be evaluated against the player marked balls. When a payline includes duplicate balls, the duplicate balls may be used as a further pay category with a duplicate paytable or another source dictating payout to the player for the detected number of duplicates on a payline. As another example, the existence of player marked balls appearing adjacent to each other on a payline may be used as a further pay category. In some embodiments, when predetermined balls are detected on a payline, the player may be paid a payout or given another type of award. Accordingly, in addition to evaluation of each drawn ball set against the player selected keno board spots, each payline may be evaluated.
In some embodiments, the illustrated drawn balls sets may be divided into boxes or into any other type of areas. For example, if four sets of twenty balls are drawn and displayed as four rows of twenty balls, then the eighty drawn balls may be divided into five boxes each of which contains sixteen balls. The payout to the player may include evaluation of drawn balls within each box. In particular, each box may be evaluation separately, and balls from more than one of the drawn ball sets may be considered in determining the payout to the player. Hence, the evaluation criteria may span more than one of the drawn ball sets. For example, duplicates detected within a box may trigger a bonus or payout to the player. Paylines may be drawn that pass through each box. A payline drawn within a box may be a horizontal line, a vertical line, and/or a combination of angled line segments and/or straight line segments, or any combination thereof. Each payline within a box may be evaluation individually. For example, the player may rewarded when drawn balls that are “hits” touch the payline. In some embodiments, when more than a threshold number of hits are detected on paylines within a box, an additional payout to the player may be provided. In some embodiments, when more than a predetermined number of drawn balls (e.g., two or more drawn balls) are “hits” on the payline and are located within a box and/or next to one another, the player may be rewarded.
In some embodiments, drawn balls that are not “hits” for the player's marked spots may be evaluated based on their relative position to each other. For example, when particular drawn balls appear on a payline, the player may be awarded a payout. In another example, when two or more drawn balls that are “hits” appear next to each other on a payline and/or within a single box, the player may be awarded.
As shown, each set of drawn balls 104, 106, and 108 includes balls uniquely numbered between one and eighty. In some embodiments, there may be a predetermined maximum number of allowed duplicate balls between the drawn sets. In other embodiments, duplicate balls may not be allowed across the multiple drawn ball sets or the duplicate balls may be allowed in a predetermined maximum number of draw ball sets.
As shown, the draw ball set 104 includes balls numbered “21”, “45”, “66”, “3”, “5”, “74”, “11”, “9”, “54”, “32”, “76”, “44”, “73”, “69”, “41”, “77”, “18”, “31”, “39”, and “61”. The draw ball set 106 includes balls numbered “66”, “21”, “74”, “42”, “77”, “3”, “6”, “56”, “14”, “44”, “18”, “31”, “37”, “2”, “29”, “64”, “38”, “39”, “72”, and “80”, while the draw ball set 108 includes balls numbered “11”, “2”, “21”, “66”, “8”, “77”, “30”, “10”, “48”, “74”, “31”, “54”, “69”, “73”, “44”, “16”, “28”, “7”, “6”, and “54”. Although three sets of drawn balls are illustrated, there may be any number of drawn sets (e.g., 5, 10, 15, etc.).
The drawn ball sets 104, 106, 108 may be displayed to the player of a keno game on an electronic display of a gaming machine or a user computing device. For example, after the player marks balls on the keno board, the sets of drawn balls may be selected and displayed to the player. The duplicate balls across the multiple draw ball sets may be visually highlighted in order to draw the player's attention to the duplicate balls. For example, colors, patterns or other visual indicator can be used to emphasize the duplicate balls across the multiple drawn ball sets.
A keno board 110 is shown with eighty spots numbered one through eighty. The keno board 110 shows the player marked balls (e.g., spot 112) including balls numbered “5”, “21”, “43”, “45”, “47”, “72”. The six player marked balls are shown on the keno board 110 by drawing a ball around the corresponding number on the keno board. In some embodiments, the player may be allowed to select any other number of keno board balls (e.g., 8 balls).
Now referring to
The drawn balls touching the paylines may be utilized for calculating payout to the player. Each payline may be evaluated separately to determine payout to the player. An evaluation of a payline may involve detecting matches between the player's marked balls and the balls that are touched by the payline. “Hits” that are next to each other on the same payline may score additional points. In some embodiments, when predetermined drawn balls show up on the same payline, the player may be awarded a payout.
The payline paytable 128 may include other numbers of hits and win values other than shown in
A keno paytable 126 awards the player for matches between player marked spots and the drawn balls. In some embodiments, all the draw ball sets are evaluated to determine the win for the player. As shown, the player marked six keno board spots numbered “5”, “21”, “43”, “45”, “47”, and “72”. Of these six player selected keno board spots, the spots numbered “5” and “21” appear in the draw ball sets 104, 106, and 108. In particular, the ball numbered “5” appears once in the draw ball set 104, while the ball numbered “21” appears in the draw ball sets 104, 106, and 108. In some embodiments, each drawn ball set may be evaluated individually, and the score for each drawn ball set may be added. In other embodiments, the player may be awarded based on the total number of hits across all of the drawn ball sets.
Referring now to
The illustration 200A shows a grid 202 and the keno board 110. The grid includes four draw ball sets 204, 206, 208, and 210, each drawn as a horizontal group of drawn balls. As shown, each drawn ball set contains twenty drawn balls and does not include any duplicates. However, there may be duplicate balls across the multiple drawn ball sets 204, 206, 208, and 210.
The illustration 200A of the keno game includes the keno board 110, which displays eighty spots with each spot numbered one to eighty, as well as the player marked six spots (e.g., spot 112) numbered “5”, “21”, “43”, “45”, “47”, and “72”. Once the player marks the six spots, twenty balls (or any number of balls) are drawn four times resulting in four draw ball sets 204, 206, 208, and 210 as illustrated in the grid 202. Each set of drawn balls may be drawn from a separate set of balls numbered one through eighty or from a single set of eighty balls with all the balls being available for drawing for each set.
The illustration 200A further displays paylines 212, 214, and 216 drawn across one or more draw ball sets within the grid 202. For example, the payline 214 is a horizontal line that touches all the balls in the draw ball set 204. The payline 216 is also shown as a horizontal line that is drawn across the draw ball set 210, touching all the balls in the draw ball set 210. Finally, the payline 212 is composed of angled line segments, and it is drawn across three draw ball sets 204, 206, 208, and 210 touching some of the balls in these draw ball sets. The drawn balls that are “hits” are emphasized in
The grid 202 is divided into four boxes labeled as Box 1, Box 2, Box 3, and Box 4. As shown, each box is five drawn balls wide by four drawn balls tall. For example, Box 1 includes the first five balls of each draw ball set 204, 206, 208, and 210. Other box sizes may be utilized (e.g., two by ten, 10 by two, four by five, etc.), and the grid of draw ball sets may be divided into any number of boxes or other shapes (e.g., tetris type shapes). The Boxes 1, 2, 3, and 4 may be evaluated to determine whether any duplicates occur within each box area. The player may be paid a payout amount when duplicates are detected in the Boxes 1, 2, 3, and/or 4.
In some embodiments, the drawn ball sets 204, 206, 208, and 210 may be evaluated based on their relative positions to each other. Accordingly, this method of evaluation is not tied to the player's marked spots. For example, position of the drawn balls in relation to each other on a payline or within the same “box” or “area” (e.g., boxes shown in
Now referring to
The payline paytable 224 awards the player when the balls in the drawn ball sets 204, 206, 208, and 210 that match the balls selected by the player touch the paylines. For example, as shown, the player selected a ball numbered “5” on the keno board 110. The ball “5” appears in the drawn ball set 204, and is touched by the paylines 212 and 214. The player also selected the ball numbered “21” labeled as 212 on the keno board 110, and it appears in the drawn ball sets 204, 206, and 208. The payline 212 touches a ball numbered “21” three times and the payline 214 touches the ball numbered “21” in the draw ball set 204. Drawn balls “45” and “72” in the draw ball set 204 touch the paylines 212 and 214. The rest of the balls selected by the player (i.e., balls numbered “43”, and “47”) do not appear in the draw ball sets 204, 206, 208, and 210. As a result, the drawn balls that are also selected by the player are “hit” by the paylines 212 and 214 a total of nine times. In accordance with the payline paytable 224, the player is entitled to one hundred credits for the nine payline hits.
The paytable 230 rewards the player for detected duplicate balls among the drawn ball sets 204, 206, 208, 210. As illustrated in
As discussed with respect to
The scatter box paytable 236 rewards the player for duplicates detected within each box area. The paytable 236 includes a column 234 that provides ranges of a total number of duplicate balls, and a column 238 that provides the payout for each range of duplicate balls. For example, when one to five duplicates balls are detected in the Box areas 1, 2, 3, and 4, the player is entitled to five credits. Box 1 area is shown to include three balls numbered “21”, two balls numbered “3”, and two balls numbered “66”. Box 2 area includes three balls numbered “74”, two balls numbered “48”, two balls numbered “44”, and two balls numbered “14”. Box 3 area includes two balls numbered “44”, two balls numbered “69”, three balls numbered “31”. Box 4 area includes two balls numbered “39”. The total number of duplicate balls is twenty five. The paytable 236 dictates that for more than twenty one duplicates balls, the player is entitled to a bonus of thirty credits.
In other embodiments, points may be awarded based on an evaluation of the number of duplicates in each box individually rather than the total number of duplicates all boxes. In other embodiments, the duplicates column can include values for “of a kind” balls. For example, if two balls numbered “3” and four balls numbered “58” are detected by analyzing balls in each box, then the total number “of a kind” balls is one four-of-a-kind and one two-of-a-kind.
Although
The process 300 includes displaying (block 302) a keno board having a first predetermined number of keno board spots. In some embodiments, the first predetermined number of keno board spots may be equal to eighty spots. In these embodiments, the displayed keno board may be a ten by eight board, with each spot labeled with a number between one and eighty. In some embodiments, any other number of keno board spots may be displayed (e.g., fifty spots, one hundred spots, etc.).
The process 300 further includes receiving (block 304) a player selection of a second predetermined number of keno board spots. The second predetermined number of keno spots maybe six or any other number. When using a touch screen device, the user may mark the keno spots by touching the touch screen. In another example, the user may mark the keno board spots by selecting the keno spots using a mouse indicator or buttons.
The process 300 further includes determining (block 306) drawn balls for a plurality of drawn ball sets. Each ball set may be include a predetermined number of balls (e.g., twenty). In some embodiments, each drawn ball set may not include any duplicate balls, while the duplicate balls may be allowed between the multiple drawn ball sets. The number of drawn ball sets may be any number (e.g., four, ten, one-hundred, etc). As shown, in
At block 308, the determined drawn balls in the plurality of ball sets along with one or more paylines overlaying at least some of the drawn balls in the plurality of ball sets are displayed. In some embodiments, each drawn ball set has the same number of drawn balls and the total number of balls that each payline hits may equal the number of ball in each drawn ball set. For example, if each of the drawn ball sets includes twenty balls, then each payline hits twenty balls in one or more drawn ball sets. A payline may be a horizontal line, a vertical line, or a line made up of angled and/or straight line segments.
The process 300 further includes calculating (block 310) a player award for the player. The payout award may be based at least in part on evaluation of each payline. For example, matches between player selected keno board spots and the payline hits of the drawn balls may be determined. A paytable (e.g., the paytable 128) may be displayed to the player including information between various numbers of matches and payout amounts. In some embodiments, the total number of matches is used to calculate the player award. In other embodiments, the number “of a kind” balls that have matches between the payline hits and the player selections may be used to calculate the payout amount.
The player award may be based on any combination of: evaluation of traditional keno marks and hits (i.e., the number of matches detected between player marked spots and drawn balls), evaluation of “payline” marks and hits (i.e., matches between the balls that the paylines hit and the player marked spots), evaluation of duplicates (e.g., duplicates across the drawn balls, duplicates on paylines, duplicates detected within Box areas used to divide up the drawn balls, etc.), evaluation of drawn balls based on the relative position of the balls to each other (e.g., within the same box, next to each other on a payline, more for duplicates and other “of a kind” hits), and so on. The total player award due to the player may include points calculated using any combination of these methodologies.
Referring to
The gaming machine 400 may include any number of user interface devices that convey sensory information to a user and/or receive input from the user. For example, the gaming machine 400 may include electronic displays 440 and/or 422, speakers 426, and/or a candle device 412 to convey information to the user of the gaming machine 400. The gaming machine 400 may also include a console 424 having one or more inputs (e.g., buttons, track pads, etc.) configured to receive input from a user. In one embodiment, the display 410 and/or the display 422 may be a touch screen display configured to receive input from a user. A controller (not shown) within the gaming machine 400 may run a game, such as a wager-based game (e.g., a keno game), in response to receiving input from a user via inputs located in the console 424, display 422, or display 410. For example, inputs located in the console 424 may be operated to place a wager in the game and to run the game. In response, the controller may cause the display 422 to show a wager-based game such as a keno game.
The gaming machine 400 may also include devices for conducting a wager-based game. For example, the gaming machine 400 may include a ticket acceptor 416 and a printer 420. In various embodiments, the gaming machine 400 may be configured to run on credits that may be redeemed for money and/or other forms of prizes. The ticket acceptor 416 may read an inserted ticket having one or more credits usable to play a game on the gaming machine 400. For example, a player of the gaming machine 400 may wager one or more credits within a video keno game. If the player loses, the wagered amount may be deducted from the player's remaining balance on the gaming machine 400. However, if the player wins and is awarded an award, the player's balance may be increased by the amount won and/or awarded. Any remaining credit balance on the gaming machine 400 may be converted into a ticket via the printer 420. For example, a player of the gaming machine 400 may cash out of the machine by selecting to print a ticket via the printer 420. The ticket may then be used to play other gaming machines or redeemed for cash and/or prizes. According to various embodiments, the gaming machine 400 may record data regarding its receipt and/or disbursement of credits.
In one embodiment, the gaming machine 400 may include a loyalty card acceptor 430. In general, a loyalty card may be tied to a user's loyalty account. A loyalty account may store various information about the user, such as the user's identity, the user's gaming preferences, the user's gaming habits (e.g., which games the user plays, how long the user plays, etc.), or similar information about the user. A loyalty account may also be used to reward a user for playing the gaming machine 400. For example, a user having a loyalty account may be given an award turn on the gaming machine 400 or credited loyalty points for playing the gaming machine 400. Such loyalty points may be exchanged for loyalty rewards (e.g., a free meal, a free hotel stay, free room upgrade, discounts, etc.).
Implementations of the subject matter and the operations described in this specification can be implemented in digital electronic circuitry, computer software, firmware or hardware, including the structures disclosed in this specification and their structural equivalents or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer programs, i.e., one or more modules of computer program instructions, encoded on one or more computer storage medium for execution by, or to control the operation of data processing apparatus. Alternatively or in addition, the program instructions can be encoded on an artificially-generated propagated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus for execution by a data processing apparatus. A computer storage medium can be, or be included in, a computer-readable storage device, a computer-readable storage substrate, a random or serial access memory array or device, or a combination of one or more of them. Moreover, while a computer storage medium is not a propagated signal, a computer storage medium can be a source or destination of computer program instructions encoded in an artificially-generated propagated signal. The computer storage medium can also be, or be included in, one or more separate components or media (e.g., multiple CDs, disks, or other storage devices). Accordingly, the computer storage medium may be tangible and non-transitory.
The operations described in this specification can be implemented as operations performed by a data processing apparatus on data stored on one or more computer-readable storage devices or received from other sources.
The term “client or “server” includes a variety of apparatuses, devices, and machines for processing data, including by way of example a programmable processor, a computer, a system on a chip, or multiple ones, or combinations, of the foregoing. The apparatus can include special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). The apparatus can also include, in addition to hardware, a code that creates an execution environment for the computer program in question, e.g., a code that constitutes processor firmware, a protocol stack, a database management system, an operating system, a cross-platform runtime environment, a virtual machine, or a combination of one or more of them. The apparatus and execution environment can realize various different computing model infrastructures, such as web services, distributed computing and grid computing infrastructures.
A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, declarative or procedural languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, object, or other unit suitable for use in a computing environment. A computer program may, but need not, correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform actions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for performing actions in accordance with instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. However, a computer need not have such devices. Moreover, a computer can be embedded in another device, e.g., a mobile telephone, a personal digital assistant (PDA), a mobile audio or video player, a game console, or a portable storage device (e.g., a universal serial bus (USB) flash drive). Devices suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, implementations of the subject matter described in this specification can be implemented on a computer having a display device, e.g., a CRT (cathode ray tube), LCD (liquid crystal display), OLED (organic light emitting diode), TFT (thin-film transistor), plasma, other flexible configuration, or any other monitor for displaying information to the user and a keyboard, a pointing device, e.g., a mouse, trackball, etc., or a touch screen, touch pad, etc., by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well. For example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback and input from the user can be received in any form, including acoustic, speech, or tactile input. In addition, a computer can interact with a user by sending documents to and receiving documents from a device that is used by the user. For example, by sending webpages to a web browser on a user's client device in response to requests received from the web browser.
Implementations of the subject matter described in this specification can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with an implementation of the subject matter described in this specification, or any combination of one or more such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (“WAN”), an inter-network (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks).
While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular implementations of particular inventions. Certain features that are described in this specification in the context of separate implementations can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown, in sequential order or that all illustrated operations be performed to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
Thus, particular implementations of the subject matter have been described. Other implementations are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking or parallel processing may be utilized.
Number | Name | Date | Kind |
---|---|---|---|
4033588 | Watts | Jul 1977 | A |
4611811 | Haase | Sep 1986 | A |
4661906 | DiFrancesco et al. | Apr 1987 | A |
4711454 | Small | Dec 1987 | A |
4747600 | Richardson | May 1988 | A |
4775155 | Lees | Oct 1988 | A |
4798387 | Richardson | Jan 1989 | A |
4875686 | Timms | Oct 1989 | A |
5005840 | Schwartz | Apr 1991 | A |
5043887 | Richardson | Aug 1991 | A |
5046737 | Fienberg | Sep 1991 | A |
5072381 | Richardson et al. | Dec 1991 | A |
5100139 | Di Bella | Mar 1992 | A |
5116049 | Sludikoff et al. | May 1992 | A |
5158293 | Mullins | Oct 1992 | A |
5242163 | Fulton et al. | Sep 1993 | A |
5351970 | Fioretti | Oct 1994 | A |
5401024 | Simunek | Mar 1995 | A |
5419592 | Stuart | May 1995 | A |
5482289 | Weingardt | Jan 1996 | A |
5569083 | Fioretti | Oct 1996 | A |
5586937 | Menashe | Dec 1996 | A |
5628684 | Boudec et al. | May 1997 | A |
5639089 | Matsumoto et al. | Jun 1997 | A |
5647798 | Falciglia | Jul 1997 | A |
5651735 | Baba | Jul 1997 | A |
5679077 | Pocock et al. | Oct 1997 | A |
5687971 | Khaladkar | Nov 1997 | A |
5718631 | Invencion | Feb 1998 | A |
5727786 | Weingardt | Mar 1998 | A |
5743526 | Inoue | Apr 1998 | A |
5755619 | Matsumoto et al. | May 1998 | A |
5779545 | Berg et al. | Jul 1998 | A |
5800269 | Holch et al. | Sep 1998 | A |
5813911 | Margolin | Sep 1998 | A |
5823534 | Banyai | Oct 1998 | A |
5848932 | Adams | Dec 1998 | A |
5857911 | Fioretti | Jan 1999 | A |
5871398 | Schneier et al. | Feb 1999 | A |
5909875 | Weingardt | Jun 1999 | A |
5935001 | Baba | Aug 1999 | A |
5935002 | Falciglia | Aug 1999 | A |
5945655 | Gilgeous et al. | Aug 1999 | A |
6015346 | Bennett | Jan 2000 | A |
6017032 | Grippo et al. | Jan 2000 | A |
6024640 | Walker et al. | Feb 2000 | A |
6033306 | De Souza et al. | Mar 2000 | A |
6079711 | Wei et al. | Jun 2000 | A |
6089976 | Schneider et al. | Jul 2000 | A |
6089978 | Adams | Jul 2000 | A |
6099407 | Parker et al. | Aug 2000 | A |
6102400 | Scott et al. | Aug 2000 | A |
6146272 | Walker et al. | Nov 2000 | A |
6168521 | Luciano et al. | Jan 2001 | B1 |
6174235 | Walker et al. | Jan 2001 | B1 |
6183361 | Cummings et al. | Feb 2001 | B1 |
6186892 | Frank | Feb 2001 | B1 |
6210276 | Mullins | Apr 2001 | B1 |
6210279 | Dickinson | Apr 2001 | B1 |
6220961 | Keane et al. | Apr 2001 | B1 |
6241606 | Riendeau et al. | Jun 2001 | B1 |
6250685 | Walker et al. | Jun 2001 | B1 |
6257980 | Santini, Jr. | Jul 2001 | B1 |
6280325 | Fisk | Aug 2001 | B1 |
6283855 | Bingham | Sep 2001 | B1 |
6309298 | Gerow | Oct 2001 | B1 |
6309300 | Glavich | Oct 2001 | B1 |
6315290 | Roethel et al. | Nov 2001 | B1 |
6315291 | Moody | Nov 2001 | B1 |
6325716 | Walker et al. | Dec 2001 | B1 |
6336862 | Byrne | Jan 2002 | B1 |
6346043 | Colin et al. | Feb 2002 | B1 |
6358151 | Enzminger et al. | Mar 2002 | B1 |
6364313 | Moody | Apr 2002 | B1 |
6364767 | Brossard et al. | Apr 2002 | B1 |
6368213 | McNabola | Apr 2002 | B1 |
6368214 | Luciano | Apr 2002 | B1 |
6368218 | Angell, Jr. | Apr 2002 | B2 |
6398644 | Perrie et al. | Jun 2002 | B1 |
6398645 | Yoseloff | Jun 2002 | B1 |
6398646 | Wei et al. | Jun 2002 | B1 |
6402614 | Schneier et al. | Jun 2002 | B1 |
6419583 | Crumby et al. | Jul 2002 | B1 |
6425823 | Byrne | Jul 2002 | B1 |
6454648 | Kelly et al. | Sep 2002 | B1 |
6478677 | Moody | Nov 2002 | B1 |
6482088 | Santini, Jr. | Nov 2002 | B2 |
6514144 | Riendeau et al. | Feb 2003 | B2 |
6524184 | Lind et al. | Feb 2003 | B1 |
6524185 | Lind | Feb 2003 | B2 |
6533660 | Seelig et al. | Mar 2003 | B2 |
6533664 | Crumby | Mar 2003 | B1 |
6537150 | Luciano et al. | Mar 2003 | B1 |
6565091 | Weingardt | May 2003 | B2 |
6569017 | Enzminger et al. | May 2003 | B2 |
6581935 | Odom | Jun 2003 | B1 |
6585590 | Malone | Jul 2003 | B2 |
6599188 | Hirsch et al. | Jul 2003 | B2 |
6605001 | Tarantino | Aug 2003 | B1 |
6607440 | Santini, Jr. | Aug 2003 | B2 |
6609973 | Weiss | Aug 2003 | B1 |
6645071 | Perrie et al. | Nov 2003 | B2 |
6645072 | Kellen | Nov 2003 | B1 |
6656044 | Lewis | Dec 2003 | B1 |
6656045 | Wei et al. | Dec 2003 | B2 |
6672960 | B-Jensen | Jan 2004 | B1 |
6676516 | Baerlocher et al. | Jan 2004 | B2 |
6722655 | Camero | Apr 2004 | B1 |
6722981 | Kaminkow et al. | Apr 2004 | B2 |
6722982 | Kaminkow et al. | Apr 2004 | B2 |
6755738 | Glasson et al. | Jun 2004 | B2 |
6755739 | Santini, Jr. | Jun 2004 | B2 |
6761632 | Bansemer et al. | Jul 2004 | B2 |
6764397 | Robb | Jul 2004 | B1 |
6780108 | Luciano et al. | Aug 2004 | B1 |
6783457 | Hughs-Baird et al. | Aug 2004 | B2 |
6802776 | Lind et al. | Oct 2004 | B2 |
6824465 | Luciano, Jr. | Nov 2004 | B2 |
6832956 | Boyd et al. | Dec 2004 | B1 |
6835138 | Baeg | Dec 2004 | B2 |
6840858 | Adams | Jan 2005 | B2 |
6910962 | Marks et al. | Jun 2005 | B2 |
6981635 | Hughs-Baird et al. | Jan 2006 | B1 |
7040984 | Mead | May 2006 | B2 |
7160186 | Cuddy et al. | Jan 2007 | B2 |
7160188 | Kaminkow et al. | Jan 2007 | B2 |
7182689 | Hughs-Baird et al. | Feb 2007 | B2 |
7235011 | Randall et al. | Jun 2007 | B2 |
7258608 | Khal | Aug 2007 | B2 |
7273415 | Cregan et al. | Sep 2007 | B2 |
7303469 | Kaminkow | Dec 2007 | B2 |
7306519 | Baerlocher | Dec 2007 | B2 |
7314409 | Maya et al. | Jan 2008 | B2 |
7399227 | Michaelson et al. | Jul 2008 | B2 |
7544129 | Baerlocher | Jun 2009 | B2 |
7682241 | Baerlocher | Mar 2010 | B2 |
7824257 | Jubinville et al. | Nov 2010 | B2 |
7901282 | Cannon | Mar 2011 | B2 |
8025561 | Reddicks et al. | Sep 2011 | B2 |
8814651 | Humphrey et al. | Aug 2014 | B1 |
20020045472 | Adams | Apr 2002 | A1 |
20020052231 | Fioretti | May 2002 | A1 |
20020094859 | Hirsch et al. | Jul 2002 | A1 |
20020098882 | Lind et al. | Jul 2002 | A1 |
20020098883 | Packes et al. | Jul 2002 | A1 |
20020111207 | Lind et al. | Aug 2002 | A1 |
20020111214 | Lind et al. | Aug 2002 | A1 |
20020113369 | Weingardt | Aug 2002 | A1 |
20020117803 | Weingardt | Aug 2002 | A1 |
20020137562 | Malone | Sep 2002 | A1 |
20020155877 | Enzminger et al. | Oct 2002 | A1 |
20020160827 | Slomiany et al. | Oct 2002 | A1 |
20020169018 | Schneier et al. | Nov 2002 | A1 |
20020177478 | Glasson et al. | Nov 2002 | A1 |
20030017867 | DeKeller | Jan 2003 | A1 |
20030073480 | Thomas et al. | Apr 2003 | A1 |
20030127793 | Adams | Jul 2003 | A1 |
20030144050 | Keaton et al. | Jul 2003 | A1 |
20030171986 | Itkis et al. | Sep 2003 | A1 |
20030178771 | Banyai | Sep 2003 | A1 |
20030181234 | Falciglia, Sr. | Sep 2003 | A1 |
20030193136 | Walker et al. | Oct 2003 | A1 |
20030195032 | Enzminger et al. | Oct 2003 | A1 |
20040009806 | Odom | Jan 2004 | A1 |
20040048647 | Lind et al. | Mar 2004 | A1 |
20040053669 | Gerrard et al. | Mar 2004 | A1 |
20040106445 | Perrie et al. | Jun 2004 | A1 |
20040121834 | Libby et al. | Jun 2004 | A1 |
20040130096 | Duhamel | Jul 2004 | A1 |
20040152499 | Lind et al. | Aug 2004 | A1 |
20040166920 | Boyd et al. | Aug 2004 | A1 |
20040176169 | Lind et al. | Sep 2004 | A1 |
20040178579 | Lowell et al. | Sep 2004 | A1 |
20040204225 | Campo et al. | Oct 2004 | A1 |
20040214626 | Lind et al. | Oct 2004 | A1 |
20040235555 | Yarbrough et al. | Nov 2004 | A1 |
20040242310 | Perkins | Dec 2004 | A1 |
20040251628 | Kilby | Dec 2004 | A1 |
20040266509 | Bennett et al. | Dec 2004 | A1 |
20050054404 | Baerlocher | Mar 2005 | A1 |
20050054415 | Kaminkow et al. | Mar 2005 | A1 |
20050059449 | Yarbrough | Mar 2005 | A1 |
20050059461 | Ching et al. | Mar 2005 | A1 |
20050059467 | Saffari et al. | Mar 2005 | A1 |
20050059468 | Cannon | Mar 2005 | A1 |
20050059469 | Gail et al. | Mar 2005 | A1 |
20050059470 | Cannon | Mar 2005 | A1 |
20050059471 | Cannon | Mar 2005 | A1 |
20050064932 | Cannon | Mar 2005 | A1 |
20050075161 | McGlone et al. | Apr 2005 | A1 |
20050096119 | Lind et al. | May 2005 | A1 |
20050096123 | Cregan et al. | May 2005 | A1 |
20050101370 | Lind et al. | May 2005 | A1 |
20050101387 | Wolf | May 2005 | A1 |
20050119042 | Chamberlain et al. | Jun 2005 | A1 |
20050130730 | Lind et al. | Jun 2005 | A1 |
20050148382 | Fox | Jul 2005 | A1 |
20050164771 | Lind et al. | Jul 2005 | A1 |
20050164772 | Lind et al. | Jul 2005 | A1 |
20050164773 | Lind et al. | Jul 2005 | A1 |
20050167916 | Banyai | Aug 2005 | A1 |
20050187014 | Saffari et al. | Aug 2005 | A1 |
20050192081 | Marks et al. | Sep 2005 | A1 |
20050227753 | Luciano, Jr. | Oct 2005 | A1 |
20050255906 | Lind et al. | Nov 2005 | A1 |
20060084490 | Khal | Apr 2006 | A1 |
20060178196 | Thomas | Aug 2006 | A1 |
20060189375 | Dodge | Aug 2006 | A1 |
20060246977 | Cannon | Nov 2006 | A1 |
20070010308 | Duhamel | Jan 2007 | A1 |
20070021185 | Walker et al. | Jan 2007 | A1 |
20070052172 | Dargue | Mar 2007 | A1 |
20070117611 | Dodge | May 2007 | A1 |
20070135204 | Nicely | Jun 2007 | A1 |
20070173313 | Bienvenue | Jul 2007 | A1 |
20080102952 | Walker et al. | May 2008 | A1 |
20080113742 | Amos et al. | May 2008 | A1 |
20080254894 | Michaelson et al. | Oct 2008 | A1 |
20090075714 | Meyer et al. | Mar 2009 | A1 |
20090075715 | Coleman et al. | Mar 2009 | A1 |
20090197664 | Schultz | Aug 2009 | A1 |
20100004046 | Brunelle | Jan 2010 | A1 |
20100120489 | Meyer | May 2010 | A1 |
20100285862 | Pau et al. | Nov 2010 | A1 |
20110028201 | Warner et al. | Feb 2011 | A1 |
20130178271 | Aponte et al. | Jul 2013 | A1 |
20140248935 | Williams et al. | Sep 2014 | A1 |
20140274275 | DeFrance et al. | Sep 2014 | A1 |
Number | Date | Country |
---|---|---|
1 513 116 | Mar 2005 | EP |
WO 2004014502 | Feb 2004 | WO |
WO 2004070551 | Aug 2004 | WO |
WO 2004105903 | Dec 2004 | WO |
WO 2005060567 | Jul 2005 | WO |
WO 2005072096 | Aug 2005 | WO |
WO 2005079142 | Sep 2005 | WO |
Number | Date | Country | |
---|---|---|---|
20150038210 A1 | Feb 2015 | US |