Mutable geo-fencing system

Information

  • Patent Grant
  • 11900418
  • Patent Number
    11,900,418
  • Date Filed
    Thursday, March 30, 2017
    7 years ago
  • Date Issued
    Tuesday, February 13, 2024
    2 months ago
Abstract
In various embodiments, boundaries of geo-fences can be made mutable based on principles described herein. The term “mutable” refers to the ability of a thing (in this case, the boundary of a geo-fence) to change and adjust. In a typical embodiment, a mutable geo-fence system is configured to generate and monitor a geo-fence that encompasses a region, in order to dynamically vary the boundary of the geo-fence based on a number of boundary variables. The term “geo-fence” as used herein describes a virtual perimeter (e.g., a boundary) for a real-world geographic area. A geo-fence could be a radius around a point (e.g., a store), or a set of predefined boundaries. Boundary variables, as used herein, refers to a set of variables utilized by the mutable geo-fence system in determining a location of the boundary of the geo-fence.
Description
TECHNICAL FIELD

Embodiments of the present disclosure relate generally to mobile computing technology and, more particularly, but not by way of limitation, to mutable geo-fencing system.


BACKGROUND

Geo-fencing is the practice of using a global positioning system (GPS) or radio frequency identification (RFID) to define a geographic boundary that may encompass a region. Once the virtual boundary is established, an administrator can set triggers to transmit content when devices enter (or exit) the specified region. Advertisers often use geo-fences to distribute marketing campaigns to devices that may enter a particular region.





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.



FIG. 2 is block diagram illustrating various components of a mutable geo-fence system, according to example embodiments.



FIG. 3 is a diagram illustrating a geo-fence generated by a mutable geo-fence system, according to example embodiments.



FIG. 4 is a diagram illustrating a distribution of devices within a geo-fenced area, as determined by a mutable geo-fence system, according to example embodiments.



FIG. 5 is a diagram illustrating a boundary of a geo-fence, adjusted by a mutable geo-fence system, according to example embodiments.



FIG. 6 is a diagram illustrating a boundary of a geo-fence, adjusted by a mutable geo-fence system, according to example embodiments.



FIG. 7 is a flow diagram illustrating an example method for adjusting a boundary of a geo-fence, according to example embodiments.



FIG. 8 is a flow diagram illustrating an example method for calculating a value of a geo-fenced area, according to example embodiments.



FIG. 9 is a block diagram illustrating an example of a software architecture that may be installed on a machine, according to some example embodiments.



FIG. 10 illustrates a diagrammatic representation of a machine in the form of a computer system within which a set of instructions may be executed for causing the machine to perform any one or more of the methodologies discussed herein, according to an example embodiment.





DETAILED DESCRIPTION

In various embodiments, boundaries of geo-fences can be made mutable based on principles described herein. The term “mutable” refers to the ability of a thing (in this case, the boundary of a geo-fence) to change and adjust. In a typical embodiment, a mutable geo-fence system is configured to generate and monitor a geo-fence that encompasses a region, in order to dynamically vary the boundary of the geo-fence based on a number of boundary variables. The term “geo-fence” as used herein describes a virtual perimeter (e.g., a boundary) for a real-world geographic area. A geo-fence could be a radius around a point (e.g., a store), or a set of otherwise-defined boundaries. The real-world geographic area within a given geo-fence will be referenced herein as a geo-fenced area. Boundary variables, as used herein, refers to a set of variables used by the mutable geo-fence system in determining a location of the boundary of the geo-fence.


Geo-fences are often used by advertisers to deliver or enable content to devices that cross over the boundary of the geo-fence, into the geo-fenced area. The content may include a campaign managed by an advertiser to deliver coupons or digital media content (e.g., images, videos, interactive digital information) to devices that enter into or near the geo-fenced area. For example, an advertiser may employ the mutable geo-fence system to configure a geo-fence managed by the mutable geo-fence system to deliver customized media content to devices that enter into a particular geo-fenced area.


For purposes of this disclosure, the mutable geo-fence system may be or include any instrumentality or aggregate of instrumentalities operable to compute, process, store, display, generate, communicate, or apply various forms of data for geo-fencing, control, or other purposes. For example, the mutable geo-fence system may be or include a group of one or more server machines configured to request and receive geo-location data that defines one or more locations of interest, monitor the geo-fenced areas encompassed by the geo-fence (e.g., monitoring locations of devices relative to the geo-fence), and adjust a boundary of the geo-fence based on one or more boundary variables. The boundary variables may include a size and shape of the geo-fence, a distribution of devices within the geo-fence, as well as usage metrics of the geo-fence itself. A location of interest may include one or more real-world locations and events, such as, retail locations, concerts, parties, community events, as well as public locations.


The geo-location data may include a set of coordinates that define a point (e.g., longitude, latitude, and altitude), a polygon or free-form shape that encompasses a region in a map image corresponding to a real-world location, as well as satellite and image data. The mutable geo-fence system generates a geo-fence with a boundary that encompasses a region defined by the geo-location data received. For example, the geo-location data may include coordinates, or an address, of a retail location, and in response to receiving the coordinates, the mutable geo-fence system generates a geo-fence having a radius and boundary that encompasses the retail location. The geo-fence may be circular (e.g., a radius distance and a point defined by latitude and longitude), or a polygon, based on the geo-location data received.


Having generated the geo-fence, the mutable geo-fence system provides access to media content associated with the location of interest encompassed by the boundary of the geo-fence to devices that cross into the geo-fenced area. The media content may include digital images, audio, video and image or media overlays, that a user of a device located within the boundary of the geo-fence may access or append to digital messages (e.g., SMS, email, ephemeral messages). For example, the media content may include visual content, audio content and image or media overlays associated with the location of interest. While the device is located within the geo-fenced area, a user of the device may transmit an ephemeral message that includes the media overlay (e.g., an interactive filter) associated with the location of interest.


The ephemeral message transmitted by the device 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.


An image or media overlay may include audio and visual content and visual effects that may be applied to an image captured or provided by a user of a device. Examples of audio and visual content include pictures, texts, logos, animations, and sound effects. 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 a client device. For example, the media overlay including text that can be overlaid on top of a photograph generated taken by the client device. 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).


The mutable geo-fence system determines a distribution of devices that access the media content associated with the location of interest within the geo-fenced area. In some example embodiments, to determine the distribution, the mutable geo-fence system divides the geo-fenced area into a grid that comprises a set of cells, where each cell represents portions (in some instances the portions are equal) of the physical location within the geo-fenced area, and wherein the set of cells sum to make up the whole physical location encompassed by the geo-fence. The mutable geo-fence system may track and monitor the set of cells to calculate a usage metric of each cell. The usage metric of a cell among the set of cells may be calculated based on: a number of messages transmitted from devices within the cell that include the media content over a predefined period of time; a frequency in which messages that include the media content are transmitted from the cell over a predefined period of time; as well as a number of devices that access (e.g., view or receive) the media content while within the cell over a predefined period of time.


