Dynamic talk radio program scheduling

Information

  • Patent Grant
  • 8494899
  • Patent Number
    8,494,899
  • Date Filed
    Tuesday, December 2, 2008
    16 years ago
  • Date Issued
    Tuesday, July 23, 2013
    11 years ago
Abstract
Methods and systems for dynamically scheduling a talk radio program include registering potential participants of a talk radio program service and receiving participant preferences for each of the potential participants, wherein the participant preferences include at least one topic of interest and a time availability; scheduling a talk radio program for production when a combination the participant preferences reach predetermined thresholds; and sending the potential participants a notification of the scheduling of the talk radio program.
Description
BACKGROUND OF THE INVENTION

With the popularity of MP3 type music players and smart mobile phones, talk radio programming for both terrestrial and Internet radio is expected to grow as an alternative to current levels of music content and associated royalties. Specifically, with Internet radio, small listener audience talk radio is beginning to emerge, allowing low-cost entry of hosts and radio shows into the market. These small radio shows may begin to mimic followings much like blogs and YouTube™. New business models (primarily advertisement based) are beginning to emerge to monetize consumption of this self-generated content. For example, revenue from Internet talk radio advertising has been forecasted to grow from approximately $200 million in 2006 to over $19 million in 2020.


While providing advertisement based radio programs may appear to be lucrative, putting together many such small talk radio shows in terms of determining relevant topics, and coordinating and scheduling the necessary combination of guests, hosts, and advertisers, may be cost prohibitive for many terrestrial and Internet radio stations.


BRIEF SUMMARY OF THE INVENTION

Exemplary embodiments provide methods and systems for dynamically scheduling a talk radio program. Aspects of the exemplary embodiment include: registering potential participants of a talk radio program service and receiving participant preferences for each of the potential participants, wherein the participant preferences include at least one topic of interest and a time availability; scheduling a talk radio program for production when a combination of the participant preferences reach predetermined thresholds; and sending the potential participants a notification of the scheduling of the talk radio program.





BRIEF DESCRIPTION OF SEVERAL VIEWS OF THE DRAWINGS


FIG. 1 is a diagram illustrating a system for scheduling a talk radio program.



FIG. 2 is a flow diagram illustrating a process for scheduling a talk radio program.



FIGS. 3A and 3B are block diagrams graphically illustrating an example operation of the system shown in FIG. 1.



FIG. 4 is a flow diagram illustrating a process for scheduling a talk radio program in further detail according to one exemplary embodiment.



FIG. 5 is a flow diagram illustrating the registration process.



FIG. 6 is diagram graphically illustrating an example density of registered participants over a 24-hour period based on three topics of interest.





DETAILED DESCRIPTION OF THE INVENTION

The present invention relates to dynamic talk radio program scheduling. The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements. Various modifications to the preferred embodiments and the generic principles and features described herein will be readily apparent to those skilled in the art. Thus, the present invention is not intended to be limited to the embodiments shown, but is to be accorded the widest scope consistent with the principles and features described herein.


The exemplary embodiments provide methods and systems for providing dynamic talk radio program scheduling for Internet radio and/or terrestrial radio. A service is provided whereby potential listeners, potential guests, potential hosts, and/or potential advertisers may be combined dynamically on-the-fly to schedule a talk radio program by leveraging resource parameters including topic and time availability preferences of the potential listeners, potential guests, potential hosts, and/or potential advertisers. Other resource parameters such as costs also may be utilized to determine the scheduling of a dynamic talk radio program.



FIG. 1 is a diagram illustrating a system for scheduling a talk radio program. The system 10 includes a talk radio program service 12 that may communicate with any one of a number of client devices 14 over a wired or wireless interface to a network 16, such as the Internet. The talk radio program service 12 may include a server 18, a participant preference repository 20 and a radio program repository 22; and the server 18 may execute a radio program process 24.


In operation, potential participants 26 of the talk radio program service 12 access the server 18 via one of the client devices 14. In one embodiment, each of the client devices 14 comprises one or more types of electronic devices executing one or more types of browser applications. Example types of client devices 14 may include a computer and a smart phone. Other examples may include communication-equipped MP3 players and a personal digital assistant (PDA), for instance. At least a portion of the electronic devices may include a media player application (not shown) that may be capable of playing digital audio content, such as for listening to talk radio programs created as a result of the talk radio program service 12.


According to one embodiment, different types of potential participants 26 may include any of potential listeners 26a, potential hosts 26b, potential guests 26c, and/or potential advertisers 26d that may participate in one or more talk radio programs. According to the exemplary embodiment, the radio program process 24 automatically aggregates different combinations of the potential listeners 26a, potential hosts 26b, potential guests 26c, and/or potential advertisers 26d based on resource parameters, such as preference information supplied by the potential participants 26, to dynamically schedule talk radio programs.


Although in an exemplary embodiment, the radio program process 24 is shown as a single component executing on a single server 18, the radio program process 24 may be implemented as a number of components that may execute on any number of servers or computers.



FIG. 2 is a flow diagram illustrating a process for scheduling a talk radio program, which may be performed by the radio program process 24. The process may include registering potential participants 26 of the talk radio program service 12 (block 200). In one embodiment, participant registration may be limited to the potential listeners 26a. However, in another embodiment, the participant registration may further require at least one of the potential hosts 26b, the potential guests 26c, and/or the potential advertisers 26d. In one embodiment, each of the potential participants 26 may register with the talk radio program service 12 by accessing a registration page provided by server 18 via a browser on the client device 14.


The radio program process 24 receives participant preferences for each of the potential participants 26, wherein the participant preferences include at least one topic of interest and a time availability (block 202). The radio program process 24 may then store the participant preferences for each of the potential participants 26 in the participant preference repository 20. In one embodiment, the potential participants 26 may provide their participant preferences to the talk radio program service 12 via a client application or via a browser. The radio program process 24 may receive the participant preferences at the time of registration and/or after registration.


The radio program process 24 schedules a talk radio program for production when a combination of the participant preferences reach predetermined thresholds (block 204). In one embodiment, the participant preferences may include the time availability of any of the potential participants 26, including the potential listeners 26a, the potential hosts 26b, the potential guests 26c, and/or sponsorship by the potential advertisers 26d. During scheduling, the talk radio program may be assigned a topic of interest during a particular time based on the time availability of any of the potential participants 26. For instance, an example of the participant preferences reaching predetermined thresholds may result in the talk radio program being scheduled when a particular topic of interest has been selected by a predetermined number of the potential participants during a particular time availability. The predetermined number of potential participants may depend on the type of radio program being scheduled, but may include a minimum number of participants or a highest number of participants associated with a particular topic during a particular time period when compared with other topics during the same or similar time period. The predetermined number of potential participants may also be specified with an actual number or range of numbers, e.g., 25 or more, for example.


