Prioritized placement of content elements for iTV applications

Abstract
Preferred placement of programming content is provided by a system and method to organize or sequence the display of a set of programmable content elements of an iTV application to a viewer, using business rules that describe the preferred placement conditions or criteria. Such criteria include brand, content owner, application location, current channel, current channel family, current channel category, time of day, content category, current program, current program genre, current iTV application, current content type, and/or subscriber and set-top box profile and behavior data. In one implementation, the present invention allows for managing the ‘shelf space’ within and for iTV applications.
Description
COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.


FIELD OF THE INVENTION

The present invention relates to systems and methods for enabling and automating the delivery of interactive television (iTV) content to subscribers (viewers).


BACKGROUND

The above-cited patent applications individually demonstrate aspects of a system that provides for control of programming of content, including ads and promotions and other content, within an iTV system. The present invention is intended to illustrate a system and method that provides for programming content from the business perspective of ‘pay for placement’ or ‘shelf space’ within a framework of iTV applications.


SUMMARY OF THE INVENTION

In one embodiment, a set of programmable content elements of an interactive television (iTV) application are organized using business rules that describe preferred placement criteria of the programmable content elements. Once so organized, the content elements may be viewed, for example in conjunction with a user interface for the iTV application. The business rules may include rules for placing one or more of: product offerings, promotions, advertising campaigns, video on demand (VOD) listings, broadcast-on-demand listings, or transactional opportunities, across disparate iTV services. In some embodiment, the rules for placing product offerings are configured to accommodate multiple selection criteria including one or more of: location, current channel, current channel family, current channel category, time of day, offering category, current program, current program genre, current iTV application, current content type, or subscriber profile.


Alternatively, or in addition, the business rules may be configured to accommodate subscriber specific rules according to a subscriber profile associated with a particular client device. The business rules may be selected dynamically at the time of execution of the iTV application, or at the time of application creation.


In some embodiments, the preferred placement criteria include one or more of: brand, content owner, application location, current channel, current channel family, current channel category, time of day, content category, current program, current program genre, current iTV application, current content type, or subscriber and set-top box profile and behavior data. The programmable content elements may include one or more of: advertising, promotions, content placement packages or programming campaign definitions.


Each programmable element may be identified by a resource key attribute that references an associated programming campaign. Such a programming campaign may specify programming of associated content elements and includes a campaign key that uniquely identifies the programming campaign, a list of candidates each providing a set of programmed values for attributes of the associated content elements, a qualifying predicate for each candidate that includes a generalized set of conditions, and a display rule to select one candidate among those that qualify.


Generally then, the iTV application is accessible via a user interface that includes one or more groups of programmable opportunities. Each programmable opportunity may include a location within the iTV application here content may be placed. The content may include one or more of: advertisements, promotions, data including text, images, links to other applications, or audio/video content.


In a further embodiment, an iTV system includes a server configured to organize a set of programmable content elements of an iTV application using business rules that describe preferred placement criteria of the programmable content elements; and a client communicatively coupled to the server via a content distribution network and which is configured to display the content elements no organized to a viewer. The server may include (i) a programming manager configured to allow placement of advertising, promotional opportunities, video, images and text within user interfaces accessible by the viewer through the client; and (ii) a programming manager configured to program the content elements according to: a campaign key that uniquely identifies a programming campaign, a list of candidate content elements each providing a set of values for attributes of associated ones of the content element, a qualifying predicate for each candidate content element that consists of a generalized set of conditions, and a display rule to select one of the candidates among those that qualify.


The business rules are preferably adapted to accommodate one or more of: location, current channel, current channel family, current channel category, time-of-day, offering category, current program, current program genre, current application, current content type, or subscriber profile; and determine which of the content elements are shown via a user interface and when, and in what order and sequence the content elements should be displayed. In one particular embodiment, the business rules are described in XML format.


Generally, the business rules define preferred placements of the content elements based on one or more of the following criteria: time of day, current channel, current broadcast content, viewer demographic, viewer behavior, navigation context or current content category; and may be regarded as rules associated with one or more of the following categories: advertising and promotional rules; TV channel association rules; timing rules for rotation of content, ads, and promotions; category placement rules; VOD metadata rules; or self provisioning rules.


A further embodiment provides for describing programmable conditions for placement of content within an iTV application along multiple dimensions according to business rules that include sets of content programming rules that support creation of user interfaces within which the content is displayed. The content programming rules may include rules for time shifting so as to present different content selections to viewers based on time of day; rules adapted to permit different content selections to be presented based on current broadcast content; rules adapted to dynamically control content within tiled user interfaces; rules adapted to control placement of tiles within tiled user interfaces; rules adapted to permit groupings of ties within tiled user interfaces; and/or rules adapted to permit dynamically controlled transitions between tile groupings within tiled user interfaces. The content programming may be conditioned by dynamically executing the business rules, which may be conditioned by various parameters including: current application, application type, location, time-of-day, day part, current channel, current network family, current channel category, current program, current program genre, current program attributes, current content type, or application data. The business rules may be defined to target subscriber profile attributes including: demographics, service tier, geography, or subscriber behavior.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates one example of a unified application system (UAS) configured in accordance with an embodiment of the present invention.



FIG. 2 illustrates an example of a business rules component configured in accordance with an embodiment of the present invention.



FIGS. 3-15 illustrate examples of user interface screens configured in accordance with various embodiments of the present invention.





DETAILED DESCRIPTION

Described herein are methods and systems for providing preferred placement of programming content within an iTV system. Various embodiments of the present invention provide for organizing or sequencing the display of a set of programmable content elements to a viewer using business rules that describe preferred placement conditions or criteria. Such criteria may include some or all of: brand, content owner, application location, current channel, current channel family, current channel category, time of day, content category, current program, current program genre, current iTV application, current content type, and/or subscriber and set-top box profile and behavior data. In one implementation, the present invention allows for managing the ‘shelf space’ within and for iTV applications.


Within the present system, a server component presents a view of the programmable opportunities for automated control and management of individual programming opportunities or groups of programming opportunities. These programming opportunities can take the shape of lists, positioning within lists, groups of tiles, positioning of graphical elements, elements of a content ticker, or other representation methods for a multiplicity of content elements related via a programmed display or interaction sequence. The system operator (MSO), network programmer or content application owner may control different sets of these programmable opportunities. A single screen (e.g., for presentation to a television viewer) may display one or more groups of programmable opportunities.


