Adap.tv, Inc.

Microsoft Technology Licensing, LLC

Adapt.tv, Inc.

Alfred Lee

Brendan Kitts

Dyng Au

Erik B Christensen

Sawin Lee

Michael Bardaro

David Edwin Levin

Christopher G Kaler

Donald F Box

Giovanni Moises Della-Libera

David Wortendyke

Saurab Nog

Christian F Huitema

John Peter Shewchuk

Stephen James Millet

Bradford H Lovering

Henrik Frystyk Nielsen

Satish Ramchandra Thatte

Andrew Layman

James M Lyon

Jeffrey C Schlimmer

Elliot Lee Waingold

Ashok Malhotra

Jeffery C Schlimmer

Sara Wong

Mark H Lukovsky

Systems and methods are disclosed that measure web activity bursts after ad broadcasts that may be sent to multiple persons. One system uses a cookie-less/cookie-optional, anonymous/personal-identification-not-required, method for web-based conversion tracking that will work on broadcast media systems such as television, and could also be applied to measuring spikes from email, radio, and other forms of advertising where an episodic ad event is broadcast to multiple parties, and where responses occur in a batch after the broadcast.

Systems and methods for web spike attribution

Television is the largest advertising category in the United States with over 65 billion spent by advertisers per year. A variety of different targeting algorithms are compared, ranging from the traditional age-gender targeting methods employed based on Nielsen ratings, to new approaches that attempt to target high probability buyers using Set Top Box data. The performance of these different algorithms on a real television campaign is shown, and the advantages and limitations of each method are discussed. In contrast to other theoretical work, all methods presented herein are compatible with targeting the existing 115 million Television households in the United States and are implementable on current television delivery systems.

Systems and methods for a television scoring service that learns to reach a target audience

A routing protocol is provided for exchanging messages between an initial sender and an ultimate receiver, potentially via a set of intermediaries. The routing protocol provides an optional reverse message path that enables two-way message exchange patterns. The routing protocol can be expressed as a header entry within a message envelope, is independent of the underlying protocol, and can be generated at the application layer of a protocol stack. The routing protocol may allow each intermediary to process the message and dynamically alter the message path en route to the intended recipient.

Routing of network messages

A method includes advertising a policy characterizing communication properties supported by a node. The policy may be distributed to another node in response to a request for the policy. Policy expressions in the policy include one or more assertions that may be grouped and related to each other in a plurality of ways. A system includes a policy generator for generating at least one policy characterizing properties of a node. A policy retriever retrieves a policy from another node and a message generator generates a message to the other node, wherein the message conforms to the policy from the other node.

Dynamic protocol construction

Implementations are described and claimed herein to detect an invalid policy that may reside in a cache at a client. An expired policy is removed from cache and a current policy is requested. Otherwise the cached policy may be used. The client indicates which policy it is using by generating a policy digest, including, in compressed form, one or more assertions. If the host determines the policy digest is invalid, the host issues an invalid digest fault. If the policy digest is valid, but the assertions included in the policy digest are invalid, the host issues an invalid policy fault. In either case, the client is notified that the cached policy is no longer valid and that a current policy should be requested.

Invalid policy detection

The present invention provide for an algebraic mapping of a policy expression from a compact to a normalized form, both in Boolean and set formulations. The policy algebra is defined in such a way that policy alternatives within the normalized expression will be the same across equivalent compact expressions&#x2014;regardless of how the assertions are arbitrarily constrained or what operators are used to constrain such equivalent expressions. Moreover, the present invention also provides a model for identifying alternatives that are equivalent by comparing only the root element names or QName of each assertion within an alternative. In addition, embodiments as described herein can utilize the identification of equivalent alternatives in order to create an intersection policy expression to limit alternatives of admissible behavior to those in common across both endpoints.

Policy algebra and compatibility model

Growing community of inventors

Seattle, WA, United States of America

Alfred Lee