In one embodiment, the radio talk program may be scheduled for production when resource parameters comprise one or more predetermined values. In one embodiment, the resource parameters may include the participant preferences and at least one of advertisement revenue generated from sponsorship by at least one of the potential advertisers 26d, and costs of the talk radio program, including any desired fees for the potential host(s) 26b and guest(s) 26c to participate in the talk radio program.


As used herein, scheduling of the talk radio program may include specifying the topic assigned to the talk radio program, the potential participants 26 of the talk radio program and proposing one or more dates and times for conducting the talk radio program. In one embodiment, such elements selected for inclusion into the talk radio program may be stored in the radio program repository 22.


After the talk radio program has been scheduled, the radio program process 24 sends the potential participants 26 a notification of the scheduling of the talk radio program (block 206). In one embodiment, not all of the potential participants 26 of the talk radio program service 12 are sent the notification, just the potential participants 26 determined to be available to participate in the talk radio program. The content of the notification may be different for each type of potential participant 26. For example, the notification sent to potential listeners 26a may include information about the talk radio program and may invite the potential listeners 26a to tune in. Only once potential listeners 26a tune-in to the talk radio program do they become actual listeners. The notification sent to the host(s) 26b and guest(s) 26c may include not only the information about talk radio program, but also contact information of the people in charge at the radio program service hosting the talk radio program, talking points, potential listener demographic information, and the like.



FIGS. 3A and 3B are block diagrams graphically illustrating an example operation of the system shown in FIG. 1. FIG. 3A shows various potential participants and resource parameter inputs to the talk radio program service 12 that may be considered when scheduling a dynamic talk radio program. The potential participants may include any of the potential listeners 26a, the potential hosts 26b, the potential guests 26c, and the potential advertisers 26d. The resource parameters may include participant preferences 300 of each of the registered potential listeners 26a, the potential hosts 26b and the potential guests 26c in the form of topics of interest 302 and time availability 304 for participating in a talk radio program. For the potential hosts 26b and the potential guests 26c, the participant preferences 300 may further include a desired fee 305.


In one embodiment, the registration by potential advertisers 26d may be optional. However, in the embodiment where the potential advertisers 26d do register with the talk radio program service 12, the resource parameters may also include advertiser participant preferences 306 for each advertiser 26d in the form of sponsorship availability 308, and a sponsorship indication 310 for each talk radio program the advertiser wishes to sponsor. The sponsorship availability 308 may indicate a potential advertiser's 26d availability to sponsor a talk radio program. And the sponsorship indication 310 may indicate that the potential advertiser 26d has signed up to sponsor the talk radio program and is now an actual advertiser.


The resource parameters may further include a cost 312 of each talk radio program being considered. The cost 312 may be a minimum fee set by the talk radio program service 12 for each talk radio program that is necessary to cover the fee 305, a service overhead, and any service fees. The foregoing is not intended be an exhaustive list of the resource parameters, just examples, as there may be others as well, such as location, demographics, and the like.



FIG. 3B shows the result of the talk radio program service 12 aggregating the participants into talk radio programs based on the resource parameters, including the participant preferences 300, 306, the sponsorship availability 308, and the sponsorship indication 310, and the costs 312, being predetermined values. The available potential participants 26 and their indicated topics of interest have been combined by the talk radio program service 12 to dynamically schedule three distinct talk radio programs 320, each having its own assigned topic 302, potential listeners 26a, potential host(s) 26b, potential guest(s) 26c, and potential advertiser 26d.


In one embodiment, the talk radio program service 12 may be implemented within a radio station that schedules, produces and plays the talk radio programs 320. In another embodiment, the talk radio program service 12 may only provide the scheduled talk radio programs 320 to third-party radio stations, which then produce and play the talk radio programs. In one embodiment, the talk radio programs dynamically scheduled by the talk radio program service 12 may be used to schedule not only Internet radio programs, but also terrestrial radio programs. Internet talk radio programs may be used by an Internet radio station, a satellite radio station or a multicast or a unicast internet broadcaster that provide the talk radio programs over the Internet. In this embodiment, the scheduled talk radio programs may be streamed across the Internet during production and played by an electronic device in real-time (e.g., Internet radio streams or webcasts). In another embodiment, the talk radio programs may be recorded and stored as an audio file that is downloaded to the electronic device and played (e.g., podcasts) after production.



FIG. 4 is a flow diagram illustrating a process for scheduling a talk radio program in further detail according to one exemplary embodiment. It should be noted that the blocks/steps described herein may be implemented in a different order(s) and remain within the scope of the exemplary embodiment.


In one embodiment, the radio program process 24 determines a list of topics for the talk radio programs (block 400). The radio program process 24 may determine the list of topics from a variety of sources. In one embodiment, the radio program process 24 may determine a list of topics from user interest. As the potential participants 26 register for the talk radio program service 12, the potential participants 26 may specify topics of interest. After a particular volume of potential participants 26 specifies the same or similar topic, the radio program process 24 may select the topic for inclusion into the list of topics eligible for selection. In one embodiment, the list of topics may be chosen only from the topics of interest specified by the potential listeners 26a. In another embodiment, the lists of topics may be chosen only from the topics of interest specified by the potential guests 26c and/or potential advertisers 26d. In another embodiment, the list of topics may contain all of the topics entered by all of the potential participants 26.


In another embodiment, the radio program process 24 may determine the list of topics from current events by automatically scanning a news aggregation service, such as Google News, and selecting those topics of high interest. In another embodiment, the list of topics may be determined for the radio program process 24 manually by service operators.


The radio program process 24 receives participant registrations (block 402). In one embodiment, the radio program process 24 performs the participant registration on an as needed basis when requested by a client device 14. In another embodiment, the radio program process 24 may have a set time for participant registration.



FIG. 5 is a flow diagram illustrating the registration process. It should be noted that the blocks/steps described herein may be implemented in a different order(s) and remain within the scope of the exemplary embodiment. The registration process may include the radio program process 24 receiving a request to register for service sent from a client device 14 by a potential participant 26 (block 500). The radio program process 24 may receive a profile from the participant (block 502). In one embodiment, the profile may include, but is not limited to, contact information of the participant, and the fee 305 in the case where the participant is a potential host 26b or a potential guest 26c.


