Application triggering

Information

  • Patent Grant
  • 11968419
  • Patent Number
    11,968,419
  • Date Filed
    Thursday, March 3, 2022
    2 years ago
  • Date Issued
    Tuesday, April 23, 2024
    8 months ago
Abstract
An apparatus, method, system and computer-readable medium are disclosed for, in one aspect, determining when a trigger, such as an application trigger, should be generated. In some embodiments, the application trigger may be generated when a frame included in a feed (e.g., a content feed) matches a specified or indicated frame. In some embodiments, a comparison between the feed and the specified or indicated frame may be based on one or more tolerances or thresholds. In some embodiments, the feed may be split and content (e.g., video) obtained via the split may be combined (e.g., multiplexed) with a trigger. The combined content and trigger may be transmitted to one or more devices, such as one or more user devices.
Description
BACKGROUND

Advancements in technology have changed the way users consume and interact with content and other users. For example, a user might not want to be restricted to a passive viewing experience, and may want to interact with content or other users. Interactive television and applications are examples allowing users to interact with one another and with content.


Traditional techniques for providing or running applications or interactive content may be prone to error, and improvements are needed.


SUMMARY

This summary is not intended to identify critical or essential features of the disclosure provided herein, but instead merely summarizes certain features and variations thereof.


In some illustrative embodiments, an application author or provider may specify one or more frames of a content item that is to be associated with an application trigger. Frames associated with the content item may be monitored to determine whether a frame associated with an application trigger is being transmitted to a user device. If a frame associated with an application trigger is being transmitted to a user device, the application trigger may be transmitted to and/or executed at the user device.


In some embodiments, a device (e.g., a streamer device) may decode and monitor frames received with a feed (e.g., a video feed). The streamer may use a comparison algorithm (e.g., an image comparison algorithm) to determine if a current frame matches a frame corresponding to a trigger. If there is a match, a trigger may be transmitted. In some embodiments, the determination of whether a match exists may be based on one or more thresholds or tolerances.


In some embodiments, an event associated with a trigger may execute until a condition occurs. The condition may comprise a receipt of a “cancel” frame. The condition may comprise an expiration of the trigger for the content.


In some embodiments, frame-based trigger techniques may be used in combination with time-based trigger techniques or other techniques.


Other details and features will also be described in the sections that follow.





BRIEF DESCRIPTION OF THE DRAWINGS

Some features herein are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements.



FIG. 1 illustrates an example distribution network.



FIG. 2 illustrates an example platform on which the various elements described herein can be implemented.



FIG. 3 illustrates an environment suitable for demonstrating one or more aspects of this disclosure.



FIG. 4 illustrates a method suitable for demonstrating one or more aspects of this disclosure.





DETAILED DESCRIPTION

Various connections between elements are discussed in the following description. These connections are general and, unless specified otherwise, may be for example direct or indirect, wired or wireless, and this specification is not intended to be limiting in this respect.


In the following description of various illustrative embodiments, reference is made to the accompanying drawings, which form a part hereof, and in which is shown, by way of illustration, various embodiments in which aspects of the disclosure may be practiced. It is to be understood that other embodiments may be utilized and structural and functional modifications may be made, without departing from the scope of the present disclosure.



FIG. 1 illustrates an example information (e.g., content) distribution network 100 on which many of the various features described herein may be implemented. Network 100 may be any type of information distribution network, such as satellite, telephone, cellular, wireless, etc. One example may be an optical fiber network, a coaxial cable network or a hybrid fiber/coax distribution network. Such networks 100 use a series of interconnected communication lines 101 (e.g., coaxial cables, optical fibers, wireless, etc.) to connect multiple premises 102 (e.g., businesses, homes, consumer dwellings, etc.) to a central office or headend 103. The central office 103 may transmit downstream information signals onto the lines 101, and each premises 102 may have a receiver used to receive and process those signals.


There may be one line 101 originating from the central office 103, and it may be split a number of times to distribute the signal to various premises 102 in the vicinity (which may be many miles) of the central office 103. The lines 101 may include components not illustrated, such as splitters, filters, amplifiers, etc. to help convey the signal clearly, but in general each split introduces a bit of signal degradation. Portions of the lines 101 may also be implemented with fiber-optic cable, while other portions may be implemented with coaxial cable, other lines, or wireless communication paths.


The central office 103 may include a termination system (TS) 104, such as a cable modem termination system (CMTS) in some types of networks, which may be a computing device configured to manage communications between devices on the network of lines 101 and backend devices such as servers 105-107 (to be discussed further below). The termination system (TS) may be as specified in a standard, such as the Data Over Cable Service Interface Specification (DOCSIS) standard, published by Cable Television Laboratories, Inc. (a.k.a. CableLabs), or it may be a similar or modified device instead. The termination system (TS) may be configured to place data on one or more downstream communications lines and/or frequencies to be received by modems at the various premises 102, and to receive upstream communications from those modems on one or more upstream frequencies. The central office 103 may also include one or more network interfaces 108, which can permit the central office 103 to communicate with various other external networks 109. These networks 109 may include, for example, networks of Internet devices, telephone networks, cellular telephone networks, fiber optic networks, local wireless networks (e.g., WiMAX), satellite networks, and any other desired network, and the interface 108 may include the corresponding circuitry needed to communicate on the network 109, and to other devices on the network such as a cellular telephone network and its corresponding cell phones.


As noted above, the central office 103 may include or have access to a variety of servers 105-107 that may be configured to perform various functions. For example, the central office 103 may include a push notification server 105. The push notification server 105 may generate push notifications to deliver data and/or commands to the various premises 102 in the network (or more specifically, to the devices in the premises 102 that are configured to detect such notifications). The central office 103 may also include a content server 106. The content server 106 may be one or more computing devices that are configured to provide content to users in the homes. This content may be, for example, video on demand movies, television programs, songs, text listings, etc. The content server 106 may include software to validate user identities and entitlements, locate and retrieve requested content, encrypt the content, and initiate delivery (e.g., streaming) of the content to the requesting user and/or device.


The central office 103 may also include one or more application servers 107. An application server 107 may be a computing device configured to offer any desired service, and may run various languages and operating systems (e.g., servlets and JSP pages running on Tomcat/MySQL, OSX, BSD, Ubuntu, Redhat, HTML5, JavaScript, AJAX and COMET). For example, an application server may be responsible for collecting television program listings information and generating a data download for electronic program guide or interactive program guide listings. Another application server may be responsible for monitoring user viewing habits and collecting that information for use in selecting advertisements. Another application server may be responsible for formatting and inserting advertisements in a video stream being transmitted to the premises 102. Another application server may be responsible for receiving user remote control commands, and processing them to provide an intelligent remote control experience.