Based on the usage metrics of each cell among the set of cells, the mutable geo-fence system adjusts the boundary of the geo-fence to more accurately encompass the location of interest. For example, the mutable geo-fence system may adjust the boundary to exclude cells among the set of cells that have a usage metric below a predefined threshold value, and to include cells that have a usage metric above the predefined threshold value. In some example embodiments, the mutable geo-fence system may expand the boundary of the geo-fence when the usage metric of cells along a perimeter of the geo-fence are above a threshold value. The threshold value may be calculated based on historical, or average usage metrics associated with the geo-fenced area.


In some example embodiments, the geo-fences generated by the mutable geo-fence system are available to advertisers to deliver content (e.g., a campaign) to devices that cross into the geo-fenced area. For example, the mutable geo-fence system may calculate a value (e.g., price) of the geo-fenced area (or of a cell of the geo-fenced area) based on predicted usage metrics. The predicted usage metrics of the geo-fenced area may be based on: the calculated usage metrics of the set of cells (e.g., as discussed above); a size of the geo-fenced area; a duration of time in which the advertiser wants to use the geo-fence (e.g., one hour, one day, one week); a time period in which the advertiser wants to use the campaign (e.g., March, Saturdays, 2:00 pm-5:00 pm, etc.); as well as information indicating upcoming events (e.g., through a third party API accessed by the mutable geo-fence system).


The mutable geo-fence system may receive campaign information from an advertiser, such as a location of interest to administer the campaign, a duration and time of the campaign, campaign content (e.g., media content), as well as demographics information associated with desired recipients of the campaign. Based on the campaign information and the predicted usage metrics of the corresponding geo-fence, the mutable geo-fence system calculates a value of the geo-fenced area. In some example embodiments, the value is updated in real-time, as the mutable geo-fence system received the campaign information.



FIG. 1 is a network diagram depicting a network system 100 having a client-server architecture configured for exchanging data over a network, according to one embodiment. For example, the network system 100 may be a messaging system where clients communicate and exchange data within the network system 100. The data may pertain to various functions (e.g., sending and receiving text and media communication, determining geolocation, etc.) and aspects associated with the network system 100 and its users. Although illustrated herein as client-server architecture, other embodiments may include other network architectures, such as peer-to-peer or distributed network environments.


As shown in FIG. 1, the network system 100 includes a social messaging system 130. The social messaging system 130 is generally based on a three-tiered architecture, consisting of an interface layer 124, an application logic layer 126, and a data layer 128. As is understood by skilled artisans in the relevant computer and Internet-related arts, each component or engine shown in FIG. 1. represents a set of executable software instructions and the corresponding hardware (e.g., memory and processor) for executing the instructions. To avoid obscuring the inventive subject matter with unnecessary detail, various functional components and engines that are not germane to conveying an understanding of the inventive subject matter have been omitted from FIG. 1. Additional functional components and engines may be used with a social messaging system, such as that illustrated in FIG. 1, to facilitate additional functionality that is not specifically described herein. Furthermore, the various functional components and engines depicted in FIG. 1 may reside on a single server computer, or may be distributed across several server computers in various arrangements. Moreover, although the social messaging system 130 is depicted in FIG. 1 as a three-tiered architecture, the inventive subject matter is by no means limited to such an architecture.


As shown in FIG. 1, the interface layer 124 consists of interface components (e.g., a web server) 140, which receive requests from various client-computing devices and servers, such as client devices 110 executing client applications 112, a mutable geo-fencing system 160, and messaging client applications 170, and third party servers 120 executing third party applications 122. In response to received requests, the interface components 140 communicate appropriate responses to requesting devices via a network 104. For example, the interface components 140 can receive requests such as Hypertext Transfer Protocol (HTTP) requests or other web-based Application Programming Interface (API) requests.


The client devices 110 can execute conventional web browser applications or applications (also referred to as “apps”) that have been developed for a specific platform to include any of a wide variety of mobile computing devices and mobile-specific operating systems (e.g., IOS™ ANDROID™, WINDOWS® PHONE). In an example, the client devices 110 are executing the client applications 112. The client applications 112 can provide functionality to present information to a user 106 and communicate via the network 104 to exchange information with the social messaging system 130. Each of the client devices 110 can comprise a computing device that includes at least a display and communication capabilities with the network 104 to access the social messaging system 130. Users 106 can include a person, a machine, or other means of interacting with the client devices 110. In some embodiments, the users 106 interact with the social messaging system 130 via the client devices 110.


As shown in FIG. 1, the data layer 128 has one or more database servers 132 that facilitate access to information storage repositories or databases 134. The databases 134 are storage devices that store data such as sets of images of external areas generated by client devices 110 and sent to social messaging system 130; sets of façade data generated from images including buildings; map data matching images and façade data to geolocations; and other such data. In one embodiment, a database stores images captured from a street and associates those images with map data. Some implementations of such an embodiment may use filters or image cropping to remove people from the images, such as an embodiment that only stores image data above a height that includes people. Databases 134 may also store data such as member profile data, social graph data (e.g., relationships between members of the social messaging system 130), and other user data.


An individual can register with the social messaging system 130 to become a member of the social messaging system 130. Once registered, a member can form social network relationships (e.g., friends, followers, or contacts) on the social messaging system 130 and interact with a broad range of applications provided by the social messaging system 130.


The application logic layer 126 includes various application logic components 150, which, in conjunction with the interface components 140, generate various user interfaces with data retrieved from various data sources or data services in the data layer 128. Individual application logic components 150 may be used to implement the functionality associated with various applications, services, and features of the social messaging system 130, including aspects of the mutable geo-fence system 160. For instance, a social messaging application can be implemented with one or more of the application logic components 150. The social messaging application provides a messaging mechanism for users of the client devices 110 to send and receive messages that include text and media content such as pictures and video. The client device(s) 110 may access and view the messages from the social messaging application for a specified period of time (e.g., limited or unlimited). In an example, a particular message is accessible to a message recipient for a predefined duration (e.g., specified by a message sender) that begins when the particular message is first accessed. After the predefined duration elapses, the message is deleted and is no longer accessible to the message recipient. Of course, other applications and services may be separately embodied in their own application server component(s) 150.



FIG. 2 is a block diagram illustrating components of the mutable geo-fence system 160 that configure the mutable geo-fence system 160 to receive geo-location data to generate and manage a mutable geo-fence, according to some example embodiments. The mutable geo-fence system 160 is shown as including a communication component 210, a presentation component 220, a geo-fencing component 230, a content delivery component 240, a valuation component 250, and an ephemeral timer module 260, all configured to communicate with each other (e.g., via a bus, shared memory, or a switch). Any one or more of these components may be implemented using one or more processors 270 (e.g., by configuring such one or more processors to perform functions described for that component) and hence may include one or more of the processors 270.



FIG. 3 is a diagram 300 illustrating a geo-fence 310 generated by the mutable geo-fence system 160, according to example embodiments. As discussed above, the geo-fence 310 may comprise a boundary that encompasses a geographic region in a map image 320, wherein the map image 320 represents a real-world geographic region.


To generate the geo-fence 310, the communication module 210 may receive geo-location data that defines a location of interest. For example, a user 106 may provide a user input selecting a particular location of interest through a user interface displayed at a client device 110. The user input may include a selection of a point in the map image 320, or the selection of a search result from among a set of search results, wherein the search results corresponds to a location on the map image 320. The geo-fence module 230 generates the geo-fence 310, wherein a size and a location of the geo-fence 310 is based on the geo-location data.