The above-cited U.S. patent application Ser. No. 10/390,064 (the “'064 application”) describes a framework for iTV applications that accommodates a system and method for management and delivery of programmable content, that may include advertising, promotions, content placement packages and/or programming campaign definitions, so as to permit a selection of a specific advertisement, promotion or content at a time of preparation of the iTV content by the server component, and/or a time of execution of the iTV applications by the client component. In the framework described in the '064 application, the iTV applications are tagged in a manner such that the iTV applications present all placement opportunities across all applications as a set of programmable opportunities. In this regard, a programmable opportunity can be any location or set of locations within the iTV applications where content may be placed, said content including advertisements, promotions, data including text, images, links to other applications, and/or audio/video delivered over broadcast or narrowcast, displayed in scaled inset or overlay form. The iTV applications are configured to respond in a subscriber-specific manner to user interactions with the iTV applications.


The selection or programming of content may be made according to one or more business rules, which may include rules for placing and/or automating product offerings, promotions, advertising campaigns, VOD, broadcast-on-demand, transactional opportunities, and/or other types of content across disparate television services. The rules for placing and/or automating product offerings across disparate iTV applications may accommodate multiple selection criteria, for example: location, current channel, current channel family, current channel category, time of day, offering category, current program, current program genre, current iTV application, current content type, and subscriber profile. Further, the business rules may accommodate subscriber-specific rules according to a subscriber profile associated with a particular one of the client devices upon which the client component is resident. The business rules may be selected at any of the following instances: dynamically at the time of execution of the iTV applications, or at the time of application creation.


The above-cited U.S. patent application Ser. No. 10/247,901 (the “'901 application”) describes the concept of ‘preferred placement’ in the context of a user interface for interactive television services in which the content pieces, advertising and promotions can be organized according to configurable business rules to dynamically control the content and preferred placement of elements of content, including tiles, within displayed categories. These business rules can be configured according to time of day, television channel, channel content, preferred placement, viewer demographic, viewer behavior, navigation context and/or content category.


The above-cited U.S. patent application Ser. No. 10/460,950 (the “'950 application”) describes user interfaces for preferred placement that allow for the programming of tiles of ads, promotions or other content in a manner that permits the control of individual tiles and groups of tiles along multiple dimensions. These placement opportunities may be controlled in the many ways described above, and also may be presented to viewers in multiple forms of iTV user interfaces through the common programming mechanisms.


Thus, the above-cited patent applications demonstrate aspects of a system that provides for controlling programming of content within an iTV system. In the present invention these elements are combined to provide a system and method that provides for programming content from the business perspective of ‘pay for placement’ or ‘shelf space’ within a framework of iTV applications.



FIG. 1 illustrates one embodiment of an end-to-end environment 10 for developing, delivering and deploying iTV applications. In this illustration, data feeds 12 are provided to an application server 14 configured to produce iTV application for distribution via headend 18 and network 20. These applications along with other content are received at set-top box 22, which provides output signals to a display devices (e.g., a television set) for presentation to a viewer. Programming rules engine 16 of application server (AS) 14 provides the ability for a network operator, programmer, or content producer to specify rules and conditions to dynamically place and target content to subscribers, and respond to user interaction in different ways; and wherein elements of the programmed content, such as promotions, requests for information, placement opportunities and other elements can be programmed and scheduled across various services. Automated placement and targeting of offerings, promotions, commerce opportunities and content in a unified manner across all iTV services, according to multiple selection rules such as location, current channel, current channel family, current channel category, time-of-day, offering category, current program, current program genre, current application, current content type, and subscriber profile is also provided for.


A programming campaign specifies the programming of a content element and consists of four main components:

    • 1. A campaign key that uniquely identifies the campaign.
    • 2. A list of candidates each providing a set of programmed values for the element attributes.
    • 3. A qualifying predicate for each candidate, that consists of a generalized set of conditions.
    • 4. A display rule, such as sequential, random or weighted, to select one candidate among those that qualify.


A programmable element is identified by the presence of a special resource key attribute that references a programming campaign; for example, via a lookup using the resource key as an index into a location list that provides the current campaign ID to use for programming the element. The application client (AC) 24 on set-top box 22 executes the campaign definition. This execution results in the selection of a qualifying candidate (e.g., by determining the truth value of the programming conditions). The selected candidate provides a resolution of one or more of the attributes and data of the programmable element, some of which may be newly specified, and some updated (e.g., from default values provided by the template and data package).


The above-described concept of programming by dynamic execution of rules is available as a mechanism to resolve properties of any content element. Wherever possible, triggering of rules execution is given the following preferential treatment (in order):

    • 1. On AS 14 during construction of the broadcast content.
    • 2. On AC 24 for the remaining rules where possible.
    • 3. On AS 14 using a 2-way return path (back channel) request where required.


As further described in the above-cited patent applications, AS 14 includes a programming manager that allows a network operator, programmer or content producer to specify the elements of advertising, promotional opportunities, VOD placement, image and text placement, subscriber targeting, service and application provisioning, interactive user responses and other programming elements in the service. It allows the administrator to specify the condition predicates and dynamic associative lookups and business rules that constitute service programming.


Turning now to FIG. 2, the business rules component 26 of AS 14 is responsible for constructing business rule objects and applying these business rules to template objects. Further information regarding template objects and their construction may be found in the above-cited patent applications. In one embodiment, business rules are described in an XML format and define placement or other objectives that may be based on criteria such as: time of day, current channel, current broadcast content, viewer demographic, viewer behavior, navigation context and/or current content category.


As shown in the illustration, the business rules themselves may, in one embodiment, comprise rules associated with various data categories 28, which include:

    • 1 Advertising and promotional rules.
    • 2 TV channel association rules.
    • 3 Timing rules (e.g., for rotation of content, ads and promotions).
    • 4 Category placement rules.
    • 5 Preferred placement rules.
    • 6 VOD metadata rules.
    • 7 Self provisioning rules.


The business rules component 26 receives the business rules, interprets them, and provides instructions that will eventually be applied to layout and display objects. The business rules component 26 determines what interface elements 30 (e.g., data, images, ads, menu choices, etc.) are shown and when, and in what order and sequence those elements should be displayed. In one embodiment this may include displaying an advertisement for a sports product when the viewer is tuned to a sports channel. In another embodiment this may include providing links to a specific video when a user tuned a specific channel at a specific time.


By way of illustration only, and without limitation, the XML example provided in '064 application provides for location definition and preferred placement within programming campaign definitions:














<?xml version=″1.0″ encoding=″UTF-8″?>


<meta-business-rules>









<!— location list identifies the campaign -- >



<location-list start=″938129″ end=″948128″>









<location>









<resource key=″2″/>



<campaign-schedule id=″1_176_80″>









<interval start=″938129″



end=″948128″/>









</campaign-schedule>









</location>









</location-list>



<?xml version=″1.0″ encoding=″UTF-8”?>



<!—programming campaign resolves the element attributes and data



-- >



<campaign-list start=″938129″ end=″948128″>



 <campaign id=″1_176_80″ displayrule=″2″>









<element id=″1_176_81″ type=″1″ displayruledata=″1″



onclick=”vod(″10100011)”









src=″img24135.ast″ default=″true″>









<condition>









<equal name=″package″ value=″bronze″/>









</condition>



<condition>









<equal name=″package″ value=″silver″/>



<equal name=″hbo″ value=″no″/>









</condition>









</element>



<element id=″1_176_82″ type=″1″ displayruledata=″2″



onclick=”vod(″10100012)”









src=″img24138.ast″ >









<condition>









<equal name=″package″ value=″platinum″/>









</condition>



<condition>









<equal name=″package″ value=″silver″/>



<equal name=″hbo″ value=″yes″/>









</condition>









 </element>









 </campaign>



</campaign-list>



</meta-business-rules>











In this example, the ‘displayrule’ attribute indicates a preferred placement rule or sequence is to be applied, and the ‘displayruledata’ attribute provides the sequence data for the business rules component 26 to apply the ordering for content in the presentation user interface.


As another example, and without limitation, the XML example provided below illustrates another implementation of the business rules for preferred placement within programming campaign definition:














<?xml version=“1.0” encoding=“UTF-8”?>


<!-- This is generated on per Application basis -->


<programming>









<!-- programming based on location -->



<ruleSetList>









<!-- A ruleSet identifies a location in the application, i.e. a group of identical







programmable elements -->









<ruleSet location=“111” default=“211” displayRule=“firstFound”>









<rule id=“311”>









<conditionRef id=“1”/>



<actionRef id=“11”/>









</rule>



<rule id=“312”>









<conditionRef id=“2”/>



<actionRef id=“12”/>









</rule>



<!-- the rule with id marked by default attribute in the enclosing ruleSet -->



<rule id=“211”>









<actionRef id=“21”/>









</rule>









</ruleSet>



<ruleSet location=“112” default=“212” displayRule=“sequential”>









<rule id=“411”>









<conditionRef id=“3”/>



<actionRef id=“13”/>









</rule>



<rule id=“412”>









<conditionRef id=“4”/>



<actionRef id=“14”/>









</rule>



<rule id=“212”>









<actionRef id=“22”/>









</rule>









</ruleSet>



<ruleSet location=“113” default=“213” displayRule=“random”>









<rule id=“511”>









<conditionRef id=“5”/>



<actionRef id=“15”/>









</rule>



<rule id=“512”>









<conditionRef id=“6”/>



<actionRef id=“16”/>









</rule>



<rule id=“213”>









<actionRef id=“23”/>









</rule>









</ruleSet>



<ruleSet location=“114” default=“214” displayRule=“weighted”>









<!-- A rule with no condition is always in contention for selection -->



<rule id=“611”>









<actionRef id=“17”/>









</rule>



<rule id=“612”>









<conditionRef id=“8”/>



<actionRef id=“18”/>









</rule>



<!-- a rule is treated default only when no rule is selected. Otherwise,



 a rule designated as default still pariticipates in race for selection



 and has conditions that should return true on test, to qualify.



 When acting as a default rule, test condition results are ignored. -->



<rule id=“214”>









<conditionRef id=“7”/>



<actionRef id=“24”/>









</rule>









</ruleSet>









</ruleSetList>



<actionList>









<action id=“11”>









<image src=“/pepsi/britney.jpg” type=“pframe”>









<pframe key=“11” x=“100” y=“150”/>



<pframe key=“12” x=“200” y=“150”/>









</image>



<image src=“pepsi/logo.jpg” type=“pframe”>









<pframe key=“11” x=“150” y=“250”/>



<pframe key=“12” x=“250” y=“250”/>









</image>



<image src=“pepsi/bottle.jpg” type=“pframe”>









<pframe key=“11” x=“200” y=“350”/>



<pframe key=“12” x=“300” y=“350”/>









</image>



<button type=“vod” onclick=“66”>Go</button>









</action>



<action id=“12”>









<image src=“/weather.jpg” type=“bitmap”/>



<hotspot type=“url” onclick=“/weather/forecast.xml”/>



<image src=“/graph.jpg” type=“bitmap”/>



<hotspot type=“url” onclick=“/finance/headlines.xml”/>









</action>



<action id=“14”>









<image src=“/harrypotter.jpg” type=“bitmap”/>



<text>Harry Potter and the Chamber of Secrets</text>



<hotspot type=“vod” onclick=“12”/>









</action>



<action id=“15”>









<image src=“/startrek.jpg” type=“bitmap”/>



<text>Star Trek: Generations</text>



<button type=“vod” onclick=“48”>Preview</button>









</action>



<!--









 <action id=“16”>



 </action>



 <action id=“17”>



 </action>



 <action id=“18”>



 </action>



 <action id=“21”>



 </action>



 <action id=“22”>



 </action>



 <action id=“23”>



 </action>



 <action id=“24”>



 </action>



 -->



</actionList>



<conditionList>









<condition id=“1”>









<and>









<!-- current channel -->



<test lhs=“channel.name” rhs=“DISN” op=“eq”/>



<!-- current program genre -->



<test lhs=“program.genre” rhs=“COMEDY” op=“eq”/>



<!-- current program attributes -->



<test lhs=“program.length” rhs=“1800” op=“eq”/>



<test lhs=“system.time” rhs=“229012380911” op=“ge”/>



<test lhs=“system.time” rhs=“229012381840” op=“lt”/>









</and>









</condition>



<condition id=“2”>









<!-- current program -->



<test lhs=“program.name” rhs=“SEINFELD” op=“eq”/>









</condition>



<condition id=“3”>









<and>









<!-- current network family -->



<test lhs=“channel.network” rhs=“ESPN” op=“eq”/>



<!-- current channel category -->



<test lhs=“channel.category” rhs=“SPORTS” op=“eq”/>



<!-- current iTV content type or category -->



<test lhs=“hmenu.category” rhs=“GOLF” op=“eq”/>



<test lhs=“vmenu.category” rhs=“ON NOW” op=“eq”/>



<!-- time of the day, or day parts etc. -->



<test lhs=“system.time” rhs=“219012380919” op=“ge”/>



<test lhs=“system.time” rhs=“219012381838” op=“lt”/>









</and>









</condition>



<condition id=“4”>









<or>









<test lhs=“favorites.content” rhs=“ESPN” op=“eq”/>



<test lhs=“last.content” rhs=“ESPN” op=“eq”/>



<test lhs=“last.genre” rhs=“SPORTS” op=“eq”/>



<test lhs=“favorites.genre” rhs=“SPORTS” op=“eq”/>









</or>









</condition>



<condition id=“5”>









<or>









<!-- set top properties : zip code-->



<test lhs=“subscriber.zipcode” rhs=“14128” op=“eq”/>



<!-- subscriber profile : service tier -->



<test lhs=“subscription.tier” rhs=“SILVER” op=“le”/>









</or>









</condition>



<condition id=“6”>









<or>









<!-- saved set top behavior : last accessed -->



<test lhs=“last.channel” rhs=“FOXM” op=“eq”/>



<test lhs=“last.network” rhs=“FOX” op=“eq”/>



<!-- saved subscriber info : favorites -->



<test lhs=“favorites.channel” rhs=“FOXM” op=“eq”/>



<test lhs=“favorites.network” rhs=“FOX” op=“eq”/>









</or>









</condition>



<condition id=“7”>









<or>









<test lhs=“subscriber.gender” rhs=“M” op=“eq”/>



<test lhs=“channel.name” rhs=“MEN” op=“eq”/>









</or>









</condition>



<condition id=“8”>









<and>









<!-- subscriber profile : demographics -->



<test lhs=“subscriber.age” rhs=“21” op=“gt”/>



<!-- current channel network -->



<test lhs=“channel.network” rhs=“HBO” op=“eq”/>



<!-- application data -->



<data name=“$$billing.hbo.paid[subscriber]” value=“TRUE” op=“eq”/>









</and>









</condition>









</conditionList>



<videoList>









<video number=“12”>









<title>Harry Potter: The Chamber of Secrets</title>



<providerId>Warner</providerId>



<adiAssetId>1230982168092242</adiAssetId>









</video>



<video number=“48”>









<title>Star Trek: Generations</title>



<providerId>Paramount</providerId>



<adiAssetId>1788752120922242</adiAssetId>









</video>



<video number=“66”>









<title>Pepsi: Britney Singing Promotion</title>



<providerId>Pepsi</providerId>



<adiAssetId>1230982120922242</adiAssetId>









</video>









</videoList>



<resourceKeyMap>









<channel name=“news”>









<template path=“headlines.xml” resource=“1” key=“11” location=“111”/>



<template path=“details.xml” included=“story.xml” resource=“1” key=“12”







location=“112”/>









</channel>



<channel name=“sports”>









<template path=“headlines.xml” resource=“1” key=“21” location=“111”/>



<template path=“details.xml” included=“story.xml” resource=“1” key=“22”







location=“114”/>









<template path=“scores.xml” resource=“1” key=“23” location=“114”/>









</channel>



<channel name=“weather”>









<template path=“headlines.xml” resource=“1” key=“31” location=“111”/>



<template path=“forecast.xml” resource=“1” key=“32” location=“112”/>



<template path=“maps.xml” resource=“1” key=“33” location=“112”/>









</channel>



<channel name=“finance”>









<template path=“headlines.xml” resource=“1” key=“51” location=“111”/>



<template path=“dow.xml” included=“graph.xml” resource=“1” key=“52”







location=“113”/>









<template path=“nasdaq.xml” included=“graph.xml” resource=“1” key=“53”







location=“113”/>









</channel>









</resourceKeyMap>







</programming>









As an example, and without limitation, an XML schema that supports the above XML example can be given by the following XSD definition:














<?xml version=“1.0” encoding=“UTF-8”?>


<xs:schema xmlns:xjc=“http://java.sun.com/xml/ns/jaxb/xjc”


xmlns:jxb=“http://java.sun.com/xml/ns/jaxb” xmlns:xs=“http://www.w3.org/2001/XMLSchema”


elementFormDefault=“qualified” attributeFormDefault=“unqualified” jxb:version=“1.0”


jxb:extensionBindingPrefixes=“xjc”>









<xs:annotation>









<xs:appinfo>









<jxb:globalBindings>









<xjc:serializable/>









</jxb:globalBindings>









</xs:appinfo>









</xs:annotation>



<xs:element name=“programming”>









<xs:annotation>









<xs:documentation>doc root of programming engine output</xs:documentation>









</xs:annotation>



<xs:complexType>









<xs:all>









<xs:element ref=“ruleSetList”/>



<xs:element ref=“actionList”/>



<xs:element ref=“conditionList” minOccurs=“0”/>



<xs:element ref=“videoList” minOccurs=“0”/>



<xs:element ref=“resourceKeyMap”/>









</xs:all>









</xs:complexType>









</xs:element>



<xs:element name=“ruleSetList”>









<xs:complexType>









<xs:sequence maxOccurs=“unbounded”>









<xs:element ref=“ruleSet”/>









</xs:sequence>









</xs:complexType>









</xs:element>



<xs:element name=“ruleSet”>









<xs:complexType>









<xs:sequence maxOccurs=“unbounded”>









<xs:element ref=“rule”/>









</xs:sequence>



<xs:attribute name=“location” type=“xs:unsignedInt” use=“required”/>



<xs:attribute name=“default” type=“xs:unsignedInt” use=“required”/>



<xs:attribute name=“displayRule” type=“displayRuleType” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“rule”>









<xs:complexType>









<xs:sequence>









<xs:element ref=“conditionRef” minOccurs=“0” maxOccurs=“unbounded”/>



<xs:element ref=“actionRef”/>









</xs:sequence>



<xs:attribute name=“id” type=“xs:unsignedInt” use=“required”/>









<xs:complexType>









</xs:element>



<xs:element name=“actionRef”>









<xs:complexType>









<xs:attribute name=“id” type=“xs:unsignedInt” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“conditionRef”>









<xs:complexType>









<xs:attribute name=“id” type=“xs:unsignedInt” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“conditionList”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“condition”/>









</xs:choice>









</xs:complexType>









</xs:element>



<xs:element name=“condition”>









<xs:complexType>









<xs:choice>









<xs:element ref=“or” minOccurs=“0”/>



<xs:element ref=“and” minOccurs=“0”/>



<xs:element ref=“test” minOccurs=“0”/>



<xs:element ref=“data” minOccurs=“0”/>









</xs:choice>



<xs:attribute name=“id” type=“xs:unsignedInt”/>









</xs:complexType>









</xs:element>



<xs:element name=“or”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“and” minOccurs=“0”/>



<xs:element ref=“test” minOccurs=“0”/>



<xs:element ref=“data” minOccurs=“0”/>









</xs:choice>









</xs:complexType>









</xs:element>



<xs:element name=“and”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“or” minOccurs=“0”/>



<xs:element ref=“test” minOccurs=“0”/>



<xs:element ref=“data” minOccurs=“0”/>









</xs:choice>









</xs:complexType>









</xs:element>



<xs:element name=“test”>









<xs:complexType>









<xs:attribute name=“lhs” type=“paramType” use=“required”/>



<xs:attribute name=“rhs” type=“xs:string” use=“required”/>



<xs:attribute name=“op” type=“opType” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“data”>









<xs:complexType>









<xs:attribute name=“name” type=“xs:string” use=“required”/>



<xs:attribute name=“value” type=“xs:string” use=“required”/>



<xs:attribute name=“op” type=“opType” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“actionList”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“action”/>









</xs:choice>









</xs:complexType>









<xs:element>



<xs:element name=“action”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“image” minOccurs=“0”/>



<xs:element ref=“text” minOccurs=“0”/>



<xs:element ref=“button” minOccurs=“0”/>



<xs:element ref=“hotspot” minOccurs=“0”/>









</xs:choice>



<xs:attribute name=“id” type=“xs:unsignedInt” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“hotspot”>









<xs:complexType>









<xs:attribute name=“type” type=“targetType” use=“optional”/>



<xs:attribute name=“onclick” type=“xs:string” use=“optional”/>









</xs:complexType>









</xs:element>



<xs:element name=“button”>









<xs:complexType>









<xs:simpleContent>









<xs:extension base=“xs:string”>









<xs:attribute name=“type” type=“targetType” use=“optional”/>



<xs:attribute name=“onclick” type=“xs:string” use=“optional”/>









</xs:extension>









</xs:simpleContent>









</xs:complexType>









</xs:element>



<xs:element name=“image”>









<xs:complexType>









<xs:choice minOccurs=“0” maxOccurs=“unbounded”>









<xs:element ref=“pframe” minOccurs=“0”/>









</xs:choice>



<xs:attribute name=“src” type=“xs:string” use=“required”/>



<xs:attribute name=“type” type=“imageType” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“text” type=“xs:string”/>



<xs:element name=“pframe”>









<xs:complexType>









<xs:attribute name=“pid” type=“xs:string” use=“optional”/>



<xs:attribute name=“key” type=“xs:unsignedInt” use=“required”/>



<xs:attribute name=“x” type=“xs:unsignedShort” use=“required”/>



<xs:attribute name=“y” type=“xs:unsignedShort” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“videoList”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“video”/>









</xs:choice>









</xs:complexType>









</xs:element>



<xs:element name=“video”>









<xs:complexType>









<xs:all>









<xs:element ref=“title”/>



<xs:element ref=“providerId”/>



<xs:element ref=“adiAssetId”/>









</xs:all>



<xs:attribute name=“number” type=“xs:unsignedByte” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“title” type=“xs:string”/>



<xs:element name=“providerId” type=“xs:string”/>



<xs:element name=“adiAssetId” type=“xs:string”/>



<xs:element name=“resourceKeyMap”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“channel”/>









</xs:choice>









</xs:complexType>









</xs:element>



<xs:element name=“channel”>









<xs:complexType>









<xs:choice maxOccurs=“unbounded”>









<xs:element ref=“template”/>









</xs:choice>



<xs:attribute name=“name” type=“xs:string” use=“required”/>









</xs:complexType>









</xs:element>



<xs:element name=“template”>









<xs:complexType>









<xs:attribute name=“path” type=“xs:string” use=“required”/>



<xs:attribute name=“included” type=“xs:string” use=“optional”/>



<xs:attribute name=“resource” type=“xs:unsignedByte” use=“required”/>



<xs:attribute name=“key” type=“xs:unsignedInt” use=“required”/>



<xs:attribute name=“location” type=“xs:unsignedInt” use=“required”/>









</xs:complexType>









</xs:element>



<xs:simpleType name=“opType”>









<xs:restriction base=“xs:NMTOKEN”>









<xs:enumeration value=“eq”/>



<xs:enumeration value=“ne”/>



<xs:enumeration value=“lt”/>



<xs:enumeration value=“le”/>



<xs:enumeration value=“gt”/>



<xs:enumeration value=“ge”/>









</xs:restriction>









</xs:simpleType>



<xs:simpleType name=“targetType”>









<xs:restriction base=“xs:NMTOKEN”>









<xs:enumeration value=“channel”/>



<xs:enumeration value=“url”/>



<xs:enumeration value=“vod”/>









<xs:restriction>









</xs:simpleType>



<xs:simpleType name=“imageType”>









<xs:restriction base=“xs:NMTOKEN”>









<xs:enumeration value=“bitmap”/>



<xs:enumeration value=“pframe”/>









</xs:restriction>









</xs:simpleType>



<xs:simpleType name=“paramType”>









<xs:restriction base=“xs:NMTOKEN”>









<xs:enumeration value=“system.time”/>



<xs:enumeration value=“channel.name”/>



<xs:enumeration value=“channel.network”/>



<xs:enumeration value=“channel.category”/>



<xs:enumeration value=“hmenu.category”/>



<xs:enumeration value=“vmenu.category”/>



<xs:enumeration value=“category.content”/>



<xs:enumeration value=“program.name”/>



<xs:enumeration value=“program.genre”/>



<xs:enumeration value=“program.length”/>



<xs:enumeration value=“subscriber.age”/>



<xs:enumeration value=“subscriber.gender”/>



<xs:enumeration value=“subscriber.zipcode”/>



<xs:enumeration value=“subscription.tier”/>



<xs:enumeration value=“favorites.channel”/>



<xs:enumeration value=“favorites.network”/>



<xs:enumeration value=“favorites.genre”/>



<xs:enumeration value=“favorites.content”/>



<xs:enumeration value=“last.channel”/>



<xs:enumeration value=“last.network”/>



<xs:enumeration value=“last.content”/>



<xs:enumeration value=“last.genre”/>









</xs:restriction>









</xs:simpleType>



<xs:simpleType name=“displayRuleType”>









<xs:restriction base=“xs:NMTOKEN”>









<xs:enumeration value=“random”/>



<xs:enumeration value=“sequential”/>



<xs:enumeration value=“weighted”/>



<xs:enumeration value=“firstFound”/>









</xs:restriction>









</xs:simpleType>







</xs:schema>










Programmable Conditions


The business rules that describe the programmable conditions for the placement of content long multiple dimensions, include sets of content programming rules that support the creation of user interfaces that permit (without limitation) the following:

    • a Time-shifted user interfaces that present different content selections to viewers based on time of day. Preferred placement selection can be conjunctive to time-of-day content selection.
    • b User interfaces wherein the viewer is presented different content selections based on the current broadcast content, to enhance the current broadcast and extend the content bandwidth. Preferred placement selection can be conjunctive to current broadcast dependent content selection.
    • c Tiled user interfaces wherein business rules can be specified to dynamically control content of each tile anti/or dynamically control placement of each tile (preferred placement).
    • d Tiled user interfaces wherein the screen can be divided dynamically into different groupings of tiles, where the tiles have different sizes. Preferred placement selection can be conjunctive to content size and type.
    • e Tiled user interfaces consisting of groupings of grids of tiles wherein each grouping may be further sub-divided into more granular groupings of smaller tiles, based on navigation flow and business rules. These groupings may be individually scrollable using a remote control device.
    • f Tiled user interfaces wherein the transition between different tiled groupings on the screen can be dynamically controlled. Preferred placement selection can be conjunctive to positioning before or after such transition between groupings.
    • g Tiled user interfaces wherein the number of tiles in each screen grouping can be dynamically controlled. Preferred placement selection can be a factor in dynamically controlling the number of tiles in a grouping.
    • h Tiled user interfaces wherein the tiled screen groupings can be configured at a prior time and dynamically selected using business rules, including preferred placement rules.


Promotions, up-sells, advertising, customer care and other content programming can be controlled by the MSO and/or MSO-designated networks and programmers. The programming of content can be conditioned by various dynamically executed business rules conditioned by parameters exemplified, without limitation, by the XML examples above:

    • a Current Application and application type.
    • b Location.
    • c Time-of-day and Day part.
    • d Current channel.
    • e Current network family.
    • f Current channel category.
    • g Current Program (TV or VOD).
    • h Current Program genre.
    • i Current Program attributes.
    • j Current Content type.
    • k Application data.


Programming business rules can also be defined to target subscriber profile attributes such as:

    • a Demographic.
    • b Service tier.
    • c Geographic (e.g., based on postal code).
    • d Saved subscriber and set-top behavior and previous actions.


Turning now to user interfaces that illustrate aspects of the present invention. FIGS. 3-15 present examples of preferred placement within various user interface screens, which, without limitation, demonstrate implementations of the placement of content along multiple dimensions as described above. Taking each illustration in turn, FIGS. 3 and 4 illustrate an embodiment of the above-described features for preferred placement within a user interface and navigation scheme that provides for:

    • 1 Dividing the screen into a grid of thirds;
    • 2 Dynamically dividing each third into further sub-groupings which are themselves grids of tiles (the content of each tile can be dynamically controlled based on business rules); and
    • 3 Allowing each grouping or grid of tiles to be individually scrolled or a tile therein selected using a remote control or other user input device.

      FIG. 3 illustrates a user interface screen 32 showing an example of a top level grid called “Entertainment”. FIG. 4 illustrates a user interface screen 34 showing an example of navigation to a next-level detail grid within the Entertainment section.


Collectively, FIGS. 3 and 4 illustrate the placement of content ‘above the fold’ so that an application operator can dynamically place certain content tiles on the first application screen seen by the viewer. Subsequent content tiles are available via a navigation (e.g., scrolling or paging the tiles) to a second and subsequent screen(s) of content tiles.


In the embodiment shown in FIG. 5, the viewer is presented a user interface screen 36 that includes a combination of broadcast and on-demand content selections. Such a user interface makes available a vast library of on-demand content, combining broadcast and on-demand in an intuitive way. FIG. 5 shows an interactive program guide with the on-demand content mixed into the listings every N number of listings, N being configurable to the application system.



FIG. 5 illustrates two mechanisms of preferred placement at work. On the left side of user interface 36 is shown a list of on-demand categories. This list of categories is subject to preferred placement business rules, for example, sequential placement rules for each category based on time-of-day and/or category priority. Furthermore, the viewer may be provided with an interface to update the prioritization of such content selections. In addition, content tiles for specific on-demand programming are provided. This list of content tiles is also subject to preferred placement business rules, such as by way of illustration only, sequential placement rules based on brand (e.g., Disney), specific show (e.g., Sopranos), etc., in a manner that changes dynamically based on, for example, time-of-day and/or user profile and behavior data, etc.



FIG. 6 illustrates a user interface screen 38 that includes an example of a Main Menu application 40, which is an overlay over the current video display (whether broadcast TV or on-demand content) that enables navigation to all other iTV services. A viewer may access the main menu 40 by pressing an appropriate button on a remote control. This main menu 40 provides key advertising space by virtue of being one of the top iTV screens. In this example, the preferred placement of content extends to the types and content of the tiles along the bottom horizontal surface 42 of the L-shaped window occupied by the main menu application. Furthermore, in this example, the list of selectable categories and applications in the menu list is programmable, including the selection and sequence of content items.


In some cases special offers may be shown only to viewers who do not presently have access to the featured service. Multiple promotions may be targeted to a given location and selected according to an MSO-controlled rule. Programming campaigns for overlay applications such as the main menu 40 may be broadcast out-of-band using trickle feed and updated dynamically by the application client. Overlay application campaigns may also be broadcast in-band in special cases as described below.


Category Applications



FIGS. 7-9 illustrate a type of iTV application called category applications, which can extend across many themes (such as Sports, Movies, Kids, Travel, History, Entertainment, Home, Parenting, etc.). These applications are branded by an MSO and provide a general navigation interface to all programming in their respective categories, blending linear broadcast programming with on-demand programming and other news, trivia, tickers and other information content relevant to that category. The MSO can deploy category applications as part of a core iTV navigation service. By using the programming engine, category applications can be monetized in a uniform manner by the programming of ad tiles, video ads, broadcast channel sponsorships, and on-demand listings.



FIGS. 7 and 8 illustrate user interface screens 44 and 46 associated with an example of a Sports Category Application that allows the viewer to navigate through available sports programming and by individual sport, for both linear and on-demand programming. Some of the key opportunities to monetize this application through advertising and promotions include ad tiles, video sponsorship and preferred placement. For example, advertisement tile space can be designed into the Sports Application, as shown in the lower left of user interface 44 of FIG. 7 and user interface 46 of FIG. 8. As in other contexts, ad tiles can be programmed by application, location, time-of-day or day part, current channel, channel family, current program, etc. Ad tile programming can also be targeted by subscriber profile attributes such as demographic, service tier, zip code etc.


Video sponsorship opportunities also exist and videos may be displayed in appropriate inset windows as illustrated in these examples. For example, a broadcaster or network operator may sponsor the Sports Application by paying for a video inset that is dynamically scaled on the server and broadcast alongside the Sports Application data carousel in the same 6 MHz channel. In general, iTV applications that overlay full screen or inset video can read data and programming campaigns from the in-band carousel without having to ‘tune-away’ only if the video channel is broadcast in the same 6-Mhz channel as the data carousel. This supports video sponsorship opportunities such the ones described herein as well as MSO barker channels.


In addition, on-demand programming can be listed according to a priority that includes ‘pay-for-placement’. Content providers can pay to be listed higher in sequence thereby being the first titles that the viewer sees. FIG. 9 illustrates, by way of analogy, a user interface screen 48 showing a Movies Category Application that provides the viewer with movies listings across linear and on-demand programming, and that is navigable by category and genre. This application provides the same kinds of advertising opportunities for monetizing the core iTV services, including ad tiles, video spots and preferred placement. The video spots may be run as a continuous ad loop that is programmed, pre-produced and broadcast into the 6 MHz channel containing the application data carousel. The ad loop can be replaced at MSO-controlled intervals using the programming manager.


Channel Hat



FIG. 10 illustrates a user interface screen 50 that includes a channel hat application 52 that provides channel and program information in overlay over video. Programming opportunities for ad tiles and programmer links can be provided in this type of application. For example, ad tiles may be dynamically sensitive to the channel information being displayed in the channel hat (as in this example, an ad for the Anna Nicole show is displayed when the E! channel is displayed). These tiles are also programmable along the dimensions previously discussed and can link to broadcast, on-demand video or interactive applications. The MSO can also provide a programmer with a link to a programmer application or mini-guide as described below. Both the link as well as the programmer application may be monetizable opportunities.


Network Application/Mini-Guides



FIG. 11 illustrates an example of a user interface screen 54 by which an MSO can make network ‘virtual channels’ available to viewers in addition to the core iTV content navigation service. These are content areas that focus on network-branded content such as an E! Entertainment™ application or an ESPN™ Sports application. Whereas in the previous examples, an MSO managed the advertising and promotional space in the core iTV navigation application, with programmer applications it is the network that manages much of the advertising space. Nevertheless, the same programming manager provides the programming campaign management interfaces and allows the MSO to control and moderate all iTV advertising and programming functions to provide a unified service to the viewer.


The MSO can provide (paid) access to the network application in four ways: from the channel information bar associated with that channel; from the channel indicator in any On Now, On Later or Guide listing; from the channel indicator in the On Demand interface; and from promotional tiles advertising E!™ in others areas of the iTV service. The present example contains a pre-produced scaled video stream (VOD) blended with a full frame I-frame or motion background and listings for programs available on now, on later, and on demand as well as other content and promotions. By way of example, an E! application might provide the viewer with navigation to all On Now, On Later and On Demand programming from E! The subscriber can filter content by network-defined category selections and metadata.


Two content/promotions campaigns are also shown in the example illustrated in FIG. 11. Promotions will usually be programmer-defined and can include available on-demand content, On Now programming and managed content links. Programming selections will ideally be conditioned by the category selections in view and campaign elements will thus appear dependent on application data as well.


Pre-produced scaled video can be broadcast as one of the category video feeds, in which case the programmer channel would be carried on the same 6 Mhz channel as the data carousel and thus have access to the carousel. Alternatively, the pre-produced programmer application video can be broadcast on another channel, which would be tuned after the programmer application data is loaded.


Microsites


Similar to the network/programmer applications above, but on a smaller scale, microsites are advertiser and local content provider destinations consisting of a few (e.g., one to three) pages of content. Under the MSO's control, promotions and ad tiles may be sprinkled throughout the iTV service leading viewers to these advertising destinations, in addition to access from menu listings in the ‘advertisers’ content area of the core iTV service.


“Shelf Space” Business Example


“Shelf space” describes how the MSO iTV application model can support business drivers, such as pay-for-placement, in order to monetize the core iTV navigation service as well as other iTV applications to sustain a free VOD model with advertising dollars. The following table 1 summarizes certain premium shelf space advertising elements and the application types that support each one.










TABLE 1





Premium Shelf



Space
Applications







Ad Tiles
All (Main Menu, MSO Home, Guide, Channel Hat,



Movies On-Demand, Sports, Entertainment, Other



Category Apps, Programmer Apps/Mini-guides,



Settings, Parental Control, etc.)


Scaled video
Movies, Sports, Entertainment, Category Apps,



Programmer Apps/Mini-guides


List placement
Movies, Sports, Entertainment, Category Apps,



Programmer Apps/Mini-guides, Search


Top Picks
Movies, Sports, Entertainment, Category Apps,



Programmer Apps/Mini-guides, Search, Main Menu










Several examples are provided to illustrate scenarios for managing shelf space within iTV applications.



FIG. 12 illustrates a user interface screen 56 that provides an alternative treatment to illustrate the On-Demand category, ‘Featured Today’, which provides for the placement of a video promotion using the preferred placement business rules described herein. It demonstrates the programmable selection of featured previews, changing at scheduled intervals. Multiple video preview promotions may be presented in a sequence to the viewer, with the video lists being swapped out at each programming campaign update. The viewer may choose to view the program in its entirety at any time, for example by clicking on a hotspot that is navigable in the interface. Furthermore, user interface screen 56 demonstrates the addition of content tile groupings that promote different types of content (in this case a broadcast show and an on-demand title), the specific content being dynamically selectable according to the programming and selection rules described above.



FIGS. 13-15 similarly illustrate linear and on-demand content interfaces 58, 60 and 62, respectively, that provide examples of the dynamic preferred placement of content with above- and below-the-fold placement, placement of listings and tiles high in the sequence (e.g., to the top of the list) based on preferred placement rules. FIGS. 13 and 14 illustrate an example of network preferred placement with on-demand titles from HBO, Starz, Sundance placed above the fold. In FIG. 14 the preferred provider tiles are intermixed with generic category tiles. FIG. 15 illustrates and example of an MOD Top Picks Placement, demonstrating preferred placement of ‘Top Picks’


Collectively, all of the preferred placement concepts demonstrated herein and as illustrated in FIGS. 3 to 15 incorporate ‘shelf space’ assets that can be programmed as described in the programmable conditions section above, and in general consist of ad tiles, scaled video, list placement and top picks:

    • a Ad Tiles—Programmers and advertisers can pay for the placement of promotions/ads in specific WCDUI applications (e.g., Main Menu, Sports, Movies On-Demand) based on a combination of programming conditions such as day part, IPG schedule, content category, service tier, channel/channel family, zip code, etc. Promotions can link to a VOD asset, to an interactive site (such as a specialty site, or a programmer application or a mini-guide), to current programming in the case of a TV program promotion, or to the Reminders or PVR Application in the case of On Later programming.
    • b Scaled video—Scaled video windows can support the programming of video clips on specific WCDUI applications (e.g., Sports, Movies On-Demand, Category Applications) based on multiple programming conditions such as day part, IPG schedule, content category, etc. These video clips, ads or previews may be user selectable, leading the viewer to a purchase screen for the promoted asset, to the Reminders or PVR App for the show, or to an advertiser iTV site.
    • c List placement—The present application system can support programming of premium placement of VOD listings for the various WCDUI applications such as Movies, Sports, Entertainment and other Category Applications. This support may depend on an enhanced interface to the client database so that the MAS programming engine can write a placement priority flag to the VOD listings database for selection during client database query execution.
    • d Top Picks—A Top Picks tab can be added to applicable WCDUI applications such as Movies, Sports, Entertainment and other Category Applications. These WCDUI application avails are made available through the programming manager. Programmers pay for priority placement of content into this space.


      Programming Manager


A programming manager associated with the application server may enable the MSO to manage and control all of the advertising opportunities described above in a uniform manner across all iTV applications deployed with the present application system across markets, platforms and middleware. The programming manager provides an administrative interface to create and manage programming campaigns. Using the programming manager, the MSO can specify and organize the business rules that target programmable content to subscribers, across disparate iTV applications distributed to multiple markets. The programming engine executes these programming campaigns and server rules, generates programmable content and client business rules, and thus automates the flow of programmable content into enabled applications. The present application system will also integrate with the MSO web application interfaces to retrieve service tiers and franchise rate codes to enable targeting content based on subscriber profile information.


As used here, the term ‘programming’ refers to the ability to dynamically control the promotions, advertising, video and other types of content that appear across all interactive services in a unified manner, as well as to control the manner and deployment of the application services themselves. The programming manager may include web-based interfaces for the MSO, and MSO-approved content partners to dynamically control and schedule these promotions, advertising, video and other types of content in a uniform manner based on relevance and other business rules. It provides customized management interfaces for specific functions such as managing application and programming asset inventory and for defining promotional, up-sell and ad campaigns. VOD asset metadata, program listings and managed content metadata are made available to programming interfaces via browsers and query engines.


As used herein, the terms “computer method,” “computer program”, “routine,” and “subroutine” are substantially synonymous, with “computer method” being used typically (but not exclusively) to describe collections or groups of the latter two elements. Such programs and routines/subroutines may be rendered in any language including, without limitation, C#, C/C++, Fortran, COBOL, PASCAL, assembly language, markup languages (e.g., HTML, SGML, XML, VoXML), and the like, as well as object-oriented environments such as the Common Object Request Broker Architecture (CORBA), Java™ and the like. In general, however, all of the aforementioned terms as used herein are meant to encompass any series of logical steps performed in a sequence to accomplish a given purpose.


It should be appreciated that some portions of the detailed description above were presented in terms of algorithms and symbolic representations of operations on data within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the computer science arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it will be appreciated that throughout the description of the present invention, use of terms such as “processing”, “computing”, “calculating”, “determining”, “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.


The present invention can be implemented with an apparatus to perform the operations described herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer, selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.


The algorithms and processes presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method. For example, any of the methods according to the present invention can be implemented in hard-wired circuitry, by programming a general-purpose processor or by any combination of hardware and software. One of ordinary skill in the art will immediately appreciate that the invention can be practiced with computer system configurations other than those described below, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, DSP devices, network PCs, minicomputers, mainframe computers, and the like. The invention can also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. The required structure for a variety of these systems will appear from the description below.


The methods of the present invention may be implemented using computer software. If written in a programming language conforming to a recognized standard, sequences of instructions designed to implement the methods can be compiled for execution on a variety of hardware platforms and for interface to a variety of operating systems. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein. Furthermore, it is common in the art to speak of software, in one form or another (e.g., program, procedure, application, etc.), as taking an action or causing a result. Such expressions are merely a shorthand way of saying that execution of the software by a computer causes the processor of the computer to perform an action or produce a result.


Thus, methods and systems for providing preferred placement of programming content within an iTV system have been described. Although the present invention has been discussed with reference to several illustrated embodiment thereof these were meant to serve as examples only and the true scope of the invention should only be measured in terms of the following claims.

Claims
  • 1. A method comprising: accessing, by a computing device, content placement rules that (a) describe conditions for placement of content elements within a user interface of an interactive television (iTV) application at defined locations along multiple dimensions and (b) prioritize placement of one of the content elements at one of the defined locations relative to placement of other content elements at other ones of the defined locations;placing, at one or more of the defined locations, one or more of the content elements based on a reference to a definition of a programming campaign that comprises a key for uniquely identifying the programming campaign, a listing of candidate content elements, and at least one rule for selecting the one or more of the content elements from the candidate content elements; andgenerating, for display, the user interface comprising the one or more of the content elements placed at the one or more of the defined locations.
  • 2. The method of claim 1, wherein the content placement rules comprise rules adapted to control placement of tiles within tiled user interfaces, rules adapted to permit groupings of the tiles within the tiled user interfaces, and rules adapted to permit transitions between the groupings of the tiles within the tiled user interfaces.
  • 3. The method of claim 1, wherein placing the one or more of the content elements is conditioned by parameters within the content placement rules that comprise one or more of: current application, application type, location, current channel, current network family, current channel category, current program, current program genre, current program attributes, or current content type.
  • 4. The method of claim 1, wherein placing the one or more of the content elements is conditioned on one or more of: demographics, service tier, geography, or viewer behavior.
  • 5. The method of claim 1, wherein the content placement rules prioritize the placement of each of the content elements according to pay-for-placement criteria.
  • 6. The method of claim 1, wherein the content placement rules prioritize the placement of each of the content elements according to one or more of: brand, content owner, application, location, current channel, current channel family, current channel category, time of day, content category, current program, current program genre, current application, current content type, or viewer behavior data.
  • 7. The method of claim 1, wherein the defined locations comprise tiles reserved for advertisements.
  • 8. The method of claim 1, wherein the conditions for placement of the content elements within the user interface comprise time shifting so as to present different elements within the defined locations based on a time of day.
  • 9. The method of claim 1, wherein the one or more of the content elements placed at the defined locations comprise one or more on-demand content elements.
  • 10. The method of claim 1, wherein the one or more of the content elements placed at the defined locations comprise one or more linear content elements and one or more on-demand content elements.
  • 11. A method comprising: accessing, by a computing device, content placement rules that (a) describe conditions for placement of content elements within a user interface of an interactive television (iTV) application at defined locations along multiple dimensions and (b) prioritize placement of one of the content elements at one of the defined locations relative to placement of other content elements at other ones of the defined locations;placing, at one or more of the defined locations, one or more of the content elements based on a reference to a definition of a programming campaign that includes a key for uniquely identifying the programming campaign, a listing of candidate content elements, and at least one rule for selecting the one or more of the content elements from the candidate content elements; andcausing display of the user interface comprising the one or more of the content elements placed at the one or more of the defined locations.
  • 12. The method of claim 11, wherein the content placement rules comprise rules adapted to control placement of tiles within tiled user interfaces, rules adapted to permit groupings of the tiles within the tiled user interfaces, and rules adapted to permit transitions between the groupings of the tiles within the tiled user interfaces.
  • 13. The method of claim 11, wherein placing the one or more of the content elements is conditioned by parameters within the content placement rules that comprise one or more of: current application, application type, location, current channel, current network family, current channel category, current program, current program genre, current program attributes, or current content type.
  • 14. The method of claim 11, wherein placing the one or more of the content elements is conditioned on one or more of: demographics, service tier, geography, or viewer behavior.
  • 15. The method of claim 11, wherein the content placement rules prioritize the placement of each of the content elements according to pay-for-placement criteria.
  • 16. The method of claim 11, wherein the content placement rules prioritize the placement of each of the content elements according to one or more of: brand, content owner, application, location, current channel, current channel family, current channel category, time of day, content category, current program, current program genre, current application, current content type, or viewer behavior data.
  • 17. The method of claim 11, wherein the defined locations comprise tiles reserved for advertisements.
  • 18. The method of claim 11, wherein the conditions for placement of the content elements within the user interface comprise time shifting so as to present different elements within the defined locations based on a time of day.
  • 19. The method of claim 11, wherein the one or more of the content elements placed at the defined locations comprise one or more linear content elements and one or more on-demand content elements.
  • 20. A method comprising: accessing, by a computing device, content placement rules that (a) describe conditions for placement of content elements within a user interface of an interactive television (iTV) application at defined locations along multiple dimensions and (b) prioritize placement of one of the content elements at one of the defined locations relative to placement of other content elements at other ones of the defined locations;placing, at one or more of the defined locations, one or more of the content elements based on a key for identifying a programming campaign, a listing of candidate content elements, and at least one rule for selecting the one or more of the content elements from the candidate content elements; andcausing display of the user interface comprising the one or more of the content elements placed at the one or more of the defined locations.
RELATED APPLICATIONS

This application is a continuation of and claims priority to co-pending U.S. application Ser. No. 13/484,425, filed May 31, 2012, which is a continuation of and claims priority to U.S. application Ser. No. 10/933,845, filed Sep. 2, 2004 (now U.S. Pat. No. 8,220,018), which claims the benefit of U.S. provisional application Ser. No. 60/499,793, filed Sep. 2, 2003, and is a continuation-in-part of and claims priority to the following applications: U.S. application Ser. No. 10/630,815, filed Jul. 29, 2003, now issued U.S. Pat. No. 8,413,205; U.S. application Ser. No. 10/460,950, filed Jun. 12, 2003, now issued U.S. Pat. No. 8,707,354; U.S. application Ser. No. 10/390,064, filed Mar. 14, 2003, now issued as U.S. Pat. No. 8,042,132; and U.S. application Ser. No. 10/247,901 filed Sep. 19, 2002, now U.S. Pat. No. 8,365,230. Each of the above-mentioned applications is incorporated herein by reference in its entirety.

US Referenced Citations (368)
Number Name Date Kind
5287489 Nimmo et al. Feb 1994 A
5321750 Nadan Jun 1994 A
5353121 Young et al. Oct 1994 A
5485221 Banker et al. Jan 1996 A
5521841 Arman et al. May 1996 A
5583563 Wanderscheid et al. Dec 1996 A
5589892 Knee et al. Dec 1996 A
5592551 Lett et al. Jan 1997 A
5594509 Florin et al. Jan 1997 A
5613057 Caravel Mar 1997 A
5621456 Florin et al. Apr 1997 A
5657072 Aristides et al. Aug 1997 A
5659793 Escobar et al. Aug 1997 A
5666645 Thomas et al. Sep 1997 A
5675752 Scott et al. Oct 1997 A
5694176 Bruette et al. Dec 1997 A
5737552 Lavallee et al. Apr 1998 A
5802284 Karlton et al. Sep 1998 A
5826102 Escobar et al. Oct 1998 A
5844620 Coleman et al. Dec 1998 A
5850218 LaJoie et al. Dec 1998 A
5852435 Vigneaux et al. Dec 1998 A
5860073 Ferrel et al. Jan 1999 A
5883677 Hofmann Mar 1999 A
5892902 Clark Apr 1999 A
5892905 Brandt et al. Apr 1999 A
5905492 Straub et al. May 1999 A
5929849 Kikinis Jul 1999 A
5990890 Etheredge Nov 1999 A
5996025 Day et al. Nov 1999 A
6002394 Schein et al. Dec 1999 A
6005561 Hawkins et al. Dec 1999 A
6008803 Rowe et al. Dec 1999 A
6008836 Bruck et al. Dec 1999 A
6016144 Blonstein et al. Jan 2000 A
6025837 Matthews, III et al. Feb 2000 A
6038560 Wical Mar 2000 A
6049823 Hwang Apr 2000 A
6061695 Slivka et al. May 2000 A
6067108 Yokote et al. May 2000 A
6088722 Herz et al. Jul 2000 A
6091411 Straub et al. Jul 2000 A
6094237 Hashimoto Jul 2000 A
6141003 Chor et al. Oct 2000 A
6148081 Szymanski et al. Nov 2000 A
6162697 Singh et al. Dec 2000 A
6169543 Wehmeyer Jan 2001 B1
6172677 Stautner et al. Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
6191781 Chaney et al. Feb 2001 B1
6195692 Hsu Feb 2001 B1
6205582 Hoarty Mar 2001 B1
6219839 Sampsell Apr 2001 B1
6239795 Ulrich et al. May 2001 B1
6240555 Shoff et al. May 2001 B1
6281940 Sciammarella Aug 2001 B1
6292187 Gibbs et al. Sep 2001 B1
6292827 Raz Sep 2001 B1
6295057 Rosin et al. Sep 2001 B1
6314569 Chernock et al. Nov 2001 B1
6317885 Fries Nov 2001 B1
6345305 Beck et al. Feb 2002 B1
6405239 Addington et al. Jun 2002 B1
6415438 Blackketter et al. Jul 2002 B1
6421067 Kamen et al. Jul 2002 B1
6426779 Noguchi et al. Jul 2002 B1
6442755 Lemmons et al. Aug 2002 B1
6477705 Yuen et al. Nov 2002 B1
6486920 Arai et al. Nov 2002 B2
6522342 Gagnon et al. Feb 2003 B1
6529950 Lumelsky et al. Mar 2003 B1
6532589 Proehl et al. Mar 2003 B1
6564263 Bergman et al. May 2003 B1
6567104 Andrew et al. May 2003 B1
6571392 Zigmond et al. May 2003 B1
6591292 Morrison et al. Jul 2003 B1
6621509 Eiref et al. Sep 2003 B1
6636887 Augeri Oct 2003 B1
6658661 Arsenault et al. Dec 2003 B1
6678891 Wilcox et al. Jan 2004 B1
6684400 Goode et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6731310 Craycroft et al. May 2004 B2
6760043 Markel Jul 2004 B2
6763522 Kondo et al. Jul 2004 B1
6766526 Ellis Jul 2004 B1
6806887 Chernock et al. Oct 2004 B2
6857128 Borden, IV et al. Feb 2005 B1
6886029 Pecus et al. Apr 2005 B1
6910191 Segerberg et al. Jun 2005 B2
6918131 Rautila et al. Jul 2005 B1
7028327 Dougherty et al. Apr 2006 B1
7065785 Shaffer et al. Jun 2006 B1
7103904 Blackketter et al. Sep 2006 B1
7114170 Harris et al. Sep 2006 B2
7134072 Lovett et al. Nov 2006 B1
7152236 Wugofski et al. Dec 2006 B1
7162694 Venolia Jan 2007 B2
7162697 Markel Jan 2007 B2
7177861 Tovinkere et al. Feb 2007 B2
7197715 Valeria Mar 2007 B1
7207057 Rowe Apr 2007 B1
7213005 Mourad et May 2007 B2
7221801 Jang et al. May 2007 B2
7237252 Billmaier Jun 2007 B2
7293275 Krieger et al. Nov 2007 B1
7305696 Thomas et al. Dec 2007 B2
7313806 Williams et al. Dec 2007 B1
7337457 Pack et al. Feb 2008 B2
7360232 Mitchell Apr 2008 B2
7363612 Satuloori et al. Apr 2008 B2
7406705 Crinon et al. Jul 2008 B2
7440967 Chidlovskii Oct 2008 B2
7464344 Carmichael et al. Dec 2008 B1
7472137 Edelstein et al. Dec 2008 B2
7490092 Sibley et al. Feb 2009 B2
7516468 Deller et al. Apr 2009 B1
7523180 DeLuca et al. Apr 2009 B1
7587415 Gaurav et al. Sep 2009 B2
7624416 Vandermolen et al. Nov 2009 B1
7640487 Amielh-Caprioglio et al. Dec 2009 B2
7702315 Engstrom et al. Apr 2010 B2
7703116 Moreau et al. Apr 2010 B1
7721307 Hendricks et al. May 2010 B2
7743330 Hendricks et al. Jun 2010 B1
7752258 Lewin et al. Jul 2010 B2
7861259 Barone, Jr. Dec 2010 B2
7913286 Sarachik et al. Mar 2011 B2
7958528 Moreau et al. Jun 2011 B2
8266652 Roberts et al. Sep 2012 B2
8296805 Tabatabai et al. Oct 2012 B2
8365230 Chane et al. Jan 2013 B2
8381259 Khosla Feb 2013 B1
8448208 Moreau et al. May 2013 B2
8660545 Redford et al. Feb 2014 B1
8699862 Sharifi et al. Apr 2014 B1
8793256 McIntire et al. Jul 2014 B2
8850495 Pan Sep 2014 B2
8863196 Patil et al. Oct 2014 B2
8938675 Holladay et al. Jan 2015 B2
8973063 Spilo et al. Mar 2015 B2
9021528 Moreau et al. Apr 2015 B2
20010014206 Artigalas et al. Aug 2001 A1
20010027563 White et al. Oct 2001 A1
20010049823 Matey Dec 2001 A1
20010056573 Kovac et al. Dec 2001 A1
20010056577 Gordon et al. Dec 2001 A1
20020010928 Sahota Jan 2002 A1
20020016969 Kimble Feb 2002 A1
20020023270 Thomas et al. Feb 2002 A1
20020026642 Augenbraun et al. Feb 2002 A1
20020035573 Black et al. Mar 2002 A1
20020041104 Graf et al. Apr 2002 A1
20020042915 Kubischta et al. Apr 2002 A1
20020059094 Hosea et al. May 2002 A1
20020059586 Carney et al. May 2002 A1
20020059629 Markel May 2002 A1
20020067376 Martin et al. Jun 2002 A1
20020069407 Fagnani et al. Jun 2002 A1
20020070978 Wishoff et al. Jun 2002 A1
20020078444 Krewin et al. Jun 2002 A1
20020078449 Gordon et al. Jun 2002 A1
20020083450 Kamen et al. Jun 2002 A1
20020100041 Rosenberg Jul 2002 A1
20020107973 Lennon et al. Aug 2002 A1
20020108122 Alao et al. Aug 2002 A1
20020120609 Lang et al. Aug 2002 A1
20020124254 Kikinis Sep 2002 A1
20020144268 Khoo et al. Oct 2002 A1
20020144269 Connelly Oct 2002 A1
20020144273 Reto Oct 2002 A1
20020147645 Alao et al. Oct 2002 A1
20020152477 Goodman et al. Oct 2002 A1
20020156839 Peterson et al. Oct 2002 A1
20020169885 Alao et al. Nov 2002 A1
20020170059 Hoang Nov 2002 A1
20020171691 Currans et al. Nov 2002 A1
20020171940 He et al. Nov 2002 A1
20020184629 Sie et al. Dec 2002 A1
20020188944 Noble Dec 2002 A1
20020194181 Wachtel Dec 2002 A1
20020196268 Wolff et al. Dec 2002 A1
20020199190 Su Dec 2002 A1
20030001880 Holtz et al. Jan 2003 A1
20030005444 Crinon et al. Jan 2003 A1
20030005453 Rodriguez et al. Jan 2003 A1
20030014752 Zaslavsky et al. Jan 2003 A1
20030014753 Beach et al. Jan 2003 A1
20030018755 Masterson et al. Jan 2003 A1
20030023970 Panabaker Jan 2003 A1
20030025832 Swart et al. Feb 2003 A1
20030028873 Lemmons Feb 2003 A1
20030041104 Wingard et al. Feb 2003 A1
20030051246 Wilder et al. Mar 2003 A1
20030056216 Wugofski et al. Mar 2003 A1
20030056218 Wingard et al. Mar 2003 A1
20030058948 Kelly et al. Mar 2003 A1
20030061028 Dey et al. Mar 2003 A1
20030066081 Barone et al. Apr 2003 A1
20030067554 Klarfeld Apr 2003 A1
20030070170 Lennon Apr 2003 A1
20030079226 Barrett Apr 2003 A1
20030084443 Laughlin et al. May 2003 A1
20030084444 Ullman et al. May 2003 A1
20030084449 Chane et al. May 2003 A1
20030086694 Davidsson May 2003 A1
20030093790 Logan et al. May 2003 A1
20030093792 Labeeb et al. May 2003 A1
20030097657 Zhou et al. May 2003 A1
20030110500 Rodriguez Jun 2003 A1
20030110503 Perkes Jun 2003 A1
20030115219 Chadwick Jun 2003 A1
20030115612 Mao et al. Jun 2003 A1
20030126601 Roberts et al. Jul 2003 A1
20030132971 Billmaier et al. Jul 2003 A1
20030135464 Mourad et al. Jul 2003 A1
20030135582 Allen et al. Jul 2003 A1
20030140097 Schloer Jul 2003 A1
20030151621 McEvilly et al. Aug 2003 A1
20030158777 Schiff et al. Aug 2003 A1
20030172370 Satuloori et al. Sep 2003 A1
20030182663 Gudorf et al. Sep 2003 A1
20030189668 Newnam et al. Oct 2003 A1
20030204814 Elo et al. Oct 2003 A1
20030204846 Breen et al. Oct 2003 A1
20030204854 Blackketter et al. Oct 2003 A1
20030207696 Willenegger et al. Nov 2003 A1
20030226141 Krasnow et al. Dec 2003 A1
20030229899 Thompson et al. Dec 2003 A1
20040003402 McKenna Jan 2004 A1
20040019900 Knightbridge et al. Jan 2004 A1
20040019908 Williams et al. Jan 2004 A1
20040031015 Ben-Romdhane et al. Feb 2004 A1
20040031058 Reisman Feb 2004 A1
20040039754 Harple Feb 2004 A1
20040078814 Allen Apr 2004 A1
20040107437 Reichardt et al. Jun 2004 A1
20040107439 Hassell et al. Jun 2004 A1
20040111465 Chuang et al. Jun 2004 A1
20040128699 Delpuch et al. Jul 2004 A1
20040133923 Watson et al. Jul 2004 A1
20040136698 Mock Jul 2004 A1
20040172648 Xu et al. Sep 2004 A1
20040194136 Finseth et al. Sep 2004 A1
20040199578 Kapczynski et al. Oct 2004 A1
20040221306 Noh Nov 2004 A1
20040226051 Carney et al. Nov 2004 A1
20050005288 Novak Jan 2005 A1
20050015796 Bruckner et al. Jan 2005 A1
20050015804 LaJoie et al. Jan 2005 A1
20050028208 Ellis et al. Feb 2005 A1
20050086172 Stefik Apr 2005 A1
20050125835 Wei Jun 2005 A1
20050149972 Knudson Jul 2005 A1
20050155063 Bayrakeri et al. Jul 2005 A1
20050160458 Baumgartner Jul 2005 A1
20050262542 DeWeese et al. Nov 2005 A1
20050283800 Ellis et al. Dec 2005 A1
20050287948 Hellwagner et al. Dec 2005 A1
20060004743 Murao et al. Jan 2006 A1
20060059525 Jerding et al. Mar 2006 A1
20060068818 Leitersdorf et al. Mar 2006 A1
20060080707 Laksono Apr 2006 A1
20060105793 Gutowski et al. May 2006 A1
20060156336 Knudson et al. Jul 2006 A1
20060195865 Fablet Aug 2006 A1
20060200842 Chapman et al. Sep 2006 A1
20060206470 McIntyre Sep 2006 A1
20060206912 Klarfeld et al. Sep 2006 A1
20060248572 Kitsukama et al. Nov 2006 A1
20070050343 Siddaramappa et al. Mar 2007 A1
20070064715 Lloyd et al. Mar 2007 A1
20070112761 Xu et al. May 2007 A1
20070211762 Song et al. Sep 2007 A1
20070214123 Messer et al. Sep 2007 A1
20070214488 Nguyen et al. Sep 2007 A1
20070220016 Estrada et al. Sep 2007 A1
20070239707 Collins et al. Oct 2007 A1
20070250901 McIntire et al. Oct 2007 A1
20070260700 Messer Nov 2007 A1
20070271587 Rowe Nov 2007 A1
20080037722 Klassen Feb 2008 A1
20080060011 Kelts Mar 2008 A1
20080071770 Schloter et al. Mar 2008 A1
20080092201 Agarwal et al. Apr 2008 A1
20080113504 Lee et al. May 2008 A1
20080126109 Cragun et al. May 2008 A1
20080133504 Messer et al. Jun 2008 A1
20080183681 Messer et al. Jul 2008 A1
20080183698 Messer et al. Jul 2008 A1
20080189740 Carpenter et al. Aug 2008 A1
20080196070 White et al. Aug 2008 A1
20080204595 Rathod et al. Aug 2008 A1
20080208796 Messer et al. Aug 2008 A1
20080208839 Sheshagiri et al. Aug 2008 A1
20080221989 Messer et al. Sep 2008 A1
20080235209 Rathod et al. Sep 2008 A1
20080235393 Kunjithapatham et al. Sep 2008 A1
20080235725 Hendricks Sep 2008 A1
20080250010 Rathod et al. Oct 2008 A1
20080256097 Messer et al. Oct 2008 A1
20080266449 Rathod et al. Oct 2008 A1
20080276278 Krieger et al. Nov 2008 A1
20080288641 Messer et al. Nov 2008 A1
20080288644 Gilfix et al. Nov 2008 A1
20080317233 Rey et al. Dec 2008 A1
20090006315 Mukherjea et al. Jan 2009 A1
20090019485 Ellis et al. Jan 2009 A1
20090024629 Miyauchi Jan 2009 A1
20090025054 Gibbs et al. Jan 2009 A1
20090083257 Bargeron et al. Mar 2009 A1
20090094113 Berry et al. Apr 2009 A1
20090094632 Newnam et al. Apr 2009 A1
20090094651 Damm et al. Apr 2009 A1
20090123021 Jung et al. May 2009 A1
20090164904 Horowitz et al. Jun 2009 A1
20090222872 Schlack Sep 2009 A1
20090228441 Sandvik Sep 2009 A1
20090240650 Wang et al. Sep 2009 A1
20090249427 Dunnigan et al. Oct 2009 A1
20090271829 Larsson et al. Oct 2009 A1
20090292548 Van Court Nov 2009 A1
20100077057 Godin et al. Mar 2010 A1
20100079670 Frazier et al. Apr 2010 A1
20100175084 Ellis et al. Jul 2010 A1
20100180300 Carpenter et al. Jul 2010 A1
20100223640 Reichardt et al. Sep 2010 A1
20100250190 Zhang et al. Sep 2010 A1
20100251284 Ellis et al. Sep 2010 A1
20110055282 Hoving Mar 2011 A1
20110058101 Earley et al. Mar 2011 A1
20110087348 Wong Apr 2011 A1
20110093909 Roberts et al. Apr 2011 A1
20110131204 Bodin et al. Jun 2011 A1
20110176787 DeCamp Jul 2011 A1
20110209180 Ellis et al. Aug 2011 A1
20110214143 Rits et al. Sep 2011 A1
20110219419 Reisman Sep 2011 A1
20110246495 Mallinson Oct 2011 A1
20110247042 Mallinson Oct 2011 A1
20120002111 Sandoval et al. Jan 2012 A1
20120054811 Spears Mar 2012 A1
20120117151 Bill May 2012 A1
20120227073 Hosein et al. Sep 2012 A1
20120233646 Coniglio et al. Sep 2012 A1
20120295686 Lockton Nov 2012 A1
20120324002 Chen Dec 2012 A1
20120324495 Matthews, III et al. Dec 2012 A1
20120324518 Thomas et al. Dec 2012 A1
20130110769 Ito May 2013 A1
20130111514 Slavin et al. May 2013 A1
20130262997 Markworth et al. Oct 2013 A1
20130298038 Spivack et al. Nov 2013 A1
20130326570 Cowper et al. Dec 2013 A1
20130332839 Frazier et al. Dec 2013 A1
20130332852 Castanho et al. Dec 2013 A1
20130347018 Limp et al. Dec 2013 A1
20130347030 Oh et al. Dec 2013 A1
20140006951 Hunter Jan 2014 A1
20140009680 Moon et al. Jan 2014 A1
20140032473 Enoki et al. Jan 2014 A1
20140089423 Jackels Mar 2014 A1
20140149918 Asokan et al. May 2014 A1
20140150022 Oh et al. May 2014 A1
20140325359 Vehovsky et al. Oct 2014 A1
20140365302 Walker Dec 2014 A1
20150026743 Kim et al. Jan 2015 A1
20150263923 Kruglick Sep 2015 A1
Foreign Referenced Citations (29)
Number Date Country
2685833 Nov 2009 CA
2832800 Nov 2013 CA
2845465 Mar 2014 CA
0624039 Nov 1994 EP
0963115 Dec 1999 EP
1058999 Dec 2000 EP
1080582 Mar 2001 EP
9175979.5 Nov 2009 EP
13192112.4 Nov 2013 EP
14159227.9 Mar 2014 EP
2323489 Sep 1998 GB
2448874 Nov 2008 GB
2448875 Nov 2008 GB
9963757 Dec 1999 WO
0011869 Mar 2000 WO
0033576 Jun 2000 WO
0110115 Feb 2001 WO
0182613 Nov 2001 WO
02063426 Aug 2002 WO
02063471 Aug 2002 WO
02063851 Aug 2002 WO
02063878 Aug 2002 WO
03009126 Jan 2003 WO
03026275 Mar 2003 WO
2007115224 Oct 2007 WO
2008053132 May 2008 WO
2011053271 May 2011 WO
2012094105 Jul 2012 WO
2012154541 Nov 2012 WO
Non-Patent Literature Citations (38)
Entry
Fernando Pereira, “The MPEG-4 Book”, Prentice Hall, Jul. 10, 2002.
Michael Adams, “Open Cable Architecture”, Cisco Press, Dec. 3, 1999.
Andreas Kraft and Klaus Hofrichter, “An Approach for Script-Based Broadcast Application Production”, Springer-Verlag Brling Heidelberg, pp. 74-82, 1999.
Mark Riehl, “XML and Perl”, Sams, Oct. 16, 2002.
MetaTV, Inc., PCT/US02/29917 filed Sep. 19, 2002, International Search Report dated Apr. 14, 2003; ISA/US; 6 pages.
Sylvain Devillers, “Bitstream Syntax Definition Language: an Input to MPEG-21 Content Representation”, Mar. 2001, ISO, ISO/IEC JTC1/SC29/WG11 MPEG01/M7053.
Shim, et al., “A SMIL Based Graphical Interface for Interactive TV”, Internet Tech. Laboratory Dept. of Comp. Engineering, San Jose State University, pp. 257-266, 2003.
Yoon, et al., “Video Gadget: MPET-7 Based Audio-Visual Content Indexing and Browsing Engine”, LG Electronics Institute of Technology, 2001, pp. 59-68.
Watchwith webpage; http://www.watchwith.com/content—owners/watchwith—plalform—components.jsp (last visited Mar. 12, 2013).
Matt Duffy; TVplus App reveals content click-through rates north of 10% across sync enabled programming; http://www.tvplus.com/blog/TVplus-App-reveals-content-click-through-rates-north-of-10-Percent-across-sync-enabled-programming (retrieved from the Wayback Machine on Mar. 12, 2013).
“In Time for Academy Awards Telecast, Companion TV App Umami Debuts First Real-Time Sharing of a TV Program's Images”; Umami News; http:www.umami.tv/2012-02-23.html (retrieved from the Wayback Machine on Mar. 12, 2013).
European Patent Application No. 09175979.5—Office Action dated Dec. 13, 2011.
Canadian Patent Application No. 2,685,833—Office Actoin dated Jan. 20, 2012.
Li, Y. et al. “Reliable Video Clock Time Recognition”, Pattern Recognition, 2006, 1CPR 1006, 18th International Conference on Pattern Recognition, 4 pages.
European Search Report dated Mar. 1, 2010.
Salton et al., Computer Evaluation of Indexing and Text Processing Journal of the Association for Computing Machinery, vol. 15, No. 1, Jan. 1968, pp. 8-36.
Smith, J.R. et al., An Image and Video Search Engine for the World-Wide Web Storage and Retrieval for Image and Video Databases 5, San Jose, Feb. 13-14, 1997, Proceedings of Spie, Belingham, Spie, US, vol. 3022, Feb. 13, 1997, pp. 84-95.
Kontothoanassis, Ledonias et al. “Design, Implementation, and Analysis of a Multimedia Indexing and Delivery Server”, Technical Report Series, Aug. 1999, Cambridge Research Laboratory.
Messer, Alan et al., “SeeNSearch: A context Directed Search Facilitator for Home Entertainment Devices”, Paper, Samsung Information Systems America Inc., San Jose, CA, 2008.
Boulgouris N. V. et al., “Real-Time Compressed-Domain Spatiotemporal Segmentation and Ontologies for Video Indexing and Retrieval”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, No. 5, pp. 606-621, May 2004.
Changsheng Xu et al., “Using Webcast Text for Semantic Event Detection in Broadcast Sports Video”, IEEE Transactions on Multimedia, vol. 10, No. 7, pp. 1342-1355, Nov. 2008.
Liang Bai et al., “Video Semantic Content Analysis based on Ontology”, International Machine Vision and Image Processing Conference, pp. 117-124, Sep. 2007.
Koskela M. et al., “Measuring Concept Similarities in Multimedia Ontologies: Analysis and Evaluations”, IEEE Transactions on Multimedia, vol. 9, No. 5, pp. 912-922, Aug. 2007.
Steffan Staab et al., “Semantic Multimedia”, Reasoning Web; Lecture Notes in Computer Science, pp. 125-170, Sep. 2008.
European Search Report for Application No. 09180776.8, mailed Jun. 7, 2010, 9 pages.
European Search Report, EP 09 18 0762, completion date Mar. 22, 2010.
European Search Report dated Jun. 4, 2010.
EP Application No. 09 179 987.4-1241—Office Action mailed Feb. 15, 2011.
European Application No. 09 175 979.5—Office Action dated Apr. 11, 2011.
Boronat F et al: “Multimedia group and inter-stream synchronization techniques: A comparative study”, Information Systems. Pergamon Press. Oxford. GB. vol. 34. No. 1. Mar. 1, 2009. pp. 108-131. XP025644936.
Extended European Search Report—EP14159227.9—Mailing Date: Sep. 3, 2014.
European Extended Search Report—EP 13192112.4—Dated May 11, 2015.
CA Response to Office Action—CA Appl. 2,685,833—Submitted Jul. 17, 2015.
Response to European Office Action—European Appl. 13192112.4—submitted Dec. 9, 2015.
CA Office Action—CA App 2,685,833—Mailed Jan. 27, 2016.
Canadian Office Action—CA 2,685,833—Dated Jan. 22, 2015.
European Office Action—EP App 14159227.9—Dated Jul. 12, 2016.
Agnieszka Zagozdzinnska et al. “TRIDAQ Systems in HEP Experiments at LHC Accelerator” Kwartalnik Elektroniki I Telekomunikacji, vol. 59, No. 4, Jan. 1, 2013.
Related Publications (1)
Number Date Country
20150229869 A1 Aug 2015 US
Provisional Applications (1)
Number Date Country
60499793 Sep 2003 US
Continuations (2)
Number Date Country
Parent 13484425 May 2012 US
Child 14572131 US
Parent 10933845 Sep 2004 US
Child 13484425 US
Continuation in Parts (4)
Number Date Country
Parent 10630815 Jul 2003 US
Child 10933845 US
Parent 10390064 Mar 2003 US
Child 10630815 US
Parent 10247901 Sep 2002 US
Child 10390064 US
Parent 10460950 Jun 2003 US
Child 10247901 US