Audience filtering system

Information

  • Patent Grant
  • 10885136
  • Patent Number
    10,885,136
  • Date Filed
    Wednesday, February 28, 2018
    6 years ago
  • Date Issued
    Tuesday, January 5, 2021
    3 years ago
Abstract
The present invention relates to improvements to systems and methods for filtering a data set. An audience filtering system is configured to perform operations that include accessing a database that comprises user profile data associated with a plurality of users, generating a bit-set based on the user profile data from the database, wherein the bit-set comprises an array of binary values, receiving a user input (e.g., via a GUI) that defines one or more filter criteria (e.g., a value of a user attribute), filtering the bit-set based on the one or more filter criteria, and identifying a subset of the plurality of users based on the filtered bit-set, according to certain example embodiments.
Description
TECHNICAL FIELD

Embodiments of the present disclosure relate generally to computing technology and, more particularly, but not by way of limitation, to systems for filtering datasets.


BACKGROUND

A bit-set, also known as a bit array, is an array data structure that compactly stores bits and can be used to implement a simple set data structure. A bit-set is a mapping from some domain (almost always a range of integers) to values in the set {0, 1}. The values can be interpreted as dark/light, absent/present, locked/unlocked, valid/invalid, etcetera. Thus, because there are only two possible values, so they can be stored in one bit. As with other arrays, the access to a single bit can be managed by applying an index to the array. Assuming its size (or length) to be n bits, the array can be used to specify a subset of the domain (e.g. {0, 1, 2, . . . , n−1}), where a 1-bit indicates the presence and a 0-bit the absence of a number in the set. This set data structure uses about n/w words of space, where w is the number of bits in each machine word.





BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the figure number in which that element is first introduced.



FIG. 1 is a block diagram showing an example messaging system for exchanging data (e.g., messages and associated content) over a network in accordance with some embodiments, wherein the messaging system includes an audience filtering system.



FIG. 2 is block diagram illustrating further details regarding a messaging system, according to example embodiments.



FIG. 3 is a block diagram illustrating various modules of an audience filtering system, according to certain example embodiments.



FIG. 4 is a flowchart illustrating a method for filtering data, according to certain example embodiments.



FIG. 5 is a flowchart illustrating a method for causing display of an indication of a quantity of a filtered data-set, according to certain example embodiments.



FIG. 6 is a flowchart illustrating a method for filtering data, according to certain example embodiments.



FIG. 7 is an illustration of a compressed bit-set, according to certain example embodiments.



FIG. 8 is an interface diagram of a graphical user interface to receive user inputs, according to certain example embodiments.



FIG. 9 is an illustration a presentation of a quantity, according to certain example embodiments.



FIG. 10 is a block diagram illustrating a representative software architecture, which may be used in conjunction with various hardware architectures herein described and used to implement various embodiments.



FIG. 11 is a block diagram illustrating components of a machine, according to some example embodiments, able to read instructions from a machine-readable medium (e.g., a machine-readable storage medium) and perform any one or more of the methodologies discussed herein.





DETAILED DESCRIPTION

Graphical user interfaces (GUI) in are often configured to display presentations of filter criteria, such that a user of the GUI may provide inputs selecting one or more filter criteria directly into the GUI, and which a search or filtering system may then use to filter a data set (e.g., retrieve a set of search results). As the purpose of a GUI is ultimately to provide as much useful information to a user as possible, some similarly configured GUI may also provide an indication of a quantity associated with the filtered data set. For example, by presenting the user with an indication of a number of data objects among the filtered data set, the user might choose to add additional criteria to further filter the data set, or alternatively to remove filter criteria to expand the filtered data set. A number of technical hurdles may however limit the overall effectiveness of such features.


While the presentation of additional useful information is undeniably valuable, practical considerations for the execution of such features must be considered. For example, as a data set grows exponentially in size, the ability for a computing system to quickly and effectively determine an accurate count of a filtered data set may impose a significant burden on processors of the system, resulting in noticeable lag in display time. Systems to increase the efficiency and accuracy by which such information may be calculated an displayed would therefore be advantageous to users of such systems.


Thus, the present invention relates to improvements to systems and methods for filtering a data set. An audience filtering system is configured to perform operations that include accessing a database that comprises user profile data associated with a plurality of users, generating a bit-set based on the user profile data from the database, wherein the bit-set comprises an array of binary values, receiving a user input (e.g., via a GUI) that defines one or more filter criteria (e.g., a value of a user attribute), filtering the bit-set based on the one or more filter criteria, and identifying a subset of the plurality of users based on the filtered bit-set, according to certain example embodiments.


In some embodiments, the user profile data associated with the plurality of users comprises one or more user attributes. Such user attributes may for example include (but are not limited to): user demographics data (e.g., age, gender); location data; user activity data; device data; and language preferences. The audience filtering system may generate and cause display of a GUI that includes a presentation of one or more user selectable filtering criteria based on the user attributes from the database.


The audience filtering system generates one or more bit-sets based on the user attribute data. As discussed above, a bit-set, also known as a bit array, is an array data structure that compactly stores the user attribute data as a series of binary values, wherein each bit corresponds to a user attribute value among from the user attribute data. For example, the audience filtering system may generate the bit-set in response to receiving the user attribute data from each of the plurality of users, and may store the one or more bit-sets at a memory location within a database.


A user of the audience filtering system provides a user input that defines a set of attribute values of a set of user attributes. In some embodiments, the user may additionally provide Boolean operators to assign to the set of attribute values defined by the user input. In response to receiving the user input defining the one or more user attribute values, the audience filtering system retrieves one or more bit-sets associated with the set of user attributes, and filters the one or more bit-sets based on the set of attribute values. In instances where Boolean operators are also included, the audience filtering system may combine attribute values to filter the bit-sets based on the Boolean operators (e.g., and, or, etc.).


The audience filtering system identifies a subset of the plurality of users based on the filtered bit-sets. In some embodiments, the audience filtering system calculates a quantity of users among the subset of the plurality of users, and displays the quantity within the GUI in real-time. In this way, a user may provide a user input that defines a user attribute value, and the audience filtering system may calculate and update the quantity in real-time, thereby providing the user with an accurate indication of the quantity, more or less instantaneously. In some embodiments, the indication of the quantity may be displayed as a gauge, such as a linear gauge, or simply as a presentation of a numerical value.


In further embodiments, the audience filtering system receives a threshold value definition, wherein the threshold value definition defines a maximum or minimum quantity value. In such embodiments, in response to calculating the quantity of the subset of the plurality of users, the audience filtering system compares the quantity to the threshold value. In response to determining that the quantity transgresses the threshold value, the audience filtering system may generate and cause display of a notification alongside the presentation of the quantity within the GUI. For example, the notification may include a request to add or remove filter criteria.


Consider an illustrative example from a user perspective. The audience filtering system generates and causes display of a GUI at a client device, wherein the GUI comprises a presentation of a set of user selectable attribute values. For example, the GUI may include a display of a set of menus corresponding to each user attribute, wherein each menu comprises a display of the possible attribute values for any given attribute. A user of the audience filtering system selects attribute values via the GUI. In response to receiving the selections from the user, the audience filtering system filters a data set based on the attribute values selected, and causes display of an indication of a quantity of data objects within the filtered data set. Thus, the user is presented with an accurate count of data objects within the filtered data set, in real-time.



FIG. 1 is a block diagram showing an example messaging system 100 for exchanging data (e.g., messages and associated content) over a network. The messaging system 100 includes multiple client devices 102, each of which hosts a number of applications including a messaging client application 104. Each messaging client application 104 is communicatively coupled to other instances of the messaging client application 104 and a messaging server system 108 via a network 106 (e.g., the Internet).


Accordingly, each messaging client application 104 is able to communicate and exchange data with another messaging client application 104 and with the messaging server system 108 via the network 106. The data exchanged between messaging client applications 104, and between a messaging client application 104 and the messaging server system 108, includes functions (e.g., commands to invoke functions) as well as payload data (e.g., text, audio, video or other multimedia data).


The messaging server system 108 provides server-side functionality via the network 106 to a particular messaging client application 104. While certain functions of the messaging system 100 are described herein as being performed by either a messaging client application 104 or by the messaging server system 108, it will be appreciated that the location of certain functionality either within the messaging client application 104 or the messaging server system 108 is a design choice. For example, it may be technically preferable to initially deploy certain technology and functionality within the messaging server system 108, but to later migrate this technology and functionality to the messaging client application 104 where a client device 102 has a sufficient processing capacity.


The messaging server system 108 supports various services and operations that are provided to the messaging client application 104. Such operations include transmitting data to, receiving data from, and processing data generated by the messaging client application 104. In some embodiments, this data includes, message content, client device information, geolocation information, media annotation and overlays, message content persistence conditions, social network information, and live event information, as examples. In other embodiments, other data is used. Data exchanges within the messaging system 100 are invoked and controlled through functions available via GUIs of the messaging client application 104.


Turning now specifically to the messaging server system 108, an Application Program Interface (API) server 110 is coupled to, and provides a programmatic interface to, an application server 112. The application server 112 is communicatively coupled to a database server 118, which facilitates access to a database 120 in which is stored data associated with messages processed by the application server 112.


Dealing specifically with the Application Program Interface (API) server 110, this server receives and transmits message data (e.g., commands and message payloads) between the client device 102 and the application server 112. Specifically, the Application Program Interface (API) server 110 provides a set of interfaces (e.g., routines and protocols) that can be called or queried by the messaging client application 104 in order to invoke functionality of the application server 112. The Application Program Interface (API) server 110 exposes various functions supported by the application server 112, including account registration, login functionality, the sending of messages, via the application server 112, from a particular messaging client application 104 to another messaging client application 104, the sending of media files (e.g., images or video) from a messaging client application 104 to the messaging server application 114, and for possible access by another messaging client application 104, the setting of a collection of media data (e.g., story), the retrieval of a list of friends of a user of a client device 102, the retrieval of such collections, the retrieval of messages and content, the adding and deletion of friends to a social graph, the location of friends within a social graph, opening and application event (e.g., relating to the messaging client application 104).


The application server 112 hosts a number of applications and subsystems, including a messaging server application 114, an image processing system 116, a social network system 122, and an audience filtering system 124. The messaging server application 114 implements a number of message processing technologies and functions, particularly related to the aggregation and other processing of content (e.g., textual and multimedia content) included in messages received from multiple instances of the messaging client application 104. As will be described in further detail, the text and media content from multiple sources may be aggregated into collections of content (e.g., called stories or galleries). These collections are then made available, by the messaging server application 114, to the messaging client application 104. Other processor and memory intensive processing of data may also be performed server-side by the messaging server application 114, in view of the hardware requirements for such processing.


The application server 112 also includes an image processing system 116 that is dedicated to performing various image processing operations, typically with respect to images or video received within the payload of a message at the messaging server application 114.


The social network system 122 supports various social networking functions services, and makes these functions and services available to the messaging server application 114. To this end, the social network system 122 maintains and accesses an entity graph 304 within the database 120. Examples of functions and services supported by the social network system 122 include the identification of other users of the messaging system 100 with which a particular user has relationships or is “following,” and also the identification of other entities and interests of a particular user.


The application server 112 is communicatively coupled to a database server 118, which facilitates access to a database 120 in which is stored data associated with messages processed by the messaging server application 114.