An example premises 102a may include an interface device 122. In one aspect, the interface device 122 may comprise a modem 110, which may include transmitters and receivers used to communicate on the lines 101 and with the central office 103. The modem 110 may be, for example, a coaxial cable modem (for coaxial cable lines 101), a fiber interface node (for fiber optic lines 101), or any other desired modem device. The interface device 122 may also be connected to, or be a part of, a gateway interface device 111. The gateway interface device 111 may be a computing device that communicates with the modem 110 to allow one or more other devices in the premises 102a to communicate with the central office 103 and other devices beyond the central office. The gateway 111 may be a set-top box (STB), digital video recorder (DVR), computer server, or any other desired computing device. The gateway 111 may also include (not shown) local network interfaces to provide communication signals to devices in the premises 102a, such as televisions 112, additional STBs 113, personal computers 114, laptop computers 115, wireless devices 116 (wireless laptops and netbooks, mobile phones, mobile televisions, personal digital assistants (PDA), etc.), and any other desired devices. Examples of the local network interfaces include Multimedia Over Coax Alliance (MoCA) interfaces, Ethernet interfaces, universal serial bus (USB) interfaces, wireless interfaces (e.g., IEEE 802.11), Bluetooth interfaces, and others.



FIG. 2 illustrates general hardware elements that can be used to implement any of the various computing devices discussed above. The computing device 200 may include one or more processors 201, which may execute instructions of a computer program to perform any of the features described herein. The instructions may be stored in any type of computer-readable medium or memory, to configure the operation of the processor 201. For example, instructions may be stored in one or more of a read-only memory (ROM) 202, random access memory (RAM) 203, removable media 204, such as a Universal Serial Bus (USB) drive, compact disk (CD) or digital versatile disk (DVD), floppy disk drive, or any other desired electronic storage medium. Instructions may also be stored in an attached (or internal) hard drive 205. The computing device 200 may include one or more output devices, such as a display 206 (or an external television), and may include one or more output device controllers 207, such as a video processor. There may also be one or more user input devices 208, such as a remote control, keyboard, mouse, touch screen, microphone, etc. The computing device 200 may also include one or more network interfaces, such as input/output circuits 209 (such as a network card) to communicate with an external network 210. The network interface may be a wired interface, wireless interface, or a combination of the two. In some embodiments, the interface 209 may include a modem (e.g., a cable modem), and network 210 may include the communication lines 101 discussed above, the external network 109, an in-home network, a provider's wireless, coaxial, fiber, or hybrid fiber/coaxial distribution system (e.g., a DOCSIS network), or any other desired network.


This disclosure identifies and addresses an issue associated with absolute-time-based triggers. For example, if a trigger that causes an application to provide an output or stimulus (e.g., an interactive poll) to a user is specified as being transmitted or executed at an absolute time (e.g., 10:28 AM on Sunday) based on a scheduled transmission of content, and then a scheduling change causes the content to be transmitted at a time different from what was initially specified, an event associated with the trigger may execute at an unintended time. In other words, due to a change in the scheduled transmission of the content, the trigger might not be synchronized to the underlying content.


To address the above-noted problem/issue related to absolute-time-based triggers, relative triggering may be used. In relative triggering, an application author/provider may specify that a trigger is to be transmitted or executed at a time that is offset relative to a reference time associated with the content (e.g., the start or end of the content). In this manner, even if the transmission of the content changes relative to an initial schedule, the trigger may be synchronized with the content. Relative triggering might be counter-intuitive from an application author or provider's perspective. For example, an application author or provider may have to engage in a time-consuming trial-and-error process to determine the appropriate location or spot in the content to which the trigger should be associated. Aspects of this disclosure may address problems/issues associated with relative triggering.


Aspects of this disclosure may be implemented to synchronize one or more application triggers to one or more content items (e.g., television programs, advertisements, movies, computer programs, text files, audio files (i.e., music), etc.). An application authoring process may be streamlined and more intuitive using one or more of the techniques described herein.



FIG. 3 illustrates an environment suitable for demonstrating one or more aspects of this disclosure. In some embodiments, the devices and methods shown and described in connection with FIG. 3 may be implemented using one or more of the components and devices described above in connection with FIGS. 1-2.


As shown in FIG. 3, a device such as a splitter 302 may receive a feed, such as a content feed from one or more sources. In some embodiments, the feed may be generated by, for example, a broadcast source or a narrowcast source (e.g., a multicast source or a unicast source). For purposes of illustrative simplicity, the feed is discussed below as pertaining to video. Alternatively, or additionally, other types of content or data may be used or included in some embodiments. Splitter 302 may generate or output video, which may be provided to a streamer server 308 and a multiplexer 314.


Also shown in FIG. 3 is an application server 320. Server 320, or another computing device, may receive an input that may specify or identify one or more frames, or an identification of a point in time within a piece of content, to be associated with a trigger for a particular application or group of applications, for example. The input may be generated by, or received from, a user, a network operator, a content creator, an independent developer, etc. The specified or identified frame(s) may, for example, coincide with one or more frames of video output by splitter 302. Server 320 may access or generate an application, such as an enhanced television (ETV) application, and output the application. The application output by server 320 may include one or more triggers. In some embodiments, a trigger may be embedded in an application. For example, multiplexing may be used to embed a trigger in an application. In some embodiments, a trigger may be sent or transmitted separate from an application. The application output by server 320 may also include video frame information. The application may adhere to one or more standards, specifications, or protocols, such as TRU2WAY/OCAP, Enhanced TV Binary Interchange Format (EBIF), ETV Integrated Signaling Stream (EISS), etc.


Streamer server 308, or another computing device, may monitor video from splitter 302 for one or more frames that may correspond to one or more frames that may be specified via the input to server 320 (and included in the application output by server 320). In some embodiments, streamer server 308 may include comparison logic, circuits, or software to facilitate a comparison between one or more frames included in the video and the specified one or more frames included in the application. In some embodiments, the frame comparison may take place on a pixel-by-pixel basis. In some embodiments, color comparison techniques may be used. In some embodiments, macro block level techniques may be used. For example, in some embodiments, MPEG video streams may be encoded using macro blocks. If a certain (e.g., a predetermined) number of macro blocks correspond or “agree,” it may be concluded that a test frame matches a reference frame. In some embodiments, “facial recognition” techniques may be used. In some embodiments, hashing/“fuzzy” recognition algorithms, such as eigenvectors, may be used. In some embodiments, open source techniques (such as those used in a comparison of audio) may be used. In some embodiments, off-the-shelf components or circuits may be used to facilitate the frame comparison.


In some embodiments, a comparison performed by streamer server 308 may be based at least in part on a predetermined tolerance or threshold to determine whether a match exists. For example, if a frame of video output by splitter 302 is within y % of a frame specified in the application output by server 320, then a match may be said to exist. In some embodiments, other criteria (e.g., other imaging criteria) may be used to determine whether a match exists. For example, in some embodiments, rather than determining whether a particular frame matches, a portion of a frame may be examined to determine whether a match exists. For example, if a logo or other graphic (e.g., a particular score associated with a particular football game) is included in a particular frame, that may suffice as a match.


