The present disclosure generally relates to the field of computing. More particularly, an embodiment of the invention generally relates to techniques for provision of offline advertising services.
As the Internet is quickly becoming an integral part of everyday living, advertisements provided via the Internet has become a significant source of income for vendors that provide Internet-based services.
For example, Internet served advertisements that accompany applications (such as Gmail™) may not be served, viewed or measured when such applications are used in their offline mode. More specifically, Internet applications like Gmail™ may be accessed when the user is not connected to the Internet; however, Internet served advertisements that accompany such applications may not be served, viewed, or measured when such applications are used in their offline mode. This prevents Independent Software Vendors (ISVs) from being able to earn advertising revenue with their applications when such applications are accessed offline.
Accordingly, when a computing device is offline, advertising revenues may not be securely accounted for or realized.
The detailed description is provided with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference numbers in different figures indicates similar or identical items.
In the following description, numerous specific details are set forth in order to provide a thorough understanding of various embodiments. However, various embodiments of the invention may be practiced without the specific details. In other instances, well-known methods, procedures, components, and circuits have not been described in detail so as not to obscure the particular embodiments of the invention. Further, various aspects of embodiments of the invention may be performed using various means, such as integrated semiconductor circuits (“hardware”), computer-readable instructions organized into one or more programs (“software”), or some combination of hardware and software. For the purposes of this disclosure reference to “logic” shall mean either hardware, software (including for example micro-code that controls the operations of a processor), or some combination thereof.
Some of the embodiments discussed herein may allow for provision, realization, and/or secure accounting of offline user views, for example, where a computing device displaying advertising is not connected to any online services such as the Internet, Wide Area Network (WAN), etc. As discussed herein, reference to examples regarding advertisement or content deliver services is intended to also equally apply to any type of user views (e.g., associated with advertising, multimedia (e.g., audio, image, and/or video), parental control, etc. data). As discussed herein, “user views” may be interchangeable with user consumption of content and/or interaction with content.
In some current implementations, a user has to be connected to a server on-line to allow for one or more of: Delivery of ads, collection of interaction data, cycle/refresh ads, enforce advertiser targeting criteria, implement user privacy controls, and/or proper advertisement metric accounting. When a user goes off-line, however, the advertisement server has no way of tracking user views and metrics securely or other actions mentioned before. To this end, apparatus, method(s), and system(s) are provided to allow applications that work, at least partially, on a local computing device (e.g., without an Internet/intranet or other private/public WAN connection) to be able to securely display, authenticate, and/or verify that user views are not tampered, e.g., to avoid possible erroneous user view metrics reporting, malicious—either faked views by the user (vested interest), or by malicious software/malware/virus, etc. As will be further discussed herein, the local computing device may include a local memory (which may be any type of memory device such as those discussed herein with reference to
In one embodiment, images, video, audio, etc. are provided to the client 202 while offline (e.g., when dialup, Wireless Fidelity (WiFi), third generation partnership project (3G), etc. may be intermittent or temporarily unavailable). When the client goes back online, collected view analytic data or interaction data (e.g., user plays a game which is embedded into an Ad) are provided to an ad server and/or CDN for secure accounting. In an embodiment, a Trusted Platform Module (TPM) may be used to protect data and/or application execution related to user views on a local device while the device is offline. An embodiment provides a secure hardware environment for user view data and metric software to exist and to verify such data/application has not been compromised while the device is not connected to a network.
Various computing environments may be used to implement the embodiments discussed herein. For example,
The devices 104-114 may be coupled to the network 102 through wired and/or wireless connections. Hence, the network 102 may be a wired and/or wireless network. For example, as illustrated in
The network 102 may utilize any type of communication protocol such as Ethernet, Fast Ethernet, Gigabit Ethernet, wide-area network (WAN), fiber distributed data interface (FDDI), Token Ring, leased line, analog modem, digital subscriber line (DSL and its varieties such as high bit-rate DSL (HDSL), integrated services digital network DSL (IDSL), etc.), asynchronous transfer mode (ATM), cable modem, and/or FireWire.
Wireless communication through the network 102 may be in accordance with one or more of the following: wireless local area network (WLAN), wireless wide area network (WWAN), code division multiple access (CDMA) cellular radiotelephone communication systems, global system for mobile communications (GSM) cellular radiotelephone systems, North American Digital Cellular (NADC) cellular radiotelephone systems, time division multiple access (TDMA) systems, extended TDMA (E-TDMA) cellular radiotelephone systems, third generation partnership project (3G) systems such as wide-band CDMA (WCDMA), etc. Moreover, network communication may be established by internal network interface devices (e.g., present within the same physical enclosure as a computing system) or external network interface devices (e.g., having a separate physical enclosure and/or power supply than the computing system to which it is coupled) such as a network interface card or controller (NIC).
In an embodiment, devices 106-110 may provide, realize, and/or securely account for offline user views, e.g., in accordance with local processing and/or at the direction of server 104, as is discussed herein, e.g., with reference to remaining figures.
In some embodiments, performing at least some user view related operations on a local device may allow for more precise targeting since user profile data may be securely present on the local device. On the contrary, other options such as using browser cache or perfecting before a user goes offline, may not dynamically target users, cycle advertisement inventory, or provide trusted and detailed ad performance data.
The service 210 may include a policy manager, OS process, device context module 211, a local HTTP server 212 (e.g., at address 127.0.0.1, to provide ads/content to the browser 206), an HTTP client 214 (to couple with ad server(s) and/or Content Delivery/Distribution Networks (CDNs)), and a secure Local Ad/content Server (LAS) database 216.
As shown in
As shown, a client may first boot 302 (e.g., by setting up an account, enroll publishers or ad networks, and/or provide profile information which may be used to initialize the device context 211), and then send a page request 304 to a service (e.g., http://www.xyz.com) via LAS (which in an embodiment may be the OS HTTP client 208 of
In one embodiment, ads may be periodically fetched from an ad server. For example (e.g., as a default option in an embodiment), pre-fetch may be performed asynchronously based on user profile (and subsequently served when offline). Also (e.g., as an opt-out option in an embodiment), ad/content may be fetched when a user visits an online property (e.g., fetch when online and serve when offline). As previously discussed, the ads may be stored in a local database (e.g., database 216). Also, while offline, ad servicing/metrics from the local database may be securely tracked and stored and subsequently uploaded to ad/content servers once online, e.g., based on network connection status.
In an embodiment, a secured database may be used for storing Ad metrics, user profile, and advertiser criteria at the client. This security can be provided through several options, such as encryption, authentication, and combinations thereof. Furthermore, the ads displayed while offline may be cycled by implementing advertiser frequency capping, TTL (Time To Live), etc. policies.
In some embodiments, processor utilization at the client device may be monitored (e.g., over some recent history), along with memory page faults, or other memory load/access (e.g., over some recent history) and used as parameters when determining network availability, device availability, and/or user preferences over a period of time to determine the best time window to interact with the service in the cloud. Each of the three criteria may be clusters of variables like bandwidth, latency for network, processor, memory, etc. for device and time of day and other self expressed data for user preferences.
In an embodiment, the network service(s) 406 are implemented by the OS and/or drivers provided by the hardware on the client system. Network services may provide access to granular information on the state of the network connection including connection state, bandwidth consumed and available, and/or other network parameters. For example, a polling and/or a notification method to determine the status of the network connection may be implemented. This interface may be implemented with available APIs (Application Programming Interfaces) with the networking hardware driver or proprietary programming interfaces. The bandwidth consumption on the available network connection(s) may be monitored (e.g., based on historic data in an embodiment) as one of the inputs to determine the best time window to request advertising elements from the Ad server or upload locally collected metrics to the Ad server (e.g., when bandwidth consumption is reduced).
Referring to
Regardless of whether the user opts out of offline ad provision, advertisements may still be stored in a local database on the client in an embodiment. This may be implemented as hardware secured or unsecured database on available forms of storage (e.g., Solid State Drive (SSD) or Hard Disk Drive (HDD)). The database may be segmented by partner publisher, web property and advertising elements.
The ad database may store the following in an embodiment:
Personal Profile Manager 412 may be implemented as an opt out mechanism (e.g., user is opted in by default) and mechanisms may be provided to the user to opt-out. In an embodiment, opt-out may be provided at the following two levels:
a. Service Opt-Out—User has the option to completely opt out of the advertising service. This may be implemented through BIOS (Basic Input/Output System), OS or application level controls that are accessible to and may be manipulated by the user.
b. Publisher Opt-Out—The user has the option of opting out of the service for a particular publisher.
The user profile information may be collected and managed in a secured database. In some embodiments, some additional components of the personal profile may include:
(1) Application Usage History
(2) Personal Profile Information
(3) System Usage History
An ad criteria manager 414 may perform one or more of the following:
In an embodiment, an ad fetching mechanism may be implemented as an opt-out model where advertisements are pre-fetched from the ad server. If the user opts-out of offline ad provision, then the advertisements are cached only when the user visits the web property.
An ad metrics manager 416 may perform one or more of the following:
a. keep track of advertisements served on the client when user is offline (e.g., per partner, per property, etc.)
b. create secured data packet for transmission to ad server once online
c. interacts with the network services layer (e.g., services 406) to determine the best time window to upload locally collected metrics to the ad server.
In some embodiments, choosing the advertisement to be displayed may be done by intersecting three criteria:
1. The advertisers targeting criteria
2. The user's profile information
3. The browsing context at the time a request to the ad network is made
When the user is offline, criteria 3 above may not be met since the client is not reachable by the ad server and the Ad server may not determine when the user may go offline. When the client is offline, the client and the ad sever may split the targeting work load in order to ensure user profile privacy/protection. In an embodiment, this may be implemented as follows:
a. Create basic, non-PII profile: The actual, full user profile remains protected on the client and an abbreviated profile without any Personally Identifiable Information (PII) is created and sent to the ad server (e.g., gender, age, location).
b. Advertiser criteria: The ad server may use this information to intersect with the advertiser criteria and determine one or several advertiser matches. This information may be sent back to the client.
c. Ad serving priority: In case of more than one ad creative, rules that allow for determining which ad creative to pick for serving to the client
d. Run targeting algorithm. The client may use this information in conjunction with the full profile to refine the advertiser-user matches.
e. Request ad element(s): Using the refined targeting information, the client requests for one or more ad elements from the ad server (e.g., may be redirected to the ad content server at this point of time)
In some embodiments, when the user opts out of offline ad provision, the client may not create or store any profile information. No behavioral ad targeting may be carried out on the client. This, however, may not preclude behavioral targeting by the ad server. Separate mechanisms for opting out of behavioral targeting by the ad server may or may not exist.
In some embodiments, auctions may be run at two levels: (a) Pre-roll auction with bare-bones, non-PII user profile; and (b) Full-roll auction with full user profile, advertiser criteria and offline context.
In an embodiment, a time window is defined as a discrete, continuous period of time measured at equal intervals of real time. The duration of a time window is defined by a policy and could thus be one second long or one minute long or any other policy defined real time length.
In some embodiments, three clusters of elements may be defined for the three types of input elements—User cluster, Publisher/Property cluster and Algorithm cluster. Each cluster is assigned a unique weighting factor that is defined by a policy and contains its own, unique set of elements. Each element within a cluster is assigned a score between 0-10 based on some computation. The final publisher score evaluates to a value between 0-1 and is determined by:
Publisher/property score=(User cluster weight×ΣElement scores)+(Publisher cluster weight×ΣElement scores)+(Algorithm cluster weight×ΣElement scores)
A higher score indicates higher preference for requesting that publishers ad elements from the ad server. At the end of the prioritizing exercise, the publisher/property that has the highest score is chosen as the winner and provides the ads to the client.
The user cluster groups all elements that are dependent on user behavior, including but not limited to, probability of user visiting a publishers web property (P(visit)), ad interaction time and time spent. More particularly, each element may have its own bounds of operation and its own units, e.g., time spent element is a discrete integer and denominated in ‘time windows’. Probability of visiting the property is a real number between 0 & 1. In one embodiment, in order to be able to sum up elements within their cluster, each element may be normalized on a unit-less scale of 0-1. Moreover, a user cluster may group all elements that are dependent on user behavior, including for example, interaction time, time spend, P(Visit), etc. P(Visit) defines the probability that the user will visit the web property in the current time window and is a real number between 0 & 1. This can be determined by using a Bayesian Inference model where historical evidence of visits to the web property is maintained (see, e.g.,
Time Spent on property defines the amount of time a user spends on the partner web property and is expressed in real time per time window, e.g., user spent 20% of the time window on the partner property. Thus it is a real number between 0 and 1. Expected time spent in the current time window could simply be the running average of previous ‘n’ window times or could be expressed as a probability of the user spending more than a baseline fraction of time. This probability can be determined by using a Bayesian Inference model where historical evidence of times spent above or below baseline is maintained. This evidence is used to recalculate P(Time spent>Baseline) at the current time window. Referring to
Ad element exposure time defines the amount of time all ad elements from a partner publisher were exposed to the user and is expressed in real time per time window, e.g., user spent 20% of the time window on the partner property. Thus it is a real number between 0 and 1. The expected exposure time at the current time window is calculated using the running average or Bayesian approach similar to the ‘time spent on property’ approach above.
A publisher/property cluster may group all elements that are dependent on the publisher/web property, including element size, priority, expired elements, server response time, etc. Element size may the average size of all advertising elements fetched from the ad server in a single transaction. This could be maintained as a running average of the past ‘n’ transactions with the ad server and is a real number between 0 and the maximum allowed payload by the underlying transport mechanism. Server response time may define the expected response time of the ad sever to a request for ad elements and is expressed in real time units. The expected server response time at the current time window is calculated using the running average or Bayesian approach similar to the ‘time spent on property’ approach above. A policy decision needs to be made to prioritize ad servers with larger response times or to prioritize ad servers with lower response times. Accordingly, the expected server response time may be normalized as follows:
a. Policy: Prioritize larger response times
b. Policy: Prioritize smaller response times
Publisher priority may define the importance of the Intel-publisher relationship and is policy driven. This is expressed as an integer between 0-10 with 10 indicating highest priority and 0 indicating lowest priority. Expired elements may define the proportion of ad elements that have expired before being refreshed and is expressed as a proportion of expired to total ad elements for the publisher and is thus a real number between 0 and 1, with 0 indicating no expired ad elements and 1 indicating all ad elements have expired. Ad element expiry policy is defined by the advertiser.
An algorithm cluster may group all elements that influence the outcome of the results due to the nature of the ranking algorithm, e.g., including number of times selected. Number of times selected may define the number of times ad elements have been requested in the past ‘n’ time windows. It is conceivable that factors like excessive user activity on a particular site or very fast ad server repeatedly prioritizes one (or a small set of) ad server(s) and ad elements from other partner publishers never get downloaded. To avoid this situation, publishers/properties that have not been selected for download are prioritized over those that have already been selected for download. This is expressed as an integer between 0 (never selected) and ‘n’ (always selected) with ‘n’ indicating the number of time windows for which the history is being tracked. Num. times selected is normalized as: (a) 0 maps to 10 on the normalized scale; and (b) ‘n’ maps to 0 on the normalized scale.
In an embodiment, “stale” Ads may be deleted from the database, e.g., on a timed (periodic) removal or based on response received from ad server (indicating to remove certain or all or old ad elements—‘Old’ as defined by policy). Also, in one embodiment, a partial auction may be performed, e.g., to determine one or more advertisers who will later participate in a full auction. In an embodiment, winners of partial auction may have equal probability of being selected before going into full auction. A full auction may select an ad element to be displayed on publisher site when accessed by the user.
Moreover, network status may be taken into account to determine whether to request ad elements from an ad server. For example three clusters may be composed of input elements—user preferences, device capabilities and partner (over network) characteristics. Each cluster may be assigned a unique weighting factor that is defined by a policy and contains its own, unique set of elements. Each element within a cluster may be assigned a score between 0-10 based on some computation. Moreover, in order to be able to sum up elements within their cluster, each element may be normalized on a unit-less scale of 0-10. Network availability may be defined as a Boolean variable, e.g., 1: Network services available; 0: Network services not available. This could be implemented as a ping to the ad server, where ping response failure evaluates to 0 and ping success evaluates to 1. Network availability is not normalized. The user preferences cluster may define users' self-expressed preferences (e.g., don't connect between 6 pm-10 pm—Time of Day control, don't connect over a tethered connection like when using a cell phone connected to the PC to access the network on the PC, etc.). The device capabilities cluster may define capabilities/limitations of the device, for example, (a) static properties such as type of network, type of physical link, etc. (although they may change from time to time, e.g., when a user switches from a LAN connection to a WiFi network); and (b) dynamic properties such as (average) bandwidth used/available over time windows, device load that could in turn be measured as: processor utilization, memory load (number of page faults), disk load (number of reads or writes), etc.
The partner (over network) characteristics cluster may define partner characteristics such as publisher priority (a function of relationship between a managing entity and the partner), response time (which could be determined from ping response latency or dynamically tracked as ad elements are requested). A go/no go score may evaluate based on a value between 0-1. Compute score as:
Go No-Go Score=Network Availability*(User preferences. cluster weight×ΣElement scores)+(Device capabilities cluster weight×ΣElement scores)+(Partner characteristics cluster weight×ΣElement Scores)
A threshold could be a 2-level threshold that when reached indicates a ‘Go’ decision and a minimum level is passed on the way down indicates a ‘No go’ decision. For example, let upper and lower thresholds be T(max) and T(min) respectively, where 0<T(min)<T(max)<1. If T(min)<=‘Go No-Go Score’<=T(max) then the decision is a ‘Go’. If the ‘Go No-Go Score’ is rising (Value in previous time window<value in current time window) AND the score is greater than T(min), then the decision is a ‘Go’. If the ‘Go No-Go Score’ is falling (Value in previous time window>value in current time window) AND the score is lesser than T(min), then the decision is a ‘No Go’.
Moreover, the computing system 700 may include one or more central processing unit(s) (CPUs) 702 or processors that communicate via an interconnection network (or bus) 704. The processors 702 may include a general purpose processor, a network processor (that processes data communicated over a computer network 703 which may be the same or similar to network 102 of
A chipset 706 may also communicate with the interconnection network 704. The chipset 706 may include a memory control hub (MCH) 708. The MCH 708 may include a memory controller 710 that communicates with a memory 712. The memory 712 may store data, including sequences of instructions that are executed by the CPU 702, or any other device included in the computing system 700. In one embodiment of the invention, the memory 712 may include one or more volatile storage (or memory) devices such as random access memory (RAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), static RAM (SRAM), or other types of storage devices. Nonvolatile memory may also be utilized such as a hard disk. Additional devices may communicate via the interconnection network 704, such as multiple CPUs and/or multiple system memories.
The MCH 708 may also include a graphics interface 714 that communicates with a display 716. The display 716 may be used to show a user results of operations associated with the Brownian Bridge algorithm discussed herein. In one embodiment of the invention, the graphics interface 714 may communicate with the display 716 via an accelerated graphics port (AGP). In an embodiment of the invention, the display 716 may be a flat panel display that communicates with the graphics interface 714 through, for example, a signal converter that translates a digital representation of an image stored in a storage device such as video memory or system memory into display signals that are interpreted and displayed by the display 716. The display signals produced by the interface 714 may pass through various control devices before being interpreted by and subsequently displayed on the display 716.
A hub interface 718 may allow the MCH 708 and an input/output control hub (ICH) 720 to communicate. The ICH 720 may provide an interface to I/O devices that communicate with the computing system 700. The ICH 720 may communicate with a bus 722 through a peripheral bridge (or controller) 724, such as a peripheral component interconnect (PCI) bridge, a universal serial bus (USB) controller, or other types of peripheral bridges or controllers. The bridge 724 may provide a data path between the CPU 702 and peripheral devices. Other types of topologies may be utilized. Also, multiple buses may communicate with the ICH 720, e.g., through multiple bridges or controllers. Moreover, other peripherals in communication with the ICH 720 may include, in various embodiments of the invention, integrated drive electronics (IDE) or small computer system interface (SCSI) hard drive(s), USB port(s), a keyboard, a mouse, parallel port(s), serial port(s), floppy disk drive(s), digital output support (e.g., digital video interface (DVI)), or other devices.
The bus 722 may communicate with an audio device 726, one or more disk drive(s) 728, and a network interface device 730, which may be in communication with the computer network 703. In an embodiment, the device 730 may be a NIC capable of wireless communication. Other devices may communicate via the bus 722. Also, various components (such as the network interface device 730) may communicate with the MCH 708 in some embodiments of the invention. In addition, the processor 702 and the MCH 708 (or one or more of MCH's components) may be combined to form a single chip. Furthermore, the graphics interface 714 may be included within the MCH 708 in other embodiments of the invention.
Furthermore, the computing system 700 may include volatile and/or nonvolatile memory (or storage). For example, nonvolatile memory may include one or more of the following: read-only memory (ROM), programmable ROM (PROM), erasable PROM (EPROM), electrically EPROM (EEPROM), a disk drive (e.g., 728), a floppy disk, a compact disk ROM (CD-ROM), a digital versatile disk (DVD), flash memory, a magneto-optical disk, or other types of nonvolatile machine-readable media that are capable of storing electronic data (e.g., including instructions). In an embodiment, components of the system 700 may be arranged in a point-to-point (PtP) configuration such as discussed with reference to
More specifically,
As illustrated in
The processors 802 and 804 may be any suitable processor such as those discussed with reference to the processors 702 of
At least one embodiment of the invention may be provided by utilizing the processors 802 and 804. For example, the processors 802 and/or 804 may perform one or more of the operations of
The chipset 820 may be coupled to a bus 840 using a PtP interface circuit 841. The bus 840 may have one or more devices coupled to it, such as a bus bridge 842 and I/O devices 843. Via a bus 844, the bus bridge 843 may be coupled to other devices such as a keyboard/mouse 845, the network interface device 830 discussed with reference to
In various embodiments of the invention, the operations discussed herein, e.g., with reference to
Additionally, such tangible computer-readable media may be downloaded as a computer program product, wherein the program may be transferred from a remote computer (e.g., a server) to a requesting computer (e.g., a client) by way of data signals transferred via a communication link (e.g., a bus, a modem, or a network connection).
Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least an implementation. The appearances of the phrase “in one embodiment” in various places in the specification may or may not be all referring to the same embodiment.
Also, in the description and claims, the terms “coupled” and “connected,” along with their derivatives, may be used. In some embodiments of the invention, “connected” may be used to indicate that two or more elements are in direct physical or electrical contact with each other. “Coupled” may mean that two or more elements are in direct physical or electrical contact. However, “coupled” may also mean that two or more elements may not be in direct contact with each other, but may still cooperate or interact with each other.
Thus, although embodiments of the invention have been described in language specific to structural features and/or methodological acts, it is to be understood that claimed subject matter may not be limited to the specific features or acts described. Rather, the specific features and acts are disclosed as sample forms of implementing the claimed subject matter.
Number | Name | Date | Kind |
---|---|---|---|
4769697 | Gilley et al. | Sep 1988 | A |
5515098 | Carles | May 1996 | A |
5661516 | Carles | Aug 1997 | A |
5911773 | Mutsuga et al. | Jun 1999 | A |
6334110 | Walter et al. | Dec 2001 | B1 |
6401034 | Kaplan et al. | Jun 2002 | B1 |
6708335 | Ozer et al. | Mar 2004 | B1 |
6941197 | Murakami et al. | Sep 2005 | B1 |
6947881 | Murakami et al. | Sep 2005 | B1 |
7134130 | Thomas | Nov 2006 | B1 |
7363151 | Nomura et al. | Apr 2008 | B2 |
7366683 | Altberg et al. | Apr 2008 | B2 |
7457828 | Wenner et al. | Nov 2008 | B2 |
7546619 | Anderson et al. | Jun 2009 | B2 |
7567800 | Uematsu et al. | Jul 2009 | B2 |
7636785 | Shahine | Dec 2009 | B2 |
7657626 | Zwicky | Feb 2010 | B1 |
7698236 | Cox et al. | Apr 2010 | B2 |
7730509 | Boulet et al. | Jun 2010 | B2 |
7778987 | Hawkins | Aug 2010 | B2 |
7831384 | Bill | Nov 2010 | B2 |
7835859 | Bill | Nov 2010 | B2 |
7904461 | Baluja et al. | Mar 2011 | B2 |
7974873 | Simmons et al. | Jul 2011 | B2 |
8108405 | Marvit et al. | Jan 2012 | B2 |
20010049620 | Blasko | Dec 2001 | A1 |
20010056461 | Kampe et al. | Dec 2001 | A1 |
20020023002 | Staehelin | Feb 2002 | A1 |
20020072952 | Hamzy et al. | Jun 2002 | A1 |
20020078444 | Krewin et al. | Jun 2002 | A1 |
20020129368 | Schlack et al. | Sep 2002 | A1 |
20020174025 | Hind et al. | Nov 2002 | A1 |
20030037333 | Ghashghai et al. | Feb 2003 | A1 |
20030191812 | Agarwalla et al. | Oct 2003 | A1 |
20040003392 | Trajkovic et al. | Jan 2004 | A1 |
20040133923 | Watson et al. | Jul 2004 | A1 |
20040240676 | Hashimoto et al. | Dec 2004 | A1 |
20050097595 | Lipsanen et al. | May 2005 | A1 |
20050160002 | Roetter et al. | Jul 2005 | A1 |
20050216345 | Altberg et al. | Sep 2005 | A1 |
20050283699 | Nomura et al. | Dec 2005 | A1 |
20060015637 | Chung | Jan 2006 | A1 |
20060090131 | Kumagai | Apr 2006 | A1 |
20060106944 | Shahine et al. | May 2006 | A1 |
20060241862 | Ichihara et al. | Oct 2006 | A1 |
20060242315 | Nichols | Oct 2006 | A1 |
20060253453 | Chmaytelli et al. | Nov 2006 | A1 |
20060271425 | Goodman et al. | Nov 2006 | A1 |
20070010942 | Bill | Jan 2007 | A1 |
20070073477 | Krumm et al. | Mar 2007 | A1 |
20070073682 | Adar et al. | Mar 2007 | A1 |
20070088801 | Levkovitz et al. | Apr 2007 | A1 |
20070121845 | Altberg et al. | May 2007 | A1 |
20070157262 | Ramaswamy et al. | Jul 2007 | A1 |
20070220010 | Ertugrul | Sep 2007 | A1 |
20070226320 | Hager et al. | Sep 2007 | A1 |
20070239527 | Nazer et al. | Oct 2007 | A1 |
20070239533 | Wojcicki et al. | Oct 2007 | A1 |
20070255617 | Maurone et al. | Nov 2007 | A1 |
20070294773 | Hydrie et al. | Dec 2007 | A1 |
20080021632 | Amano | Jan 2008 | A1 |
20080027639 | Tryon | Jan 2008 | A1 |
20080040370 | Bosworth et al. | Feb 2008 | A1 |
20080040475 | Bosworth et al. | Feb 2008 | A1 |
20080052168 | Peters et al. | Feb 2008 | A1 |
20080086477 | Hawkins | Apr 2008 | A1 |
20080097822 | Schigel et al. | Apr 2008 | A1 |
20080104195 | Hawkins et al. | May 2008 | A1 |
20080114651 | Jain et al. | May 2008 | A1 |
20080120308 | Martinez et al. | May 2008 | A1 |
20080162186 | Jones | Jul 2008 | A1 |
20080187114 | Altberg et al. | Aug 2008 | A1 |
20080222283 | Ertugrul et al. | Sep 2008 | A1 |
20080235088 | Weyer et al. | Sep 2008 | A1 |
20080235244 | Matsuo | Sep 2008 | A1 |
20080306808 | Adjali et al. | Dec 2008 | A1 |
20090049097 | Nocifera et al. | Feb 2009 | A1 |
20090106415 | Brezina et al. | Apr 2009 | A1 |
20090177528 | Wu et al. | Jul 2009 | A1 |
20090204706 | Ertugrul et al. | Aug 2009 | A1 |
20090216704 | Zheng et al. | Aug 2009 | A1 |
20090240569 | Ramer et al. | Sep 2009 | A1 |
20090307205 | Churchill et al. | Dec 2009 | A1 |
20090327486 | Andrews et al. | Dec 2009 | A1 |
20100031335 | Handler | Feb 2010 | A1 |
20100042317 | Tajima et al. | Feb 2010 | A1 |
20100049602 | Softky | Feb 2010 | A1 |
20100063877 | Soroca et al. | Mar 2010 | A1 |
20100076997 | Koike et al. | Mar 2010 | A1 |
20100082432 | Feng et al. | Apr 2010 | A1 |
20100094878 | Soroca et al. | Apr 2010 | A1 |
20100106603 | Dey et al. | Apr 2010 | A1 |
20100114864 | Agam et al. | May 2010 | A1 |
20100161492 | Harvey et al. | Jun 2010 | A1 |
20100250361 | Torigoe et al. | Sep 2010 | A1 |
20100281042 | Windes et al. | Nov 2010 | A1 |
20100293048 | Singolda et al. | Nov 2010 | A1 |
20100299225 | Aami et al. | Nov 2010 | A1 |
20110010433 | Wilburn et al. | Jan 2011 | A1 |
20110106436 | Bill | May 2011 | A1 |
20110154385 | Price et al. | Jun 2011 | A1 |
20110246213 | Yarvis et al. | Oct 2011 | A1 |
20110246214 | Yarvis et al. | Oct 2011 | A1 |
20110246283 | Yarvis et al. | Oct 2011 | A1 |
20110246300 | Yarvis et al. | Oct 2011 | A1 |
20110246469 | Yarvis et al. | Oct 2011 | A1 |
20110247029 | Yarvis et al. | Oct 2011 | A1 |
20110247030 | Yarvis et al. | Oct 2011 | A1 |
20110251788 | Yarvis et al. | Oct 2011 | A1 |
20110251918 | Yarvis et al. | Oct 2011 | A1 |
20110251990 | Yarvis et al. | Oct 2011 | A1 |
20110258203 | Wouhaybi et al. | Oct 2011 | A1 |
20110264553 | Yarvis et al. | Oct 2011 | A1 |
20110264613 | Yarvis et al. | Oct 2011 | A1 |
20110321073 | Yarvis et al. | Dec 2011 | A1 |
20120011538 | Yarvis et al. | Jan 2012 | A1 |
20120246000 | Yarvis et al. | Sep 2012 | A1 |
20120246065 | Yarvis et al. | Sep 2012 | A1 |
20120246684 | Yarvis et al. | Sep 2012 | A1 |
20120253920 | Yarvis et al. | Oct 2012 | A1 |
Number | Date | Country |
---|---|---|
101159818 | Apr 2008 | CN |
102223393 | Oct 2011 | CN |
102316364 | Jan 2012 | CN |
102612702 | Jul 2012 | CN |
1 217 560 | Jun 2006 | EP |
2481490 | Dec 2011 | GB |
2000-198412 | Jul 2000 | JP |
2006-333531 | Dec 2006 | JP |
2008-152564 | Jul 2008 | JP |
2008-236591 | Oct 2008 | JP |
2008546075 | Dec 2008 | JP |
2009-528639 | Aug 2009 | JP |
10-2002-0024645 | Apr 2002 | KR |
10-2006-0122372 | Nov 2006 | KR |
10-2006-0122375 | Nov 2006 | KR |
10-2007-0061601 | Jun 2007 | KR |
10-2009-0014846 | Feb 2009 | KR |
9907148 | Feb 1999 | WO |
0232136 | Apr 2002 | WO |
0232136 | Jun 2002 | WO |
02071298 | Sep 2002 | WO |
02082214 | Oct 2002 | WO |
02082214 | Jul 2004 | WO |
2006130258 | Dec 2006 | WO |
2007101263 | Sep 2007 | WO |
2008064071 | May 2008 | WO |
2006130258 | Apr 2009 | WO |
2009099876 | Aug 2009 | WO |
2011075119 | Jun 2011 | WO |
2011075120 | Jun 2011 | WO |
2011075137 | Jun 2011 | WO |
2011130034 | Oct 2011 | WO |
2011163411 | Dec 2011 | WO |
2012006237 | Jan 2012 | WO |
2011130034 | Apr 2012 | WO |
2011163411 | Apr 2012 | WO |
2012006237 | Apr 2012 | WO |
2012135239 | Oct 2012 | WO |
2012135239 | Dec 2012 | WO |
Entry |
---|
Office Action Received for the Chinese patent application No. 201010621563.4, mailed on Mar. 1, 2012, 6 pages of Office Action and 6 pages of English translation. |
Office Action Received for the Japanese Patent Application No. 2010-274870, mailed on Apr. 3, 2012, 1 page of Office Action and 2 page of English Translation. |
Office Action Received for European Patent Application No. 10252181.2 , mailed on Jan. 9, 2012, 4 pages of Office Action. |
European Search Report Received for European Patent Application No. 10252181.2, mailed on Dec. 23, 2011, 3 pages of EP Search Report. |
International Search Report and Written Opinion Received for PCT Application No. PCT/US2009/068689, mailed on Aug. 26, 2010, 11 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2009/068131, mailed on Sep. 1, 2010, 9 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2009/068129, mailed on Aug. 31, 2010, 10 pages. |
Office Action received for U.S. Appl. No. 13/129,968, mailed on Aug. 27, 2012, 19 pages. |
Wikipedia, “Nielsen ratings”, From Wikipedia, the free encyclopedia, retrieved on Feb. 1, 2013, 10 pages, webpage available at: http://en.wikipedia.org/wiki/Nielsen—ratings. |
Schonfeld, “Google Now Lets You Target Ads At Yourself”, TechCrunch, posted on Mar. 11, 2009, webpage available at: http://techcrunch.com/2009/03/11/google-now-lets-you-target-ads-at-yourself/, 2 pages. |
Introducing Google TV, “Introducing Google TV”, retrieved on Feb. 1, 2013, webpage available at: http://www.google.com/tv/. |
Eloda Protocol, “Eloda Protocol Suite of Products”, accessed on Aug. 17, 2011, 1 page, webpage available at: http://www.eloda.com/en/protocol/. |
TRA, “TRA- The Right Audience”, TRA, retrieved on Aug. 17, 2011, 1 page, webpage available at: http://www.traglobal.com/whatwedo.php. |
Office Action received for U.S. Appl. No. 13/159,896, mailed on Sep. 19, 2012, 14 pages. |
Office Action received for U.S. Appl. No. 13/159,894, mailed on Sep. 11, 2012, 13 pages. |
International Search Report and Written Opinion received for International Patent Application No. PCT/US2011/042786, mailed on Feb. 23, 2012, 8 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/031064, mailed on Dec. 14, 2011,8 pages. |
Combined Search and Examination Report received for United Kingdom Application No. 1108772.3, mailed on Sep. 26, 2011, 5 pages. |
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/041516, mailed on Feb. 24, 2012, 7 pages. |
International Search Report and Written Opinion International Search Report and Written Opinion for PCT Application No. PCT/US2011/049228, mailed on Mar. 27, 2012, 7 Pages. |
International Preliminary Report on Patentability and Written Opinion received for PCT Patent Application No. PCT/US2009/068689, mailed on Jun. 28, 2012, 8 pages. |
Office Action received for U.S. Appl. No. 13/159,874, mailed on Sep. 7, 2012, 14 pages. |
Office Action received for U.S. Appl. No. 13/159,884, mailed on Aug. 27, 2012, 19 pages. |
Office Action Received for the Chinese Patent Application No. 201010621563.4, mailed on Dec. 25, 2012, 8 pages of Office Action and 10 pages of English Translation. |
International Preliminary Report on Patentability and Written Opinion received for PCT Patent Application No. PCT/US2011/031064, mailed on Oct. 26, 2012, 5 pages. |
International Search Report and Written Opinion received for Patent Application No. PCT/US2012/030776, mailed on Oct. 29, 2012, 7 pages. |
Office Action received for U.S. Appl. No. 13/078,565, mailed on Oct. 23, 2012, 17 pages. |
Office Action received for Japanese Patent Application No. 2010-274870, mailed on Mar. 12, 2013, 2 pages of Office Action and 2 pages of English Translation. |
Office Action received for U.S. Appl. No. 13/129,968, mailed on Apr. 4, 2013, 16 pages. |
Office action Received for U.S. Appl. No. 13/159,894, mailed on Apr. 25,2013, 18 pages. |
Office Action received for U.S. Appl. No. 13/159,884, mailed on May 13, 2013, 32 pages. |
Office Action received for U.S. Appl. No. 13/159,874, mailed on Apr. 19, 2013, 33 pages. |
Office action Received for U.S. Appl. No. 13/159,896, mailed on Apr. 24,2013, 12 pages. |
Number | Date | Country | |
---|---|---|---|
20110161462 A1 | Jun 2011 | US |