FIG. 2 is block diagram illustrating further details regarding the messaging system 100, according to example embodiments. Specifically, the messaging system 100 is shown to comprise the messaging client application 104 and the application server 112, which in turn embody a number of some subsystems, namely an ephemeral timer system 202, a collection management system 204 and an annotation system 206.


The ephemeral timer system 202 is responsible for enforcing the temporary access to content permitted by the messaging client application 104 and the messaging server application 114. To this end, the ephemeral timer system 202 incorporates a number of timers that, based on duration and display parameters associated with a message, collection of messages (e.g., a SNAPCHAT story), or graphical element, selectively display and enable access to messages and associated content via the messaging client application 104. Further details regarding the operation of the ephemeral timer system 202 are provided below.


The collection management system 204 is responsible for managing collections of media (e.g., collections of text, image video and audio data). In some examples, a collection of content (e.g., messages, including images, video, text and audio) may be organized into an “event gallery” or an “event story.” Such a collection may be made available for a specified time period, such as the duration of an event to which the content relates. For example, content relating to a music concert may be made available as a “story” for the duration of that music concert. The collection management system 204 may also be responsible for publishing an icon that provides notification of the existence of a particular collection to the user interface of the messaging client application 104.


The collection management system 204 furthermore includes a curation interface 208 that allows a collection manager to manage and curate a particular collection of content. For example, the curation interface 208 enables an event organizer to curate a collection of content relating to a specific event (e.g., delete inappropriate content or redundant messages). Additionally, the collection management system 204 employs machine vision (or image recognition technology) and content rules to automatically curate a content collection. In certain embodiments, compensation may be paid to a user for inclusion of user generated content into a collection. In such cases, the curation interface 208 operates to automatically make payments to such users for the use of their content.


The annotation system 206 provides various functions that enable a user to annotate or otherwise modify or edit media content associated with a message. For example, the annotation system 206 provides functions related to the generation and publishing of media overlays for messages processed by the messaging system 100. The annotation system 206 operatively supplies a media overlay (e.g., a SNAPCHAT filter) to the messaging client application 104 based on a geolocation of the client device 102. In another example, the annotation system 206 operatively supplies a media overlay to the messaging client application 104 based on other information, such as, social network information of the user of the client device 102. A media overlay may include audio and visual content and visual effects. Examples of audio and visual content include pictures, texts, logos, animations, and sound effects, as well as animated facial models, such as those generated by the audience filtering system 124. An example of a visual effect includes color overlaying. The audio and visual content or the visual effects can be applied to a media content item (e.g., a photo) at the client device 102. For example, the media overlay including text that can be overlaid on top of a photograph generated taken by the client device 102. In another example, the media overlay includes an identification of a location overlay (e.g., Venice beach), a name of a live event, or a name of a merchant overlay (e.g., Beach Coffee House). In another example, the annotation system 206 uses the geolocation of the client device 102 to identify a media overlay that includes the name of a merchant at the geolocation of the client device 102. The media overlay may include other indicia associated with the merchant. The media overlays may be stored in the database 120 and accessed through the database server 118.


In one example embodiment, the annotation system 206 provides a user-based publication platform that enables users to select a geolocation on a map, and upload content associated with the selected geolocation. The user may also specify circumstances under which a particular media overlay should be offered to other users. The annotation system 206 generates a media overlay that includes the uploaded content and associates the uploaded content with the selected geolocation.


In another example embodiment, the annotation system 206 provides a merchant-based publication platform that enables merchants to select a particular media overlay associated with a geolocation via a bidding process. For example, the annotation system 206 associates the media overlay of a highest bidding merchant with a corresponding geolocation for a predefined amount of time



FIG. 3 is a block diagram illustrating components of the audience filtering system 124 that configure the audience filtering system 124 to generate a bit-set based on user attribute data, receive a user input defining one or more attribute values, filter the bit-set based on the one or more attribute values, identify a subset of a plurality of users based on the filtered bit-set, and cause display of a count of a quantity of the subset of the plurality of users in real-time, according to certain example embodiments. The audience filtering system 124 is shown as including a bit-set module 302, a communication module 304, a filtering module 306, and presentation module 308, all configured to communicate with each other (e.g., via a bus, shared memory, or a switch). Any one or more of these modules may be implemented using one or more processors 310 (e.g., by configuring such one or more processors to perform functions described for that module) and hence include one or more of the processors 310.


Any one or more of the modules described may be implemented using hardware alone (e.g., one or more of the processors 310 of a machine) or a combination of hardware and software. For example, any module described of the audience filtering system 124 may physically include an arrangement of one or more of the processors 310 (e.g., a subset of or among the one or more processors of the machine) configured to perform the operations described herein for that module. As another example, any module of the audience filtering system 124 may include software, hardware, or both, that configure an arrangement of one or more processors 310 (e.g., among the one or more processors of the machine) to perform the operations described herein for that module. Accordingly, different modules of the audience filtering system 124 may include and configure different arrangements of such processors 310 or a single arrangement of such processors 310 at different points in time. Moreover, any two or more modules of the audience filtering system 124 may be combined into a single module, and the functions described herein for a single module may be subdivided among multiple modules. Furthermore, according to various example embodiments, modules described herein as being implemented within a single machine, database, or device may be distributed across multiple machines, databases, or devices.



FIG. 4 is a flowchart illustrating a method 400 for filtering data, according to certain example embodiments. Operations of the method 400 may be performed by the modules described above with respect to FIG. 3. As shown in FIG. 4, the method 400 includes one or more operations 402, 404, 406, 408, and 410.


At operation 402, the bit-set module 302 accesses a database (e.g., the database 12) that comprises user profile data of a plurality of users. The user profile data associated with the plurality of users comprises one or more user attributes. Such user attributes may for example include (but are not limited to): user demographics data (e.g., age, gender); location data; user activity data; device data; and language preferences. At operation 404, the bit-set module 302 generates a bit-set based on the user attributes of the user profile data.


At operation 406, the communication module 304 receives a user input that defines one or more user attribute values of the user attributes from the database. For example, the audience filtering system 124 may generate and cause display of a GUI at a client device (e.g., client device 102), wherein the GUI includes a presentation of one or more user selectable filtering criteria based on the user attributes from the database 120. A user may provide a user input that includes selections of one or more user attribute values via the GUI.


In some embodiments, the user input that defines the user attribute values may also include one or more Boolean operators (e.g., AND, OR, NOT, AND NOT). The Boolean operators are used to connect the attribute values and define filter criteria to filter the bit-sets. For example, by selecting an “AND,” the filtering module 306 filters data objects that include both of the attribute values. Similarly, by selecting “OR,” the filtering module 306 filters data objects that have one or the other (or both) of the attribute values).


At operation 408, the filtering module 306 filters the bit-set (of the corresponding user attribute values defined by the user input), based on the user attribute values, and at operation 410 identifies a subset of the plurality of users based on the filtered bit-set.



FIG. 5 is a flowchart illustrating a method 500 for causing display of an indication of a quantity of a filtered data-set, according to certain example embodiments. Operations of the method 500 may be performed by the modules described above with respect to FIG. 3. As shown in FIG. 5, the method 500 includes one or more operations 502, 504, and 506 that may be performed as a part of (e.g., a subroutine of) one or more of the operations of the method 400, as seen in FIG. 4.


At operation 502, the filtering module 306 determines a quantity of users among the subset of the plurality of users identified based on the filtered bit-set. The quantity of users comprises a numerical value that indicates how many users (or data objects) are remaining within the filtered bit-set based on the filter criteria selected by the user.


At operation 504, the presentation module 308 determines that the quantity (the numerical value) of the subset of the plurality of users transgresses a predefined threshold value. For example, an administrator of the audience filtering system 124 may define one or more threshold values. The threshold values may define maximum or minimum values.


At operation 506, the presentation module 308 causes display of a presentation of the quantity at the client device 102. In some embodiments, the presentation may be based on whether or not the quantity transgresses the predefined threshold value, or which threshold value the quantity transgressed. For example, the threshold value may include a maximum value or a minimum value. In such embodiments, in response to determining that the quantity exceeds the threshold value, the presentation module 308 generates and causes display of the presentation of quantity of the quantity at the client device 102, wherein the presentation includes a notification based on the quantity transgressing the maximum value. For example, the notification may indicate that the user must add more filter criteria.



FIG. 6 is a flowchart illustrating a method 600 for filtering data, according to certain example embodiments. Operations of the method 600 may be performed by the modules described above with respect to FIG. 3. As shown in FIG. 6, the method 600 includes one or more operations 602, 604, 606, and 608 that may be performed as a part of (e.g., a subroutine of) one or more of the operations of the method 400, as seen in FIG. 4.


At operation 602, the presentation module 308 causes display of a GUI that includes a presentation of a map image at the client device 102. In some embodiments, the presentation module 308 determines that the user attributes within the database 120 include location data that identify locations of users. In response to determining that the user attributes include location data, the presentation module 308 generates and causes display of a map image within the GUI at the client device 102.


At operation 604, the communication module 304 receives an identification of a geographic region. In some embodiments, the user input received at operation 406 of the method 400 may include an identification of the geographic region. For example, the user input may define a point (e.g., geographic coordinates, an address, a selection of a point within the map image), and a radius. In further embodiments, the user input may comprise a selection of the geographic region from within the map image, for example by drawing a shape (e.g., a circle) over the map image.


At operation 606, the filtering module 306 segments the geographic region into a set of geo-cells, wherein each geo-cell has a corresponding location identifier. For example, the filtering module 306 may determine a size of each geo-cell based on an overall size of the geographic region selected by the user input. In further embodiments, the geo-cells may each be of a predefined size and shape, and by selecting the geographic region the filtering module 306 simply selects any geo-cell located at least partially within a boundary of the geographic region. At operation 608, the filtering module 306 filters the bit-set based on the location identifiers of the geo-cells.



FIG. 7 is an illustration of a compressed bit-set 700, according to certain example embodiments. As seen in FIG. 7, each bit-set may correspond to a distinct attribute value of each user attribute from the user profile data within the database 120. Each bit-set therefore comprises a series of binary values, wherein each binary value indicates whether or not a particular user has the associated attribute value, and wherein a position of a binary value along the sequence identifies a particular user.


For example, as seen in FIG. 7 “User A” is depicted as having attribute values that include: female; aged 35+; and has an Apple device, whereas “User B” is depicted as having attribute values that include: male; aged between 13-17. A population of users may thereby be represented by a set of bit-sets.


In some embodiments, as discussed in operation 406 of the method 400, a user may provide a user input that defines one or more attribute values as well as one or more Boolean operators. The attribute values may thereby be combined to determine filter criteria for the bit-set based on the Boolean operators.


In some embodiments, the bit-set module 302 generates a data table based on the user profile data from the database 120. For example, as seen in FIG. 7, the bit-set module 302 may generate bit-sets for each user attribute value from among the user profile data, and store the bit-sets in a data table, wherein each row of the data table corresponds to a particular user attribute value, and each column of the data table corresponds to a user identifier.



FIG. 8 is an interface diagram of a graphical user interface 800 to receive user inputs, according to certain example embodiments. As seen in FIG. 8, the GUI 800 comprises a presentation of a set of user selectable user attribute values 802. A user of the audience filtering system 124 may provide a user input into the GUI (as discussed in operation 406 of the method 400), wherein the user input comprises a selection of one or more attribute values.