The radio program process 24 may receive a topic(s) of interest for the potential participant 26 in the form of topic preferences (block 504). In the embodiment where the radio program process 24 determines the list of topics for the talk radio programs, the radio program process 24 may provide the list of topics to the client device 14 for display and selection by the potential participant 26.


The radio program process 24 may receive a schedule of time availability for the potential participant 26 to participate in the radio program(s) (block 506). The radio program process 24 may also receive notification preferences entered by the potential participant 26 (block 508). The notification preferences may specify what devices and/or applications are to receive the notifications and any necessary contact information (e.g., cell phone number for text messages).


In one embodiment, the time availability of the potential participant 26 may be specified as a schedule of one of more time availabilities generally. In another embodiment, the time availability of the participant may be specified as a schedule of one of more time availabilities that are mapped to specific topics of interest, as shown in Table I:











TABLE I






Topic
Time








Miami Dolphins
Any Time



Boston Celtics
15:00-19:00, MWF



Gas Prices
07:00-09:00, MTWTF









As shown in Table I, during the registration process, the potential participants 26 including the potential listeners 26a, the potential hosts 26b, the potential guests 26c, and the potential advertisers 26d may specify topics of interest and for each topic schedule a time availability to participate in the talk radio program(s). As described above, however, the potential hosts 26b, and the potential guests 26c also may specify their desired fee 305. The radio program process 24 may store the profile and the participant preferences of each registrant in the participant preference repository 20. The costs or price offered by the potential advertiser(s) 26d to sponsor the talk radio program(s) may also be stored in the participant preference repository 20 in one embodiment.


Referring again to FIG. 4, either during or after the participant registration process, the radio program process 24 periodically determines potential radio programs by periodically querying the participant preference repository 20 to analyze the potential listener time availability to determine that there is a sufficient cluster of potential listeners 26a available at a particular time for a particular topic to schedule a talk radio program (block 404). In one embodiment, this determination may be performed by comparing the number of the potential listeners 26a available for a particular topic to a predetermined threshold. In another embodiment, the determination may be cost based.


By way of example, consider a situation where the talk radio program service 12 offers radio programs on the half-hour. For each topic found in the participant preference repository 20, the radio program process 24 may determine if the total number of potential listeners 26a interested in the topic and available during that time period is greater than a predetermined threshold (e.g., a sufficient number to recover operational costs based on expected advertising revenue).



FIG. 6 is diagram graphically illustrating an example density of registered participants over a 24-hour period based on three topics of interest. In this example, the circles may represent potential participants 26 that submitted “Miami Dolphins” as a topic of interest and a time availability between 00:00 hours and 24:00 hours. The triangles may represent potential participants 26 that submitted “Tiger Woods” as a topic of interest and a time availability between 00:00 hours and just after 12:00 hours. And the squares may represent potential participants 26 that submitted “Celtics” as a topic of interest and a time availability between 12:00 hours and 24:00 hours. Based on this information, which may be stored in the participant preference repository 20, the radio program process 24 has identified three time periods that have sufficient participant density associated with three topics to justify the scheduling of three talk radio programs.


Referring again to FIG. 4, besides analyzing potential listener time availability, the radio program process 24 may also analyze the potential host time availability to determine that there is at least one potential hosts 26b available at the particular time for the particular topic, and optionally analyzing the potential guest time availability to determine that there is at least one potential guests 26c available at the particular time for the particular topic (block 406). The radio program process 24 may take into consideration the amount of any specified hosts/guest fee 305 when making this determination.


Once elements of each of the potential talk radio programs have been identified, including the potential listeners 26a, a potential host 26b, and the potential guests 26c, information regarding the potential talk radio programs is provided to the potential advertisers 26d such that the potential advertisers 26d can make sponsorship decisions (block 408). Using the resource parameters, including the fee 305, the radio program process 24 may be configured to set a minimum fee to cover the fees 305, service overhead and service fees, which may be included with the information made available to the potential advertisers 26d. The information may be provided to the potential advertisers 26d electronically, verbally, or by hardcopy.


Table II is an example of the information provided to potential advertisers 26d as a potential talk radio program offer.













TABLE II





Sponsor



Potential


Fee
Topic
Host
Guests
listeners



















$1765
72 Dolphins
Big Al
Don Shula
15,675


 $300
Objective-C
Richard Walsh
Brad Cox
57


$2500
Obama
Greg Evans
John Edwards
20,058









The potential advertisers 26d may select to sponsor one or more potential talk radio programs based on information in the program offer. Other information also may be provided to the potential advertisers 26d to complete the program offer such as potential listener demographics, radio program length, and host and guest profile information.


In one embodiment, the potential advertisers 26d decision to sponsor a given talk radio program may be provided to the radio program process 24 by logging into the talk radio program service 12 and updating the sponsorship indication 310 in the advertiser participant preference 306 (FIG. 3).


Referring still to FIG. 4, once all the elements for a particular potential talk radio program are in place, the radio program process 24 schedules the talk radio program by selecting the potential listeners 26a, the potential host(s) 26b, the potential guest(s) 26c, and the potential advertiser(s) 26d determined to be available for the topic (block 410). In one embodiment, the selected elements of the scheduled talk radio program may be stored in the radio program repository 22.


The program process 26 also sends a notification of the scheduling of the talk reader program to the potential listeners 26a, the potential host(s) 26b, the potential guest(s) 26c, and the potential advertiser(s) 26d determined to be available for the topic (block 412). In one embodiment, the notification may be sent via a number of mechanisms, including a short messaging service (SMS), an e-mail, a voicemail, and an in-application notification, and the like.


In one embodiment, the notification may contain program details, program times, a program score, sponsor information, and an URL to the program stream of an Internet talk radio program. In one embodiment, the program score for a particular participant may be calculated based on how specifically the radio program process 24 matches the participant's preferences, e.g., specified topics of interest. In some cases, a topic assigned to a radio program may not match exactly with the participant's specified topic of interest, but the radio program process 24 may determine that the topic assigned to a radio program matches the participant's indicated topic of interest within a predetermined threshold, i.e., when the topics are “sufficiently related”. For example, suppose a potential participant expressed interest in the '72 Miami Dolphins. A talk radio program discussing the '72 Miami Dolphins may be scored for that participant higher than a talk radio program discussing “Dan Marino”, but the participant may be notified of both talk radio programs because the topics are closely related by subject matter—Dan Marino being a well-known quarterback of the Miami Dolphins.


