Patent Grant
9633182
The present invention relates, in general, to methods and apparatus for licensing and managing the usage of digital content.
Although computer programs, individually also referred to as computer software products, video games, music, etc., can be sold to an end user, a more frequent approach is to license the digital product or program to an end user, with the software vendor or owner retaining ownership of all of the rights to the product.
Each license is devised to control the usage of the product or software by stating the conditions under which the product may be used, such as the location of use, the number of times used, etc. Digital products are licensed in many ways. By one category, licenses can be divided into node-locked licenses or network licenses. By another category, licenses can be divided into product licenses or product suite licenses. In general most licenses could be described by a combination or a simple variation thereof of the above two categories; i.e. node-locked product licenses, node-locked product suite licenses, network product licenses, and network product suite licenses.
Node-locked licenses restrict the use of software and digital products to a given computer. The major limitation of this approach is that it requires customers to purchase software separately for each potential user. Since each user does not use each software on his machine all the time, software purchased via this approach would idle most of the time. This is a very inefficient use of customers' money.
Network licenses allow access to the software products on computer networks formed of a number of interconnected computers or nodes which may be linked to each other and/or a central host. This addresses the primary inefficiency of node-locked licenses. Since the customer must purchase licenses only to cover the anticipated number of peak simultaneous users of that software.
Product licensing restricts the use of the license to only the product for which it is valid. In other words, the license is not transferable to other products. The limitation of this approach is that a customer must purchase the peak licenses, either node-locked or network, for each product separately. Again, peak usage for different products do not occur at the same time. Hence, the customer ends up purchasing more software licenses than really required.
Product suite licenses allow access to several software products using common licenses. A suite would generally include several individual programs which may be run concurrently with each other or individually and may or may not be linked to other programs in the suite. Traditional licensing approaches for computer programs or suites typically involve one license for all of the programs in each entire suite such that a user on a node of a computer network is charged with one license use regardless of which program the user is running from a particular program suite. A major limitation of this approach is that it assumes that each product in the suite has an equal value. Also, product suites typically involve a small number of software products which complement each other, and the expansion of suite licensing to license a wide range of software products is commercially impractical.
A recent development in licensing has been the units based licensing of multiple products. In such a system, different products are assigned different values in terms of units. A customer would license a certain number of units to run any and all of these products. While on paper, this system appears to address limitations listed above, in reality it does not due to the manner in which it is implemented by several organizations. Under this setup, when a user runs multiple products, the user is charged multiple units, also called stacking of units. Since the customers have limited budgets for purchasing software products, this system (i) forces the users to terminate one product in order to run another, thus decreasing the user's efficiency, or (ii) forces the customer to purchase additional licenses with no additional value thus undermining the profitability of their organization. This system does not encourage users to try new products, even though they are accessible and available on their network.
Other types of licensing techniques, such as a leveling license approach, enable new digital content to be used without incurring many or any additional licensed units. Either license approach can work for companies having multiple users tied together in a company based computer network.
Home computer users typically download many different types of digital content, including computer software, digital music, video games, movies, etc. While some homes can have multiple computers and multiple simultaneous users interconnected by a home based computer network, the number of users is relatively small, being on the order of two or three network connected nodes in each network at lower use or license fees.
Further, home computer users typically download the different forms of digital content from many different sources. These multiple sources make license management inoperable. In addition, the relatively small, individual users who download digital content from multiple sources are unable to take advantage of group discounts, parental monitoring and block-out, etc.
To provide a wider range of available digital content, it would be desirable to provide a club or group based approach whereby any number of individuals, either at businesses, home, etc., can form a group and act in the same manner as a company by operating under a license approach for the most economical use of a wide range of digital content made available in a selectable digital product suite.
A method for token based club digital content licensing is disclosed.
In an embodiment, token based club digital content licensing may include weighted leveling license unit based digital content access control, which may include receiving, from a first user device, at a server, a first request for access to a first digital content object, wherein the first request indicates a first unique user identifier associated with a plurality of available license units, identifying a first assigned unit count for the first digital content object, and on a condition that the first assigned unit count is within a cardinality of the plurality of available license units, enabling access to the first digital content object by the first user device. Weighted leveling license unit based digital content access control may include receiving, from the first user device, at the server, a second request for access to a second digital content object, wherein the second request indicates the first unique user identifier, identifying a second assigned unit count for the second digital content object, identifying a weighted leveling licensing weight, on a condition that a product of the weighted leveling licensing weight and a sum of the first assigned unit count and the second assigned unit count is within the cardinality of the plurality of available license units, enabling access to the second digital content object by the first user device, and on a condition that the product of the weighted leveling licensing weight and the sum of the first assigned unit count and the second assigned unit count exceeds the cardinality of the plurality of available license units, preventing access to the second digital content object by the first user device.
In another embodiment, token based club digital content licensing may include weighted leveling license unit based digital content access control, which may include receiving a first request for access to a first content object, wherein the first request indicates a plurality of licensed units, identifying a first assigned unit count for the first content object, on a condition that a cardinality of a plurality of available licensed units from the plurality of licensed units is less than a cardinality of the plurality of licensed units, identifying one or more currently accessed content objects associated with a plurality of unavailable licensed units from the plurality of licensed units, identifying a weighted leveling licensing weight, determining whether to enable access to the first content object based on the weighted leveling licensing weight, the first assigned unit count, and a respective assigned unit count for each currently accessed content object from the one or more currently accessed content objects, in response to a determination to enable access to the first content object, enabling access to the first digital content object, and in response to a determination to prevent access to the first content object, preventing access to the first digital content object.
In another embodiment, token based club digital content licensing may include weighted leveling license unit based digital content access control, which may include receiving, from a first user device, at a server, a first request for access to a first digital content object, wherein the first request indicates a first unique user identifier associated with a plurality of available license units, identifying a first assigned unit count for the first digital content object, and on a condition that the first assigned unit count is within a cardinality of the plurality of available license units, enabling access to the first digital content object by the first user device. Weighted leveling license unit based digital content access control may include receiving, from the first user device, at the server, a second request for access to a second digital content object, wherein the second request indicates the first unique user identifier, identifying a second assigned unit count for the second digital content object, identifying a weighted leveling licensing weight, on a condition that a sum of a product of the weighted leveling licensing weight and the first assigned unit count and a product of the weighted leveling licensing weight and the second assigned unit count is within the cardinality of the plurality of available license units, determining to enable access, and on a condition that the sum of the product of the weighted leveling licensing weight and the first assigned unit count and the product of the weighted leveling licensing weight and the second assigned unit count exceeds the cardinality of the plurality of licensed units, determining to prevent access.
The various features, advantages and other uses of the present invention will become more apparent by referring to the following detailed description and drawing in which:
Referring now to the drawings and to
By way of example only, the customer computer networks 10 and 12 each include at least one and, optionally a plurality of individual nodes, with three nodes 14, 16, and 18, being depicted by way of example only in networks 10 or 12. Each of the nodes 14, 16, and 18 is connected to a network server 20 and has its own network address so that any one of the nodes 14, 16 and 18 can communicate with the each other nodes 14, 16, and 18 within the network 10 or 12. The network server 20 is connected in data communication with a host CPU 22.
Although the individual nodes 14, 16, and 18 are depicted as being connected in a spoke configuration to the network server 20, it will be understood that this arrangement is by example only as the individual nodes 14, 16, and 18 may be connected in a ring configuration or any other configuration found in computer networks. Further, the network server 20 and the host CPU 22 may be combined into a single computer.
As will be clearly understood by those in the computer art, each of the nodes 14, 16, and 18, as well as the network server 20 and the host CPU 22, may be formed of a processing unit, hereafter CPU, such as a microprocessor, as well as input and output components coupled to the processing unit, including a memory, input components, such as a key inputs, mouse, etc., and output components, such as a screen display, printer, etc., not shown.
The processing unit and coupled I/O components may be implemented in any electronic device, such as a desktop or laptop computer, a handheld or portable computer-like device, MP3 and other electronic media players, cellular telephones, etc.
For explanatory purposes only, a node is defined as a unique combination of a user, or a CPU or host, or a display, or a user and a CPU, or a CPU and a display, or a user and a display, or a user, a CPU and a display.
A license manager 24 is embodied in a software program which may be resident or stored in the memory of the network server 20 or the host CPU 22 and/or capable of being stored in a storage media, such as a disk, CD-ROM, etc. The license manager 24 may also be resident or stored in the memory of a separate central processing unit or microprocessor which is coupled to the network server 20 or the host CPU 22.
The function of the license manager 24, as described in greater detail hereafter, is to control access to as well as monitor the execution or running of one or more pieces of individual digital content or media coupled together or sold as a suite or even sold or licensed individually. The suite is formed of a plurality of individual digital content which may be separately executable or executable in multiple numbers, and is resident in the memory and/or a hard drive connected to the host CPU 22. In this arrangement, the network server 20 merely distributes an authorized licensed program from the suite to the requesting node.
Before defining the details of an example of a licensing method which may be employed, definitions of key terms will first be presented.
Licensed Units: The total number of units licensed by a customer on a customer computer network.
Customer Computer Network (CCN) Assigned Units: The value in terms of units assigned to each discrete digital content in the product suite licensed by one customer for execution on the customer computer network.
Customer Computer Network (CCN) Node Running Total: The total number of units checked out by one node on the customer computer network at a given time. In a leveling licensing arrangement on the customer computer network, the CCN node running total is equal to the product or digital content having the highest CCN assigned units value of all of the products or digital content executed by the one CCN node at one given time. In a stacking licensing arrangement, the CCN node running total is equal to the total of the CCN assigned units of all of the products or digital content executed by the one CCN node on the customer computer network.
Customer Computer Network (CCN) Checked Out Units: The sum of node running totals of all nodes on the customer computer network.
Total Checked Out Units: The sum of the CCN checked out units.
Available Units: Licensed units minus total checked out units.
Customer Computer Network (CCN) Required Units: Number of units required to start a new product or digital content run by one node on one customer computer network. In a leveling licensing arrangement, if the CCN assigned units for the new product or digital content are greater than the CCN node running total, the CCN required units equals the CCN assigned units of the new product minus the CCN node running total. If the CCN assigned units for the new product or digital content are less than or equal to the CCN node running total, then the CCN required units equals zero. In a stacking licensing arrangement, the CCN required units equals the number of CCN assigned units for the new product or digital content.
Customer Computer Network (CCN) Returned Units: Number of units returned to the available units when a product or digital content is terminated by one node on the customer computer network. In a leveling licensing arrangement, if the CCN assigned units of the terminated product or digital content are less than the CCN node running total, then the CCN returned units equals zero. If the CCN assigned units for the terminated product are equal to the CCN node running total, then the CCN returned units equals the CCN assigned units for the terminated product minus the next highest CCN assigned units value of the remaining products or digital content running on the node. In a stacking licensing arrangement, the CCN returned units equals the CCN assigned units of the content terminated on the customer computer network.
Each piece of digital content in a program suite licensed to a particular customer computer network, such as customer computer networks 10 and 12, is provided with two separate assigned units, such as the CCN assigned units defined above. The actual number of assigned units assigned to each discrete digital content in the program suite can be arbitrarily chosen, and the number of assigned units for two or more pieces of digital content can be identical or different.
By way of example only, the number of assigned units assigned to each piece of digital content is selected as a function of one license price of each product or program divided by an arbitrary factor. By example only, the lease price of each discrete digital content or digital product is divided by $250 to yield the number of assigned units assigned to each piece of digital content. It will also be understood that the number of assigned units assigned to each digital content may also be based on the size of the individual products, the amount of time typically employed to run each digital content, or its inherent value to an end user in a particular application.
The above described assigning of units for each piece of digital content in the program suite can be further understood by referring to U.S. patent application Ser. No. 09/553,115 filed Apr. 13, 2000, and entitled PRODUCT SUITE LICENSING METHOD, the entire contents of which are incorporated herein by reference. This prior application describes a licensing method based on a unique leveling concept for controlling the licensing of products for digital content in a product suite in a single computer network.
Thus, the licensing method requires input from the license manager 24 of the customer computer network 10 to determine the customer computer network checked out units of digital content currently being executed by the customer on the customer computer network 10 for the customer computer network 10.
Each customer computer network 10 or 12 communicates with the data communication network 13 through an Internet service provider or ISP 30, 32, respectively. In addition, the data communication network or Internet 13 in the present invention communicates with one or more ASPs through Internet service providers 34, 36 and 38, respectively. Although a single ISP 34 may be employed for communicating with one or more customer computer networks 10 and 12, for further flexibility and to insure a faster response time and an execution or run of individual digital content on the application service provider for any of the customer computer networks 10 or 12, the plurality of ISPs 34, 36 and 38 are each connectable to memory storage media, such as one or more disks 42, 44 and 46. Each can access each of the disks, 42, 44 and 46 to obtain data or digital content stored on the disks 42, 44, and 46.
Initially, the customer computer network license manager 24 recognizes the total number of licensed units purchased or made available in the customer server 20. This total number of licensed units can be paid in any of a number of ways, each primarily based on a license term or period, such as one year, for example only. The license royalty or fee will be based on a certain price per license unit, such as $250 per license unit in the above example. However, the number of licensed units purchased by this license fee covers the complete license term, such as one year, for example, and acts as a cap limiting the number of individual programs or products, as described hereafter, which can be executed or run simultaneously on the customer computer network 10. To state this another way, the total checked out units at a given time cannot exceed the number of licensed units paid for by the licensee or entity controlling the network 10.
The licensed units which are purchased by a particular customer can come in a number of different forms. In one form, all of the licensed units are treated the same and useable both on the customer computer network 10 or 12.
A customer log file 60 is maintained by the license manager 24 for the customer computer network 10 and a customer log file 60′ by the license manager 25 for the customer computer network 12. The customer log file 60 or 60′ contains the total number of available units which can be used at the customer computer network 10 or 12 at any given time. The license manager 24 for the customer computer network 10 will update the customer log file 60 for each change of the available units on the customer computer network 10. As described hereafter, such a change in the available units on the customer computer network 10 results from the execution of additional products from the program suite or the termination of the execution of one of the products in the suite either on the customer computer network 10 or 12.
A customer may execute any of the digital content on its local customer computer network 10 or 12 based on the determination by the license manager 24 or 25, respectively, whether the number of available units is sufficient to execute the next requested digital content on the respective customer computer network 10 or 12.
However, if a sufficient number of units is available for executing the requested digital content, the license manager 24 sets a flag “units=available” in step 76 and then makes a determination in step 78 whether the user has asked to lock or not lock the units at this time. If the user has asked not to lock the units at this time, the flag remains set at “units=available”, and the status is logged in step 82 for further processing. However, if the user has asked to lock the units, the license manager in step 80 sets a flag “units=locked”, and the status is logged in step 82 for further processing and asks the license manager 24 to check out the units.
The license manager in step 84 communicates the unit status logged in step 82 at regular intervals, such as every 1 minute or 15 minutes, for example, or when the status is updated in steps 72, 76 or 80 and logged in step 82.
If the status is “units=locked”, the requested content will run as soon as a CPU becomes available on the ASP network. However, regardless if the status is “units=available” or “units=unavailable”, the status may change depending on the activities on the customer computer network 10, 12. Hence, in addition to logging the status on to step 82, steps 72 and 78 also loop the control back to step 74 so that step 70 will be re-evaluated and the units status may be changed from “available” to “unavailable” or vice versa depending upon the change in availability of units in step 76, or a change in CPU status from available to unavailable, or a second or later queued content may be executed instead of the first queued request.
As shown in
Thus, it can be seen that the number of available units in the customer log file 60 can be a dynamically changing number dependent upon execution of digital content on the customer computer network 10. The execution, locking or unlocking of units and the termination of execution of any piece of digital content on the customer computer network 10 causes the number of available units to increase or decrease accordingly.
If a CPU is available as determined in step 90, the license manager 50 makes a determination in step 94 if the units status is “locked”, “available” or “unavailable”. If the status is “unavailable”, step 96 is executed wherein the license manager 50 waits for the next unit status update in steps 82 and 84 from the customer computer network 10 or the license manager 50 regarding the status of CPUs.
The license manager 50 controls and monitors all jobs queued, whether due to unavailability of a CPU or due to the unavailability of units, as follows. As and when a CPU becomes available due to termination of a job in step 104, the license manager 50 would check the first job in the queue for its units status in step 94. If units are “available” or “locked”, that job will be executed as described earlier. If units were “unavailable”, the job will be returned back to the queue and marked as “returned”. The license manager will now check the next job in the queue for its units status. It will continue to check jobs in the queue until it finds a job with units status of “locked” or “available”, or there are no more jobs left to check in the queue. The license manager 50 may also be designed such that a “returned” job would retain its original position, or it is sent to the bottom of the queue, or it is demoted by a certain number of spots in the queue. Also, if a job is flagged “returned” a certain number of times, say 3 times for example, and is waiting in the queue for a certain number of hours, say 6 hours for example, the license manager may be designed to delete the job from the queue altogether.
Referring now to
However, in this arrangement, the single customer computer network 118 is formed of a number of individual CPUs 120, 122 and 124, for example only. Each CPU 120, 122 and 124 has its own individual license manager 126, 128 and 130, respectively. Each CPU 120, 122 and 124 also has access through the Internet 13 via individual Internet service providers or ISPs 121, 123 and 125, respectively.
The individual CPUs 120, 122 and 124 may constitute three different users not normally affiliated with a business customer computer network. These users act independently and may be in different physical locations without any direct connection between the CPUs 120, 122 and 124. The users of the CPUs 120, 122 and 124 will initially join together as a group forming the customer computer network 118 by purchasing a total number of licensed units as a group. The individual license managers 126, 128 and 130 have access to each other via the Internet 13 to maintain a total number of individual checked out units and available units for each CPU 120, 122 and 124.
The arrangement shown in
There is further disclosed a unique token based, club licensing method for digital content.
The term “digital content” will be understood to mean any and all forms of digital content, commonly known as computer software programs, video games, music, movies, videos, etc., which can be accessed, downloaded, input, or otherwise transferred to a computer or processor and run or executed.
Thus, “digital content” includes computer software in the form of application programs, operating systems, etc., as well as digital content for audio, video, audio/video executable files. Further, the term “digital content” as used with the present licensing method further includes digital data or digital files which can be processed by other application programs or require execution by other software and/or hardware, such as a music player, etc.
The present licensing method makes use of a customer group or club. “Club” will be understood to mean any group of one or more individuals which join together to act as a single entity. The club can be a family or groups of families, for example, as well as a classroom of students, a small business, or a group of people who have met through the Internet or elsewhere and desire to be associated and act as a group for accessing digital content.
The digital content which is accessible by each group can be made available in a number of different ways. As shown in
Alternately, an entity can accumulate a product or digital content suite of downloadable digital content, including some or all of computer software programs, movies, videos, video games, music, etc., and make them available as a source 210 to each group.
Either product or digital content suite approach requires the formation of a club 212 under club defined rules. Financial arrangements are made for billing the individual club members 214, 216, 218, 220, etc., based on any charge approach, including fees based on the amount of usage of the product suite, pro rata cost per club member 214, 216, etc.
Each club 212 will register with the product suite source, but the individual club members 214, 216, etc., do not have to be directly interconnected on the same network. Rather, each club member 214, 216, etc., may access the product suite source 210 independently of other club members. Each club member 214, etc., however, will be recognized by the product suit source 210 as belonging to a particular club 212 and the digital content pre-approved for selection by the particular club 212 will then be made available for selection by each club member 214, 216, etc.
The digital content or product suite license can be charged to the club members of each club 212 according to any licensing technique, including a stacked licensing technique wherein the number of assigned licensed units or tokens 220 are associated with each particular digital content, which can be set by the owner or originator of the digital content, are added, when the digital content is downloaded or executed by a club member, to the checked out tokens or units associated with other digital content which is being simultaneously run or executed by other of the club members 212. Each club 212 can have a maximum number of tokens 220 or total group licensed units made available to it based on the total license fees paid by each club 212. In this manner, when there are insufficient available license units or tokens 220 remaining for a club member 214, 216, etc., to access and download a particular piece of digital content, i.e., the number of available license units is less than the assigned license units for the digital content the user wishes to download that club member will not be able to access and execute the digital content until additional licensed units become available by the termination or return of an executed piece of digital content by another club member to the club product suite.
Each club member can also optionally be provided with private tokens which the club member purchases. Private tokens enable a particular club member to access digital content from the product suite on his own without regard to the available licensed units under the licensing technique employed by the club 212. If there are an insufficient number of private tokens remaining when private tokens have been employed for other currently executed or downloaded digital content, additional digital content cannot be downloaded until sufficient numbers of licensed private tokens have been returned to the product suite by the user.
The products and content that each club member 214, 216, etc., can access can be selected and preset by each club 212. For instance, parents may set up a club for their children and preselect software or other digital content that is appropriate for their children. The children are then free to make selections from within the pre-screened of digital content in the product suite. In general, a club 212 will be able to access all of the digital content in the product suite unless it places its own restrictions on its members.
The club approach enables individual club members to increase their buying power. For clubs having larger numbers of members, it is more unlikely that each club member will attempt to use club tokens 220 simultaneously. Thus, a club 212 formed of fifteen people may need to only buy enough tokens 220 for ten members to run products simultaneously.
A club 212 that frequently reaches its token limit can purchase more tokens 220. Club members thus enjoy the benefit of being able to access a large number of digital products for a single subscription fee. The digital products are maintained current by the digital content source or the product originator thereby making it unnecessary for club members to purchase a product or upgrade existing products which they have purchased.
Each club 212 can establish its own rules. The following example of the operation of a club will be understood to be by example only.
First, each club 212 picks a club name and a unique password. Each member of the club 212 then provides a login ID and personal password. A club president can be selected.
For convenience, several prepackaged club types can be made available. Choosing a club type sets up the initial operating rules and services that the club members receive. However, the preset rules and services can be customized Examples of prepackaged club types can include a general club 212 accessing any type of digital content, a family club, a classroom club, a gamers club, music and video club, etc.
An optional club page can be provided through the digital content source to provide a menu of digital content available to the club, a convenient location for advertising and club messages, etc.
The club 212 will also set rules for adding new members, such as by invitation only, open enrollment, etc. Club voting rights can also be established by majority vote, unanimous vote, dictatorship, etc.
Each club 212 will decide the monthly fees to be paid by the club 212 from a schedule of fees established by the digital content source. Each club 212 can vote on the addition or removal of club members 214, 216, etc., the types of digital content made available to club members, mergers with other clubs, etc.
With respect to financial arrangements, each club member's credit card is billed automatically on a monthly basis for each club member's pro rata share of the monthly fee paid by the club 212. Other fee arrangements based on usage are also possible. Each club member can quit at any time or merely go “inactive” by not paying dues. Perks and incentives may also be provided by each club on an individual club basis from the digital content source. For example, bonus token giveaways can be provided by each club or each digital content source to keep club members enrolled. Bonus tokens may be provided for clubs that reach certain member sizes. Bonus tokens can also be provided to club members based on token usage over time, usage through related services, such as telephone calls, airlines, shopping, etc.
The digital content source can also provide early beta software for club members and exclusive movie, game or video releases for club members.
As shown in
In some embodiments, a combination of leveling licensing and stacking licensing, such as weighted leveling licensing, may be used. For example, the CCN node running total may be identified using weighted leveling licensing. Weighted leveling licensing may include identifying a number, or cardinality, of assigned units for concurrently accessing content objects as a weighted average of the cardinality of assigned units for each of the concurrently accessed content object.
In some embodiments, a weight may be identified for weighted leveling licensing. For example, a first content object may have a cardinality of assigned units of five, a second concurrently accessed content object may have a cardinality of assigned units of ten, a weighted leveling licensing weight, such as eighty percent, may be identified, and the cardinality of assigned units may be identified based on the cardinality of assigned units for the first content object, the cardinality of assigned units for the second content object, and the weight, as 12 (0.8(5+10)=12).
In some embodiments, a weight may be identified for each concurrently accessed content object. For example, a first content object may have a cardinality of assigned units of five and a weight of eighty percent, a second concurrently accessed content object may have a cardinality of assigned units of ten and a weight of eighty percent, and the cardinality of assigned units may be identified as a sum of the weighted cardinality for the first content object and the weighted cardinality for the second content object, as 12 (0.8(5)+0.8(10)=12).
In summary, there has been disclosed a unique method for execution of digital content from a product suite containing licensed digital content, by preformed groups of users.
This Application is a continuation-in-part of U.S. patent application Ser. No. 14/531,443, filed Nov. 3, 2014, which is a continuation of U.S. patent application Ser. No. 12/753,228, filed Apr. 2, 2010, which claims the benefit of U.S. Provisional Patent Application No. 61/166,036 filed Apr. 2, 2009, and is in turn a continuation-in-part of U.S. patent application Ser. No. 11/061,166, filed Feb. 21, 2005, now U.S. Pat. No. 8,073,780, issued Dec. 6, 2011, which is in turn a continuation-in-part of U.S. patent application Ser. No. 09/855,317, filed May 15, 2001, now of U.S. Pat. No. 7,672,972, issued Mar. 2, 2010, all of which are incorporated herein by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4937863 | Robert et al. | Jun 1990 | A |
| 5204897 | Wyman | Apr 1993 | A |
| 5260999 | Wyman | Nov 1993 | A |
| 5390297 | Barber | Feb 1995 | A |
| 5438508 | Wyman | Aug 1995 | A |
| 5579222 | Bains et al. | Nov 1996 | A |
| 5606493 | Duscher et al. | Feb 1997 | A |
| 5634080 | Kikinis et al. | May 1997 | A |
| 5671412 | Christiano | Sep 1997 | A |
| 5742813 | Kavanagh et al. | Apr 1998 | A |
| 5745879 | Wyman | Apr 1998 | A |
| 5752041 | Fosdick | May 1998 | A |
| 5758069 | Olsen | May 1998 | A |
| 5758257 | Herz et al. | May 1998 | A |
| 5790664 | Coley | Aug 1998 | A |
| 5835910 | Kavanagh et al. | Nov 1998 | A |
| 5905860 | Olsen et al. | May 1999 | A |
| 5931901 | Wolfe et al. | Aug 1999 | A |
| 5966444 | Yuan et al. | Oct 1999 | A |
| 5973683 | Cragun et al. | Oct 1999 | A |
| 5990883 | Byrne et al. | Nov 1999 | A |
| 6009401 | Horstmann | Dec 1999 | A |
| 6020883 | Herz et al. | Feb 2000 | A |
| 6026387 | Kesel | Feb 2000 | A |
| 6029176 | Cannon | Feb 2000 | A |
| 6038591 | Wolfe et al. | Mar 2000 | A |
| 6049332 | Boetje et al. | Apr 2000 | A |
| 6049789 | Frison et al. | Apr 2000 | A |
| 6088722 | Herz et al. | Jul 2000 | A |
| 6101606 | Diersch | Aug 2000 | A |
| 6118492 | Milnes et al. | Sep 2000 | A |
| 6133909 | Schein et al. | Oct 2000 | A |
| 6141754 | Choy | Oct 2000 | A |
| 6160570 | Sitnik | Dec 2000 | A |
| 6161137 | Ogdon et al. | Dec 2000 | A |
| 6161142 | Wolfe et al. | Dec 2000 | A |
| 6169992 | Beall et al. | Jan 2001 | B1 |
| 6173269 | Solokl et al. | Jan 2001 | B1 |
| 6182050 | Ballard | Jan 2001 | B1 |
| 6198906 | Boetje et al. | Mar 2001 | B1 |
| 6219652 | Carter et al. | Apr 2001 | B1 |
| 6240415 | Blumberg | May 2001 | B1 |
| 6256664 | Donoho et al. | Jul 2001 | B1 |
| 6262721 | Tsukidate et al. | Jul 2001 | B1 |
| 6263362 | Donoho et al. | Jul 2001 | B1 |
| 6263501 | Schein et al. | Jul 2001 | B1 |
| 6275844 | Rail | Aug 2001 | B1 |
| 6286140 | Ivanyi | Sep 2001 | B1 |
| 6317881 | Shah-Nazaroff et al. | Nov 2001 | B1 |
| 6324519 | Eldering | Nov 2001 | B1 |
| 6411941 | Mullor et al. | Jun 2002 | B1 |
| 6473794 | Guheen et al. | Oct 2002 | B1 |
| 6502079 | Ball | Dec 2002 | B1 |
| 6502124 | Shimakawa et al. | Dec 2002 | B1 |
| 6519571 | Guheen et al. | Feb 2003 | B1 |
| 6536037 | Barrese et al. | Mar 2003 | B1 |
| 6574612 | Baratti | Jun 2003 | B1 |
| 6591244 | Jim et al. | Jul 2003 | B2 |
| 6606744 | Mikurak | Aug 2003 | B1 |
| 6615166 | Guheen et al. | Sep 2003 | B1 |
| 6631359 | Braitberg | Oct 2003 | B1 |
| 6671818 | Mikurak | Dec 2003 | B1 |
| 6721713 | Guheen et al. | Apr 2004 | B1 |
| 6728766 | Cox et al. | Apr 2004 | B2 |
| 6732106 | Okamoto et al. | May 2004 | B2 |
| 6816882 | Conner et al. | Nov 2004 | B1 |
| 6859792 | Marjadi | Feb 2005 | B1 |
| 6889206 | Nuttall | May 2005 | B1 |
| 6920567 | Doherty | Jul 2005 | B1 |
| 6925497 | Vetrivelkumaran | Aug 2005 | B1 |
| 6957186 | Guheen et al. | Oct 2005 | B1 |
| 6966832 | Leen et al. | Nov 2005 | B2 |
| 7013294 | Sekigawa et al. | Mar 2006 | B1 |
| 7035918 | Redding | Apr 2006 | B1 |
| 7036091 | Nguyen | Apr 2006 | B1 |
| 7124101 | Mikurak | Oct 2006 | B1 |
| 7130807 | Mikurak | Oct 2006 | B1 |
| 7139737 | Takahashi et al. | Nov 2006 | B2 |
| 7165041 | Guheen et al. | Jan 2007 | B1 |
| 7193995 | Solala | Mar 2007 | B1 |
| 7194439 | Kassan et al. | Mar 2007 | B2 |
| 7200632 | Greschler | Apr 2007 | B1 |
| 7203966 | Abburi et al. | Apr 2007 | B2 |
| 7209900 | Hunter et al. | Apr 2007 | B2 |
| 7281267 | Tarbotton | Oct 2007 | B2 |
| 7299209 | Collier | Nov 2007 | B2 |
| 7313512 | Traut et al. | Dec 2007 | B1 |
| 7315826 | Guheen et al. | Jan 2008 | B1 |
| 7328263 | Sadjadi | Feb 2008 | B1 |
| 7395245 | Okamoto et al. | Jul 2008 | B2 |
| 7555460 | Barkan | Jun 2009 | B1 |
| 7590601 | Shea et al. | Sep 2009 | B2 |
| 7672972 | Marjadi et al. | Mar 2010 | B1 |
| 7716077 | Mikurak | May 2010 | B1 |
| 7716348 | Redding | May 2010 | B1 |
| 7818350 | New et al. | Oct 2010 | B2 |
| 8032409 | Mikurak | Oct 2011 | B1 |
| 8121874 | Guheen | Feb 2012 | B1 |
| 8392505 | Haughay, Jr. et al. | Mar 2013 | B2 |
| 8504932 | Quek et al. | Aug 2013 | B2 |
| 20010010046 | Muyres | Jul 2001 | A1 |
| 20010011253 | Coley | Aug 2001 | A1 |
| 20010013024 | Takahashi et al. | Aug 2001 | A1 |
| 20010037404 | Hafsteinsson | Nov 2001 | A1 |
| 20020007298 | Jim et al. | Jan 2002 | A1 |
| 20020029347 | Edelman | Mar 2002 | A1 |
| 20020049679 | Russell | Apr 2002 | A1 |
| 20020059094 | Hosea et al. | May 2002 | A1 |
| 20020069263 | Sears et al. | Jun 2002 | A1 |
| 20020091568 | Kraft et al. | Jul 2002 | A1 |
| 20020129356 | Hellerstein et al. | Sep 2002 | A1 |
| 20020156824 | Armstrong | Oct 2002 | A1 |
| 20020161908 | Benitez | Oct 2002 | A1 |
| 20020183045 | Emmerson et al. | Dec 2002 | A1 |
| 20020194008 | Yang | Dec 2002 | A1 |
| 20020194589 | Cristofalo et al. | Dec 2002 | A1 |
| 20030036683 | Kehr et al. | Feb 2003 | A1 |
| 20030059022 | Nebiker et al. | Mar 2003 | A1 |
| 20030069766 | Hoffman et al. | Apr 2003 | A1 |
| 20030084165 | Kjellberg et al. | May 2003 | A1 |
| 20030105718 | Hurtado | Jun 2003 | A1 |
| 20030135380 | Lehr et al. | Jul 2003 | A1 |
| 20030135474 | Circenis et al. | Jul 2003 | A1 |
| 20030182142 | Valenzuela et al. | Sep 2003 | A1 |
| 20030208763 | McElhatten et al. | Nov 2003 | A1 |
| 20040122774 | Studd et al. | Jun 2004 | A1 |
| 20050049931 | Wisnudel et al. | Mar 2005 | A1 |
| 20050182731 | Marjadi et al. | Aug 2005 | A1 |
| 20060004668 | Hamnen et al. | Jan 2006 | A1 |
| 20060020556 | Hamnen | Jan 2006 | A1 |
| 20060073820 | Craswell et al. | Apr 2006 | A1 |
| 20060106728 | Yellai et al. | May 2006 | A1 |
| 20060248017 | Koka et al. | Nov 2006 | A1 |
| 20060287959 | Blecken | Dec 2006 | A1 |
| 20060294019 | Dayan et al. | Dec 2006 | A1 |
| 20070106622 | Boomershine et al. | May 2007 | A1 |
| 20070219923 | Shea et al. | Sep 2007 | A1 |
| 20070226150 | Pietrzak et al. | Sep 2007 | A1 |
| 20070226155 | Yu et al. | Sep 2007 | A1 |
| 20070233578 | Fusz et al. | Oct 2007 | A1 |
| 20070233837 | Imai | Oct 2007 | A1 |
| 20070244826 | Wang | Oct 2007 | A1 |
| 20070277233 | Bodin et al. | Nov 2007 | A1 |
| 20070299845 | Tokunaga | Dec 2007 | A1 |
| 20080005032 | Znidarsic | Jan 2008 | A1 |
| 20080064493 | Andersson | Mar 2008 | A1 |
| 20080071689 | Tabet | Mar 2008 | A1 |
| 20080080552 | Gates et al. | Apr 2008 | A1 |
| 20080082450 | Grimm et al. | Apr 2008 | A1 |
| 20080083025 | Meijer et al. | Apr 2008 | A1 |
| 20080154798 | Valz | Jun 2008 | A1 |
| 20080178284 | Harwell | Jul 2008 | A1 |
| 20080228533 | McGuire et al. | Sep 2008 | A1 |
| 20080235116 | Jensen | Sep 2008 | A1 |
| 20080250349 | Peiro et al. | Oct 2008 | A1 |
| 20080288542 | Buttars | Nov 2008 | A1 |
| 20080319910 | Duffus et al. | Dec 2008 | A1 |
| 20090003712 | Mei et al. | Jan 2009 | A1 |
| 20090132435 | Titus et al. | May 2009 | A1 |
| 20090240629 | Xie et al. | Sep 2009 | A1 |
| 20090327437 | Estrada | Dec 2009 | A1 |
| 20100017725 | McCarthy et al. | Jan 2010 | A1 |
| 20100223677 | Scapa | Sep 2010 | A1 |
| 20100228679 | Scapa | Sep 2010 | A1 |
| 20100251181 | Lal | Sep 2010 | A1 |
| 20110239131 | Koren | Sep 2011 | A1 |
| 20120022954 | Garcia et al. | Jan 2012 | A1 |
| 20120066089 | Henderson | Mar 2012 | A1 |
| 20120173975 | Herz et al. | Jul 2012 | A1 |
| 20120226978 | Harberts et al. | Sep 2012 | A1 |
| 20120246734 | Pride et al. | Sep 2012 | A1 |
| 20130185656 | Heikes et al. | Jul 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 102356397 | Feb 2012 | CN |
| 1862202 | Dec 2007 | EP |
| 2409258 | Jan 2012 | EP |
| 2002091595 | Mar 2002 | JP |
| 2005250635 | Sep 2005 | JP |
| 2007265193 | Oct 2007 | JP |
| 20070286703 | Nov 2007 | JP |
| 2414954 | Feb 2012 | JP |
| WO9220021 | Nov 1992 | WO |
| WO2010108006 | Sep 2010 | WO |
| WO2010115107 | Oct 2010 | WO |
| Entry |
|---|
| Altair Releases HyperWorks 9.0, Connecting Engineerings with New Solver Technology and to the Global Grid: Newest version of Altair's simulation platform delivers on-demand access to the ISV applications and offers multi-core licensing business model Anonymous. PR Newswire [New York] May 19, 2008, downloaded from ProQuestDirect on the Internet 06, 3 pages. |
| Brignall, “Peugeot launches car club with a difference”, The Guardian, Jul. 9, 2010, retrieved from: http://www.guardian.co.uk/money/2010/jul/10/peugeot-car-club-mu/print on Oct. 4, 2011. |
| Levine, “Share My Ride”, The New York Times, Mar. 8, 2009, retrieved from: http://www.nytimes.com/2009/03/08/magazine/08Zipcar-t.html?pagewanted=print on Oct. 4, 2011. |
| International Search Report and Written Opinion dated Nov. 2, 2010 from the corresponding International Patent Application No. PCT/US2010/029787 filed Apr. 2, 2010. |
| Zipcar, “is zipcar for me”, retrieved from: http://www.zipcar.com/is-it/ on Oct. 4, 2011. |
| Zipcar, “rates & plans”, retrieved from: http://www.zipcar.com/atlanta/check-rates on Oct. 4, 2011. |
| International Search Report and the Written Opinion of the International Searching Authority (ISA/KR) dated Dec. 27, 2012 from corresponding International Application No. PCT/US2011/055060 filed Oct. 6, 2011. |
| International Preliminary Report on Patentability dated Sep. 29, 2011 from the corresponding International Patent Application No. PCT/US2010/027820 filed Mar. 18, 2010. |
| International Search Report and Written Opinion dated Oct. 26, 2010 from the corresponding International Patent Application No. PCT/US2010/027820 filed Mar. 18, 2010. |
| Extended European Search Report in co-pending European Application No. 10754111.2 mailed on Aug. 14, 2012 in 5 pages. |
| International Preliminary Report on Patentability dated Oct. 13, 2011 from the corresponding International Patent Application No. PCT/US2010/029787 filed Apr. 2, 2010. |
| Number | Date | Country | |
|---|---|---|---|
| 20160012211 A1 | Jan 2016 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61166036 | Apr 2009 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 14531443 | Nov 2014 | US |
| Child | 14862208 | US | |
| Parent | 12753228 | Apr 2010 | US |
| Child | 14531443 | US | |
| Parent | 11061166 | Feb 2005 | US |
| Child | 12753228 | US | |
| Parent | 09855317 | May 2001 | US |
| Child | 11061166 | US |
