Patent Application
20150254219
The present invention relates generally to generation of digital content and more particularly to injecting content into webpages.
Conventional technology constituting background to certain embodiments of the present invention is described in the following publications inter alia:
Ex post facto injection of content into existing content web pages is commonplace. The injected content can be placed close to the content (e.g. before the content, after the content, or aside the content).
Banner blindness means that most of the focus of the eyes of the readers are on the existing content and not on the injected content, causing low performance for the injected content.
Content today is rich in media (text, images, videos & interactive apps).
Content is currently dynamic, in the sense that content may fluctuate e.g. based on web-initiated updates and/or user interactions, and/or may be rendered differently on different devices.
The disclosures of all publications and patent documents mentioned in the specification, and of the publications and patent documents cited therein directly or indirectly, are hereby incorporated by reference. Materiality of such publications and patent documents to patentability is not conceded
In order to find the most effective place within the existing content to place injected content, it is therefore sought to analyze content in a manner independent of the rendering of the content. For example, a heat map based on mouse movements and pixel tracking on the web may not be valid if the same page is rendered on a mobile device, or if the user selects to increase the font size, or even if the content owner inserts an image or adds some text.
Certain embodiments seek to provide an injected content insertion system defining and utilizing attention based elements e.g. webpage portions.
Certain embodiments seek to provide a method for collecting data about elements (paragraphs, images, videos) in a media file to rank the most attractive elements in each media and insert injected content adjacent e.g. above/below/atop attractive elements.
Certain embodiments seek to provide a method that works on the elements level to find which elements get the most eyeballs, and insert injected content close to these elements, regardless of the way the page is rendered. It is also possible to measure the performance of injected content inserted in the page in connection to the closest content elements they are inserted to, and to find the injected content location in the page which generates the most clicks, based on closeness to content elements.
Certain embodiments seek to provide a system operative to gather statistics/data from users who scroll a site and/or to use the gathered data in order to find hot elements and inject contents accordingly.
Certain embodiments seek to provide digital signatures for content elements which are accurate and tolerant to page changes. A conventional approach may employ xpath but this might not tolerate different devices or changes to a webpage.
Certain embodiments seek to ensure that the injected content inside content pages are located close to, e.g. at or around, the most attractive e.g. visible and/or effective elements in the page.
Certain embodiments seek to provide methods and devices to insert injected content based on elements visibility data inside the content.
The system may collect click statistics about each injected content placement in order to see which is the more effective and may store most affective injected content locations. For example the system may identify the top 6 (say) hot elements and for each of user groups 1, 2 inject injected content in 3 of the 6 locations. Click rates for each location are recorded and a higher rank goes to those location's associated with better clicks.
Typically, only a single data log is provided per media file, regardless of how the media file is rendered and on which device the file is rendered. In contrast, when heat maps are used, if the webpage changes even slightly, e.g. an image is added or removed, the heat map becomes invalid, and content is injected in the wrong places.
An advantage of certain embodiments is that conventional heat maps find segments which are hot but such segments might include more than one element (images, paragraphs, videos), and the heat map does not know which is the hottest. In contrast, certain embodiments herein do rank the hottest elements thereby to more accurately identify locations for content injection.
An advantage of certain embodiments is that dynamic pages can be handled. If certain pages have dynamic content which is revealed responsive to a click, certain embodiments of the present invention recognize whether or not an element is being displayed, and insert content accordingly.
The following terms may be construed either in accordance with any definition thereof appearing in the prior art literature or in accordance with the specification, or as follows:
The term “closeness” may be defined suitably depending on the application. For example, “close” may be used to mean “within reader's field of view” e.g. injected content is injected close enough to an attractive content element e.g. article being read, such that when a user reads the article (focuses on the content element), the injected content also becomes visible, since it is within the field of view.
The term “content element” or “content item” or “content portion” is intended to include any object (e.g. image, video, or text unit such as article or section thereof or paragraph or heading therewithin) in a document represented for recognition by a browser using a pre-defined, typically computer-platform-neutral and/or computer-language-neutral, interface. For example, the Document Object Model (DOM) is currently an extremely prevalent platform- and language-neutral interface for representing and interacting with objects in HTML, XHTML and XML documents. “The Document Object Model allows programs and scripts to dynamically access and update the content, structure and style of documents. Each object in the DOM tree is termed herein a “DOM element” and content elements, items or portions may each include a DOM element or one or more adjacent DOM elements. However, it is appreciated that embodiments of the present invention would also be applicable, mutatis mutandis, to interfaces other than DOM, which might be developed for representing and interacting with objects in documents such as but not limited to HTML, XHTML and/or XML documents, including allowing programs and/or scripts to dynamically access and/or update content, structure and/or style of at least one document. Such interfaces might share some but not all of the characteristics of the DOM interface. Each content element, item or portion might then include an element, or one or more adjacent such elements, of a suitable interface other than DOM. The term “Content portions” or content elements is typically not intended to refer to trivial partitioning of a website page such as dividing a website page into pixels or alphanumeric characters therewithin, or row thereof.
“children”—A DOM (say) element including content elements such as text or video may have children. For example, a text content element <p> could have children elements like <a><span><strong> or any other tag the developer chooses. A video content element may be wrapped in an <object> tag which often has child elements which provide more information about the video itself. DOM (Document Object Model) represents documents using a tree structure thereby to define nodes which are “children” of other nodes.
“Injected content”: content to be added to an existing webpage. It is appreciated that the methods herein are suitable for injecting any suitable content item such as but not limited to: exhortations to perform an action for maintaining safety of at least one of: equipment, humans and data; news flashes; advertisements; reminders pre-defined by a human user or community of users; ergonometric information; updates pertaining to new voice, text or media messages (emails, SMS, etc.) received by the human user on other systems; jokes and entertainment; and content recommendation e.g., references to articles and/or media files that the user might wish to access.
“Performance” may refer to the number of clicks on an item of injected content close to a particular content element. More generally, performance is the extent of interaction (e.g. as accumulated by a performance counter or engagement counter) with injected content e.g. number of times the user played the injected content, if video. High performance speaks well for the decision to inject content at its current location within the webpage rather than in other locations.
“Reverse method”: Given a digital signature, find a content element e.g. in a webpage having a digital signature which is similar to the given digital signature; this is the “reverse” of generating a digital signature for a given content element. For example, given a stored digital signature which is known to characterize a content element found on a first webpage, find a corresponding content element having a digital signature as similar as possible to the given digital signature, on a second webpage which may be an update or differently rendered version of the first webpage.
Signature or “digital signature”: content portions are identified within webpages generated by each of a population of legacy websites, and analyzed to determine at least one characteristic thereof (e.g. DOM attribute) other than portion location. The signature is then an indication of an individual content portion, comprising a function of the characteristic/s such as a hash of the DOM attributes or a unity function thereof e.g. the content portion attributes themselves. The signature serves to identify content elements uniquely within a web page including within a variation (e.g. updated or differently rendered version) of the webpage in which content element/s are still recognizable by humans.
“Text content” of an element: the actual text inside the tag including its child text. Text content can for example be extracted by removing all tags from the DOM element's inner html attributes using some regular expression or any other method that allows to extract a DOM element text content (for example jquery.text( )). It is appreciated that images are elements which lack both text content and children.
“Visibility” is the extent to which a portion of a website page attracts visitors, e.g. as measured by eyeball tracking or presence of user input device e.g. mouse. “Attractive” is intended to include popular, most viewed, peak interest and hot webpage elements; the term “hot” being used in the sense of heat maps which indicate portions of a webpage which are attractive to (e.g. are accessed or interacted with, by) visitors.
Typically, it is desired to gain maximal exposure for injected content, by placing the injected content close to attractive content already on the webpage. For example, if the injected content is within the field of view of a user who is scanning attractive content, the user may perforce be exposed to the injected content as well.
Placing injected content close to the most attractive elements in the page increases the time the injected content is visible to the user and therefore increase the click through rate (CTR), hence exposure of the injected content.
Example embodiments include:
i. In the Internet, content pages are a collection of HTML DOM Elements (the “elements”). Usually the content is a collection of text elements, image elements and video elements. This method is designed to find the content elements which gets the most eyeballs in time units (“hot spot”) and according to a given injected content inventory, inject the optimal injected content as close as possible to the hot spots.
When given a collection of content elements (text, images and videos) the method counts for each element the number of milliseconds it stays in the main center area of the screen. This data is sent to a remote server which aggregates all the data into a single score for each element. When a user visit a page, the server provides for each content element in the page its computed score and the top scored elements are considered as the hot spots in the page.
The system then checks the dimensions (left, top, width, and height) of each element and tries to see, according to the dimensions, if there is an injected content in the inventory which might be fit to be injected close to the hot spot element. In case of a match, the injected content is injected, otherwise the method continues to the next hot spot in the page and iterates on the process once again.
ii. A web page may include HTML DOM (Document Object Model) elements (The “element”). Given an element from a web page, this method may generate a digital signature for this element. The signature is a collection of data that may allow the reverse method to find the original element in a given page regardless of current location, size of the element in the page or regardless of the device which the page is rendered on. Once a digital signature is captured, it is possible to attach information on elements and store this signature and related data in a remote server and find the element in a page based on the signature which is provided from the remote server.
The method works in both ways:
1) For an input, element may output a digital representation of this element (“Signature”).
2) For an input, signature of an element may output the HTML DOM Element in the page.
The signature is a set of several data components which is extracted for the given element. The present invention also typically includes at least the following embodiments:
Embodiment 1. A computer-implemented method for recording content portions identified within webpages generated by each of a population of legacy websites, including, for at least one individual webpage:
identifying content portions of the individual webpage,
using a processor for analyzing said content portions to determine at least one characteristic thereof other than portion location, and
storing in a computerized database, in association with the individual webpage, an indication of each of said content portions, comprising a function of the characteristic/s.
Embodiment 2. A method according to any of the preceding embodiments and also comprising using said indication for identifying said elements on a website page that has been altered.
Embodiment 3. A method according to any of the preceding embodiments wherein the characteristics include at least one attribute which is unique to only one content element in a webpage.
Embodiment 4 A method according to any of the preceding embodiments and also comprising:
identifying webpage elements having a pre-defined criterion from among said elements;
and inserting injected content adjacent said elements having said pre-defined criterion.
Embodiment 5. A method according to any of the preceding embodiments and also comprising for each individual client device within a given group of client devices used to render said individual webpage:
using said indication for identifying said elements on at least said individual website page as rendered by said individual client device and
identifying webpage elements having a pre-defined criterion from among elements identified at said client device and inserting content items adjacent said elements having a pre-defined criterion,
thereby to inject an individual content item at different locations in the individual webpage on different client devices, if elements are identified at different locations at different client devices due to differential rendering of the webpage to accommodate the different client devices.
Embodiment 6. A method according to any of the preceding embodiments wherein said webpage elements having a pre-defined criterion comprise attractive webpage elements.
Embodiment 7. A method according to any of the preceding embodiments wherein said pre-defined criterion comprises a contextual criterion.
Embodiment 8. A method according to any of the preceding embodiments wherein said contextual criterion is defined in terms of presence of pre-selected keywords in webpage elements.
Embodiment 9. A method according to any of the preceding embodiments wherein said function comprises a hash function. It is appreciated that the function could also comprise the unity function in which case the characteristics themselves are stored.
Embodiment 10. A method according to any of the preceding embodiments wherein said content portions are represented for recognition by a browser using a pre-defined interface.
Embodiment 11. A method according to any of the preceding embodiments wherein said pre-defined interface is computer-platform-neutral and/or computer-language-neutral.
Embodiment 12. A method according to any of the preceding embodiments wherein said content portions each comprise at least one DOM element.
Embodiment 13. A method according to any of the preceding embodiments wherein said content portions each comprise exactly one DOM element.
Embodiment 14. A method according to any of the preceding embodiments wherein said content portions each consist of an integer number of DOM elements.
Embodiment 15. A computer-implemented method for injecting content into webpages, the method comprising:
identifying content elements in a first rendering of an individual website page by an individual client device;
using a processor for identifying said content elements in a second rendering of said individual website page by at least one additional client device;
selecting webpage elements having a pre-defined criterion from among said content elements and inserting content items adjacent said elements having a pre-defined criterion,
thereby to systematically inject an individual content item at different locations in the individual webpage on different client devices, if elements are identified at different locations at different client devices due to differential rendering of the webpage to accommodate the different client devices.
Embodiment 16. A method according to any of the preceding embodiments wherein said content portions comprise DOM elements, thereby to define a DOM structure for the individual webpage and said using comprises searching said DOM structure to find at least one candidate element on said individual webpage which has a first DOM element attribute corresponding to a sought-for DOM element, defining said candidate element as the sought-for element if a predetermined success criterion is fulfilled, and otherwise repeating said defining for at least one candidate element on said individual webpage which has a second DOM element attribute which differs from said first DOM element attribute.
Embodiment 17. A method according to any of the preceding embodiments wherein said searching is performed using document.querySelectorAll.
Embodiment 18 A method according to any of the preceding embodiments wherein said predetermined success criterion comprises reaching a threshold which is a percentage of a sum of weights, including a weight for each attribute of the sought-for DOM element, thereby to represent a maximal score of a candidate element which perfectly matches the sought-for DOM element.
Embodiment 19. A method according to any of the preceding embodiments wherein the percentage differs predeterminedly over websites.
Embodiment 20. A method according to any of the preceding embodiments wherein said identifying comprises determining, when a user scrolls the individual webpage, a duration of time during which each individual content portion remains in viewport, until at least one of a next scroll event and a time-out occurs, and storing said duration in association with said function of said individual content portion's characteristics.
Embodiment 21. A method according to any of the preceding embodiments wherein said identifying comprises determining, when a user scrolls the individual webpage, a duration of time during which an input device interacts with each individual content portion, until at least one of a next scroll event and a time-out occurs, and storing said duration in association with said function of said individual content portion's characteristics.
Embodiment 22. A method according to any of the preceding embodiments wherein said content portion has a tree structure including hierarchically related nodes and said storing includes recursively generating digital signatures for each node in said tree structure.
Embodiment 23. A computer program product, comprising a non-transitory tangible computer readable medium having computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for recording content portions identified within webpages generated by each of a population of legacy websites, including, for at least one individual webpage:
identifying content portions of the individual webpage,
using a processor for analyzing said content portions to determine at least one characteristic thereof other than portion location, and
storing in a computerized database, in association with the individual webpage, an indication of each of said content portions, comprising a function of the characteristic/s.
Embodiment 24. A system for recording content portions identified within webpages generated by each of a population of legacy websites, including, for at least one individual webpage:
Webpage analysis apparatus for identifying content portions of the individual webpage,
a processor for analyzing said content portions to determine at least one characteristic thereof other than portion location, and
a computerized database operative for storing, in association with the individual webpage, an indication of each of said content portions, comprising a function of the characteristic/s.
Embodiment 25. A system for injecting content into webpages, comprising:
A content element identification subsystem operative for identifying content elements in a first rendering of an individual website page by an individual client device;
a processor for identifying said content elements in a second rendering of said individual website page by at least one additional client device;
content element insertion functionality operative for selecting webpage elements having a pre-defined criterion from among said content elements and inserting content items adjacent said elements having a pre-defined criterion,
thereby to systematically inject an individual content item at different locations in the individual webpage on different client devices, if elements are identified at different locations at different client devices due to differential rendering of the webpage to accommodate the different client devices.
Embodiment 26. A computer program product, comprising a non-transitory tangible computer readable medium having computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for injecting content into webpages, the method comprising:
identifying content elements in a first rendering of an individual website page by an individual client device;
using a processor for identifying said content elements in a second rendering of said individual website page by at least one additional client device;
selecting webpage elements having a pre-defined criterion from among said content elements and inserting content items adjacent said elements having a pre-defined criterion,
thereby to systematically inject an individual content item at different locations in the individual webpage on different client devices, if elements are identified at different locations at different client devices due to differential rendering of the webpage to accommodate the different client devices.
Also provided, excluding signals, is a computer program comprising computer program code means for performing any of the methods shown and described herein when said program is run on at least one computer; and a computer program product, comprising a typically non-transitory computer-usable or -readable medium e.g. non-transitory computer-usable or -readable storage medium, typically tangible, having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement any or all of the methods shown and described herein. The operations in accordance with the teachings herein may be performed by at least one computer specially constructed for the desired purposes or general purpose computer specially configured for the desired purpose by at least one computer program stored in a typically non-transitory computer readable storage medium. The term “non-transitory” is used herein to exclude transitory, propagating signals or waves, but to otherwise include any volatile or non-volatile computer memory technology suitable to the application.
Any suitable processor/s, display and input means may be used to process, display e.g. on a computer screen or other computer output device, store, and accept information such as information used by or generated by any of the methods and apparatus shown and described herein; the above processor/s, display and input means including computer programs, in accordance with some or all of the embodiments of the present invention. Any or all functionalities of the invention shown and described herein, such as but not limited to steps of flowcharts, may be performed by at least one conventional personal computer processor, workstation or other programmable device or computer or electronic computing device or processor, either general-purpose or specifically constructed, used for processing; a computer display screen and/or printer and/or speaker for displaying; machine-readable memory such as optical disks, CDROMs, DVDs, BluRays, magnetic-optical discs or other discs; RAMs, ROMs, EPROMs, EEPROMs, magnetic or optical or other cards, for storing, and keyboard or mouse for accepting. The term “process” as used above is intended to include any type of computation or manipulation or transformation of data represented as physical, e.g. electronic, phenomena which may occur or reside e.g. within registers and/or memories of at least one computer or processor. The term processor includes a single processing unit or a plurality of distributed or remote such units.
The above devices may communicate via any conventional wired or wireless digital communication means, e.g. via a wired or cellular telephone network or a computer network such as the Internet.
The apparatus of the present invention may include, according to certain embodiments of the invention, machine readable memory containing or otherwise storing a program of instructions which, when executed by the machine, implements some or all of the apparatus, methods, features and functionalities of the invention shown and described herein. Alternatively or in addition, the apparatus of the present invention may include, according to certain embodiments of the invention, a program as above which may be written in any conventional programming language, and optionally a machine for executing the program such as but not limited to a general purpose computer which may optionally be configured or activated in accordance with the teachings of the present invention. Any of the teachings incorporated herein may, wherever suitable, operate on signals representative of physical objects or substances.
The embodiments referred to above, and other embodiments, are described in detail in the next section.
Any trademark occurring in the text or drawings is the property of its owner and occurs herein merely to explain or illustrate one example of how an embodiment of the invention may be implemented.
Unless specifically stated otherwise, as apparent from the following discussions, it is appreciated that throughout the specification discussions, utilizing terms such as, “processing”, “computing”, “estimating”, “selecting”, “ranking”, “grading”, “calculating”, “determining”, “generating”, “reassessing”, “classifying”, “generating”, “producing”, “stereo-matching”, “registering”, “detecting”, “associating”, “superimposing”, “obtaining” or the like, refer to the action and/or processes of at least one computer/s or computing system/s, or processor/s or similar electronic computing device/s, that manipulate and/or transform data represented as physical, such as electronic, quantities within the computing system's registers and/or memories, into other data similarly represented as physical quantities within the computing system's memories, registers or other such information storage, transmission or display devices. The term “computer” should be broadly construed to cover any kind of electronic device with data processing capabilities, including, by way of non-limiting example, personal computers, servers, computing system, communication devices, processors (e.g. digital signal processor (DSP), microcontrollers, field programmable gate array (FPGA), application specific integrated circuit (ASIC), etc.) and other electronic computing devices.
The present invention may be described, merely for clarity, in terms of terminology specific to particular programming languages, operating systems, browsers, system versions, individual products, and the like. It will be appreciated that this terminology is intended to convey general principles of operation clearly and briefly, by way of example, and is not intended to limit the scope of the invention to any particular programming language, operating system, browser, system version, or individual product.
Elements separately listed herein need not be distinct components and alternatively may be the same structure.
Any suitable input device, such as but not limited to a sensor, may be used to generate or otherwise provide information received by the apparatus and methods shown and described herein. Any suitable output device or display may be used to display or output information generated by the apparatus and methods shown and described herein. Any suitable processor/s may be employed to compute or generate information as described herein e.g. by providing one or more modules in the processor/s to perform functionalities described herein. Any suitable computerized data storage e.g. computer memory may be used to store information received by or generated by the systems shown and described herein. Functionalities shown and described herein may be divided between a server computer and a plurality of client computers. These or any other computerized components shown and described herein may communicate between themselves via a suitable computer network.
a-1b, taken together, illustrate a process of finding content elements in a web page that are more attractive e.g. get more visibility (also termed herein “attractiveness”), regardless of the way the page is rendered, and injecting additional content into the webpage, as close as possible to these attractive content elements. The method typically includes recording content portions identified within webpages generated by each of a population of legacy websites, including, for at least one individual webpage: identifying content portions of the individual webpage, using a processor for analyzing said content portions to determine at least one characteristic thereof other than portion location, and storing in a computerized database, in association with the individual webpage, an indication of each of these content portions, comprising a function of the characteristic/s. Alternatively or in addition, the method includes injecting content into webpages, including identifying content elements in a first rendering of an individual website page by an individual client device and using a processor for identifying the same content elements in a second rendering of said individual website page by at least one additional client device; and selecting webpage elements having a pre-defined criterion from among said content elements and inserting content items adjacent said elements having a pre-defined criterion, thereby to systematically inject an individual content item at different locations in the individual webpage on different client devices, if elements are identified at different locations at different client devices due to differential rendering of the webpage to accommodate the different client devices. The method of
Prior art
b is an example of a content element (
Methods and systems included in the scope of the present invention may include some (e.g. any suitable subset) or all of the functional blocks illustrated in the specifically illustrated implementations by way of example, in any suitable order e.g. as shown.
Computational components described and illustrated herein can be implemented in various forms, for example, as hardware circuits such as but not limited to custom VLSI circuits or gate arrays or programmable hardware devices such as but not limited to FPGAs, or as software program code stored on at least one tangible or intangible computer readable medium and executable by at least one processor, or any suitable combination thereof. A specific functional component may be formed by one particular sequence of software code, or by a plurality of such, which collectively act or behave or act as described herein with reference to the functional component in question. For example, the component may be distributed over several code sequences such as but not limited to objects, procedures, functions, routines and programs and may originate from several computer files which typically operate synergistically.
Data can be stored on one or more tangible or intangible computer readable media stored at one or more different locations, different network nodes or different storage devices at a single node or location.
It is appreciated that any computer data storage technology, including any type of storage or memory and any type of computer components and recording media that retain digital data used for computing for an interval of time, and any type of information retention technology, may be used to store the various data provided and employed herein. Suitable computer data storage or information retention apparatus may include apparatus which is primary, secondary, tertiary or off-line; which is of any type or level or amount or category of volatility, differentiation, mutability, accessibility, addressability, capacity, performance and energy use; and which is based on any suitable technologies such as semiconductor, magnetic, optical, paper and others.
A system and method allowing content to be injected into a web page close to elements which get most visibility and/or highest performance, without being disrupted by a change in the way the page is rendered or in the device the page is rendered on, are now described in detail, along with methods and functionalities useful inter alia in conjunction therewith.
In an embodiment, a method is operative for finding the most attractive e.g.
visible elements in a web page and to insert injected content close to them, e.g. as shown in
The method of
5: Client 400's content server or browser 401 is requested by a user to render a certain page by providing the page URL. Responsively, via network, browser 401 sends request to web server (also termed herein “content server”) 402 including URL.
10: Responsively, I. web server 402 finds requested page and sends page's content back to browser 401, or ii. web server 402 may make one or more requests to the injected content management module 403 instead of the browser doing so, thereby to allow the whole process to be made with one call to the server 402.
15: browser 401 then (a) starts rendering requested page and sends request to injected content management module 403 for the given URL or (b) makes 2 separate requests, one to get the elements data array and the other one is to get the injected content inventory data.
20: injected content management module 403 gets from elements module 404 an array of all elements data 210 for requested URL.
25: elements module 404 gets all elements data 210 for requested page by querying elements database 405
30: injected content management module 403 requests injected content inventory (e.g. as per the method of
32: injected content module 406 queries injected content database 407 and sends data retrieved back to browser 401.
33: injected content management module 403 sends back to the browser 401 an array of data set 210 for all the content elements available for this page as returned by elements module 404, and a data set of injected content inventory (e.g. as shown in
35. browser 401 uses retrieved data to find elements in current webpage according to the digital signature 200, e.g. as per method of
36. browser 401 associates elements found in step 35 with their visibility data 211 to ensure each element in webpage has its visibility score 211.
40: browser 401 sorts elements, ranked by visibility data 211 and/or performance data 212, yielding a ranking for hottest elements in current webpage
45: if source of the injected content inventory is external (as per data of
So, as shown, a request from a user is made (
201 is the unique (within the page) (ID attribute) which a webpage programmer may have defined for the element. Elements with this attribute may look like this: <div id=“myid”>. 201 may get a high weight score, e.g. higher than any other attribute, since this ID is typically assigned to only one single DOM element (say) within a webpage.
202 is the class name which was given to this element: <div class=“class1 class2”>. 202 is not very unique in the sense that more than one element in a given page could have the same class and therefore its weight score may be low.
203 and 204 are referred to elements which point to some resource in the Internet using a URL. Since URLs are unique within each given web-page, the weight score for this attribute may be high.
206 is a representation e.g. hash of the actual content an element may include.
Any suitable method may be employed to generate the hash e.g. as described herein with reference to STEP 1030 in
b, then, illustrates content element data used to identify a content element including the content element's digital signature data e.g. as per
b is a data set storing some or all of the data of 200+211+performance data 212, for one element in one page in one website. An array of this data set may be provided for multiple elements, pages or websites, in a system serving a multiplicity of websites.
The data of
According to some embodiments, in step 33 of
Content web pages usually have a structure similar to that illustrated in prior art
In order to find which content items are getting the most visibility and/or best performance, suitable methods for recognizing content elements may be employed e.g. as described herein. For example,
As described herein, browser 401 typically makes one request to the injected content management module 403 and gets the requested data in response. However the system can also work in parallel where the browser 401 requests the elements array from the elements module 404 and sends another request to the injected content module 406 in any sequence the browser 401 wants, e.g. as per
In another embodiment the browser 401 may make a request to the web server 402 in order to get the page content. In this case, the web server 402 may find the requested page and then may make a request to the injected content management module 403 to get the elements data and the injected content inventory data. Then the web server 402 may use the data to insert the injected content in the content based on the data obtained from the injected content management module 403. Then the web server 402 may return the page with the injected content inserted already to the browser 401, e.g. as per
A system and method to generate the visibility data 211 for all the content elements in a page is now described.
When a content element, like a text, image or a video, are detected as attractive in the screen 500, the system may detect (step 645) in which of the virtual segments most of the elements are located and may count time units, e.g. as per STEP 650 in
For example, the content element 504 is considered to be inside virtual segment 501 since most of its area is inside 501. The system may count the seconds that the element 504 stay in 501 and may multiply that by 1. Element 505, on the other hand, is inside virtual segment 502 and therefore the system may count the number of seconds it stays there and multiply this by 2, since the visibility factor in this example is 2. Element 506 is considered to be inside the virtual segment 503 and the time it spends there may be counted and may be multiplied by 1.
Typically, in Step 660, the system repeatedly, e.g. periodically, e.g. each, say, 2 seconds, grabs all content elements whose counters increased in step 650 (e.g. all content elements whose time counter>0), and applies the virtual segment's weight score, if any, to the time counter value. For example if content element 1 was in a virtual segment having a visibility score of 2 and there are 3 seconds in element 1's time counter, and content element 2 was in a virtual segment having a visibility score of 1 for 5 seconds, then the visibility data time for content element 1 is 6 (3*2) seconds and for content element 2—5 (5*1) seconds. This data is stored, for each content element, in visibility data field 211 of
Typically, the method of
Referring again to Step 630, this step optionally divides the screen into virtual segments e.g. as described herein with reference to
Referring again to step 640, this step checks each content element in the web page to determine whether or not it is visible in the viewport (option A). Typically, whether or not an element is visible to a user according to the current scroll is determined by comparing position of the content element in the page, screen resolution and current scroll position. Alternatively or in addition (in parallel e.g.), extent of interaction between user input device and content element may be recorded (option B) e.g. by registering “mouseenter” and “mouseleave” events for content elements.
Referring again to Step 650, typically, once a scroll event has occurred, for each content element which is found in step 640 to be visible, the system starts counting the number of milliseconds for which that content element is visible. For example, if the user has stopped scrolling and reads some text for 5 seconds, and then continues to scroll to another area in the page, the content elements that were visible each get a visible counter of 5 seconds. However, the system typically stops counting time for an element which exceeds a predetermined threshold such as, say, 10 seconds, so as to discount cases in which a user keeps the page open in a specific point and goes off to read another page or even leaves her or his computer. Similarly, if option B in step 640 is performed, then when a “mouseenter” event is triggered for a content element the system starts counting the time the mouse is over this element and stops when a “mouseleave” event is triggered or, optionally, when a predetermined threshold is reached.
In
Browser 401 typically allow programmers to register to user and system events, e.g. registration within the browser to click events that occur in each given webpage such that once the user clicks on anything in a particular webpage of interest, the browser 401 (
It is appreciated that the methods of
Before describing
1010: the system gets an HTML DOM element for which to generate a digital signature 200.
1020: for each of the HTML attributes that the elements has do steps 1021-1023
1021: compute the weight for the attribute. The weight could be taken from a fixed mapping table of attribute name and score or could be supplied per website. For example an attribute called “style” would have a weight of 0 since it only affects how the element is being rendered, and even could be removed later and replaced with a CSS class name without changing the way the elements looks and behave. Attributes which are related mainly to rendering (such as: “align”,“style”,“border”,“width”,“height”,“color”,and “cols”) may get 0 weight (be ignored). The more likely it is that an individual attribute is unique in the page (like: “id”,“src”,“href”) the higher weight that attribute may get. It is appreciated that according to certain embodiments, combinations of elements may be assigned a high weight because while they are not unique individually, they do tend to be unique in combination.
1022: If the weight was set to 0 ignore this attribute, else
1023: Add the attribute and the score to the data set 200.
1030: After all attributes have been processed, the element's content (e.g. text in a <p> element) may be hashed (e.g. using an MD5 algorithm or any suitable hashing algorithm) into a string or a number. According to certain embodiments, the element content comprises the text which is inside the element including the element's children. For example given the following DOM element: <p>hello <span>world</span>2</p> the content of element <p> would be hello world 2, since the content of the child element is also used.
1050: For all (or some) the child elements of this element do steps 1020 and insert the data to 200 in hierarchy order to reflect the same hierarchy in the HTML DOM e.g. as described herein with reference to
1060: generate a digital signature unique ID (207) by hashing all data generated until now using some suitable algorithm like MD5, into a unique string. To make this string unique per pages append e.g. concatenate the page URL to the hashed string.
In order to be able to track content elements, the following method may be employed to create a digital signature for every element in the page (e.g. as described herein with reference to digital signature generation step 620 in
When given an HTML document object model (DOM) element, for example a <p>, <div>, or <img> element, the system may extract attributes, e.g. as per
For example, if a digital signature is extracted for a text element <p>, if the page was changed and some images were removed from the page and that <p> element is now in a different position in the page, the digital signature may still allow the method to find the <p> element even if it is in a different location in the page.
Referring again to
The system may give each attribute a weight score e.g. as described in
For example, one attribute might be assigned a high weight score to emphasize that in case this attribute was not found, it means that the element was not found. For example, in case of an image element <img>, if the “src” attribute was changed, the system typically interprets that this is a different image.
Any or all attributes that the element may have, may be stored, such as but not limited to the attributes in
Not all elements necessarily include content, such as image element <img src=“myimgae.jpg”/>, but usually text elements have content like so: <p>hello world</p>, where the content is “hello world”. For example, item 205's weight score may be low since content can easily change slightly over time (e.g. fixing typos or adding sentences) but this need not be interpreted as meaning that the entire element is no longer existent. Since content could be long, and for ease of comparison, the content is typically extracted and hashed into a number which is unique in the sense that it can be assumed to be at a very high level of confidence that only this content yields this ID whereas any other content yields a different ID. Any suitable e.g. known hashing algorithm may be employed such as md5 or blake hashes, merkle-damgåard (md)-based hashes other than md5, sha hashes, swifft hash and any other known suitable hash function. However, alternatively, text content of 205 may be provided as-is, without any hashing mechanism. The term “text content” is intended to include the text inside a DOM element including its children. Examples of text content:
a. <DIV>CONTENT</DIV>; here the text content is “content”.
b. <DIV>CONTENT <IMG SRC=“MYIMAGE.JPG”/><P>SOME TEXT</P></DIV>; here the text content of the <div> is “content some text” since only the text inside the <div> and its children is relevant.
When the method is ignorant as to where the element is positioned in the page, DOM elements nested inside the element, termed herein child elements, may be employed e.g. as described herein with reference to Step 1050 of
More generally, when the digital signature method gets an element such as a DOM element, a check is typically made to determine whether or not this element has children (e.g. in the DOM tree structure used to represent the webpage of interest), since some elements (<img> elements e.g.) do not have children, such that the children attribute 206 might be empty. If the element does have children, an array digital signature 200 may be generated to represent all children elements of the current DOM (e.g.) element.
Example:
DOM attributes to get the parents and the children of each element. Eventually, the digital signature typically has the same tree structure that the DOM element has, from the perspective of children; digital signatures 200 are typically not created for parents of each given element, but rather for each element's children.
Typically then, the system may extract element data, in a recursive manner, e.g. as per STEP 1050 also for the element's children elements and may suitably store the recursively extracted children data e.g. in an array as described below, for example, with reference to
The weight score for this attribute may be an aggregate score, e.g. as per step 1050 in
Since the method may collect visibility data on elements from multiple users visiting the same page, perhaps using different rendering software and devices, the digital signature is typically distinguished such that the elements module 404 could recognize 2 or more data sets 200 referring to the same element in the page. Since the data 200 is collected regardless of how the element is rendered, it is safe for the method to assume that the same data may be generated for an element regardless of the user or the device it was rendered on. 207 is a unique ID generated (e.g. using a suitable hash function) according to certain embodiments, such that each digital signature has a unique ID which can be assumed not to be shared by any other digital signature. Server 404, then, is typically operative to aggregate all the data sets 211 and performance data 212 for the same element and store these data in only one data set 210 in the database. The unique ID may for example be generated by hashing all the data 201-206 into a unique string and, typically, appending or concatenating the URL of the webpage from which the element originated (e.g. as per Step 1060).
The reverse method to
The method of
The threshold may for example comprise a percentage, such as 75%, or any other suitable value such as 50%, 60%, 70%, 80%, 90%, 99% or any value intermediate these values, from the total score the digital signature could have. For example. if the digital signature is: [“id”,“myid”,2],[“class”,“myclass”,1][“name”,“myname”,1][“data”,“1234”,1], this means that the first is the attribute name, the second is the attribute value and the third is the weight of the attribute. Assume candidate elements as follows: <div id=“myid” class=“somclass” data=“1234”>. In this case the score of the candidate element may be 3 since the “id” is a match yielding 2 points, and the “data” match yielding an additional 1 point. so this candidate earned a score of 3 out of 5, corresponding to a 60% match rate, and therefore, if a 75% threshold is employed, the system may disqualify this candidate.
The threshold may or may not be fixed; the system may support per-site thresholds. for example, external e.g. human operator inputs may indicate that for a particular site, a current threshold is generating too many false positives (e.g. the wrong element is being identified as the searched-for element) and/or a current threshold is generating too many false negatives (e.g. the system failed to find an existing element in the webpage). In this case, the threshold for this specific site may be tweaked to reduce or eliminate such false results. The system may for example allow a default threshold to be overridden with a threshold specific to certain sites or categories of sites.
The method of
910—the method gets the array data of 210, e.g. as per
920—the array is ordered by visibility data 211 such that the first element in the array is the one with the highest visibility in the page.
925—set a threshold score for this page; per-site or per-page or other differential scores may be retrieved from the server 403 or may use fixed number for all pages.
930—For each of the 210 data structure in the array of data sets of (say)
940—using the data set 200 the system may find one or more candidates DOM Elements in the page. The following steps 950, 960, 965 may be applied to every candidate:
950—compute match score for candidate based on each of the properties in 200. This may be done by first creating a digital signature for the candidate e.g. using the method of
960—if the match score is higher than the threshold set in step 925, continue to step 965, else (if lower) return to step 940 with the next data item in the array.
965—if current candidate got highest score so far, mark current candidate as top candidate.
970—at the end of e.g. after looping steps 950, 960 and 965 over all candidates, the top candidate marked in 965 is considered to be the sought-for DOM element. Then return to step 940 to find another sought-after DOM element with a new item in the array of data sets of
980—return output associating all content elements found in the page with their visibility measurements 211.
As shown, once steps 940-970 have been performed, the iteration to find one digital signature in the page is over and the method returns to step 940 and performs steps 940-970 again for the next digital signature to be found (for another content element on the webpage). It is appreciated that for STEP 940, any suitable operation may be employed such as but not limited to a DOM query mechanism like jquery or native API like document.querySelectorAll.
A particular advantage of the method of
The most useful attributes for this purpose are those, like id, which are unique in the webpage (<div id=“unique-id”> . . . </div>). For those content elements in which the ID attribute is lacking (e.g. has not been defined), the class attribute exists but it is not entirely unique hence a combination of class with content and/or children element characteristics is useful for this process.
The methods of
Types of attributes which characterize webpage elements e.g. DOM elements typically include:
1) visual attributes—attributes which affect the visual representation of the DOM elements in the page. for example “style”,“width”, and so on.
2) action attributes—attributes which affects some user interaction or browser interaction with this element. for example “href” in an <a> tag it define the action that may happen if the user clicks on the tag. “src” is another example; in an <img> tag it defines the action that the browser may take to fetch the image.
3) data attributes—attributes which do not affect anything in the page and are only used to define data to be associated with this element. for example “id” and “class” which are browser attribute or “myownattr” which is actually a made up attribute that the developer created.
Visual and action attributes typically comprise “hard coded” attributes as defined by the browser manufacturer (e.g. Google or Microsoft), due to the effect of visual and action attributes on the actual visual or actions in the page. In contrast, some data attributes are defined by the browser while the developer of the page can create whichever data attributes he/she wants.
Typically, visual attributes are ignored by the system. It is easy to know all of them since they are documented by the browser manufacture or the W3C standards. Action attributes gets a high score since changing them leads a totally different behavior in the page. If the <img> “src” attributes are changed, a new image is obtained. With respect to data attributes, all other data attributes have the same score with the exception to the “id” which gets a high score.
For example, visual attributes to be ignored, or assigned very low weight, may include some or all of:
[“align”, “style”, “border”, “dir”, “bgcolor”, “background”, “cellpadding”, “cell spacing”, “checked”, “disabled”, “clear”, “color”, “cols ”, “colspan”, “dir”, “face”, “noresize”, “noshade”, “nowrap”, “rev”, “rows”, “rowspan”, “scrolling”, “selected”, “size”, “span”, “tabindex”, “valign”, “width”, “height”, “frameborder”, “hspace”, “marginheight”, “marginwidth”, “maxlength”, “allowfullscreen”]
Attributes to which a high score may be assigned may include some or all of: [“id”, “href”, “src”]
Attributes to which a medium or “normal” score may be assigned may include some or all of: [“class”, “name”, or whatever attributes the developer has created]
Any suitable scoring scale may be employed. For example, scores may vary from 1 to 5, where 1 is the lowest score (e.g. for a class attribute) and 5 is the highest (e.g. for an ID attribute).
It is appreciated that the more attributes the developer creates, the more tolerant the system becomes to changes in the page, since if one attribute is absent or was changed, other attributes' presence may compensate and the element may still be found, e.g.
by the method of
1105: the method gets an array of data sets 210 for all the elements in a given page.
1107: find all elements e.g. as per method of
1110: sort all elements by visibility data 211 and/or
1111: sort elements by performance data 212.
1112: if method has reached the end of the array, END. Else, take next data set 210 from the array and continue to step 1114
1114: check if “ok ” to insert an injected content close to element corresponding to current data set 210. For example, if an injected content was already inserted to an element which is close to this element, it might look bad or even break the page if another injected content is inserted there as well. If the element is not valid for injected content insertion, return to 1112 and continue with next element in the array.
1116: Based on the injected content inventory (
1118: find possible insertion method to insert the injected content close to the element. Injected content insertion types from which the system can choose from, for example, include 1) Inserting injected content before an individual element. This may cause the individual element and all elements thereafter to shift down by height of injected content inserted. 2) Inserting injected content below current element. This may cause all elements after current element to shift down according to height of content inserted. 3) Inserting content which is floating to the element. Typically possible only in text elements where content could be inserted before element and using suitable style rules (like css styling “floating:left” or “floating:right”) the injected content may be inserted according to style direction and text may wrap it. 4) Inserting content on top of element e.g. as a layer on top of the element without changing the layout of the elements at all. For example, in case of images or video elements, content could be suitably layered on top of the image.
1120: After content has been inserted into the page, check if can continue to insert injected content into the page. Stop if suitable criterion has been reached, e.g. max number of injected content items for this page, or if all elements in the array of data sets of
It is appreciated that many variations on the method of
As described above,
In another embodiment, e.g. as described herein with reference to step 650, the system may also compute the amount of time the mouse has been over the element in the visibility data. Once the mouse is over an element, it is assumed that the user is giving this element attention and this element is visible and therefore this may be taken into consideration in the visibility data for this element with a higher priority.
Alternatively or in addition, the system may use performance data to determine the location of injected content e.g. as per step 1111 in
The data in 210 is sent to a typically remote server 403, also termed herein “injected content management module 403” (
Using this ranking system, the method may try to insert injected content as close as possible to the most ranked content elements in the page, e.g. as per the method of
In another embodiment the system may also take into consideration the performance data 212 in order to rank the elements in the content page based on the visibility and performance data of each element. This may give a combination of two factors, the element visibility and the performance injected content get when they are placed close to this element.
In still another embodiment, the system may only use the performance data 212 to determine the rank of the content elements in the page. In this case the system may start by placing injected content close to elements by some other mechanism, such as random selection or by the order of elements appearing in the page, and start measuring the performance elements based on the engagement of the injected content close to these elements.
An example of a suitable child attribute data structure and associated aggregate score computations is now described with reference to
Once the digital signature has been generated for content element 1310 the structure of the data set of digital signature 200 typically appears as in
Each of boxes 1350, 1361, 1362, 1363, 1370 are examples of digital signature data sets 200 (for the corresponding DOM elements in
The aggregated score of all the attributes (excepting children) for content element 1310 itself is 10 as shown at box 1350. The aggregated score for all the child elements of content element 1310 is 50, also as shown in box 1350. Therefore, the total score of the digital signature 200 for content element 1310 is 60.
According to certain embodiments, the Digital Signature 200 of
a. URL—to know to which page a given digital signature belongs to. Typically, when the server 404, also termed herein “elements module 404”, asks database 405 for all the elements data 210, the page URL is provided and used for comparison to establish which data element belongs to which page. b. Text Patterns—A particular advantage of providing this attribute, according to certain embodiments, is to enhance the digital signature 200's tolerance to changes in the webpage.
A new “text patterning” method, described hereinbelow, may be employed to find a match between two texts and to provide a heuristic percentage match between them. Text patterning typically includes taking the text content for a given DOM element but rather than hashing as for attribute 205, small text samples are extracted from the text and used in a reverse method (e.g. as per
For example, as shown in
1410: get a text input, termed herein “$text”, to generate data structure for text patterns. Notation: $text[i] references the i-th index in the text. For example if $text=“abc” then $text[1]=“a” and $text[3]=“c”.
1412: compute the length of the given text and store as variable $len.
1414: compute the number of text samples to be extracted and stores as a variable, $sample_count. To compute $sample_count divide $len by 10 ($len/10) but if the result exceeds 10, $sample_count=10 (or some other predetermined maximum number of samples the method allows).
1416: compute the length of the each sample and store in a variable, $sample_len. For example, if $len is between 0 and 99 set $sample_len to be 3. If $len is between 100 and 999 set the $sample_len to be 4, otherwise set $sample_len to be 5.
1418: compute distance between each pair of samples and store as a variable, $distance, e.g. using the following formula: ($len−($sample_len*$sample_count))/$sample_count. For example given $len=100 and $sample_count=10 and $sample_len=4, the distance between each sample may be defined as: $distance=(100−(4*10))/10=6. The result may be rounded down to the nearest integer, e.g. if the result includes a floating point.
1420: create an empty sample array, $samples_array, to be used to contain all samples extracted in step 1424 as described below.
1422: extract the samples from the given text by running through the text from index 1. Initially, set an index variable $index to 1. Start iterating all the text characters when the $index=1. The following steps 1424 and/or 1426 are iterated while $index<$len:
1424: Extract a new sample from the text e.g. as follows: sample=$text[$index]+$text[$index+1]+ . . . +$text[$index+$sample_len]. Typically, the sample starts from the current index ($index) and has a length equal to the sample length computed in step 1416 ($sample_len). For example if $text=“abcdefg” and $index=3 and $sample_len=3 then the new sample may be “cde”. The new sample may be inserted into $samples_array.
1426: compute new index e.g. as follows:
$index=$index+$sample_len+$distance. If the new $index is smaller than $len return to step 1422.
1428: return the sample array ($samples_array) which contains all the samples extracted for the given text and END.
The result of the text pattern extraction method of
When candidates are compared with the digital signature (e.g. as per step 950 in
The method of
1510: get text patterns 209 of a digital signature 200 and a current candidate
DOM element to be compared to.
1512: extract text pattern for current candidate DOM element e.g. as per method of
1514: check if the number of samples in the array (as defined in 1420) is the same for both texts. If not, the same return 0% match and stop. This saves computation time under the assumption that if the number of samples differs between the two compared texts, the texts are different enough to justify a 0% match.
1516: count the number of matches found and save as a variable, $match_count. initially $match_count=0.
1518: iterate on all the samples in the array until end of array is reached, performing step 1520 for each sample in the array.
1520: compare current sample from each text pattern 209. If text is identical, increment match count ($match_count=$match_count+1). For example if sample 1 is “abc” and sample 2 is “abd” the samples are not identical and the match count is not increased.
1522: After iterating and comparing all samples in the array, compute the match score by dividing match count by total samples count in the array. For example if sample count=10 and there were 7 matches, return 70% match.
A particular advantage of using hash content 205 is that if the text content of the DOM element has not changed it is quicker to match the unchanged text content to the candidate hashed text content and if there is a match, it is superfluous to check for the match of the text patterns 209. Instead, the method assumes there is a full match of texts, thereby to conserve considerable processing time in the process of checking candidates against a given digital signature.
The system shown and described herein is particularly useful for processing content pages. Home pages are frequently updated with new content. In contrast, once a content page has been published on the Internet to the public domain, its content changes relatively rarely, such that for a given URL, article (or other) content is often constant, although the way that content is rendered differs from one device to another.
The system may operate as a 3rd party service in conjunction with a wide variety of legacy web/content servers, or may be integrated into web/content servers.
It is appreciated that many modifications of the example embodiment shown herein are possible. For example, regarding the example data table set of
Another example, among many, is that the system could also work with any digital signature or any method to identify elements uniquely in a web page that facilitates both creating an identification for a content element, and, to the extent possible, allowing the element to be found in a version of the webpage, responsive to the content element's identification (signature) being presented. For example the system could work with formats which are not identical to DOM but have relevant features in common. Also, the system could also work with the W3C (World Wide Web Consortium) standard—the XPath (XML Path Language). This is a way to identify elements inside an XML document, and since HTML are a subset of XML it is valid to use xpath to identify elements in a page. The shortcoming of using this method is intolerance to page changes and updates due to reliance on the location of the element in the DOM structure. As a result, any change to the DOM structure, such as rendering the same page on a different device (e.g. mobile device instead of personal computer or vice versa) or adding/removing an image or a text to the page, breaks the xpath and makes it false. In contrast, the signature technology described herein is more robust and allows the signature to be tolerant of dynamics affecting the webpage.
It is appreciated that terminology such as “mandatory”, “required”, “need” and “must” refer to implementation choices made within the context of a particular implementation or application described herewithin for clarity and are not intended to be limiting since in an alternative implantation, the same elements might be defined as not mandatory and not required or might even be eliminated altogether.
It is appreciated that software components of the present invention including programs and data may, if desired, be implemented in ROM (read only memory) form including CD-ROMs, EPROMs and EEPROMs, or may be stored in any other suitable typically non-transitory computer-readable medium such as but not limited to disks of various kinds, cards of various kinds and RAMs. Components described herein as software may, alternatively, be implemented wholly or partly in hardware and/or firmware, if desired, using conventional techniques, and vice-versa. Each module or component may be centralized in a single location or distributed over several locations.
Included in the scope of the present invention, inter alia, are electromagnetic signals carrying computer-readable instructions for performing any or all of the steps or operations of any of the methods shown and described herein, in any suitable order including simultaneous performance of suitable groups of steps as appropriate; machine-readable instructions for performing any or all of the steps of any of the methods shown and described herein, in any suitable order; program storage devices readable by machine, tangibly embodying a program of instructions executable by the machine to perform any or all of the steps of any of the methods shown and described herein, in any suitable order; a computer program product comprising a computer useable medium having computer readable program code, such as executable code, having embodied therein, and/or including computer readable program code for performing, any or all of the steps of any of the methods shown and described herein, in any suitable order; any technical effects brought about by any or all of the steps of any of the methods shown and described herein, when performed in any suitable order; any suitable apparatus or device or combination of such, programmed to perform, alone or in combination, any or all of the steps of any of the methods shown and described herein, in any suitable order; electronic devices each including at least one processor and/or cooperating input device and/or output device and operative to perform e.g. in software any steps shown and described herein; information storage devices or physical records, such as disks or hard drives, causing at least one computer or other device to be configured so as to carry out any or all of the steps of any of the methods shown and described herein, in any suitable order; at least one program pre-stored e.g. in memory or on an information network such as the Internet, before or after being downloaded, which embodies any or all of the steps of any of the methods shown and described herein, in any suitable order, and the method of uploading or downloading such, and a system including server/s and/or client/s for using such; at least one processor configured to perform any combination of the described steps or to execute any combination of the described modules; and hardware which performs any or all of the steps of any of the methods shown and described herein, in any suitable order, either alone or in conjunction with software. Any computer-readable or machine-readable media described herein is intended to include non-transitory computer- or machine-readable media.
Any computations or other forms of analysis described herein may be performed by a suitable computerized method. Any step or functionality described herein may be wholly or partially computer-implemented e.g. by one or more processors. The invention shown and described herein may include (a) using a computerized method to identify a solution to any of the problems or for any of the objectives described herein, the solution optionally include at least one of a decision, an action, a product, a service or any other information described herein that impacts, in a positive manner, a problem or objectives described herein; and (b) outputting the solution.
The system may if desired be implemented as a web-based system employing software, computers, routers and telecommunications equipment as appropriate.
Any suitable deployment may be employed to provide functionalities e.g. software functionalities shown and described herein. For example, a server may store certain applications, for download to clients, which are executed at the client side, the server side serving only as a storehouse. Some or all functionalities e.g. software functionalities shown and described herein may be deployed in a cloud environment. Clients e.g. mobile communication devices such as smartphones may be operatively associated with, but external to, the cloud.
The scope of the present invention is not limited to structures and functions specifically described herein and is also intended to include devices which have the capacity to yield a structure, or perform a function, described herein, such that even though users of the device may not use the capacity, they are if they so desire able to modify the device to obtain the structure or function.
Features of the present invention, including method steps, which are described in the context of separate embodiments may also be provided in combination in a single embodiment. For example, a system embodiment is intended to include a corresponding process embodiment. Also, each system embodiment is intended to include a server-centered “view” or client centered “view”, or “view” from any other node of the system, of the entire functionality of the system, computer-readable medium, apparatus, including only those functionalities performed at that server or client or node. Features may also be combined with features known in the art and particularly although not limited to those described in the Background section or in publications mentioned therein.
Conversely, features of the invention, including method steps, which are described for brevity in the context of a single embodiment or in a certain order may be provided separately or in any suitable subcombination, including with features known in the art (particularly although not limited to those described in the Background section or in publications mentioned therein) or in a different order. “e.g.” is used herein in the sense of a specific example which is not intended to be limiting. Each method may comprise some or all of the steps illustrated or described, suitably ordered e.g. as illustrated or described herein.
Devices, apparatus or systems shown coupled in any of the drawings may in fact be integrated into a single platform in certain embodiments or may be coupled via any appropriate wired or wireless coupling such as but not limited to optical fiber, Ethernet, Wireless LAN, HomePNA, power line communication, cell phone, PDA, Blackberry GPRS, Satellite including GPS, or other mobile delivery. It is appreciated that in the description and drawings shown and described herein, functionalities described or illustrated as systems and sub-units thereof can also be provided as methods and steps therewithin, and functionalities described or illustrated as methods and steps therewithin can also be provided as systems and sub-units thereof. The scale used to illustrate various elements in the drawings is merely exemplary and/or appropriate for clarity of presentation and is not intended to be limiting.
Priority is claimed from U.S. provisional application Nos. U.S. 61/948,046, entitled “HTML Elements Digital Signature” and U.S. 61/948,054, entitled “Determining Advertising Placement Based on Page Hot Spot”, both filed by Amir Hard on 5 Mar. 2014 and from U.S. 61/991,867 “Method and system for injecting content into existing computerized data”, filed by Amir Hard on 12 May 2014.
| Number | Date | Country | |
|---|---|---|---|
| 61948046 | Mar 2014 | US | |
| 61948054 | Mar 2014 | US | |
| 61991867 | May 2014 | US |