A method and system for dynamic talk radio program scheduling has been disclosed. The talk radio program method and system is flexible and may support a variety of alternative embodiments. For example, in one alternative embodiment, the talk radio program may be scheduled via an auction model, where potential hosts 26b, potential guests 26c, and/or potential advertisers 26d may submit bids to the talk radio program service 12 to participate in the potential talk radio programs regarding topics preselected by the talk radio program service 12.


In another alternative embodiment, the talk radio program may be scheduled via an advertiser driven model whereby the potential advertisers 26d may set any of a price, topics of interest, the minimum number of potential users 26a, preferred hosts, and the like, to drive scheduled of the radio program.


In yet another alternative embodiment, talk radio program service may support an infomercial hybrid model. In this embodiment, a potential advertiser 26d may supply a “big name” guest and a contract to potential hosts of a talk radio program. During the talk radio program, the guest directly pitches the advertiser's product to the listeners. For example, Chuck Norris may be a guest on a talk radio program with a selection of pre-scripted talking points on a “Total Gym” product. There may be a base price paid by the talk show host to the advertiser per minute for Chuck's time on the show. “Total Gym” may then credit the talk show host on a per listener minute accumulated. Chuck may be directly compensated by “Total Gym” for his time on the show. This could be considered a hybrid of an infomercial and more of traditional talk radio to a narrow casted listener base. Since the host and the potential listeners qualify the existence of the talk radio program, per listener minute advertisement value may be significantly higher than in a traditional infomercial.


In yet another embodiment, scheduling of the radio program may be based on the potential host(s) 26b. In this embodiment, potential host(s) 26b specifies criteria, i.e., resource parameters, and the talk radio program service 12 schedules a radio program whenever the specified resource parameters are met. For example, the potential host(s) 26b may specify a willingness to host a radio program if two or more potential listeners are obtained to discuss topic “x”. In this embodiment, the talk radio program service 12 is created to serve the “long tail” in that it would provide the infrastructure, audience, etc. for Internet radio programs that are very targeted (i.e., a small number of participants).


The present invention has been described in accordance with the embodiments shown, and one of ordinary skill in the art will readily recognize that there could be variations to the embodiments, and any variations would be within the spirit and scope of the present invention. For example, the present invention can be implemented using hardware, software, a computer readable medium containing program instructions, or a combination thereof. Software written according to the present invention is to be either stored in some form of computer-readable medium such as memory or CD-ROM and is to be executed by a processor. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.

Claims
  • 1. A method performed via a server computer, comprising: registering potential participants of a talk radio program service via the server computer;receiving participant preferences for each of the potential participants via the server computer, wherein the participant preferences include at least one topic of interest and a time availability;scheduling a talk radio program for production via the server computer when a combination of the participant preferences reach predetermined thresholds; andsending the potential participants a notification of the scheduling of the talk radio program via the server computer.
  • 2. The method of claim 1 wherein the potential participants include participants selected from a group comprising at least one of potential listeners of the talk radio program, potential hosts, potential guests, and potential advertisers.
  • 3. The method of claim 2 wherein the participant preferences further include the time availability of any of the potential listeners, the potential hosts, the potential guests, and the potential advertisers.
  • 4. The method of claim 3 further comprising assigning the topic of interest to the talk radio program based on availability of any of the potential listeners, the potential hosts, the potential guests, and the potential advertisers.
  • 5. The method of claim 2 further comprising scheduling the talk radio program for production when resource parameters comprise one or more predetermined values.
  • 6. The method of claim 5 wherein the resource parameters include the participant preferences and at least one of advertisement revenue generated from sponsorship by at least one of the potential advertisers, and costs of the talk radio program.
  • 7. The method of claim 2 further comprising receiving for each of the potential hosts and the potential guests a desired fee for participating in the talk radio program.
  • 8. The method of claim 2 providing information regarding the talk radio program to the potential advertisers such that the potential advertisers can make sponsorship decisions.
  • 9. The method of claim 2 further comprising receiving from at least one of the potential hosts, the potential guests, and the potential advertisers, a bid to participate in a potential talk radio program regarding a preselected topic.
  • 10. The method of claim 1 further comprising sending the notification via at least one of a short messaging service (SMS), an e-mail, a voicemail, and an in-application notification.
  • 11. The method of claim 1 further comprising sending information with the notification including any of program details, program times, a program score, sponsor information, and an URL to a program stream of an Internet talk radio program.
  • 12. The method of claim 1 wherein the talk radio program comprises one of an Internet talk radio program and a terrestrial talk radio program.
  • 13. A system, comprising: a server;a radio program process executing on the server that functions to: register potential participants of a talk radio program service and receive participant preferences for each of the potential participants, wherein the participant preferences include at least one topic of interest and a time availability;schedule a talk radio program for production when a combination the participant preferences reach predetermined thresholds; andsend the potential participants a notification of the scheduling of the talk radio program.
  • 14. The system of claim 13 wherein the potential participants include participants selected from a group comprising at least one of potential listeners of the talk radio program, potential hosts, potential guests, and potential advertisers.
  • 15. The system of claim 14 wherein the participant preferences further include the time availability of any of the potential listeners, the potential hosts, the potential guests, and the potential advertisers.
  • 16. The system of claim 14 wherein the radio program process assigns the talk radio program the topic of interest based on availability of any of the potential listeners, the potential hosts, the potential guests, and the potential advertisers.
  • 17. The system of claim 14 wherein the radio program process schedules the talk radio program for production when resource parameters comprise one or more predetermined values.
  • 18. The system of claim 17 wherein the resource parameters include the participant preferences and at least one of advertisement revenue generated from sponsorship by at least one of the potential advertisers, and costs of the talk radio program.
  • 19. The system of claim 14 wherein the radio program process receives for each of the potential hosts and the potential guests a desired fee for participating in the talk radio program.
  • 20. The system of claim 14 wherein information regarding the talk radio program is provided to the potential advertisers such that the potential advertisers can make sponsorship decisions.
  • 21. The system of claim 14 wherein the radio program process receives from at least one of the potential hosts, the potential guests, and the potential advertisers, a bid to participate in a potential talk radio program regarding a preselected topic.
  • 22. The system of claim 13 wherein the radio program process sends the notification via at least one of a short messaging service (SMS), an e-mail, a voicemail, and an in application notification.
  • 23. The system of claim 13 wherein the radio program process sends information with the notification including any of program details, program times, a program score, sponsor information, and an URL to a program stream of an Internet talk radio program.
  • 24. The system of claim 13 wherein the talk radio program comprises one of an Internet talk radio program and a terrestrial talk radio program.
  • 25. An executable software product stored on a computer-readable medium containing program instructions for scheduling a talk radio program, the instructions comprising: registering potential participants of a talk radio program service at a server computer;receiving participant preferences for each of the potential participants via the server computer, wherein the participant preferences include at least one topic of interest and a time availability;scheduling the talk radio program for production via the server computer when a combination of the participant preferences reach predetermined thresholds; andsending the potential participants a notification of the scheduling of the talk radio program via the server computer.
  • 26. A method for providing a talk radio service via a server computer, comprising: registering potential listeners via the server computer and receiving for each of the potential listeners, a first topic of interest and a potential listener time availability;registering potential hosts via the server computer and receiving for each of the potential hosts, a second topic of interest and a potential host time availability;periodically analyzing the potential listener time availability via the server computer to determine that there is a sufficient cluster of the potential listeners available at a particular time for a particular topic to schedule a talk radio program, and analyzing the potential host time availability to determine that at least one of the potential hosts is available at the particular time for the particular topic;scheduling the talk radio program for production via the server computer by selecting the potential listeners and anyone of the potential hosts determined to be available for the particular topic; and sending to the potential listeners and to anyone of the potential hosts determined to be available for the particular topic a notification of the scheduling of the talk radio program via the server computer.
  • 27. The method of claim 26 further comprising providing information regarding the talk radio program to potential advertisers such that the potential advertisers can make sponsorship decisions for the talk radio program.
  • 28. The method of claim 26 further comprising: registering potential guests and receiving for each of the potential guests, a third topic of interest and a potential guest time availability;analyzing the potential just time availability to determine that at least one of the potential guests is available at the particular time for the particular topic;scheduling the talk radio program by selecting the potential listeners, any of the potential hosts, and any of the potential guests determined to be available for the particular topic; andsending to the potential listeners, to any of the potential hosts, and to any of the potential guests determined to be available for the particular topic the notification of the scheduling of the talk radio program.