When a match is found to exist (e.g., when one or more frames included in the video correspond to one or more frames specified in the application, optionally within one or more thresholds or tolerances), streamer server 308 may generate a trigger to signal that a client application 326 running at a user device 332, for example, should perform some function or activity. For example, a trigger may signal the client application 326 that user device 332 should display a menu, play a ring tone, transmit a message, launch a website (e.g., a social networking website), launch an advertisement (e.g., a commercial), etc.


As an example involving advertisements, a computing device (e.g., streamer server 308) may detect a frame with an actor drinking a particular brand of soda. In response to such a detection, an interactive advertisement related to the actor and/or the soda may be launched.


In some embodiments, a trigger may be a “do-it-now” type of trigger, such that the client application 326 and/or user device 332 performs whatever task is associated with the trigger upon receipt of the trigger. Alternatively, or additionally, the trigger may include a specification of an offset. The offset may be based on time or frames, for example. For example, the trigger may specify that the client application 326 and/or user device 332 should perform a task ‘x’ minutes after receipt of the trigger, where ‘x’ is a number. The offset may be based on an event. For example, the trigger may specify that the client application 326 and/or user device 332 should perform a task after receiving one or more user inputs at device 332.


In some embodiments, a trigger may specify that the client application 326 should cease running or executing. For example, if a frame is received that indicates that a particular show or program is ending (e.g., a frame corresponds to the credits that are displayed at the end of a television show or movie), a cancel-trigger may be generated to indicate that any applications related to that show or program should be terminated. In some embodiments, a cancel-trigger may be generated based on time, such as absolute time. For example, a cancel-trigger based on time may be used to ensure that an application terminates at a specified time. In an illustrative scenario, a cancel-trigger based on time may be used to ensure that an application suitable for an adult audience terminates at 6 AM when children are expected to first start waking up from a given night's sleep.


In some embodiments, an action different from terminating an application may be taken in response to a cancel-trigger. For example, and referring to the above-described scenario related to children waking up at 6 AM, an application may replace adult-themed displayed data with “child-friendly” displayed data starting at 6 AM in response to receiving a cancel-trigger or another trigger.


Various types of triggers may be used in some embodiments. Various triggers, or types of triggers, may be combined in some embodiments. For example, in some embodiments, “stacked” triggers may be used. The stacked triggers may be based on a particular combination or sequence of frames, occurring presently or in the future. For example, if frame ‘X’ is detected, application #1 may be launched, whereas if frame ‘Y’ is detected, application #2 may be launched. The stacked triggers may be configured to support any level or degree of complexity or specificity. As yet another illustrative example using stacked triggers, logic (e.g., at server 320 or 308) may specify that if frame ‘Z’ and frame ‘A’ are detected, and frame ‘B’ is not detected, some action or task is to be performed. Alternatively, or additionally, the logic may specify that if frame ‘Z’ is present, capture the frame that is some specified amount of time before or after frame ‘Z’—if that earlier or later frame is frame ‘C’, then perform some action or task.


In some embodiments, a rules engine may be used to determine what action, task or event should be triggered in response to a detected frame or combination/sequence of frames. The rules engine may be in servers 320 or 308, or in another computing device.


Streamer server 308 may generate or output enhanced video. Enhanced video may comprise video, applications, or triggers, or any combination thereof, in some embodiments. The enhanced video output by streamer server 308 may include triggers generated by the streamer server 308 as described above. The enhanced video output by streamer server 308 may include a “blue-screen” or “dummy video” as those terms are understood in the art. The blue-screen or dummy video may be used to facilitate trouble-shooting by a technician or other operator. The enhanced video output by streamer server 308 may include timing information. The timing information may be used to align or synchronize data (e.g., triggers) to video that is received at multiplexer 314.


Multiplexer 314 or another computing device may combine the video received from splitter 302 with the enhanced video received from server 308 to generate output video. In some embodiments, the output video from multiplexer 314 may correspond to an enhanced MPEG stream. In some embodiments, multiplexer 314 may discard a blue-screen or dummy video that may be included in the enhanced video received from server 308 when performing the combination. In some embodiments, multiplexer 314 may transmit the output video to user device 332 or another point in a network.


In some embodiments, multiplexer 314 may transmit the enhanced video (e.g., the triggers or application data) via in-band communications. For example, if an application is geared or directed to a particular channel or particular content (e.g., an application relates to a game show that is televised on a particular channel), then the use of in-band communications may ensure that the application cannot be accessed from other channels. In some embodiments, multiplexer 314 may transmit the enhanced video (e.g., the triggers or application data) via out-of-band communications. Out-of-band communications may be used, for example, when an application is intended to be available for use irrespective of a channel or content selection by a user—an example may relate to an electronic programming guide (EPG) or other general information, where data for an EPG application may be desirable irrespective of what program or channel a user has currently selected.


The architecture described above is illustrative. In some embodiments, components and devices shown in FIG. 3 might not be included. In some embodiments, additional components and devices not shown in FIG. 3 may be included. For example, routers may be located between multiplexer 314 and user device 332 to facilitate the transmission of video and triggers from multiplexer 314 to user device 332. Also, while a single user device 332 is shown, in some embodiments any number of user devices may be included. In some embodiments, a number of user devices may be grouped into one or more service groups.


In some embodiments, functionality described above with respect to each of the components or devices may be partially or completely reallocated to other devices in some embodiments. For example, a comparison that may be performed by streamer server 308 as described above may be performed at user device 332, and as such, triggers may be internally generated within user device 332 or another associated device. Such a (re)allocation of functionality may be suited to user devices with greater processing capabilities, such as next generation set-top boxes or gateways. In such embodiments, one or more reference frames may be transmitted to the user device 332. In some embodiments, a “hash” or “digest” of the one or more reference frames may be transmitted to the user device 332. Use of a “hash” or “digest” may help to preserve bandwidth (e.g., downstream transmission bandwidth).


In some embodiments, streamer server 308 and multiplexer 314 may be combined into a single unit, casing, or housing. However, maintaining streamer server 308 and multiplexer 314 as separate or distinct entities may be beneficial. For example, multiplexer 314 may correspond to an off-the-shelf type of component that may have legacy properties or characteristics associated with it. In this regard, maintaining streamer server 308 and multiplexer 314 as separate or distinct entities may provide benefits in terms of lower costs by allowing a network or service provider to take advantage of economies of scale in terms of components or devices by leveraging existing infrastructure.