As seen in FIG. 8, the GUI 800 may also include a display 804 of a quantity of data objects within a filtered bit-set. As discussed in the method 500 of FIG. 5, the display 804 of the quantity is updated in real-time according to attribute values defined based on the user inputs.



FIG. 9 is an illustration a display 902 and 904 of the quantity of data objects within a filtered bit-set, according to certain example embodiments. As explained in the method 500 of FIG. 5, the displays of the quantity (902 and 904) may be updated to include a notification 906 and 908, wherein the notification is based on detecting a transgression of the quantity with a predefined threshold value.


Software Architecture



FIG. 10 is a block diagram illustrating an example software architecture 1006, which may be used in conjunction with various hardware architectures herein described. FIG. 10 is a non-limiting example of a software architecture and it will be appreciated that many other architectures may be implemented to facilitate the functionality described herein. The software architecture 1006 may execute on hardware such as machine 1100 of FIG. 11 that includes, among other things, processors 1104, memory 1114, and I/O components 1118. A representative hardware layer 1052 is illustrated and can represent, for example, the machine 1000 of FIG. 10. The representative hardware layer 1052 includes a processing unit 1054 having associated executable instructions 1004. Executable instructions 1004 represent the executable instructions of the software architecture 1006, including implementation of the methods, components and so forth described herein. The hardware layer 1052 also includes memory and/or storage modules memory/storage 1056, which also have executable instructions 1004. The hardware layer 1052 may also comprise other hardware 1058.


In the example architecture of FIG. 10, the software architecture 1006 may be conceptualized as a stack of layers where each layer provides particular functionality. For example, the software architecture 1006 may include layers such as an operating system 1002, libraries 1020, applications 1016 and a presentation layer 1014. Operationally, the applications 1016 and/or other components within the layers may invoke application programming interface (API) API calls 1008 through the software stack and receive a response as in response to the API calls 1008. The layers illustrated are representative in nature and not all software architectures have all layers. For example, some mobile or special purpose operating systems may not provide a frameworks/middleware 1018, while others may provide such a layer. Other software architectures may include additional or different layers.


The operating system 1002 may manage hardware resources and provide common services. The operating system 1002 may include, for example, a kernel 1022, services 1024 and drivers 1026. The kernel 1022 may act as an abstraction layer between the hardware and the other software layers. For example, the kernel 1022 may be responsible for memory management, processor management (e.g., scheduling), component management, networking, security settings, and so on. The services 1024 may provide other common services for the other software layers. The drivers 1026 are responsible for controlling or interfacing with the underlying hardware. For instance, the drivers 1026 include display drivers, camera drivers, Bluetooth® drivers, flash memory drivers, serial communication drivers (e.g., Universal Serial Bus (USB) drivers), Wi-Fi® drivers, audio drivers, power management drivers, and so forth depending on the hardware configuration.


The libraries 1020 provide a common infrastructure that is used by the applications 1016 and/or other components and/or layers. The libraries 1020 provide functionality that allows other software components to perform tasks in an easier fashion than to interface directly with the underlying operating system 1002 functionality (e.g., kernel 1022, services 1024 and/or drivers 1026). The libraries 1020 may include system libraries 1044 (e.g., C standard library) that may provide functions such as memory allocation functions, string manipulation functions, mathematical functions, and the like. In addition, the libraries 1020 may include API libraries 1046 such as media libraries (e.g., libraries to support presentation and manipulation of various media format such as MPREG4, H.264, MP3, AAC, AMR, JPG, PNG), graphics libraries (e.g., an OpenGL framework that may be used to render 2D and 3D in a graphic content on a display), database libraries (e.g., SQLite that may provide various relational database functions), web libraries (e.g., WebKit that may provide web browsing functionality), and the like. The libraries 1020 may also include a wide variety of other libraries 1048 to provide many other APIs to the applications 1016 and other software components/modules.


The frameworks/middleware 1018 (also sometimes referred to as middleware) provide a higher-level common infrastructure that may be used by the applications 1016 and/or other software components/modules. For example, the frameworks/middleware 1018 may provide various graphic user interface (GUI) functions, high-level resource management, high-level location services, and so forth. The frameworks/middleware 1018 may provide a broad spectrum of other APIs that may be utilized by the applications 1016 and/or other software components/modules, some of which may be specific to a particular operating system 1002 or platform.


The applications 1016 include built-in applications 1038 and/or third-party applications 1040. Examples of representative built-in applications 1038 may include, but are not limited to, a contacts application, a browser application, a book reader application, a location application, a media application, a messaging application, and/or a game application. Third-party applications 1040 may include an application developed using the ANDROID™ or IOS™ software development kit (SDK) by an entity other than the vendor of the particular platform, and may be mobile software running on a mobile operating system such as IOS™, ANDROID™, WINDOWS® Phone, or other mobile operating systems. The third-party applications 1040 may invoke the API calls 1008 provided by the mobile operating system (such as operating system 1002) to facilitate functionality described herein.


The applications 1016 may use built in operating system functions (e.g., kernel 1022, services 1024 and/or drivers 1026), libraries 1020, and frameworks/middleware 1018 to create user interfaces to interact with users of the system. Alternatively, or additionally, in some systems interactions with a user may occur through a presentation layer, such as presentation layer 1014. In these systems, the application/component “logic” can be separated from the aspects of the application/component that interact with a user.



FIG. 11 is a block diagram illustrating components of a machine 1100, according to some example embodiments, able to read instructions from a machine-readable medium (e.g., a machine-readable storage medium) and perform any one or more of the methodologies discussed herein. Specifically, FIG. 11 shows a diagrammatic representation of the machine 1100 in the example form of a computer system, within which instructions 1110 (e.g., software, a program, an application, an applet, an app, or other executable code) for causing the machine 1100 to perform any one or more of the methodologies discussed herein may be executed. As such, the instructions 1110 may be used to implement modules or components described herein. The instructions 1110 transform the general, non-programmed machine 1100 into a particular machine 1100 programmed to carry out the described and illustrated functions in the manner described. In alternative embodiments, the machine 1100 operates as a standalone device or may be coupled (e.g., networked) to other machines. In a networked deployment, the machine 1100 may operate in the capacity of a server machine or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine 1100 may comprise, but not be limited to, a server computer, a client computer, a personal computer (PC), a tablet computer, a laptop computer, a netbook, a set-top box (STB), a personal digital assistant (PDA), an entertainment media system, a cellular telephone, a smart phone, a mobile device, a wearable device (e.g., a smart watch), a smart home device (e.g., a smart appliance), other smart devices, a web appliance, a network router, a network switch, a network bridge, or any machine capable of executing the instructions 1110, sequentially or otherwise, that specify actions to be taken by machine 1100. Further, while only a single machine 1100 is illustrated, the term “machine” shall also be taken to include a collection of machines that individually or jointly execute the instructions 1110 to perform any one or more of the methodologies discussed herein.


The machine 1100 may include processors 1104, memory memory/storage 1106, and I/O components 1118, which may be configured to communicate with each other such as via a bus 1102. The memory/storage 1106 may include a memory 1114, such as a main memory, or other memory storage, and a storage unit 1116, both accessible to the processors 1104 such as via the bus 1102. The storage unit 1116 and memory 1114 store the instructions 1110 embodying any one or more of the methodologies or functions described herein. The instructions 1110 may also reside, completely or partially, within the memory 1114, within the storage unit 1116, within at least one of the processors 1104 (e.g., within the processor's cache memory), or any suitable combination thereof, during execution thereof by the machine 1100. Accordingly, the memory 1114, the storage unit 1116, and the memory of processors 1104 are examples of machine-readable media.


The I/O components 1118 may include a wide variety of components to receive input, provide output, produce output, transmit information, exchange information, capture measurements, and so on. The specific I/O components 1118 that are included in a particular machine 1100 will depend on the type of machine. For example, portable machines such as mobile phones will likely include a touch input device or other such input mechanisms, while a headless server machine will likely not include such a touch input device. It will be appreciated that the I/O components 1118 may include many other components that are not shown in FIG. 11. The I/O components 1118 are grouped according to functionality merely for simplifying the following discussion and the grouping is in no way limiting. In various example embodiments, the I/O components 1118 may include output components 1126 and input components 1128. The output components 1126 may include visual components (e.g., a display such as a plasma display panel (PDP), a light emitting diode (LED) display, a liquid crystal display (LCD), a projector, or a cathode ray tube (CRT)), acoustic components (e.g., speakers), haptic components (e.g., a vibratory motor, resistance mechanisms), other signal generators, and so forth. The input components 1128 may include alphanumeric input components (e.g., a keyboard, a touch screen configured to receive alphanumeric input, a photo-optical keyboard, or other alphanumeric input components), point based input components (e.g., a mouse, a touchpad, a trackball, a joystick, a motion sensor, or other pointing instrument), tactile input components (e.g., a physical button, a touch screen that provides location and/or force of touches or touch gestures, or other tactile input components), audio input components (e.g., a microphone), and the like.


In further example embodiments, the I/O components 1118 may include biometric components 1130, motion components 1134, environmental environment components 1136, or position components 1138 among a wide array of other components. For example, the biometric components 1130 may include components to detect expressions (e.g., hand expressions, facial expressions, vocal expressions, body gestures, or eye tracking), measure biosignals (e.g., blood pressure, heart rate, body temperature, perspiration, or brain waves), identify a person (e.g., voice identification, retinal identification, facial identification, fingerprint identification, or electroencephalogram based identification), and the like. The motion components 1134 may include acceleration sensor components (e.g., accelerometer), gravitation sensor components, rotation sensor components (e.g., gyroscope), and so forth. The environment components 1136 may include, for example, illumination sensor components (e.g., photometer), temperature sensor components (e.g., one or more thermometer that detect ambient temperature), humidity sensor components, pressure sensor components (e.g., barometer), acoustic sensor components (e.g., one or more microphones that detect background noise), proximity sensor components (e.g., infrared sensors that detect nearby objects), gas sensors (e.g., gas detection sensors to detection concentrations of hazardous gases for safety or to measure pollutants in the atmosphere), or other components that may provide indications, measurements, or signals corresponding to a surrounding physical environment. The position components 1138 may include location sensor components (e.g., a Global Position system (GPS) receiver component), altitude sensor components (e.g., altimeters or barometers that detect air pressure from which altitude may be derived), orientation sensor components (e.g., magnetometers), and the like.


Communication may be implemented using a wide variety of technologies. The I/O components 1118 may include communication components 1140 operable to couple the machine 1100 to a network 1132 or devices 1120 via coupling 1122 and coupling 1124 respectively. For example, the communication components 1140 may include a network interface component or other suitable device to interface with the network 1132. In further examples, communication components 1140 may include wired communication components, wireless communication components, cellular communication components, Near Field Communication (NFC) components, Bluetooth® components (e.g., Bluetooth® Low Energy), Wi-Fi® components, and other communication components to provide communication via other modalities. The devices 1120 may be another machine or any of a wide variety of peripheral devices (e.g., a peripheral device coupled via a Universal Serial Bus (USB)).


Moreover, the communication components 1140 may detect identifiers or include components operable to detect identifiers. For example, the communication components 1140 may include Radio Frequency Identification (RFID) tag reader components, NFC smart tag detection components, optical reader components (e.g., an optical sensor to detect one-dimensional bar codes such as Universal Product Code (UPC) bar code, multi-dimensional bar codes such as Quick Response (QR) code, Aztec code, Data Matrix, Dataglyph, MaxiCode, PDF417, Ultra Code, UCC RSS-2D bar code, and other optical codes), or acoustic detection components (e.g., microphones to identify tagged audio signals). In addition, a variety of information may be derived via the communication components 1140, such as, location via Internet Protocol (IP) geo-location, location via Wi-Fi® signal triangulation, location via detecting a NFC beacon signal that may indicate a particular location, and so forth.


Glossary

“CARRIER SIGNAL” in this context refers to any intangible medium that is capable of storing, encoding, or carrying instructions for execution by the machine, and includes digital or analog communications signals or other intangible medium to facilitate communication of such instructions. Instructions may be transmitted or received over the network using a transmission medium via a network interface device and using any one of a number of well-known transfer protocols.


“CLIENT DEVICE” in this context refers to any machine that interfaces to a communications network to obtain resources from one or more server systems or other client devices. A client device may be, but is not limited to, a mobile phone, desktop computer, laptop, portable digital assistants (PDAs), smart phones, tablets, ultra books, netbooks, laptops, multi-processor systems, microprocessor-based or programmable consumer electronics, game consoles, set-top boxes, or any other communication device that a user may use to access a network.


“COMMUNICATIONS NETWORK” in this context refers to one or more portions of a network that may be an ad hoc network, an intranet, an extranet, a virtual private network (VPN), a local area network (LAN), a wireless LAN (WLAN), a wide area network (WAN), a wireless WAN (WWAN), a metropolitan area network (MAN), the Internet, a portion of the Internet, a portion of the Public Switched Telephone Network (PSTN), a plain old telephone service (POTS) network, a cellular telephone network, a wireless network, a Wi-Fi® network, another type of network, or a combination of two or more such networks. For example, a network or a portion of a network may include a wireless or cellular network and the coupling may be a Code Division Multiple Access (CDMA) connection, a Global System for Mobile communications (GSM) connection, or other type of cellular or wireless coupling. In this example, the coupling may implement any of a variety of types of data transfer technology, such as Single Carrier Radio Transmission Technology (1×RTT), Evolution-Data Optimized (EVDO) technology, General Packet Radio Service (GPRS) technology, Enhanced Data rates for GSM Evolution (EDGE) technology, third Generation Partnership Project (3GPP) including 3G, fourth generation wireless (4G) networks, Universal Mobile Telecommunications System (UMTS), High Speed Packet Access (HSPA), Worldwide Interoperability for Microwave Access (WiMAX), Long Term Evolution (LTE) standard, others defined by various standard setting organizations, other long range protocols, or other data transfer technology.


“EMPHEMERAL MESSAGE” in this context refers to a message that is accessible for a time-limited duration. An ephemeral message may be a text, an image, a video and the like. The access time for the ephemeral message may be set by the message sender. Alternatively, the access time may be a default setting or a setting specified by the recipient. Regardless of the setting technique, the message is transitory.


“MACHINE-READABLE MEDIUM” in this context refers to a component, device or other tangible media able to store instructions and data temporarily or permanently and may include, but is not be limited to, random-access memory (RAM), read-only memory (ROM), buffer memory, flash memory, optical media, magnetic media, cache memory, other types of storage (e.g., Erasable Programmable Read-Only Memory (EEPROM)) and/or any suitable combination thereof. The term “machine-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, or associated caches and servers) able to store instructions. The term “machine-readable medium” shall also be taken to include any medium, or combination of multiple media, that is capable of storing instructions (e.g., code) for execution by a machine, such that the instructions, when executed by one or more processors of the machine, cause the machine to perform any one or more of the methodologies described herein. Accordingly, a “machine-readable medium” refers to a single storage apparatus or device, as well as “cloud-based” storage systems or storage networks that include multiple storage apparatus or devices. The term “machine-readable medium” excludes signals per se.


