At least some embodiments of the present invention relate to sorting lists, such as search result lists for advertisement, publicity, etc.
The Internet is becoming an advertisement media to reach globally populated web users. Advertisements can be included in a web page that is frequently visited by web users or that returns the result of a user requested search.
Typically, the advertisements included in the web pages contain only a limited amount of information (e.g., a small paragraph, an icon, etc.). The advertisements contain links to web sites that provide further detailed information.
In certain arrangements, the advertisers pay the advertisements based on the number of visits directed to the web sites through the links in the advertisements. Thus, the advertisers pay for the performance of the advertisements.
Performance based advertising generally refers to a type of advertising in which an advertiser pays only for a measurable event that is a direct result of an advertisement being viewed by a consumer.
Paid inclusion advertising is a form of performance-based search advertising. With paid inclusion advertising, an advertisement is included within a result page of a search. Typically, each selection (e.g., click) of the advertisement from the result page is the measurable event for which the advertiser pays. In other words, payment by the advertiser is typically on a per click basis.
Paid placement advertising is another form of performance-based advertising, similar to paid inclusion advertising. Typically, the payment for paid placement advertising is also on a per click basis. With paid placement advertising an advertiser wants the opportunity of having a particular advertisement placed at a prominent spot, e.g., at the top of a search engine result page, thereby to increase the odds of the advertisement being viewed.
In paid inclusion advertising or paid placement advertising, the advertiser may adjust the price the advertiser is willing to pay for each selection (e.g., click) to balance the cost for the advertisement and the odds of obtaining the desired prominent spot or a high position in a list of advertisements.
For example, one advertising site may create a single queue of advertisements, which is sorted based on the per-click price specified by the advertisers. Adjusting the prices allows the advertisers to change their own placement and the advertisement cost.
Currently, a search engine web site can present a list of advertisers/advertisements in response to a user request for certain information. The list of advertisers/advertisements may be sorted or selected for presentation partially according to the relevancy of the advertisements to the information requested by the user. The advertisers/advertisements may be sorted or selected for presentation partially according to the price the advertisers specified for payment of the performance of the advertisements.
In an existing advertising network, a web site may sort the pool of advertisements into two separate queues. One queue is for the direct advertisers of the web site; and the other is for the indirect advertisers of the web site. The entire queue of the direct advertisers is sorted ahead of the indirect advertisers so that the direct advertisers are better served than the indirect advertisers on the web site.
Methods and apparatuses for sorting seller listings or advertisements of a seller network are presented. In one embodiment, a method includes: determining an indicator of potential revenue for a first party from price information of a list of entities, wherein revenue generated according to the price information of at least some of the list of entities is to be split among a plurality of parties; and, sorting the list of entities into a first list based at least partially on the indicator of potential revenue.
The present invention includes methods and apparatuses that perform these methods, including data processing systems that perform these methods and computer readable media which when executed on data processing systems cause the systems to perform these methods.
Other features of the present invention will be apparent from the accompanying drawings and from the detailed description which follows.
The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
The following description and drawings are illustrative of the invention and are not to be construed as limiting the invention. Numerous specific details are described to provide a thorough understanding of the present invention. However, in certain instances, well known or conventional details are not described in order to avoid obscuring the description of the present invention. References to one or an embodiment in the present disclosure are not necessarily references to the same embodiment; and, such references mean at least one.
One embodiment of the present invention provides a system of a seller network. The seller network includes a number of supply affiliates who provide or supply sellers for the seller network. The seller network also includes a number of demand affiliates who drive the demand of the customers to the seller network. Some affiliates can be both supply affiliates and demand affiliates.
Demand affiliates can be used to drive traffic to a seller or a network of sellers, especially in the Internet world. For instance, third-party web sites may be rewarded for driving consumer demand to a network of sellers.
However, in some marketplaces, supply is more difficult to come by, especially marketplaces that rely upon many different sellers. It may be advantageous when the seller or seller network is large and diversified enough to satisfy the customers generated through the demand affiliates.
In one embodiment of the present invention, a system rewards supply affiliates in addition to demand affiliates. The system provides a platform to attract and reward generators of both demand and supply.
In one embodiment, the system provides a user interface or application programming interface (API) through which suppliers of sellers can supply their sellers into the network. Affiliates can add their sellers to the network, manage their sellers from the system interface, and maximize the benefit they receive through manipulating the way they display network listings on their own demand sites, such as through manipulating the sorted order of the listings. A media channel delivering seller listings, advertisements or similar advertising information to the potential customers can be called a demand site.
In one embodiment, the system provides the suppler affiliates with tools to manage and track the performance of their sellers, both individually and as a whole. In return for supplying the sellers to the seller network, the system rewards the supply affiliates. In one embodiment, the supply affiliate reward is based on the leads received, or the commerce conducted through the network or other measurable benefits received, by the sellers of the supply affiliates. Supply affiliate reward can be manifested in various forms including, but not limited to, percentile commissions, revenue share on lead charges or commerce transactions, bounties, lump sums, etc.
In one embodiment, a supply affiliate can be anyone with access to existing or potential sellers that may be brought into the seller network. For example, a supply affiliate can be an individual who recommends friends to join the network. A supply affiliates can also be a company which pools and manages a set of sellers for the network.
In one embodiment, a supply affiliate of the seller network with a supply affiliate reward system can display seller listings from the seller network on a media channel of the supply affiliate. The seller listings may include the sellers from the supply affiliate and/or from other supply affiliates of the seller network.
In general, a supply affiliate may or may not operate a demand site. When a supply affiliate facilitates a demand site for the seller network, the supply affiliate is also a demand affiliate. In return for facilitating the demand site to reach potential customers, the system also rewards the demand affiliates. In one embodiment, similar to the supply affiliate reward, the demand affiliate reward is based on the leads received, or the commerce conducted or other measurable benefit received, by the sellers through the demand site. The demand affiliate rewards can be manifested in various forms including, but not limited to, percentile commissions, revenue share on lead charges or commerce transactions, bounties, lump sums, etc.
In one embodiment of the present invention, the seller listings are sorted based on maximizing the revenue to the demand affiliate who may also be a supply affiliate, considering both supply affiliate reward and demand affiliate reward, rather than relying on a bidding order of the sellers. Thus, the affiliates may achieve maximum benefit within a seller network.
If all the direct advertisers were unconditionally sorted ahead of the indirect advertisers, greater revenue potential from higher-bidding advertisements from indirect advertisers might be lost.
If the relevant advertisers were sorted according to a strict bidding order, the financial implications of some affiliates of a seller network with a revenue share system might not be well considered. For example, a demand affiliate who is also a supply affiliate may be losing out by not getting the higher revenue from their own sellers, who, although may have lower bids, would provide both the demand affiliate reward and the supply affiliate reward to generate a higher overall revenue for the affiliate. This would create an uneven distribution of seller impressions on demand sites; and suppliers of sellers with demand sites might lose out on potentially greater revenues.
In one embodiment of the present invention, the seller listings (or in general, advertisements) are sorted at a demand site according to the revenue for a particular party in the seller network, such as a demand affiliate who may or may not be a supply affiliate, to overcome the limitations of the traditional sorting methods.
In one embodiment, when the demand affiliates sort the seller listings of a seller network to increase their respective revenues, the system effectively gives sellers better exposure on the demand sites of their suppliers, while still having a wider distribution of demand site impressions. The network effect can be maximized. The sellers can be displayed on various possible demand sites of the network, while less aggressive lower-bidding sellers can still rely on an advantage on the demand sites of their own supplier. This creates value for the entire network, but also ensures suppliers of sellers with demand sites that they can achieve the maximum amount of revenue for their position in the network.
In one embodiment, the affiliates can access the system to see reporting interfaces that encapsulate both the performance of their sellers and the subsequent supply affiliate rewards.
Note that in the present application, “advertisement” may refer to various different forms of presentations to attract attention or patronage. An advertisement may be simply a listing of identity and contact information (e.g., in a web page, a print media, a telephonic listing service, etc.), or a passage including one or more statements about business offering, etc., or a banner with graphical content and/or animation embedded in a web page, or a voice message presented in a voice channel (e.g., radio broadcasting, a voice portal with Interactive Voice Response (IVR), which may accept user input through voice recognition or through keypad input generated Dual Tone Multi-Frequency (DTMF) signals), or others.
Further details are provided below.
In one embodiment of the present invention, affiliates can upload their sellers into a seller network, manage their sellers and maximize the total revenue using a new sorting method (e.g., when displaying network listings on the demand site of an affiliate who is both a supply affiliate and a demand affiliate).
In one embodiment, to get suppliers of sellers integrated into a network, the system provides a user interface or API through which supply affiliates can set up or upload their sellers into the network. The system interface provides tools for the supply affiliates to manage and track the performance of their sellers, both individually and as a whole. In return for supplying the sellers, the system rewards the supply affiliates based on the received leads or conducted commerce in the forms of percentile commissions, revenue share on lead charges or commerce transactions, bounties, lump sums, etc.
A supply affiliate who owns demand sites in the network has several ways to achieve revenue/kickbacks, including: (1) getting kickback when a seller from the affiliate is connected to a consumer through the network on someone else's demand site (supply affiliate reward), (2) getting kickback when a seller from another affiliate is connected to a consumer on the demand site of the affiliate (demand affiliate reward), and (3) getting kickback when a seller from the affiliate is connected to a consumer through that the demand site of the affiliate (both the supply and demand affiliate kickbacks). Of these three scenarios, the supply affiliate can affect the relative frequencies of (2) and (3) by adjusting how the seller listings from the network are displayed on the affiliate's own demand sites to favor listings that increase total revenue, which may be from both supply and demand affiliate rewards or from only demand affiliate rewards. To achieve increasing benefit on the demand sites, the affiliates can sort network listings based on maximizing revenue potential for themselves, rather than relying on a strict bidding order. Given this position within the network, the sorted order implemented for displaying network listings on the demand sites effectively functions as a lever for controlling the revenue stream. Affiliates can exploit such a control to maximize revenues for themselves. Further, affiliates may access the system to see reporting interfaces that encapsulate both the performance of their sellers and the subsequent rewards to the supplier.
In one embodiment, a supplier of sellers can be a large-scale supplier, such as an advertiser supply company, or a single person taking part in a “seller referral program.” For example, an individual person who brings in one seller to the network through referral and earns some percentage of kickback is also a supplier or supply affiliate. Thus, suppliers can be in a number of different forms.
In this description, the notion of a “seller” is independent of which party is paying for the network's services. For example, a lawyer who is advertising his/her business may pay for leads generated through an advertising network. On the other hand, the same lawyer may exist as a seller in an advice network where buyers pay for his/her consultation delivered through the network. In general, a seller can be a seller of products, goods, services, advices, etc., at an online or offline marketplace. An affiliate who brings such a seller to the marketplace is bringing value to the network, and therefore may be rewarded with a supply affiliate reward.
In one embodiment, the seller network is used to deliver seller listings (and in general, advertisements for the sellers) to potential customers. In one embodiment, the communications to obtain the seller listings are coordinated through the network. A seller network may distribute seller listings through various channels including, but not limited to, distribution on search-based web sites on the Internet, Wireless Application Protocol (WAP) servers, an Interactive Voice Response (IVR) telephony voice portal serving advertisements, an interface through which a live operator communicates seller listing information to customers, or print media, etc. Once the seller listing is presented to the customer, the connection between the customer and the seller can be performed through any type of communication medium including, but not limited to, phone calls (e.g., conventional landline based telephonic connection, wireless cellular connection, Voice over Internet Protocol (VoIP)), chat, video calls, e-mails, text messages, etc.
In one embodiment, seller listings (and in general, advertisements for the sellers) are sorted to maximize revenue for the owner of a demand site. Based on data attributes available to the owner of the demand site, many variations in sorting can be implemented. Some examples are provided below. In general, the listing data available to an affiliate is sorted according to the potential of total revenue to the affiliate to maximize revenue for the affiliate.
For example, consider a network in which sellers have set prices/bids for placement of their listings, and demand sites achieve a higher revenue percentage on transactions through the network if they are also the supplier of the seller listing. A given demand site may make 40% of the revenue when a transaction is completed from that demand site between a customer and an arbitrary network seller who was not supplied by the affiliate who owns the demand site, and 60% when the network seller was also supplied by the affiliate who owns the demand site. In this case, seller listings can be sorted for the demand site of the affiliate in decreasing order based on the potential total revenue for the affiliate, which may be computed from multiplying the seller listing bid by the percentage of revenue the affiliates makes from a transaction associated with that listing.
The seller network may also track click-through-rates, which shows the ratio of the number of user clicking through the links of the advertisement over the number of advertisement presentations. Click-through-rate represents the likelihood of a click-through resulting from the advertisement.
Similarly, when the advertisement is charged on the telephonic connections made as a result of the advertisement, call-through rate can be tracked and used to indicate the likelihood of a telephonic call resulting from the advertisement.
When an indicator of the likelihood of generating revenue from an advertisement for an affiliate is available, such as click-through-rates or call-through rates, the potential total revenue for the affiliate from an advertisement can be better estimated based on such statistical data. For example, the potential total revenue for the affiliate can be computed from multiplying the seller listing bid by the percentage of revenue the affiliate makes from a transaction associated with that listing and further by the indicator of the likelihood of generating revenue from that listing.
Thus, based on the revenue splitting schemes and/or the statistical data of revenue generating ratios, etc., the seller listing can be sorted to increase the total revenue that may be generated.
In general, a distributor of seller listings (and in general, advertisements) can utilize a system of the present invention regardless of supplier type, seller type, distribution method, and communication medium. Various detailed methods can be used in sorting the listings to increase revenue for a specific party of the system. When the affiliate has access to a number of sellers for displaying or distributing seller listings from the network, the affiliate can manipulate the sort order in the displaying of seller listings to maximize revenue to the supplier.
In one example, company X is an online marketing company that signs up and manages a number of advertisers, and distributes their advertisements (seller listings) through Company X's demand sites. The company decides to take its pool of sellers and function as a supply partner to a larger advertising network. With this arrangement, Company X displays advertisements from the network's advertisers on Company X's demand sites; and Company X's supply of advertiser listings will be displayed on other demand sites throughout the network. After making this decision, Company X accesses the network's system and uploads their advertiser listings into the network. Using the network's system, Company X can manage the listings and view reports of the performance of each of the individual listings as well as their performance as a supply affiliate.
Within the system, Company X's supply of sellers can be added to the pool of network advertisers for display on other demand sites; and Company X displays advertisements from the pool of the network's listings. Advertisers place bids for each of their listings which represent how much they are willing to pay for a customer lead through the network. When a transaction with one of Company X's advertiser's listings occurs on a different demand site (not owned by Company X), Company X receives 20% of the bid amount. However, when a transaction occurs on one of Company X's demand sites, they receive 40% of the bid amount if the listing was not from their supply, and 60% of the bid amount if the listing was from their own supply. The balance between transactions on Company X's demand sites that yield 40% and 60% effectively functions as a lever through which Company X can affect the revenue stream from their demand sites. In other words, Company X can potentially earn more from their demand sites by increasing the frequency of transactions that yield 60% relative to the frequency of transactions that yield 40%, if the bid amounts are about the same.
Company X previously sorted strictly by bid to display advertisements on Company X's demand sites. This might be sufficient before Company X joins the network. However, Company X is now a part of a large network where the revenue split varies for different sellers. According to one embodiment of the present invention, Company X may implement a new method of sorting the listings to increase revenue. For example, the listings can be sorted based on the bid amount multiplied by the percentage of revenue Company X receives.
If the previous sorting method were used, Company X would suffer the opportunity costs of not giving precedence to lower-bidding, higher-revenue-yielding listings over listings with higher bids but lower revenue yield. For example, using the old method a listing from a different supplier in the network with a $10 bid would be placed higher than a listing from Company X's supply with a $9 bid. Using the new method, the $9 bid listing would be placed higher. This is because Company X would effectively earn $5.40 when the customer communicates with the $9 advertiser, but only $4.00 when the customer contacts the $10 advertiser. Using the new method, the listings on the demand sites of Company X are sorted in a way to provide the most exposure for listings of the highest revenue yield for Company X.
Thus, the system allows suppliers of sellers with demand sites to maximize their revenue within a network that utilizes supply affiliate kickbacks. By implementing a revenue-maximizing sort order on their demand sites, a supplier may achieve an optimal revenue-yielding position within the network.
In general, applicability of embodiments of the present invention is independent of supplier type, seller type, distribution method, communication method, or minor variations in sorting criteria. To illustrate this point, consider the following separate example.
Company Y runs a web site that functions as a service marketplace to bring together buyers and sellers of live advice. Company Y manages hundreds of advisors who have listings to sell live tax advice through VoIP calls to customers at a set per-minute rates (each listing has its own rate). Company Y decides to join a large network of live advisors which includes business advice, psychic readers, etc. Company Y then uploads their live tax advisor listings into the network and manages them through the network system interface. Now Company Y's tax advisors can have their listings displayed on all of the demand sites in the network; and, Company Y also displays the listings for other advisors in the network on Company Y's own demand sites using Company Y's own sorting scheme. The network also distributes listings through other mediums as well, such as displaying on various mobile devices.
Previously, Company Y earned a fixed percentage of the total transaction charge and sorted the listings purely based on the per-minute rate that advisors charge for their services. However, Company Y is now a part of a large network with supply partner kickbacks. According to one embodiment of the present invention, Company Y can implement a revenue-maximizing rule for sorting lists on their demand sites.
As the supply affiliate part of the network contract, Company Y earns 20% of the revenue from transactions initiated through their demand sites if the advisor is a network seller not from their supply, and 30% of the revenue from transactions initiated on their demand sites where the advisor is from their supply. On the demand sites of Company Y, the listings are now sorted in descending order of (advisor rate)×(revenue split). Thus, a tax advisor listing from Company Y's supply charging a rate of $5.00 per minute would be placed higher than another advisor listing from the network (but not from Company Y's supply) that charges a rate of $6.00. This is because Company Y would earn $1.50 per minute on transactions between customers and the $5.00 per min advisor, but only $1.20 per minute on transactions between customers and the $6.00 per min advisor.
The above examples demonstrate how a supplier of sellers can maximize the revenues earned on demand sites of the supplier when the supplier is within a large seller network that utilizes supply partner kickbacks. The benefit is provided to suppliers of sellers in second example as it does in the first one, even though the above examples have different types of sellers, distribution methods, and communication methods, etc.
In one embodiment, the sellers of a supply affiliate can be added to the network pool of sellers, through a system-provided interface or API, which may include mass upload functionality and/or individual add/delete functionality.
In
In one embodiment, the supply affiliates may upload/supply their sellers into the seller network using different interfaces, such as a user interface which allows the manipulation of individual seller records, or an API that allows mass uploading. For example, seller records may be updated, added or deleted one at a time. Alternatively, the seller records may be submitted in a file transmitted through a network connection; and the file of seller records is then parsed for adding, deleting, and/or updating the seller records. For example, the file can be in an Extensible Markup Language (XML) or in a custom format.
In one embodiment, different supply affiliates may provide different types of seller records. For example, a supply affiliate in a referral program may provide the identity of the sellers. When the sellers join the network, the supply affiliate is rewarded with supply affiliate reward for the referral effort. Thus, in general, the supply affiliate may or may not provide the seller price bid information.
In the example of
In one embodiment, the supply affiliate rewards may be different percentages of the seller price bids for different sellers or for different supply affiliates. Alternatively, the supply affiliate reward for all sellers, or all sellers of a particular supply affiliate, may have the same percentage based on the seller price bids. Thus, sellers or certain groups of sellers may share the same data about supply affiliate rewards.
Similarly, sellers or seller groups may also share the same data about demand affiliate rewards.
Thus, in general, the seller network contains information about revenue sharing among various parties in the network, which may be organized different from that illustrated in
In one embodiment, the seller network specifies the supply affiliate rewards and the demand affiliate rewards. For example, for supply affiliate of a referral program, the supply affiliate rewards may be a predetermined percentage (e.g., 5%) of the seller price bids. In one embodiment, supply affiliates may specify the supply affiliate rewards. For example, a supply affiliate may specify a percentage of seller price bids as the supply affiliate rewards, which can be adjusted by the supply affiliate to balance the revenue from individual transaction and the likelihood of successful transaction. When the supply affiliate reward is reduced, the demand affiliate reward can be increased; and the sellers of the supply affiliate are more likely to be displayed on the demand sites of other affiliates.
Similarly, the demand affiliate rewards may also be specified by different parties, such as the seller network, the supply affiliates, the demand affiliates, etc.
In one embodiment of the present invention, one same seller may be supplied to the seller network by different supply affiliates. To include the seller's listing, demand affiliates may select the supply affiliate according to the supply affiliate reward and/or demand affiliate reward.
In one embodiment, the seller network tracks the statistic data about transactions (e.g., click-through rates, call-through rates, etc.). The demand affiliates may use the statistic data in computing potential revenues when sorting seller listings. The supply affiliates may use the statistic data to evaluate the performance of their sellers.
Alternatively, the supply affiliates may track the statistic data about transactions and provide the data to the seller network.
In one embodiment of the present invention, the demand affiliates of the seller network use (e.g., 131, 133) the seller network database to present seller listings for their users. For example, the media channel of supply affiliate S (135) (e.g., Web/WAP server) may deliver seller listings to user devices A (141) (e.g., computer), user device B (143) (e.g., PDA), etc., in response to the search requests from the users; and the media channel of supply affiliate Y (137) (e.g., SMS based server) may provide seller listings to user device B (143), user devices X (149) (e.g., cellular phone), etc.
In one embodiment, certain entities can be both demand affiliates and supply affiliates of the seller network. For example, in
In general, some demand affiliates may not be supply affiliates; and some supply affiliates may not be demand affiliates.
In one embodiment of the present invention, the seller listings are sorted according to total potential revenues for the demand affiliate, which may include both the supply affiliate reward and the demand affiliate reward.
In one embodiment, the seller network sorts the seller listings for the media channel according to an indicator of total potential revenue for the affiliate. Thus, a uniform sorting method can be applied to the media channels of the seller network.
Alternative, the seller network provides the indicator of total potential revenue to the demand affiliates, in addition to the seller price bid or instead of the seller price bid, to allow the demand affiliates to sort the listings according to their own criteria.
Alternatively, different demand affiliates may sort the seller listings differently according their own indicators of total potential revenue.
In
When the “send now” button (213) is pressed, the personalized message received in the “description” field (207) is sent to the friends of the supply affiliate at the addresses specified in the “friends' email address” field (201). In one embodiment, the emails are sent in a way so that the emails appear to be sent directly from the supply affiliate as indicates in fields (203 and 205).
In one embodiment, a link containing parameters to identify the supply affiliate is added into the email message so that when the friends of the supply affiliate follows the link in the email to join the network, the system adds the friends as sellers of the supply affiliate. The supply affiliate automatically earns a percentage (e.g., 5%) of the money the friends spend on the network as supply affiliate rewards.
Alternatively, a reference number/string can be added to the email message which can be used by the friends to identify the supply affiliate. Alternatively, the email addresses of the friends can be used to correlate the friends with the supply affiliate when the friends join the network.
In one embodiment, the friends set up their advertisements and price bids for the advertisements directly with the network, without further help from the supply affiliate and in a way similar to direct advertisers of the network. However, a percentage of the advertisement spending of the friends goes to the supply affiliate for the referral effort.
Alternatively, the “cancel” button (211) can be pressed to close the interface without sending out the message.
Thus, a supply affiliate can represent a single individual, who may or not be a demand affiliate and who may have only one seller.
The user interface (300) allows a supply affiliate to individually access the sellers/advertisers of the supply affiliate. For example, a selector (301) can be used to select a particular advertiser of the supply affiliate.
In
In
The address, city, state, country and zip fields (305, 307 and 309) are to receive the location information about the advertiser. The location is typically a site where a potential customer may visit to obtain services and/or products.
The “phone” field (311) is to receive the telephone number at which the advertiser is to receive phone calls from potential customers. In one embodiment of the present invention, the phone number of the advertiser in the phone field (319) is not shown directly to the end users. An encoded/substitute phone number is used in the advertisement, so that when the encoded phone number is called the phone number of the advertiser is determined and connected to. This allows the tracking of phone calls generated from various advertisements for different advertisers and/or generated through different advertisement delivery channels.
The “web site URL” field (313) is to optionally receive a home web page address of the advertiser. In one embodiment, the advertisement is generated to contain a link to the web page as specified in the web site URL field (313) so that if the end user wants further details about the advertiser, the end user may click the link to visit the web page of the advertiser. In one embodiment, the advertiser is not charged for the link directing the web user to the web page of the advertiser. Alternatively, the advertiser may be charged for the link that is clicked to lead the web user to the web page of the advertiser. In one embodiment, the amount the advertiser is charged for the click is automatically computed from the pay per call price according to the click-through rate and call-through rate so that the average click-through revenue and the average call-through revenue is about the same.
In one embodiment of the present invention, the advertisement is not to include a link to the web site URL (313). The web site URL (313) is used to obtain further information about the business of the advertiser so that the advertisement can be placed in relevant media channels.
For example, the web pages at the web site according to the web site URL can be fetched and analyzed automatically to determine topics, categories, keywords, content, etc., so that the placement of the advertisement can be based at least partially on the topics, categories, keywords, content, etc. to increase the chances of the advertisement being of interest to the targeted users.
The “tag line” field (315) and the description field (317) are to receive one or more concise statements about the business offering, the unique ways of meeting customers' needs, how the business stand out from the competition, etc. In one embodiment, the information in the description field is presented in a text form. In one embodiment, the text in the description field can be enhanced with boldface and italic type, as well as formatting, using a Rich Text Editor, as supported by Internet Explorer for Windows or Mozilla Browsers (e.g., Firefox, Netscape, etc.).
In one embodiment, further optional information, such as a logo, an electronic coupon, etc. (not shown in
For example, when the “details” button (323) is pressed, a user interface for show further details is displayed. Further details may include electronic coupon information, price bid for advertisement, logo, advertisement budget (e.g., in terms of the number calls per day, monthly spending limit, etc.), targeted geographic area(s) of customers, business categories, key terms, etc.
In one embodiment, the “details” button can be further pressed to view information collected by the network for the supply affiliate, such as advertisement performance (e.g., call-through rate, total number of calls generated in a given time period, total charges/advertisement spending, rewards for the affiliate from the advertiser, etc.)
The “previous” and “next” buttons can be used to navigate through the set of advertisers of the supply affiliate. The “new” button can be used to enter information for a new advertiser of the supply affiliate; and the “update” button can be used to update information of an existing advertiser of the supply affiliate. Further buttons, such as a “delete” button for removing an advertiser, can be included.
In one embodiment, the seller network system further provides an API for the mass updating/uploading of seller information from a supply affiliate. For example, the supply affiliate may use its own application system to collect data about the sellers. The seller information is then communicated to the seller network through a file, or a network communication interface.
In
For example, the supply affiliate may separate the advertisers into a number of groups and select (401) a group or all groups for viewing. Different types of calls generated from the advertisements for the selected advertisers can be viewed separated or together using the “call results” selector (403). The “display as” selector (405) can be used to specify whether the result is displayed as a web page, an XML document, an email, a fax, a PDF file, etc. Time period selectors (407 and 409) can be used to specify a particular time period for which the activities are reported.
After specifying the parameters of the report, the user can press the “create report” button to obtain the result, which shows information such as the list of advertisers (420) and their corresponding calls (421) received as the result of the advertisement on the seller network, call charges (423 and 425) and affiliate earnings (427 and 429) for the affiliate, etc.
In one embodiment of the present invention, as illustrated in
In one embodiment of the present invention, the sellers are sorted into a list based at least partially on an indicator of revenue potential, which includes the consideration of the differences in contributions from the price bids to the revenue for the operator of the media channel.
In
In the example of
Interface (601) illiterates the display of seller listing according to one embodiment of the present invention. After the “search” button is pressed to request the results according to the search terms (621), the relevant advertisers are retrieved from the advertisement database. The candidates for the search results are ranked (603) according to the potential revenue (e.g., 609) for presentation or selection. For example, when the list of candidates is too long, only a top portion of the list is selected for presentation in the search result.
In the example of
In
In
The interface displays (817) appropriate listings sorted to increase revenue for the operator. The operator (803) then connects the consumer to the top listing specified by the consumer.
Alternatively, the consumer may interactive with an IVR system using a voice recognition system and a text-to-speech system.
Thus, in general, the seller listings sorted according to embodiments of the present invention can be displayed or presented to various different entities, which may not be an end consumer.
In one embodiment of the present invention, the revenue share for the affiliates of a seller network is based on measurable events such as clicks on links provided in the listings/advertisements, phone calls generated from the listings/advertisements, etc.
In one embodiment, the seller network system tracks the measurable events and determines the affiliate rewards for the affiliates of the network. Alternatively, the demand and/or seller affiliates may also track the measurable events.
In one embodiment, to track the clicks the links are encoded with one or more parameters which can be used to determine the target address; and the links point to a web site which accepts the requests, records the clicks, determines the target address and forwards the requests to the target address.
In one embodiment, to track the phone calls resulting from the listings/advertisements, the phone numbers provided in the advertisements/listings are encoded so that the phone calls are directed to a phone call tracking facility first.
In
In one embodiment of the present invention, the phone numbers of the target phones are not directly publicized over the media channels. Instead, encoded target phone numbers (923) are used. Using the encoded target phone numbers (923), a user cannot reach target phones directly. The encoded target phone numbers (923) allow the association of additional information with the target phone numbers, such as the media channels used, special promotions, etc.
The encoded target phone numbers are delivered with content information (e.g., web page, WAP page, short message, television programs, news articles, etc.) to user devices, such as user device A (911) (e.g., cellular phone), user device B (912) (e.g., personal digital assistant (PDA)), user device C (913) (e.g., computer), user device D (916) (e.g., receiver), user device E (918) (e.g., newspaper).
For example, one media delivering channel includes print media. A list of advertisements can be sorted according to one embodiment of the present invention before printing (e.g., newspaper). In the example of print media, the list can be sorted to maximize advertisement revenue, although the sorting may not be dynamic in response to a request from an end user.
In another example, a voice portal is used to deliver the advertisements. The voice portal can use an Interactive Voice Response (IVR) system to interact with the user. For example, the IVR system may use voice-recognition or keypad input to receive user input. According to the user input, the advertisements can be sorted dynamically to maximize revenue according to one embodiment of the present invention. In one embodiment, the IVR system presents an advertisement through a text-to-speech technique. Alternatively, the advertisement can be a pre-recorded voice message.
In one embodiment, the user devices are mobile devices, such as PDA, cellular phone, etc. The user devices obtain content information, including advertisements, through wireless communication connections, such as cellular communication links, wireless access points for wireless local area network, etc.
In one embodiment, a user device (e.g., a cellular phone, a computer, a PDA) can receive content information from multiple types of media channels (e.g., a web server, a WAP server, a SMSC, etc.).
In one embodiment, a user device is capable to dial a phone call (e.g., automatically according to the encoded phone number embedded in the content information when a user selects the number). Alternatively, a user may manually dial a phone call using a separate phone, such as user phone S (917) or user phone T (919).
In one embodiment of the present invention, dialing at least a portion of an encoded target phone number connects the phone call to a phone decoder and router (925) first. According to the encoded target phone number dialed, the phone decoder and router (925) determines the corresponding target phone number using the database (921) and connects the phone call to the corresponding target phone (e.g., one of target phones 931-939) through the telephone network (927).
Note the telephone network (927) may be circuit switched, package switched, or partially circuit switched and partially package switched. For example, the telephone network may partially use the Internet to carry the phone call (e.g., through VoIP). For example, the connection between the user phone/device and the phone decoder and router (925) may be carried using VoIP; and the connection between the phone decoder and router (925) may be carried using a land-line based, circuit switched telephone network.
In one embodiment of the present invention, the information associated with the encoded target phone number, such as the media channel used to provide the encoded target phone number to the users, is also decoded/retrieved using the database (921). Thus, the information associated with the encoded target phone number can be tracked/stored.
In one embodiment, the phone decoder and router (925) also determines the phone number of the user through Automatic Number Identification (ANI). ANI is a phone system feature that provides the billing number of the person making the phone call.
The information about the caller, target phone number, the media channel used for delivering the contact information to the user can be used to bill the caller and/or the target phone number, and provide credit/compensation for the corresponding media channel.
For example, the advertisements for target phone numbers can be paid for on a pay per call basis. Monitoring and tracking the calls can be used for billing the advertisers. Alternatively, the users may be seeking the contact information on a pay per call basis. Monitoring and tracking the calls can be used for billing the users.
In one embodiment of the present invention, the additional information associated with the encoded target phone number is used to provide credit/compensation to the operators of the corresponding media channels that are responsible for leading the users to the phone calls to the target phones. The system can further track the time and duration of the phone calls and other information, such as conditional promotions, electronic coupons, etc.
The information about the media channels that are responsible for leading the users to the phone calls to the target phones can also be useful for the advertisers. The advertisers may wish to know which media channel is more effective in reaching users. For example, using the statistic information about the media channels which successfully bring in phone calls, the advertisers may fine tune advertisement strategies. Further, different media channels may charge differently for the advertisements; and the advertisers may bid differently on different media channels for their advertisements.
In one embodiment of the present invention, an encoded target phone number has the same number of digits as a standard phone number (e.g., a typical telephone number assigned by a telephone company). Thus, dialing the encoded target phone number is as easy as dialing the target phone number; and dialing the target phone number reaches the phone decoder and router (925). In such an arrangement, a large number of encoded phone numbers are generally required to differentiate the different target phones and different media channels.
In one embodiment of the present invention, an encoded target phone number has more digits than a standard phone number. A first portion of the encoded target phone number has the same number of digits as a standard phone number to reach the phone decoder and router (925) through the telephone network (927); and a second portion of the encoded target phone number is to be decoded by the phone decoder and router (925). For example, the Dual Tone Multi-Frequency (DTMF) decoder can be installed in the phone decoder and router (925) to detect the second portion of the encoded target phone number dialed at the user phone. The detected phone number can then be used to recover the target phone number.
When an encoded target phone number has more digits than a standard phone number, the additional digits can be implemented as a telephone extension, or as an IVR system.
In one embodiment of the present invention, a single telephone number is used to reach the phone decoder and router (925) for different target phone numbers; and the portion of the encoded target phone number that is used to reach the phone decoder and router (925) is not used in determining the information associated with the encoded target phone number.
Alternatively, multiple telephone numbers can be used to reach the phone decoder and router (925); and the entire encoded target phone number can be used to determine the information associated with the encoded target phone number.
In one embodiment of the present invention, the encoded target phone numbers can have different numbers of digits. The advertisers may be arranged to bid for shorter encoded target phone numbers.
In one embodiment of the present invention, the encoded target phone numbers are assigned only when needed for use in a media channel.
In one embodiment, a look-up table approach is used to encode the information. For example, the database (921) keeps track of the information about the media channel and the target phone number (and other information, if any) for the encoded target phone number so that the encoded target phone number can be used as a key to retrieve the corresponding information. Thus, it is not necessary to have a predetermined structure to encode the information about the media channels and the target phone number.
Alternatively, algorithms can be used to generate and encode target phone number and associated information. For example, a predetermined algorithm may be used to encode different information in the target phone number. For example, the target phone number may include a number of field separated by “*” or “#”. Each of the field can be decoded separately (e.g., from a separate look up table or a mapping algorithm) to determine the target phone number, identity of the media channel, etc.
For example, a set of parameters can be mapped from a string of characters to a string of numerical digits as a part of the encoded target phone number; and the string of numbers can be mapped back into the string of characters at the phone decoder and router (925). When such a mapping scheme is used, a look up table is not necessary. For example, an encoded target phone number may include a first portion that is the phone number of the phone decoder and router (925), a second portion that is the target phone number appended with a number mapped from an identifier of the media channel. To prevent the user from dialing the target phone number directly, an encryption/scrambling scheme can be used to encode the second portion, which is decoded at the phone decoder and router (925).
In one embodiment of the present invention, the phone decoder and router (925) determines the target phone number from the encoded target phone number dialed by the user and then dials the target phone number for the user and joins the phone calls so that the user can talk to the target phone.
In one embodiment of the present invention, users dial the encoded target phone numbers manually. A user can dial the encoded target phone number regardless the user device used and the media channel used.
Alternatively, in one embodiment, user devices can automatically dial the encoded target phone numbers. For example, a cellular phone, a computer or a PDA can dial a phone number using a Dual Tone Multi-Frequency (DTMF) generator. In one embodiment of the present invention, the encoded target phone numbers are presented in the content information in a format such that when the user selects the phone number the user device (e.g., a cellular phone or a computer) dials the encoded target phone number for the user. The user selection may be in the form of an keyboard/keypad input, a touch pad input, a track ball input, a mouse input, a voice command, etc.
In one embodiment, the user device initiates the phone call through a VoIP system when the user selects the encoded target phone number.
In one embodiment of the present invention, the user device dials the phone number for the user without the user manually press the sequence of the encoded target phone numbers. This greatly simplifies the process of make the phone call. Since a user device can dial a long sequence of number easily, a large number of digits can be used to encode the information without presenting any difficulties for the users.
In one embodiment of the present invention, the encoded target phone numbers are formatted so that the user device dials a first portion of the encoded target phone numbers to access the phone decoder and router (925), pauses for a short period of time for the phone decoder and router (925) to prepare for receiving the second portion of the encoded target phone numbers, and then dials the second portion of the encoded target phone numbers. Thus, the user device provides a user-friendly way of dialing the encoded target phone numbers; and, making the phone call can be as easy as making a “click” to access a web page.
In
The user phone number can be automatically determined through ANI, or through a user preference setting, or through an entry submitted with the selection of the encoded target phone number.
In one embodiment, the selection of the encoded target phone number is transmitted to the corresponding media channel, which forwards the request for making the phone call to a server (e.g., a web server) connected to the phone router. Alternatively, the content information can be formatted so that the selection is sent directly to the server that is connected to the phone router.
When the router starts the phone calls, the encoded target phone number can also include alphabetic characters (and/or other characters). The server and/or the phone router can decode the encoded target phone number to recover/retrieve the target phone number and other associated information, such as the identity of the media channel that is creditable for providing the encoded target phone number to user.
In
In
Alternatively, the second party may poll and manage the one or more entities and upload the entities to the seller network.
Operation 1107 determines an indicator of potential revenue for a first party from price bid of a list of entities which includes the one or more entities and other entities. Operation 1109 sorts the list of entities into a first list based on the indicator of potential revenue. Operation 1111 presents advertisements of the list of entities according to the first list in a media channel.
The one or more entities and other entities may contribute different percentages of the price bid to the revenue of the first party. For example, the price bid for the one or more entities is to be slit between the first and second parties; and the price bid for the other entities is not to be slit between the first party and another party.
Operation 1113 tracks revenues realized from the price bid in the first list. Operation 1115 determines revenues for the first and second parties based on the revenues realized from the price bid. Operation 1117 presents the statistics of the revenues for the first and second parties to the first and second parties respectively.
While
In
The inter-connect (1202) interconnects the microprocess(s) (1203) and the memory (1211) together and also interconnects them to a display controller and display device (1207) and to peripheral devices such as input/output (I/O) devices (1205) through an input/output controller(s) (1206). Typical I/O devices include mice, keyboards, modems, network interfaces, printers, scanners, video cameras and other devices which are well known in the art.
The inter-connect (1202) may include one or more buses connected to one another through various bridges, controllers and/or adapters. In one embodiment the I/O controller (1206) includes a USB (Universal Serial Bus) adapter for controlling USB peripherals, and/or an IEEE-1394 bus adapter for controlling IEEE-1394 peripherals.
The memory (1211) may include ROM (Read Only Memory), and volatile RAM (Random Access Memory) and non-volatile memory, such as hard drive, flash memory, etc.
Volatile RAM is typically implemented as dynamic RAM (DRAM) which requires power continually in order to refresh or maintain the data in the memory. Non-volatile memory is typically a magnetic hard drive, a magnetic optical drive, or an optical drive (e.g., a DVD RAM), or other type of memory system which maintains data even after power is removed from the system. The non-volatile memory may also be a random access memory.
The non-volatile memory can be a local device coupled directly to the rest of the components in the data processing system. A non-volatile memory that is remote from the system, such as a network storage device coupled to the data processing system through a network interface such as a modem or Ethernet interface, can also be used.
In one embodiment of the present invention, a server data processing system as illustrated in
In one embodiment of the present invention, a server data processing system as illustrated in
In one embodiment, a user terminal can be a data processing system similar to the system of
Alternatively, the traditional communication client(s) may be used in some embodiments of the present invention.
1921 In general, the routines executed to implement the embodiments of the invention may be implemented as part of an operating system or a specific application, component, program, object, module or sequence of instructions referred to as “computer programs.” The computer programs typically comprise one or more instructions set at various times in various memory and storage devices in a computer, and that, when read and executed by one or more processors in a computer, cause the computer to perform operations necessary to execute elements involving the various aspects of the invention.
While some embodiments of the invention have been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that various embodiments of the invention are capable of being distributed as a program product in a variety of forms and are capable of being applied regardless of the particular type of machine or computer-readable media used to actually effect the distribution.
Examples of computer-readable media include but are not limited to recordable and non-recordable type media such as volatile and non-volatile memory devices, read only memory (ROM), random access memory (RAM), flash memory devices, floppy and other removable disks, magnetic disk storage media, optical storage media (e.g., Compact Disk Read-Only Memory (CD ROMS), Digital Versatile Disks, (DVDs), etc.), among others, and transmission type media such as digital and analog communication links for electrical, optical, acoustical or other forms of propagated signals, such as carrier waves, infrared signals, digital signals, etc.
A machine readable medium can be used to store software and data which when executed by a data processing system causes the system to perform various methods of the present invention. The executable software and data may be stored in various places including for example ROM, volatile RAM, non-volatile memory and/or cache. Portions of this software and/or data may be stored in any one of these storage devices.
In general, a machine readable medium includes any mechanism that provides (i.e., stores and/or transmits) information in a form accessible by a machine (e.g., a computer, network device, personal digital assistant, manufacturing tool, any device with a set of one or more processors, etc.).
Aspects of the present invention may be embodied, at least in part, in software. That is, the techniques may be carried out in a computer system or other data processing system in response to its processor, such as a microprocessor, executing sequences of instructions contained in a memory, such as ROM, volatile RAM, non-volatile memory, cache or a remote storage device.
In various embodiments, hardwired circuitry may be used in combination with software instructions to implement the present invention. Thus, the techniques are not limited to any specific combination of hardware circuitry and software nor to any particular source for the instructions executed by the data processing system.
In this description, various functions and operations are described as being performed by or caused by software code to simplify description. However, those skilled in the art will recognize what is meant by such expressions is that the functions result from execution of the code by a processor, such as a microprocessor.
Although some of the drawings illustrate a number of operations in a particular order, operations which are not order dependent may be reordered and other operations may be combined or broken out. While some reordering or other groupings are specifically mentioned, others will be apparent to those of ordinary skill in the art and so do not present an exhaustive list of alternatives. Moreover, it should be recognized that the stages could be implemented in hardware, firmware, software or any combination thereof.
In the foregoing specification, the invention has been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
The present application is a continuation application of U.S. patent application Ser. No. 11/072,147, filed Mar. 3, 2005 and entitled “Methods and Apparatuses for Sorting Lists for Presentation,” now U.S. Pat. No. 7,979,308, which claims priority from Provisional U.S. Patent Application Ser. No. 60/656,637, filed Feb. 25, 2005 and entitled “System and Method to Merge Pay-For-Performance Advertising Models,” the disclosures of which applications are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4313035 | Jordan et al. | Jan 1982 | A |
4577065 | Frey et al. | Mar 1986 | A |
4631428 | Grimes | Dec 1986 | A |
4645873 | Chomet | Feb 1987 | A |
4677434 | Fascenda | Jun 1987 | A |
4723283 | Nagasawa et al. | Feb 1988 | A |
4751669 | Sturgis et al. | Jun 1988 | A |
4752675 | Zetmeir | Jun 1988 | A |
4847890 | Solomon et al. | Jul 1989 | A |
4850007 | Marino et al. | Jul 1989 | A |
4963995 | Lang | Oct 1990 | A |
5057932 | Lang | Oct 1991 | A |
5058152 | Solomon et al. | Oct 1991 | A |
5148474 | Haralambopoulos et al. | Sep 1992 | A |
5155743 | Jacobs | Oct 1992 | A |
5164839 | Lang | Nov 1992 | A |
5262875 | Mincer et al. | Nov 1993 | A |
5319542 | King, Jr. et al. | Jun 1994 | A |
5325424 | Grube | Jun 1994 | A |
5347632 | Filepp et al. | Sep 1994 | A |
5359508 | Rossides | Oct 1994 | A |
5361295 | Solomon et al. | Nov 1994 | A |
5369694 | Bales et al. | Nov 1994 | A |
5440334 | Walters et al. | Aug 1995 | A |
5448625 | Lederman | Sep 1995 | A |
5453352 | Tachibana | Sep 1995 | A |
5497502 | Castille | Mar 1996 | A |
5524146 | Morrisey et al. | Jun 1996 | A |
5537314 | Kanter | Jul 1996 | A |
5539735 | Moskowitz | Jul 1996 | A |
5555298 | Jonsson | Sep 1996 | A |
5557677 | Prytz | Sep 1996 | A |
5574780 | Andruska et al. | Nov 1996 | A |
5574781 | Blaze | Nov 1996 | A |
5589892 | Knee et al. | Dec 1996 | A |
5590197 | Chen et al. | Dec 1996 | A |
5596634 | Fernandez et al. | Jan 1997 | A |
5602905 | Mettke | Feb 1997 | A |
5608786 | Gordon | Mar 1997 | A |
5615213 | Griefer | Mar 1997 | A |
5619148 | Guo | Apr 1997 | A |
5619570 | Tsutsui | Apr 1997 | A |
5619725 | Gordon | Apr 1997 | A |
5619991 | Sloane | Apr 1997 | A |
5634012 | Stefik et al. | May 1997 | A |
5638432 | Wille et al. | Jun 1997 | A |
5675734 | Hair | Oct 1997 | A |
5694549 | Carlin et al. | Dec 1997 | A |
5696965 | Dedrick | Dec 1997 | A |
5701419 | McConnell | Dec 1997 | A |
5710887 | Chelliah et al. | Jan 1998 | A |
5710970 | Walters et al. | Jan 1998 | A |
5712979 | Graber et al. | Jan 1998 | A |
5715314 | Payne et al. | Feb 1998 | A |
5717860 | Graber et al. | Feb 1998 | A |
5718247 | Frankel | Feb 1998 | A |
5721763 | Joseph et al. | Feb 1998 | A |
5722418 | Bro | Mar 1998 | A |
5724424 | Gifford | Mar 1998 | A |
5724521 | Dedrick | Mar 1998 | A |
5734961 | Castille | Mar 1998 | A |
5740231 | Cohn et al. | Apr 1998 | A |
5745681 | Levine et al. | Apr 1998 | A |
5751956 | Kirsch | May 1998 | A |
5768348 | Solomon et al. | Jun 1998 | A |
5768521 | Dedrick | Jun 1998 | A |
5774534 | Mayer | Jun 1998 | A |
5778367 | Wesinger, Jr. et al. | Jul 1998 | A |
5781894 | Petrecca et al. | Jul 1998 | A |
5793851 | Albertson | Aug 1998 | A |
5794221 | Egendorf | Aug 1998 | A |
5802502 | Gell et al. | Sep 1998 | A |
5809119 | Tonomura et al. | Sep 1998 | A |
5809145 | Slik et al. | Sep 1998 | A |
5812769 | Graber et al. | Sep 1998 | A |
5818836 | DuVal | Oct 1998 | A |
5819092 | Ferguson et al. | Oct 1998 | A |
5819267 | Uyama | Oct 1998 | A |
5819271 | Mahoney et al. | Oct 1998 | A |
5819285 | Damico et al. | Oct 1998 | A |
5825869 | Brooks et al. | Oct 1998 | A |
5825876 | Peterson, Jr. | Oct 1998 | A |
5832523 | Kanai et al. | Nov 1998 | A |
5835896 | Fisher et al. | Nov 1998 | A |
5842212 | Ballurio et al. | Nov 1998 | A |
5850433 | Rondeau | Dec 1998 | A |
5860068 | Cook | Jan 1999 | A |
5862223 | Walker et al. | Jan 1999 | A |
5864871 | Kitain et al. | Jan 1999 | A |
RE36111 | Neville | Feb 1999 | E |
5870546 | Kirsch | Feb 1999 | A |
5870744 | Sprague | Feb 1999 | A |
5878130 | Andrews et al. | Mar 1999 | A |
5884032 | Bateman et al. | Mar 1999 | A |
5884272 | Walker et al. | Mar 1999 | A |
5884282 | Robinson | Mar 1999 | A |
5889774 | Mirashrafi et al. | Mar 1999 | A |
5890138 | Godin et al. | Mar 1999 | A |
5893077 | Griffin | Apr 1999 | A |
5901214 | Shaffer et al. | May 1999 | A |
5903635 | Kaplan | May 1999 | A |
5907677 | Glenn et al. | May 1999 | A |
5911132 | Sloane | Jun 1999 | A |
5914951 | Bentley et al. | Jun 1999 | A |
5924082 | Silverman et al. | Jul 1999 | A |
5937390 | Hyodo | Aug 1999 | A |
5940471 | Homayoun | Aug 1999 | A |
5940484 | DeFazio et al. | Aug 1999 | A |
5946646 | Schena et al. | Aug 1999 | A |
5960416 | Block | Sep 1999 | A |
5963202 | Polish | Oct 1999 | A |
5963861 | Hanson | Oct 1999 | A |
5974141 | Saito | Oct 1999 | A |
5974398 | Hanson et al. | Oct 1999 | A |
5978567 | Rebane et al. | Nov 1999 | A |
5982863 | Smiley et al. | Nov 1999 | A |
5987102 | Elliott et al. | Nov 1999 | A |
5987118 | Dickerman et al. | Nov 1999 | A |
5987430 | Van Horne et al. | Nov 1999 | A |
5991394 | Dezonno et al. | Nov 1999 | A |
5995705 | Lang | Nov 1999 | A |
5999609 | Nishimura | Dec 1999 | A |
5999611 | Tatchell et al. | Dec 1999 | A |
5999965 | Kelly | Dec 1999 | A |
6006197 | d'Eon et al. | Dec 1999 | A |
6011794 | Mordowitz et al. | Jan 2000 | A |
6014644 | Erickson | Jan 2000 | A |
6026087 | Mirashrafi et al. | Feb 2000 | A |
6026148 | Dworkin et al. | Feb 2000 | A |
6026375 | Hall et al. | Feb 2000 | A |
6026400 | Suzuki | Feb 2000 | A |
6028601 | Machiraju et al. | Feb 2000 | A |
6029141 | Bezos et al. | Feb 2000 | A |
6035021 | Katz | Mar 2000 | A |
6046762 | Sonesh et al. | Apr 2000 | A |
6055513 | Katz et al. | Apr 2000 | A |
6058379 | Odom et al. | May 2000 | A |
6064978 | Gardner et al. | May 2000 | A |
6108704 | Hutton et al. | Aug 2000 | A |
6130933 | Miloslavsky | Oct 2000 | A |
6144670 | Sponaugle et al. | Nov 2000 | A |
6167449 | Arnold et al. | Dec 2000 | A |
6173279 | Levin et al. | Jan 2001 | B1 |
6175619 | DeSimone | Jan 2001 | B1 |
6185194 | Musk et al. | Feb 2001 | B1 |
6188673 | Bauer et al. | Feb 2001 | B1 |
6188761 | Dickerman et al. | Feb 2001 | B1 |
6189030 | Kirsch et al. | Feb 2001 | B1 |
6192050 | Stovall | Feb 2001 | B1 |
6199096 | Mirashrafi et al. | Mar 2001 | B1 |
6208713 | Rahrer et al. | Mar 2001 | B1 |
6212192 | Mirashrafi et al. | Apr 2001 | B1 |
6216111 | Walker et al. | Apr 2001 | B1 |
6223165 | Lauffer | Apr 2001 | B1 |
6230287 | Pinard et al. | May 2001 | B1 |
6233566 | Levine et al. | May 2001 | B1 |
6243684 | Stuart et al. | Jun 2001 | B1 |
6259774 | Miloslavsky | Jul 2001 | B1 |
6269336 | Ladd et al. | Jul 2001 | B1 |
6269361 | Davis et al. | Jul 2001 | B1 |
6275490 | Mattaway et al. | Aug 2001 | B1 |
6292799 | Peek et al. | Sep 2001 | B1 |
6298056 | Pendse | Oct 2001 | B1 |
6301342 | Ander et al. | Oct 2001 | B1 |
6304637 | Mirashrafi et al. | Oct 2001 | B1 |
6310941 | Crutcher et al. | Oct 2001 | B1 |
6314402 | Monaco et al. | Nov 2001 | B1 |
6323894 | Katz | Nov 2001 | B1 |
6327572 | Morton et al. | Dec 2001 | B1 |
6385583 | Ladd et al. | May 2002 | B1 |
6393117 | Trell | May 2002 | B1 |
6400806 | Uppaluru | Jun 2002 | B1 |
6404864 | Evslin et al. | Jun 2002 | B1 |
6404877 | Bolduc et al. | Jun 2002 | B1 |
6404884 | Marwell et al. | Jun 2002 | B1 |
6408278 | Carney et al. | Jun 2002 | B1 |
6430276 | Bouvier et al. | Aug 2002 | B1 |
6434527 | Horvitz | Aug 2002 | B1 |
6463136 | Malik | Oct 2002 | B1 |
6466966 | Kirsch et al. | Oct 2002 | B1 |
6470079 | Benson | Oct 2002 | B1 |
6470181 | Maxwell | Oct 2002 | B1 |
6470317 | Ladd et al. | Oct 2002 | B1 |
6482156 | Iliff | Nov 2002 | B2 |
6484148 | Boyd | Nov 2002 | B1 |
6493437 | Olshansky | Dec 2002 | B1 |
6493671 | Ladd et al. | Dec 2002 | B1 |
6493673 | Ladd et al. | Dec 2002 | B1 |
6510417 | Woods et al. | Jan 2003 | B1 |
6516057 | Meek et al. | Feb 2003 | B2 |
6523010 | Lauffer | Feb 2003 | B2 |
6529878 | De Rafael et al. | Mar 2003 | B2 |
6529946 | Yokono et al. | Mar 2003 | B2 |
6539359 | Ladd et al. | Mar 2003 | B1 |
6546372 | Lauffer | Apr 2003 | B2 |
6549889 | Lauffer | Apr 2003 | B2 |
6560576 | Cohen et al. | May 2003 | B1 |
6606376 | Trell | Aug 2003 | B1 |
6625595 | Anderson et al. | Sep 2003 | B1 |
6636590 | Jacob et al. | Oct 2003 | B1 |
6658389 | Alpdemir | Dec 2003 | B1 |
6704403 | Lurie et al. | Mar 2004 | B2 |
6731736 | Meek et al. | May 2004 | B2 |
6735588 | Kim et al. | May 2004 | B2 |
6757364 | Newkirk | Jun 2004 | B2 |
6757710 | Reed | Jun 2004 | B2 |
6760537 | Mankovitz | Jul 2004 | B2 |
6769020 | Miyazaki et al. | Jul 2004 | B2 |
6770029 | Iliff | Aug 2004 | B2 |
6801899 | Lauffer | Oct 2004 | B2 |
6807532 | Kolls | Oct 2004 | B1 |
6813346 | Gruchala et al. | Nov 2004 | B2 |
6836225 | Lee et al. | Dec 2004 | B2 |
6847992 | Haitsuka et al. | Jan 2005 | B1 |
6849045 | Iliff | Feb 2005 | B2 |
6850965 | Allen | Feb 2005 | B2 |
6856809 | Fostick | Feb 2005 | B2 |
6859833 | Kirsch et al. | Feb 2005 | B2 |
6910035 | Hoekman et al. | Jun 2005 | B2 |
6937699 | Schuster et al. | Aug 2005 | B1 |
6968174 | Trandal et al. | Nov 2005 | B1 |
6978270 | Carty et al. | Dec 2005 | B1 |
6993326 | Link, II et al. | Jan 2006 | B2 |
7028012 | St. Vrain | Apr 2006 | B2 |
7035381 | D'Ascenzo et al. | Apr 2006 | B2 |
7035468 | Yogeshwar et al. | Apr 2006 | B2 |
7035634 | Mead et al. | Apr 2006 | B2 |
7062453 | Clarke | Jun 2006 | B1 |
7076037 | Gonen et al. | Jul 2006 | B1 |
7085745 | Klug | Aug 2006 | B2 |
7092901 | Davis et al. | Aug 2006 | B2 |
7099306 | Goodman et al. | Aug 2006 | B2 |
7103010 | Melideo | Sep 2006 | B2 |
7120235 | Altberg et al. | Oct 2006 | B2 |
7146429 | Michel | Dec 2006 | B2 |
7181415 | Blaser et al. | Feb 2007 | B2 |
7187761 | Bookstaff | Mar 2007 | B2 |
7200413 | Montemer | Apr 2007 | B2 |
7212615 | Wolmuth | May 2007 | B2 |
7224781 | Jacob et al. | May 2007 | B2 |
7227936 | Bookstaff | Jun 2007 | B2 |
7231405 | Xia | Jun 2007 | B2 |
7240110 | Haitsuka et al. | Jul 2007 | B2 |
7240290 | Melideo | Jul 2007 | B2 |
7249045 | Lauffer | Jul 2007 | B2 |
7297108 | Iliff | Nov 2007 | B2 |
7297111 | Iliff | Nov 2007 | B2 |
7300402 | Iliff | Nov 2007 | B2 |
7306560 | Iliff | Dec 2007 | B2 |
7363254 | Skinner | Apr 2008 | B2 |
7366683 | Altberg et al. | Apr 2008 | B2 |
7373599 | McElfresh et al. | May 2008 | B2 |
7380139 | Tagawa et al. | May 2008 | B2 |
7401053 | Kamimura et al. | Jul 2008 | B2 |
7433459 | Reding et al. | Oct 2008 | B2 |
7434175 | Melideo | Oct 2008 | B2 |
7475149 | Jacob et al. | Jan 2009 | B2 |
7698183 | Faber et al. | Apr 2010 | B2 |
7886067 | Krassner et al. | Feb 2011 | B2 |
7979308 | Ho et al. | Jul 2011 | B2 |
8027898 | Faber et al. | Sep 2011 | B2 |
8140392 | Altberg et al. | Mar 2012 | B2 |
8180676 | Altberg et al. | May 2012 | B2 |
8200534 | Wong et al. | Jun 2012 | B2 |
8209225 | Altberg et al. | Jun 2012 | B2 |
8484084 | Altberg et al. | Jul 2013 | B2 |
8521596 | Altberg et al. | Aug 2013 | B2 |
8538768 | Agarwal et al. | Sep 2013 | B2 |
8599832 | Altberg et al. | Dec 2013 | B2 |
8681952 | Agarwal et al. | Mar 2014 | B2 |
8700461 | Wong et al. | Apr 2014 | B2 |
8761154 | Altberg et al. | Jun 2014 | B2 |
8837698 | Altberg et al. | Sep 2014 | B2 |
8856014 | Agarwal et al. | Oct 2014 | B2 |
8934614 | Altberg et al. | Jan 2015 | B2 |
9094486 | Altberg et al. | Jul 2015 | B2 |
9094487 | Altberg et al. | Jul 2015 | B2 |
9105032 | Altberg et al. | Aug 2015 | B2 |
9118778 | Altberg et al. | Aug 2015 | B2 |
9202217 | Altberg et al. | Dec 2015 | B2 |
9305304 | Faber et al. | Apr 2016 | B2 |
9317855 | Altberg et al. | Apr 2016 | B2 |
20010012913 | Iliff | Aug 2001 | A1 |
20010027481 | Whyel | Oct 2001 | A1 |
20010032247 | Kanaya | Oct 2001 | A1 |
20010037283 | Mullaney | Nov 2001 | A1 |
20010048737 | Goldberg et al. | Dec 2001 | A1 |
20020003867 | Rothschild et al. | Jan 2002 | A1 |
20020004735 | Gross | Jan 2002 | A1 |
20020010608 | Faber et al. | Jan 2002 | A1 |
20020010616 | Itzhaki | Jan 2002 | A1 |
20020026457 | Jensen | Feb 2002 | A1 |
20020029241 | Yokono et al. | Mar 2002 | A1 |
20020038233 | Shubov et al. | Mar 2002 | A1 |
20020057776 | Dyer | May 2002 | A1 |
20020065959 | Kim et al. | May 2002 | A1 |
20020077891 | Castle et al. | Jun 2002 | A1 |
20020077930 | Trubey et al. | Jun 2002 | A1 |
20020087565 | Hoekman et al. | Jul 2002 | A1 |
20020087704 | Chesnais et al. | Jul 2002 | A1 |
20020095331 | Osman et al. | Jul 2002 | A1 |
20020107697 | Jensen | Aug 2002 | A1 |
20020120554 | Vega | Aug 2002 | A1 |
20020122547 | Hinchey et al. | Sep 2002 | A1 |
20020133402 | Faber et al. | Sep 2002 | A1 |
20020133571 | Jacob et al. | Sep 2002 | A1 |
20020136377 | Stewart et al. | Sep 2002 | A1 |
20020160766 | Portman et al. | Oct 2002 | A1 |
20020173319 | Fostick | Nov 2002 | A1 |
20020191762 | Benson | Dec 2002 | A1 |
20020193094 | Lawless et al. | Dec 2002 | A1 |
20030026397 | McCroskey | Feb 2003 | A1 |
20030043981 | Lurie et al. | Mar 2003 | A1 |
20030046161 | Kamangar et al. | Mar 2003 | A1 |
20030050837 | Kim | Mar 2003 | A1 |
20030083042 | Abuhamdeh | May 2003 | A1 |
20030105824 | Brechner et al. | Jun 2003 | A1 |
20030135460 | Talegon | Jul 2003 | A1 |
20030195787 | Brunk et al. | Oct 2003 | A1 |
20030212600 | Hood et al. | Nov 2003 | A1 |
20030220837 | Asayama | Nov 2003 | A1 |
20030220866 | Pisaris-Henderson | Nov 2003 | A1 |
20030223565 | Montemer | Dec 2003 | A1 |
20030225682 | Montemer | Dec 2003 | A1 |
20030231754 | Stein et al. | Dec 2003 | A1 |
20040003041 | Moore et al. | Jan 2004 | A1 |
20040006511 | Montemer | Jan 2004 | A1 |
20040010518 | Montemer | Jan 2004 | A1 |
20040039640 | Koppelman et al. | Feb 2004 | A1 |
20040044571 | Bronnimann et al. | Mar 2004 | A1 |
20040076403 | Mankovitz | Apr 2004 | A1 |
20040083133 | Nicholas et al. | Apr 2004 | A1 |
20040096110 | Yogeshwar et al. | May 2004 | A1 |
20040103024 | Patel et al. | May 2004 | A1 |
20040107137 | Skinner | Jun 2004 | A1 |
20040162757 | Pisaris-Henderson et al. | Aug 2004 | A1 |
20040174965 | Brahm et al. | Sep 2004 | A1 |
20040174974 | Meek et al. | Sep 2004 | A1 |
20040193488 | Khoo et al. | Sep 2004 | A1 |
20040199422 | Napier et al. | Oct 2004 | A1 |
20040204997 | Blaser et al. | Oct 2004 | A1 |
20040225562 | Turner | Nov 2004 | A1 |
20040234049 | Melideo | Nov 2004 | A1 |
20040234064 | Melideo | Nov 2004 | A1 |
20040235524 | Abuhamdeh | Nov 2004 | A1 |
20040236441 | Melideo | Nov 2004 | A1 |
20040247092 | Timmins et al. | Dec 2004 | A1 |
20040249649 | Stratton et al. | Dec 2004 | A1 |
20040249709 | Donovan et al. | Dec 2004 | A1 |
20040249778 | Iliff | Dec 2004 | A1 |
20040254859 | Aslanian | Dec 2004 | A1 |
20040258048 | Melideo | Dec 2004 | A1 |
20040260413 | Melideo | Dec 2004 | A1 |
20050010795 | Tagawa et al. | Jan 2005 | A1 |
20050018829 | Baker | Jan 2005 | A1 |
20050021744 | Haitsuka et al. | Jan 2005 | A1 |
20050033641 | Jha et al. | Feb 2005 | A1 |
20050041647 | Stinnie | Feb 2005 | A1 |
20050048961 | Ribaudo et al. | Mar 2005 | A1 |
20050065811 | Chu et al. | Mar 2005 | A1 |
20050074100 | Lederman | Apr 2005 | A1 |
20050074102 | Altberg et al. | Apr 2005 | A1 |
20050076100 | Armstrong | Apr 2005 | A1 |
20050080878 | Cunningham et al. | Apr 2005 | A1 |
20050086104 | McFadden | Apr 2005 | A1 |
20050096980 | Koningstein | May 2005 | A1 |
20050097204 | Horowitz et al. | May 2005 | A1 |
20050100153 | Pines et al. | May 2005 | A1 |
20050105881 | Mankovitz | May 2005 | A1 |
20050114210 | Faber et al. | May 2005 | A1 |
20050119957 | Faber et al. | Jun 2005 | A1 |
20050125416 | Kirsch et al. | Jun 2005 | A1 |
20050135387 | Rychener et al. | Jun 2005 | A1 |
20050149396 | Horowitz et al. | Jul 2005 | A1 |
20050165666 | Wong et al. | Jul 2005 | A1 |
20050203796 | Anand et al. | Sep 2005 | A1 |
20050203799 | Faber et al. | Sep 2005 | A1 |
20050207432 | Velez-Rivera et al. | Sep 2005 | A1 |
20050209874 | Rossini | Sep 2005 | A1 |
20050216341 | Agarwal et al. | Sep 2005 | A1 |
20050216345 | Altberg et al. | Sep 2005 | A1 |
20050220289 | Reding et al. | Oct 2005 | A1 |
20050222908 | Altberg et al. | Oct 2005 | A1 |
20050240432 | Jensen | Oct 2005 | A1 |
20050245241 | Durand et al. | Nov 2005 | A1 |
20050251445 | Wong et al. | Nov 2005 | A1 |
20050261964 | Fang | Nov 2005 | A1 |
20050286688 | Scherer | Dec 2005 | A1 |
20050289015 | Hunter et al. | Dec 2005 | A1 |
20050289026 | Dunn et al. | Dec 2005 | A1 |
20060003735 | Trandal et al. | Jan 2006 | A1 |
20060004627 | Baluja | Jan 2006 | A1 |
20060026061 | Collins | Feb 2006 | A1 |
20060069610 | Rossini | Mar 2006 | A1 |
20060095281 | Chickering et al. | May 2006 | A1 |
20060095343 | Clarke et al. | May 2006 | A1 |
20060099936 | Link, II et al. | May 2006 | A1 |
20060106711 | Melideo | May 2006 | A1 |
20060136310 | Gonen et al. | Jun 2006 | A1 |
20060149624 | Baluja et al. | Jul 2006 | A1 |
20060159063 | Kumar | Jul 2006 | A1 |
20060166655 | Montemer | Jul 2006 | A1 |
20060171520 | Kliger | Aug 2006 | A1 |
20060173827 | Kliger | Aug 2006 | A1 |
20060173915 | Kliger | Aug 2006 | A1 |
20060182250 | Melideo | Aug 2006 | A1 |
20060184417 | Van der Linden et al. | Aug 2006 | A1 |
20060200380 | Ho et al. | Sep 2006 | A1 |
20060247999 | Gonen et al. | Nov 2006 | A1 |
20060259365 | Agarwal et al. | Nov 2006 | A1 |
20060277108 | Altberg et al. | Dec 2006 | A1 |
20060277181 | Temple et al. | Dec 2006 | A1 |
20070011240 | Altberg et al. | Jan 2007 | A1 |
20070022011 | Altberg et al. | Jan 2007 | A1 |
20070038507 | Kumar | Feb 2007 | A1 |
20070067219 | Altberg et al. | Mar 2007 | A1 |
20070078717 | Ho et al. | Apr 2007 | A1 |
20070081662 | Altberg et al. | Apr 2007 | A1 |
20070083408 | Altberg et al. | Apr 2007 | A1 |
20070100956 | Kumar | May 2007 | A1 |
20070116217 | Altberg et al. | May 2007 | A1 |
20070121844 | Altberg et al. | May 2007 | A1 |
20070121845 | Altberg et al. | May 2007 | A1 |
20070121846 | Altberg et al. | May 2007 | A1 |
20070121847 | Faber et al. | May 2007 | A1 |
20070121848 | Faber et al. | May 2007 | A1 |
20070124206 | Faber et al. | May 2007 | A1 |
20070124207 | Faber et al. | May 2007 | A1 |
20070127650 | Altberg et al. | Jun 2007 | A1 |
20070129054 | Andronikov et al. | Jun 2007 | A1 |
20070130014 | Altberg et al. | Jun 2007 | A1 |
20070140451 | Altberg et al. | Jun 2007 | A1 |
20070143182 | Faber et al. | Jun 2007 | A1 |
20070162296 | Altberg et al. | Jul 2007 | A1 |
20070174124 | Zagofsky et al. | Jul 2007 | A1 |
20070192300 | Reuther et al. | Aug 2007 | A1 |
20070233681 | Ronen et al. | Oct 2007 | A1 |
20070255622 | Swix et al. | Nov 2007 | A1 |
20070269038 | Gonen et al. | Nov 2007 | A1 |
20080301190 | Lockhart et al. | Dec 2008 | A1 |
20080313277 | Altberg et al. | Dec 2008 | A1 |
20090067599 | Agarwal et al. | Mar 2009 | A1 |
20090157593 | Hayashi et al. | Jun 2009 | A1 |
20090177647 | Oliver et al. | Jul 2009 | A1 |
20100017266 | Faber et al. | Jan 2010 | A1 |
20130262240 | Altberg et al. | Oct 2013 | A1 |
20130325635 | Altberg et al. | Dec 2013 | A1 |
20140207588 | Wong et al. | Jul 2014 | A1 |
20160012476 | Altberg et al. | Jan 2016 | A1 |
20160042406 | Altberg et al. | Feb 2016 | A1 |
20160050187 | Altberg et al. | Feb 2016 | A1 |
20160196583 | Altberg et al. | Jul 2016 | A1 |
Number | Date | Country |
---|---|---|
699785 | May 1995 | AU |
2004202940 | Apr 2005 | AU |
2475965 | Apr 2005 | CA |
2504623 | Sep 2005 | CA |
2506360 | Oct 2005 | CA |
2504629 | Nov 2005 | CA |
2566312 | Nov 2005 | CA |
2599184 | Aug 2006 | CA |
2599371 | Aug 2006 | CA |
2624389 | Apr 2007 | CA |
2685678 | Nov 2008 | CA |
2690837 | Jan 2010 | CA |
1836438 | Sep 2006 | CN |
1839405 | Sep 2006 | CN |
1998018 | Jul 2007 | CN |
101124557 | Feb 2008 | CN |
101258474 | Sep 2008 | CN |
1489529 | Dec 2004 | EP |
1522944 | Apr 2005 | EP |
1636751 | Mar 2006 | EP |
1646979 | Apr 2006 | EP |
1665156 | Jun 2006 | EP |
1754187 | Feb 2007 | EP |
1759344 | Mar 2007 | EP |
1851679 | Nov 2007 | EP |
1880340 | Jan 2008 | EP |
1938566 | Jul 2008 | EP |
1977385 | Oct 2008 | EP |
1977590 | Oct 2008 | EP |
2153399 | Feb 2010 | EP |
2201521 | Jun 2010 | EP |
2329046 | Mar 1999 | GB |
2407229 | Apr 2006 | GB |
2424973 | Oct 2006 | GB |
2425375 | Oct 2006 | GB |
2430767 | Apr 2007 | GB |
9233441 | Sep 1997 | JP |
9319812 | Dec 1997 | JP |
2005115945 | Apr 2005 | JP |
9705733 | Feb 1997 | WO |
9802835 | Jan 1998 | WO |
9804061 | Jan 1998 | WO |
9813765 | Apr 1998 | WO |
9838558 | Sep 1998 | WO |
9847295 | Oct 1998 | WO |
9955066 | Oct 1999 | WO |
0057326 | Sep 2000 | WO |
0127825 | Apr 2001 | WO |
0128141 | Apr 2001 | WO |
0244870 | Jun 2002 | WO |
03030507 | Apr 2003 | WO |
2005040962 | May 2005 | WO |
2005086980 | Sep 2005 | WO |
2005101269 | Oct 2005 | WO |
2005109287 | Nov 2005 | WO |
2005109288 | Nov 2005 | WO |
2005111887 | Nov 2005 | WO |
2005111893 | Nov 2005 | WO |
WO 2006091966 | Aug 2006 | WO |
WO 2006091970 | Aug 2006 | WO |
2007028173 | Mar 2007 | WO |
2007038618 | Apr 2007 | WO |
WO 2007086991 | Aug 2007 | WO |
WO 2007086992 | Aug 2007 | WO |
WO 2008005779 | Jan 2008 | WO |
WO 2008033953 | Mar 2008 | WO |
WO 2008040010 | Apr 2008 | WO |
WO 2008040013 | Apr 2008 | WO |
2008052083 | May 2008 | WO |
WO 2008058295 | May 2008 | WO |
WO 2008070327 | Jun 2008 | WO |
WO 2008134207 | Nov 2008 | WO |
WO 2010005420 | Jan 2010 | WO |
Entry |
---|
“Phones for Everyone Satellite Telephony”. Peter J Brown. (1998). Via Satellite. vol. 13, issue 8. Aug. 1, 1998. |
“AtOnce Talks Up E-mail Marketing Campaigns with ITXC Push to Talk Service,” Business Wire, Feb. 26, 2001. |
“ITXC Corp and Doubleclick Energize Banner Ads with Web Telephony; Companies Voice-Enable Banner Advertisements Using ITXC Push to Talk Service,” Business Wire, Dec. 12, 2000. |
Ads-Click, “ADS-click Adds Skype-Based Pay-Per-Call Advertising Capabilities to Its Private-Labeled Solution, which will be Unveiled at ad:tech New York,” Market Wire, Oct. 10, 2005. |
Greenberg, Ken, “Jambo Launches to Connect People and Businesses from the Internet to the Phone,” Market Wire, May 3, 2005. |
Greenberg, Ken, “Jambo Names Netzero Co-founder Stacy Haitsuka to New Post of Chief Information Officer,” Business Wire, Jul. 5, 2005. |
Greenberg, Ken, “Jambo Receives $5 Million in Financing from Kline Hawkes & Co., Westlake Venture Partners, Others,” Business Wire, Oct. 17, 2005. |
Hansell, Saul, “Google's Toughest Search is for a Business Model,” New York Times, Late Edition, Final ED, col. 02, p. 1, Apr. 8, 2002. |
Ingenio, Inc., “FindWhat.com Enters Agreement with Ingenio to Offer Pay Per Call Advertising Platform,” press release available at http://www.ingenio.com, Apr. 7, 2004. |
International Application No. PCT/US06/07023, Written Opinion and International Search Report, Aug. 7, 2007. |
International Application No. PCT/US06/07047, Written Opinion and International Search Report, Aug. 9, 2007. |
International Application No. PCT/US07/82439, Written Opinion and International Search Report, Feb. 21, 2008. |
Jambo, “Welcome to Jambo—The Leader in Pay-Per-Call Solutions,” company information retrieved from http://www.jambo.com, available at least by Oct. 17, 2005. |
Jingle Networks, Inc., “1-800-FREE411 Provides Two Great Opportunities to Acquire New Customers,” available at least by Oct. 20, 2005. |
Jingle Networks, Inc., “Introducing 1-800 FREE411: First Nationwide Free Telephone Directory Assistance Service,” Sep. 20, 2005. |
Mullins, Robert, “Yahoo Aims for Middle with New Web Advertising Strategy,” Silicon Valley/San Jose Business Journal, vol. 19, No. 30, p. 21, Nov. 23, 2001. |
Transaction History for U.S. Appl. No. 11/077,516, filed Mar. 9, 2005, entitled “System and Method to Merge Pay-for-Performance Advertising Models.” |
Transaction History for U.S. Appl. No. 11/559,860, filed Nov. 14, 2006, entitled “Methods and Apparatuses for Prioritizing Advertisements for Presentation.” |
Transaction History for U.S. Appl. No. 11/688,245, filed Mar. 19, 2007, entitled “Methods and Apparatuses for Prioritizing Featured Listings.” |
Transaction History for U.S. Appl. No. 11/863,208, filed Sep. 27, 2007, entitled “Systems and Methods to Provide Communication References from Different Sources to Connect People for Real Time Communications.” |
Transaction History for U.S. Appl. No. 12/534,770, filed Aug. 3, 2009, entitled “Methods and Apparatuses for Prioritizing a Listing of Information Providers.” |
“Applying Technology News,” Accounting Technology, p. 14, Feb./Mar. 1997. |
“Connecting to On-Line Car Shoppers: Auto Sellers Use Netcall Internet Call-Button Technology to Turn ‘Clicks’ into Interactive Sales,” Business Wire, p. 4089, Jul. 19, 1999. |
“Keen.com raises $60 Million from Prestigious Investors and Strategic Partners Just 60 Days After Launch of Its Live Answer Community,” Business Wire, Jan. 11, 2000. |
“NetCall Internet Call Buttons Enhance E-Commerce Customer Service and Sales,” PR Newswire, p. 7431, Aug. 9, 1999. |
“Sell and Buy Advice Online,” The Ottawa Citizen, p. D7, Nov. 29, 1999. |
“TriNet's ‘Help Me, I'm Stuck’ Internet Voice Button Services Pushes Web Pages to Online Users,” Business Wire, Mar. 25, 1998. |
Addeo, E.J. et al., “An Experimental Multi-Media Bridging System,” Frontiers in Computer Communications Technology, Computer Communications Review, vol. 17, No. 5, pp. 236-242, Aug. 11-13, 1987. |
Allexperts.com, company information retrieved from http://www.allexperts.com, available at least by Apr. 9, 2000. |
Angelo, Simon, “SurfBrains.com: Brains Online Save Time & Money,” M2 Presswire, Jul. 11, 2000. |
Answers.com, company information retrieved from http://www.answers.com, available at least by Aug. 8, 2000. |
Asthana, Abhaya et al., “A Small Domain Communications System for Personalized Shopping Assistance,” IEEE International Conference on Personal Wireless Communications, Publication No. 0-7803-1996-6/94, pp. 199-203, Aug. 18, 1994. |
About Intellectexchange.com, Inc., company information retrieved from http://www.intellectexchange.com/About.asp, pp. 1-12, available at least by Aug. 8, 2000. |
Bazini, Liz, “UpSnap Selects LookSmart to Sell Premium Listings on FREE 411 Service for Text-Enabled Cell Phones,” Nov. 4, 2004. |
Becker, Ralph, “ISDN Tutorial: Interfaces,” retrieved from http://www.ralphb.net/ISDN/ifaces.html, available at least by Apr. 21, 2000. |
Becker, Ralph, “ISDN Tutorial: Definitions,” retrieved from http://www.ralphb.net/ISDN/defs.html, available at least by Apr. 21, 2000. |
Broad, Doug et al., “Lucent Technology and Netscape Team to Deliver Lucent Ecommerce Solutions,” Business Wire, Sep. 23, 1998. |
Chimiak, William H. et al., “Multimedia Collaborative Remote Consultation Tools via Gigabit WAN in Teleradiology,” IEEE 13th Annual International Phoenix Conference on Computers and Communications, pp. 417-423, Apr. 12-15, 1994. |
Clark, Don, “Keen.com Plans Web Service Allowing Customers to Hold Private Phone Chats,” Wall Street Journal, Nov. 8, 1999. |
Collett, Stacey et al., “Why Online Browsers Don't Become Buyers,” Computerworld, vol. 33, No. 48, p. 14, Nov. 29, 1999. |
Dalton, Gregory, “Rent-An-Expert on the Web,” Information Week, p. 75, Sep. 6, 1999. |
Davey, Tom, “Wheeling and Dealing Online,” PC Week, vol. 13, No. 45, pp. 1, 129, Nov. 11, 1996. |
De Lasser, Eleena, “When Business Plan and Real World Clash,” Wall Street Journal, p. B1, Jun. 1999. |
Drescher, Bob et al., “Aspect Telecommunications Integrates the Web into the Call Center to Deliver New Level of Customer Service,” Business Wire, Aug. 5, 1996. |
Dyson, Esther, “Information, Bid and Asked,” Forbes, p. 92, Aug. 20, 1990. |
Ek, Brian, “Walker Digital Issued Landmark U.S. Pat. No. 5,862,223 for Global Internet Marketplace for Experts”, Business Wire, Jan. 26, 1999. |
Ellis, James E., “For Telesphere's Clients, Dial 1-900 TUF LUCK,” Business Week, pp. 88-89, Sep. 9, 1991. |
Exp.com, Inc., company information retrieved from http://www.exp.com, available at least by Sep. 20, 2000. |
Expertcity.com, “About Us,” company information retrieved from http://www.expertcity.com, available at least by Apr. 9, 2000. |
Experts Exchange, Inc., company information retrieved from http://www.experts-exchange.com, available at least by Apr. 9, 2000. |
Green Digital Media, Inc., Big Green Blog: Jan. 2005 Archives, Jan. 28-31, 2005. |
Greenblatt, Ellen, “Have You Ever Wondered. . . .,” Datamation, p. 126, Oct. 1997. |
Griffiths, J.W.R. et al., “Multimedia Communication in a Medical Environment,” Singapore International Conference on Networks, pp. 166-171, Sep. 5, 1991. |
Hase, Masahiko et al., “Advanced Videophone System Using Synchronized Video Filing Equipment,” NTT Review, vol. 3, No. 4, pp. 29-36, Jul. 1991. |
Healey, John, “From A-Z: You Can Sell Advice Online,” San Jose Mercury News, retrieved from http://www.mercurycenter.com on Oct. 24, 2001. |
Herman, Edith, “U.S. Courts to Launch First Federal 900 Service,” Federal Computer Week, pp. 8, 10, Sep. 28, 1992. |
Herzberg, Amir et al., “MiniPay: Charging Per Click on the Web,” Computer Networks and ISDN Systems, vol. 29, pp. 939-951, Sep. 1997. |
Hodgson, Cynthia, “Online Expert Databases & Services,” Econtent, pp. 48-53, Dec. 1999. |
Information Markets Corp., company information retrieved from http://www.infomarkets.com, available at least by Aug. 8, 2000. |
Ingenio, Inc., “Keen: Your Personal Advisor,” retrieved from http://www.keen.com, available at least by Feb. 4, 2006. |
Ingenio, Inc., Press Archives for 2004, retrieved from http://www.ingenio.com on Feb. 21, 2006. |
International Application No. PCT/US05/12061, Written Opinion and International Search Report, Nov. 17, 2006. |
International Application No. PCT/US01/48284, International Search Report, May 13, 2002. |
Jarvie, Barbara, “Company Devoted to Hot-Line Support,” Computer Reseller News, p. 48, Oct. 21, 1991. |
Kabeya, Kiyoshi et al., “A New Teleconsultation Terminal System Using ISDN,” NTT Review, vol. 3, No. 4, pp. 37-43, Jul. 1991. |
Kanellos, Michael, “Web Watch: Do You Want to Know the Meaning of Life?,” Computer Reseller News, pp. 72-74, Mar. 3, 1997. |
Keen.com, “Keen.com Launches First Live Answer Community, Connects People with Information to Share Over Their Standard Telephone,” company press release, Nov. 8, 1999. |
Keen.com, company information retrieved from http://www.keen.com, available at least by 1999. |
Kuehn, Richard A., “The Voice of Technology,” Credit World, pp. 20-23, Jul. 1994. |
Littleton, Linda, “HDD: A Helpdesk Database,” Proceedings of the ACM SIGUCCS User Services Conference XXII, pp. 205-210, Oct. 16-19, 1994. |
Ludwig, L.F. et al., “Laboratory for Emulation and Study of Integrated and Coordinated Media Communication,” Conference on Office Information Systems, pp. 283-291, Mar. 23-25, 1988. |
Melideo, John, U.S. Appl. No. 60/471,535 entitled “HyperDial,” filed May 19, 2003. |
Menn, Joseph, “An Expert? There's Now a Home for You on the Internet,” Los Angeles Times, retrieved from http://www.denverpost.com on Oct. 24, 2001. |
Mercalli, Franco et al., “The ESSAI Teleshopping System: An Example of a Broadband Multimedia Application,” IEEE Global Telecommunications Conference, pp. 572-576, Nov. 28, 1994. |
Moore, Michael et al., “USA Global Link Brings Interactively to Internet Shopping,” Business Wire, Oct. 7, 1998. |
Ott, Chris, “Making Good on the Information Economy,” Denver Business Journal, vol. 51, No. 17, p. 27A, Dec. 17, 1999. |
Pelline, Jeff, “Net Firm to Connect Users by Phone,” CNET News.com, Nov. 8, 1999. |
Qcircuit.com, company information retrieved from http://www.qcircuit.com, available at least by Aug. 8, 2000. |
Reding, Craig et al., U.S. Appl. No. 09/596,466 entitled “Methods and Apparatus for Providing Telephone Support for Internet Sales,” filed Jun. 19, 2000. |
Robinson, John, “Attachmate Ready to Answer 'Net Questions,” Network World, p. 37, Apr. 8, 1996. |
Rogers, Michael et al., “Experts Abound at New Web Sites,” Library Journal, pp. 22-24, Mar. 1, 2000. |
Sairamesh, Jakka et al., “NetBazaar: Networked Electronic Markets for Trading Computation and Information Services,” Second European Conference on Research and Advanced Technology for Digital Libraries, pp. 839-856, Sep. 21, 1998. |
Tehrani, Rich, “e-Rip Van Winkle and the 60-second Nap,” Call Center Solutions, vol. 18, No. 2, pp. 16-18, Aug. 1999. |
Telecommunications Buyers Guide and Directory, Editor & Publisher, pp. 29TC-38TC, Feb. 12, 1994. |
U.S. District Court, Southern District of New York, Keen.com, Inc. v. InfoRocket.com, Inc., Preliminary Injunction Hearing, pp. 286-289, Jan. 8, 2002. |
U.S. District Court, Southern District of New York, Keen.com, Inc. v. InfoRocket.com, Inc.: Complaint for Patent Infringement, Trade Dress Infringement and Unfair Competition; Demand for Jury Trial, Aug. 31, 2001. |
University of Texas—Austin, information on the Electronic Emissary Project retrieved at www.tapr.org/emissary, available at least by Apr. 9, 2000. |
Wagner, Mary, “Caring for Customers: Real-Time Text Chat and Telephony Provide Personalized Customer Support and Turn Queries into Sales Leads,” Internet World Media, vol. 5, iss. 28, p. 30, Sep. 1, 1999. |
Wasik, Joann M., “Information for Sale: Commercial Digital Reference and AskA Services,” Virtual Reference Desk, http://www.vrd.org/AskA/commAskA.html, Sep. 20, 1999. |
Wieland, Heidi et al., “Expertcity.com Launches Premier Online Marketplace for Expert Services,” PR Newswire, Aug. 30, 1999. |
Wood, Christina, “Hidden Cost of Tech Support,” PC World, pp. 143-152, 156, May 1995. |
International Searching Authority, International Search Report, PCT/US06/07023, Aug. 7, 2007, 1 page. |
“Expertcity.com Launches Premier Online Marketplace for Expert Services,” PR Newswire (Aug. 1999). |
“Google's Toughest Search Is for a Business Model,” Saul Hansell, New York Times, Late Edition—Final ED, Col. 02, p. 1, Monday, Apr. 8, 2002. |
“Yahoo aims for middle with new Web advertising strategy,” Mullins, Robert, Silicon Valley/San Jose Business Journal v19n30, p. 21, Nov. 23, 2001. |
Big Green Blog: Jan. 2005 Archives, Feb. 21, 2006. |
CIPO Office Action for Application No. 2,599,184, Aug. 27, 2015, 5 pages, Canada. |
CIPO Office Action for Application No. 2,599,184, Feb. 28, 2012, 5 pages, Canada. |
European Patent Office, Extended European Search Report, 06736362.2, Jun. 17, 2011, 4 pages, Germany. |
U.S. Appl. No. 09/596,466, “Methods and apparatus for providing telephone support for internet sales”, Unpublished (filed Jun. 19, 2000), (Craig L. Reding, Inventor) (Bell Atlantic Network Services, Inc., assignee). |
U.S. Appl. No. 60/198,642, “Systems and methods for connecting customers to merchants over a voice communication network,” Unpublished (filed Apr. 20, 2000), (Peter Rothschild, Inventor). |
U.S. Appl. No. 60/471,535, “HyperDial”, Unpublished (filed May 19, 2003), (John Melideo, Inventor). |
U.S. Appl. No. 60/552,124, “Method and apparatus to provide pay-per-call advertising and billing,” Unpublished (filed Mar. 10, 2004), (Scott Faber, Inventor). |
U.S. Appl. No. 60/560,926, “Method and apparatus to track demand partners in a pay-per-call performance based advertising system,” Unpublished (filed Apr. 9, 2004), (Scott Faber, Inventor). |
U.S. Appl. No. 60/568,156, “Method and apparatus to allocate telephone numbers to demand partners in a pay-per-call performance based advertising system,” Unpublished (filed May 4, 2004), (Scott Faber, Inventor). |
USPTO Notice of Allowance for U.S. Appl. No. 11/072,147, filed Mar. 3, 2011, 12 pages, USA. |
USPTO Office Action for U.S. Appl. No. 11/072,147, filed Jul. 26, 2010, 24 pages, USA. |
USPTO Office Action for U.S. Appl. No. 11/072,147, filed Mar. 16, 2010, 24 pages, USA. |
USPTO Office Action for U.S. Appl. No. 11/072,147, filed Mar. 5, 2009, 49 pages, USA. |
USPTO Office Action for U.S. Appl. No. 11/072,147, filed Sep. 11, 2009, 18 pages, USA. |
Number | Date | Country | |
---|---|---|---|
20110264517 A1 | Oct 2011 | US |
Number | Date | Country | |
---|---|---|---|
60656637 | Feb 2005 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11072147 | Mar 2005 | US |
Child | 13179121 | US |