FIG. 4 is a diagram 400 illustrating a distribution of devices 410 located within a geo-fence 310, within the map image 320, as determined by the mutable geo-fence system 160, according to example embodiments. The distribution of devices 410 may be defined as a physical density of devices within the geo-fence 310. For example, the distribution of device 410 may indicate specification physical locations of devices within the geo-fence 310.


The communication module 210 may monitor usage data of devices located within, or near, the geo-fence 310. The usage data may, for example, include: a number of messages transmitted from devices within the cell that include the media content over a predefined period of time; a frequency in which messages that include the media content are transmitted from the cell over a predefined period of time; as well as a number of devices that access (e.g., view or receive) the media content while within the cell over a predefined period of time. Based on the usage data, the geo-fence module 230 may determine the distribution of devices 410.


The usage metric of a cell among the set of cells may be calculated based on: a number of messages transmitted from devices within the cell that include the media content over a predefined period of time; a frequency in which messages that include the media content are transmitted from the cell over a predefined period of time; as well as a number of devices that access (e.g., view or receive) the media content while within the cell over a predefined period of time.



FIG. 5 is a diagram 500 illustrating a boundary 510 of the geo-fence 310 of FIGS. 3 and 4, adjusted by the mutable geo-fence system 160, based on the distribution of devices 410, according to example method discussed herein. The geo-fence module 230 may receive the usage data to determine the distribution of devices 410, and in response, adjust the boundary of the geo-fence 310 to more accurately target devices within the geo-fences area. Although FIG. 5 depicts one enclosure formed by the mutated geo-fence, in other example embodiments, the geo-fence module 230 adjust the boundary of the geo-fence 310 such that there are multiple independent geo-fence.



FIG. 6 is a diagram 600 illustrating a boundary 610 of the geo-fence 310, adjusted by the mutable geo-fence system 160, according to example methods discussed herein. In some example embodiments, the geo-fence module 230 may adjust a boundary of the geo-fence 310, based on usage data collected in real-time. For example, as the communication module 210 collects usage data, the geo-fence module 230 may recalculate a distribution of devices within the geo-fenced area, and adjust the boundary 610 of the geo-fence in real-time.


In some example embodiments, the geo-fence module 230 may vary the boundary 610 of the geo-fence based on time of day. For example, the geo-fence module 230 may maintain the boundary 510 of FIG. 5 for a first period of time, and then maintain the boundary 610 for a second period of time. In some example embodiments, the periods of time may be determined based on the usage data collected by the communication module 210. Although FIGS. 3, 4, 5, and 6 depict two-dimensional geo-fences, the techniques described in this specification can be applied to three-dimensional space with geo-fences defined in three dimensions (e.g., different media content is available at the base of the Empire State Building than at the observation deck).



FIG. 7 is a flow diagram illustrating operations of the mutable geo-fence system 160 in performing an example method 700 for adjusting a boundary of a geo-fence, according to example embodiments. As shown in FIG. 7, one or more operations 702, 704, 706, 708, 710, and 712 may be performed as part (e.g., a precursor task, a subroutine, or a portion) of the method 700, according to some example embodiments.


Operation 702 may be performed by the communication module 210. At operation 702, the communication module 210 receives geo-location data indicating a location of interest. As discussed above with respect to FIG. 3, a user 106 may provide user inputs identifying or otherwise selecting a particular location of interest through a user interface displayed at a client device 110. The user input may include a selection of a point in the map image 320, or the selection of a search result from among a set of search results, wherein the search results corresponds to a location on the map image 320. The geo-fence module 230 generates the geo-fence 310, wherein a size and a location of the geo-fence 310 is based on the geo-location data.


Operation 704 may be performed by the geo-fence module 230. At operation 704, the geo-fence module 230 generates a geo-fence that encompasses a first region that includes the region of interest, based on the geo-location data received by the communication module 210. The geo-fence generated by the geo-fence module 230 may have a corresponding size and location based on the geo-location data.


The geo-fence generated by the geo-fence module 230 may initially be over-inclusive, to capture a large region that encompasses the region of interest identified by the geo-location data. The geo-fence may be a radius around a point (e.g., the location of interest), or a set of otherwise-defined boundaries.


Operation 706 may be performed by the geo-fence module 230. At operation 706, the geo-fence module 230 divides the region encompassed by the geo-fence into a set of cells (e.g., a grid), wherein each cell among the set of cells represents a portion of the region within the geo-fence. For example, the number of cells within the region may be defined based on a size of the geo-fence, or based on user input.


Operation 708 may be performed by the communication module 210. At operation 708, the communication module 210 collects usage data from devices located within the geo-fenced area. The usage data may include corresponding geo-location data indicating a cell from among the set of cells in which the usage data originated (i.e., indicating a location of a device within the geo-fenced area). The communication module 210 may identify usage data associated with the location of interest, from among the usage data collected. For example, the communication module 210 may identify the usage data associated with the location of interest based on the message including media content associated with the location of interest encompassed by the geo-fence. For example, the usage data may include a message from a first client device located within a cell within the location of interest, wherein the message includes media content identifying the location of interest (e.g., a photo, a filter).


Operation 710 may be performed by the geo-fence module 230. At operation 710 the geo-fence module 220 calculates a usage metric based on the usage data associated with the location of interest. The usage data may for example include: a number of messages transmitted from devices within the cell that include the media content over a predefined period of time; a frequency in which messages that include the media content are transmitted from the cell over a predefined period of time; as well as a number of devices that access (e.g., view or receive) the media content while within the cell over a predefined period of time. Based on the usage data, and geo-location data indicating a cell in which a source device of the usage data is located within the geo-fence, the geo-fence module 230 may determine a distribution of devices within the geo-fenced area.


Operation 710 may be performed by the geo-fence module 230. Based on the usage data, the geo-fence module 230 calculates and assigns a usage metric to each cell among the set of cells within the region encompassed by the geo-fence. At operation 712, the geo-fence module 230 adjusts a boundary of the geo-fence based on the usage metrics of each cell among the set of cells. In some example embodiments, the geo-fence module 230 adjusts the boundary of the geo-fence based on a constraint. For example, the geo-fence module 230 may adjust the geo-fence such that it does not extend outside of the first region or extends a predetermined distance outside of the first region to prevent unintended drifting or shifts in the mutated geo-fence over time.



FIG. 8 is a flow diagram illustrating operations of the mutable geo-fence system 160 in performing an example method 800 for calculating a value of a geo-fenced area, according to example embodiments. As shown in FIG. 8, one or more operations 802, 804, 806, and 808 may be performed as part (e.g., a precursor task, a subroutine, or a portion) of the method 800, according to some example embodiments.


Operation 802 may be performed by the geo-fence module 230. At operation 802, the geo-fence module 230 calculates a usage metric of a geo-fence based on at least the usage metric of one or more cells within the geo-fence and the size and shape of the geo-fence.