“COMPONENT” in this context refers to a device, physical entity or logic having boundaries defined by function or subroutine calls, branch points, application program interfaces (APIs), or other technologies that provide for the partitioning or modularization of particular processing or control functions. Components may be combined via their interfaces with other components to carry out a machine process. A component may be a packaged functional hardware unit designed for use with other components and a part of a program that usually performs a particular function of related functions. Components may constitute either software components (e.g., code embodied on a machine-readable medium) or hardware components. A “hardware component” is a tangible unit capable of performing certain operations and may be configured or arranged in a certain physical manner. In various example embodiments, one or more computer systems (e.g., a standalone computer system, a client computer system, or a server computer system) or one or more hardware components of a computer system (e.g., a processor or a group of processors) may be configured by software (e.g., an application or application portion) as a hardware component that operates to perform certain operations as described herein. A hardware component may also be implemented mechanically, electronically, or any suitable combination thereof. For example, a hardware component may include dedicated circuitry or logic that is permanently configured to perform certain operations. A hardware component may be a special-purpose processor, such as a Field-Programmable Gate Array (FPGA) or an Application Specific Integrated Circuit (ASIC). A hardware component may also include programmable logic or circuitry that is temporarily configured by software to perform certain operations. For example, a hardware component may include software executed by a general-purpose processor or other programmable processor. Once configured by such software, hardware components become specific machines (or specific components of a machine) uniquely tailored to perform the configured functions and are no longer general-purpose processors. It will be appreciated that the decision to implement a hardware component mechanically, in dedicated and permanently configured circuitry, or in temporarily configured circuitry (e.g., configured by software) may be driven by cost and time considerations. Accordingly, the phrase “hardware component” (or “hardware-implemented component”) should be understood to encompass a tangible entity, be that an entity that is physically constructed, permanently configured (e.g., hardwired), or temporarily configured (e.g., programmed) to operate in a certain manner or to perform certain operations described herein. Considering embodiments in which hardware components are temporarily configured (e.g., programmed), each of the hardware components need not be configured or instantiated at any one instance in time. For example, where a hardware component comprises a general-purpose processor configured by software to become a special-purpose processor, the general-purpose processor may be configured as respectively different special-purpose processors (e.g., comprising different hardware components) at different times. Software accordingly configures a particular processor or processors, for example, to constitute a particular hardware component at one instance of time and to constitute a different hardware component at a different instance of time. Hardware components can provide information to, and receive information from, other hardware components. Accordingly, the described hardware components may be regarded as being communicatively coupled. Where multiple hardware components exist contemporaneously, communications may be achieved through signal transmission (e.g., over appropriate circuits and buses) between or among two or more of the hardware components. In embodiments in which multiple hardware components are configured or instantiated at different times, communications between such hardware components may be achieved, for example, through the storage and retrieval of information in memory structures to which the multiple hardware components have access. For example, one hardware component may perform an operation and store the output of that operation in a memory device to which it is communicatively coupled. A further hardware component may then, at a later time, access the memory device to retrieve and process the stored output. Hardware components may also initiate communications with input or output devices, and can operate on a resource (e.g., a collection of information). The various operations of example methods described herein may be performed, at least partially, by one or more processors that are temporarily configured (e.g., by software) or permanently configured to perform the relevant operations. Whether temporarily or permanently configured, such processors may constitute processor-implemented components that operate to perform one or more operations or functions described herein. As used herein, “processor-implemented component” refers to a hardware component implemented using one or more processors. Similarly, the methods described herein may be at least partially processor-implemented, with a particular processor or processors being an example of hardware. For example, at least some of the operations of a method may be performed by one or more processors or processor-implemented components. Moreover, the one or more processors may also operate to support performance of the relevant operations in a “cloud computing” environment or as a “software as a service” (SaaS). For example, at least some of the operations may be performed by a group of computers (as examples of machines including processors), with these operations being accessible via a network (e.g., the Internet) and via one or more appropriate interfaces (e.g., an Application Program Interface (API)). The performance of certain of the operations may be distributed among the processors, not only residing within a single machine, but deployed across a number of machines. In some example embodiments, the processors or processor-implemented components may be located in a single geographic location (e.g., within a home environment, an office environment, or a server farm). In other example embodiments, the processors or processor-implemented components may be distributed across a number of geographic locations.


“PROCESSOR” in this context refers to any circuit or virtual circuit (a physical circuit emulated by logic executing on an actual processor) that manipulates data values according to control signals (e.g., “commands”, “op codes”, “machine code”, etc.) and which produces corresponding output signals that are applied to operate a machine. A processor may, for example, be a Central Processing Unit (CPU), a Reduced Instruction Set Computing (RISC) processor, a Complex Instruction Set Computing (CISC) processor, a Graphics Processing Unit (GPU), a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Radio-Frequency Integrated Circuit (RFIC) or any combination thereof. A processor may further be a multi-core processor having two or more independent processors (sometimes referred to as “cores”) that may execute instructions contemporaneously.


“TIMESTAMP” in this context refers to a sequence of characters or encoded information identifying when a certain event occurred, for example giving date and time of day, sometimes accurate to a small fraction of a second.


“LIFT” in this context is a measure of the performance of a targeted model at predicting or classifying cases as having an enhanced response (with respect to a population as a whole), measured against a random choice targeting model.


“PHONEME ALIGNMENT” in this context, a phoneme is a unit of speech that differentiates one word from another. One phoneme may consist of a sequence of closure, burst, and aspiration events; or, a dipthong may transition from a back vowel to a front vowel. A speech signal may therefore be described not only by what phonemes it contains, but also the locations of the phonemes. Phoneme alignment may therefore be described as a “time-alignment” of phonemes in a waveform, in order to determine an appropriate sequence and location of each phoneme in a speech signal.


“AUDIO-TO-VISUAL CONVERSION” in this context refers to the conversion of audible speech signals into visible speech, wherein the visible speech may include a mouth shape representative of the audible speech signal.


“TIME DELAYED NEURAL NETWORK (TDNN)” in this context, a TDNN is an artificial neural network architecture whose primary purpose is to work on sequential data. An example would be converting continuous audio into a stream of classified phoneme labels for speech recognition.


“BI-DIRECTIONAL LONG-SHORT TERM MEMORY (BLSTM)” in this context refers to a recurrent neural network (RNN) architecture that remembers values over arbitrary intervals. Stored values are not modified as learning proceeds. RNNs allow forward and backward connections between neurons. BLSTM are well-suited for the classification, processing, and prediction of time series, given time lags of unknown size and duration between events.