A network or service provider may prefer to maintain isolation or independence between the enhanced video or application data (shown as having been generated by streamer server 308 in FIG. 3) and the video (shown as having been output by splitter 302 in FIG. 3) for as long as possible. For example, maintaining independence between the video and the enhanced video until they are received at multiplexer 314 may facilitate trouble-shooting activities in the event of component or device failure. Furthermore, the network or service provider may want to ensure that the video that is associated with the output video produced by multiplexer 314 can be provided to the user device 332 irrespective of application data (e.g., triggers) that may be included in the enhanced video—this may be particularly true when the application or the enhanced video is generated by a third-party developer, and/or when the network or service provider has limited control over the application or the enhanced video. Maintaining isolation or independence between the enhanced video and the video (or other data) may help to ensure that at least the video is provided to the user device 332 if the enhanced video has design bugs or flaws associated with it, or fails in some other way.



FIG. 4 illustrates an example method that may be used to implement one or more aspects of this disclosure. The method may be operative on any number of environments or architectures, such as the environments and architectures described above with respect to FIGS. 1-3. The method may be adapted to suit various environments and architectures.


In step 402, an input identifying one or more frames (or one or more portions thereof) may be received. The input may serve to identify that an event or an action should be taken by one or more applications running or executing at a device, such as a user device relative to the one or more frames, for example.


In step 408, one or more feeds or representations thereof may be received. In some embodiments, the one or more feeds may include audio content (e.g., music, a siren), visual content (e.g., a text file, a presentation, etc.), audio/visual content (e.g., a television show or program), or other data.


In step 414, a comparison may take place to determine whether a match exists. For example, a match may exist if a frame included in the feed received in connection with step 408 corresponds to a frame identified in connection with step 402. In some embodiments, tolerances or thresholds may be used to determine whether a match exists. For example, a match may exist if a frame included in the feed received in connection with step 408 corresponds to a frame identified in connection with step 402 within y %. In some embodiments, the comparison or detection may be based on one or more “audio” frames. For example, audio may be monitored for a particular sequence of sounds. In the context of a football game, audio corresponding to the play-by-play may be monitored for a statement similar to (e.g., within a threshold of): “Team ‘GHI’ just scored a field goal—3 points!”


In some embodiments, the comparison or determination associated with step 414 may be associated with a timeout or expiration. Continuing the above example, if the football game has ended, or team GHI does not have possession of the ball, the monitoring may be stopped or cutoff so as to reduce the likelihood that a “false positive” will be triggered in response to a “similar enough” frame being detected (e.g., in another show, or as a result of team ‘JKL’ having scored a field goal).


If a match does not exist (e.g., the NO path is taken out of step 414), then the method flow may proceed (back) to step 408 to continue receiving and monitoring the feed. In this respect, a loop may be established to monitor a received feed until a match occurs.


If a match does exist (e.g., the YES path is taken out of step 414), then the method flow may proceed to step 420. In step 420, one or more triggers may be generated or otherwise associated with the frames or content. The one or more triggers may be of any type or combination of types. The one or more triggers may direct a client application executing or running at a device (e.g., a user device) to take one or more actions. As part of step 420, enhanced video may be generated. The enhanced video may include the one or more triggers. The enhanced video may include a blue-screen or dummy video. The enhanced video may include timing information. Referring to the example provided above regarding monitoring audio play-by-play for a team GHI field goal, in response to having detected the field goal, a pop-up box may be generated, transmitted, and/or displayed that provides statistics regarding team GHI (e.g., team GHI's placekicker's accuracy on field goal attempts from various distances).


In step 426, one or more outputs may be generated. The one or more outputs may include video in some embodiments. The one or more outputs may include a combination (e.g., multiplexing) of content and triggers in some embodiments. As part of step 426, the generated output(s) may be transmitted to one or more devices, such as one or more user devices. The method flow may return to step 408 for purposes of continuing to monitor the received feed.


The method described above in connection with FIG. 4 is illustrative. In some embodiments, some of the steps (or portions thereof) may be optional. In some embodiments, the order of the steps (or portions thereof) may be rearranged or executed in a sequence different from what is shown. In some embodiments, one or more of the steps (or portions thereof) may execute in parallel. In some embodiments, additional steps not shown may be included.


While some examples have been described above in the context of television technology and communications, aspects of this disclosure may readily be applied to, and adapted to be operative on, one or more other communication systems. Those communication systems may include computer networks, satellite networks, cellular networks, and the like.


Although not required, various aspects described herein may be embodied as a method, a data processing system, and/or as a transitory and/or non-transitory computer-readable medium storing executable instructions. Accordingly, those aspects may take the form of an entirely hardware embodiment, an entirely software embodiment, an entirely firmware embodiment, or an embodiment combining software, firmware, and/or hardware. The functionality may be resident in a single computing device or application, or may be distributed across multiple computing devices/platforms or applications, the multiple computing devices/platforms optionally being connected to one another via one or more networks. Moreover, the structural components described herein may be distributed amongst one or more devices, optionally within a common housing or casing.


Various signals representing content, data, or events as described herein may be transferred between a source and a destination in the form of electromagnetic waves traveling through signal-conducting media such as metal wires, optical fibers, and/or wireless transmission media (e.g., air and/or space).


The various methods and acts may be operative across one or more computing servers and one or more networks. The functionality may be distributed in any manner, or may be located in a single computing device (e.g., a server, a client computer, etc.). As described herein, one or more triggers may be generated in response to one or more frames (or one or more portions of one or more frames) matching a frame (or portion thereof), optionally within a specified threshold or tolerance. In this manner, applications may be authored or provided in an easy and intuitive way.


The methodological acts and processes described herein may be tied to particular machines or apparatuses. For example, as described herein, applications may execute on one or more devices, such as servers and user devices. The applications may be formatted in accordance with one or more communication techniques, specifications, types, or protocols. More generally, one or more apparatuses may include one or more processors and memory storing instructions, that when executed, cause the one or more apparatuses to perform the methodological acts and processes described herein. Furthermore, the methodological acts and processes described herein may perform a variety of functions including transforming an article (e.g., a feed, such as a content feed, and an application, such as a client application) into a different state or thing (e.g., content supplemented by an application with triggers based at least in part on a determination that a frame matches a specified frame, optionally within a given tolerance or threshold).


Aspects of the disclosure have been described in terms of illustrative embodiments thereof. While illustrative systems and methods as described herein embodying various aspects of the present disclosure are shown, it will be understood by those skilled in the art, that the disclosure is not limited to these embodiments. Modifications may be made by those skilled in the art, particularly in light of the foregoing teachings. For example, each of the features of the aforementioned illustrative examples may be utilized alone or in combination or subcombination with elements of the other examples. For example, any of the above described systems and methods or parts thereof may be combined with the other methods and systems or parts thereof described above in any order. It will also be appreciated and understood that modifications may be made without departing from the true spirit and scope of the present disclosure. The description is thus to be regarded as illustrative instead of restrictive on the present disclosure.

