Various of the disclosed embodiments concern systems and methods for tracking virality and social lift of media content. In some embodiments, an analytics engine creates and tags urls to media content using generation codes, time codes, or both. The codes and their respective values allow the analytics engine to determine whether trends or patterns exist in how media content is viewed and shared. The generation codes and time codes can be used instead of, or in addition to, conventional UTM codes. The generation code, time code, or both, can be used to determine which segments (e.g., generations, time periods) of viewers generate a profit, subsequent viewers, etc. For example, the analytics engine can determine when an advertising campaign for a piece of media content should be terminated, rather than simply indicating whether the campaign should continue.
|
1. A computer-implemented method for determining advertising campaign effectiveness, each step performed by a processor of a computing device, the method comprising:
allowing a viewer to access a piece of media content that is electronically viewable and shareable;
enabling the viewer to share the piece of media content by transmitting a link to a potential viewer;
creating a time tracking code that allows sharing activities involving the piece of media content to be examined, wherein the time tracking code includes a time value and a generation value;
setting the time value of the time tracking code so that the time value represents a time at which the viewer elected to share the piece of media content;
appending the time tracking code to a uniform resource locator (url) embedded within the link to the piece of media content;
allowing the viewer to share the url with one or more other viewers sorting viewers of the piece of media content into generations based on the generation value included in the link used by each viewer to access the piece of media content, wherein the generation value specifies how many times the piece of media content has been shared before being viewed by a specified viewer; and
sorting viewers corresponding to a specified generation into time intervals based on the time value included in the link shared by each viewer.
8. A system for determining advertising campaign effectiveness, the system comprising:
a processor operable to execute instructions stored in a memory; and
the memory, which includes a library of digital media content and specific instructions regarding how to determine effectiveness of an advertising campaign for a particular piece of content, wherein the specific instructions are configured to:
allow an initial viewer to access the particular piece of content;
enable the initial viewer to share the particular piece of content by distributing a link to at least one potential viewer;
determine that the initial viewer elected to share the particular piece of content;
create a time tracking code that allows sharing activities involving the particular piece of content to be examined,
wherein the time tracking code includes a time value and a generation value;
append the time tracking code to a uniform resource locator (url) embedded within a shareable link to the particular piece of content;
set the time value of the time tracking code so that the time value represents a time at which the initial viewer shared the particular piece of content; and
sort viewers of the particular piece of content into generations based on the generation value included in the shareable link used by each viewer to access the particular piece of content,
wherein the generation value specifies how many times the particular piece of content has been shared before being viewed by a specified viewer.
16. A computer-implemented method, each step performed by a processor of a computing device, comprising:
allowing a first viewer to access a piece of digital content;
enabling the first viewer to share the piece of digital content by distributing a first link to a second viewer;
determining that the first viewer elected to share the piece of digital content;
creating a time tracking code that includes a time value and a generation value;
appending the time tracking code to a first uniform resource locator (url) embedded within the first link to the piece of digital content;
setting the time value of the time tracking code to a first time that represents a time at which the first viewer shared the piece of digital content with the second viewer;
setting the generation value of the time tracking code to a first value that represents how many times the piece of digital content has been shared before being viewed by the second viewer;
causing the first link to be transmitted to the second viewer;
enabling the second viewer to share the piece of digital content by distributing a second link to a third viewer;
determining that the second viewer elected to share the piece of digital content;
appending the time tracking code to a second url embedded within the second link to the piece of digital content;
setting the time value of the time tracking code to a second time that represents a time at which the second viewer shared the piece of digital content with the third viewer;
setting the generation value of the time tracking code to a second value that represents how many times the piece of digital content has been shared before being viewed by the third viewer; and
sorting viewers of the piece of digital content into generations based on the generation value included in the link used by each viewer to access the piece of digital content.
4. The method of
tagging the url directed to the piece of media content with one or more Urchin Traffic Monitor (UTM) codes.
5. The method of
generating a count of viewers within each time interval; and
analyzing viewing characteristics of viewers within each time interval.
6. The method of
7. The method of
wherein the link is readily shareable by text message, email, social media, or some combination thereof.
9. The system of
10. The system of
11. The system of
12. The system of
13. The system of
sort viewers corresponding to a specified generation into groups, wherein the time value of the time tracking code within the shareable link received by each of the plurality of viewers is used to determine an appropriate group.
14. The system of
15. The system of
perform statistical analytics on one or more of the groups to determine effectiveness of the advertising campaign.
17. The computer-implemented method of
18. The computer-implemented method of
19. The computer-implemented method of
|
Various embodiments relate generally to tracking virality of media content. More specifically, various embodiments relate to analytics systems and methods for analyzing sharing habits and viewing patterns of media content.
The demand for media content, both interactive and static, that is readily available and easily shareable has increased due to the increased popularity of social media platforms such as Facebook® and Twitter®. A content host (e.g., website owner) can generate and/or store media content, such as stories, videos, and quizzes, that are to be accessed by viewers. In some instances the content host pays for advertisements in an effort to increase viewership of a particular piece of content. For example, the content host might pay a social media/networking platform or a search engine (e.g., Google®) to advertise a quiz using static or dynamic ads, banner ads, text ads, etc. A successful advertising campaign boosts viewership (i.e., increase the number of viewers) for the particular piece of content.
Traditionally, the content provider has been able to track at least some viewer characteristics using Urchin Traffic Monitor (UTM) codes. But UTM codes are limited in their ability to provide granular data from which nuanced viewing and sharing patterns can be discovered. For example, UTM codes are limited in their ability to measure viewer characteristics that can be used to determine success of an advertising campaign, track viewing and sharing measurements that affect virality, and compare the virality of multiple pieces of media content. But this information can affect how decisions are made by content providers, content hosts, sponsors (e.g., of a piece or type of media content), advertisers, etc.
These and other objects, features, and characteristics will become more apparent to those skilled in the art from a study of the following Detailed Description in conjunction with the appended claims and drawings, all of which form a part of this specification. While the accompanying drawings include illustrations of various embodiments, the drawings are not intended to limit the claimed subject matter.
The figures depict various embodiments described throughout the Detailed Description for purposes of illustration only. While specific embodiments have been shown by way of example in the drawings and are described in detail below, the invention is amenable to various modifications and alternative forms. The intention, however, is not to limit the invention to the particular embodiments described. Accordingly, the claimed subject matter is intended to cover all modifications, equivalents, and alternatives falling within the scope of the invention as defined by the appended claims.
Various embodiments are described herein that relate to systems and methods for tracking virality and social lift of media content. More specifically, various embodiments relate to electronic systems and methods for tagging/coding uniform resource locators (URLs) to media content and determining whether patterns exist in how media content is viewed and shared. “Virality” refers to the tendency of a piece of media content (e.g., image, video, story, quiz) to be circulated rapidly and widely from one viewer to another.
As will be described in depth below, media content can be shared by viewers or users that transmit URLs or links targeting a particular URL to one another. Oftentimes, links and URLs are shared through social media platforms, such as Facebook® and Twitter®. Social media platforms allow media content to be quickly circulated to a large group of potential viewers.
In order to track virality, the URLs can include a generation code instead of, or in addition to, conventional Urchin Traffic Monitor (UTM) codes. The generation code can be used to assign a generation value to each viewer of a piece of media content. Some or all of the viewers can then be separated by viewing generation. In some embodiments, the URL includes a time code that can be used by an analytics engine to group viewers based on when the link was shared. For example, a subset of viewers could be separated based on when the link is received (i.e., shared by a Gen_0 viewer). This allows individual viewers to be attributed to a particular day of an advertising campaign or budget.
Tagging URLs with a generation code, a time code, or both, allows the analytics engine to track viral or social lift across multiple generations and/or time period(s). The analytics engine can determine which generations or time periods generate a profit, subsequent viewers, etc. For example, the analytics engine can determine whether an advertising campaign should continue based on the increase or decrease in revenue from more recent viewers.
Traditionally, UTM codes are used to describe attributes of an individual viewer. However, various embodiments described herein permit subsequent viewers to “inherit” certain viewing parameters (e.g., campaign source, date) from previous viewers. Other viewing parameters (e.g., content, term) can continue to be specific to each viewer. Such embodiments allow for more accurate campaign attribution. Because Gen_1, Gen_2, etc., viewers only exist because of an earlier Gen_0 viewer, it is important to track whether the Gen_0 viewer was attracted via an advertising campaign at a particular date/time or no campaign at all.
The techniques introduced herein can be embodied as special-purpose hardware (e.g., circuitry), as programmable circuitry appropriately programmed with software and/or firmware, or as a combination of special-purpose and programmable circuitry. Hence, embodiments may include a machine-readable medium having stored thereon instructions that may be used to program a computer (or another electronic device) to perform a process. The machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, compact disk read-only memories (CD-ROMs), magneto-optical disks, read-only memories (ROMs), random access memories (RAMs), erasable programmable read-only memories (EEPROMs), magnetic or optical cards, flash memory, or another type of media/machine-readable medium suitable for storing electronic instructions.
Terminology
Brief definitions of terms, abbreviations, and phrases used throughout this application are given below.
Reference in this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described that may be exhibited by some embodiments and not by others. Similarly, various requirements are described that may be requirements for some embodiments but not others.
Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” As used herein, the terms “connected,” “coupled,” or any variant thereof, means any connection or coupling, either direct or indirect, between two or more elements. The coupling or connection between the elements can be physical, logical, or a combination thereof. For example, two devices may be coupled directly, or via one or more intermediary channels or devices. As another example, devices may be coupled in such a way that information can be passed there between, while not sharing any physical connection with one another. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or,” in reference to a list of two or more items, covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.
If the specification states a component or feature “may,” “can,” “could,” or “might” be included or have a characteristic, that particular component or feature is not required to be included or have the characteristic.
The term “module” refers broadly to software, hardware, or firmware components (or any combination thereof). Modules are typically functional components that can generate useful data or another output using specified input(s). A module may or may not be self-contained. An application program (also called an “application”) may include one or more modules, or a module may include one or more application programs.
The terminology used in the Detailed Description is intended to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with certain examples. The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. For convenience, certain terms may be highlighted, for example using capitalization, italics, and/or quotation marks. The use of highlighting has no influence on the scope and meaning of a term; the scope and meaning of a term is the same, in the same context, whether or not it is highlighted. It will be appreciated that the same element can be described in more than one way.
Consequently, alternative language and synonyms may be used for any one or more of the terms discussed herein, but special significance is not to be placed upon whether or not a term is elaborated or discussed herein. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification, including examples of any terms discussed herein, is illustrative only and is not intended to further limit the scope and meaning of the disclosure or of any exemplified term. Likewise, the disclosure is not limited to various embodiments given in this specification.
System Topology Overview
The analytics engine 102 can append one or more desired parameters to a URL to a particular piece of media content 110a. The pieces of media content 110a-g depicted by
A viewer 112 can access the URL or a link targeting the URL over a network 106. The URL and link can be used and hosted by the analytics engine 102 or another computing system. The network 106 can be, for example, the Internet, a local area network, a wide area network, or a point-to-point dial-up connection. As described above, when the analytics engine 102 initially appends a generation code to the URL, the generation value can be set to an initial value (e.g., N=0).
If a Gen_0 viewer 112 subsequently decides to share the URL with others, the generation value of the generation code can be updated (e.g., to “N+1”). For example, the URL to the same piece of media content may be updated to http://www.brainfall.com/quiz/?utm_user_gen=1. Those viewers 114a-b that follow the URL or link provided by Gen_0 viewer 112 can be defined as Gen_1 viewers 114a-b. Similarly, any viewers who follow a URL or link shared by a Gen_1 viewer 114a-b can be defined as Gen_2 viewers 116a-d.
As will be further described below with respect to
The analytics engine 302 can append desired parameters to a URL to a piece of media content, such as a time code 316 that can be used to categorize viewers based on the time of viewing or sharing. The time code 316 can be configured to include a time value, date value, or both. While
In some embodiments, the URL also includes a generation code. The time value, in conjunction with a generation value, can be used for ordering or categorizing some or all of the viewers within a generation. For example, an analytics engine 302 can recognize that all Gen_1 viewers 314a-c of
In some embodiments, the time code 316 is used independently of the generation code. For example, the URL shared with Gen_1 viewer 314a may be http://www.brainfall.com/quiz/?utm_date=15_03_21. URLs that include time codes allow a statistical analysis to be performed on groups of viewers who are classifiable by sharing date. In other embodiments, the time code 315 is used in conjunction with a generation code. For example, the URL for Gen_1 viewer 314a may be http://www.brainfall.com/quiz/?utm_user_gen=1&utm_date=15_03_21. Further identifying viewers by generation allows for more granular analytics to be applied.
The time code allows the system or an administrator to separate viewers by time value(s) associated with viral events, such as sharing or viewing media content. That is, the time codes and time values allow for more rigorous analytics to be applied. In some embodiments, the system is able to identify viewer count 406 for one or more time periods or date ranges, calculate the profit generated 408 by those viewers, determine how many subsequent viewers (e.g., Gen_2 viewers) were generated by each group, etc. Such measurements can help content providers and content hosts determine what media content to advertise, content popularity, advertising campaign profitability, when to begin or terminate an advertising campaign, etc. The analytics systems described herein can assist an administrator (e.g., content host, advertiser, user) in determining exactly when an advertising campaign should end, rather than simply indicating whether or not the campaign should continue.
In some instances, a more technical system is employed that generates unique IDs for viewers or viewing sessions that are stored in a lookup database.
In addition to conventional UTM codes that track source, medium, term, content, campaign, etc., the lookup database 500 may also allow viewers to be attributed to specific sources 504 or be traced through previous generations 506 of viewers. This allows the system or administrator to determine which viewers generate profit, are prolific sharers, are more likely to convert a “share” into a viewer, etc. Such viewers can then be specifically targeted by the content host/provider or an advertiser in the future. In some embodiments, the unique IDs are used to generate viral distribution maps that indicate how a piece of media content spread from Gen_0 to future generations.
The lookup database 500 and unique IDs also allow downstream performance to be analyzed. For example, the number of subsequent viewers (“children”) originating from a particular viewer (“parent”) can be tracked. Consequently, the lookup database 500 can be used to determine whether a viewer is high-value or low-value. In some embodiments, advertisements, content, etc., can be targeted to those users who are considered high-value. The metrics that are collected may be used to algorithmically make real-time updates to advertising campaigns.
The unique IDs can also be used to determine whether a particular viewer should be added to a retargeting list for future advertising campaigns, content, etc. For example, anonymous users (e.g., those within a private network) can be identified and targeted in the following way. A unique ID can be assigned to the anonymous user when accessing the host website. Generally, the unique ID is stored on the network-accessible computing device (e.g., cellular phone, tablet, computer) used to access the website. In some instances the unique ID is stored in a cookie or cookie-like structure. When the anonymous user elects to share a link to the website, the unique ID is included within the shared link(s) as the parent ID. Whenever the anonymous user (“parent”) returns to the website, downstream performance can be checked by determining how many “children” users were generated. If the parent ID performed well (e.g., generated a large number of children), it can be added to a retargeting group.
In some embodiments, the chart 600 is presented to an administrator or a user by a graphical user interface (GUI). The GUI and analytics engine can be part of the same computing system or distinct computing systems. For example, analytics engine may be part of a first computing device and the GUI may be part of a second computing device. In such embodiments, the analytics engine can generate analytical results, such as virality measurements, chart(s), etc., and transmit the analytical results to the second computing device over a network. As another example, both the analytics engine and the GUI may be part of the same computing device. The computing devices may be a server, a personal computer, a tablet, a laptop computer, a personal digital assistant (PDA), a cellular telephone, a smartphone, etc.
Media content can also experience various levels and periods of popularity. For example, Gen_0 viewers represent the largest segment of viewers for piece of media content 702. This may occur if the piece of media content 702 is the subject of an advertising campaign (i.e., many viewers are targeted directly). The number of viewers may decrease in subsequent generations if viewers in earlier generations (e.g., Gen_0, Gen_1, Gen_2) elect not to share the content or if potential viewers elect not to follow URLs and links that have been shared. As another example, piece of media content 704 experiences a revival in viewership beginning at Gen_17. The revival could be due, at least in part, to a single Gen_17 user that widely shares the piece of media content or a higher conversion rate (i.e., high proportion of “shares” converted into viewers).
Chart 900 of
Chart 1000 of
Chart 1100 of
Comparisons that involve later generations (e.g., Gen_4+, Gen_6+) can be useful in determining true (i.e., unbiased) virality because these viewers are further removed from direct targeting. However, important viewing characteristics and financial measurements can come from comparing Gen_0 and Gen_1 viewers to other generations. For example, the measurements may indicate how media content is likely to propagate once outside of the base of loyal followers and/or advertising base.
The various charts described above are useful in identifying popular media content and successful advertising campaigns as quickly as possible. Identification of important trends and patterns will typically be based on historical trends of successful media content, although the systems and methods described herein can be used to do this more effectively and efficiently.
At block 1204, a URL to a piece of media content can be tagged with the generation code. For example, a URL to a piece of media content (e.g., a quiz) may be tagged with utm_user_gen=0. A viewer can select the URL or a link targeted to the URL to view the media content. If a viewer is directly targeted by an advertisement or accesses the URL organically (e.g., by browsing a content website), the viewer will be characterized as Gen_0. That is, the generation value of the URL is set to the initial value (e.g., N=0). At block 1206, the viewer is able to view and share the media content with other potential viewers. The viewer may share the media content by emailing, texting, or sharing (e.g., via social media platforms such as Facebook® and Twitter®) the URL.
At block 1208, the analytics engine or computing system can determine whether the viewer elected to share the media content. If the viewer does not elect to share, no action is taken. However, if the viewer does elect to share, the generation value is updated, as shown at block 1210. For example, the initial generation of “N” can be updated to “N+1.” Each time the URL is subsequently shared, the generation value is updated. The process 1200 can continue so long as the URL to the piece of media content continues to be shared by subsequent viewers.
At block 1310, the analytics platform can increment the generation value if the viewer elects to share the media content. The generation value may be an integer value that represents the number of number of times the media content has been shared within a chain of viewers. In such embodiments, if the media content has been shared twice, the ensuing URL includes a generation value of two. At block 1312, some or all of the viewers can be sorted into generations based on their generation values. At block 1314, counts can be generated of the viewers within each generation. The viewer counts are useful in determining virality and social lift, among other measurements that impact marketing and advertising decisions. In some embodiments, the counts are subject to statistical analysis, the results of which can be textual (e.g., tables) or graphical (e.g., charts) in nature.
One skilled in the art will recognize the example URLs, unique IDs, etc., described herein are intended to be illustrative only. Various naming, numbering, and coding conventions could be used. Moreover, a particular convention (e.g., a lookup database that employs randomly-generated unique IDs that mask a viewer's identity) may be preferred in some situations, but undesirable in others. The term “UTM codes,” meanwhile, has been used throughout the specification to describe any parameters appended to a link. Other types of parameters and/or methods of appending the parameters could also be used, including, for example, parameters that are encoded and obfuscated within the URL.
In various embodiments, the computing system 1400 operates as a standalone device, although the computing system 1400 may be connected (e.g., wired or wirelessly) to other machines. In a networked deployment, the computing system 1400 may operate in the capacity of a server or a client machine in a client-server network environment, or as a peer machine in a peer-to-peer (or distributed) network environment.
The computing system 1400 may be a server computer, a client computer, a personal computer, a user device, a tablet, a laptop computer, a PDA, a cellular telephone, an iPhone, an iPad, a Blackberry, a processor, a telephone, a web appliance, a network router, switch or bridge, a console, a hand-held console, any portable/mobile hand-held device, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by the computing system 1400.
While the main memory 1406, non-volatile memory 1410, and storage medium 1426 (also called a “machine-readable medium”) are shown to be a single medium, the term “machine-readable medium” and “storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store one or more sets of instructions 1428. The term “machine-readable medium” and “storage medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the computing system and that cause the computing system to perform any one or more of the methodologies of the presently disclosed embodiments.
In general, the routines executed to implement the embodiments of the disclosure, may be implemented as part of an operating system or a specific application, component, program, object, module or sequence of instructions referred to as “computer programs.” The computer programs typically comprise one or more instructions (e.g., instructions 1404, 1408, 1428) set at various times in various memory and storage devices in a computer, and that, when read and executed by one or more processing units or processors 1402, cause the computing system 1400 to perform operations to execute elements involving the various aspects of the disclosure.
Moreover, while embodiments have been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that the various embodiments are capable of being distributed as a program product in a variety of forms, and that the disclosure applies equally regardless of the particular type of machine or computer-readable media used to actually effect the distribution.
Further examples of machine-readable storage media, machine-readable media, or computer-readable (storage) media include, but are not limited to, recordable type media such as volatile and non-volatile memory devices 1410, floppy and other removable disks, hard disk drives, optical disks (e.g., Compact Disk Read-Only Memory (CD ROMS), Digital Versatile Disks, (DVDs)), and transmission type media such as digital and analog communication links.
The network adapter 1412 enables the computing system 1400 to mediate data in a network 1414 with an entity that is external to the computing device 1400, through any known and/or convenient communications protocol supported by the computing system 1400 and the external entity. The network adapter 1412 can include one or more of a network adaptor card, a wireless network interface card, a router, an access point, a wireless router, a switch, a multilayer switch, a protocol converter, a gateway, a bridge, bridge router, a hub, a digital media receiver, and/or a repeater.
The network adapter 1412 can include a firewall that can, in some embodiments, govern and/or manage permission to access/proxy data in a computer network, and track varying levels of trust between different machines and/or applications. The firewall can be any number of modules having any combination of hardware and/or software components able to enforce a predetermined set of access rights between a particular set of machines and applications, machines and machines, and/or applications and applications, for example, to regulate the flow of traffic and resource sharing between these varying entities. The firewall may additionally manage and/or have access to an access control list which details permissions including for example, the access and operation rights of an object by an individual, a machine, and/or an application, and the circumstances under which the permission rights stand.
Other network security functions can be performed or included in the functions of the firewall, can include, but are not limited to, intrusion-prevention, intrusion detection, next-generation firewall, personal firewall, etc.
As indicated above, the techniques introduced here implemented by, for example, programmable circuitry (e.g., one or more microprocessors), programmed with software and/or firmware, entirely in special-purpose hardwired (i.e., non-programmable) circuitry, or in a combination or such forms. Special-purpose circuitry can be in the form of, for example, one or more application-specific integrated circuits (ASICs), programmable logic devices (PLDs), field-programmable gate arrays (FPGAs), etc.
Remarks
The foregoing description of various embodiments of the claimed subject matter has been provided for the purposes of illustration and description. It is not intended to be exhaustive or to limit the claimed subject matter to the precise forms disclosed. Many modifications and variations will be apparent to one skilled in the art. Embodiments were chosen and described in order to best describe the principles of the invention and its practical applications, thereby enabling others skilled in the relevant art to understand the claimed subject matter, the various embodiments, and the various modifications that are suited to the particular uses contemplated.
While embodiments have been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that the various embodiments are capable of being distributed as a program product in a variety of forms, and that the disclosure applies equally regardless of the particular type of machine or computer-readable media used to actually effect the distribution.
Although the above Detailed Description describes certain embodiments and the best mode contemplated, no matter how detailed the above appears in text, the embodiments can be practiced in many ways. Details of the systems and methods may vary considerably in their implementation details, while still being encompassed by the specification. As noted above, particular terminology used when describing certain features or aspects of various embodiments should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the invention with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the invention to the specific embodiments disclosed in the specification, unless those terms are explicitly defined herein. Accordingly, the actual scope of the invention encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the embodiments under the claims.
The language used in the specification has been principally selected for readability and instructional purposes, and it may not have been selected to delineate or circumscribe the inventive subject matter. It is therefore intended that the scope of the invention be limited not by this Detailed Description, but rather by any claims that issue on an application based hereon. Accordingly, the disclosure of various embodiments is intended to be illustrative, but not limiting, of the scope of the embodiments, which is set forth in the following claims.
Palmer, Joshua, Skowronski, Paul, Bui, Anthony
Patent | Priority | Assignee | Title |
7053767, | Jun 22 1998 | SIPCO, LLC | System and method for monitoring and controlling remote devices |
Patent | Priority | Assignee | Title |
6882977, | Jul 31 2000 | HTC Corporation | Method and facility for displaying customer activity and value |
8145528, | May 23 2005 | Open Text SA ULC | Movie advertising placement optimization based on behavior and content analysis |
8682809, | Apr 18 2012 | Scorpcast, LLC | System and methods for providing user generated video reviews |
9276757, | Jul 13 2012 | GOOGLE LLC | Generating viral metrics |
20050204292, | |||
20070168216, | |||
20070256095, | |||
20080016229, | |||
20080091517, | |||
20080215426, | |||
20080256233, | |||
20090055200, | |||
20090222796, | |||
20100082736, | |||
20100217720, | |||
20100318611, | |||
20110313996, | |||
20120109737, | |||
20120109836, | |||
20120136714, | |||
20120271719, | |||
20120290950, | |||
20130013393, | |||
20130066711, | |||
20130073568, | |||
20130117097, | |||
20130159233, | |||
20130262559, | |||
20130318180, | |||
20140075317, | |||
20140095412, | |||
20140129668, | |||
20140222588, | |||
20140304724, | |||
20140337120, | |||
20140344718, | |||
20150088635, | |||
20150161624, | |||
20150243279, | |||
20150245084, | |||
20160019033, |
Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
May 13 2015 | Brainfall.com, Inc. | (assignment on the face of the patent) | / | |||
Aug 14 2015 | PALMER, JOSHUA | BRAINFALL COM, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 036416 | /0555 | |
Aug 18 2015 | SKOWRONSKI, PAUL | BRAINFALL COM, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 036416 | /0555 | |
Aug 18 2015 | BUI, ANTHONY | BRAINFALL COM, INC | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 036416 | /0555 |
Date | Maintenance Fee Events |
Dec 20 2021 | REM: Maintenance Fee Reminder Mailed. |
Jun 06 2022 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
Date | Maintenance Schedule |
May 01 2021 | 4 years fee payment window open |
Nov 01 2021 | 6 months grace period start (w surcharge) |
May 01 2022 | patent expiry (for year 4) |
May 01 2024 | 2 years to revive unintentionally abandoned end. (for year 4) |
May 01 2025 | 8 years fee payment window open |
Nov 01 2025 | 6 months grace period start (w surcharge) |
May 01 2026 | patent expiry (for year 8) |
May 01 2028 | 2 years to revive unintentionally abandoned end. (for year 8) |
May 01 2029 | 12 years fee payment window open |
Nov 01 2029 | 6 months grace period start (w surcharge) |
May 01 2030 | patent expiry (for year 12) |
May 01 2032 | 2 years to revive unintentionally abandoned end. (for year 12) |