US Referenced Citations (260)
Number Name Date Kind
3291919 Robitaille Dec 1966 A
4682370 Matthews Jul 1987 A
4720873 Goodman et al. Jan 1988 A
4788675 Jones et al. Nov 1988 A
4920432 Eggers et al. Apr 1990 A
5119188 McCalley et al. Jun 1992 A
5127003 Doll, Jr. et al. Jun 1992 A
5129036 Dean et al. Jul 1992 A
5132992 Yurt et al. Jul 1992 A
5134719 Mankovitz Jul 1992 A
5168481 Culbertson et al. Dec 1992 A
5305438 MacKay et al. Apr 1994 A
5351276 Doll, Jr. et al. Sep 1994 A
5396417 Burks et al. Mar 1995 A
5414455 Hooper et al. May 1995 A
5442701 Guillou et al. Aug 1995 A
5455570 Cook et al. Oct 1995 A
5526284 Mankovitz Jun 1996 A
5539635 Larson, Jr. Jul 1996 A
5557541 Schulhof et al. Sep 1996 A
5572442 Schulhof et al. Nov 1996 A
5592511 Schoen et al. Jan 1997 A
5617565 Augenbraun et al. Apr 1997 A
5629867 Goldman May 1997 A
5706427 Tabuki Jan 1998 A
5721827 Logan et al. Feb 1998 A
5732216 Logan et al. Mar 1998 A
5734893 Li et al. Mar 1998 A
5758257 Herz et al. May 1998 A
5790935 Payton Aug 1998 A
5809246 Goldman Sep 1998 A
5815662 Ong Sep 1998 A
5818510 Cobbley et al. Oct 1998 A
5819160 Foladare et al. Oct 1998 A
5819273 Vora et al. Oct 1998 A
5852610 Olaniyan Dec 1998 A
5855015 Shoham Dec 1998 A
5857149 Suzuki Jan 1999 A
5864682 Porter et al. Jan 1999 A
5907831 Lotvin et al. May 1999 A
5920856 Syeda-Mahmood Jul 1999 A
5926624 Katz et al. Jul 1999 A
5943422 Van Wie et al. Aug 1999 A
5949492 Mankovitz Sep 1999 A
5953005 Liu Sep 1999 A
5956716 Kenner et al. Sep 1999 A
5973724 Riddle Oct 1999 A
5974441 Rogers et al. Oct 1999 A
5983200 Slotznick Nov 1999 A
5983218 Syeda-Mahmood Nov 1999 A
5986692 Logan et al. Nov 1999 A
6006225 Bowman et al. Dec 1999 A
6009422 Ciccarelli Dec 1999 A
6014569 Bottum Jan 2000 A
6018768 Ullman et al. Jan 2000 A
6029165 Gable Feb 2000 A
6038591 Wolfe et al. Mar 2000 A
6055566 Kikinis Apr 2000 A
6060997 Taubenheim et al. May 2000 A
6067562 Goldman May 2000 A
6081780 Lumelsky Jun 2000 A
6081830 Schindler Jun 2000 A
6088455 Logan et al. Jul 2000 A
6088722 Herz et al. Jul 2000 A
6093880 Arnalds Jul 2000 A
6108686 Williams, Jr. Aug 2000 A
6122757 Kelley Sep 2000 A
6125387 Simonoff et al. Sep 2000 A
6128663 Thomas Oct 2000 A
6144375 Jain et al. Nov 2000 A
6161142 Wolfe et al. Dec 2000 A
6167393 Davis, III et al. Dec 2000 A
6169573 Sampath-Kumar et al. Jan 2001 B1
6182128 Kelkar et al. Jan 2001 B1
6199076 Logan et al. Mar 2001 B1
6223210 Hickey Apr 2001 B1
6226672 DeMartin et al. May 2001 B1
6229621 Kulakowski et al. May 2001 B1
6233682 Fritsch May 2001 B1
6246672 Lumelsky Jun 2001 B1
6248946 Dwek Jun 2001 B1
6253069 Mankovitz Jun 2001 B1
6263507 Ahmad et al. Jul 2001 B1
6289165 Abecassis Sep 2001 B1
6292786 Deaton et al. Sep 2001 B1
6295555 Goldman Sep 2001 B1
6311194 Sheth et al. Oct 2001 B1
6314094 Boys Nov 2001 B1
6317784 Mackintosh et al. Nov 2001 B1
6334127 Bieganski et al. Dec 2001 B1
6335927 Elliott et al. Jan 2002 B1
6338044 Cook et al. Jan 2002 B1
6339693 Chan Jan 2002 B1
6344607 Cliff Feb 2002 B2
6345289 Lotspiech et al. Feb 2002 B1
6349329 Mackintosh et al. Feb 2002 B1
6349339 Williams Feb 2002 B1
6351733 Saunders et al. Feb 2002 B1
6377782 Bishop et al. Apr 2002 B1
6385596 Wiser et al. May 2002 B1
6389467 Eyal May 2002 B1
6411992 Srinivasan et al. Jun 2002 B1
6415282 Mukherjea et al. Jul 2002 B1
6438579 Hosken Aug 2002 B1
6473792 Yavitz et al. Oct 2002 B1
6477707 King et al. Nov 2002 B1
6484199 Eyal Nov 2002 B2
6487390 Virine et al. Nov 2002 B1
6496802 van Zoest et al. Dec 2002 B1
6502194 Berman et al. Dec 2002 B1
6505123 Root et al. Jan 2003 B1
6519648 Eyal Feb 2003 B1
6546555 Hjelsvold et al. Apr 2003 B1
6560651 Katz et al. May 2003 B2
6581103 Dengler Jun 2003 B1
6587127 Leeke et al. Jul 2003 B1
6600898 De Bonet et al. Jul 2003 B1
6609096 De Bonet et al. Aug 2003 B1
6615039 Eldering Sep 2003 B1
6628928 Crosby et al. Sep 2003 B1
6662231 Drosset et al. Dec 2003 B1
6670537 Hughes et al. Dec 2003 B2
6684249 Frerichs et al. Jan 2004 B1
6697824 Bowman-Amuah Feb 2004 B1
6701355 Brandt et al. Mar 2004 B1
6711622 Fuller et al. Mar 2004 B1
6721741 Eyal et al. Apr 2004 B1
6725275 Eyal Apr 2004 B2
6735628 Eyal May 2004 B2
6741869 Lehr May 2004 B1
6748237 Bates et al. Jun 2004 B1
6772127 Saunders et al. Aug 2004 B2
6792470 Hakenberg et al. Sep 2004 B2
6793142 Yap Sep 2004 B2
6823225 Sass Nov 2004 B1
6879963 Rosenberg Apr 2005 B1
6882641 Gallick et al. Apr 2005 B1
6925489 Curtin Aug 2005 B1
6981040 Konig et al. Dec 2005 B1
6985694 De Bonet et al. Jan 2006 B1
6999783 Toyryla et al. Feb 2006 B2
7010263 Patsiokas Mar 2006 B1
7010537 Eyal et al. Mar 2006 B2
7010613 Connor Mar 2006 B2
7028082 Rosenberg et al. Apr 2006 B1
7031931 Meyers Apr 2006 B1
7035871 Hunt et al. Apr 2006 B2
7058694 De Bonet et al. Jun 2006 B1
7061482 Ferris Jun 2006 B2
7072309 Xie et al. Jul 2006 B2
7079807 Daum et al. Jul 2006 B1
7102067 Gang et al. Sep 2006 B2
7133924 Rosenberg et al. Nov 2006 B1
7139770 Nakase et al. Nov 2006 B2
7149983 Robertson et al. Dec 2006 B1
7171491 O'Toole et al. Jan 2007 B1
7203838 Glazer et al. Apr 2007 B1
7206838 Boyd et al. Apr 2007 B2
7277955 Elliott Oct 2007 B2
7343141 Ellis et al. Mar 2008 B2
7468934 Janik Dec 2008 B1
7469283 Eyal et al. Dec 2008 B2
7577665 Ramer et al. Aug 2009 B2
7680959 Svendsen Mar 2010 B2
7711838 Boulter et al. May 2010 B1
7765192 Svendsen Jul 2010 B2
7783722 Rosenberg et al. Aug 2010 B1
7797272 Picker et al. Sep 2010 B2
7797321 Martin et al. Sep 2010 B2
7827110 Wieder Nov 2010 B1
7827236 Ferris Nov 2010 B2
7840691 De Bonet et al. Nov 2010 B1
7853622 Baluja et al. Dec 2010 B1
7856485 Prager et al. Dec 2010 B2
7870088 Chen et al. Jan 2011 B1
7904505 Rakers et al. Mar 2011 B2
7917645 Ikezoye et al. Mar 2011 B2
7917932 Krikorian Mar 2011 B2
7926085 Del Beccaro et al. Apr 2011 B2
8045952 Qureshey et al. Oct 2011 B2
8050652 Qureshey et al. Nov 2011 B2
8060525 Svendsen et al. Nov 2011 B2
8117193 Svendsen et al. Feb 2012 B2
20010025259 Rouchon Sep 2001 A1
20010051852 Sundaravel et al. Dec 2001 A1
20020002039 Qureshey et al. Jan 2002 A1
20020010759 Hitson et al. Jan 2002 A1
20020023084 Eyal et al. Feb 2002 A1
20020023270 Thomas et al. Feb 2002 A1
20020035616 Diamond et al. Mar 2002 A1
20020053078 Holtz et al. May 2002 A1
20020072326 Qureshey et al. Jun 2002 A1
20020116082 Gudorf Aug 2002 A1
20020116476 Eyal et al. Aug 2002 A1
20020161858 Goldman Oct 2002 A1
20020165912 Wenocur et al. Nov 2002 A1
20020183059 Noreen et al. Dec 2002 A1
20020199001 Wenocur et al. Dec 2002 A1
20030018799 Eyal Jan 2003 A1
20030033420 Eyal et al. Feb 2003 A1
20030041110 Wenocur et al. Feb 2003 A1
20030103644 Klayh Jun 2003 A1
20030137531 Katinsky et al. Jul 2003 A1
20040006634 Ferris Jan 2004 A1
20040019497 Volk et al. Jan 2004 A1
20040186733 Loomis et al. Sep 2004 A1
20040199494 Bhatt Oct 2004 A1
20040255340 Logan Dec 2004 A1
20050021470 Martin et al. Jan 2005 A1
20050044561 McDonald Feb 2005 A1
20050198233 Manchester et al. Sep 2005 A1
20050278380 Ferris Dec 2005 A1
20060026147 Cone et al. Feb 2006 A1
20060072724 Cohen et al. Apr 2006 A1
20060101003 Carson et al. May 2006 A1
20060143236 Wu Jun 2006 A1
20060171395 Deshpande Aug 2006 A1
20060195442 Cone et al. Aug 2006 A1
20060288074 Rosenberg Dec 2006 A1
20070061301 Ramer et al. Mar 2007 A1
20070078660 Ferris Apr 2007 A1
20070078708 Yu et al. Apr 2007 A1
20070078709 Rajaram Apr 2007 A1
20070088804 Qureshey et al. Apr 2007 A1
20070089132 Qureshey et al. Apr 2007 A1
20070089135 Qureshey et al. Apr 2007 A1
20070156647 Shen et al. Jul 2007 A1
20070156897 Lim Jul 2007 A1
20070180063 Qureshey et al. Aug 2007 A1
20070265979 Hangartner Nov 2007 A1
20070266031 Adams et al. Nov 2007 A1
20070282949 Fischer et al. Dec 2007 A1
20070283268 Berger et al. Dec 2007 A1
20070286169 Roman Dec 2007 A1
20080016205 Svendsen Jan 2008 A1
20080031433 Sapp et al. Feb 2008 A1
20080052380 Morita et al. Feb 2008 A1
20080085769 Lutnick et al. Apr 2008 A1
20080208820 Usey et al. Aug 2008 A1
20080209013 Weel Aug 2008 A1
20080243733 Black Oct 2008 A1
20090013347 Ahanger et al. Jan 2009 A1
20090061763 Dillon et al. Mar 2009 A1
20090063645 Casey et al. Mar 2009 A1
20090064029 Corkran et al. Mar 2009 A1
20090070267 Hangartner Mar 2009 A9
20090077041 Eyal et al. Mar 2009 A1
20090093300 Lutnick et al. Apr 2009 A1
20090158146 Curtis et al. Jun 2009 A1
20090164429 Svendsen et al. Jun 2009 A1
20090164448 Curtis Jun 2009 A1
20090198666 Winston et al. Aug 2009 A1
20100017455 Svendsen et al. Jan 2010 A1
20100185732 Hyman Jul 2010 A1
20110016483 Opdycke Jan 2011 A1
20110034121 Ng et al. Feb 2011 A1
20120042094 Qureshey et al. Feb 2012 A1
20120042337 De Bonet et al. Feb 2012 A1
20120072418 Svendsen et al. Mar 2012 A1
20120143729 Qureshey et al. Jun 2012 A1
Foreign Referenced Citations (10)
Number Date Country
0672991 May 1998 EP
0952732 Oct 1999 EP
0984584 Mar 2000 EP
2306869 May 1997 GB
2397205 Jul 2004 GB
9726601 Jul 1997 WO
2007041369 Apr 2007 WO
2007041370 Apr 2007 WO
WO 2007041369 Apr 2007 WO
WO 2007041370 Apr 2007 WO
Non-Patent Literature Citations (46)
Entry
Free Online Radio—Internet Talk Radio, BlogTalkRadio, http://www.blogtalkradio.com, Sep. 28, 2008, pp. 1-2.
Free Internet Radio—Social Broadcasting, BlogTalkRadio, http://www.blogtalkradio.com/whatis.aspx, Sep. 28, 2008, pp. 1-2.
TalkZone: Internet Talk Radio—Internet Talk Shows—Internet Radio, http://www.talkzone.com/zonehome.asp, Jan. 29, 2009, pp. 1-2.
“About Intermind's Channel Communications Patents,” downloaded from <http://www.intermind.com/materials/patent—desc.html> on Feb. 27, 1998, 5 pages.
“About.com: http://quintura.com/,” at <http://websearch.about.com/gi/dynamic/offisite.htm?zi=1/XJ&sdn=web...f=10&su=p284.8.150.ip—&tt=13&bt=0&bts=0&zu=http%3A//quintura.com/>, copyright 2007, Quintura Inc., printed Oct. 17, 2007, 2 pages.
Aguilera, M.K. and Strom, R.E., “Efficient Atomic Broadcast Using Deterministic Merge,” Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), Jul. 16-19, 2000, copyright 2000, ACM, New York, New York, 10 pages.
“anthony.liekens.net>> Music>> Cloud,” at <http://anthony.liekens.net/index.php/Music/Cloud>, page last modified on Apr. 12, 2007, copyright 2000-2006, Anthony Liekens, printed Oct. 17, 2007, 4 pages.
“AOL Music Now,” at <http://web.archive.org/web/20060508184531/aol.musicnow.com/az/home.jhtml?—requesti...>, copyright 2006, AOL Music Now LLC, printed Nov. 16, 2007, 1 page.
“Apple—iPod + iTunes,” at <http://www.apple.com/itunes/>, printed Feb. 7, 2007, 2 pages.
Boswell, Wendy, “Loading ‘Quintura—Search With Quintura, a Tag Cloud Search Engine’,” at <http://websearch.about.com/od/dailywebsearchtips/qt/dnt0830.htm?p=1>, copyright 2007, About.com, Inc., printed Oct. 17, 2007, 1 page.
Egyhazy et al., “Intelligent Web Search Agents,” at <http://csgrad.cs.vt.edu/˜tplunket/article.html>, pp. 1-23, printed Dec. 20, 1999, 23 pages.
“FAQ,” at <http://blog.pandora.com/faq/>, copyright 2005-2006, Pandora Media, Inc., printed Aug. 8, 2006, 20 pages.
“Frequently Asked Questions about Intermind's Patents,” downloaded from <http://www.intermind.com/materials/ patent—faq.html> on Feb. 27, 1998, 9 pages.
Gibbon, John F. et al., “The Use of Network Delay Estimation for Multimedia Data Retrieval,” IEEE Journal on Selected Areas in Communications, vol. 14, No. 7, Sep. 1996, pp. 1376-1387, 12 pages.
Hearst, Marti A. et al., “Tag Clouds: Data Analysis Tool or Social Signaller?,” Proceedings of the 41st Annual Hawaii International Conference on System Sciences (HICSS 2008), Jan. 7-10, 2008, Waikoloa, Big Island, Hawaii, p. 160, available from <http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/hicss/2008/3075/00/3075toc.xml&DOI=10.1109/HICSS.2008.422>, 10 pages.
Henry, Alan, “MixxMaker: The Mix Tape Goes Online,” Jan. 18, 2008, AppScout, found at <http://appscout.pcmag.com/crazy-start-ups-vc-time/276029-mixxmaker-the-mix-tape-goes-online#fbid=DfUZtDa46ye>, printed Nov. 15, 2011, 4 pages.
Huhn, Mary, “Fed Up With Radio? Create Your Own Online Station,” New York Post, at <http://pqasb.pqarchiver.com/nypost/access/68457933.html?FMT=FT&di. . .>, Nov. 22, 1998, printed Oct. 13, 2009, 2 pages.
“InferNote is an exploration tool for your music collection,” at <http://www.itweaks.com/infdoc/index.html>, copyright 2004, otherslikeyou.com Inc., printed Feb. 7, 2007, 13 pages.
“Intermind Announces Approval of First Patent Application,” dated Oct. 7, 1997, downloaded from <http://www.intermind.com/inside/press—rel/100797—allow.html>, 3 pages.
International Search Report for PCT/GB01/03069 mailed Oct. 11, 2002, 3 pages.
Kaplan, Marc A., “IBM Cryptolopes TM, SuperDistribution and Digital Rights Management,” found at <http://www.research.ibm.com/people/k/kaplan/cryptolope-docs/crypap.html> from the Internet Archive, copyright Dec. 30, 1996, IBM Corporation, printed Mar. 15, 2000, 7 pages.
Krigel, Beth Lipton, “Imagine Radio spinning off,” CNET News, at <http://news.cnet.com/Imagine-Radio-spinning-off/2100-1033—3-213613.html>, Jul. 22, 1998, printed Oct. 13, 2009, 3 pages.
Krigel, Beth Lipton, “Radio features at center of Net law,” CNET News, at <http://news.cnet.com/Radio-features-at-center-of-Net-law/2100-1033—3-214752.html>, Aug. 24, 1998, printed Oct. 15, 2009, 2 pages.
Lamantia, Joe, “Second Generation Tag Clouds,” Feb. 23, 2006, at <http://www.joelamantia.com/blog/archives/ideas/second—generation—tag—clouds.html>, copyright 2006, Joe Lamantia, printed Nov. 29, 2007, 19 pages.
Lehmann-Haupt, Rachel, “Library/internet Radio; Listeners Take on Role of the Deejay,” The New York Times, at <http://www.nytimes.com/1998/11/05/technology/library-internet-radio-lis. . .>, Nov. 5, 1998, printed Oct. 13, 2009, 2 pages.
Lehmann-Haupt, Rachel, “Library/Internet Radio; On Spinner, Wide Range of Choices,” The New York Times, at <http://www.nytimes.com/1998/11/05/technology/library-internet-radio-on-spinner-wide-range-of-choices. html?scp=1&sq=0n . . .>, Nov. 5, 1998, printed Oct. 15, 2009, 5 pages.
Lehmann-Haupt, Rachel, “Library/internet Radio; Web Radio Expands Listening Horizons,” The New York Times, at <http://www.nytimes.com/1998/11/05/technology/library-internet-radio-web-radio-expands-listening-horizons. html?scp=2&sq= . . .>, Nov. 5, 1998, printed Oct. 15, 2009, 5 pages.
Lingnau et al., “An HTTP-based Infrastructure for Mobile Agents,” at <http://www.w3.org/Conferences/WWW4/Papers/150/>, 1995, pp. 1-15, printed Dec. 20, 1999, 15 pages.
Madan, Sameer, “Search the Web without a headache,” PC World (India), pp. 40-41, Feb. 1998, printed Dec. 20, 1999, 2 pages.
Merkel, Oliver et al., “Protecting VoD the Easier Way,” Proceedings of the sixth ACM International Conference on Multimedia, Sep. 13-16, 1998, Bristol, United Kingdom, 1998, pp. 21-28, 8 pages.
“Music Artist Cloud,” at <http://artistcloud.camaris.be/>, copyright 2007, mac, printed Oct. 17, 2007, 2 pages.
Nickell, Joe Ashbrook, “Roll Your Own Radio,” at <http://www.wired.com/print/culture/lifestyle/ news/1998/08/14706>, Aug. 28, 1998, printed Oct. 13, 2009, 1 page.
“Pandora Internet Radio—Find New Music, Listen to Free Web Radio,” at <http://www.pandora.com/>, copyright 2005-2007, Pandora Media, Inc., printed Feb. 7, 2007, 1 page.
“Pandora Radio—Listen to Free Internet Radio, Find New Music—The Music Genome Project,” at <http://www. pandora.com/mgp>, copyright 2005-2007, Pandora Media, Inc., printed Oct. 26, 2007, 1 page.
Rouarch, Pierre, “The Cloud Search Beta,” at <http://www.itcom3.com/thecloudsearch/aboutthecloudsearch. php>, copyright 2007, Pierre Rouarch, printed Oct. 17, 2007, 2 pages.
Smith, Patricia, “WebCompass Takes Web Searching in the Right Direction,” Seybold Report on Desktop Publishing, vol. 10, No. 10, pp. 1-9, found at <http://www.seyboldseminars.com/seybold—report/reports/D1010001.htm>, copyright 1996, Seybold Publications Inc., 9 pages.
“Start Listening with Last.fm,” at <http://www.last.fm/>, date unknown, 1 page.
“Tag cloud in standalone player—Feedback and Ideas—Last.fm,” at <http://www.last.fm/forum/21717/—/333289>, posting dated Oct. 4, 2007,copyright 2002-2007, Last.fm Ltd., printed Oct. 17, 2007, 2 pages.
“YouTube—Broadcast Yourself.,” at <http://www.youtube.com/>, copyright 2007, YouTube, LLC, printed Oct. 26, 2007, 2 pages.
“Master's Projects of the KR&R Group,” Faculty of Sciences, Vrije Universiteit, Amsterdam, URL unknown, publication date unknown, obtained on or prior to Apr. 22, 2009, 7 pages.
“Pandora—Frequently Asked Questions,” from <http:www.pandora.com>, obtained on or prior to Apr. 22, 2009, copyright 2005-2009, Pandora Media, Inc., 48 pages.
“Searching and Browsing Radio Time,” URL unknown, publication date unknown, obtained on or prior to Apr. 22, 2009, 3 pages.
“TalkStreamLive.com—A Dynamic Directory of Streaming Radio,” at <http://www.talkstreamlive.com/aboutus.aspx>, from the Internet Archive, dated Aug. 1, 2008, copyright 2006-2008; 3 pages.
Hochmair, H.H. et al., “User Interface Design for Semantic Query Expansion in Geo-data Repositories,” Angewandte Geoinformatik 2006—Beitrage zum 18, AGIT-Symposium Salzburg: Heidelberg: Wichmann, 2006, 10 pages.
“Welcome to Internet Talk Radio from Talkzone.com,” at <http://www.talkzone.com/> from the Internet Archive, dated Jul. 19, 2008, copyright 2007-2008, Syndication Networks Corp., 2 pages.
“What is BlogTalkRadio,” at <http://www.blogtalkradio.com/whatis.aspx> from the Internet Archive, dated Feb. 28, 2009, copyright 2009, appears that it may have existed in 2008, BlogTalkRadio.com, 2 pages.
Related Publications (1)
Number Date Country
20120066038 A1 Mar 2012 US