The present disclosure relates generally to a method and computer readable medium for exploring similar users and items of a media service.
The expansion of the Internet and the World Wide Web (“web”) has given computer users the enhanced ability to listen to and to watch various different forms of media through their computers. This media can be in the form of audio music, music videos, television programs, sporting events or any other form of audio or video media that a user wishes to watch or listen to.
In the past, users were able to purchase some form of removable media (e.g., compact disc), place the media into their computer's drive and listen to the song that was on their removable media. As time evolved, users were able to take the music that was on that compact disc store it on their computers and listen to it locally. More recently, web systems were developed which allowed a user log on to a network such as the Internet and, using a media player, either listen to specific media chosen from a group of media that a particular service has to offer or listen to an array of media offerings such as a radio station wherein different songs or other forms of media are combined to allow a user to listen to a group of songs in sequence, whether chosen by the user or by the operators of the network service. For example such a service is YAHOO! Music. Many media players, services and other software tools enable media to be organized by a user or a service into playlists, which, as the name connotes, are groups or lists of media files or file identifiers that can be used to effect playback by a user in a sequence or other selected or random order.
Newer technology has also allowed computer users to purchase portable devices that are able to store a user's media, making the user's media portable in the sense that a user can take his or her music with them wherever they may be going. These devices permit the storage and transport of the actual media files that are downloaded from a user's computer or a network onto the portable device. These portable devices are able to store individual media files and/or playlists that a user wishes to make portable. Thus, if a user has a certain media file on their computer the user can transfer that media file onto the portable device and transport it to locations different from the location where the user's computer system is located. Although these devices are popular today, they do have numerous drawbacks in that a user is severely limited in the range of what type of media they can store on their portable device and the ease of storing such media. This is because these devices only allow a user the capability of transporting media that is available locally on their computer as well as media that is available from a network service that offers such media. It is a shortcoming in the art that there is no system by which the user could broaden the range of media that can be made portable so as not to be constrained by the bounds and limits of certain Internet services' range of media or offerings. It would also be advantageous if a system or service was able to create a playlist and/or suggest different media for a user based on the user's previous experience and then make that media available at multiple media enabled devices as well as made portable, so that the user need not individually download each specific song and/or other media that the user likes but rather, in addition to the user's own selections the system would be able to grant the user more variety as well as spontaneity in the media available to the user no matter where the user might be located.
Another by-product of the expansion of the web is the interaction between different users by various different means such as email and/or instant messaging. This interaction has resulted in the ability for computer users to share many different types of information. For example, one user may send another user the Universal Resource Locator (URL) which points to a specific website that one user wishes the other user to experience. In another situation one user may wish to send another user a media file that they wish the other user to experience. This can be accomplished by sending the other user the actual media file attached to an email or instant message. On the other hand one user may send another user a URL, which links to a particular media file and is stored on a particular network. All of these systems however utilize an email, instant messaging or similar service to transfer information regarding the particular media that the user wishes to share and/or recommend. What is lacking in each of the currently available systems is a system in which a user may utilize their own media player to communicate their likes or dislikes for a particular media item to another user. It is a shortcoming in the art that there is no media system or service available wherein a user can, from within the media system and/or an enhanced media player, communicate with another user and share media with that other user and/or express a like or dislike for particular media. It would also be beneficial over known systems for a user to not have to rely on utilizing multiple programs to share or recommend music or other media to other users. It would be similarly advantageous over known systems to have one media player or to be more precise, a media engine which is able to play media as well as address a multiplicity of other user's media related needs and thus enable the user to have a more enhanced media experience.
An additional by-product of the expansion of computer related technology is that a single user in various circumstances may have more than one computer or media capable device located in numerous different locations through which a user may wish to experience their media. In the past, the users who wished to transfer or transport media files between different locations would have to go through the cumbersome steps of either transferring the media files by hand (e.g., on a compact disc), emailing or instant messaging the media file to themselves and then opening the file at a second location, or attempting to locate the media file on a particular media network service and then once again loading that particular media at a second computer location.
In one embodiment, the present disclosure includes a method for exploring similar users of a media service from a media management application comprising generating a user interface that displays a user selectable indicia representing a similar member function, wherein the similar member function allows a first user to search for at least one other user having a degree of similarity with respect to the first user; receiving, a user selection action from the first user of the indicia indicating the first user's desire to identify at least one user of the service that is similar to the first user; accessing an affinity engine that generates a first list of at least one similar user in the service, the similar user having a first degree of similarity with respect to the first user, the degree of similarity based at least in part upon the user and the similar user's media interaction behavior; and displaying at least one identifier and information associated with the similar user, wherein selecting the identifier causes the user interface to display a second list of at least one second similar user in the service, the second similar user having a second degree of similarity with respect to the similar user.
In another embodiment, the present disclosure includes a computer readable medium comprising software code for a media management application, the code configured to implement functions comprising: generating a user interface that displays a user selectable indicia representing a similar member function, wherein the similar member function allows a first user to search for at least one other user having a degree of similarity with respect to the first user; receiving a user selection action from the first user of the indicia indicating the first users desire to identify at least one user of the service that is similar to the first user; accessing an affinity engine that generates a first list of at least one similar user in the service, the similar user having a first degree of similarity with respect to the first user, the degree of similarity based at least in part upon the user and the similar user's media interaction behavior; and displaying at least one identifier and information associated with the similar user, wherein selecting the identifier causes the user interface to display a second list of at least one second similar user in the service, the second similar user having a second degree of similarity with respect to the similar user.
In another embodiment, the present disclosure includes a method for exploring similar users of a media service comprising: receiving, from a media management application, similar member search criteria, the search criteria representing a first user's desire to search the service for at least one other user having a degree of similarity with respect to the first user; accessing an affinity engine that generates a first list of at least one similar user of the service, the similar user having a first degree of similarity with respect to the first user, the degree of similarity based on at least in part upon the user's and the similar user's media interaction behavior; and sending, to the media management application, at least one identifier and information associated with the similar user; receiving, from the first user, a user selection action of the at least one identifier; accessing, upon selection of the at least one identifier, the affinity engine that generates a second list of at least one second similar user in the service, the second similar user having a second degree of similarity with respect to the similar user; and sending, to the media management application, at least one identifier and information associated with the second similar user.
The following drawing figures, which form a part of this application, are illustrative of embodiments of the present disclosure and are not meant to limit the scope of the disclosure in any manner, which scope shall be based on the claims appended hereto.
In general, the present disclosure relates to a system and method for delivering media over a network and for enhancing a user's experience in experiencing the media that is transferred over the network. In view of the aforementioned shortcomings in the art, it would be advantageous if a system was available wherein a user had complete and unfettered access to all media files that he or she has purchased, acquired and/or has access to at any location that they wish. Moreover, as was discussed above, current systems grant the user the ability to transport a media file on a portable device. These portable devices are limited in space and it becomes cumbersome to have to upload and download from the devices to and from each specific location that a user wishes to access files from. Therefore it would be advantageous if a system existed where a user was able to access these files through a click of a mouse on their local system with a minimum of cumbersome intermediary steps.
A certain embodiment of the present disclosure will now be discussed with reference to the aforementioned figures, wherein like reference numerals refer to like components. Referring now to
Each user 102 utilizes a processor 103, such as personal computer (PC), web enabled cellular telephone, personal digital assistant (PDA) or the like, coupled to the Internet 104 by any one of a number of known manners. Furthermore, each processor 103 preferably includes an Internet browser (not shown), such as that offered by Microsoft Corporation under the trade name INTERNET EXPLORER, or that offered by Netscape Corp. under the trade name NETSCAPE NAVIGATOR, or the software or hardware equivalent of the aforementioned components that enable networked intercommunication between users and service providers and/or among users. Each processor also includes a media engine 106 that, among other functions to be further described, provides the ability to convert information or data into a perceptible form and manage media related information or data so that user 102 may personalize their experience with various media. Media engine 106 may be incorporated into processor 103 by a vendor of processor 103, or obtained as a separate component from a media engine provider or in some other art recognized manner. As will be further described below, it is contemplated that media engine 106 may be a software application, or a software/firmware combination, or a software/firmware/hardware combination, as a matter of design choice, that serves as a central media manager for a user and facilitates the management of all manner of media files and services that the user might wish to access either through a computer or a personal portable device or through network devices available at various locations via a network. As used herein, the term media file is used generically to refer to an item of media, as well as associated metadata and/or network location information for that item.
The media engine 106 to be described herein is interacted with through a graphical user interface and related functionality so that a user, through a central and common entry point, and through a readily understood graphical user interface, can manage and access media files available through disparate sources as well as personally collected and organized sources. Thus, with initial reference to
Additionally, in the described embodiment, the processor 103 also runs an instant messaging software program 108 that is used to communicate with an instant messaging platform 116 and to facilitate the exchange of messages and other information between users. One such example of an instant messaging program is Yahoo! Instant Messenger, or any other instant messaging program now known or hereafter to become known. Although this embodiment is preferably described in terms of an instant messaging program it can also utilize other forms of communication over the network heretofore or hereafter known. Processor 103 also may include storage of local media files 110 and/or other plug-in programs that are run through or interact with the media engine 106. Processor 103 also preferably is connectable to device 114 such as a compact disc player and/or other external media file player, commonly referred to as an MP3 player, such as the type sold under the trade name IPOD by Apple Computer, Inc., that is used to portably store and play media files.
Additionally, processor 103 may contain Digital Rights Management software (DRM) 105 that protects the copyrights and other intellectual property rights of the user's 102 media files by enabling secure distribution and/or preventing or hampering illegal distribution of the media files. In one embodiment, DRM 105 encrypts or decrypts the media files for controlled access by authorized users, or alternatively for marking the content with a digital watermark or similar method so that the content can not be freely distributed. Media engine 106 preferably uses the DRM information to ensure that the media files being experienced through media engine 106 are not copied to or shared with users that are unauthorized to listen to or view the content.
As will be discussed in greater detail below, in addition to the messaging platform 116, the system 100 also includes media server 118. In addition to serving media over the Internet 104 to the user 102, media server 118 also preferably includes a media database 120, which in addition to storing the actual media also stores or communicates with storage of various metadata attributes of each particular piece of media. Database 120 may be distributed over multiple servers or locations. Other servers 130 make other content and services available and may provide administrative services such as managing user logon, service access permission, digital rights management, and other services made available through a service provider. Although some of the embodiments of the disclosure are described in terms of music, embodiments can also encompass any form of streaming or non-streaming media including but not limited to news, entertainment, sports events, web page or perceptible audio or video content. It should be also be understood that although the present disclosure is described in terms of media content and specifically audio content, the scope of the present disclosure encompasses any content or media format heretofore or hereafter known.
In one embodiment of the present disclosure, similar to the DRM software 105 located on the user's 102 processor 103, the media server maintains its own DRM software 150 which tracks the digital rights of media files located either in the media database 120 or stored on a user's 102 processor. Thus, for example, before the media server 118 streams or serves up or transfers any media files to a user 102, it validates the rights designation of that particular piece of media and only serves streams or transfers the file if the user has the appropriate rights.
As illustrated in
A further architecture of a network 300 according to another embodiment of the present disclosure will now be discussed with reference to
Additionally as can be seen in
Moreover, in this embodiment, the overall network 300 is connected in such a way that the media server 118, as well as the other servers, are able to interconnect with each other to optimize the experience for a particular user 102. As will be discussed further below, while a particular user may be locally associated with a particular processor 103, when connected to network 300, that user will have the ability to access all of the resources available throughout network 300 whether those resources reside on a particular server or whether those resources reside on another processor. The network 300 is able to collect and retain user specific information to enhance the user's experience through the resources available as part of the network. Thus, throughout the network, different users 102 will be accessing the same media server 118 via their individual media engine 106, however, their individual listening experience will be tailored to their particular needs and will utilize the capabilities of the entire network.
In one embodiment of the present disclosure, the system 100 is able to manage user's 102 media files in such a manner that facilitates the easy playback of different media files located in different locations throughout the network 300 as well as the creation of playlists or other combinations of media that can easily be accessed by each individual user 102 from any processor where the user 102 is located. In another embodiment of the present disclosure, two or more different users 102 are able to share and/or recommend media files amongst each other (if properly authorized) utilizing media engine 106. This is carried out by the interaction of media engine 106 and media server 118 which both share and store data that pertains to both users 102 as well as the media that is stored on media server 118 and the user's 102 respective processor 103. When the user 102 installs or utilizes media engine 106 on processor 103, the media engine 106 goes through various different steps to both acquaint itself with users 102 media as well as to interact with media server 118.
Referring to
Media engine 106 also searches for any devices 114 (MP3 player, CD drive, flash memory etc.) that may be located on or connected to users 102 processor 103 that may contain media. If such a peripheral device is found, the media engine determines whether there is any media located within that peripheral device. Step 408. If there is, media engine 106 stores information about that media including any associated metadata, in a file so as to enable the media engine 106 to access that data at a later point in time. Step 410. Once media engine 106 has acquired all information about the location of and the content of media files located on users 102 processor 103 or its peripheral device(s) 114, the media engine 106 is able to communicate with media server 118 to pass along the information that media engine 106 has acquired about the media files from processor 103. Media server 118 receives this information through the file or files created by media engine 106 containing the location and metadata information about the media files located on processor 103 and stores that information along with the other user information in user information database 122. Step 412. The media server 118 then compares the information received from the media engine 106 with the media files and associated metadata located in media database 120. Step 414. If the media files that are located on processor 103 match media files that are located on media database 120, media server 118 notes the location of those media files within media database 120 and appends that information to the file containing the information acquired by media engine 106 from processor 103. Step 416. Media server 118, then sends a file which contains an updated list of media files that combines both the media files that are located on processor 103 as well as information about the media files that media server 118 wishes to make available to user 102 from media database 120. Step 418. Once the media engine 106 acquires this file, it generates an interface which enables the user to manage all of the media available to the user in an efficient and coherent manner as will be discussed in reference to
Moreover, through the use of the media engine, the user is able to bookmark media that is located locally that the user 102 wants to make available from different processors 103 located in different locations. In other words, if user 102 has both a processor 103 located at home as well as a processor 103 located at work, the user can designate or the system can designate (in accordance with user preference criteria) some or all media files that are located at his or her home processor 103 that he or she wishes to be able to experience at processor 103 located at work or elsewhere. This once again is managed via the media engine 106 that both tracks, processes and shares information about the media file with the media server 118. Thus, if a user 102 wishes to experience media files that are located on processor 103 at a different location, the user would seamlessly be able to access and experience those media files from any processor that is running media engine 106 and has access to media server 118. This is because media engine 106 has previously stored all the metadata information as well as all the location information about each and every media file on processor 103, and forwarded this information to media server 118. Thus, for example, if a user 102 wishes to experience a media file that is located on a different one of their processors, media engine 106 located on the processor where the user is located would request a media file from media server 118 which is able to look up and access all of the user's media files from information available to the media server 118. Once media server 118 locates the particular media file being requested, media server 118 is able to retrieve that media file and stream it, forward it, or otherwise make it available to media engine 106 that is installed on processor where user 102 is currently located. Conversely if another user logs on using the same processor he or she will not be able to access the first user's bookmarked media files unless he or she bookmarks them independently of the first user. As can be seen, the interaction between the media engine 106 and media server 118 creates a robust media collection and management tool for the collection and management of media files that a specific user 102 is able to access from various locations. Media engine 106 is also able to utilize this functionality to exchange music between different users 102 as will be discussed below. The user interface according to one embodiment of the present disclosure, which carries out the functionality discussed above, will now be discussed in reference to
Individual users 102 can maintain different processors and/or devices on which they can obtain and/or listen to media files. For example, a user may maintain a processor at his or her home, a processor at his or her place of work, a portable device in his or her car and/or a media player at another location each of which is capable of accessing the network 300 and/or playing media files. In one embodiment of the present disclosure, when a user utilizes media engine 106 to access media files, the media engine is able to maintain information regarding the user and/or media files being played. This enables the user to enhance their listening experience by being able to transfer the listening experience from one location to another. For example, if a user is listening to a particular song on their home processor, and has to leave the home and go to their car, the user can maintain the status of where they were listening to the song from the media engine on their home processor and pick up from that point on their local media device in their car or media device in other location. Thus when the user leaves the processor at home, the media engine 106 saves information about what song the user was listening to and passes that information along to media server 118. When the user reconnects to the network from the second location (e.g. their car) the media engine 106 located at the second location where they currently are will query the server for the location of the music that was being listened to and will then locate that music and stream it or otherwise make it available to the second location. If for some reason, the media engine at the second location is unable to access the song from the same location because, for example, the second location does not have a connection to the location where the media file is located or the location where the media file is being streamed is currently offline, the media engine will attempt to locate that song from a different authorized location and stream it to the user at a new location. Thus it should be appreciated that this enhances a user's experience in that a user is able to enjoy an all encompassing experience wherein the experience can be extended to various different locations at various different times on the various different devices. The user interface according to one embodiment of the present disclosure, which carries out the functionality discussed above, will now be discussed in reference to
It should be noted that different components of the functionality described above can take place within different components of network 300 with information residing in different or the same components. For example, either the media engine 106 or the media server 118 can maintain any or all of the data regarding the media files as well as any location information about the media files. If the data about the media files is maintained completely on media engine 106, for example, different media engines 106 may communicate amongst themselves without any necessity to access the media server 118. Similarly, additional servers can be utilized by the network 300 to distribute the information more widely.
As can be seen in
Via pane 201, the user is also able to separately view the media stored in media database 120 by clicking the network media site tab 224. This information once again is available to media engine 106 based on the information received from media server 118 as was discussed above with reference to
In one embodiment, media database may contain media files available for lease or purchase, in which case the media server 118 would include a commerce component that gives the user an option to search for and purchase, lease, rent or otherwise obtain authorized versions of media located through media database 120. For example, if the site or server 380 accessed through tab 224 is a music seller, user can click tab 224 to be taken to a commerce site to purchase music or media to be added to user's collection, which could then be managed by the media engine. Additionally, user preference information gained through the user's interaction with the media engine may be made available to the commerce site to present recommended purchases.
It should be appreciated that although various embodiments are discussed in terms of a “my music” collection or “my music” tab, the title of this tab or collection can be anything and the “my music” nomenclature is used herein for ease of explanation.
In this exemplary embodiment, the user is also able to access an Internet Radio provider site 380 that may be available via a button or links displayed in pane 201. For example, if a user clicks upon Internet Radio Tab 226, an Internet Radio available from media server 118 or other site 380 will open allowing the user to experience various radio stations via the media engine 106. Similar to the commerce feature, user preference information gained through the user's interaction with the media engine may be made available to the radio station to influence music selections presented by the radio station. One such radio station is LAUNCHCAST, available from Yahoo! Inc. of Sunnyvale, Calif.
Alternatively, in a similar manner, the user may also be able to view a comprehensive list of the songs available on a local device 114 which can be accessed for example via compact disc tab 228 or MP3 player tab 230. This information is once again utilized by media engine 106 from the information earlier acquired by the media engine at the time of initiation, installation, or thereafter as discussed above in reference to
An embodiment also preferably allows the user the added ability to use a rating tool shown in column 208 to rate a particular song from within pane 231. For example, a user may rate a particular song that he or she really likes with four stars while giving zero stars to a song that the user does not particularly care for. Once rated, the user would be able to view his or her list of songs ordered by a particular rating. Thus a song a user particularly enjoys may be listed at the top of the list while a song that the user does not particularly care of may be moved further down.
In another embodiment, the ratings applied by a user are associated with a user identification. The user id and associated rating is stored in the user information database located on the media server. Thus, the user is able to view and access this rating from multiple processors and locations.
In further embodiments, other items may be associated with a user's identification and similarly stored in the user information database or other database residing on the media server wherein the item is accessible by the user at any location where they have a media engine and can connect to the system.
The user information database 122 is preferably made available to any application with proper access to the system, to leverage the user information and to enhance the user's experience with all aspects of the system 100/300.
By organizing and storing user information and making it available to multiple applications on system 100/300, a user need only rate a song or artist or album once, and that rating will be made available to any application or feature or function of system 100/300 that can utilize user rating data Thus, for example, if a user “rips” a song from a CD using client side music engine 106, and rates it using the user interface, e.g., pane 231, that rating will be passed to user database 122 on media server 118. When the user subsequently selects their radio station to listen to from pane 201, the radio station application (not shown) would access user database 122 and obtain that song rating and incorporate it into any programming algorithms used to program radio content for that user. The same process would apply in reverse if the user rated the song while listening to the radio. Thus, a user's preferences can be stored by and/or incorporated into various features and functions and applications available on system 100/300 without the need for the user to rate the song more than once.
Additionally, the user information may be centrally maintained or distributed, such as by maintaining all or a portion of the user information on user information database 8410 (
As will be discussed further herein, the ratings chosen by a user will allow the system to better classify music in terms of a user's particular likes or dislikes and greatly enhance a user's experience. As will also be discussed later, a user may also view or listen to other users' music by clicking on tab 234, or another user may adopt a user's ratings or preferences.
Once the user chooses a particular item of media to experience, e.g., a song, a window containing a media player 240 opens within user interface 200 (or it may be always present), to grant the user control of playing the media. The title for the particular song being played 242, as well as the artist 244, the album 246, are preferably displayed. From within this media player 240, the user has the ability to control the media by rewinding, fast forwarding or pausing a particular song using controls 250 that are common to known media players. Moreover, as the song is playing, the user has the ability to rate the song, artist and/or album by clicking on the rating tool sequence 252 and that rating will preferably be incorporated as part of the user's preferences in the user information database 122 as was discussed above.
A user 102 may also incorporate a plug-in program into the media engine 106. Access to this plug-in program may be available via a newly created tab 236 from Pane 201. These plug-ins may be programmed using known programming techniques for the purpose of making the media engine more robust in the actions that can be performed from within the media engine. Plug-ins may be provided by the provider of the media engine or a third party. In other words, the user interface and functionality according to one embodiment of the present disclosure can be based on different plug-ins, designed in various locations, designed by different people including users or operators of the Network 300 to enhance the user interface, the functionality it provides and the interaction with the media engine.
When the user has a compact disc or any other form of removable media located in device 114, the system has the ability, as can be seen in
In another embodiment the user will be given the ability to create a playlist with the album or add the album to an existing playlist. In this embodiment, the media engine 106 will also access information it might have about the album to offer the user similar albums in pane 530. Once the user has chosen to import the particular songs to his or her “my music” collection, the song(s) from the compact disc or other removable media will be copied or “ripped” by the media engine 106 to local storage or processor 103 or portable device 114, in a user selected format, or format automatically chosen, or the media file may be made available to media server 118 so that the files and/or metadata information about the media may be stored with the files relating to the user's other media. Thus these song(s) along with any other media that is in the user's “my music” collection can be accessed from any location that the user can access the media server 118 with a media engine 106. Once media server 118 has a list of all the user's “my music” collection as well as some or all of the metadata connected with the media and the location of that media, media server 118 is able to locate and provide access to those media files wherever they may reside on the network to that user at any location where the user is located. Thus, a user can easily add any media file to their “my music” collection and, assuming that proper authorization, adherence to DRM practices and other ownership or custodial issues are considered, make the media file accessible at any other location that has a media engine 106.
An alternative way, according to another embodiment, to import music from removable media device such as a compact disc into the user's “my music” collection is to click upon the displayed song title of the actual song that the user wishes to include in their “my music” collection from pane 500.
Thus, with described embodiments, a user need not continuously transport his or her media files and/or removable media to different locations since that media will be available via media engine 106, media server 118, network 300, and components and functions described herein. Additionally a user need not re-familiarize themselves with the media they liked that was available from media database 120 and to select media that they have previously listened to and wish to listen to again. Rather all of the media the user has chosen will reside on or be available via their media engine 106 and be available to a particular user as part of his or her media collection any time or anywhere that the user wishes.
In practice according to one embodiment of the present disclosure, a virtual collection of media is created for each user 102. As can be seen with reference to
When a user wishes to retrieve a particular piece of media that has been bookmarked, the media server would access the media identifier from user information database 122 and then use that identifier to stream or otherwise make available the particular media file to the user. Step 640. Thus, it should be appreciated that a user can easily identify particular media that he or she wishes to make available at various locations and the media server can easily retrieve that media based on the information stored about the particular user in user information database 122. There is, therefore, no need for the media server to begin searching for the particular media file but rather once the identifier for the media file is stored and attached to a particular user's information, media server 118 can easily make available the bookmarked media as if it was locally stored. Information database 122 may also contain several alternate locations on the network where a media file may be located, thus providing alternate sources if one particular source is unavailable for some reason.
As can be seen in
If media server 118 is able to locate a tethered download for the particular media file, media server 118 retrieves the tethered download and downloads it to the user's processor 103 cache or local storage. Once the tethered download is acquired, media engine 106 plays the media file for the user. Step 706. If no tethered download is available, media engine 106 queries media server 118 to see if the particular media file is available to the particular user from the media database 120. Step 707. Preferably, access to media in the media database 120 can be based on a tiered membership or based on different subscription fees. Therefore, media available in the media database may not be available to each particular user based on the subscription that the user had within the network 300. If the media file is available within media database 120 and the particular user requesting the file has a subscription or authorization level that permits access to the media file, the file is streamed by media server 118 from media database 120 to the user's processor 103 and is played with the media engine 106. Step 708. If however the media file requested is not available to the particular user, the media server could optionally stream to the user's processor 103 a sample of the media file. Step 709. In one embodiment a message may be displayed to the user indicating that this media file is unavailable because of the user's subscription or membership and information can be given to the user with instructions explaining how to enhance their subscription or membership.
Additional features of the user interface 200 will now be discussed with reference to
In one embodiment of the present disclosure, one or more images are stored in an image database 370. These images can be stored in any image format heretofore and hereinafter known. These images can for example be images of album covers, artists, or other images related to a piece of media. Along with the media stored in media database 120, a URL or other pointer is stored that links or points to an image in the image database 370. Therefore in this embodiment, when a user chooses a particular piece of media, the media engine 106 is able to retrieve any associated images (e.g., album cover, artist picture) and display those images for the user.
It should also be appreciated that the display of the album covers for the user offers an enhanced experience wherein the user is both able to listen to the music as well as view the album cover as if the user actually was holding the compact disc or other media in their hands. Once the user chooses an album from the interface 801, all of the songs on that album may be displayed as can be seen in
In another embodiment the user is able to browse through the songs in his or her “my music” collection by genre. For example, as can be seen in
To further enhance a user's experience, a user may pick a particular artist in the selected genre from pane 1004 to view songs from the particular artist. For example, as can be seen in
In another embodiment, the user may browse the media available in his or her “my music” collection by searching for a song and/or album via the song and/or album's artist as is shown in
As was discussed earlier in reference to
In one embodiment, the system may automatically rate songs that are located locally with a predetermined rating initially when the details of the particular songs are acquired and stored by media engine 106. For example, if a piece of media is located on a user's processor 103, the system may automatically rate that song with, for example, a rating of 3 on a scale of 1 to 4. It should be understood that this will give the media that is located locally on a user's processor an automatic high rating even before the user themselves rates the song album and/or artist manually. This is because it is fairly safe to assume that, in most situations, if a particular piece of media is located locally on a user's processor, the user tends to like that particular media. Automated rating can also be based on other factors such as the user's frequency of play, rating of the genre or artist, how often the media is skipped or repeated, or other factors. The user will preferably have the ability to re-rate the media at other times, to give the media a higher or lower rating if they wish to better reflect their preferences. Additionally, in one embodiment if a user has already rated a particular song artist and/or album manually, that rating will not be overwritten by any automatic rating. Moreover, each user preferably also has the ability to decide not to incorporate any automatic ratings and rather only utilize their manual ratings. Thus, as can be seen from the previously discussed embodiments, the media engine enables the loading of user's media as well as classifying that media with a more personalized classification every time the user accesses the media engine. Also, the user is able to combine both his or her manual ratings and indications of likes or dislikes in media available through the media server with the local media located on the user's processor without having to manually key in the ratings for that local media, subject to later fine tuning by the user.
In one exemplary embodiment of an automatic rating scheme, the following factors are used to create an automated rating for a user when a user adds music to his or her “my music” collection. When a user adds music to their “my music” collection from for example the media database 120, a peripheral device 114, a hard drive located on Processor 103, and/or another user's “my music” collection, the album and/or artist associated with that song or group of songs is given a set rating based on the number of songs from that album or artist that are already in the user's “my music” collection. For instance, any album that has three or more tracks in the user's “my music” collection will be given a rating of 70 on a scale from 1-100. Similarly, any artist with greater than 10 and less than 20 songs in the user's “my music” collection will be given a rating of 70 on a scale from 1-100. Lastly, any artist with greater than 20 songs in the user's “my music” collection will be will be given a rating of 80 on a scale from 1-100. This rating scheme assures that artists and/or albums that are most popular in the use's “my music” collection will be rated higher than those that are less popular. It should be noted that in different embodiments, different automatic rating scales can be applied to songs albums and/or artists when they are stored in a user's “my music” collection. Additionally automatic ratings may be stored separately or flagged differently in the ratings database 320 so as to distinguish between the automatically and manually created ratings.
Another feature according to one embodiment of the present disclosure will now be discussed with reference to
A user can further narrow the search results by clicking on an artist in pane 1803. For example, if a user clicks on the artist “The Clash” from pane 1803 as can be seen in
In another embodiment, a user may search for songs within their “my music” collection (or elsewhere on the network) by a variable that is only in the album name of a song by selecting album from drop-down menu 1802 and inserting the search criteria in field 1801. As can be seen in
Additional similar embodiments that can search a user's “my music” collection (or elsewhere on the network) by artist, songs, and/or genre will now be discussed with reference to
In another embodiment, a user can search for a particular term in a song name as can be seen in
In another embodiment, as can be seen in
In one embodiment, the search field 1801 would populate automatically based on prior searches performed by the user, by for example filling in the word “Jones”, once the user types “JO”. Once again, as in previous embodiments the user has the ability to play any of the songs that are returned by the search by clicking on the particular song in the list in pane 1805. Additionally, if the album is already located in a user's “my music” collection, the add button 526 may not appear and rather an empty box 527 or icon which might for example say “already in my music” may appear instead. These searches may be carried out either in the user's “my music” collection, in the full collection available from the media database 120 or anywhere throughout the network 300.
As was discussed above, in one embodiment of the present disclosure, a user can access media files located in media database 120 via media server 118. Media engine 106 can generate for the user a listing of the music located on media database 120 in a similar way to the way the music located in a particular user's “my music” collection is displayed. As can be seen in
In an additional embodiment, a user may search through songs located on media database 120 or elsewhere on the network for a particular term located in either the song name, artist name, or album name. For example, as can be seen in
In one embodiment, in addition to a user's ability to click on button 3518 to automatically add the particular song to the user's “my music” collection, the user also has the ability to purchase a particular song for a pre-determined price via button 3524 in column 3522. For example, if the user enjoys a particular song that is returned by the search, and wishes to purchase that song, the user would click on button 3524. In one embodiment, the user would be directed to a payment page (not shown) where, for example the user can enter credit card information. From this page for example a user can complete an e-commerce transaction in a known manner to purchase a download and/or streaming rights, or other access rights in the song and/or album including a tangible copy. It should be appreciated that this combines the use of the media engine and the experiencing of media files with the ability to conduct commerce and purchase copies of and/or rights to the media that a user is listening to. This pricing information can be stored along with each media file metadata to make it easily accessible to the media engine 106. In other words, when displaying a song for a user, the media engine 106 knows whether the user already has the media file on their computer and the media engine 106 also knows from the media server 118, using commerce functions 330 located on network 300 what the proper pricing for that song is and which vendors may be selling that song. Thus, the user, through a user-friendly interface and by the click of a mouse, is able to purchase a particular song or album right from within the media engine 106, obviating the necessity of “shopping around” for a particular song or album. In another embodiment, as can be seen in
In another embodiment, the user may search for songs within the media database 120 by a variable that is only in the song's artist name by selecting artist from the drop-down menu 3504 and entering the search term into field 3502. As can be seen in
In another embodiment, a user may search for songs within the media database 120 by a variable that is only in the album name of a song by selecting album from drop-down menu 3504 and entering the search criteria in field 3502. As can be seen in
In another embodiment, the user is given the ability to search for information related to another user of the media engine 106 to access songs that the other user prefers. As was discussed above, different users 102 are distinctly identified by a user name or other identifier, which is also preferably associated with various preferences for that user stored on the network. Thus, in one embodiment, a user can search for another user's music using the other user's identifier, or by the system finding the user or users that fit certain search criteria based on user preference and/or user behavior. For example as can be seen in
The use and creation of playlists in connection with one embodiment of the present disclosure will now be discussed with reference to
Utilizing the user's “my music” collection or other media available through media server 118 or network 300, a user can easily create a playlist by ordering songs in a way that the user wishes to play them or some other order. This order of songs is then stored in a playlist database 340, on processor 103, in both locations, or other locations on network 300. For example, if a user wishes to create a playlist of Song 6, Song 8 and Song 10 that are each in the user's “my music” collection, the media engine 106 will create a file that will contain a list of pointers that point to the location of Song 6, Song 8, and Song 10, respectively, and send that file to the playlist database 340. This location information is preferably made available as a result of the media engine's 106 initial collection of information about each of the user's available media files or may occur at the time the song is selected for inclusion in the playlist. Thus when the user wishes to access the newly formed playlist, the media engine is able to locate and play those songs that are in the playlist. These playlists can be accessed from any location from which a user may run media engine 106.
The ability to create a more robust and versatile playlist from a user's “my music” interface discussed above with reference to
In another embodiment a user is able to easily create a playlist consisting of songs with a particular search criteria by manually selecting each song that the user wishes to include in the particular playlist area. Thus, a user can manually utilize their “my music” collection or the network at large to create a playlist that incorporates those particular songs that the user wishes to have in a particular playlist and can then access that playlist from a variety of locations. This is facilitated once again by media engine 106 and the information compiled by the media engine about a user's available media. Similar to individual songs added to a user's “my music” collection, these playlists become accessible for the user from any location that the user has access to media engine 106.
Another embodiment of the present disclosure used to generate playlists will now be discussed with reference to
Once the affinity engine computes the affinities in accordance with criteria selected by the user, the media server 118 creates a playlist based on those affinity results. Step 4540. The media server then forwards a file containing pointers to the songs in the newly created playlist to media engine 106. Step 4550. The media engine then creates a user interface to display the songs in the playlist and grant access to those songs for the user. Step 4560.
The creation of an affinity playlist from a user's perspective will now be shown with reference to
The issue of whether users have appropriate rights to experience certain media can also be addressed by the media engine. Media engine 106 preferably contains digital rights management functionality to ensure that various copyright rights and media rights of owner's licenses are respected. Thus, while there are described herein embodiments that facilitate users sharing their media experiences, adequate controls can be incorporated into the system to frustrate unauthorized use of media. For example, media engine 106 can incorporate software and/or hardware to recognize digital rights management information that may be part of the media file and/or media metadata, and respond to users requests accordingly by granting or denying access to the media based on that user's rights. For example, as was described above, access to the songs in the media database 120 can be based on a tiered membership based on differing subscription fees. Certain users therefore will be allowed access to certain media that other users are not allowed access to. That being the case, the possibility exists that one user will forward to another user songs that the other user is not authorized to access. In such a situation, according to one embodiment of the present disclosure the second user would be alerted to this fact and be offered the ability to sign up to the appropriate subscription service or to purchase rights in the desired item of media.
In another embodiment, access, viewing capabilities, and sharing rights between users preferably depend on certain conditions being recognized by the media management systems of media server 118. In one example, access, viewing, and sharing capabilities are based upon the system first recognizing the metadata associated with the media file and whether the particular media file is available through the media management system's services (e.g. subscription or not). If the system recognizes the metadata associated with the media file and the media file is within the system's services (e.g. available on media database 120 or other authorized service 130), or within the user(s)' subscription, the media file may be shared, viewed, and accessed among users. However, if the system does not recognize the metadata of a media file and/or the media file is outside of the system's authorized offerings, the receiving user will not be able to access or view the particular media file. It is noted that these conditions are merely exemplary and the system can base access and sharing rights on other conditions such as whether the users are within a subscription plan or other DRM parameter.
In an alternate embodiment similar playlists can also be created for songs and/or artists in a similar manner. Namely as can been seen in
As was discussed above with reference to
A=the number of users who like artist A;
B=the number of users who like artist B; and
AB=the number of users who like artist A and artist B.
The affinity of artist A to artist B would equal (AB/A)×100, while the affinity of artist B to artist A equals (AB/B)×100. Through such a formula the system is able to compute the affinity or relationship between two artists. Although this formula is discussed in terms of artists, a similar formula can be used in terms of album and/or song or other item of media. Preferably, media rating data is sent to and compiled within media server 118 so the system can use that rating data and create a relationship between different media, artists, and/or albums. Once this data is compiled using the formula above, an affinity is determined between two different artists, albums, and/or songs. Once this affinity is established and stored, a playlist can be created based on that affinity. Depending on whether the user wants to create a highly similar or divergent playlist, songs or other media items can be compiled with a degree of variance based on the degree of their affinity to each other. In addition to the exemplary techniques set forth herein, other art-recognized affinity determining applications or techniques can be used or developed to identify affinities.
In an embodiment of the present disclosure, an additional factor is preferably taken into account to create the affinity playlist. This factor is the total number (N) of users 102 that are using the system. This variable factors into account cases where the affinity between one artist and another artist may be skewed by artists that are very popular versus artists that are not popular at all. For example using the above listed formula, an artist that is popular with 95% of the users may have an affinity to many more artists than an artist who is popular with only 5% of the users. The artist that is popular with 95% of the users will therefore appear to have a high affinity to nearly every other artist because an artist that has a great popularity is invariably going to have an overlap with another artist that was rated highly by many of the users of the system. Therefore, in order to balance out this equation, instead of using the equation, (AB/A)×100, the formula for determining an affinity from artist A to artist B, taking into account the popularity of an artist is (AB/A)÷(B/N) and the formula for determining the affinity between artist B and artist A factoring in the popularity of an artist is (AB/B) (A/N). This formula divides the relationship of artist A to B by the number of total users that like artist A. This lowers the affinity to an artist that is very popular while it raises the affinity to an artist that is very unpopular. In other words, an artist that is very popular will have to have a lot of users who like that artist and another artist to have a strong affinity to that artist, while an unpopular artist will need to have fewer users in common to have the same affinity. Therefore, using the above mentioned exemplary formulas, the system is capable of determining an affinity between one artist, album or song and another artist, album or song based on the likes and dislikes of other users. Based on affinity calculations and criteria selected by a user, a playlist can be created that will comprise artists, albums or songs that are most or least similar to a particular artist, album or song thereby enhancing a user's experience.
It should also be noted that affinity data can also be used to automatically generate a list of similar albums, artists or songs for a particular user. Thus, even without the creation of a playlist, in one embodiment, a user can request a list of albums similar to a particular album and based on the previously mentioned affinities data, a list of similar albums can be complied. Alternatively, the media engine 106 can also automatically recommend similar albums to a user based on this affinity data. For example, every time a user opens the media engine 106, the interface can display a list of recommended albums based on the albums' affinity to albums rated highly by the user. Thus in addition to tracking the media available to a user, the media engine 106, alone or in cooperation or combination with media server 118, is also able to intelligently recommend other media to the user based on other music that the media engine knows the user prefers.
In another embodiment, the media engine is able to manage a playlist in such a manner that the playlist is not merely played back to the user in a particular preassigned order or random order. Rather, the media engine and/or media server 118 is able to generate an order for the songs in the playlist that better reflects the user's likes and dislikes. Once again referring to
As can be seen with reference to
i=[N*(R/N)P]O.94;
N=the # of items in the list;
R=a random integer in the range [0, N];
p=a constant value used to increase the weighting on higher scoring items;
i=the chosen slot to insert the media file into.
Once the slot is determined for each particular media file, a playlist is generated based on those results. Step 4919.
According to another embodiment of the present disclosure, an additional factor that is utilized by the media engine 106 in connection with generating a playlist is artist separation. This factor allows media engine 106 to create a playlist that ensures that whenever possible, songs from a particular artist are not repeated within a playlist or at least not repeated too closely in time. It should be appreciated that although this embodiment is being discussed in terms of artist separation, a similar embodiment is also envisioned where playlists are separated by song or album separation and/or genre separation or any other factor associated with a song or media file. In order to create the artist separation, a list is tabulated by the media engine or media server that totals the number of songs for each particular artist from within songs chosen for a playlist. Once this task is completed, a minimum separation number can also be generated for each song based on the information garnered from this tabulated list. In order to create a minimum separation number, the following formula is used:
total number of songs divided by:
number of songs by the particular artist.
Thus, for each artist associated with a song in this list of media files to be included in the playlist, a minimum separation number will be generated. For example, if there are a total of 50 songs chosen by a user to be placed into a playlist, and a particular artist X is associated with 10 of those songs, the minimum separation number for artist X would be 50 divided by 10 or 5. When the playlist is generated, the media engine 106 keeps track of the last slot occupied by media file for each particular artist, the minimum separation number is then added to that slot number and no song by that particular artist will then be placed in any slot number higher than the slot number+the separation number. For example, if a song by artist X is chosen to be placed in slot number 3 in the playlist after the formula is run on that particular media file, and the minimum separation number for that particular artist is 5, when generating a playlist with artist separation, no songs by artist A will be allowed to be placed in slots 4, 5, 6, or 7, and the media engine will attempt to place that song in slot 8 or later. If a slot is chosen for a particular song that is not available, the media file will be placed in the next available slot. In one embodiment, if the end of the playlist is reached by going through this process of slot filling, the process will begin once again from the first slot in the playlist. It should be noted that any or all of the above discussed preferences can be either set by the media engine 106 or be chosen by each individual user for each individual playlist.
In another embodiment of the present disclosure, a playlist may be generated automatically based on particular criteria. In this embodiment, the system is able to create a playlist based on specific user criteria. For example, the user is able to choose different criteria such as artist, album, genre, date that the song was added to the system, last time the song was played for this particular user, rating, or other criteria, from a drop-down menu. Based on the chosen criteria, a list of modifiers is given to the user that is appropriate for those particular criteria. For example, if the criteria chosen were “date added”, the modifier list would for example included “is”, “is after”, “is before”, “on or before”, “on or after”, “is not”. All of these choices being applicable to a specific date entered by the user. On the other hand if the criteria chosen by the user were genre, then this modifier list would include choices, such as “is” or “is not,” these choices being applicable to the criteria of genre. After the modifier is chosen, the user is prompted to insert a term that would be applicable to the playlist wanted. For example, if a user chose “genre” as their criteria, “is not” as their modifier” and the word “disco” as the term, the system would automatically generate a playlist of songs in which the genre was not disco. Once again these playlists can then be accessible from any location where the user is running the media engine 106.
In one embodiment of the present disclosure, there are additional choices that may be given to a user in creating the playlist. For example, a user may be given a choice to select whether they wish to incorporate multiple conditions for their playlist or whether they would prefer a playlist that only meets a certain number of the conditions. Additionally, the user can select how long the playlist should be and whether or not to limit the playlist to a certain number of songs. Thus, if the conditions of a playlist return 1,000 songs for example and the user only wishes to have a playlist that is a length of 25 songs, the user would alleviate this problem by choosing to limit the playlist to 25 songs. The 25 songs that would be used for the playlist can either be chose at random by the media engine or can once again be selected using user selected criteria. For example, a user may further narrow the playlist by selecting that the 25 song playlist should be the 25 most highly rated songs or the 25 most recently listened to songs. Thus, the media engine can return a playlist with numerous different tiers of criteria. This eliminates the creation of a playlist that is larger than the one envisioned by the user or larger than a particular size that the user's storage medium can hold. Thus, in the previously discussed example a user would have created a 25 song playlist of the most popular or most recent songs matching the user's criteria.
Additional criteria that may be set by the user include whether the user would like the system to continuously update the playlist based on the criteria. A playlist created using this option can periodically change based on the media that is added to the system. So for example, if a playlist was created that encompassed all media where the genre was “not disco,” the composition of the playlist would change every time an additional piece of media, which was not disco, was added to the system. Thus, if a user chooses the live updating feature, the media engine may run the search criteria at fixed or variable times, or every time that the playlist is requested, in order to incorporate any new media that may have been added to the system since the last time the search was run. Thus, the user can have the ability to listen to a playlist of songs that match the conditions and criteria selected but the playlist may not necessarily consist of the same songs each time the playlist is requested. In other words, each time the playlist is selected or requested, the media engine creates the updated playlist based on the previous criteria assigned to the playlist.
An example of a user interface used in connection with the function of creation of the criteria of playlists discussed in the previous embodiment is shown in
The ability to create a criteria playlist allows the user to generate a playlist based on specific criteria and then save that playlist for later listening. Alternatively, the user can send the criteria playlist to another user via e-mail, instant messaging, peer networking, or any other communication channel known or to become known. For example, if the user creates a criteria playlist that includes the criteria, for example, of songs that were uploaded after Sep. 1, 2004 with specific criteria, one user can send the criteria to another user. The other user can use the same criteria to create his or her own playlist based on the media available to that other user. For example, if user A runs the playlist on his or her “my music” collection the playlist may return songs A, B and C, user 2 might run the same playlist criteria and be returned songs D, E and F. On the other hand, a user also has the ability to save the playlist as it was generated, namely with the same songs and or media that was generated when the user initially generated the playlist. Therefore, when communicating such a playlist, the other user will receive a file containing pointers to the location of those specific songs in network 300.
The creation of an exemplary affinity playlist according to another embodiment of the present disclosure will now be discussed with reference to
Additionally, a user is preferably given the option to choose a level of obscurity by selecting the level of obscurity on obscurity knob 7404. The obscurity of a particular song/artist or album in a measure of the degree of affinity an item has with other items in a chosen category. Obscurity is preferably determined by the collective rating or listening patterns of that song/artist/album among other users on the network, and/or through system operator input. For example, if the user wishes to create a playlist with very obscure songs, the media engine 106 will query media server 118 to find songs that have not been rated by x number of users in the last y number of days. Thus the resulting playlist will consist of songs that are obscure relative to other songs located on the network, meaning other users have not rated or listened to the song often.
After choosing the obscurity, the user is preferably also given the option to select whether they wish the playlist to be generated with a wide variety of artists and/or albums or whether the songs should mostly be from the same artist and/or album. Once the user has selected the criteria, similar to the playlists discussed previously, the user may have the option to either generate a playlist by clicking on the generate playlist button 7406 or save the criteria as a file by clicking on the “save criteria as” button 7407. Media engine 106 preferably forwards criteria to media server 118. Once the playlist is generated, the results of the playlist may be displayed in interface 7410. Additionally, similar to the previously discussed playlists, a user may be able to either play the playlist by clicking on the play button 7416, download the playlist by clicking on button 7418, add the playlist to another playlist by clicking on button 7417 or get additional information about the playlist or any song in the playlist by clicking on information button 7419. The user can save the playlist as a file by clicking on “save list as” button 7420.
In another embodiment, as can be seen in
In one embodiment of the present disclosure as is shown in
Additionally, a user may choose to publish their playlist to other users of the system by, for example, clicking on the publish playlist button 7633. By electing to publish the playlist, a user will be prompted to enter a name for the playlist. The playlist will be saved on processor 103 and/or at media server 118 or other location on the network 300. The user is preferably given the option of making the published playlist public, thus allowing other users to not only view the playlist but to listen to media listed in the playlist as well. The ability to publish a playlist has the added benefit of making the playlist completely portable by being available to all users, as it will be residing on the media server 118 or other user accessible location(s) on the network.
The publishing of a playlist according to one embodiment of the present disclosure will now be discussed with reference to
According to another embodiment in the present disclosure, as is depicted in
One exemplary user interface in connection with this functionality is depicted in
As can be seen in
Similar to the embodiments discussed in reference to
A user can further narrow search results, as can be seen in
In another embodiment, a user may search for songs within their “friend's” “my music” collection by a variable term that is in the name of a song in their “friend's” “my music” collection by selecting “song” from drop-down menu 5502 and inserting the search variable in field 5501. As can be seen in
In additional similar embodiments in which a user can search a “friend's” “my music” collection by album and/or genre will now be discussed with reference to
In another embodiment, a user can search for a particular term in the genre of songs in a “friend's” “my music” collection as can be seen in
In another embodiment, a user can search through various identifying characteristics of his or her “friend's” “my music” collection (i.e., album name, song name, artist name, genre, preference rating) for a particular search term all at once. As can be seen in
In another embodiment of the present disclosure with reference to
In this exemplary embodiment, a network is created in which a group of users utilizes their various interconnections to create a network that can be used to exchange files and/or stream information or media files between various processors. As can be seen with reference to
It should be noted when searching for a file within the network, the processors searched can include two processors that are directly connected such as processor 7110 and 7130 in
When querying message platform 116, for a listing of those other processors that can act as peers to processor 103, the messaging platform in one embodiment can also supply information about the processors state or status such as whether they are actually connected to the network at that point in time or whether they are actively receiving messages. In another embodiment, the messaging platform only supplies information that there exists certain processors that the requesting processor can connect to but not supply any information about the current state of that processor. In such an embodiment, it would be up to the processor to connect individually to each processor and/or peer and to obtain the current state. Thus, through the use of messaging and/or peer connectivity, the media engine 106 is able to incorporate a larger universe of media for a specific user, expanding a user's media file access options beyond that user's specific collection to that user's friends' collections as well.
In another embodiment, through the user interface, the user can utilize a similarity explorer function to generate a list of similar users/members, albums, artists, songs, or genres. This functionality may be performed in whole or in part by the affinity engine 350, which generates the desired list based on the user's ratings, preferences, play data, and/or explicit and/or implicit user behavior. In further embodiments, the affinity engine preferably applies a filter function or a threshold when generating the list. The threshold preferably relates to a number or amount or size of items or actions associated within each potential candidate for the similarity list. In order for the potential candidate to qualify as a suitable match for the similarity list, the candidate must preferably meet the particular threshold.
In one exemplary embodiment of using the similarity explorer function, the user can access a list of similar users or members in the network. The affinity engine preferably generates the similar members list based on the user's ratings, preferences, and/or play data. Furthermore, the affinity engine can apply a threshold when generating the similar members/users list. In one example, the threshold can be set to a predetermined number of items (genre/albums/artist/songs) a particular user has rated. For example, a user must have rated at least 20 items, and the selected as similar must have rated at least 100 items. Thus, members/users who do not meet this threshold number will not be included in the similar members/users list. Additionally, in one embodiment, the affinity calculation can ignore from the list the top N most popular artists (or album, media file, genre) when calculating a similarity between two users, as overlap on these artists (or album, media file, genre) has less value in determining overall music tastes overlap. In a further embodiment, the affinity calculation can reward or emphasize in the calculation, by giving preference to those candidate similar users who have highly rated, matching media items with respect to the user's top preferred or highly rated media items. For example, if a user's most highly rated artist (or album, media file, genre) is found to also be a candidate user's most highly rated artist (or album, media file, genre), then that candidate user is given more weight in the calculation. Thus, the candidate user is considered similar to the user and may be given more preference to be included in the similar user list. Of course, any combination of these factors in the affinity calculation are contemplated. As can be seen with reference to
In another exemplary embodiment of using the similarity explorer function, the user can access a list of similar artists. Thus, in like manner to the user similarity explorer, the affinity engine 350 generates a similar artist list based on aggregated implicit or explicit user information, or information provided by an operator of the system, but is preferably based at least in part upon the user's ratings, preferences, and/or play data. Furthermore, the affinity engine 350 can optionally apply a threshold parameter when generating the similar artists list. Thus, artists who do not meet this threshold will not be included in the similar artists list. Examples of threshold parameters are how many times a particular artist appears in a user's library or how many times an artist appears along with a particular artist(s) in a user's library. As can be seen with reference to
The explorer functionality described above may be applied to other criteria as well, beyond user and artist, to yield similar songs, albums, genres, or other criteria, utilizing a similar user interface and the affinity engine 350.
Those skilled in the art will recognize that the method and system of the present disclosure within the application may be implemented in many manners and as such is not to be limited by the foregoing exemplary embodiments and examples. In other words, functional elements being performed by a single or multiple components, in various combinations of hardware and software, and individual functions can be distributed among software applications at either the client or server level. In this regard, any number of the features of the different embodiments described herein may be combined into one single embodiment and alternate embodiments having fewer than or more than all of the features herein described are possible. Functionality may also be, in whole or in part, distributed among multiple components, in manners now known or to become known. Thus, myriad software/hardware/firmware combinations are possible in achieving the functions, features, interfaces and preferences described herein. Moreover, the scope of the present disclosure covers conventionally known and features of those variations and modifications through the system component described herein as would be understood by those skilled in the art.
This application is a continuation of U.S. patent application Ser. No. 15/142,620 filed on Apr. 29, 2016, which is a continuation of U.S. patent application Ser. No. 11/363,779 filed Feb. 27, 2006, which claims the benefit of U.S. Provisional Application No. 60/657,222 filed Feb. 28, 2005 and U.S. Provisional Application No. 60/678,718 filed May 5, 2005. All of the aforementioned applications are hereby incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
253743 | Mensing | Feb 1882 | A |
1235999 | Neeley | Aug 1917 | A |
1877241 | Hultman et al. | Sep 1932 | A |
2040010 | McMahon et al. | May 1936 | A |
3540111 | Wainwright | Nov 1970 | A |
3688086 | Levasseur et al. | Aug 1972 | A |
4484430 | Rossman | Nov 1984 | A |
4890925 | Kitamori et al. | Jan 1990 | A |
5055265 | Finlan et al. | Oct 1991 | A |
5124207 | Hayashi et al. | Jun 1992 | A |
5205101 | Swan et al. | Apr 1993 | A |
5493677 | Balogh et al. | Feb 1996 | A |
5566353 | Cho et al. | Oct 1996 | A |
5616876 | Cluts | Apr 1997 | A |
5623786 | Demeyer | Apr 1997 | A |
5729741 | Liaguno et al. | Mar 1998 | A |
5748956 | Lafer et al. | May 1998 | A |
5796945 | Tarabella | Aug 1998 | A |
5832501 | Kain et al. | Nov 1998 | A |
5862325 | Reed et al. | Jan 1999 | A |
5864870 | Guck | Jan 1999 | A |
5886698 | Sciammarella et al. | Mar 1999 | A |
5890152 | Rapaport et al. | Mar 1999 | A |
5892535 | Allen et al. | Apr 1999 | A |
5903892 | Hoffert et al. | May 1999 | A |
5911776 | Guck | Jun 1999 | A |
5915019 | Ginter et al. | Jun 1999 | A |
5928330 | Goetz et al. | Jul 1999 | A |
5950173 | Perkowski | Sep 1999 | A |
5964068 | O'Neill | Oct 1999 | A |
5982369 | Sciammarella et al. | Nov 1999 | A |
5983236 | Yager et al. | Nov 1999 | A |
5996015 | Day et al. | Nov 1999 | A |
6006241 | Purnaveja et al. | Dec 1999 | A |
6012068 | Boezeman et al. | Jan 2000 | A |
6064380 | Swenson et al. | May 2000 | A |
6065267 | Fisher | May 2000 | A |
6073727 | DiFranza et al. | Jun 2000 | A |
6115988 | Reisdorff | Sep 2000 | A |
6118450 | Proehl et al. | Sep 2000 | A |
6138119 | Hall et al. | Oct 2000 | A |
6157377 | Shah-Nazaroff et al. | Dec 2000 | A |
6192340 | Abecassis | Feb 2001 | B1 |
6210715 | Starling et al. | Apr 2001 | B1 |
6226672 | DeMartin et al. | May 2001 | B1 |
6232539 | Looney et al. | May 2001 | B1 |
6248946 | Dwek | Jun 2001 | B1 |
6256623 | Jones | Jul 2001 | B1 |
6292775 | Holmes | Sep 2001 | B1 |
6308204 | Nathan et al. | Oct 2001 | B1 |
6342396 | Perrin et al. | Jan 2002 | B1 |
6356971 | Katz et al. | Mar 2002 | B1 |
6389467 | Eyal | May 2002 | B1 |
6393430 | Van Ryzin | May 2002 | B1 |
6421726 | Kenner et al. | Jul 2002 | B1 |
6427140 | Ginter et al. | Jul 2002 | B1 |
6446080 | Van Ryzin | Sep 2002 | B1 |
6466918 | Spiegel et al. | Oct 2002 | B1 |
6477704 | Cremia | Nov 2002 | B1 |
6484157 | Chowdhury et al. | Nov 2002 | B1 |
6484199 | Eyal et al. | Nov 2002 | B2 |
6526411 | Ward | Feb 2003 | B1 |
6529835 | Wada et al. | Mar 2003 | B1 |
6530944 | West et al. | Mar 2003 | B2 |
6538665 | Crow et al. | Mar 2003 | B2 |
6545209 | Flannery et al. | Apr 2003 | B1 |
6549922 | Srivastava et al. | Apr 2003 | B1 |
6574609 | Downs et al. | Jun 2003 | B1 |
6587127 | Leeke et al. | Jul 2003 | B1 |
6587837 | Spagna et al. | Jul 2003 | B1 |
6605770 | Yamane et al. | Aug 2003 | B2 |
6609096 | De Bonet et al. | Aug 2003 | B1 |
6609105 | Van Zoest et al. | Aug 2003 | B2 |
6609253 | Swix et al. | Aug 2003 | B1 |
6612231 | Shimizu et al. | Sep 2003 | B2 |
6618144 | Reed | Sep 2003 | B1 |
6654367 | Kaufman | Nov 2003 | B1 |
6657116 | Gunnerson | Dec 2003 | B1 |
6662231 | Drosset et al. | Dec 2003 | B1 |
6677968 | Appelman | Jan 2004 | B1 |
6686970 | Windle | Feb 2004 | B1 |
6691162 | Wick | Feb 2004 | B1 |
6699724 | West et al. | Mar 2004 | B1 |
6708154 | Acero | Mar 2004 | B2 |
6710366 | Lee et al. | Mar 2004 | B1 |
6712051 | Lakin | Mar 2004 | B1 |
6718308 | Nolting | Apr 2004 | B1 |
6721489 | Benyamin et al. | Apr 2004 | B1 |
6728729 | Jawa et al. | Apr 2004 | B1 |
6731312 | Robbin | May 2004 | B2 |
6735628 | Eyal et al. | May 2004 | B2 |
6738766 | Peng | May 2004 | B2 |
6748395 | Picker et al. | Jun 2004 | B1 |
6760042 | Zetts | Jul 2004 | B2 |
6760721 | Chasen et al. | Jul 2004 | B1 |
6763345 | Hempleman et al. | Jul 2004 | B1 |
6772212 | Lau et al. | Aug 2004 | B1 |
6816944 | Peng | Nov 2004 | B2 |
6820238 | Auflick et al. | Nov 2004 | B1 |
6829033 | Hose et al. | Dec 2004 | B2 |
6850256 | Crow et al. | Feb 2005 | B2 |
6859838 | Puranik et al. | Feb 2005 | B1 |
6892196 | Hughes | May 2005 | B1 |
6922759 | Garritsen | Jul 2005 | B1 |
6928419 | Stefik et al. | Aug 2005 | B2 |
6928423 | Yamanaka | Aug 2005 | B1 |
6928433 | Goodman | Aug 2005 | B2 |
6933433 | Porteus et al. | Aug 2005 | B1 |
6941324 | Plastina et al. | Sep 2005 | B2 |
6943324 | Ahuja | Sep 2005 | B2 |
6944612 | Roustant et al. | Sep 2005 | B2 |
6968179 | De Vries et al. | Nov 2005 | B1 |
6972363 | Georges et al. | Dec 2005 | B2 |
6987221 | Platt | Jan 2006 | B2 |
7007438 | Shields et al. | Mar 2006 | B1 |
7013290 | Ananian | Mar 2006 | B2 |
7020704 | Lipscomb et al. | Mar 2006 | B1 |
7024424 | Platt et al. | Apr 2006 | B1 |
7043477 | Mercer et al. | May 2006 | B2 |
7047406 | Schleicher et al. | May 2006 | B2 |
7051212 | Ginter et al. | May 2006 | B2 |
7054888 | Lachapelle et al. | May 2006 | B2 |
7058608 | Nagata et al. | Jun 2006 | B1 |
7065342 | Rolf | Jun 2006 | B1 |
7076652 | Ginter | Jul 2006 | B2 |
7095854 | Ginter et al. | Aug 2006 | B1 |
7096234 | Plastina et al. | Aug 2006 | B2 |
7099846 | Ishibashi et al. | Aug 2006 | B1 |
7100199 | Ginter et al. | Aug 2006 | B2 |
7107395 | Ofek et al. | Sep 2006 | B1 |
7111009 | Gupta et al. | Sep 2006 | B1 |
7113767 | Vaeaenaenen | Sep 2006 | B2 |
7113912 | Stefik et al. | Sep 2006 | B2 |
7120800 | Ginter et al. | Oct 2006 | B2 |
7124302 | Ginter et al. | Oct 2006 | B2 |
7127454 | Deguchi | Oct 2006 | B2 |
7133845 | Ginter et al. | Nov 2006 | B1 |
7136874 | Mercer et al. | Nov 2006 | B2 |
7146404 | Kay et al. | Dec 2006 | B2 |
7159000 | Plastina et al. | Jan 2007 | B2 |
7159174 | Johnson et al. | Jan 2007 | B2 |
7216008 | Sakata | May 2007 | B2 |
7216290 | Goldstein | May 2007 | B2 |
7219308 | Novak et al. | May 2007 | B2 |
7227073 | Kim | Jun 2007 | B2 |
7256341 | Plastina et al. | Aug 2007 | B2 |
7262357 | Plastina et al. | Aug 2007 | B2 |
7275063 | Horn | Sep 2007 | B2 |
7277852 | Iyoku et al. | Oct 2007 | B2 |
7281034 | Eyal | Oct 2007 | B1 |
7290285 | McCurdy et al. | Oct 2007 | B2 |
7310350 | Shao et al. | Dec 2007 | B1 |
7345234 | Plastina et al. | Mar 2008 | B2 |
7358434 | Plastina et al. | Apr 2008 | B2 |
7395339 | Kirkland | Jul 2008 | B2 |
7409639 | Dempski et al. | Aug 2008 | B2 |
7421656 | Fong et al. | Sep 2008 | B2 |
7426537 | Lee et al. | Sep 2008 | B2 |
7454406 | Kaplan et al. | Nov 2008 | B2 |
7464112 | Plastina et al. | Dec 2008 | B2 |
7472353 | Wolff et al. | Dec 2008 | B1 |
7483958 | Elabbady et al. | Jan 2009 | B1 |
7521625 | Robbin et al. | Apr 2009 | B2 |
7533105 | Mitchell et al. | May 2009 | B2 |
7562301 | Wolff et al. | Jul 2009 | B1 |
7590659 | Mercer et al. | Sep 2009 | B2 |
7599610 | Benyamin et al. | Oct 2009 | B2 |
7617278 | Edelman et al. | Nov 2009 | B1 |
7620467 | Lee et al. | Nov 2009 | B2 |
7623648 | Oppenheim et al. | Nov 2009 | B1 |
7647613 | Drakoulis et al. | Jan 2010 | B2 |
7667124 | Robbin et al. | Feb 2010 | B2 |
7672975 | Plastina et al. | Mar 2010 | B2 |
7680814 | Mercer et al. | Mar 2010 | B2 |
7681035 | Ayars et al. | Mar 2010 | B1 |
7685204 | Rogers | Mar 2010 | B2 |
7685642 | Gilliam et al. | Mar 2010 | B2 |
7698223 | Padawer et al. | Apr 2010 | B2 |
7698288 | Kawabe et al. | Apr 2010 | B2 |
7698654 | Fong et al. | Apr 2010 | B2 |
7707221 | Dunning et al. | Apr 2010 | B1 |
7711838 | Boulter et al. | May 2010 | B1 |
7725494 | Rogers et al. | May 2010 | B2 |
7725498 | Barsness et al. | May 2010 | B2 |
7739601 | Wong et al. | Jun 2010 | B1 |
7739723 | Rogers et al. | Jun 2010 | B2 |
7743329 | Rahman et al. | Jun 2010 | B2 |
7747620 | Beaupre | Jun 2010 | B2 |
7757171 | Wong et al. | Jul 2010 | B1 |
7757182 | Elliott et al. | Jul 2010 | B2 |
7765192 | Svendsen | Jul 2010 | B2 |
7765245 | Nichols et al. | Jul 2010 | B2 |
7769903 | Robbin et al. | Aug 2010 | B2 |
7774713 | Mital et al. | Aug 2010 | B2 |
7779355 | Erol et al. | Aug 2010 | B1 |
7797446 | Heller et al. | Sep 2010 | B2 |
7797454 | Apostolopoulos et al. | Sep 2010 | B2 |
7805677 | Takakuwa et al. | Sep 2010 | B2 |
7818350 | New et al. | Oct 2010 | B2 |
7827259 | Heller et al. | Nov 2010 | B2 |
7827312 | Ramswamy et al. | Nov 2010 | B2 |
7831605 | Plastina et al. | Nov 2010 | B2 |
7840292 | Buil et al. | Nov 2010 | B2 |
7840620 | Vignoli et al. | Nov 2010 | B2 |
7844820 | Martinez | Nov 2010 | B2 |
7844835 | Ginter et al. | Nov 2010 | B2 |
7856404 | Evans et al. | Dec 2010 | B2 |
7860342 | Levien et al. | Dec 2010 | B2 |
7860830 | Mirrashidi et al. | Dec 2010 | B2 |
7882110 | Bahr | Feb 2011 | B2 |
7890598 | Lakamp | Feb 2011 | B2 |
7895334 | Tu et al. | Feb 2011 | B1 |
7904417 | Anderson et al. | Mar 2011 | B2 |
7921116 | Finkelstein et al. | Apr 2011 | B2 |
7925682 | Moore et al. | Apr 2011 | B2 |
7925976 | Shin et al. | Apr 2011 | B2 |
7934159 | Rahman et al. | Apr 2011 | B1 |
7937450 | Janik | May 2011 | B2 |
7937671 | Leibhold et al. | May 2011 | B2 |
7956272 | Wysocki et al. | Jun 2011 | B2 |
7958441 | Heller et al. | Jun 2011 | B2 |
7966551 | Plastina et al. | Jun 2011 | B2 |
7970799 | Arrouye et al. | Jun 2011 | B2 |
7971261 | Pestoni | Jun 2011 | B2 |
7984505 | Read | Jul 2011 | B2 |
7985911 | Oppenheimer et al. | Jul 2011 | B2 |
7991271 | Candelore | Aug 2011 | B2 |
8028038 | Weel | Sep 2011 | B2 |
8028323 | Weel | Sep 2011 | B2 |
8041186 | Black | Oct 2011 | B1 |
8046424 | Novik et al. | Oct 2011 | B2 |
8126938 | Cohen et al. | Feb 2012 | B2 |
8161411 | Robbin et al. | Apr 2012 | B2 |
8316128 | MacLeod et al. | Nov 2012 | B2 |
8375008 | Gomes | Feb 2013 | B1 |
8447697 | Wang et al. | May 2013 | B2 |
8554799 | Ott et al. | Oct 2013 | B2 |
8601572 | King et al. | Dec 2013 | B2 |
8644684 | Yoshida et al. | Feb 2014 | B2 |
8677507 | Ginter et al. | Mar 2014 | B2 |
8712825 | Holcombe et al. | Apr 2014 | B1 |
10019500 | Spiegelman et al. | Jul 2018 | B2 |
20010013061 | DeMartin et al. | Aug 2001 | A1 |
20010014882 | Stefik et al. | Aug 2001 | A1 |
20010018858 | Dwek | Sep 2001 | A1 |
20010025256 | Oliphant et al. | Sep 2001 | A1 |
20010033296 | Fullerton et al. | Oct 2001 | A1 |
20010042107 | Palm | Nov 2001 | A1 |
20010047290 | Petras et al. | Nov 2001 | A1 |
20020001395 | Davis et al. | Jan 2002 | A1 |
20020002039 | Qureshey et al. | Jan 2002 | A1 |
20020002468 | Spagna | Jan 2002 | A1 |
20020002498 | Hatakeyama | Jan 2002 | A1 |
20020003879 | Ibaraki et al. | Jan 2002 | A1 |
20020010652 | Deguchi | Jan 2002 | A1 |
20020010759 | Hitson et al. | Jan 2002 | A1 |
20020013784 | Swanson | Jan 2002 | A1 |
20020013852 | Janik | Jan 2002 | A1 |
20020040326 | Spratt | Apr 2002 | A1 |
20020042834 | Kremens et al. | Apr 2002 | A1 |
20020045960 | Phillips et al. | Apr 2002 | A1 |
20020049037 | Christensen et al. | Apr 2002 | A1 |
20020049594 | Moore et al. | Apr 2002 | A1 |
20020049731 | Kotani | Apr 2002 | A1 |
20020052885 | Levy | May 2002 | A1 |
20020052933 | Leonhard et al. | May 2002 | A1 |
20020054134 | Kelts | May 2002 | A1 |
20020069746 | Taira et al. | Jun 2002 | A1 |
20020072967 | Jacobs et al. | Jun 2002 | A1 |
20020078029 | Pachet | Jun 2002 | A1 |
20020080842 | An et al. | Jun 2002 | A1 |
20020083031 | De Varax et al. | Jun 2002 | A1 |
20020083060 | Wang et al. | Jun 2002 | A1 |
20020087887 | Busam et al. | Jul 2002 | A1 |
20020089529 | Robbin | Jul 2002 | A1 |
20020093884 | Hochendoner | Jul 2002 | A1 |
20020097401 | Maleki et al. | Jul 2002 | A1 |
20020099731 | Abajian | Jul 2002 | A1 |
20020103797 | Goel et al. | Aug 2002 | A1 |
20020107803 | Lisanke et al. | Aug 2002 | A1 |
20020107806 | Higashi et al. | Aug 2002 | A1 |
20020107850 | Sugimoto et al. | Aug 2002 | A1 |
20020108115 | Palmer | Aug 2002 | A1 |
20020113824 | Myers | Aug 2002 | A1 |
20020120925 | Logan | Aug 2002 | A1 |
20020122051 | Hose et al. | Sep 2002 | A1 |
20020126135 | Ball et al. | Sep 2002 | A1 |
20020128856 | Stefik et al. | Sep 2002 | A1 |
20020134220 | Yamane et al. | Sep 2002 | A1 |
20020138619 | Ramaley et al. | Sep 2002 | A1 |
20020143907 | Tsurubayashi | Oct 2002 | A1 |
20020151327 | Levitt | Oct 2002 | A1 |
20020152173 | Rudd | Oct 2002 | A1 |
20020152267 | Lennon | Oct 2002 | A1 |
20020152278 | Pontenzone et al. | Oct 2002 | A1 |
20020154759 | Ishii | Oct 2002 | A1 |
20020156546 | Ramaswamy | Oct 2002 | A1 |
20020156704 | Kolls | Oct 2002 | A1 |
20020172457 | Tapalian et al. | Nov 2002 | A1 |
20020175931 | Holtz et al. | Nov 2002 | A1 |
20020184111 | Swanson | Dec 2002 | A1 |
20020184623 | Hodge et al. | Dec 2002 | A1 |
20020188363 | Ashy | Dec 2002 | A1 |
20020194195 | Fenton et al. | Dec 2002 | A1 |
20020194260 | Headley et al. | Dec 2002 | A1 |
20030001880 | Holtz et al. | Jan 2003 | A1 |
20030009423 | Wang et al. | Jan 2003 | A1 |
20030009427 | Wang et al. | Jan 2003 | A1 |
20030014477 | Oppenheimer et al. | Jan 2003 | A1 |
20030014767 | Stumphauzer et al. | Jan 2003 | A1 |
20030023427 | Cassin et al. | Jan 2003 | A1 |
20030023975 | Schrader et al. | Jan 2003 | A1 |
20030028488 | Mohammed et al. | Feb 2003 | A1 |
20030028489 | Williamson | Feb 2003 | A1 |
20030028539 | Nunome et al. | Feb 2003 | A1 |
20030031176 | Sim | Feb 2003 | A1 |
20030037035 | Deguchi | Feb 2003 | A1 |
20030041108 | Henrick et al. | Feb 2003 | A1 |
20030046273 | Deshpande | Mar 2003 | A1 |
20030046399 | Boulter et al. | Mar 2003 | A1 |
20030049866 | Bushway et al. | Mar 2003 | A1 |
20030050834 | Caplan | Mar 2003 | A1 |
20030050919 | Brown et al. | Mar 2003 | A1 |
20030051149 | Robert | Mar 2003 | A1 |
20030051238 | Barone | Mar 2003 | A1 |
20030055743 | Murcko | Mar 2003 | A1 |
20030065639 | Fiennes et al. | Apr 2003 | A1 |
20030071851 | Unger et al. | Apr 2003 | A1 |
20030088571 | Ekkel | May 2003 | A1 |
20030093790 | Logan et al. | May 2003 | A1 |
20030096302 | Yguerabide et al. | May 2003 | A1 |
20030110228 | Xu et al. | Jun 2003 | A1 |
20030110502 | Creed et al. | Jun 2003 | A1 |
20030112432 | Yguerabide et al. | Jun 2003 | A1 |
20030120928 | Cato et al. | Jun 2003 | A1 |
20030124733 | Bushway et al. | Jul 2003 | A1 |
20030131252 | Barton | Jul 2003 | A1 |
20030135464 | Mourad et al. | Jul 2003 | A1 |
20030135513 | Quinn et al. | Jul 2003 | A1 |
20030151618 | Johnson et al. | Aug 2003 | A1 |
20030158737 | Csicsatka | Aug 2003 | A1 |
20030158780 | Isobe et al. | Aug 2003 | A1 |
20030167236 | Stefik et al. | Sep 2003 | A1 |
20030172090 | Asunmaa et al. | Sep 2003 | A1 |
20030174861 | Levy et al. | Sep 2003 | A1 |
20030174923 | Arnold et al. | Sep 2003 | A1 |
20030176937 | Janky et al. | Sep 2003 | A1 |
20030182254 | Plastina et al. | Sep 2003 | A1 |
20030182315 | Plastina et al. | Sep 2003 | A1 |
20030182328 | Paquette et al. | Sep 2003 | A1 |
20030182428 | Li et al. | Sep 2003 | A1 |
20030182579 | Leporini et al. | Sep 2003 | A1 |
20030191753 | Hoch | Oct 2003 | A1 |
20030195863 | Marsh | Oct 2003 | A1 |
20030200452 | Tagawa et al. | Oct 2003 | A1 |
20030202431 | Kim et al. | Oct 2003 | A1 |
20030212710 | Guy | Nov 2003 | A1 |
20030217170 | Nelson et al. | Nov 2003 | A1 |
20030219225 | Horii et al. | Nov 2003 | A1 |
20030220830 | Myr | Nov 2003 | A1 |
20030221167 | Goldstein et al. | Nov 2003 | A1 |
20030221541 | Platt | Dec 2003 | A1 |
20030222907 | Heikes et al. | Dec 2003 | A1 |
20030223411 | De La Fuente | Dec 2003 | A1 |
20030225834 | Lee et al. | Dec 2003 | A1 |
20030225848 | Heikes et al. | Dec 2003 | A1 |
20030228134 | Kim et al. | Dec 2003 | A1 |
20030229537 | Dunning et al. | Dec 2003 | A1 |
20030231188 | Cohen et al. | Dec 2003 | A1 |
20030233363 | Cohen et al. | Dec 2003 | A1 |
20030233379 | Cohen | Dec 2003 | A1 |
20030235402 | Seo et al. | Dec 2003 | A1 |
20030236582 | Zamir et al. | Dec 2003 | A1 |
20030236711 | Deguchi | Dec 2003 | A1 |
20030236832 | McIntyre et al. | Dec 2003 | A1 |
20030237043 | Novak et al. | Dec 2003 | A1 |
20040002938 | Deguchi | Jan 2004 | A1 |
20040003046 | Grabelsky et al. | Jan 2004 | A1 |
20040003090 | Deeds | Jan 2004 | A1 |
20040003398 | Donian et al. | Jan 2004 | A1 |
20040003403 | Marsh | Jan 2004 | A1 |
20040003706 | Tagawa et al. | Jan 2004 | A1 |
20040008872 | Goldberg | Jan 2004 | A1 |
20040019497 | Volk et al. | Jan 2004 | A1 |
20040019658 | Plastina et al. | Jan 2004 | A1 |
20040024652 | Buhse et al. | Feb 2004 | A1 |
20040024886 | Saxena | Feb 2004 | A1 |
20040031058 | Reisman | Feb 2004 | A1 |
20040034582 | Gilliam et al. | Feb 2004 | A1 |
20040034849 | Cohen et al. | Feb 2004 | A1 |
20040041836 | Zaner et al. | Mar 2004 | A1 |
20040049694 | Candelore | Mar 2004 | A1 |
20040055445 | Iyoku et al. | Mar 2004 | A1 |
20040056901 | March et al. | Mar 2004 | A1 |
20040057348 | Shteyn et al. | Mar 2004 | A1 |
20040057449 | Black | Mar 2004 | A1 |
20040064209 | Zhang | Apr 2004 | A1 |
20040064476 | Rounds | Apr 2004 | A1 |
20040064512 | Arora et al. | Apr 2004 | A1 |
20040064692 | Kahn et al. | Apr 2004 | A1 |
20040064832 | Tsukidate et al. | Apr 2004 | A1 |
20040068606 | Kim et al. | Apr 2004 | A1 |
20040070678 | Toyama et al. | Apr 2004 | A1 |
20040073427 | Moore | Apr 2004 | A1 |
20040078357 | Lachapelle et al. | Apr 2004 | A1 |
20040078383 | Mercer et al. | Apr 2004 | A1 |
20040083273 | Madison et al. | Apr 2004 | A1 |
20040088348 | Yeager et al. | May 2004 | A1 |
20040103153 | Chang et al. | May 2004 | A1 |
20040109137 | Bubie et al. | Jun 2004 | A1 |
20040117442 | Thielen | Jun 2004 | A1 |
20040117455 | Kaminsky et al. | Jun 2004 | A1 |
20040117843 | Karaoguz et al. | Jun 2004 | A1 |
20040123725 | Kim | Jul 2004 | A1 |
20040128308 | Obrador | Jul 2004 | A1 |
20040128353 | Goodman et al. | Jul 2004 | A1 |
20040137882 | Forsyth | Jul 2004 | A1 |
20040143604 | Glenner et al. | Jul 2004 | A1 |
20040146275 | Takata et al. | Jul 2004 | A1 |
20040148353 | Karaoguz et al. | Jul 2004 | A1 |
20040148564 | Takata et al. | Jul 2004 | A1 |
20040162871 | Pabla et al. | Aug 2004 | A1 |
20040162878 | Lewis et al. | Aug 2004 | A1 |
20040165006 | Kirby et al. | Aug 2004 | A1 |
20040172456 | Green et al. | Sep 2004 | A1 |
20040174905 | Caspi et al. | Sep 2004 | A1 |
20040177115 | Hollander et al. | Sep 2004 | A1 |
20040177116 | McConn et al. | Sep 2004 | A1 |
20040177319 | Horn | Sep 2004 | A1 |
20040181487 | Hanson | Sep 2004 | A1 |
20040181517 | Jung et al. | Sep 2004 | A1 |
20040181540 | Jung et al. | Sep 2004 | A1 |
20040184778 | Jung et al. | Sep 2004 | A1 |
20040196315 | Swearingen et al. | Oct 2004 | A1 |
20040199387 | Wang et al. | Oct 2004 | A1 |
20040199471 | Hardjono | Oct 2004 | A1 |
20040199514 | Rosenblatt et al. | Oct 2004 | A1 |
20040199667 | Dobbins | Oct 2004 | A1 |
20040200261 | Shuman | Oct 2004 | A1 |
20040201609 | Obrador | Oct 2004 | A1 |
20040202335 | Lee et al. | Oct 2004 | A1 |
20040205028 | Verosub | Oct 2004 | A1 |
20040215718 | Kazmi et al. | Oct 2004 | A1 |
20040215731 | Tzann-En et al. | Oct 2004 | A1 |
20040220791 | Lamkin et al. | Nov 2004 | A1 |
20040220926 | Lamkin et al. | Nov 2004 | A1 |
20040221299 | Gibbs et al. | Nov 2004 | A1 |
20040221322 | Shen et al. | Nov 2004 | A1 |
20040223606 | Enete et al. | Nov 2004 | A1 |
20040224675 | Puskoor et al. | Nov 2004 | A1 |
20040226039 | Jung et al. | Nov 2004 | A1 |
20040228618 | Yoo et al. | Nov 2004 | A1 |
20040230672 | Zuckerberg et al. | Nov 2004 | A1 |
20040231003 | Cooper et al. | Nov 2004 | A1 |
20040236568 | Guillen et al. | Nov 2004 | A1 |
20040243592 | Bill | Dec 2004 | A1 |
20040252400 | Blank et al. | Dec 2004 | A1 |
20040252604 | Johnson et al. | Dec 2004 | A1 |
20040254669 | Badar | Dec 2004 | A1 |
20040254887 | Jacoby | Dec 2004 | A1 |
20040255330 | Logan | Dec 2004 | A1 |
20040260753 | Regan | Dec 2004 | A1 |
20040260761 | Leaute et al. | Dec 2004 | A1 |
20040260835 | Welk | Dec 2004 | A1 |
20040267552 | Gilliam et al. | Dec 2004 | A1 |
20040267812 | Harris et al. | Dec 2004 | A1 |
20050004985 | Stochosky | Jan 2005 | A1 |
20050004995 | Stochosky | Jan 2005 | A1 |
20050015389 | Novak et al. | Jan 2005 | A1 |
20050015713 | Plastina et al. | Jan 2005 | A1 |
20050015807 | Young | Jan 2005 | A1 |
20050021398 | McCleskey et al. | Jan 2005 | A1 |
20050021418 | Marcus et al. | Jan 2005 | A1 |
20050021470 | Martin et al. | Jan 2005 | A1 |
20050021678 | Simyon et al. | Jan 2005 | A1 |
20050021750 | Abrams | Jan 2005 | A1 |
20050027539 | Weber et al. | Feb 2005 | A1 |
20050030937 | Wick et al. | Feb 2005 | A1 |
20050038707 | Roever et al. | Feb 2005 | A1 |
20050038724 | Roever et al. | Feb 2005 | A1 |
20050038794 | Piersol | Feb 2005 | A1 |
20050038814 | Iyengar et al. | Feb 2005 | A1 |
20050038819 | Hicken et al. | Feb 2005 | A1 |
20050038877 | Gupta et al. | Feb 2005 | A1 |
20050044229 | Brown et al. | Feb 2005 | A1 |
20050044574 | Lau et al. | Feb 2005 | A1 |
20050044893 | Coon et al. | Mar 2005 | A1 |
20050050446 | Miura et al. | Mar 2005 | A1 |
20050055472 | Krzyzanowski et al. | Mar 2005 | A1 |
20050060264 | Schrock et al. | Mar 2005 | A1 |
20050060350 | Baum et al. | Mar 2005 | A1 |
20050065912 | Cafrelli et al. | Mar 2005 | A1 |
20050065935 | Chebolu et al. | Mar 2005 | A1 |
20050071780 | Muller et al. | Mar 2005 | A1 |
20050076303 | Vaananen et al. | Apr 2005 | A1 |
20050076307 | Robbin | Apr 2005 | A1 |
20050080807 | Beilinson et al. | Apr 2005 | A1 |
20050086309 | Galli et al. | Apr 2005 | A1 |
20050086606 | Blennerhassett et al. | Apr 2005 | A1 |
20050091069 | Chuang | Apr 2005 | A1 |
20050091283 | Debique et al. | Apr 2005 | A1 |
20050091359 | Soin et al. | Apr 2005 | A1 |
20050091694 | Rambo | Apr 2005 | A1 |
20050096018 | White et al. | May 2005 | A1 |
20050097006 | Nyako | May 2005 | A1 |
20050102191 | Heller | May 2005 | A1 |
20050108176 | Jarol et al. | May 2005 | A1 |
20050108320 | Lord et al. | May 2005 | A1 |
20050108754 | Carhart et al. | May 2005 | A1 |
20050108770 | Karaoguz et al. | May 2005 | A1 |
20050114324 | Mayer | May 2005 | A1 |
20050114374 | Juszkiewicz et al. | May 2005 | A1 |
20050119976 | Taylor et al. | Jun 2005 | A1 |
20050122397 | Henson et al. | Jun 2005 | A1 |
20050123268 | Kawaguchi et al. | Jun 2005 | A1 |
20050131811 | Ranzini et al. | Jun 2005 | A1 |
20050132288 | Kirn et al. | Jun 2005 | A1 |
20050137984 | Nguyen et al. | Jun 2005 | A1 |
20050138543 | Liu | Jun 2005 | A1 |
20050144189 | Edwards et al. | Jun 2005 | A1 |
20050146996 | Roman | Jul 2005 | A1 |
20050149484 | Fox et al. | Jul 2005 | A1 |
20050149872 | Fong et al. | Jul 2005 | A1 |
20050154764 | Riegler et al. | Jul 2005 | A1 |
20050154988 | Proehl et al. | Jul 2005 | A1 |
20050160111 | Plastina et al. | Jul 2005 | A1 |
20050165795 | Myka et al. | Jul 2005 | A1 |
20050172001 | Zaner et al. | Aug 2005 | A1 |
20050177716 | Ginter et al. | Aug 2005 | A1 |
20050182855 | Apostolopoulos et al. | Aug 2005 | A1 |
20050192871 | Galuten et al. | Sep 2005 | A1 |
20050192904 | Candelore | Sep 2005 | A1 |
20050197906 | Kindig et al. | Sep 2005 | A1 |
20050197961 | Miller et al. | Sep 2005 | A1 |
20050198193 | Halme | Sep 2005 | A1 |
20050198317 | Byers | Sep 2005 | A1 |
20050210396 | Galli | Sep 2005 | A1 |
20050210507 | Hawkins et al. | Sep 2005 | A1 |
20050216443 | Morton et al. | Sep 2005 | A1 |
20050216855 | Kopra et al. | Sep 2005 | A1 |
20050223170 | Ushijima et al. | Oct 2005 | A1 |
20050223329 | Schwartz et al. | Oct 2005 | A1 |
20050227676 | De Vries et al. | Oct 2005 | A1 |
20050228665 | Kobayashi et al. | Oct 2005 | A1 |
20050234875 | Auerbach et al. | Oct 2005 | A1 |
20050234995 | Plastina et al. | Oct 2005 | A1 |
20050240494 | Cue | Oct 2005 | A1 |
20050240615 | Barsness et al. | Oct 2005 | A1 |
20050240661 | Heller et al. | Oct 2005 | A1 |
20050246651 | Krzanowski | Nov 2005 | A1 |
20050246662 | Torrey et al. | Nov 2005 | A1 |
20050251565 | Weel | Nov 2005 | A1 |
20050251566 | Weel | Nov 2005 | A1 |
20050251576 | Weel | Nov 2005 | A1 |
20050251807 | Weel | Nov 2005 | A1 |
20050262186 | Szeto et al. | Nov 2005 | A1 |
20050262204 | Szeto et al. | Nov 2005 | A1 |
20050262529 | Neogi et al. | Nov 2005 | A1 |
20050262989 | Franzblau | Dec 2005 | A1 |
20050273399 | Soma et al. | Dec 2005 | A1 |
20050276277 | Pace | Dec 2005 | A1 |
20050276570 | Reed | Dec 2005 | A1 |
20050288991 | Hubbard et al. | Dec 2005 | A1 |
20050289111 | Tribble et al. | Dec 2005 | A1 |
20060008256 | Khedouri et al. | Jan 2006 | A1 |
20060010240 | Chuah | Jan 2006 | A1 |
20060020662 | Robinson | Jan 2006 | A1 |
20060021065 | Kamperman et al. | Jan 2006 | A1 |
20060026634 | Lachapelle et al. | Feb 2006 | A1 |
20060031770 | McMenamin et al. | Feb 2006 | A1 |
20060039255 | Seo et al. | Feb 2006 | A1 |
20060040609 | Petschke | Feb 2006 | A1 |
20060041627 | Tu | Feb 2006 | A1 |
20060041844 | Homiller | Feb 2006 | A1 |
20060053194 | Schneider et al. | Mar 2006 | A1 |
20060056324 | Hyyppa et al. | Mar 2006 | A1 |
20060080103 | Breemen | Apr 2006 | A1 |
20060085751 | O'Brien et al. | Apr 2006 | A1 |
20060088292 | Guillen et al. | Apr 2006 | A1 |
20060095502 | Lewis et al. | May 2006 | A1 |
20060095848 | Naik | May 2006 | A1 |
20060095852 | Trepess et al. | May 2006 | A1 |
20060100924 | Tevanian | May 2006 | A1 |
20060107297 | Toyama et al. | May 2006 | A1 |
20060122946 | Fahrny et al. | Jun 2006 | A1 |
20060123058 | Mercer et al. | Jun 2006 | A1 |
20060123113 | Friedman | Jun 2006 | A1 |
20060129533 | Purvis | Jun 2006 | A1 |
20060130117 | Lee et al. | Jun 2006 | A1 |
20060133768 | Ellis | Jun 2006 | A1 |
20060143084 | Donnelli et al. | Jun 2006 | A1 |
20060143236 | Wu | Jun 2006 | A1 |
20060156239 | Jobs et al. | Jul 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060167804 | Aydar | Jul 2006 | A1 |
20060167807 | Aydar et al. | Jul 2006 | A1 |
20060167985 | Albanese et al. | Jul 2006 | A1 |
20060167991 | Heikes et al. | Jul 2006 | A1 |
20060168340 | Heller et al. | Jul 2006 | A1 |
20060170759 | Roever et al. | Aug 2006 | A1 |
20060173825 | Hess et al. | Aug 2006 | A1 |
20060173838 | Garg et al. | Aug 2006 | A1 |
20060173974 | Tang | Aug 2006 | A1 |
20060174008 | Abanami | Aug 2006 | A1 |
20060190410 | Harper | Aug 2006 | A1 |
20060190616 | Mayerhofer et al. | Aug 2006 | A1 |
20060195403 | New et al. | Aug 2006 | A1 |
20060195462 | Rogers | Aug 2006 | A1 |
20060195512 | Rogers et al. | Aug 2006 | A1 |
20060195513 | Rogers et al. | Aug 2006 | A1 |
20060195521 | New et al. | Aug 2006 | A1 |
20060195789 | Rogers et al. | Aug 2006 | A1 |
20060195790 | Beaupre et al. | Aug 2006 | A1 |
20060212541 | Ueshima et al. | Sep 2006 | A1 |
20060218195 | Lachapelle et al. | Sep 2006 | A1 |
20060239131 | Nathan et al. | Oct 2006 | A1 |
20060242073 | Padawer et al. | Oct 2006 | A1 |
20060242259 | Vallabh | Oct 2006 | A1 |
20060265421 | Ranasinghe et al. | Nov 2006 | A1 |
20060268667 | Jellison et al. | Nov 2006 | A1 |
20060271794 | Nonaka et al. | Nov 2006 | A1 |
20060282858 | Csicsatka | Dec 2006 | A1 |
20060294571 | Moore et al. | Dec 2006 | A1 |
20070005422 | Levien et al. | Jan 2007 | A1 |
20070005423 | Levien et al. | Jan 2007 | A1 |
20070005651 | Levien et al. | Jan 2007 | A1 |
20070005653 | Marsh | Jan 2007 | A1 |
20070006099 | Johnson et al. | Jan 2007 | A1 |
20070011206 | Gupta et al. | Jan 2007 | A1 |
20070016599 | Plastina et al. | Jan 2007 | A1 |
20070016865 | Johnson et al. | Jan 2007 | A1 |
20070044137 | Bennett et al. | Feb 2007 | A1 |
20070050409 | Bugir et al. | Mar 2007 | A1 |
20070050413 | Kominek et al. | Mar 2007 | A1 |
20070067427 | Bugir et al. | Mar 2007 | A1 |
20070073596 | Alexander et al. | Mar 2007 | A1 |
20070074118 | Robbin et al. | Mar 2007 | A1 |
20070074619 | Vergo | Apr 2007 | A1 |
20070078777 | Demartini et al. | Apr 2007 | A1 |
20070078896 | Hayashi et al. | Apr 2007 | A1 |
20070083380 | Martinez | Apr 2007 | A1 |
20070083558 | Martinez | Apr 2007 | A1 |
20070083762 | Martinez | Apr 2007 | A1 |
20070094139 | Martinez | Apr 2007 | A1 |
20070124680 | Robbin et al. | May 2007 | A1 |
20070130544 | Kim et al. | Jun 2007 | A1 |
20070136240 | Wang et al. | Jun 2007 | A1 |
20070143365 | D'Souza et al. | Jun 2007 | A1 |
20070143740 | Hoerentrup et al. | Jun 2007 | A1 |
20070150499 | D'Souza et al. | Jun 2007 | A1 |
20070156792 | D'Souza et al. | Jul 2007 | A1 |
20070156793 | D'Souza et al. | Jul 2007 | A1 |
20070159934 | Weon | Jul 2007 | A1 |
20070162502 | Thomas et al. | Jul 2007 | A1 |
20070174321 | Viikari et al. | Jul 2007 | A1 |
20070191108 | Brunet De Courssou et al. | Aug 2007 | A1 |
20070198363 | Quoc et al. | Aug 2007 | A1 |
20070198364 | Quoc et al. | Aug 2007 | A1 |
20070198426 | Yates | Aug 2007 | A1 |
20070203984 | Alhusseini et al. | Aug 2007 | A2 |
20070226365 | Hildreth et al. | Sep 2007 | A1 |
20070247979 | Brillon et al. | Oct 2007 | A1 |
20070263865 | Cohen et al. | Nov 2007 | A1 |
20070266049 | Cohen et al. | Nov 2007 | A1 |
20070271184 | Niebert et al. | Nov 2007 | A1 |
20070274519 | Cohen et al. | Nov 2007 | A1 |
20070276757 | Cohen et al. | Nov 2007 | A1 |
20070294295 | Finkelstein et al. | Dec 2007 | A1 |
20070294305 | Cohen et al. | Dec 2007 | A1 |
20070294720 | Cohen et al. | Dec 2007 | A1 |
20070299877 | Cohen et al. | Dec 2007 | A1 |
20080010083 | Cohen et al. | Jan 2008 | A1 |
20080013859 | Cohen et al. | Jan 2008 | A1 |
20080027747 | McGovern et al. | Jan 2008 | A1 |
20080027909 | Gang et al. | Jan 2008 | A1 |
20080028422 | Cohen et al. | Jan 2008 | A1 |
20080033979 | Vignoli et al. | Feb 2008 | A1 |
20080046439 | Miller et al. | Feb 2008 | A1 |
20080052104 | Cohen et al. | Feb 2008 | A1 |
20080052161 | Cohen et al. | Feb 2008 | A1 |
20080059530 | Cohen et al. | Mar 2008 | A1 |
20080077954 | Cohen et al. | Mar 2008 | A1 |
20080086379 | Dion et al. | Apr 2008 | A1 |
20080086380 | Cohen et al. | Apr 2008 | A1 |
20080092168 | Logan et al. | Apr 2008 | A1 |
20080133576 | Hempleman et al. | Jun 2008 | A1 |
20080162641 | Chandra et al. | Jul 2008 | A1 |
20080178238 | Khedouri et al. | Jul 2008 | A1 |
20080193101 | Agnihotri et al. | Aug 2008 | A1 |
20080201299 | Lehikoinen et al. | Aug 2008 | A1 |
20080209231 | Kim et al. | Aug 2008 | A1 |
20080215882 | Coldicott et al. | Sep 2008 | A1 |
20080229399 | O'Neil et al. | Sep 2008 | A1 |
20080235142 | Gonze et al. | Sep 2008 | A1 |
20080269931 | Martinez | Oct 2008 | A1 |
20080313233 | Cohen et al. | Dec 2008 | A1 |
20090024619 | Dallmeier et al. | Jan 2009 | A1 |
20090037243 | Cohen et al. | Feb 2009 | A1 |
20090037278 | Cohen et al. | Feb 2009 | A1 |
20090070213 | Miller et al. | Mar 2009 | A1 |
20090106696 | Duarte | Apr 2009 | A1 |
20090138484 | Ramos et al. | May 2009 | A1 |
20090150199 | Cohen et al. | Jun 2009 | A1 |
20090150444 | Cohen et al. | Jun 2009 | A1 |
20090151004 | Cohen et al. | Jun 2009 | A1 |
20090151008 | Cohen et al. | Jun 2009 | A1 |
20090158155 | Quinn et al. | Jun 2009 | A1 |
20090177654 | Beaupre et al. | Jul 2009 | A1 |
20090204475 | Cohen et al. | Aug 2009 | A1 |
20090210946 | Cohen et al. | Aug 2009 | A1 |
20090217343 | Bellwood et al. | Aug 2009 | A1 |
20090235364 | Cohen et al. | Sep 2009 | A1 |
20090259623 | Mooneyham et al. | Oct 2009 | A1 |
20090300480 | Cohen et al. | Dec 2009 | A1 |
20090307201 | Dunning et al. | Dec 2009 | A1 |
20100008500 | Lisanke et al. | Jan 2010 | A1 |
20100017885 | Cohen et al. | Jan 2010 | A1 |
20100154065 | Cohen et al. | Jun 2010 | A1 |
20100172540 | Davis et al. | Jul 2010 | A1 |
20100185306 | Rhoads | Jul 2010 | A1 |
20100205166 | Boulter et al. | Aug 2010 | A1 |
20100321519 | Bill | Dec 2010 | A1 |
20110185042 | Wohlert et al. | Jul 2011 | A1 |
20110235801 | Peterka et al. | Sep 2011 | A1 |
20110239280 | Chandra et al. | Sep 2011 | A1 |
20110247077 | Nguyen et al. | Oct 2011 | A1 |
20110271116 | Martinez | Nov 2011 | A1 |
20110307832 | Audet | Dec 2011 | A1 |
20110317985 | Black | Dec 2011 | A1 |
20120011592 | Loeytynoja et al. | Jan 2012 | A1 |
20120087637 | Logan et al. | Apr 2012 | A1 |
20120331386 | Hicken et al. | Dec 2012 | A1 |
20130055408 | Hall et al. | Feb 2013 | A1 |
20130173656 | Spiegelman et al. | Jul 2013 | A1 |
20130179949 | Shapiro | Jul 2013 | A1 |
20140002462 | Jiang et al. | Jan 2014 | A1 |
20140310407 | Zhang et al. | Oct 2014 | A1 |
20170064408 | Ketola et al. | Mar 2017 | A1 |
Number | Date | Country |
---|---|---|
1176840 | Jan 2002 | EP |
1489800 | Dec 2004 | EP |
1548740 | Jun 2005 | EP |
2000020434 | Jan 2001 | JP |
2001022844 | Jan 2001 | JP |
2001160003 | Jun 2001 | JP |
2001515617 | Sep 2001 | JP |
2001527668 | Dec 2001 | JP |
2002133147 | May 2002 | JP |
2003006364 | Jan 2003 | JP |
2003233690 | Aug 2003 | JP |
2004005309 | Jan 2004 | JP |
20011175272 | Aug 2001 | KR |
0054187 | Sep 2000 | WO |
0233579 | Apr 2002 | WO |
02071678 | Sep 2002 | WO |
2004046874 | Jun 2004 | WO |
2005071569 | Aug 2005 | WO |
Entry |
---|
Brown, Janelle; “MP3 free-for-all”; [Online] XP002219000; Retrieved from the Internet http;//groups.google.com/groups?selm=Pine.GSU.4,10,10002050020300,16171-100000%40adore.lightlink.com&output=gplain; retrieved on Oct. 30, 2002; 6 pages. |
Epema, D. H. J., et al. “Music2Share—Copyright—Compliant Music Sharing in P2P Systems” Proceedings of the IEEE, col. 92, No. 6; Jun. 1, 2004; pp. 961-970. |
Guterman, Jimmy: “Will AOL Tame Aimster?—file sharing system piggyback's on AOL instant messaging—Company Business and Marketing”; [Online] XP002532806; Dec. 18, 2000; Retrieved from the Internet http://findarticles.com/articles/mi_mOHWW/is_51_3/ai_68156086/ retrieved on Jun. 18, 2009; 3 pages. |
Yang B et al; “Comparing Hybrid peer-to-peer systems” Proceedings of the 27th VLDB Conference, Roma, Italy; Sep. 11, 2001; pp. 561-570. |
Stauffer. “How to do everything with iTunes for Macintosh and Windows.” Published Feb. 27, 2004, 11 pages. |
Mac Observer, “iTunes 4 Tip—Sharing iTunes libraries over IP; It's not just for Rendezvous,” Published Apr. 29, 2003, to MacObserver.com, 2 pages. |
Lienhart, Rainer, et al., “Improving Media Services on P2P Networks,” IEEE Internet Computing, Jan.-Feb. 2002, pp. 73-77. |
Macedonia, Michael, “Distributed File Sharing: Barbarians at the Gates?”, Computer, vol. 33, No. 8, Aug. 2000, pp. 99-101.C. |
Swierk, Edward, et al., “The Roma Personal Metadata Services”, Mobile Networks and Applications, vol. 7, No. 5, Oct. 2002, pp. 407-418. |
Qian, Yuechen, et al., “Exploring the Potentials of Combing Photo Annotating Tasks with Instant Messaging Fun”, MUM 2004, College Park, MD, Oct. 27-29, 2005, pp. 11-17. |
Regan, Tim, et aL, “Media Center Buddies: Instant Messaging Around a Media Center”, NordiCHI '04, Tampere, Finland, Oct. 23-27, 2004, pp. 141-144. |
Gottesman, Ben Z., “IM Your Photos”, PCMag.com, Dec. 11, 2003, pp. 1-2 (downloaded from:www.pcmag.com/printarticle2/0,1217,a=114405,OO.asp. |
Bassoli, Arianna, et al., “TunA: A Mobile Music Experience to Foster Local Interatctions”, UbiComp 2003, Seattle, WA, Oct. 12-15, 2003, pp. 1-2. |
Grinter, Rebecca E., et al., “Instant Messaging in Teen Life”, CSCW″02, New Orleans, LA, Nov. 16-20, 2002, pp. 21-30. |
Qian, Yuechen, et al., “Turning Photo Annotating Tasks into Instant Messaging Fun: Prototyping, User Trials and Roadmapping”, ICEC 2004, LCNS 3166, vol. 3166/2004, Springer, Berlin, Aug. 4, 2004, pp. 610-613. |
Coursey, David, “My Favorite Ways to Share Digital Photos”, ZDNet, Nov. 7, 2003, pp. 1-3. (downloaded from:review.zdnet.com/AnchorDesk/4520-7298_16-5103567.html). |
Bolcer, Gregory Alan., “Magi: An Architecture for Mobile and Disconnected Workflow”, IEEE Internet Computing, vol. 4, Issue 3, May/Jun. 2000, pp. 46-54. |
Dunn, Jon W., et al., “Variations:A Digital Music Library System at Indiana University”, DL 99, Berkeley, CA, 1999, pp. 12-19. |
Rajani, Rakhi E., et al., “Viewing and Annotating Media with MemoryNet”, CHI 2004, Vienna, Austria, Apr. 24-29, 2004, pp. 1517-1520. |
Microsoft Computer Dictionary, 4th Edition, Microsoft Press, Redmond, Wa, 1999, p. 348. |
David Bainbridge, Sall Jo Cunningham, and J. Stephen Downie—“Visual Collaging of Music in a Digital Library” http://hdl.handle.net/10289/43—In Proceedings: Fifth International Conference on Music Information Retrieval. ISMIR 2004: Oct. 10-14, 2004, Barcelona, Spain. (c) 2004 Universitat Pompeu Fabra n—(pp. 1-6). |
Mark van Setten and Erik Ottmans—“Demonstration of a Distributed MPEG-7 Video Search and Retrieval Application in the Educational Domain” —Proceeding Multimedia ″01 Proceedings of the ninth ACM international conference on Multimedia 2001 ACM Sep.-Oct. 5, 2001, Ottawa, Canada—(pp. 595-596). |
XSPF: XML Shareable Playlist Format: Specifications—The XSPF Playlist Format, version 0, xspf.org/specs, May 2004, 14 pages. |
XSPF: XML Shareable Playlist Format: Applications—Yahoo! Music Jukebox (Windows), xspf.org/spplications, donloaded Apr. 13, 2011, 7 pages. |
Drucker, Steven M., et al., MediaBrowser: Reclaiming the Shoebox, AVI '04, Gallipoli, Italy, May 25-28, 2004, pp. 433-436. |
Hayes, Conor, et al., “Context Boosting Collaborative Recommendation”, Knowledge-Based Systems, vol. 17, Issues 2-4, May 2004, pp. 131-138. |
Pachet, Francois, et al., “Content Management for Electronic Music Distribution”, Communications of the ACM, vol. 46, No. 4, Apr. 2003, pp. 71-75. |
Tzanetakis, George, “Musescape: A Tool for Changing Music Collections into Libraries”, ECDL 2003, LNCS 2769, Springer-Verlag, Berlin, Feb. 26, 2004, pp. 412-421. |
Pfeiffer, Silvia, et al., ““Annodex: A Simple Architecture to Enable Hyperlinking, SearchandRetrieval of Time-Continuous Data on the Web””, MIR″03, Berkeley, CA, Nov. 7, 2003, pp. 87-93. |
Cano, Pedro, et al., “MTG-DB: A Repository for Music Audio Processing”, WEDELMUSIC ″04, Sep. 13-14, 2004, pp. 2-9. |
Vinet, Hugues, et al., “The CUIDADO Project”, IRCAM, 2002, pp. 1-7. |
Bayardo, Roberto J., et al., “Peer-to-Peer Sharing of Web Applications”, WWW 2003, Budapest, Hungary, May 20-24, 2003, pp. 1-2. |
Microsoft Computer Dictionary, 5th Edition, Microsoft Press Redmond WA, 2002, pp. 19, 410, 539 and 542. |
Torrens, Marc, et al., “Visualizing and Exploring Music Libraries”, Universitat Pompeu Fabra, 2004, pp. 1-8. |
Maniar, Nipan, et al., “Dynamic Streaming Media—Creating Custom Programmes in Real-time”, ACE '04, Singapore, Jun. 3-5, 2004, pp. 349. |
Gradman, Eric, “Distributed Social Software”, Dec. 12, 2003, pp. 1-10. |
Pachet, Francois, et al., “Popular Music Access: The Sony Music Browser”, Journal of the American Society for Information Science and Technology, vol. 55, Issue 12, May 13, 2004, pp. 1037-1044. |
Wolz, Ursula, et al., “r-Music, A Collaborative Music DJ and Ad Hoc Networks”, wedelmusic ″04, Sep. 13-14, 2004, pp. 144-150. |
Liu, Qiong, et al., “Digital Rights Managemetn for Content Distribution”, Proc. of the Australasian Information Security Vorkshop, Conf. on ACSW Frontiers 2003, vol. 21, Adelaide, Australia, 2003, pp. 49-58. |
Crossen, Andrew, et al., “Flytrap: Intelligent Group Music Recommendation”, RIDE-VE '99, Sydney, Australia, Mar. 23-24, 1999, pp. 148-155. |
Hauver, David B., et al., “Flycasting: Using Collaborative Filtering to Generate a Playlist for Online Radio”, WEDELMUSIC″01, Nov. 23-24, 2001, pp. 123-130. |
Ku, William, et al., “Survey on the Technological Aspects of Digital Rights Management”, ISC 2004, LNCS 3225, Springer Berlin, Sep. 21, 2004, pp. 391-403. |
Liang, Qianhui, et al., “A United Approach to Discover Multimedia Web Services”, IsMSE ″03, Dec. 10-12, 2003, pp. 62-69. |
Microsoft Computer Dictionary, 4th Edition, Microsoft Press, Redmond, WA, 1999, pp. 348 and 461. |
Mclean et al. (“Interoperability between information and Learning Enviroments—Bridging the Gaps, A Joint White Paper on behalf of the IMS Global Learning Consortium and the Coalition for Networked Information”, Jun. 28, 2003, 13 pages). |
Lundgren, Henrik, et al., “A Distributed Instant Messaging Architecture Based on the Pastry Peer-to-Peer Routing Substrate”, SNCNW 2003, 2003, pp. 1-3. |
Bassoli, Andrea, et al., “tuna: Local Music Sharing with Handheld Wi-Fi Device” Proc. of the 5th Wireless World Conf., 2004, pp. 1-23. |
Aberer, Karl, “P-Grid: A Self-Organizing Access Structure for P2P Information System”, CoopIS 2001, LNCS 2172, Springer-Verlag, Berlin Germany, 2001, pp. 179-194. |
Mei, Hsing, et al., “PP-COSE: A P2P Community Search Scheme”, CIT ″04, Sep. 14-16, 2005, pp. 1-8. |
Isaacs, Ellen, et al., “Mobile Instant Messaging Through Hubbub”, Communications of the ACM. vol. 45, Issue 9, Sep. 2002, pp. 68-72. |
Bach, Erik, et al., “Bubbles: Navigating Multimedia Content in Mobile Ad-hoc Networks”, ACM 1-58113-826-1/03/12, 2003, pp. 73-80. |
Milojicic, Dejan S., et al. “Peer-to-Peer Computing”, HPL-2002-57, 2002, pp. I and 1-51. |
Moore, Julian, “tuna: Shared Audio Experience”, Masters Thesis, University of Limerick, Sep. 2004, pp. i-x and 1-100. |
Kawarasaki, Masatoshi, et al. “Metadata Associated Network Services and Capabilities”, Proc. Int. Conf. on Dublin Core and Metadata for e-Communities, Firenze University Press, 2002, pp. 225-227. |
Good, Nathaniel S., et al., “Usability and Privacy: A study of KaZaA P2P File-Sharing”, CHI 2003, Ft. Lauderdale, FL, vol. 5, No. 1, Apr. 5-10, 2003, pp. 137-144. |
Hjelsvold Rune, et al., “Web-Based Personalization and Management of Interactive Video”, WWW 10, Hong Kong, May 1-5, 2001, pp. 129-139. |
Lee, Kyung Hee, et al., “Requirements and Referential Software Architecture for home Server based Inter-Home Multimedia Collaboration Services”, IEEE transactions on Consumer Electronics, vol. 50, No. 1, Feb. 2004, pp. 145-150. |
Haneef, Anwar M., et al., “ANMoLe—An Adaptive Mltimedia Content Deliver Middleware Architecture for Heterogeneous Mobile Multi Device Neighborhoods”, Multimedia Tools and Applications, vol. 22, No. 2, Feb. 2004, pp. 171-186. |
Swain, Michael J., “Searching for Multimedia on the World Wide Web”, IEEE Conf. on Multimedia Computing and Systems, vol. 1Jun. 7-11, 1999, pp. 32-37. |
Yi, B.K. Subramanya, S.R.—“Enhancing personal communications with multimedia”—Browse JournalsandMagazines>Computer>vol. 37, Issue:6—Date of Publication: Jun. 21, 2004—pp. 79-81. |
John Zimmerman—Carnegie Mellon University, Pittsburgh, PA—“Exploring the role of emotion in the interaction design of digital music players”—Proceeding DPPI ″03 Proceedings of the 2003 international conference on Designing pleasurable products and interfaces—Jun. 23-26, 2003—pp. 152-153. |
Imad M Abbadi, Chris J. Mitchell, “Digital rights management using a mobile phone”, Aug. 2007, ICEC″07: Proceedings of the ninth international conference on Electronic commerce, Publisher: ACM, pp. 185-194. |
Miser et al, “iPod+iTunes Starter Kit”, published by Que, First printing, Oct. 2004, copyright 2005 Que Publishing. |
Davies, Nigel, et al., “Supporting Adaptive Video Applications in Mobile Environments”, IEEE Communications Magazine, vol. 36, Issue 6, Jun. 1998, pp. 138-143. |
Richard Griscom, “Distant Music: Delivering Audio over the Internet” Published in Notes, vol. 59, No. 3, Mar. 2003, total 23 pages. |
New Rhapsody Lets Consumers Listen to and Share Music for Free, Legally, Seattle, Apr. 26 /PRNewswire-FirstCall/,printed out by Nov. 27, 2014, total 5 pages. |
EPO: “Notice from the European Patent Office dated Oct. 1, 2007 concerning business methods”, Official Journal of the European Patent Office, vol. 30, No. 11, Nov. 1, 2007, pp. 592-593, total 2 pages. |
Foreign Communication From a Counterpart Application, European Application No. EP 06736092, Supplementary European Search Report dated Aug. 20, 2009, 3 pages. |
Foreign Communication From a Counterpart Application, European Application No. EP 06736090, Supplementary European Search Report dated Jun. 18, 2009, 4 pages. |
Foreign Communication From a Counterpart Application, European Application No. EP 06815840, Supplementary European Search Report dated Sep. 2, 2009, 2 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US2006/006440, International Preliminary Report on Patentability dated Sep. 25, 2007, 5 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US2006/006934, International Preliminary Report on Patentability dated Sep. 11, 2007, 4 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US2006/006932, International Preliminary Report on Patentability dated Mar. 17, 2009, 7 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US06/06683, International Search Report and Written Opinion dated Oct. 19, 2007, 8 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US2006/006687, Notification Concerning Submission or Transmittal of Priority Document dated Jul. 20, 2006, 1 page. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US06/06685, International Search Report dated Feb. 11, 2008, 5 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US06/07124, International Search Report dated Dec. 5, 2007, 6 pages. |
Foreign Communication From a Counterpart Application, PCT Application No. PCT/US06/006440, International Search Report dated Aug. 8, 2007, 5 pages. |
Thomas Shinder MCSE, “Create and control shared folders in Windows XP,” retrieved from:https://www.techrepublic.com/article/create-and-control-shared-folders-in-windows-xp/, Jul. 15, 2002, 19 pages. |
“Gnutella Forums—View Single Post—Windows Media Player 10 Guide_ Adding Songs to Your Library and Burning CDs,” retrieved from:http://www.gnutellaforums.com/344530-post27_html, Jun. 30, 2004, 2 pages. |
“How to Configure a Shared Folder (Windows 98/Me) (MF4680),” retrieved from: Jan. 30, 2012, 8 pages. |
Anand Lal Shimpi ,“Microsoft″s Portable Media Center Devices: Exposed,” retrieved from:https://www.anandtech.com/show/1489, Sep. 27, 2004, 3 pages. |
“Organize Your Digital Media Collection,” retrieved from:http://www.pcdigitalhome.co.uk/music/organize.htm, Apr. 9, 2020, 3 pages. |
“Winamp 5.6 Publisher Description,” retrieved from:https://winamp.soft112.com/description.html, Apr. 9, 2020, 5 pages. |
“Winamp 5.666 Full Version :: Download Software,” retrieved from:http://radioarpan.blogspot.com/2014/12/winamp-5666-full-version-download.html, Apr. 9, 2020, 4 pages. |
“Winamp Review,” retrieved from:https://www.slant.co/options/1428/˜winamp-review, Apr. 9, 2020, Slant, 7 pages. |
Counts Scott et al: “Permission Supporting Social Presence through Lightweight Photo Sharing on and Off the Desktop”, CHI 2004, Apr. 24, 2004 (Apr. 24, 2004), XP055797694, Retrieved from the Internet: URL:https://dl.acm.org/doi/pdf/10.1145/985692.985768, total 7 pages. |
Number | Date | Country | |
---|---|---|---|
20200073874 A1 | Mar 2020 | US |
Number | Date | Country | |
---|---|---|---|
60657222 | Feb 2005 | US | |
60678718 | May 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15142620 | Apr 2016 | US |
Child | 16676792 | US | |
Parent | 11363779 | Feb 2006 | US |
Child | 15142620 | US |