Claims
  • 1. A method comprising: accessing a database comprising user profile data of a plurality of users, the user profile data including user attribute data;generating a bit-set based on the user attribute data from the database, the bit-set comprising an array of binary values, the binary values based on the user attribute data;receiving a user input that comprises a selection of a geographic region from within a map image;segmenting the geographic region into a set of geo-cells, wherein the set of geo-cells include corresponding location identifiers;filtering the bit-set based on the location identifiers of the set of geo-cells;identifying a subset of the plurality of users based on the filtered bit-set;performing a comparison of a value of a quantity of users among the subset of the plurality of users identified based on the filtered bit-set against a threshold value; andcausing display of a notification at the client device based on the comparison of the value of the quantity of users among the subset of the plurality of users against the threshold value, the notification including a presentation of the value of the quantity of users among the subset of the plurality of users identified based on the filtered bit-set, the presentation of the quantity of users including a linear gauge that indicates the quantity of the users among the subset of the plurality of users.
  • 2. The method of claim 1 wherein the causing display of the presentation of the quantity includes: causing display of the linear gauge within a graphical user interface, the linear gauge comprising a display of a series of quantity values; andpresenting a value indicator at a position along the linear gauge, the position corresponding to a quantity value equivalent to the quantity of the subset of the plurality of users.
  • 3. The method of claim 1, wherein the user attribute data includes a first user attribute and a second user attribute, the bit-set includes a first bit-set that corresponds to the first user attribute and a second bit-set that corresponds to the second user attribute, the user input defines a first value of the first user attribute and a second value of the second user attribute, and the method further comprises: receiving a Boolean operator; andfiltering the first bit-set based on the first value and the second bit-set based on the second value; andapplying the Boolean operator to the filtered first bit-set and the filtered second bit-set.
  • 4. The method of claim 1, wherein the receiving the user input that identifies the geographic region comprises a coordinate pair and a radius.
  • 5. The method of claim 1, wherein the method further comprises: distributing media content to the subset of the plurality of users.
  • 6. The method of claim 5, wherein the distributing the media content includes: presenting an ephemeral message to the subset of the plurality of users, the ephemeral message comprising a depiction of the media content.
  • 7. A system comprising: a memory; andat least one hardware processor coupled to the memory and comprising instructions that causes the system to perform operations comprising:accessing a database comprising user profile data of a plurality of users, the user profile data including user attribute data;generating a bit-set based on the user attribute data from the database, the bit-set comprising an array of binary values, the binary values based on the user attribute data;receiving a user input that comprises a selection of a geographic region from within a map image;segmenting the geographic region into a set of geo-cells, wherein the set of geo-cells include corresponding location identifiers;filtering the bit-set based on the location identifiers of the set of geo-cells;identifying a subset of the plurality of users based on the filtered bit-set;performing a comparison of a value of a quantity of users among the subset of the plurality of users identified based on the filtered bit-set against a threshold value; andcausing display of a notification at the client device based on the comparison of the value of the quantity of users among the subset of the plurality of users against the threshold value, the notification including a presentation of the value of the quantity of users among the subset of the plurality of users identified based on the filtered bit-set, the presentation of the quantity of users including a linear gauge that indicates the quantity of the users among the subset of the plurality of users.
  • 8. The system of claim 7 wherein the causing display of the presentation of the quantity includes: causing display of the linear gauge within a graphical user interface, the linear gauge comprising a display of a series of quantity values; andpresenting a value indicator at a position along the linear gauge, the position corresponding to a quantity value equivalent to the quantity of the subset of the plurality of users.
  • 9. The system of claim 7, wherein the user attribute data includes a first user attribute and a second user attribute, the bit-set includes a first bit-set that corresponds to the first user attribute and a second bit-set that corresponds to the second user attribute, the user input defines a first value of the first user attribute and a second value of the second user attribute, and the instructions cause the system to perform operations further comprising: receiving a Boolean operator; andfiltering the first bit-set based on the first value and the second bit-set based on the second value; andapplying the Boolean operator to the filtered first bit-set and the filtered second bit-set.
  • 10. The system of claim 7, wherein the receiving the user input that identifies the geographic region comprises a coordinate pair and a radius.
  • 11. The system of claim 7, wherein the instructions cause the system to perform operations further comprising: distributing media content to the subset of the plurality of users.
  • 12. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising: accessing a database comprising user profile data of a plurality of users, the user profile data including user attribute data;generating a bit-set based on the user attribute data from the database, the bit-set comprising an array of binary values, the binary values based on the user attribute data;receiving a user input that comprises a selection of a geographic region from within a map image;segmenting the geographic region into a set of geo-cells, wherein the set of geo-cells include corresponding location identifiers;filtering the bit-set based on the location identifiers of the set of geo-cells;identifying a subset of the plurality of users based on the filtered bit-set;performing a comparison of a value of a quantity of users among the subset of the plurality of users identified based on the filtered bit-set against a threshold value; andcausing display of a notification at the client device based on the comparison of the value of the quantity of users among the subset of the plurality of users against the threshold value, the notification including a presentation of the value of the quantity of users among the subset of the plurality of users identified based on the filtered bit-set, the presentation of the quantity of users including a linear gauge that indicates the quantity of the users among the subset of the plurality of users.
