Understanding that drawings depict only certain preferred embodiments of the invention and are therefore not to be considered limiting of its scope, the preferred embodiments will be described and explained with additional specificity and detail through the use of the accompanying drawings in which:
In the following description, certain specific details of programming, software modules, user selections, network transactions, database queries, database structures, etc., are provided for a thorough understanding of the specific preferred embodiments of the invention. However, those skilled in the art will recognize that embodiments can be practiced without one or more of the specific details, or with other methods, components, materials, etc.
In some cases, well-known structures, materials, or operations are not shown or described in detail in order to avoid obscuring aspects of the preferred embodiments. Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in a variety of alternative embodiments. In some embodiments, the methodologies and systems described herein may be carried out using one or more digital processors, such as the types of microprocessors that are commonly found in PC's, laptops, PDA's and all manner of other desktop or portable electronic appliances.
Disclosed are embodiments of systems and methods for selection of promotional media items and/or generation of advertising units. In some embodiments, a system for constructing a program unit composed of one or more media items and one or more promotional media items is provided. The media items may be selected to be responsive to a particular user's, or group of users', tastes. The promotional media items may also be selected to be responsive to the media items in the program unit and the user's/users′ tastes so that they are of greater interest to the user(s) than a random selection of promotional media items. The media items and promotional media items may also be selected to meet additional constraints, such as the number, licensing costs, and revenue generated by the program unit, as well as other statutory or contractual compositional constraints. Some embodiments may provide for systems and methods for constructing program units which also are responsive to the tastes of a user, some of which can generate advertising revenues which offset the licensing costs of the media items.
In some embodiments, a media recommender subsystem and a promotional media recommender subsystem are provided. The media recommender subsystem may generate media items, and the promotional media recommender subsystem may generate promotional media items, responsive to one or more user taste preferences. A means for using these recommenders to generate a set of media items and set of promotional media items which satisfy certain constraints may also be provided. The selected items may then be combined into a single program unit, such as a promotional program unit.
As used herein, the term “media data item” is intended to encompass any media item or representation of a media item. A “media item” is intended to encompass any type of media file which can be represented in a digital media format, such as a song, movie, picture, e-book, newspaper, segment of a TV/radio program, game, etc. Thus, it is intended that the term “media data item” encompass, for example, playable media item files (e.g., an MP3 file), as well as metadata that identifies a playable media file (e.g., metadata that identifies an MP3 file). It should therefore be apparent that in any embodiment providing a process, step, or system using “media items,” that process, step, or system may instead use a representation of a media item (such as metadata), and vice versa.
Likewise, the term “promotional media data item” is intended to encompass any promotional media item or representation of a promotional media item. A promotional media item is a media item which promotes, publicizes, advertises, advances, etc., something other than the promotional media item itself. A promotional media item can be of different types, e.g., a commercial advertisement, public service announcement, editorial, political endorsement, etc. Again, in any embodiment providing a process, step, or system using “promotional media items,” that process, step, or system may instead use a representation of a promotional media item (such as metadata), and vice versa.
A “play” of a media item is a presentation of the digital data for the media item to the user in a form such that the user can perceive the expressive content of the media item. A “playlist” is a list of media items grouped by the user as a composition. A media item recommender is a system or method for generating a list of media items which are responsive to another input list of media items. A promotional media item recommender is a system or method for generating a list of promotional media items which are responsive to another input list of media items. Examples of recommender systems that may be used in connection with the embodiments set forth herein are described in U.S. patent application Ser. No. 11/346,818 titled “Recommender System for Identifying a New Set of Media Items Responsive to an Input Set of Media Items and Knowledge Base Metrics,” now U.S. Pat. No. 7,734,569, which is incorporated herein by reference in its entirety.
As used herein, a “program unit” is an integral item comprised of one or more media items and one or more promotional media items. A webcast is the transmission of digital media items from a computer server system over the Internet to a plurality of user computers incorporating digital media players that make the expressive content of the media items perceptible to the user. A podcast is the transmission of digital media items from a computer server system over the Internet to a plurality of user computers incorporating means for conveying the digital media items to a portable digital media player that makes the expressive content perceptible to the user.
A program unit may be a composition that, for certain types of media items (e.g., sound recordings) integrated therein, is protected under copyright laws from being decomposed into individual component media items that could be conveyed to others. In addition, for many types of media items and digital encoding formats, once the media items and promotional media items have been encoded into a single file of digital data, an encoding format may be used that makes it technically infeasible for a user lacking expert technical skills to decompose the integral program unit back into component items. Therefore, the license holders for the media items may be protected from lost royalties due to illegal conveyance of individual media items.
As used herein, a “mediaset” is a list of media items that, for example, an advertiser has grouped together. A promotional mediaset is therefore a list of promotional media items that have been grouped together.
As used herein, a “metric” M between a media item i and a promotional media item j, or between a media item i and a media item j, for a given knowledge base K, expresses the strength of association between i and j with respect to K. A metric may be expressed as a distance, where smaller distance values represent stronger association values, or, alternatively, as a similarity, where larger similarity values represent stronger association values.
A matrix representation for metric M for a given knowledge base K can be defined as a two-dimensional matrix where the element M(i, j) is the value of the metric between the media item i and a promotional item j, or between a media item i and a media item j.
A graph representation for a given knowledge base K, is a graph where nodes represent media items and/or promotional media items, and edges are between pairs of media items or between media items and promotional media items. Pairs of media items i, j may be linked by labeled directed edges, where the label indicates the value of the similarity or distance metric M(i,j) for the edge with head media item i and tail media item j. Media items and promotional media items may alternatively be linked by labeled undirected edges, where the label indicates the value of the similarity or distance metric M(i,j) for the edge with head media item i and tail promotional media item j.
One specific embodiment is shown in and described with reference to
Advertisers 120 may provide promotional media items to the system 102 in the form of, for example, digital data files 124. Advertisers may also supply metadata 122 with the promotional media items 124 to the program media items selection process 140 to associate individual promotional media items with media items. Examples of metadata 122 include descriptive keywords about a promotional media item, specific target demographics for a promotional media item, identifiers for media items embedded in the promotional media item, and/or an explicit list of media items with which the advertiser wishes to associate a promotional media item, one or more of which may be used by a promotional media item recommender to provide promotional media items responsive to the media items supplied to it.
One or more program unit constraints 130 may also be used to narrow the pool of media data items and/or promotional media data items from which items are selected for the program unit. One such constraint may limit the number of media data items associated with a particular artist. Other constraints may limit the licensing costs associated with the media data items. Still other constraints may be configured to ensure that the media data items and the promotional media data items selected for a promotional program unit are selected such that advertising revenues associated with the promotional media data items are at least equal to licensing costs associated with the media data items.
The program media selection process 140, described further below, may ultimately produce a list of recommended media items 230 and a list of recommended promotional media items 232, as shown in
The media item file selection process 150 may use the list of recommended media items 230 to select digital data files 152 for the recommended media items from the collection of media item digital data files 145. Digital data file collection 145 may be provided by a content provider 180. Similarly, the promotional media item selection process 160 may use the list of recommended media items 232 to select digital data files 162 for the recommended promotional media items from the collection of promotional media item digital data files 124.
The digital data files 152 for the recommended media items 230 and digital data files 162 for the recommended promotional media items 232 may then be combined by the program build process 170 into a single digital data file representing the program unit 172. The media items 230 and promotional media items 232 may be a mix of different media types with different media encoding formats (e.g., MP3, AAC, Vorbis, RealAudio, WMA, Theora, RealVideo, WMV, MPEG) and multimedia container file formats (e.g., AVI, QuickTime, Ogg, RealMedia, ASF). In one embodiment that relates to a mix of media items 230 and promotional media items 232 which can be packaged in a single multimedia container file format, the program build process 170 packs the mix of media and promotional media items into a program unit file 172 with that multimedia container file format.
In another embodiment that relates to a mix of media items 230 and promotional media items 232 which can be encoded into a single media encoding format, the build process 170 first decodes each of the media items and promotional media items with an appropriate decoder, concatenates the now unencoded items into a single file, and inserts any desired filler media items between them. The resulting items may then be encoded into a program unit file 172 with the appropriate single media encoding format.
Another aspect of the program unit build process 170 is the manner in which promotional media items are sequenced with the media items in the program unit 172. In one embodiment, the promotional media items are interleaved between groups of media items. The size of the groups may be specified by the program operator. In another embodiment, the promotional media items are inserted in the sequence of media at appropriate points defined by an “auto-DJ” program that achieves some overall compositional objective. In yet another embodiment, the promotional media items may be grouped before, after, or both before and after, the entire set of media items.
One illustrative implementation of the program media selection process 140 is shown in the flowchart of
The promotional media item recommender system 206 likewise produces a set of recommended promotional media items 232 responsive to the user taste data 202 and/or the list of media items produced by the media item recommender 204.
Various embodiments can incorporate different methods for generating sets of recommended media items 230 and recommended promotional media items 232 that satisfy one or more constraints, such as constraints 220, 222, 224, and 226. One embodiment implements a simple “greedy” algorithm as follows. The media item recommender 204 is used to generate a preliminary set of media items responsive to the user taste data 202. The promotional media item recommender 206 is then used to generate a preliminary set of promotional media items responsive to the user taste data 202 and the preliminary set of media items. The preliminary set of media items and the preliminary set of promotional media items are supplied to the item selection process 208, along with the item constraints 220, 222, 224, and 226. These constraints may be used to select a final list of media items and promotional media items that satisfy the constraints.
If the constraints are not satisfied, as exemplified by the test 210, the process extends the preliminary set of recommended media items and promotional media items with additional recommendations from the recommenders 204 and 206. This process of extending the list of recommended media items and promotional media items, selecting subsets that satisfy the constraints, and testing if the constraints are satisfied, repeats until a final set of recommended media items 230 and a final set of recommended promotional media items 232 are generated. Alternatively, these steps may be repeated until an arbitrary termination criteria, such as reaching a predetermined number of attempts, is met to avoid infinite repetition of the process.
The item selection process 208 is understood to embody any process for selecting an optimal subset of items from an input set of items, subject to a set of constraints on the properties of the items. One such class of constraints that may be imposed on the items in the final program unit is made up of resource constraints 222 and 224. These constraints can be generally formulated as an integer-programming problem, as follows. Given a set of media items m1, m2, . . . , mk with play times t1, t2, . . . , tk that engender licensing costs c1, c2, . . . , ck, and a set of promotional media items p1, p2, . . . , pl with play times s1, s2, . . . , sl that generate revenues r1, r2, . . . , rl, select a subset M of media items and a subset P of promotional media items that satisfy the inequalities
These inequalities specify that the program unit will include a minimum of K′ media items having a minimum total play length of T time units, a maximum of L′ promotional media items having a total play length of S time units, and will have a net cost to produce of C. Different embodiments of the invention implementing specific instances of one or more of these general constraints are also contemplated.
For instance, some embodiments may produce program units the licensing costs of which (stemming from use of the incorporated media items) are completely subsidized by advertising revenues (stemming from use of the incorporated promotional media items). Such embodiments may implement the equivalent of setting C=0. Other embodiments, which may be useful for applications in which users will pay a premium for program units not having promotional media items, may implement the equivalent of setting L′=S=0. Some such embodiments may be implemented so as to have a specified maximum cost. A variant of this, in which cost is not a factor to the user, may implement the equivalent of setting C=∞. Another embodiment that places no limits on the number of promotional media items in the program unit, such that advertising revenues offset the licensing costs of the media items to the maximum extent possible, may implement the equivalent of setting L′=S=∞. Yet another embodiment may be structured with the goal of having the cost of the program unit (from the media items) be completely subsidized by advertising revenues (from the promotional media items). Such an embodiment may implement the equivalent of setting M′=T=0 and C=0.
Embodiments which implement other constraints in the numbers, play times, licensing costs, and generated revenues of the media items and promotional media items incorporated into the program unit are also contemplated, as would be apparent to one of ordinary skill in the art.
Another class of constraints that may be imposed on the program unit in some embodiments are compositional constraints 226 on the set of media items. As one example, in applications including media items that are sound recordings, these compositional constraints may limit the number of media items by the same author or from the same collection of media items pursuant to the “sound recording content selection” conditions included in the statutory license provisions of 17 U.S.C. §114, also known as the Digital Millennium Copyright Act (DMCA). Under these provisions, during any three-hour time period, a transmission may not include more than:
1) Three sound recordings from a particular album, or two sound recordings from the same album consecutively;
2) Four sound recordings by a particular artist, or from a set or compilation of albums; or
3) Three sound recordings by a particular artist consecutively, or from a set or compilation of albums consecutively.
In one implementation of the program media items selection process 140, constraints, such as a list of artists and/or albums, and/or the allowable number of sound recordings by each artist or from each album in the program unit, may be employed. In such implementations, the selection process 140 may operate so as to ensure that the number of selections by each of the listed artists and albums does not exceed a specified number.
Embodiments which supply a sequence of program units to a customer must only ensure that the sequence of program units does not violate the DMCA content-selection criteria in any three-hour period. Such embodiments may therefore constrain the build process 170 so as not to begin a program unit with a media item that would violate the DMCA restrictions when juxtaposed with the media item that ends the previous program unit. Of course, other constraints on the properties of items for specifying an optimal subset of items from a set are contemplated, many of which would be apparent to those of ordinary skill in the art. For example, “greedy” procedures and other heuristics for selecting an optimal subset of items from an input set of items subject to a set of constraints on the properties of the items are well understood to those of ordinary skill in the art.
One of ordinary skill in the art will also understand that, while the above system and methods are described as embodied in a promotional media recommendation system, the inventive system could be used in any system for recommending items that can be associated with a second type of item in a meaningful way to a user.
Other embodiments disclosed herein relate to systems and methods for recommending items to a user in a personalized manner. Some such embodiments relate to recommender systems containing promotional media items which can be associated with an input set of media items.
For example, in some embodiments, a system for identifying a set of promotional media items in response to an input set of media items is provided. The system may use a knowledge base which can include, for example, a set of promotional media items, a collection of mediasets, and specified associations between promotional media items and mediasets. In such embodiments, each promotional media item in the set may be associated with a mediaset in the collection of mediasets. Other systems may use a knowledge base that includes a set of media items, a collection of promotional mediasets, and specified associations between media items and promotional mediasets. A variety of metrics between media items and promotional media items may be considered by, for example, analyzing how the promotional mediasets are associated with the media items or by analyzing how the mediasets are associated with the media items. Such metrics may be stored in a matrix that allows the system to identify promotional media items that compliment an input set of media items. In some embodiments, the metrics may specify not only whether, but also the degree to which, a promotional media item is associated with a media item. The associations between promotional media items and mediasets, or media items and promotional mediasets, may be either explicitly or implicitly specified.
Metrics of the knowledge base of the system may be used to correlate an input set of media items with a preferred set of promotional media items. In some embodiments, different metrics between media items and promotional media items can be built from advertiser-supplied preferences for associating promotional media items and media items, including, but not limited to, metrics which associate:
1) a promotional media item with media items that are embedded in the promotional media item and with other media items that share a characteristic of the embedded media item, such artist, actor, etc.;
2) a promotional media item with media items that the advertiser explicitly specifies;
3) a promotional media item with media items known to be preferred by a particular audience/user, an audience/user specified by the advertiser, and/or an audience/user with certain characteristics; or
4) a promotional media item identified by specific keywords with media items identified by the same keywords.
Such metrics can be represented in an explicit form that directly associates media items with promotional media items. Alternatively, such metrics can be represented in an implicit form that associates media items with media items such that a promotional media item can be associated with a media item via a sequence of intermediate media items and the value of the metric for the promotional media item and the media item is a defined function of the metric for successive pairs of the intermediate media items.
One implementation of a method is shown in
From this first collection of candidate promotional media items, a second subset of candidate promotional media items is then selected by process 503. As an example, process 503 could order the promotional media items in the first collection in decreasing order according to their respective metric value. The first N unique promotional media items may then be selected as the subset.
Finally, from the subset of promotional media items, a third and final output set 505 of some specified number of promotional media items may be selected. This final output set may be selected so as to satisfy additional desired external constraints by process 504. For instance, in some applications the system may be used to provide promotional media items responsive to input sets of media items where a number of characteristics, such as age, location, etc., are known about the person supplying the input set of media items.
An advertiser that supplied a particular promotional media item may specify that the promotional media item only be provided to persons with certain characteristics, such those of an age within a specified range. If the second collection of promotional media items input to process 504 includes such a promotional media item, process 504 would then add or withhold this promotional media item from the final output set of promotional media items 505, as determined by whether or not the person to whom the promotional media items will be supplied has the characteristic, such as being in the target age group, specified by the advertiser. As another example, process 504 could withhold promotional media items that have been previously supplied to the person associated with the input media set within some designated period of time (or ever) from the output set of promotional media items 505. Any number of other such characteristics for filtering the promotional media items and methods for doing so will be apparent to a person of ordinary skill in the art.
In other embodiments, explicit associations including similarity values between just a subset of the full set of media items known to the system and the set of promotional media items may be provided, as shown in the graph of
M(i,j)=min{M(i,i+1), M(i,i+2), . . . , M(i+k,j)}
or
M(i,j)=M(i,i+1)*M(i,i+2)* . . . *M(i+k,j)
Other methods for computing the similarity value M(i,j) for the path between media item i and promotional media item j, where the edges are labeled with the sequence of similarity values M(i, i+1), M(i+1, i+2), . . . , M(i+k, j), will be apparent to a person of ordinary skill in the art.
In yet another embodiment corresponding to the graph in
The growing list of media items may be compared at step 608 to the target media items 604 and the process of expanding the list may be terminated when it contains the required number of target media items. The promotional media items associated with the target media items in the list of recommended media items may be selected at 610. These promotional media items may then be used as the collection of promotional media items 612 output by process 600 to serve as the first collection of promotional media items used by the process shown in
The above description fully discloses the invention including preferred embodiments thereof. Without further elaboration, it is believed that one skilled in the art can use the preceding description to utilize the invention to its fullest extent. Therefore the examples and embodiments disclosed herein are to be construed as merely illustrative and not a limitation of the scope of the present invention in any way.
It will be obvious to those having skill in the art that many changes may be made to the details of the above-described embodiments without departing from the underlying principles of the invention. Therefore, it is to be understood that the invention is not to be limited to the specific embodiments disclosed and that modifications and other embodiments are intended to be included within the scope of the appended claims. For example, one of ordinary skill in the art will understand that, while several of the above systems and methods are described as embodied in a promotional media recommendation system, it should be understood that the inventive system could be used in any system for recommending items that can be associated with a second type of item in a meaningful way to a user.
The scope of the present invention should, therefore, be determined only by the following claims.
This application claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Patent Application No. 60/722,750 filed Sep. 30, 2005, and titled “SYSTEM AND METHOD FOR DYNAMICALLY IDENTIFYING A SET OF MEDIA ITEMS RESPONSIVE TO AN INPUT SET OF MEDIA ITEMS BY USING METRICS AMONG MEDIA ITEMS.” This application also claims the benefit under 35 U.S.C. §119(e) of U.S. Provisional Patent Application No. 60/730,599 filed Oct. 26, 2005, and titled “SYSTEM AND METHOD FOR PROVIDING INDIVIDUALLY CUSTOMIZED MEDIASET INCORPORATING INDIVIDUALLY CUSTOMIZED PROMOTIONAL MEDIASET.” Both of the foregoing applications are incorporated herein by specific reference.
Number | Name | Date | Kind |
---|---|---|---|
5355302 | Martin | Oct 1994 | A |
5375235 | Berry | Dec 1994 | A |
5464946 | Lewis | Nov 1995 | A |
5483278 | Strubbe | Jan 1996 | A |
5583763 | Atcheson | Dec 1996 | A |
5724521 | Dedrick | Mar 1998 | A |
5754939 | Herz | May 1998 | A |
5758257 | Herz | May 1998 | A |
5890152 | Rapaport | Mar 1999 | A |
5918014 | Robinson | Jun 1999 | A |
5950176 | Keiser | Sep 1999 | A |
6000044 | Chrysos | Dec 1999 | A |
6047311 | Ueno | Apr 2000 | A |
6112186 | Bergh | Aug 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6345288 | Reed | Feb 2002 | B1 |
6346951 | Mastronardi | Feb 2002 | B1 |
6347313 | Ma | Feb 2002 | B1 |
6349339 | Williams | Feb 2002 | B1 |
6381575 | Martin | Apr 2002 | B1 |
6430539 | Lazarus et al. | Aug 2002 | B1 |
6434621 | Pezzillo | Aug 2002 | B1 |
6438579 | Hosken | Aug 2002 | B1 |
6487539 | Aggarwal et al. | Nov 2002 | B1 |
6526411 | Ward | Feb 2003 | B1 |
6532469 | Feldman | Mar 2003 | B1 |
6577716 | Minter | Jun 2003 | B1 |
6587127 | Leeke et al. | Jul 2003 | B1 |
6596405 | Dunning | Jul 2003 | B2 |
6615208 | Behrens et al. | Sep 2003 | B1 |
6647371 | Shinohara | Nov 2003 | B2 |
6687696 | Hofmann | Feb 2004 | B2 |
6690918 | Evans | Feb 2004 | B2 |
6704576 | Brachman | Mar 2004 | B1 |
6748395 | Picker | Jun 2004 | B1 |
6751574 | Shinohara | Jun 2004 | B2 |
6785688 | Abajuan | Aug 2004 | B2 |
6842761 | Diamond | Jan 2005 | B2 |
6850252 | Hoffberg | Feb 2005 | B1 |
6914891 | Ha | Jul 2005 | B2 |
6931454 | Deshpande | Aug 2005 | B2 |
6941324 | Plastina | Sep 2005 | B2 |
6947922 | Glance | Sep 2005 | B1 |
6950804 | Strietzel | Sep 2005 | B2 |
6987221 | Platt | Jan 2006 | B2 |
6990497 | O'Rourke | Jan 2006 | B2 |
6993532 | Platt | Jan 2006 | B1 |
7020637 | Bratton | Mar 2006 | B2 |
7021836 | Bratton | Apr 2006 | B2 |
7051352 | Schaffer | May 2006 | B1 |
7072846 | Robinson | Jul 2006 | B1 |
7082407 | Bezos | Jul 2006 | B1 |
7096234 | Plastina | Aug 2006 | B2 |
7111240 | Crow | Sep 2006 | B2 |
7113917 | Jacobi | Sep 2006 | B2 |
7113999 | Pestoni | Sep 2006 | B2 |
7120619 | Drucker | Oct 2006 | B2 |
7127143 | Elkins | Oct 2006 | B2 |
7136866 | Springer, Jr. | Nov 2006 | B2 |
7139723 | Conkwright | Nov 2006 | B2 |
7174126 | McElhatten | Feb 2007 | B2 |
7180473 | Horie | Feb 2007 | B2 |
7194421 | Conkwright | Mar 2007 | B2 |
7197472 | Conkwright | Mar 2007 | B2 |
7224282 | Terauchi | May 2007 | B2 |
7236941 | Conkwright | Jun 2007 | B2 |
7256341 | Plastina | Aug 2007 | B2 |
7277870 | Mourad | Oct 2007 | B2 |
7302419 | Conkwright | Nov 2007 | B2 |
7302468 | Wijeratne | Nov 2007 | B2 |
7358434 | Plastina | Apr 2008 | B2 |
7363314 | Picker | Apr 2008 | B2 |
7392212 | Hancock | Jun 2008 | B2 |
7403769 | Kopra | Jul 2008 | B2 |
7415181 | Greenwood | Aug 2008 | B2 |
7457862 | Hepworth | Nov 2008 | B2 |
7478323 | Dowdy | Jan 2009 | B2 |
7493572 | Card | Feb 2009 | B2 |
7499630 | Koch | Mar 2009 | B2 |
7505959 | Kaiser | Mar 2009 | B2 |
7546254 | Bednarek | Jun 2009 | B2 |
7568213 | Carhart | Jul 2009 | B2 |
7574422 | Guan | Aug 2009 | B2 |
7580932 | Plastina | Aug 2009 | B2 |
7599950 | Walther | Oct 2009 | B2 |
7644077 | Picker | Jan 2010 | B2 |
7657224 | Goldberg | Feb 2010 | B2 |
7734569 | Martin | Jun 2010 | B2 |
20010056434 | Kaplan | Dec 2001 | A1 |
20020002899 | Gjerdingen | Jan 2002 | A1 |
20020059094 | Hosea et al. | May 2002 | A1 |
20020082901 | Dunning et al. | Jun 2002 | A1 |
20020152117 | Cristofalo et al. | Oct 2002 | A1 |
20020178223 | Bushkin | Nov 2002 | A1 |
20020194215 | Cantrell et al. | Dec 2002 | A1 |
20030018797 | Dunning et al. | Jan 2003 | A1 |
20030033321 | Schrempp | Feb 2003 | A1 |
20030055689 | Block | Mar 2003 | A1 |
20030097379 | Ireton | May 2003 | A1 |
20030120630 | Tunkelang | Jun 2003 | A1 |
20030212710 | Guy | Nov 2003 | A1 |
20030229537 | Dunning et al. | Dec 2003 | A1 |
20040002993 | Toussaint | Jan 2004 | A1 |
20040003392 | Trajkovic | Jan 2004 | A1 |
20040068552 | Kotz | Apr 2004 | A1 |
20040073924 | Pendakur | Apr 2004 | A1 |
20040128286 | Yasushita | Jul 2004 | A1 |
20040139064 | Chevallier | Jul 2004 | A1 |
20040148424 | Berkson | Jul 2004 | A1 |
20040158860 | Crow | Aug 2004 | A1 |
20040267715 | Polson | Dec 2004 | A1 |
20050021470 | Martin | Jan 2005 | A1 |
20050060350 | Baum | Mar 2005 | A1 |
20050075908 | Stevens | Apr 2005 | A1 |
20050091146 | Levinson | Apr 2005 | A1 |
20050102610 | Jie | May 2005 | A1 |
20050114357 | Chengalvarayan | May 2005 | A1 |
20050141709 | Bratton | Jun 2005 | A1 |
20050154608 | Paulson | Jul 2005 | A1 |
20050193014 | Prince | Sep 2005 | A1 |
20050193054 | Wilson | Sep 2005 | A1 |
20050195696 | Rekimoto | Sep 2005 | A1 |
20050203807 | Bezos et al. | Sep 2005 | A1 |
20050210101 | Janik | Sep 2005 | A1 |
20050222989 | Haveliwala | Oct 2005 | A1 |
20050223039 | Kim | Oct 2005 | A1 |
20050234891 | Walther | Oct 2005 | A1 |
20050235811 | Dukane | Oct 2005 | A1 |
20050256867 | Walther | Nov 2005 | A1 |
20050276570 | Reed | Dec 2005 | A1 |
20060015904 | Marcus | Jan 2006 | A1 |
20060018208 | Nathan | Jan 2006 | A1 |
20060018209 | Drakoulis | Jan 2006 | A1 |
20060020062 | Bloom | Jan 2006 | A1 |
20060026263 | Raghavan | Feb 2006 | A1 |
20060062094 | Nathan | Mar 2006 | A1 |
20060067296 | Bershad | Mar 2006 | A1 |
20060074750 | Clark | Apr 2006 | A1 |
20060080356 | Burges | Apr 2006 | A1 |
20060091203 | Bakker | May 2006 | A1 |
20060095516 | Wijeratne | May 2006 | A1 |
20060100978 | Heller | May 2006 | A1 |
20060112098 | Renshaw | May 2006 | A1 |
20060123052 | Robbin | Jun 2006 | A1 |
20060136344 | Jones | Jun 2006 | A1 |
20060165571 | Seon | Jul 2006 | A1 |
20060168616 | Candelore | Jul 2006 | A1 |
20060173910 | McLaughlin | Aug 2006 | A1 |
20060173916 | Verbeck | Aug 2006 | A1 |
20060195462 | Rogers | Aug 2006 | A1 |
20060195513 | Rogers | Aug 2006 | A1 |
20060195514 | Rogers | Aug 2006 | A1 |
20060195515 | Beaupre | Aug 2006 | A1 |
20060195516 | Beaupre | Aug 2006 | A1 |
20060195521 | New | Aug 2006 | A1 |
20060195789 | Rogers | Aug 2006 | A1 |
20060195790 | Beaupre | Aug 2006 | A1 |
20060253874 | Stark | Nov 2006 | A1 |
20060277098 | Chung et al. | Dec 2006 | A1 |
20060282311 | Jiang | Dec 2006 | A1 |
20060288044 | Kashiwagi | Dec 2006 | A1 |
20060288367 | Swix et al. | Dec 2006 | A1 |
20070016507 | Tzara | Jan 2007 | A1 |
20070043829 | Dua | Feb 2007 | A1 |
20070100690 | Hopkins | May 2007 | A1 |
20070118546 | Acharya | May 2007 | A1 |
20070136264 | Tran | Jun 2007 | A1 |
20070156677 | Szabo | Jul 2007 | A1 |
20070161402 | Ng | Jul 2007 | A1 |
20070203790 | Torrens | Aug 2007 | A1 |
20070244880 | Martin | Oct 2007 | A1 |
20070250429 | Walser | Oct 2007 | A1 |
20070250761 | Bradley | Oct 2007 | A1 |
20070271286 | Purang | Nov 2007 | A1 |
20070294096 | Randall | Dec 2007 | A1 |
20080004948 | Flake | Jan 2008 | A1 |
20080004990 | Flake | Jan 2008 | A1 |
20080027881 | Bisse | Jan 2008 | A1 |
20080046317 | Christianson | Feb 2008 | A1 |
20080077264 | Irvin | Mar 2008 | A1 |
20080082467 | Meijer | Apr 2008 | A1 |
20080133601 | Cervera | Jun 2008 | A1 |
20080155057 | Khedouri | Jun 2008 | A1 |
20080155588 | Roberts et al. | Jun 2008 | A1 |
20080220855 | Chen | Sep 2008 | A1 |
20080270221 | Clemens | Oct 2008 | A1 |
20090024504 | Lerman | Jan 2009 | A1 |
20090024510 | Chen | Jan 2009 | A1 |
20090073174 | Berg | Mar 2009 | A1 |
20090076939 | Berg | Mar 2009 | A1 |
20090076974 | Berg | Mar 2009 | A1 |
20090083307 | Cervera | Mar 2009 | A1 |
20090089222 | Ferreira | Apr 2009 | A1 |
20090106085 | Raimbeault | Apr 2009 | A1 |
20090210415 | Martin | Aug 2009 | A1 |
20090276368 | Martin | Nov 2009 | A1 |
20100169328 | Hangartner | Jul 2010 | A1 |
Number | Date | Country |
---|---|---|
1 050 833 | Aug 2000 | EP |
1 231 788 | Aug 2002 | EP |
1 420 388 | May 2004 | EP |
1 548 741 | Jun 2005 | EP |
11-052965 | Feb 1999 | JP |
2002-108351 | Apr 2002 | JP |
2003-255958 | Oct 2003 | JP |
2002-025579 | Apr 2002 | KR |
WO 03036541 | May 2003 | WO |
WO03051051 | Jun 2003 | WO |
WO 2004070538 | Aug 2004 | WO |
WO2004070538 | Aug 2004 | WO |
WO2005013114 | Feb 2005 | WO |
WO 2005115107 | Dec 2005 | WO |
WO 2006052837 | May 2006 | WO |
WO2006075032 | Jul 2006 | WO |
WO2006114451 | Nov 2006 | WO |
WO 2007134193 | May 2007 | WO |
WO 2007075622 | Jul 2007 | WO |
WO 2007092053 | Aug 2007 | WO |
WO2009149046 | Dec 2009 | WO |
Number | Date | Country | |
---|---|---|---|
20070078836 A1 | Apr 2007 | US |
Number | Date | Country | |
---|---|---|---|
60722750 | Sep 2005 | US | |
60730599 | Oct 2005 | US |