Targeted advertisement network that integrates with store-shopping

• US 20070162344A1
• Filed: 03/15/2007
• Published: 07/12/2007
• Est. Priority Date: 06/09/2005
• Status: Abandoned Application

• Current Assignee: Jianfeng Jiang
• Original Assignee: Jianfeng Jiang
• Inventors: Jiang, Jianfeng
• Application Number:
  US11/717,850
• Publication Number:
  US 20070162344A1
• Time in Patent Office: Days
• US Class Current: 705/14.610
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0253 During e-commerce, i.e. online transactions
• CPC Class Codes: G06Q 30/0256 User search
• CPC Class Codes: G06Q 30/0257 User requested
• CPC Class Codes: G06Q 30/0262 during computer stand-by mode
• CPC Class Codes: G06Q 30/0264 based upon schedule
• CPC Class Codes: G06Q 30/0267 Wireless devices
• CPC Class Codes: G06Q 30/0272 Period of advertisement exposure
• CPC Class Codes: G06Q 30/0273 Determination of fees for advertising
• CPC Class Codes: G06Q 30/0275 Auctions

Abstract

A new targeted Advertisement network that integrates with store-shopping includes at least one on-line provider of advertisements, a network of computers with assigned attributes for displaying the advertisements, a module collecting the assigned attributes of the computers and delivering the advertisements to the computers accordingly, and a desktop program installed in each computer to run the ads and interface with viewers.

Claims

1. A new targeted advertisement network comprising:

At least one on-line provider of advertisements;

A network of terminals coupled to the at least one on-line provider of advertisements;

A desktop program running on the terminals; and

A network management module.

2. The new targeted advertisement network of claim 1, wherein the on-line provider of advertisements sends ad contents to the network of terminals in web content format.

3. The new targeted advertisement network of claim 1, wherein multiple advertisers independently submit ads, specify which terminals and what dates to play ads and how much time each day to play the ads, the network management module automatically make the daily ad-play schedule for each terminal.

4. The new targeted advertisement network of claim 1, wherein each terminal has a client list so that only advertisers in the client list can send ads directly to this terminal.

5. The new targeted advertisement network of claim 1, wherein multiple advertisers can bid for ad-play time for any terminals according to the terminal profiles.

6. The new targeted advertisement network of claim 1, wherein terminals can be virtual, the scheduled contents for these virtual terminals are electronic catalogs for users to download.

7. the new targeted advertisement network of claim 2, wherein the web content format consists of dhtml format

8. The new targeted advertisement network of claim 1, wherein the desktop program comprises a user-interface

9. The new targeted advertisement network of claim 8, wherein the user-interface stays in the automatically broadcast mode in which the ads are played repeatedly if there are no user-interactions

10. The new targeted advertisement network of claim 8, wherein ads played by the user-interface can be clicked to view more detailed information about the ads.

11. The new targeted advertisement network of claim 8, wherein the user-interface has a timeout feature that forces the interface into the automatically broadcast mode if there are no user-interactions within the timeout period.

12. The new targeted advertisement network of claim 8, wherein the texts describing the ad name and selling price will oscillate or circulate if they are too long to fit in the allocated space for texts.

13. The new targeted advertisement network of claim 8, wherein several ads with different sizes are grouped together to fit in one page automatically by a program.

14. The new targeted advertisement network of claim 8, wherein ads are listed under their corresponding category buttons.

15. The new targeted advertisement network of claim 14, wherein the category buttons are generated automatically according to the product directory in the at least one on-line provider of advertisements.

16. The new targeted advertisement network of claim 14, wherein the category buttons are generated automatically using the following algorithm:

16.1. Get the maximum number of displayable category buttons per page, which can be denoted as MaxCNo;

16.2 Get the list of all the product or advertisement entries to be displayed in a terminal;

16.3 Get the category tree of all the entries based on the category tree of the E-commerce site where the entries are registered;

16.4 Get list of top categories that have non-zero product entries;

16.5 If the number of top categories are larger than the maximum number of displayable categories, then the categories with the smallest number of product entries will be absorbed into the Miscellaneous category;

otherwise the top level categories will be copied directly as the final top level categories;

16.6 After the top level categories are set, go to the next level categories, repeat the steps 16.4 to 16.5, until the lowest levels of product categories are reached.

17. The new targeted advertisement network of claim 14, wherein all of a user'"'"'s listed ads in a terminal fall into one category button if the user bought the right-of-use of the button.

18. The new targeted advertisement network of claim 1, wherein a terminal can be set as a proxy server so that several other terminals can be coupled to the at least one on-line provider of advertisements through the proxy server

19. The new targeted advertisement network of claim 8, wherein the user-interface couples with a barcode scanner, so that detailed multimedia information of a product can be shown by scanning the barcode.

20. An algorithm to compute the category buttons when there are many entries registered with one category tree are to be displayed with limited number of category buttons:

20.1 Get the maximum number of displayable category buttons, which can be denoted as MaxCNo;

20.2 Get the list of all the entries to be displayed;

20.3 Get the category tree of all the entries based on the category tree the entries are registered;

20.4 Get list of top categories that have non-zero entries;

20.5 If the number of top categories are larger than the maximum number of displayable categories, then absorb some categories into the Miscellaneous category;

otherwise the top level categories will be copied directly as the final top level categories;

20.6 After the top level categories are set, go to the next level categories, repeat the steps 20.4 to 20.5, until the lowest levels of categories are reached.