Claims
  • 1. A method comprising: determining a match between a trigger for a content item and at least one content frame in a stream; andbased on a time associated with the match, inserting the trigger for the content item in the stream.
  • 2. The method of claim 1, wherein inserting the trigger for the content item in the stream comprises replacing, based on the time associated with the match, a first content item in the stream with a second content item in the stream.
  • 3. The method of claim 1, wherein determining the match comprises comparing a first plurality of pixels associated with the trigger for the content item and a second plurality of pixels associated with the at least one content frame.
  • 4. The method of claim 1, wherein determining the match comprises comparing first audio associated with the trigger for the content item and second audio associated with the at least one content frame.
  • 5. The method of claim 1, wherein determining the match comprises comparing the trigger for the content item and the at least one content frame using a fuzzy recognition algorithm.
  • 6. The method of claim 1, wherein determining the match comprises comparing a first hash associated with the trigger for the content item and a second hash associated with the at least one content frame.
  • 7. The method of claim 1, wherein determining the match comprises detecting, using a facial recognition algorithm, a face in the at least one content frame.
  • 8. An apparatus comprising: one or more processors; andmemory storing instructions that, when executed by the one or more processors, cause the apparatus to: determine a match between a trigger for a content item and at least one content frame in a stream; andbased on a time associated with the match, insert the trigger for the content item in the stream.
  • 9. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to insert the trigger for the content item in the stream by causing the apparatus to replace, based on the time associated with the match, a first content item in the stream with a second content item in the stream.
  • 10. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to determine the match by causing the apparatus to compare a first plurality of pixels associated with the trigger for the content item and a second plurality of pixels associated with the at least one content frame.
  • 11. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to determine the match by causing the apparatus to compare first audio associated with the trigger for the content item and second audio associated with the at least one content frame.
  • 12. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to determine the match by causing the apparatus to compare the trigger for the content item and the at least one content frame using a fuzzy recognition algorithm.
  • 13. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to determine the match by causing the apparatus to compare a first hash associated with the trigger for the content item and a second hash associated with the at least one content frame.
  • 14. The apparatus of claim 8, wherein the instructions, when executed by the one or more processors, cause the apparatus to determine the match by causing the apparatus to detect, using a facial recognition algorithm, a face in the at least one content frame.
  • 15. One or more non-transitory computer-readable media storing instructions that, when executed, cause: determining a match between a trigger for a content item and at least one content frame in a stream; andbased on a time associated with the match, inserting the trigger for the content item in the stream.
  • 16. The one or more non-transitory computer-readable media of claim 15, wherein the instructions, when executed, cause the inserting the trigger for the content item in the stream by causing replacing, based on the time associated with the match, a first content item in the stream with a second content item in the stream.
  • 17. The one or more non-transitory computer-readable media of claim 15, wherein the instructions, when executed, cause the determining the match by causing comparing a first plurality of pixels associated with the trigger for the content item and a second plurality of pixels associated with the at least one content frame.
  • 18. The one or more non-transitory computer-readable media of claim 15, wherein the instructions, when executed, cause the determining the match by causing comparing first audio associated with the trigger for the content item and second audio associated with the at least one content frame.
  • 19. The one or more non-transitory computer-readable media of claim 15, wherein the instructions, when executed, cause the determining the match by causing comparing the trigger for the content item and the at least one content frame using a fuzzy recognition algorithm.
  • 20. The one or more non-transitory computer-readable media of claim 15, wherein the instructions, when executed, cause the determining the match by causing comparing a first hash associated with the trigger for the content item and a second hash associated with the at least one content frame.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 16/905,054, filed Jun. 18, 2020, which is a continuation of U.S. application Ser. No. 15/276,135, filed Sep. 26, 2016, now U.S. Pat. No. 10,735,805, which is a continuation of U.S. application Ser. No. 14/554,258, filed Nov. 26, 2014, now U.S. Pat. No. 9,485,547, which is a continuation of U.S. application Ser. No. 13/217,342, filed Aug. 25, 2011, now U.S. Pat. No. 8,935,719, which are incorporated herein by reference.