For example, as discussed above with respect to FIG. 7, the communication module 210 collects usage data from devices located within the one or more cells comprising and within the geo-fence. The usage data may for example include: a number of messages transmitted from devices within the cell that include the media content over a predefined period of time; a frequency in which messages that include the media content are transmitted from the cell over a predefined period of time; access requests for media content; the type of media content being access by devices within the geo-fence and/or each cell of the geo-fence; as well as a number of devices that access (e.g., view or receive) the media content while within the cell over a predefined period of time. The geo-fence module 230 calculates a predicted usage metric of the geo-fence based on the usage data from each of the one or more cells, and the size and shape of the geo-fence.


Operation 804 may be performed by the communication module 210. At operation 210, the communication module 210 receives campaign information from a third party server 120, or a client device 110 associated with an advertiser. The campaign information may include a specification of a media content type, a duration of a campaign, as well as indications of a target audience of the campaign.


Operations 806 and 808 may be performed by the geo-fence module 230. At operation 806, the geo-fence module 230 calculates a value of the geo-fence based on the campaign information and the predicted usage metric, and at operation 808, assigns the value to the geo-fence. The value may include a fixed value over a predefined period of time (e.g., per day, per hour), or in some example embodiments may be based on a number of deliveries of media content to devices located within the geo-fence (e.g., value per 100 devices, value per device).



FIG. 9 is a block diagram 900 illustrating an architecture of software 902, which can be installed on any one or more of the devices described above. FIG. 9 is merely a non-limiting example of a software architecture, and it will be appreciated that many other architectures can be implemented to facilitate the functionality described herein. In various embodiments, the software 902 is implemented by hardware such as machine 1000 of FIG. 10 that includes processors 1010, memory 1030, and I/O components 1050. In this example architecture, the software 902 can be conceptualized as a stack of layers where each layer may provide a particular functionality. For example, the software 902 includes layers such as an operating system 904, libraries 906, frameworks 908, and applications 910. Operationally, the applications 910 invoke application programming interface (API) calls 912 through the software stack and receive messages 914 in response to the API calls 912, consistent with some embodiments.


In various implementations, the operating system 904 manages hardware resources and provides common services. The operating system 904 includes, for example, a kernel 920, services 922, and drivers 924. The kernel 920 acts as an abstraction layer between the hardware and the other software layers consistent with some embodiments. For example, the kernel 920 provides memory management, processor management (e.g., scheduling), component management, networking, and security settings, among other functionality. The services 922 can provide other common services for the other software layers. The drivers 924 are responsible for controlling or interfacing with the underlying hardware, according to some embodiments. For instance, the drivers 924 can 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.


In some embodiments, the libraries 906 provide a low-level common infrastructure utilized by the applications 910. The libraries 906 can include system libraries 930 (e.g., C standard library) that can provide functions such as memory allocation functions, string manipulation functions, mathematic functions, and the like. In addition, the libraries 906 can include API libraries 932 such as media libraries (e.g., libraries to support presentation and manipulation of various media formats such as Moving Picture Experts Group-4 (MPEG4), Advanced Video Coding (H.264 or AVC), Moving Picture Experts Group Layer-3 (MP3), Advanced Audio Coding (AAC), Adaptive Multi-Rate (AMR) audio codec, Joint Photographic Experts Group (JPEG or JPG), or Portable Network Graphics (PNG)), graphics libraries (e.g., an OpenGL framework used to render in two dimensions (2D) and three dimensions (3D) in a graphic content on a display), database libraries (e.g., SQLite to provide various relational database functions), web libraries (e.g., WebKit to provide web browsing functionality), and the like. The libraries 906 can also include a wide variety of other libraries 934 to provide many other APIs to the applications 910.


The frameworks 908 provide a high-level common infrastructure that can be utilized by the applications 910, according to some embodiments. For example, the frameworks 908 provide various graphic user interface (GUI) functions, high-level resource management, high-level location services, and so forth. The frameworks 908 can provide a broad spectrum of other APIs that can be utilized by the applications 910, some of which may be specific to a particular operating system or platform.


In an example embodiment, the applications 910 include a home application 950, a contacts application 952, a browser application 954, a book reader application 956, a location application 958, a media application 960, a messaging application 962, a game application 964, and a broad assortment of other applications such as a third party application 966. According to some embodiments, the applications 910 are programs that execute functions defined in the programs. Various programming languages can be employed to create one or more of the applications 910, structured in a variety of manners, such as object-oriented programming languages (e.g., Objective-C, Java, or C++) or procedural programming languages (e.g., C or assembly language). In a specific example, the third party application 966 (e.g., an application developed using the ANDROID™ or IOS™ software development kit (SDK) by an entity other than the vendor of the particular platform) may be mobile software running on a mobile operating system such as IOS™, ANDROID™, WINDOWS® Phone, or another mobile operating systems. In this example, the third party application 966 can invoke the API calls 912 provided by the operating system 904 to facilitate functionality described herein.



FIG. 10 is a block diagram illustrating components of a machine 1000, according to some 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. 10 shows a diagrammatic representation of the machine 1000 in the example form of a computer system, within which instructions 1016 (e.g., software, a program, an application, an applet, an app, or other executable code) for causing the machine 1000 to perform any one or more of the methodologies discussed herein can be executed. In alternative embodiments, the machine 1000 operates as a standalone device or can be coupled (e.g., networked) to other machines. In a networked deployment, the machine 1000 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 1000 can 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 1016, sequentially or otherwise, that specify actions to be taken by the machine 1000. Further, while only a single machine 1000 is illustrated, the term “machine” shall also be taken to include a collection of machines 1000 that individually or jointly execute the instructions 1016 to perform any one or more of the methodologies discussed herein.


In various embodiments, the machine 1000 comprises processors 1010, memory 1030, and I/O components 1050, which can be configured to communicate with each other via a bus 1002. In an example embodiment, the processors 1010 (e.g., 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), another processor, or any suitable combination thereof) includes, for example, a processor 1012 and a processor 1014 that may execute the instructions 1016. The term “processor” is intended to include multi-core processors that may comprise two or more independent processors (also referred to as “cores”) that can execute instructions contemporaneously. Although FIG. 10 shows multiple processors, the machine 1000 may include a single processor with a single core, a single processor with multiple cores (e.g., a multi-core processor), multiple processors with a single core, multiple processors with multiples cores, or any combination thereof.


The memory 1030 comprises a main memory 1032, a static memory 1034, and a storage unit 1036 accessible to the processors 1010 via the bus 1002, according to some embodiments. The storage unit 1036 can include a machine-readable medium 1038 on which are stored the instructions 1016 embodying any one or more of the methodologies or functions described herein. The instructions 1016 can also reside, completely or at least partially, within the main memory 1032, within the static memory 1034, within at least one of the processors 1010 (e.g., within the processor's cache memory), or any suitable combination thereof, during execution thereof by the machine 1000. Accordingly, in various embodiments, the main memory 1032, the static memory 1034, and the processors 1010 are considered machine-readable media 1038.


As used herein, the term “memory” refers to a machine-readable medium 1038 able to store data temporarily or permanently and may be taken to include, but not be limited to, random-access memory (RAM), read-only memory (ROM), buffer memory, flash memory, and cache memory. While the machine-readable medium 1038 is shown in an example embodiment to be a single medium, 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 the instructions 1016. 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., instructions 1016) for execution by a machine (e.g., machine 1000), such that the instructions, when executed by one or more processors of the machine 1000 (e.g., processors 1010), cause the machine 1000 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” shall accordingly be taken to include, but not be limited to, one or more data repositories in the form of a solid-state memory (e.g., flash memory), an optical medium, a magnetic medium, other non-volatile memory (e.g., Erasable Programmable Read-Only Memory (EPROM)), or any suitable combination thereof. The term “machine-readable medium” specifically excludes non-statutory signals per se.