US Referenced Citations (653)
Number Name Date Kind
666223 Shedlock Jan 1901 A
4581634 Williams Apr 1986 A
4975690 Torres Dec 1990 A
5072412 Henderson, Jr. et al. Dec 1991 A
5493692 Theimer et al. Feb 1996 A
5713073 Warsta Jan 1998 A
5754939 Herz et al. May 1998 A
5855008 Goldhaber et al. Dec 1998 A
5883639 Walton et al. Mar 1999 A
5999932 Paul Dec 1999 A
6012098 Bayeh et al. Jan 2000 A
6014090 Rosen et al. Jan 2000 A
6029141 Bezos et al. Feb 2000 A
6038295 Mattes Mar 2000 A
6049711 Yehezkel et al. Apr 2000 A
6154764 Nitta et al. Nov 2000 A
6158044 Tibbetts Dec 2000 A
6167435 Druckenmiller et al. Dec 2000 A
6204840 Petelycky et al. Mar 2001 B1
6205432 Gabbard et al. Mar 2001 B1
6216141 Straub et al. Apr 2001 B1
6285381 Sawano et al. Sep 2001 B1
6285987 Roth et al. Sep 2001 B1
6310694 Okimoto et al. Oct 2001 B1
6317789 Rakavy et al. Nov 2001 B1
6334149 Davis, Jr. et al. Dec 2001 B1
6349203 Asaoka et al. Feb 2002 B1
6353170 Eyzaguirre et al. Mar 2002 B1
6446004 Cao et al. Sep 2002 B1
6449657 Stanbach et al. Sep 2002 B2
6456852 Bar et al. Sep 2002 B2
6484196 Maurille Nov 2002 B1
6487586 Ogilvie et al. Nov 2002 B2
6487601 Hubacher et al. Nov 2002 B1
6523008 Avrunin Feb 2003 B1
6542749 Tanaka et al. Apr 2003 B2
6549768 Fraccaroli Apr 2003 B1
6618593 Drutman et al. Sep 2003 B1
6622174 Ukita et al. Sep 2003 B1
6631463 Floyd et al. Oct 2003 B1
6636247 Hamzy et al. Oct 2003 B1
6636855 Holloway et al. Oct 2003 B2
6643684 Malkin et al. Nov 2003 B1
6658095 Yoakum et al. Dec 2003 B1
6665531 Soderbacka et al. Dec 2003 B1
6668173 Greene Dec 2003 B2
6684238 Dutta Jan 2004 B1
6684257 Camut et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6700506 Winkler Mar 2004 B1
6701347 Ogilvie Mar 2004 B1
6711608 Ogilvie Mar 2004 B1
6720860 Narayanaswami Apr 2004 B1
6724403 Santoro et al. Apr 2004 B1
6757713 Ogilvie et al. Jun 2004 B1
6832222 Zimowski Dec 2004 B1
6834195 Brandenberg et al. Dec 2004 B2
6836792 Chen Dec 2004 B1
6898626 Ohashi May 2005 B2
6959324 Kubik et al. Oct 2005 B1
6970088 Kovach Nov 2005 B2
6970907 Ullmann et al. Nov 2005 B1
6980909 Root et al. Dec 2005 B2
6981040 Konig et al. Dec 2005 B1
7020494 Spriestersbach et al. Mar 2006 B2
7027124 Foote et al. Apr 2006 B2
7072963 Anderson et al. Jul 2006 B2
7085571 Kalhan et al. Aug 2006 B2
7110744 Freeny, Jr. Sep 2006 B2
7124164 Chemtob Oct 2006 B1
7149893 Leonard et al. Dec 2006 B1
7173651 Knowles Feb 2007 B1
7188143 Szeto Mar 2007 B2
7203380 Chiu et al. Apr 2007 B2
7206568 Sudit Apr 2007 B2
7227937 Yoakum et al. Jun 2007 B1
7237002 Estrada et al. Jun 2007 B1
7240089 Boudreau Jul 2007 B2
7243163 Friend et al. Jul 2007 B1
7269426 Kokkonen et al. Sep 2007 B2
7278168 Chaudhury et al. Oct 2007 B1
7280658 Amini et al. Oct 2007 B2
7315823 Brondrup Jan 2008 B2
7349768 Bruce et al. Mar 2008 B2
7356564 Hartselle et al. Apr 2008 B2
7376715 Cunningham et al. May 2008 B2
7394345 Ehlinger et al. Jul 2008 B1
7411493 Smith Aug 2008 B2
7423580 Markhovsky et al. Sep 2008 B2
7454442 Cobleigh et al. Nov 2008 B2
7478402 Christensen et al. Jan 2009 B2
7496347 Puranik Feb 2009 B2
7508419 Toyama et al. Mar 2009 B2
7512649 Faybishenko et al. Mar 2009 B2
7519670 Hagale et al. Apr 2009 B2
7535890 Rojas May 2009 B2
7546554 Chiu et al. Jun 2009 B2
7607096 Oreizy et al. Oct 2009 B2
7639943 Kalajan Dec 2009 B1
7650231 Gadler Jan 2010 B2
7668537 DeVries Feb 2010 B2
7703140 Nath et al. Apr 2010 B2
7770137 Forbes et al. Aug 2010 B2
7778973 Choi Aug 2010 B2
7779444 Glad Aug 2010 B2
7787886 Markhovsky et al. Aug 2010 B2
7796946 Eisenbach Sep 2010 B2
7801954 Cadiz et al. Sep 2010 B2
7856360 Kramer et al. Dec 2010 B2
7912896 Wolovitz et al. Mar 2011 B2
8001204 Burtner et al. Aug 2011 B2
8032586 Challenger et al. Oct 2011 B2
8082255 Carlson, Jr. et al. Dec 2011 B1
8090351 Klein Jan 2012 B2
8098904 Ioffe et al. Jan 2012 B2
8099109 Altman et al. Jan 2012 B2
8112716 Kobayashi Feb 2012 B2
8131597 Hudetz Mar 2012 B2
8135166 Rhoads Mar 2012 B2
8136028 Loeb et al. Mar 2012 B1
8146001 Reese Mar 2012 B1
8161115 Yamamoto Apr 2012 B2
8161417 Lee Apr 2012 B1
8170957 Richard May 2012 B2
8195203 Tseng Jun 2012 B1
8199747 Rojas et al. Jun 2012 B2
8208943 Petersen Jun 2012 B2
8214443 Hamburg Jul 2012 B2
8234350 Gu et al. Jul 2012 B1
8238947 Lottin et al. Aug 2012 B2
8244593 Klinger et al. Aug 2012 B2
8276092 Narayanan et al. Sep 2012 B1
8279319 Date Oct 2012 B2
8280406 Ziskind et al. Oct 2012 B2
8285199 Hsu et al. Oct 2012 B2
8287380 Nguyen et al. Oct 2012 B2
8301159 Hamynen et al. Oct 2012 B2
8306922 Kunal et al. Nov 2012 B1
8312086 Velusamy et al. Nov 2012 B2
8312097 Siegel et al. Nov 2012 B1
8326315 Phillips et al. Dec 2012 B2
8326327 Hymel et al. Dec 2012 B2
8332475 Rosen et al. Dec 2012 B2
8352546 Dollard Jan 2013 B1
8379130 Forutanpour et al. Feb 2013 B2
8385950 Wagner et al. Feb 2013 B1
8402097 Szeto Mar 2013 B2
8405773 Hayashi et al. Mar 2013 B2
8418067 Cheng et al. Apr 2013 B2
8423409 Rao Apr 2013 B2
8471914 Sakiyama et al. Jun 2013 B2
8472935 Fujisaki Jun 2013 B1
8510383 Hurley et al. Aug 2013 B2
8527345 Rothschild et al. Sep 2013 B2
8554627 Svendsen et al. Oct 2013 B2
8560612 Kilmer et al. Oct 2013 B2
8570907 Garcia, Jr. et al. Oct 2013 B2
8594680 Ledlie et al. Nov 2013 B2
8613089 Holloway et al. Dec 2013 B1
8660358 Bergboer et al. Feb 2014 B1
8660369 Llano et al. Feb 2014 B2
8660793 Ngo et al. Feb 2014 B2
8682350 Altman et al. Mar 2014 B2
8718333 Wolf et al. May 2014 B2
8724622 Rojas May 2014 B2
8732168 Johnson May 2014 B2
8744523 Fan et al. Jun 2014 B2
8745132 Obradovich Jun 2014 B2
8761800 Kuwahara Jun 2014 B2
8768876 Shim et al. Jul 2014 B2
8775972 Spiegel Jul 2014 B2
8788680 Naik Jul 2014 B1
8790187 Walker et al. Jul 2014 B2
8797415 Arnold Aug 2014 B2
8798646 Wang et al. Aug 2014 B1
8856349 Jain et al. Oct 2014 B2
8874677 Rosen et al. Oct 2014 B2
8886227 Schmidt et al. Nov 2014 B2
8909679 Root et al. Dec 2014 B2
8909714 Agarwal et al. Dec 2014 B2
8909725 Sehn Dec 2014 B1
8914752 Spiegel Dec 2014 B1
8972357 Shim et al. Mar 2015 B2
8995433 Rojas Mar 2015 B2
9015285 Ebsen et al. Apr 2015 B1
9020745 Johnston et al. Apr 2015 B2
9040574 Wang et al. May 2015 B2
9055416 Rosen et al. Jun 2015 B2
9083770 Drose et al. Jul 2015 B1
9094137 Sehn et al. Jul 2015 B1
9100806 Rosen et al. Aug 2015 B2
9100807 Rosen et al. Aug 2015 B2
9113301 Spiegel et al. Aug 2015 B1
9119027 Sharon et al. Aug 2015 B2
9123074 Jacobs Sep 2015 B2
9143382 Bhogal et al. Sep 2015 B2
9143681 Ebsen et al. Sep 2015 B1
9148424 Yang Sep 2015 B1
9152477 Campbell et al. Oct 2015 B1
9191776 Root et al. Nov 2015 B2
9204252 Root Dec 2015 B2
9225805 Kujawa et al. Dec 2015 B2
9225897 Sehn et al. Dec 2015 B1
9237202 Sehn Jan 2016 B1
9258459 Hartley Feb 2016 B2
9264463 Rubinstein et al. Feb 2016 B2
9276886 Samaranayake Mar 2016 B1
9294425 Son Mar 2016 B1
9344606 Hartley et al. May 2016 B2
9385983 Sehn Jul 2016 B1
9396354 Murphy et al. Jul 2016 B1
9407712 Sehn Aug 2016 B1
9407816 Sehn Aug 2016 B1
9430783 Sehn Aug 2016 B1
9439041 Parvizi et al. Sep 2016 B2
9443227 Evans et al. Sep 2016 B2
9450907 Pridmore et al. Sep 2016 B2
9459778 Hogeg et al. Oct 2016 B2
9482882 Hanover et al. Nov 2016 B1
9482883 Meisenholder Nov 2016 B1
9489661 Evans et al. Nov 2016 B2
9491134 Rosen et al. Nov 2016 B2
9532171 Allen et al. Dec 2016 B2
9537811 Allen et al. Jan 2017 B2
9560006 Prado et al. Jan 2017 B2
9628950 Noeth et al. Apr 2017 B1
9652896 Jurgenson et al. May 2017 B1
9659244 Anderton et al. May 2017 B2
9693191 Sehn Jun 2017 B2
9705831 Spiegel Jul 2017 B2
9710821 Heath Jul 2017 B2
9742713 Spiegel et al. Aug 2017 B2
9785796 Murphy et al. Oct 2017 B1
9825898 Sehn Nov 2017 B2
9854219 Sehn Dec 2017 B2
9961520 Brooks et al. May 2018 B2
20020047868 Miyazawa Apr 2002 A1
20020078456 Hudson et al. Jun 2002 A1
20020087631 Sharma Jul 2002 A1
20020097257 Miller et al. Jul 2002 A1
20020122659 McGrath et al. Sep 2002 A1
20020128047 Gates Sep 2002 A1
20020144154 Tomkow Oct 2002 A1
20030001846 Davis et al. Jan 2003 A1
20030016247 Lai et al. Jan 2003 A1
20030017823 Mager et al. Jan 2003 A1
20030020623 Cao et al. Jan 2003 A1
20030023874 Prokupets et al. Jan 2003 A1
20030037124 Yamaura et al. Feb 2003 A1
20030052925 Daimon et al. Mar 2003 A1
20030101230 Benschoter et al. May 2003 A1
20030110503 Perkes Jun 2003 A1
20030126215 Udell et al. Jul 2003 A1
20030148773 Spriestersbach et al. Aug 2003 A1
20030164856 Prager et al. Sep 2003 A1
20030217106 Adar et al. Nov 2003 A1
20030229607 Zellweger et al. Dec 2003 A1
20040027371 Jaeger Feb 2004 A1
20040064429 Hirstius et al. Apr 2004 A1
20040078367 Anderson et al. Apr 2004 A1
20040111467 Willis Jun 2004 A1
20040158739 Wakai et al. Aug 2004 A1
20040189465 Capobianco et al. Sep 2004 A1
20040203959 Coombes Oct 2004 A1
20040215625 Svendsen et al. Oct 2004 A1
20040221258 Devore, Jr. Nov 2004 A1
20040243531 Dean Dec 2004 A1
20040243688 Wugofski Dec 2004 A1
20050021444 Bauer et al. Jan 2005 A1
20050022211 Veselov et al. Jan 2005 A1
20050048989 Jung Mar 2005 A1
20050078804 Yomoda Apr 2005 A1
20050097176 Schatz et al. May 2005 A1
20050102381 Jiang et al. May 2005 A1
20050104976 Currans May 2005 A1
20050114783 Szeto May 2005 A1
20050119936 Buchanan et al. Jun 2005 A1
20050122405 Voss et al. Jun 2005 A1
20050193340 Amburgey et al. Sep 2005 A1
20050193345 Klassen et al. Sep 2005 A1
20050198128 Anderson Sep 2005 A1
20050223066 Buchheit et al. Oct 2005 A1
20050288954 McCarthy et al. Dec 2005 A1
20060026067 Nicholas et al. Feb 2006 A1
20060107297 Toyama et al. May 2006 A1
20060114338 Rothschild Jun 2006 A1
20060119882 Harris et al. Jun 2006 A1
20060242239 Morishima et al. Oct 2006 A1
20060252438 Ansamaa et al. Nov 2006 A1
20060265417 Amato et al. Nov 2006 A1
20060270419 Crowley et al. Nov 2006 A1
20060287878 Wadhwa et al. Dec 2006 A1
20070004426 Pfleging et al. Jan 2007 A1
20070038715 Collins et al. Feb 2007 A1
20070040931 Nishizawa Feb 2007 A1
20070064899 Boss et al. Mar 2007 A1
20070073517 Panje Mar 2007 A1
20070073823 Cohen et al. Mar 2007 A1
20070075898 Markhovsky et al. Apr 2007 A1
20070082707 Flynt et al. Apr 2007 A1
20070136228 Petersen Jun 2007 A1
20070192128 Celestini Aug 2007 A1
20070198340 Lucovsky et al. Aug 2007 A1
20070198495 Buron et al. Aug 2007 A1
20070208751 Cowan et al. Sep 2007 A1
20070210936 Nicholson Sep 2007 A1
20070214180 Crawford Sep 2007 A1
20070214216 Carrer et al. Sep 2007 A1
20070233556 Koningstein Oct 2007 A1
20070233801 Eren et al. Oct 2007 A1
20070233859 Zhao et al. Oct 2007 A1
20070243887 Bandhole et al. Oct 2007 A1
20070244750 Grannan et al. Oct 2007 A1
20070255456 Funayama Nov 2007 A1
20070281690 Altman et al. Dec 2007 A1
20080022329 Glad Jan 2008 A1
20080025701 Ikeda Jan 2008 A1
20080032703 Krumm et al. Feb 2008 A1
20080033930 Warren Feb 2008 A1
20080043041 Hedenstroem et al. Feb 2008 A2
20080049704 Witteman et al. Feb 2008 A1
20080055269 Lemay et al. Mar 2008 A1
20080062141 Chandhri Mar 2008 A1
20080076505 Ngyen et al. Mar 2008 A1
20080092233 Tian et al. Apr 2008 A1
20080094387 Chen Apr 2008 A1
20080104503 Beall et al. May 2008 A1
20080109844 Baldeschweiler et al. May 2008 A1
20080120409 Sun et al. May 2008 A1
20080147730 Lee et al. Jun 2008 A1
20080148150 Mall Jun 2008 A1
20080158230 Sharma et al. Jul 2008 A1
20080168033 Ott et al. Jul 2008 A1
20080168489 Schraga Jul 2008 A1
20080189177 Anderton et al. Aug 2008 A1
20080207176 Brackbill et al. Aug 2008 A1
20080208692 Garaventi et al. Aug 2008 A1
20080214210 Rasanen et al. Sep 2008 A1
20080222545 Lemay Sep 2008 A1
20080255976 Altberg et al. Oct 2008 A1
20080256446 Yamamoto Oct 2008 A1
20080256577 Funaki et al. Oct 2008 A1
20080266421 Takahata et al. Oct 2008 A1
20080270938 Carlson Oct 2008 A1
20080288338 Wiseman et al. Nov 2008 A1
20080306826 Kramer et al. Dec 2008 A1
20080313329 Wang et al. Dec 2008 A1
20080313346 Kujawa et al. Dec 2008 A1
20080318616 Chipalkatti et al. Dec 2008 A1
20090006191 Arankalle et al. Jan 2009 A1
20090006565 Velusamy et al. Jan 2009 A1
20090015703 Kim et al. Jan 2009 A1
20090024956 Kobayashi Jan 2009 A1
20090030774 Rothschild et al. Jan 2009 A1
20090030999 Gatzke et al. Jan 2009 A1
20090040324 Nonaka Feb 2009 A1
20090042588 Lottin et al. Feb 2009 A1
20090058822 Chaudhri Mar 2009 A1
20090079846 Chou Mar 2009 A1
20090089678 Sacco et al. Apr 2009 A1
20090089710 Wood et al. Apr 2009 A1
20090093261 Ziskind Apr 2009 A1
20090132341 Klinger May 2009 A1
20090132453 Hangartner et al. May 2009 A1
20090132665 Thomsen et al. May 2009 A1
20090148045 Lee et al. Jun 2009 A1
20090153492 Popp Jun 2009 A1
20090157450 Athsani et al. Jun 2009 A1
20090157752 Gonzalez Jun 2009 A1
20090160970 Fredlund et al. Jun 2009 A1
20090163182 Gatti et al. Jun 2009 A1
20090177299 Van De Sluis Jul 2009 A1
20090192900 Collison Jul 2009 A1
20090199242 Johnson et al. Aug 2009 A1
20090215469 Fisher et al. Aug 2009 A1
20090232354 Camp, Jr. et al. Sep 2009 A1
20090234815 Boerries et al. Sep 2009 A1
20090239552 Churchill et al. Sep 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090265647 Martin et al. Oct 2009 A1
20090288022 Almstrand et al. Nov 2009 A1
20090291672 Treves et al. Nov 2009 A1
20090292608 Polachek Nov 2009 A1
20090319607 Belz et al. Dec 2009 A1
20090327073 Li Dec 2009 A1
20100062794 Han Mar 2010 A1
20100082427 Burgener et al. Apr 2010 A1
20100082693 Hugg et al. Apr 2010 A1
20100100568 Papin et al. Apr 2010 A1
20100113065 Narayan et al. May 2010 A1
20100130233 Lansing May 2010 A1
20100131880 Lee et al. May 2010 A1
20100131895 Wohlert May 2010 A1
20100153144 Miller et al. Jun 2010 A1
20100159944 Pascal et al. Jun 2010 A1
20100161658 Hamynen et al. Jun 2010 A1
20100161831 Haas et al. Jun 2010 A1
20100162149 Sheleheda et al. Jun 2010 A1
20100183280 Beauregard et al. Jul 2010 A1
20100185552 Deluca et al. Jul 2010 A1
20100185665 Horn et al. Jul 2010 A1
20100191631 Weidmann Jul 2010 A1
20100197318 Petersen et al. Aug 2010 A1
20100197319 Petersen et al. Aug 2010 A1
20100198683 Aarabi Aug 2010 A1
20100198694 Muthukrishnan Aug 2010 A1
20100198826 Petersen et al. Aug 2010 A1
20100198828 Petersen et al. Aug 2010 A1
20100198862 Jennings et al. Aug 2010 A1
20100198870 Petersen et al. Aug 2010 A1
20100198917 Petersen et al. Aug 2010 A1
20100201482 Robertson et al. Aug 2010 A1
20100201536 Robertson et al. Aug 2010 A1
20100214436 Kim et al. Aug 2010 A1
20100223128 Dukellis et al. Sep 2010 A1
20100223343 Bosan et al. Sep 2010 A1
20100250109 Johnston et al. Sep 2010 A1
20100257196 Waters et al. Oct 2010 A1
20100259386 Holley et al. Oct 2010 A1
20100273509 Sweeney et al. Oct 2010 A1
20100281045 Dean Nov 2010 A1
20100306669 Della Pasqua Dec 2010 A1
20110004071 Faiola et al. Jan 2011 A1
20110010205 Richards Jan 2011 A1
20110029512 Folgner et al. Feb 2011 A1
20110040783 Uemichi et al. Feb 2011 A1
20110040804 Peirce et al. Feb 2011 A1
20110050909 Ellenby et al. Mar 2011 A1
20110050915 Wang et al. Mar 2011 A1
20110064388 Brown et al. Mar 2011 A1
20110066743 Hurley et al. Mar 2011 A1
20110083101 Sharon et al. Apr 2011 A1
20110099507 Nesladek et al. Apr 2011 A1
20110102630 Rukes May 2011 A1
20110119133 Igelman et al. May 2011 A1
20110137881 Cheng et al. Jun 2011 A1
20110145564 Moshir et al. Jun 2011 A1
20110159890 Fortescue et al. Jun 2011 A1
20110164163 Bilbrey et al. Jul 2011 A1
20110197194 D'Angelo et al. Aug 2011 A1
20110202598 Evans et al. Aug 2011 A1
20110202968 Nurmi Aug 2011 A1
20110211534 Schmidt et al. Sep 2011 A1
20110213845 Logan et al. Sep 2011 A1
20110215966 Kim et al. Sep 2011 A1
20110225048 Nair Sep 2011 A1
20110238763 Shin et al. Sep 2011 A1
20110255736 Thompson et al. Oct 2011 A1
20110273575 Lee Nov 2011 A1
20110282799 Huston Nov 2011 A1
20110283188 Farrenkopf Nov 2011 A1
20110286586 Saylor et al. Nov 2011 A1
20110314419 Dunn et al. Dec 2011 A1
20110320373 Lee et al. Dec 2011 A1
20120150978 Monaco Jan 2012 A1
20120028659 Whitney et al. Feb 2012 A1
20120033718 Kauffman et al. Feb 2012 A1
20120036015 Sheikh Feb 2012 A1
20120036443 Ohmori et al. Feb 2012 A1
20120054797 Skog et al. Mar 2012 A1
20120059722 Rao Mar 2012 A1
20120062805 Candelore Mar 2012 A1
20120084731 Filman et al. Apr 2012 A1
20120084835 Thomas et al. Apr 2012 A1
20120099800 Llano et al. Apr 2012 A1
20120108293 Law et al. May 2012 A1
20120110096 Smarr et al. May 2012 A1
20120113143 Adhikari et al. May 2012 A1
20120113272 Hata May 2012 A1
20120123830 Svendsen et al. May 2012 A1
20120123871 Svendsen et al. May 2012 A1
20120123875 Svendsen et al. May 2012 A1
20120124126 Alcazar et al. May 2012 A1
20120124176 Curtis et al. May 2012 A1
20120124458 Cruzada May 2012 A1
20120131507 Sparandara et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120143760 Abulafia et al. Jun 2012 A1
20120165100 Lalancette et al. Jun 2012 A1
20120166971 Sachson et al. Jun 2012 A1
20120169855 Oh Jul 2012 A1
20120172062 Altman et al. Jul 2012 A1
20120173991 Roberts et al. Jul 2012 A1
20120176401 Hayward et al. Jul 2012 A1
20120184248 Speede Jul 2012 A1
20120197724 Kendall Aug 2012 A1
20120200743 Blanchflower et al. Aug 2012 A1
20120209921 Adafin et al. Aug 2012 A1
20120209924 Evans et al. Aug 2012 A1
20120210244 De Francisco Lopez et al. Aug 2012 A1
20120212632 Mate et al. Aug 2012 A1
20120220264 Kawabata Aug 2012 A1
20120226748 Bosworth et al. Sep 2012 A1
20120233000 Fisher et al. Sep 2012 A1
20120236162 Imamura Sep 2012 A1
20120239761 Linner et al. Sep 2012 A1
20120250951 Chen Oct 2012 A1
20120252418 Kandekar et al. Oct 2012 A1
20120254325 Majeti et al. Oct 2012 A1
20120278387 Garcia et al. Nov 2012 A1
20120278692 Shi Nov 2012 A1
20120290637 Perantatos et al. Nov 2012 A1
20120299954 Wada et al. Nov 2012 A1
20120304052 Tanaka et al. Nov 2012 A1
20120304080 Wormald et al. Nov 2012 A1
20120307096 Bray et al. Dec 2012 A1
20120307112 Kunishige et al. Dec 2012 A1
20120319904 Lee et al. Dec 2012 A1
20120323933 He et al. Dec 2012 A1
20120324018 Metcalf et al. Dec 2012 A1
20130006759 Srivastava et al. Jan 2013 A1
20130024757 Doll et al. Jan 2013 A1
20130036364 Johnson Feb 2013 A1
20130045753 Obermeyer et al. Feb 2013 A1
20130050260 Reitan Feb 2013 A1
20130055083 Fino Feb 2013 A1
20130057587 Leonard et al. Mar 2013 A1
20130059607 Herz et al. Mar 2013 A1
20130060690 Oskolkov et al. Mar 2013 A1
20130063369 Malhotra et al. Mar 2013 A1
20130067027 Song et al. Mar 2013 A1
20130071093 Hanks et al. Mar 2013 A1
20130080254 Thramann Mar 2013 A1
20130085790 Palmer et al. Apr 2013 A1
20130086072 Peng et al. Apr 2013 A1
20130090171 Holton et al. Apr 2013 A1
20130095857 Garcia et al. Apr 2013 A1
20130104053 Thornton et al. Apr 2013 A1
20130110885 Brundrett, III May 2013 A1
20130111514 Slavin et al. May 2013 A1
20130128059 Kristensson May 2013 A1
20130129252 Lauper May 2013 A1
20130132477 Bosworth et al. May 2013 A1
20130145286 Feng et al. Jun 2013 A1
20130159110 Rajaram et al. Jun 2013 A1
20130159919 Leydon Jun 2013 A1
20130169822 Zhu et al. Jul 2013 A1
20130173729 Starenky et al. Jul 2013 A1
20130182133 Tanabe Jul 2013 A1
20130185131 Sinha et al. Jul 2013 A1
20130191198 Carlson et al. Jul 2013 A1
20130194301 Robbins et al. Aug 2013 A1
20130198176 Kim Aug 2013 A1
20130218965 Abrol et al. Aug 2013 A1
20130218968 Mcevilly et al. Aug 2013 A1
20130222323 Mckenzie Aug 2013 A1
20130227476 Frey Aug 2013 A1
20130232194 Knapp et al. Sep 2013 A1
20130263031 Oshiro et al. Oct 2013 A1
20130265450 Barnes, Jr. Oct 2013 A1
20130267253 Case et al. Oct 2013 A1
20130275505 Gauglitz et al. Oct 2013 A1
20130290443 Collins et al. Oct 2013 A1
20130304646 De Geer Nov 2013 A1
20130311255 Cummins et al. Nov 2013 A1
20130325964 Berberat Dec 2013 A1
20130344896 Kirmse et al. Dec 2013 A1
20130346869 Asver et al. Dec 2013 A1
20130346877 Borovoy et al. Dec 2013 A1
20140006129 Heath Jan 2014 A1
20140011538 Mulcahy et al. Jan 2014 A1
20140019264 Wachman et al. Jan 2014 A1
20140032682 Prado et al. Jan 2014 A1
20140043204 Basnayake et al. Feb 2014 A1
20140045530 Gordon et al. Feb 2014 A1
20140047016 Rao Feb 2014 A1
20140047045 Baldwin et al. Feb 2014 A1
20140047335 Lewis et al. Feb 2014 A1
20140049652 Moon et al. Feb 2014 A1
20140052485 Shidfar Feb 2014 A1
20140052633 Gandhi Feb 2014 A1
20140057660 Wager Feb 2014 A1
20140082651 Sharifi Mar 2014 A1
20140092130 Anderson et al. Apr 2014 A1
20140096029 Schultz Apr 2014 A1
20140114565 Aziz et al. Apr 2014 A1
20140122658 Haeger et al. May 2014 A1
20140122787 Shalvi et al. May 2014 A1
20140129953 Spiegel May 2014 A1
20140143143 Fasoli et al. May 2014 A1
20140149519 Redfern et al. May 2014 A1
20140155102 Cooper et al. Jun 2014 A1
20140173424 Hogeg et al. Jun 2014 A1
20140173457 Wang et al. Jun 2014 A1
20140189592 Benchenaa et al. Jul 2014 A1
20140201527 Krivorot Jul 2014 A1
20140207679 Cho Jul 2014 A1
20140214471 Schreiner, III Jul 2014 A1
20140222564 Kranendonk et al. Aug 2014 A1
20140258405 Perkin Sep 2014 A1
20140265359 Cheng et al. Sep 2014 A1
20140266703 Dalley, Jr. et al. Sep 2014 A1
20140279061 Elimeliah et al. Sep 2014 A1
20140279436 Dorsey et al. Sep 2014 A1
20140279540 Jackson Sep 2014 A1
20140280537 Pridmore et al. Sep 2014 A1
20140282096 Rubinstein et al. Sep 2014 A1
20140287779 O'keefe et al. Sep 2014 A1
20140289833 Briceno Sep 2014 A1
20140306986 Gottesman et al. Oct 2014 A1
20140317302 Naik Oct 2014 A1
20140324627 Haver et al. Oct 2014 A1
20140324629 Jacobs Oct 2014 A1
20140325383 Brown et al. Oct 2014 A1
20140359024 Spiegel Dec 2014 A1
20140359032 Spiegel et al. Dec 2014 A1
20150020086 Chen et al. Jan 2015 A1
20150046278 Pei et al. Feb 2015 A1
20150071619 Brough Mar 2015 A1
20150087263 Branscomb et al. Mar 2015 A1
20150088622 Ganschow et al. Mar 2015 A1
20150095020 Leydon Apr 2015 A1
20150096042 Mizrachi Apr 2015 A1
20150116529 Wu et al. Apr 2015 A1
20150169827 Laborde Jun 2015 A1
20150172534 Miyakawa et al. Jun 2015 A1
20150178260 Brunson Jun 2015 A1
20150189474 Amrhein Jul 2015 A1
20150199082 Scholler et al. Jul 2015 A1
20150213463 Turner Jul 2015 A1
20150222814 Li et al. Aug 2015 A1
20150227602 Ramu et al. Aug 2015 A1
20150261917 Smith Sep 2015 A1
20150312184 Langholz et al. Oct 2015 A1
20150350136 Flynn, III et al. Dec 2015 A1
20150365795 Allen et al. Dec 2015 A1
20150378502 Hu et al. Dec 2015 A1
20160006927 Sehn Jan 2016 A1
20160014063 Hogeg et al. Jan 2016 A1
20160085773 Chang et al. Mar 2016 A1
20160085863 Allen et al. Mar 2016 A1
20160086670 Gross et al. Mar 2016 A1
20160099901 Allen et al. Apr 2016 A1
20160147886 Demir May 2016 A1
20160180887 Sehn Jun 2016 A1
20160182422 Sehn Jun 2016 A1
20160182875 Sehn Jun 2016 A1
20160239248 Sehn Aug 2016 A1
20160253355 Mozaffari Sep 2016 A1
20160277419 Allen et al. Sep 2016 A1
20160321708 Sehn Nov 2016 A1
20160359957 Laliberte Dec 2016 A1
20160359987 Laliberte Dec 2016 A1
20170006094 Abou Mahmoud et al. Jan 2017 A1
20170061308 Chen et al. Mar 2017 A1
20170161382 Ouimet et al. Jun 2017 A1
20170263029 Yan et al. Sep 2017 A1
20170287006 Azmoodeh et al. Oct 2017 A1
20170295250 Samaranayake et al. Oct 2017 A1
20170374003 Allen et al. Dec 2017 A1
20170374508 Davis et al. Dec 2017 A1
20190102396 Pan Apr 2019 A1
Foreign Referenced Citations (38)
Number Date Country
2887596 Jul 2015 CA
2051480 Apr 2009 EP
2151797 Feb 2010 EP
2399928 Sep 2004 GB
19990073076 Oct 1999 KR
20010078417 Aug 2001 KR
WO-1996024213 Aug 1996 WO
WO-1999063453 Dec 1999 WO
WO-2000058882 Oct 2000 WO
WO-2001029642 Apr 2001 WO
WO-2001050703 Jul 2001 WO
WO-2006118755 Nov 2006 WO
WO-2007092668 Aug 2007 WO
WO-2009043020 Apr 2009 WO
WO-2011040821 Apr 2011 WO
WO-2011119407 Sep 2011 WO
WO-2012000107 Jan 2012 WO
WO-2013008238 Jan 2013 WO
WO-2013008251 Jan 2013 WO
WO-2013045753 Apr 2013 WO
WO-2014006129 Jan 2014 WO
WO-2014068573 May 2014 WO
WO-2014115136 Jul 2014 WO
WO-2014194262 Dec 2014 WO
WO-2015192026 Dec 2015 WO
WO-2016044424 Mar 2016 WO
WO-2016054562 Apr 2016 WO
WO-2016065131 Apr 2016 WO
WO-2016100318 Jun 2016 WO
WO-2016100318 Jun 2016 WO
WO-2016100342 Jun 2016 WO
WO-2016112299 Jul 2016 WO
WO-2016149594 Sep 2016 WO
WO-2016179166 Nov 2016 WO
WO-2016179235 Nov 2016 WO
WO-2017176739 Oct 2017 WO
WO-2017176992 Oct 2017 WO
WO-2018005644 Jan 2018 WO
Non-Patent Literature Citations (27)
Entry
“A Whole New Story”, Snap, Inc., URL: https://www.snap.com/en-US/news/, (2017), 13 pgs.
“Adding a watermark to your photos”, eBay, URL: http://pages.ebay.com/help/sell/pictures.html, (accessed May 24, 2017), 4 pgs.
“BlogStomp”, StompSoftware, URL: http://stompsoftware.com/blogstomp, (accessed May 24, 2017), 12 pgs.
“Cup Magic Starbucks Holiday Red Cups come to life with AR app”, Blast Radius, URL: http://www.blastradius.com/work/cup-magic, (2016), 7 pgs.
“Daily App: InstaPlace (iOS/Android): Give Pictures a Sense of Place”, TechPP, URL: http://techpp.com/2013/02/15/instaplace-app-review, (2013), 13 pgs.
“InstaPlace Photo App Tell the Whole Story”, URL: https://youtu.be/uF_gFkg1hBM, (Nov. 8, 2013), 113 pgs.
“International Application Serial No. PCT/US2015/037251, International Search Report dated Sep. 29, 2015”, 2 pgs.
“Introducing Snapchat Stories”, URL: https://www.youtube.com/watch?v=88Cu3yN-LIM, (Oct. 3, 2013), 92 pgs.
“Macy's Believe-o-Magic'”, URL: https://www.youtube.com/watch?v=xvzRXy3J0Z0, (Nov. 7, 2011), 102 pgs.
“Macys Introduces Augmented Reality Experience in Stores across Country as Part of Its 2011 Believe Campaign”, Business Wire, URL: https://www.businesswire.com/news/home/20111102006759/en/Macys-Introduces-Augmented-Reality-Experience-Stores-Country, (Nov. 2, 2011), 6 pgs.
“Starbucks Cup Magic”, URL: https://www.youtube.com/watch?v=RWwQXi9RG0w, (Nov. 8, 2011), 87 pgs.
“Starbucks Cup Magic for Valentine's Day”, URL: https://www.youtube.com/watch?v=8nvqOzjq10w, (Feb. 6, 2012), 88 pgs.
“Starbucks Holiday Red Cups Come to Life, Signaling the Return of the Merriest Season”, Business Wire, URL: http://www.businesswire.com/news/home/20111115005744/en/2479513/Starbucks-Holiday-Red-Cups-Life-Signaling-Return, (Nov. 15, 2011), 5 pgs.
Carthy, Roi, “Dear All Photo Apps: Mobli Just Won Filters”, URL: https://techcrunch.com/2011/09/08/mobli-filters, (Sep. 8, 2011), 10 pgs.
Castelluccia, Claude, et al., “EphPub: Toward robust Ephemeral Publishing”, 19th IEEE International Conference on Network Protocols (ICNP), (Oct. 17, 2011), 18 pgs.
Fajman, “An Extensible Message Format for Message Disposition Notifications”, Request for Comments: 2298, National Institutes of Health, (Mar. 1998), 28 pgs.
Janthong, Isaranu, “Instaplace ready on Android Google Play store”, Android App Review Thailand, URL: http://www.android-free-app-review.com/2013/01/instaplace-android-google-play-store.html, (Jan. 23, 2013), 9 pgs.
Leyden, John, “This SMS will self-destruct in 40 seconds”, URL: http://www.theregister.co.uk/2005/12/12/stealthtext/, (Dec. 12, 2005), 1 pg.
Macleod, Duncan, “Macys Believe-o-Magic App”, URL: http://theinspirationroom.com/daily/2011/macys-believe-o-magic-app, (Nov. 14, 2011), 10 pgs.
Macleod, Duncan, “Starbucks Cup Magic Lets Merry”, URL: http://theinspirationroom.com/daily/2011/starbucks-cup-magic, (Nov. 12, 2011), 8 pgs.
Melanson, Mike, “This text message will self destruct in 60 seconds”, URL: http://readwrite.com/2011/02/11/this_text_message_will_self_destruct_in_60_seconds, (Feb. 18, 2015), 4 pgs.
Notopoulos, Katie, “A Guide to the New Snapchat Filters and Big Fonts”, URL: https://www.buzzfeed.com/katienotopoulos/a-guide-to-the-new-snapchat-filters-and-big-fonts?utm_term=.bkQ9qVZWe#.nv58YXpkV, (Dec. 22, 2013), 13 pgs.
Panzarino, Matthew, “Snapchat Adds Filters, A Replay Function and for Whatever Reason, Time, Temperature and Speed Overlays”, URL: https://techcrunch.com/2013/12/20/snapchat-adds-filters-new-font-and-for-some-reason-time-temperature-and-speed-overlays/, (Dec. 20, 2013), 12 pgs.
Sawers, Paul, “Snapchat for iOS Lets You Send Photos to Friends and Set How long They're Visible for”, URL: https://thenextweb.com/apps/2012/05/07/snapchat-for-ios-lets-you-send-photos-to-friends-and-set-how-long-theyre-visible-for/, (May 7, 2012), 5 pgs.
Shein, Esther, “Ephemeral Data”, Communications of the ACM, vol. 56, No. 9, (Sep. 2013), 20-22.
Tripathi, Rohit, “Watermark Images in PHP and Save File on Server”, URL: http://code.rohitink.com/2012/12/28/watermark-images-in-php-and-save-file-on-server, (Dec. 28, 2012), 4 pgs.
Vaas, Lisa, “StealthText, Should You Choose to Accept It”, URL: http://www.eweek.com/print/c/a/MessagingandCollaboration/StealthTextShouldYouChoosetoAcceptIt, (Dec. 13, 2005), 2 pgs.