US Referenced Citations (301)
Number Name Date Kind
4647974 Butler et al. Mar 1987 A
5469206 Strubbe et al. Nov 1995 A
5485221 Banker et al. Jan 1996 A
5563648 Menand et al. Oct 1996 A
5579057 Banker et al. Nov 1996 A
5592551 Lett et al. Jan 1997 A
5600364 Hendricks et al. Feb 1997 A
5631694 Aggarwal et al. May 1997 A
5671377 Bleidt et al. Sep 1997 A
5689799 Dougherty et al. Nov 1997 A
5706434 Kremen et al. Jan 1998 A
5708845 Wistendahl et al. Jan 1998 A
5727159 Kikinis Mar 1998 A
5742680 Wilson Apr 1998 A
5774660 Brendel et al. Jun 1998 A
5774664 Hidary et al. Jun 1998 A
5774666 Portuesi Jun 1998 A
5809242 Shaw et al. Sep 1998 A
5818438 Howe et al. Oct 1998 A
5819269 Uomini Oct 1998 A
5826258 Gupta et al. Oct 1998 A
5848396 Gerace Dec 1998 A
5872588 Aras et al. Feb 1999 A
5881284 Kubo Mar 1999 A
5895477 Orr et al. Apr 1999 A
5907322 Kelly et al. May 1999 A
5925595 Seitz et al. Jul 1999 A
5929849 Kikinis Jul 1999 A
5937331 Kalluri et al. Aug 1999 A
5961603 Kunkel et al. Oct 1999 A
5969715 Dougherty et al. Oct 1999 A
5982445 Eyer et al. Nov 1999 A
5991306 Burns et al. Nov 1999 A
6002394 Schein et al. Dec 1999 A
6006256 Zdepski et al. Dec 1999 A
6008836 Bruck et al. Dec 1999 A
6014134 Bell et al. Jan 2000 A
6014502 Moraes Jan 2000 A
6018764 Field et al. Jan 2000 A
6018768 Ullman et al. Jan 2000 A
6025837 Matthews, III et al. Feb 2000 A
6029045 Picco et al. Feb 2000 A
6049333 LaJoie et al. Apr 2000 A
6055566 Kikinis Apr 2000 A
6061056 Menard et al. May 2000 A
6067107 Travaille et al. May 2000 A
6076734 Dougherty et al. Jun 2000 A
6101510 Stone et al. Aug 2000 A
6122658 Chaddha Sep 2000 A
6169543 Wehmeyer Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
6182072 Leak et al. Jan 2001 B1
6188398 Collins-Rector et al. Feb 2001 B1
6205582 Hoarty Mar 2001 B1
6209130 Rector, Jr. et al. Mar 2001 B1
6219042 Anderson et al. Apr 2001 B1
6230319 Britt, Jr. et al. May 2001 B1
6233546 Datig May 2001 B1
6233592 Schnelle et al. May 2001 B1
6237022 Bruck et al. May 2001 B1
6240555 Shoff et al. May 2001 B1
6253238 Lauder et al. Jun 2001 B1
6263501 Schein et al. Jul 2001 B1
6275989 Broadwin et al. Aug 2001 B1
6295058 Hsu et al. Sep 2001 B1
6297853 Sharir et al. Oct 2001 B1
6301584 Ranger Oct 2001 B1
6308206 Singh Oct 2001 B1
6320621 Fu Nov 2001 B1
6327574 Kramer et al. Dec 2001 B1
6338094 Scott et al. Jan 2002 B1
6345292 Daugherty et al. Feb 2002 B1
6357042 Srinivasan et al. Mar 2002 B2
6363525 Dougherty et al. Mar 2002 B1
6373609 Mizrahi Apr 2002 B1
6415303 Meier et al. Jul 2002 B1
6421069 Ludtke et al. Jul 2002 B1
6424717 Pinder et al. Jul 2002 B1
6430624 Jamtgaard et al. Aug 2002 B1
6434747 Khoo et al. Aug 2002 B1
6446261 Rosser Sep 2002 B1
6457103 Challenger et al. Sep 2002 B1
6459427 Mao et al. Oct 2002 B1
6460180 Park et al. Oct 2002 B1
6473609 Schwartz et al. Oct 2002 B1
6473858 Shimomura et al. Oct 2002 B1
6496981 Wistendahl et al. Dec 2002 B1
6510557 Thrift Jan 2003 B1
6513019 Lewis Jan 2003 B2
6513069 Abato et al. Jan 2003 B1
6513160 Dureau Jan 2003 B2
6515349 Terashima Feb 2003 B2
6516349 Lieberman Feb 2003 B1
6518950 Dougherty et al. Feb 2003 B1
6530082 Del Sesto et al. Mar 2003 B1
6536041 Knudson et al. Mar 2003 B1
6542593 Bowman-Amuah Apr 2003 B1
6546488 Dillon et al. Apr 2003 B2
6547754 Evans et al. Apr 2003 B1
6553409 Zhang et al. Apr 2003 B1
6564251 Katariya et al. May 2003 B2
6564263 Bergman et al. May 2003 B1
6571392 Zigmond et al. May 2003 B1
6574793 Ngo et al. Jun 2003 B1
6574795 Carr Jun 2003 B1
6577346 Perlman Jun 2003 B1
6584153 Gordon et al. Jun 2003 B1
6601103 Goldschmidt Iki et al. Jul 2003 B1
6614914 Rhoads et al. Sep 2003 B1
6615408 Kaiser et al. Sep 2003 B1
6637032 Feinleib Oct 2003 B1
6640145 Hoffberg et al. Oct 2003 B2
6643652 Helgeson et al. Nov 2003 B2
6651218 Adler et al. Nov 2003 B1
6654754 Knauft et al. Nov 2003 B1
6668378 Leak et al. Dec 2003 B2
6675350 Abrams et al. Jan 2004 B1
6681393 Bauminger et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6698023 Levitan Feb 2004 B2
6718551 Swix et al. Apr 2004 B1
6725461 Dougherty et al. Apr 2004 B1
6730624 Motoki et al. May 2004 B2
6735487 Marshall et al. May 2004 B1
6742043 Moussa et al. May 2004 B1
6745368 Boucher et al. Jun 2004 B1
6750919 Rosser Jun 2004 B1
6756997 Ward, III et al. Jun 2004 B1
6757708 Craig et al. Jun 2004 B1
6779154 Nussbaum et al. Aug 2004 B1
6785902 Zigmond et al. Aug 2004 B1
6792616 Jerding et al. Sep 2004 B1
6792618 Bendinelli et al. Sep 2004 B1
6799326 Boylan, III et al. Sep 2004 B2
6799327 Reynolds et al. Sep 2004 B1
6810526 Menard et al. Oct 2004 B1
6813372 Standridge et al. Nov 2004 B2
6826597 Lonnroth et al. Nov 2004 B1
6839903 Shintani et al. Jan 2005 B1
6847969 Mathai et al. Jan 2005 B1
6925595 Whitledge et al. Aug 2005 B1
6934963 Reynolds et al. Aug 2005 B1
6938270 Blackketter et al. Aug 2005 B2
6941474 Boies et al. Sep 2005 B2
6941574 Broadwin et al. Sep 2005 B1
7028327 Dougherty et al. Apr 2006 B1
7062777 Alba et al. Jun 2006 B2
7079176 Freeman et al. Jul 2006 B1
7080039 Marsh Jul 2006 B1
7100183 Kunkel et al. Aug 2006 B2
7103605 Hazi et al. Sep 2006 B1
7103904 Blackketter et al. Sep 2006 B1
7143042 Sinai et al. Nov 2006 B1
7143428 Bruck et al. Nov 2006 B1
7168084 Hendricks et al. Jan 2007 B1
7222155 Gebhardt et al. May 2007 B1
7222163 Girouard et al. May 2007 B1
7287018 Lennon Oct 2007 B2
7394816 Bill Jul 2008 B1
7500188 Trapani et al. Mar 2009 B1
7500195 Sahota et al. Mar 2009 B2
7512799 Chow et al. Mar 2009 B1
7530016 Sahota et al. May 2009 B2
7631326 Kaneko Dec 2009 B2
7631338 Del Sesto et al. Dec 2009 B2
7634787 Gebhardt et al. Dec 2009 B1
7650376 Blumenau Jan 2010 B1
7653687 Reisman Jan 2010 B2
7653923 Flickinger Jan 2010 B2
7668963 Miner et al. Feb 2010 B1
7702995 Sahota et al. Apr 2010 B2
7783968 Sahota et al. Aug 2010 B2
7930631 Sahota et al. Apr 2011 B2
7941564 Gebhardt et al. May 2011 B2
7958457 Brandenberg et al. Jun 2011 B1
8032651 Miner et al. Oct 2011 B2
8079045 Krapf et al. Dec 2011 B2
8196164 Oztaskent et al. Jun 2012 B1
8296792 Sahota et al. Oct 2012 B2
8407744 Moon et al. Mar 2013 B2
8447840 Fong et al. May 2013 B1
8650480 Sahota et al. Feb 2014 B2
8667387 Sahota et al. Mar 2014 B2
8667530 Sahota et al. Mar 2014 B2
8935719 Sargent Jan 2015 B2
8973056 Ellis et al. Mar 2015 B2
10244203 Enigma Mar 2019 B1
20010001160 Shoff et al. May 2001 A1
20010003212 Marler et al. Jun 2001 A1
20010003828 Peterson et al. Jun 2001 A1
20010011265 Cuan et al. Aug 2001 A1
20010023436 Srinivasan et al. Sep 2001 A1
20010027491 Terretta et al. Oct 2001 A1
20010037500 Reynolds et al. Nov 2001 A1
20010047298 Moore et al. Nov 2001 A1
20010047518 Sahota et al. Nov 2001 A1
20010051031 Hada et al. Dec 2001 A1
20010054031 Lee et al. Dec 2001 A1
20010056460 Sahota et al. Dec 2001 A1
20020010928 Sahota Jan 2002 A1
20020011265 Ganachaud Jan 2002 A1
20020042920 Thomas et al. Apr 2002 A1
20020046237 Yokokura Apr 2002 A1
20020046273 Lahr et al. Apr 2002 A1
20020049749 Helgeson et al. Apr 2002 A1
20020056087 Berezowski et al. May 2002 A1
20020059644 Andrade et al. May 2002 A1
20020075403 Barone et al. Jun 2002 A1
20020087999 Kashima Jul 2002 A1
20020104086 Tomsen et al. Aug 2002 A1
20020112226 Brodersen et al. Aug 2002 A1
20020112237 Kelts Aug 2002 A1
20020131511 Zenoni Sep 2002 A1
20020136448 Bortolussi et al. Sep 2002 A1
20020138849 Blackketter et al. Sep 2002 A1
20020184624 Spencer Dec 2002 A1
20020184627 Alba et al. Dec 2002 A1
20030018971 McKenna Jan 2003 A1
20030023971 Martinolich et al. Jan 2003 A1
20030028873 Lemmons Feb 2003 A1
20030131311 McNamara Jul 2003 A1
20030149581 Chaudhri et al. Aug 2003 A1
20040006747 Tyler Jan 2004 A1
20040047589 Kim Mar 2004 A1
20040133910 Gordon et al. Jul 2004 A1
20050071877 Navarro Mar 2005 A1
20050108633 Sahota et al. May 2005 A1
20050108634 Sahota et al. May 2005 A1
20050108637 Sahota et al. May 2005 A1
20050114757 Sahota et al. May 2005 A1
20050132420 Howard et al. Jun 2005 A1
20050149968 Konig et al. Jul 2005 A1
20050152676 Yoo et al. Jul 2005 A1
20050193410 Eldering Sep 2005 A1
20050216932 Danker Sep 2005 A1
20050235318 Grauch et al. Oct 2005 A1
20060064716 Sull et al. Mar 2006 A1
20060130120 Brandyberry et al. Jun 2006 A1
20060143655 Ellis et al. Jun 2006 A1
20060168624 Carney et al. Jul 2006 A1
20060173560 Widrow Aug 2006 A1
20060236342 Kunkel et al. Oct 2006 A1
20070091919 Sandoval Apr 2007 A1
20070130581 Del Sesto et al. Jun 2007 A1
20070136753 Bovenschulte et al. Jun 2007 A1
20070157249 Cordray et al. Jul 2007 A1
20070162961 Tarrance et al. Jul 2007 A1
20080010659 Zenith Jan 2008 A1
20080098446 Seckin et al. Apr 2008 A1
20080109843 Ullah May 2008 A1
20080215428 Ramer et al. Sep 2008 A1
20080319852 Gardner et al. Dec 2008 A1
20090031374 Choi Jan 2009 A1
20090119723 Tinsman May 2009 A1
20090150553 Collart et al. Jun 2009 A1
20090193456 Ahn et al. Jul 2009 A1
20090199114 Lewis et al. Aug 2009 A1
20090217329 Riedl et al. Aug 2009 A1
20090254931 Pizzurro et al. Oct 2009 A1
20090276323 Allen et al. Nov 2009 A1
20090276805 Andrews II et al. Nov 2009 A1
20100017597 Chandwani Jan 2010 A1
20100153831 Beaton Jun 2010 A1
20100161826 Miner et al. Jun 2010 A1
20100171741 Brill et al. Jul 2010 A1
20100174783 Zarom Jul 2010 A1
20100215340 Pettit et al. Aug 2010 A1
20100251279 Piard et al. Sep 2010 A1
20100268773 Hunt et al. Oct 2010 A1
20100309196 Castleman Dec 2010 A1
20100332315 Kamar et al. Dec 2010 A1
20100333153 Sahota et al. Dec 2010 A1
20110119478 Jackson May 2011 A1
20110191667 Sahota et al. Aug 2011 A1
20120041825 Kasargod et al. Feb 2012 A1
20120084812 Thompson et al. Apr 2012 A1
20120117584 Gordon May 2012 A1
20120189272 Kunigita et al. Jul 2012 A1
20130014155 Clarke et al. Jan 2013 A1
20130014192 Sahota et al. Jan 2013 A1
20130051770 Sargent Feb 2013 A1
20130117406 Chevillat et al. May 2013 A1
20130144725 Li et al. Jun 2013 A1
20130173742 Thomas et al. Jul 2013 A1
20130179925 Woods et al. Jul 2013 A1
20130205343 Kirby Aug 2013 A1
20130238445 Rao Sep 2013 A1
20130325603 Shamir et al. Dec 2013 A1
20130347018 Limp et al. Dec 2013 A1
20140018033 Luna Jan 2014 A1
20140053223 Vorobyov et al. Feb 2014 A1
20140115472 Mochinaga et al. Apr 2014 A1
20140130085 Sahota et al. May 2014 A1
20140181855 Fife et al. Jun 2014 A1
20140189500 Sahota et al. Jul 2014 A1
20140201769 Neumeier et al. Jul 2014 A1
20140282653 Ariantaj et al. Sep 2014 A1
20140282735 Davis et al. Sep 2014 A1
20140379855 Sahota et al. Dec 2014 A1
20150156564 Sargent Jun 2015 A1
20150256903 Walker Sep 2015 A1
Foreign Referenced Citations (15)
Number Date Country
60217091 Jun 2007 DE
0915621 May 1999 EP
0942595 Sep 1999 EP
1269750 Jan 2003 EP
1286541 Feb 2003 EP
1381961 Jan 2004 EP
1826981 Aug 2007 EP
1954054 Aug 2008 EP
2000078043 Dec 2000 WO
2001058159 Aug 2001 WO
0182614 Nov 2001 WO
0182613 Nov 2001 WO
2002086746 Oct 2002 WO
03017129 Feb 2003 WO
2005006758 Jan 2005 WO
Non-Patent Literature Citations (48)
Entry
Morris S: “The MHP Tutorial”, Internet Citation, 2002, XP002281053, retrieved from the Internet: URL: http://www.mhp-interactive.org/tutorials/mhp/printerfriendly/ (retrieved on May 19, 2004).
Extended European Search Report—EP12181319—dated Dec. 19, 2012.
“Spyglass Prism: Concepts and Applications”, Spyglass Inc, 1997, pp. 1-8.
Puder, A., et al, “Position Papers: System Support for Knowledge-Based Trading in Open Service Markets”, Proceedings of the 7th Workshop on ACM SIGOPS European Workshop: Systems Support for Worldwide Applications, Sep. 1996, pp. 289-296.
Ensink, Brian, et al, “XML Based Adaptation of the Composite Approach for Database Integration”, Proceedings of the 37th Annual Southeast Regional Conference (CD-ROM), Apr. 1999, pp. 1-6.
Arens, Yigal, et al., “Intelligent Caching: Selecting, Representing, and Reusing Data in an Information Server”, Proceedings of the Third International Conference on Information and Knowledge Management, Nov. 1994, pp. 433-438.
Spencer, Ken, “Using XML to Build Internet Solutions”, Windows IT Pro, http://www.winntmag.com/Articles/Print.cfm?ArticleiD=5056, Apr. 1999.
Bayardo, R J., et al., “InfoSieuth: Agent-Based Semantic Integration of Information in Open and Dynamic Environments”, ACM SIGMOD Record, (Jun. 1997), vol. 26, Issue 2, pp. 195-206.
Calvary, Gaelle, et al., “From Single-User Architectural Design to PAC': a Generic Software Architecture Model for CSCW”, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (Mar. 1997), pp. 342-349.
Wegner, Lutz, et al, “Applications: A Visual Interface for Synchronous Collaboration and Negotiated Transactions”, Proceedings of the Workshop on Advanced Visual Interfaces, May 1996, pp. 156-165.
Bulterman, Dick C., “Embedded Video in Hypermedia Documents: Supporting Integration and Adaptive Control”, ACM Transactions on Information Systems (TOIS), vol. 13, Issue 4, Oct. 1995, pp. 440-470.
Hijiri, Toshiki, et al, “A Spatial Hierarchical Compression Method for 3D Streaming Animation”, Proceedings of the Fifth Symposium on Virtual Reality Modeling Language (Web3D-VRML), Feb. 2000, pp. 95-101.
Glushko, Robert J., et al., “An XML Framework for Agent-Based E-Commerce”, Communications of the ACM, vol. 42, No. 3, Mar. 1999, pp. 106-114.
Claypool, Kajal, et al., “OQL_SERF: An ODMG Implementation of the Template-Based Schema Evolution Framework”, Proceedings of the 1998 Conference of the Centre for Advanced Studies on Collaborative Research, (Nov. 1998), pp. 1-15.
Fraisse. S, et al., “Generating Hypermedia Form Specifications by Sketching Multimedia Templates”, ACM, (1996), pp. 353-363.
Yengar, Arun , et al., “Improving Web Server Performance by Caching Dynamic Data”, proceedings of the US EN IX Symposium on Internet Technologies and Systems, (Dec. 1997), pp. 1-13.
Puerta, Angel, et al., “Towards a General Computational Framework for Model-Based Interface Development”, Proceedings of the 4th International Conference on Intelligent User Interfaces, (Dec. 1998), pp. 171-178.
Shim, Simons., et al., “Template Based Synchronized Multimedia Integration Language Authoring Tool”, SPIE Conference on Internet Imaging, (Dec. 1999), vol. 3964, pp. 134-142.
“XHTML 1.0: The Extensible HyperText Markup Language, A Reformulation of HTML 4.0 in XML 1.0”, www.w3.org, downloaded from http://www.w3.org!TR/19991WD-html-in-XML-199902241, Feb. 24, 1999, pp. 1-15.
Barta, Robert, et al., “Syndication with JML”, Proceedings of the 2000 ACM Symposium on Applied Computing—vol. 2, ACM Press, Mar. 2000, pp. 962-970.
Kuchling, Andrew, “XML, the eXtensible Markup Language”, Linux Journal, Specialized Systems Consultants, Inc., Nov. 1998, pp. 1-3.
Microsoft Computer Dictionary, Third Edition, Microsoft Press, 1997. p. 505.
Smith, John R., et al. “Scalable Multimedia Delivery for Pervasive Computing”, Proceedings of the Seventh ACM International Conference on Multimedia (Part 1), Oct. 1999, pp. 131-140.
Microsoft Computer Dictionary, Third Edition, Microsoft Press, 1997, p. 368.
International Preliminary Examination Report, PCT/US01/13244, dated Feb. 18, 2003 (11 pages).
“Advanced Television Enhancement Forum Specification (ATVEF)”, ATVEF, 34 pages, Feb. 2, 1999.
Palmer, Jonathan W., et al., “Digital Newspapers Explore Marketing on the Internet”, Communications of the ACM, vol. 42, Issue 9, Sep. 1999, pp. 32-40.
Hodes, Todd D., et al, “Composable Ad Hoc Location-Based Services for Heterogeneous Mobile Clients”, Wireless Networks, vol. 5, Issue 5, Oct. 1999, pp. 411-427.
International Search Report for International Application No. PCT/US01/13244 (Metatv, Inc.), dated Sep. 10, 2001.
International Search Report for International Application No. PCT/US01/13243 (Metatv, Inc.) dated Oct. 10, 2001.
Steinhorn, Jason and Mark Kohler, “Enhancing TV With ATVEF” Embedded Systems Programming, Oct. 1999, pp. 55-64.
International Search Report for International Application No. PCT/US01/13241 (Metatv, Inc.), dated Sep. 10, 2001.
Advanced Television Systems Committee, Inc., “ATSC Standard: Programming Metadata Communication Protocol, Revision B,” Document A/76B, 52 pages (Jan. 14, 2008).
Heather Wilner, “Verizon FIOS Brings You the 2012 London Summer Olympic Games,” 3 pages, available at <http://forums.verizon.com/t5/Verizon-at-Home/Verizon-FiOS-Brings-You-the-2012-London-Summer-Olympic-Games/ba-p/462267> (Jul. 23, 2012, accessed Mar. 5, 2014).
Extended European Search Report—EP 14159424.2—dated May 13, 2014.
Extended European Search Report—EP Appl. 15158005.7—dated Jul. 29, 2015.
European Office Action—EP App 14159424.2—dated Sep. 27, 2016.
May 14, 2018—Canadian Office Action—CA 2,787,562.
Sep. 17, 2018—European Office Action—EP 15158005.7.
Oct. 30, 2018—European Summons to Oral Proceedings—EP 14159424.2.
Feb. 8, 2019—Canadian Office Action—2,787,562.
Oct. 8, 2019—Canadian Office Action—CA 2,787,562.
Mar. 16, 2020—European Office Action—EP 15158005.7.
Apr. 9, 2020—Canadian Office Action—CA 2,845,906.
May 25, 2020—Canadian Office Action—CA 2,787,562.
Apr. 9, 2021—Canadian Office Action—CA 2,882,503.
Feb. 11, 2022—Canadian Office Action—CA 2,882,503.
Sep. 15, 20225—CA Office Action—CA App. No. 3,122,230.
Related Publications (1)
Number Date Country
20230088600 A1 Mar 2023 US
Continuations (4)
Number Date Country
Parent 16905054 Jun 2020 US
Child 17685463 US
Parent 15276135 Sep 2016 US
Child 16905054 US
Parent 14554258 Nov 2014 US
Child 15276135 US
Parent 13217342 Aug 2011 US
Child 14554258 US