The I/O components 1050 include a wide variety of components to receive input, provide output, produce output, transmit information, exchange information, capture measurements, and so on. In general, it will be appreciated that the I/O components 1050 can include many other components that are not shown in FIG. 10. The I/O components 1050 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 1050 include output components 1052 and input components 1054. The output components 1052 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), other signal generators, and so forth. The input components 1054 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 instruments), tactile input components (e.g., a physical button, a touch screen that provides location and force of touches or touch gestures, or other tactile input components), audio input components (e.g., a microphone), and the like.


In some further example embodiments, the I/O components 1050 include biometric components 1056, motion components 1058, environmental components 1060, or position components 1062, among a wide array of other components. For example, the biometric components 1056 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 1058 include acceleration sensor components (e.g., accelerometer), gravitation sensor components, rotation sensor components (e.g., gyroscope), and so forth. The environmental components 1060 include, for example, illumination sensor components (e.g., photometer), temperature sensor components (e.g., one or more thermometers 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 sensor components (e.g., machine olfaction detection sensors, gas detection sensors to detect 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 1062 include location sensor components (e.g., a Global Positioning 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 can be implemented using a wide variety of technologies. The I/O components 1050 may include communication components 1064 operable to couple the machine 1000 to a network 1080 or devices 1070 via a coupling 1082 and a coupling 1072, respectively. For example, the communication components 1064 include a network interface component or another suitable device to interface with the network 1080. In further examples, communication components 1064 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 1070 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, in some embodiments, the communication components 1064 detect identifiers or include components operable to detect identifiers. For example, the communication components 1064 include Radio Frequency Identification (RFID) tag reader components, NFC smart tag detection components, optical reader components (e.g., an optical sensor to detect a one-dimensional bar codes such as a Universal Product Code (UPC) bar code, multi-dimensional bar codes such as a Quick Response (QR) code, Aztec Code, Data Matrix, Dataglyph, MaxiCode, PDF417, Ultra Code, Uniform Commercial Code Reduced Space Symbology (UCC RSS)-2D bar codes, and other optical codes), acoustic detection components (e.g., microphones to identify tagged audio signals), or any suitable combination thereof. In addition, a variety of information can be derived via the communication components 1064, such as location via Internet Protocol (IP) geo-location, location via WI-FI® signal triangulation, location via detecting an BLUETOOTH® or NFC beacon signal that may indicate a particular location, and so forth.


In various example embodiments, one or more portions of the network 1080 can 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, the network 1080 or a portion of the network 1080 may include a wireless or cellular network, and the coupling 1082 may be a Code Division Multiple Access (CDMA) connection, a Global System for Mobile communications (GSM) connection, or another type of cellular or wireless coupling. In this example, the coupling 1082 can 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.


In example embodiments, the instructions 1016 are transmitted or received over the network 1080 using a transmission medium via a network interface device (e.g., a network interface component included in the communication components 1064) and utilizing any one of a number of well-known transfer protocols (e.g., Hypertext Transfer Protocol (HTTP)). Similarly, in other example embodiments, the instructions 1016 are transmitted or received using a transmission medium via the coupling 1072 (e.g., a peer-to-peer coupling) to the devices 1070. The term “transmission medium” shall be taken to include any intangible medium that is capable of storing, encoding, or carrying the instructions 1016 for execution by the machine 1000, and includes digital or analog communications signals or other intangible media to facilitate communication of such software.


Furthermore, the machine-readable medium 1038 is non-transitory (in other words, not having any transitory signals) in that it does not embody a propagating signal. However, labeling the machine-readable medium 1038 “non-transitory” should not be construed to mean that the medium is incapable of movement; the medium should be considered as being transportable from one physical location to another. Additionally, since the machine-readable medium 1038 is tangible, the medium may be considered to be a machine-readable device.


Throughout this specification, plural instances may implement components, operations, or structures described as a single instance. Although individual operations of one or more methods are illustrated and described as separate operations, one or more of the individual operations may be performed concurrently, and nothing requires that the operations be performed in the order illustrated. Structures and functionality presented as separate components in example configurations may be implemented as a combined structure or component. Similarly, structures and functionality presented as a single component may be implemented as separate components. These and other variations, modifications, additions, and improvements fall within the scope of the subject matter herein.


Although an overview of the inventive subject matter has been described with reference to specific example embodiments, various modifications and changes may be made to these embodiments without departing from the broader scope of embodiments of the present disclosure. Such embodiments of the inventive subject matter may be referred to herein, individually or collectively, by the term “invention” merely for convenience and without intending to voluntarily limit the scope of this application to any single disclosure or inventive concept if more than one is, in fact, disclosed.


The embodiments illustrated herein are described in sufficient detail to enable those skilled in the art to practice the teachings disclosed. Other embodiments may be used and derived therefrom, such that structural and logical substitutions and changes may be made without departing from the scope of this disclosure. The Detailed Description, therefore, is not to be taken in a limiting sense, and the scope of various embodiments is defined only by the appended claims, along with the full range of equivalents to which such claims are entitled.


As used herein, the term “or” may be construed in either an inclusive or exclusive sense. Moreover, plural instances may be provided for resources, operations, or structures described herein as a single instance. Additionally, boundaries between various resources, operations, components, engines, and data stores are somewhat arbitrary, and particular operations are illustrated in a context of specific illustrative configurations. Other allocations of functionality are envisioned and may fall within a scope of various embodiments of the present disclosure. In general, structures and functionality presented as separate resources in the example configurations may be implemented as a combined structure or resource. Similarly, structures and functionality presented as a single resource may be implemented as separate resources. These and other variations, modifications, additions, and improvements fall within a scope of embodiments of the present disclosure as represented by the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.


A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever. The following notice applies to the software and data as described below and in the drawings that form a part of this document: Copyright 2016, SNAPCHAT, INC., All Rights Reserved.


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.

Claims
  • 1. A computer-implemented method comprising: causing display of a presentation of a set of search results;receiving an input that selects a search result from among the set of search results, the search result corresponding with a location of interest;generating, by one or more processors, a geo-fence based on the location of interest that corresponds with the selected search result, the geo-fence comprising a boundary that encompasses a region that includes the location of interest;dividing the region encompassed by the geo-fence into a set of cells, each cell among the set of cells representing an equal portion of the region, wherein a quantity of the set of cells is based on a size of the geo-fence;detecting, by one or more processors, a plurality of requests to access media content associated with the geo-fence from one or more devices located within the region encompassed by the geo-fence;determining a distribution of a subset of the one or more devices located within a cell from among the one or more cells based on a portion of the plurality of requests to access the media content associated with the geo-fence over a predefined period of time;calculating a usage metric of the cell based on the distribution of the subset of the one or more devices over the predefined period of time;determining that the usage metric of the cell is below a threshold value; andadjusting the boundary of the geo-fence to exclude the cell based on the usage metric associated with the cell being below the threshold value.
  • 2. The computer-implemented method of claim 1, further comprising: calculating a predicted usage metric of the geo-fence based on at least the usage metric of the cell, and a size of the geo-fence;receive campaign information that includes a duration and media content;calculating a value of the geo-fence based on the campaign information and the predicted usage metric; andassigning the value to the geo-fence.
  • 3. The computer-implemented method of claim 2, wherein the value of the geo-fence includes a value per period of time, wherein the period of time is determined based on the predicted usage metric.
  • 4. The computer-implemented method of claim 2, wherein the value of the geo-fence includes a value per device that is exposed to a campaign defined by the campaign information.
  • 5. The computer-implemented method of claim 1, wherein the media content identifies the location of interest.
  • 6. The computer-implemented method of claim 1, wherein the media content includes image data, audio data, and video data.
  • 7. The computer-implemented method of claim 1, wherein the message includes an ephemeral message.
  • 8. A system comprising: a memory; andat least one hardware processor couple to the memory and comprising instructions that cause the system to perform operations comprising:causing display of a presentation of a set of search results;receiving an input that selects a search result from among the set of search results, the search result corresponding with a location of interest;generating, by one or more processors, a geo-fence based on the location of interest that corresponds with the selected search result, the geo-fence comprising a boundary that encompasses a region that includes the location of interest;dividing the region encompassed by the geo-fence into a set of cells, each cell among the set of cells representing an equal portion of the region, wherein a quantity of the set of cells is based on a size of the geo-fence;detecting, by one or more processors, a plurality of requests to access media content associated with the geo-fence from one or more devices located within the region encompassed by the geo-fence;determining a distribution of a subset of the one or more devices located within a cell from among the one or more cells based on a portion of the plurality of requests to access the media content associated with the geo-fence over a predefined period of time;calculating a usage metric of the cell based on the distribution of the subset of the one or more devices over the predefined period of time;determining that the usage metric of the cell is below a threshold value; andadjusting the boundary of the geo-fence to exclude the cell based on the usage metric associated with the cell being below the threshold value.
  • 9. The system of claim 8, wherein the instructions cause the system to perform operations further comprising: calculating a predicted usage metric of the geo-fence based on at least the usage metric of the cell, and a size of the geo-fence;receive campaign information that includes a duration and media content;calculating a value of the geo-fence based on the campaign information and the predicted usage metric; andassigning the value to the geo-fence.
  • 10. The system of claim 9, wherein the value of the geo-fence includes a value per period of time, wherein the period of time is determined based on the predicted usage metric.
  • 11. The system of claim 9, wherein the value of the geo-fence includes a value per device that is exposed to a campaign defined by the campaign information.
  • 12. The system of claim 8, wherein the media content identifies the location of interest.
  • 13. The system of claim 8, wherein the media content includes image data, audio data, and video data.
  • 14. The system of claim 8, wherein the message includes an ephemeral message.
  • 15. 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 including: causing display of a presentation of a set of search results;receiving an input that selects a search result from among the set of search results, the search result corresponding with a location of interest;generating, by one or more processors, a geo-fence based on the location of interest that corresponds with the selected search result, the geo-fence comprising a boundary that encompasses a region that includes the location of interest;dividing the region encompassed by the geo-fence into a set of cells, each cell among the set of cells representing an equal portion of the region, wherein a quantity of the set of cells is based on a size of the geo-fence;detecting, by one or more processors, a plurality of requests to access media content associated with the geo-fence from one or more devices located within the region encompassed by the geo-fence;determining a distribution of a subset of the one or more devices located within a cell from among the one or more cells based on a portion of the plurality of requests to access the media content associated with the geo-fence over a predefined period of time;calculating a usage metric of the cell based on the distribution of the subset of the one or more devices over the predefined period of time;determining that the usage metric of the cell is below a threshold value; andadjusting the boundary of the geo-fence to exclude the cell based on the usage metric associated with the cell being below the threshold value.
  • 16. The non-transitory machine-readable storage medium of claim 15, further comprising instructions that cause the machine to perform operations further comprising: calculating a predicted usage metric of the geo-fence based on at least the usage metric of the cell, and a size of the geo-fence;receive campaign information that includes a duration and media content;calculating a value of the geo-fence based on the campaign information and the predicted usage metric; andassigning the value to the geo-fence.
  • 17. The non-transitory machine-readable storage medium of claim 16, wherein the value of the geo-fence includes a value per period of time, wherein the period of time is determined based on the predicted usage metric.
  • 18. The non-transitory machine-readable storage medium of claim 16, wherein the value of the geo-fence includes a value per device that is exposed to a campaign defined by the campaign information.
  • 19. The non-transitory machine-readable storage medium of claim 15, wherein the media content identifies the location of interest.
  • 20. The non-transitory machine-readable storage medium of claim 15, wherein the media content includes image data, audio data, and video data.
RELATED APPLICATIONS

This application claims benefit of priority from U.S. Provisional Patent Application Ser. No. 62/318,049, filed on Apr. 4, 2016, which is hereby incorporated by reference in its entirety.

US Referenced Citations (237)
Number Name Date Kind
5999932 Paul Dec 1999 A
6038295 Mattes Mar 2000 A
6154764 Nitta et al. Nov 2000 A
6167435 Druckenmiller et al. Dec 2000 A
6204840 Petelycky et al. Mar 2001 B1
6216141 Straub et al. Apr 2001 B1
6310694 Okimoto et al. Oct 2001 B1
6484196 Maurille Nov 2002 B1
6665531 Soderbacka et al. Dec 2003 B1
6724403 Santoro et al. Apr 2004 B1
6757713 Ogilvie et al. Jun 2004 B1
6898626 Ohashi May 2005 B2
6980909 Root et al. Dec 2005 B2
7124164 Chemtob Oct 2006 B1
7149893 Leonard et al. Dec 2006 B1
7173651 Knowles Feb 2007 B1
7203380 Chiu et al. Apr 2007 B2
7356564 Hartselle et al. Apr 2008 B2
7411493 Smith Aug 2008 B2
7519670 Hagale et al. Apr 2009 B2
7535890 Rojas May 2009 B2
8001204 Burtner et al. Aug 2011 B2
8098904 Ioffe et al. Jan 2012 B2
8112716 Kobayashi Feb 2012 B2
8131597 Hudetz Mar 2012 B2
8135166 Rhoads Mar 2012 B2
8199747 Rojas et al. Jun 2012 B2
8229473 De La Rue Jul 2012 B1
8276092 Narayanan et al. Sep 2012 B1
8279319 Date Oct 2012 B2
8312086 Velusamy et al. Nov 2012 B2
8312097 Siegel et al. Nov 2012 B1
8332475 Rosen et al. Dec 2012 B2
8379130 Forutanpour et al. Feb 2013 B2
8405773 Hayashi et al. Mar 2013 B2
8418067 Cheng et al. Apr 2013 B2
8471914 Sakiyama et al. Jun 2013 B2
8560612 Kilmer et al. Oct 2013 B2
8688519 Lin Apr 2014 B1
8718333 Wolf et al. May 2014 B2
8724622 Rojas May 2014 B2
8744523 Fan et al. Jun 2014 B2
8775972 Spiegel Jul 2014 B2
8788680 Naik Jul 2014 B1
8797415 Arnold Aug 2014 B2
8856349 Jain et al. Oct 2014 B2
8874677 Rosen et al. Oct 2014 B2
8909679 Root et al. Dec 2014 B2
8995433 Rojas Mar 2015 B2
9040574 Wang et al. May 2015 B2
9055416 Rosen et al. Jun 2015 B2
9100806 Rosen et al. Aug 2015 B2
9100807 Rosen et al. Aug 2015 B2
9191776 Root et al. Nov 2015 B2
9204252 Root Dec 2015 B2
9225897 Sehn et al. Dec 2015 B1
9443227 Evans et al. Sep 2016 B2
9489661 Evans et al. Nov 2016 B2
9491134 Rosen et al. Nov 2016 B2
9635500 Becker Apr 2017 B1
9641972 Hughes May 2017 B1
11216869 Allen Jan 2022 B2
20020047868 Miyazawa Apr 2002 A1
20020122659 Mcgrath et al. Sep 2002 A1
20020144154 Tomkow Oct 2002 A1
20030016247 Lai et al. Jan 2003 A1
20030052925 Daimon et al. Mar 2003 A1
20030126215 Udell Jul 2003 A1
20030164856 Prager et al. Sep 2003 A1
20040027371 Jaeger Feb 2004 A1
20040111467 Willis Jun 2004 A1
20040203959 Coombes Oct 2004 A1
20040243531 Dean Dec 2004 A1
20050078804 Yomoda Apr 2005 A1
20050097176 Schatz et al. May 2005 A1
20050104976 Currans May 2005 A1
20050114783 Szeto May 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
20060026067 Nicholas et al. Feb 2006 A1
20060114338 Rothschild Jun 2006 A1
20060270419 Crowley et al. Nov 2006 A1
20070040931 Nishizawa Feb 2007 A1
20070073823 Cohen et al. Mar 2007 A1
20070082707 Flynt et al. Apr 2007 A1
20070192128 Celestini Aug 2007 A1
20070214216 Carrer et al. Sep 2007 A1
20070233801 Eren et al. Oct 2007 A1
20070243887 Bandhole et al. Oct 2007 A1
20070255456 Funayama Nov 2007 A1
20080025701 Ikeda Jan 2008 A1
20080033930 Warren Feb 2008 A1
20080104503 Beall et al. May 2008 A1
20080207176 Brackbill et al. Aug 2008 A1
20080222545 Lemay Sep 2008 A1
20080256446 Yamamoto Oct 2008 A1
20080266421 Takahata et al. Oct 2008 A1
20080270938 Carlson Oct 2008 A1
20080313346 Kujawa et al. Dec 2008 A1
20090006565 Velusamy et al. Jan 2009 A1
20090015703 Kim et al. Jan 2009 A1
20090024956 Kobayashi 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
20090132453 Hangartner et al. May 2009 A1
20090132665 Thomsen et al. May 2009 A1
20090153492 Popp Jun 2009 A1
20090160970 Fredlund et al. Jun 2009 A1
20090265647 Martin et al. Oct 2009 A1
20090292608 Polachek Nov 2009 A1
20100082693 Hugg et al. Apr 2010 A1
20100131880 Lee et al. May 2010 A1
20100131895 Wohlert May 2010 A1
20100159944 Pascal et al. Jun 2010 A1
20100161831 Haas et al. Jun 2010 A1
20100185665 Horn et al. Jul 2010 A1
20100214436 Kim et al. Aug 2010 A1
20100223128 Dukellis et al. Sep 2010 A1
20100223343 Bosan et al. Sep 2010 A1
20100257196 Waters et al. Oct 2010 A1
20100281045 Dean Nov 2010 A1
20100306669 Della Pasqua Dec 2010 A1
20110004071 Faiola et al. Jan 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
20110102630 Rukes Jun 2011 A1
20110145564 Moshir et al. Jun 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
20110273575 Lee Nov 2011 A1
20110283188 Farrenkopf Nov 2011 A1
20110320373 Lee et al. Dec 2011 A1
20120150978 Monaco Jan 2012 A1
20120028659 Whitney et al. Feb 2012 A1
20120036015 Sheikh Feb 2012 A1
20120062805 Candelore Mar 2012 A1
20120099800 Llano et al. Apr 2012 A1
20120108293 Law et al. May 2012 A1
20120110096 Smarr et al. May 2012 A1
20120113272 Hata May 2012 A1
20120131507 Sparandara et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120143760 Abulafia et al. Jun 2012 A1
20120166971 Sachson et al. Jun 2012 A1
20120169855 Oh 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
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
20120233000 Fisher et al. Sep 2012 A1
20120236162 Imamura Sep 2012 A1
20120239761 Linner et al. Sep 2012 A1
20120250951 Chen Oct 2012 A1
20120278387 Garcia et al. Nov 2012 A1
20120278692 Shi Nov 2012 A1
20120299954 Wada et al. Nov 2012 A1
20120302259 Busch Nov 2012 A1
20120304080 Wormald et al. Nov 2012 A1
20120307096 Bray et al. Dec 2012 A1
20120307112 Kunishige et al. Dec 2012 A1
20120323933 He et al. Dec 2012 A1
20130023284 Stanger Jan 2013 A1
20130050260 Reitan 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
20130128059 Kristensson May 2013 A1
20130145286 Feng et al. 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
20130194301 Robbins 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
20130290443 Collins et al. Oct 2013 A1
20130311255 Cummins et al. Nov 2013 A1
20130344896 Kirmse et al. Dec 2013 A1
20130346877 Borovoy et al. Dec 2013 A1
20140011538 Mulcahy et al. Jan 2014 A1
20140032682 Prado et al. Jan 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
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
20140164118 Polachi Jun 2014 A1
20140173457 Wang et al. Jun 2014 A1
20140189592 Benchenaa et al. Jul 2014 A1
20140207679 Cho Jul 2014 A1
20140214471 Schreiner, III Jul 2014 A1
20140279436 Dorsey et al. Sep 2014 A1
20140280537 Pridmore et al. Sep 2014 A1
20140282096 Rubinstein et al. Sep 2014 A1
20140317302 Naik Oct 2014 A1
20140325383 Brown et al. Oct 2014 A1
20150046278 Pei et al. Feb 2015 A1
20150116529 Wu et al. Apr 2015 A1
20150172534 Miyakawa et al. Jun 2015 A1
20150222814 Li et al. Aug 2015 A1
20150287072 Golden Oct 2015 A1
20150341747 Barrand Nov 2015 A1
20160006927 Sehn Jan 2016 A1
20160085863 Allen et al. Mar 2016 A1
20160321765 Malone Nov 2016 A1
20220237691 Allen et al. Jul 2022 A1
Foreign Referenced Citations (12)
Number Date Country
2887596 Jul 2015 CA
103947229 Jul 2014 CN
104969219 Oct 2015 CN
109247071 Jan 2019 CN
113825091 Dec 2021 CN
20150091381 Aug 2015 KR
102337568 Dec 2021 KR
102466368 Nov 2022 KR
WO-2011119407 Sep 2011 WO
WO-2012000107 Jan 2012 WO
2015085176 Jun 2015 WO
2017176739 Oct 2017 WO
Non-Patent Literature Citations (42)
Entry
WIPO; International Preliminary Report; WO201776739; dated Oct. 9, 2018 (Year: 2018).
WIPO; Search Strategy; WO201776739;dated Oct. 12, 2017 (Year: 2017).
Sandro Rodriguez Garzon, Geofencing 2.0: Taking Location-based Notifications to the Next Level, 2012 (Year: 2012).
“U.S. Appl. No. 14/494,226, Examiner Interview Summary dated Dec. 20, 2017”, 2 pgs.
“U.S. Appl. No. 14/494,226, Response filed Jan. 8, 2018 to Non Final Office Action dated Sep. 7, 2017”, 15 pgs.
“U.S. Appl. No. 14/494,226, Appeal Brief filed Mar. 1, 2019 in response to Final Office Action dated Jun. 1, 2018”, 29 pgs.
“U.S. Appl. No. 14/494,226, Final Office Action dated Jun. 1, 2018”, 33 pgs.
U.S. Appl. No. 14/494,226, filed Sep. 23, 2014, User Interface to Augment an Image Using Geolocation.
“U.S. Appl. No. 14/494,226, Non Final Office Action dated Sep. 7, 2017”, 36 pgs.
“International Application Serial No. PCT US2017 025925, International Preliminary Report on Patentability dated Oct. 18, 2018”, 6 pgs.
“U.S. Appl. No. 14/494,226, Appeal Decision mailed Feb. 26, 2021”, 8 pgs.
“Chinese Application Serial No. 201780034240.5, Office Action dated Feb. 3, 2021”, w/ English Translation, 13 pgs.
“Korean Application Serial No. 10-2021-7004232, Notice of Preliminary Rejection dated Feb. 23, 2021”, w/ English translation, 12 pgs.
“U.S. Appl. No. 14/494,226, Corrected Notice of Allowability dated Sep. 28, 2021”, 2 pgs.
“U.S. Appl. No. 14/494,226, Notice of Allowance dated Jun. 9, 2021”, 7 pgs.
“U.S. Appl. No. 14/494,226, Notice of Allowance dated Aug. 25, 2021”, 5 pgs.
“Chinese Application Serial No. 201780034240.5, Response filed Apr. 14, 2021 to Office Action dated Feb. 3, 2021”, w/ English Claims, 13 pgs.
“Chinese Application Serial No. 201780034240.5, Response filed Jul. 8, 2021 to Office Action”, w/ English Claims, 11 pgs.
“Korean Application Serial No. 10-2021-7004232, Response filed May 24, 2021 to Notice of Preliminary Rejection dated Feb. 23, 2021”, w/ English Claims, 22 pgs.
“Chinese Application Serial No. 201780034240.5, Response filed Oct. 16, 2020 to Office Action dated Jun. 3, 2020”, w/ English Translation, 8 pgs.
“U.S. Appl. No. 14/494,226, Examiner Interview Summary dated Oct. 27, 2016”, 3 pgs.
“U.S. Appl. No. 14/494,226, Final Office Action dated Mar. 7, 2017”, 34 pgs.
“U.S. Appl. No. 14/494,226, Non Final Office Action dated Sep. 12, 2016”, 32 pgs.
“U.S. Appl. No. 14/494,226, Response filed Jul. 7, 2017 to Final Office Action dated Mar. 7, 2017”, 13 pgs.
“U.S. Appl. No. 14/494,226, Response filed Dec. 12, 2016 to Non Final Office Action dated Sep. 12, 2016”, 16 pgs.
“How Snaps Are Stored And Deleted”, Snapchat, [Online]. Retrieved from the Internet: <URL: https://web.archive.org/web/20130607042322/http://blog.snapchat.com/post/50060403002/how-snaps-are-stored-and-deleted, (May 9, 2013), 2 pgs.
“International Application Serial No. PCT/US2014/040346, International Search Report dated Mar. 23, 2015”, 2 pgs.
“International Application Serial No. PCT/US2014/040346, Written Opinion dated Mar. 23, 2015”, 6 pgs.
“International Application Serial No. PCT/US2017/025925, International Search Report dated Jun. 28, 2017”, 2 pgs.
“International Application Serial No. PCT/US2017/025925, Written Opinion dated Jun. 28, 2017”, 4 pgs.
“IVisit Mobile Getting Started”, iVisit, (Dec. 4, 2013), 1-16.
Leyden, John, “This SMS will self-destruct in 40 seconds”, [Online]. Retrieved from the Internet: <URL: http://www.theregister.co.uk/2005/12/12/stealthtext/, (Dec. 12, 2005), 1 pg.
Melanson, Mike, “This text message will self destruct in 60 seconds”, readwrite.com, [Online]. Retrieved from the Internet: <http://readwrite.com/2011/02/11/this_text_message_will_self_destruct_in_60_seconds>, (Feb. 18, 2015).
Sawers, Paul, “Snapchat for iOS Lets You Send Photos to Friends and Set How long They're Visible For”, [Online]. Retrieved from the Internet:. <http:/ /thenextweb.com/apps/2012/05/07/Snapchat-for-ios-lets-you-send-photos-to-friends-and-set-how-long-theyre-visiblefor/#! xCjrp>,, (May 7, 2012), 1-5.
Shein, Esther, “Ephemeral Data”, Communications of the ACM vol. 56 | No. 9, (Sep. 2013), 20-22.
“Korean Application Serial No. 10-2018-7031943, Notice of Preliminary Rejection dated Feb. 11, 2020”, w/ English Translation, 9 pgs.
“Korean Application Serial No. 10-2018-7031943, Response filed Jun. 18, 2020 to Notice of Preliminary Rejection dated Feb. 11, 2020”, w/ English Claims, 20 pgs.
“Chinese Application Serial No. 201780034240.5, Office Action dated Jun. 3, 2020”, w/ English Translation, 13 pgs.
“U.S. Appl. No. 14/494,226, Corrected Notice of Allowability dated Dec. 6, 2021”, 2 pgs.
“Korean Application Serial No. 10-2021-7039934, Notice of Preliminary Rejection dated Jan. 13, 2022”, w/ English Translation, 9 pgs.
“U.S. Appl. No. 17/567,624, Preliminary Amendment filed Sep. 20, 2022”, 7 pgs.
“Korean Application Serial No. 10-2022-7039119, Notice of Preliminary Rejection dated Dec. 7, 2022”, w English translation, 13 pgs.
Related Publications (1)
Number Date Country
20170287006 A1 Oct 2017 US
Provisional Applications (1)
Number Date Country
62318049 Apr 2016 US