Patent application number | Description | Published |
20100145255 | System And Method For Reducing The Appearance Of Fine Lines And Wrinkles And Improving the Skin Tone - The present invention provides a system for rejuvenating the skin, reducing the appearance of fine lines and wrinkles, and improving the skin tone, which includes both a topical composition and a phototherapy device. Specifically, the topical composition contains one or more skin rejuvenating agents selected from the group consisting of creatine, adenosine phosphate, acetyl carnitine, acetyl hexapeptide, and combinations thereof in a pharmaceutically or cosmetically acceptable carrier. The phototherapy device contains one or more light emitting diodes (LEDs) for emitting electromagnetic radiation effective for energizing the skin cells and enhancing skin absorption of the skin rejuvenating agents. More particularly, the topical composition is capable of transmitting at least 80% of the electromagnetic radiation emitted by the phototherapy device to the skin. | 06-10-2010 |
20110212045 | Cosmetic Compositions Containing An Ion Exchange Polymer, And Methods of Using The Same - Topical compositions for reducing the appearance of fine lines and wrinkles on the skin contain one or more ion exchange polymers, in a cosmetically or pharmaceutically acceptable carrier. | 09-01-2011 |
20120111351 | Compositions And Methods For Protecting Hair From Thermal Damage - A hair strengthening topical composition comprising materials that emit electromagnetic radiation at wavelengths that affect tertiary structure (breaking of disulfide) bonds in human hair, and that bring about changes in secondary structure of hair proteins. The intensity of the radiation is controlled and sufficient to cause or facilitate altering of protein structure. The invention includes methods of using such topical compositions. Testing indicates that the hair denaturation thermal energy is increased, and there is no damage to hair of the type characteristic of heat and chemical treatments. | 05-10-2012 |
20120125358 | COMPOSITIONS AND METHODS FOR PERMANENT SHAPING OF HAIR - A hair shaping topical composition comprising materials that emit electromagnetic radiation at wavelengths that affect tertiary structure (breaking of disulfide) bonds in human hair, and that bring about changes in secondary structure of hair proteins. The intensity of the radiation is controlled and sufficient to cause or facilitate altering of protein structure. The invention includes methods of using such topical compositions. Testing indicates that the hair reshaping is permanent and there is no damage to hair of the type characteristic of chemical treatments. | 05-24-2012 |
20140352712 | Compositions And Methods For Permanent Shaping Of Hair - A hair shaping topical composition comprising materials that emit electromagnetic radiation at wavelengths that affect tertiary structure (breaking of disulfide) bonds in human hair, and that bring about changes in secondary structure of hair proteins. The intensity of the radiation is controlled and sufficient to cause or facilitate altering of protein structure. The invention includes methods of using such topical compositions. Testing indicates that the hair reshaping is permanent and there is no damage to hair of the type characteristic of chemical treatments. | 12-04-2014 |
20150068547 | Compositions And Methods For Permanent Shaping Of Hair - A hair shaping topical composition comprising materials that emit electromagnetic radiation at wavelengths that affect tertiary structure (breaking of disulfide) bonds in human hair, and that bring about changes in secondary structure of hair proteins. The intensity of the radiation is controlled and sufficient to cause or facilitate altering of protein structure. The invention includes methods of using such topical compositions. Testing indicates that the hair reshaping is permanent and there is no damage to hair of the type characteristic of chemical treatments. | 03-12-2015 |
Patent application number | Description | Published |
20130024256 | SYSTEM AND METHOD FOR COUPON-LESS PRODUCT LEVEL DISCOUNTS - A product level discount is managed during a transaction by receiving a transaction identifier associated with a transaction, where the transaction identifier comprises a transaction value, a customer account identifier, a merchant identifier, and a product identifier. A product identifier is assessed to determine whether the transaction qualifies for a rebate credit in accordance with a predetermined offer. A rebate credit value is based on the transaction information and the predetermined offer, and qualification may be determined based on at least one of the customer account identifier and the merchant identifier. The product identifier could be a SKU code, which may be the basis for qualifying for the rebate credit. A merchant associated with the merchant identifier, which is part of the transaction, does not need to be informed of the application of the rebate credit to the customer account, which occurs after completion of the transaction. | 01-24-2013 |
20130024259 | SYSTEM AND METHOD FOR COUPON-LESS PRODUCT LEVEL DISCOUNTS - A product level discount is managed during a transaction by receiving a transaction identifier associated with a transaction, where the transaction identifier comprises a transaction value, a customer account identifier, a merchant identifier, and a product identifier. A product identifier is assessed to determine whether the transaction qualifies for a rebate credit in accordance with a predetermined offer. A rebate credit value is based on the transaction information and the predetermined offer, and qualification may be determined based on at least one of the customer account identifier and the merchant identifier. The product identifier could be a SKU code, which may be the basis for qualifying for the rebate credit. A merchant associated with the merchant identifier, which is part of the transaction, does not need to be informed of the application of the rebate credit to the customer account, which occurs after completion of the transaction. | 01-24-2013 |
20150339655 | SYSTEMS AND METHODS FOR DYNAMIC PROXIMITY BASED E-COMMERCE TRANSACTIONS - A method comprises transmitting, by a merchant web-client, a signal using a low energy consuming device, wherein the signal may be received by a transaction account holder web-client, wherein the signal may carry content associated with a merchant, and wherein the merchant is associated with the merchant web-client, and/or receiving, by the merchant web-client, a response from the transaction account holder web-client, wherein the response may be transmitted by the transaction account holder web-client to the merchant web-client using the low energy consuming device. The content may comprise an advertisement associated with an item offered for sale by the merchant. | 11-26-2015 |
Patent application number | Description | Published |
20120042319 | Scheduling Parallel Data Tasks - A method for allocating parallel, independent, data tasks includes receiving data tasks, each of the data tasks having a penalty function, determining a generic ordering of the data tasks according to the penalty functions, wherein the generic ordering includes solving an aggregate objective function of the penalty functions, the method further including determining a schedule of the data tasks given the generic ordering, which packs the data tasks to be performed. | 02-16-2012 |
20120110047 | Reducing the Response Time of Flexible Highly Data Parallel Tasks - A method for scheduling a data processing job includes receiving the data processing job formed of a plurality of computing units, combining the plurality of computing units into a plurality of sets of tasks, each set including tasks of about equal estimated size, and different sets having different sized tasks, and assigning the tasks to a plurality of processors using a dynamic longest processing time (DLPT) scheme. | 05-03-2012 |
20150074681 | SCHEDULING PARALLEL DATA TASKS - A method for allocating parallel, independent, data tasks includes receiving data tasks, each of the data tasks having a penalty function, determining a generic ordering of the data tasks according to the penalty functions, wherein the generic ordering includes solving an aggregate objective function of the penalty functions, the method further including determining a schedule of the data tasks given the generic ordering, which packs the data tasks to be performed. | 03-12-2015 |
Patent application number | Description | Published |
20100325621 | PARTITIONING OPERATOR FLOW GRAPHS - Techniques for partitioning an operator flow graph are provided. The techniques include receiving source code for a steam processing application, wherein the source code comprises an operator flow graph, wherein the operator flow graph comprises a plurality of operators, receiving profiling data associated with the plurality of operators and one or more processing requirements of the operators, defining a candidate partition as a coalescing of one or more of the operators into one or more sets of processing elements (PEs), using the profiling data to create one or more candidate partitions of the processing elements, using the one or more candidate partitions to choose a desired partitioning of the operator flow graph, and compiling the source code into an executable code based on the desired partitioning. | 12-23-2010 |
20110191759 | Interactive Capacity Planning - Techniques for performing capacity planning for applications running on a computational infrastructure are provided. The techniques include instrumenting an application under development to receive one or more performance metrics under a physical deployment plan, receiving the one or more performance metrics from the computational infrastructure hosting one or more applications that are currently running, using a predictive inference engine to determine how the application under development can be deployed, and using the determination to perform capacity planning for the applications on the computational infrastructure. | 08-04-2011 |
20120304186 | Scheduling Mapreduce Jobs in the Presence of Priority Classes - Techniques for scheduling one or more MapReduce jobs in a presence of one or more priority classes are provided. The techniques include obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes, prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class, and iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs. | 11-29-2012 |
20130031558 | Scheduling Mapreduce Jobs in the Presence of Priority Classes - Techniques for scheduling one or more MapReduce jobs in a presence of one or more priority classes are provided. The techniques include obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes, prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class, and iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs. | 01-31-2013 |
20130239100 | Partitioning Operator Flow Graphs - Techniques for partitioning an operator flow graph are provided. The techniques include receiving source code for a stream processing application, wherein the source code comprises an operator flow graph, wherein the operator flow graph comprises a plurality of operators, receiving profiling data associated with the plurality of operators and one or more processing requirements of the operators, defining a candidate partition as a coalescing of one or more of the operators into one or more sets of processing elements (PEs), using the profiling data to create one or more candidate partitions of the processing elements, using the one or more candidate partitions to choose a desired partitioning of the operator flow graph, and compiling the source code into an executable code based on the desired partitioning. | 09-12-2013 |
Patent application number | Description | Published |
20090119238 | METHOD AND SYSTEM FOR PREDICTING RESOURCE USAGE OF REUSABLE STREAM PROCESSING ELEMENTS - A method is provided for generating a resource function estimate of resource usage by an instance of a processing element configured to consume zero or more input data streams in a stream processing system having a set of available resources that comprises receiving at least one specified performance metric for the zero or more input data streams and a processing power of the set of available resources, wherein one specified performance metric is stream rate; generating a multi-part signature of executable-specific information for the processing element and a multi-part signature of context-specific information for the instance; accessing a database of resource functions to identify a static resource function corresponding to the executable-specific information and a context-dependent resource function corresponding to the context-specific information; combining the static resource function and the context-dependent resource function to form a composite resource function for the instance; and applying the resource function to the at least one specified performance metric and the processing power to generate the resource function estimate of the at least one specified performance metric for processing by the instance. | 05-07-2009 |
20090238178 | METHOD, SYSTEM, AND COMPUTER PROGRAM PRODUCT FOR IMPLEMENTING STREAM PROCESSING USING A RECONFIGURABLE OPTICAL SWITCH - A method, system, and computer program product for implementing stream processing are provided. The system includes an application framework and applications containing dataflow graphs managed by the application framework running on a first network. The system also includes at least one circuit switch in the first network having a configuration that is controlled by the application framework, a plurality of processing nodes interconnected by the first network over one of wireline and wireless links, and a second network for providing at least one of control and additional data transfer over the first network. The application framework reconfigures circuit switches in response to monitoring aspects of the applications and the first network | 09-24-2009 |
20090241123 | METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR SCHEDULING WORK IN A STREAM-ORIENTED COMPUTER SYSTEM WITH CONFIGURABLE NETWORKS - A method, apparatus, and computer program product for scheduling stream-based applications in a distributed computer system with configurable networks are provided. The method includes choosing, at a highest temporal level, jobs that will run, an optimal template alternative for the jobs that will run, network topology, and candidate processing nodes for processing elements of the optimal template alternative for each running job to maximize importance of work performed by the system. The method further includes making, at a medium temporal level, fractional allocations and re-allocations of the candidate processing elements to the processing nodes in the system to react to changing importance of the work. The method also includes revising, at a lowest temporal level, the fractional allocations and re-allocations on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work. | 09-24-2009 |
20110061060 | Determining Operator Partitioning Constraint Feasibility - Techniques for determining feasibility of a set of one or more operator partitioning constraints are provided. The techniques include receiving one or more sets of operator partitioning constraints, wherein each set of one or more constraints define one or more desired conditions for grouping together of operators into partitions and placing partitions on hosts, wherein each operator is embodied as software that performs a particular function, processing each set of one or more operator partitioning constraints to determine feasibility of each set of one or more operator partitioning constraints, creating and outputting one or more candidate partitions and one or more host placements for each set of feasible partitioning constraints, and creating and outputting a certificate of infeasibility for each set of infeasible partitioning constraints, wherein the certificate of infeasibility outlines one or more reasons for infeasibility. | 03-10-2011 |
20120174110 | AMORTIZING COSTS OF SHARED SCANS - Techniques for scheduling a plurality of jobs sharing input are provided. The techniques include partitioning one or more input datasets into multiple subcomponents, analyzing a plurality of jobs to determine which of the plurality of jobs require scanning of one or more common subcomponents of the one or more input datasets, and scheduling a plurality of jobs that require scanning of one or more common subcomponents of the one or more input datasets, facilitating a single scanning of the one or more common subcomponents to be used as input by each of the plurality of jobs. | 07-05-2012 |
20120304188 | Scheduling Flows in a Multi-Platform Cluster Environment - Techniques for scheduling multiple flows in a multi-platform cluster environment are provided. The techniques include partitioning a cluster into one or more platform containers associated with one or more platforms in the cluster, scheduling one or more flows in each of the one or more platform containers, wherein the one or more flows are created as one or more flow containers, scheduling one or more individual jobs into the one or more flow containers to create a moldable schedule of one or more jobs, flows and platforms, and automatically converting the moldable schedule into a malleable schedule. | 11-29-2012 |
20130031561 | Scheduling Flows in a Multi-Platform Cluster Environment - Techniques for scheduling multiple flows in a multi-platform cluster environment are provided. The techniques include partitioning a cluster into one or more platform containers associated with one or more platforms in the cluster, scheduling one or more flows in each of the one or more platform containers, wherein the one or more flows are created as one or more flow containers, scheduling one or more individual jobs into the one or more flow containers to create a moldable schedule of one or more jobs, flows and platforms, and automatically converting the moldable schedule into a malleable schedule. | 01-31-2013 |
Patent application number | Description | Published |
20080235698 | METHOD AND APPARATUS FOR ASSIGNING CANDIDATE PROCESSING NODES IN A STREAM-ORIENTED COMPUTER SYSTEM - A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria. | 09-25-2008 |
20080271036 | METHOD AND APPARATUS FOR ASSIGNING FRACTIONAL PROCESSING NODES TO WORK IN A STREAM-ORIENTED COMPUTER SYSTEM - An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated. | 10-30-2008 |
20090300623 | METHODS AND SYSTEMS FOR ASSIGNING NON-CONTINUAL JOBS TO CANDIDATE PROCESSING NODES IN A STREAM-ORIENTED COMPUTER SYSTEM - A system and method for choosing non-continual jobs to run in a stream-based distributed computer system includes determining a total amount of resources to be consumed by non-continual jobs. A priority threshold is determined above which jobs will be accepted, below which jobs will be rejected. Overall penalties are minimized relative to the priority threshold based on estimated completion times of the jobs. System constraints are applied to ensure that jobs meet set criteria such that a plurality of non-continual jobs are scheduled which consider the system constraints and minimize overall penalties using available resources. | 12-03-2009 |
20100242042 | Method and apparatus for scheduling work in a stream-oriented computer system - An apparatus and method for scheduling stream-based applications in a distributed computer system includes a scheduler configured to schedule work using three temporal levels. Each temporal level includes a method. A macro method is configured to schedule jobs that will run, in a highest temporal level, in accordance with a plurality of operation constraints to optimize importance of work. A micro method is configured to fractionally allocate, at a medium temporal level, processing elements to processing nodes in the system to react to changing importance of the work. A nano method is configured to revise, at a lowest temporal level, fractional allocations on a continual basis. | 09-23-2010 |
20110246999 | METHOD AND APPARATUS FOR ASSIGNING CANDIDATE PROCESSING NODES IN A STREAM-ORIENTED COMPUTER SYSTEM - A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria. | 10-06-2011 |
20130013873 | SYSTEM AND METHOD FOR OPTIMIZING DATA IN VALUE-BASED STORAGE SYSTEM - A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats. | 01-10-2013 |
Patent application number | Description | Published |
20110258103 | TOTAL FAIR VALUE SWAP - A synthetic instrument known as a “Total Fair Value Swap” is disclosed. According to one embodiment, the Total Fair Value Swap may comprise an agreement between two counterparties, a “Fixed Rate Payer” and a “Floating Rate Payer”. According to the agreement, the Fixed Rate Payer makes a stream of payments to the Floating Rate Payer based on a fixed rate, and the Floating Rate Payer makes a second stream of payments to the Fixed Rate Payer based on a floating rate, wherein a first portion of the floating rate is based on a reference interest rate, and wherein a second portion of the floating rate is based on a credit spread associated with the Floating Rate Payer. The reference interest rate may be, for example, London Inter-Bank Offer Rate (LIBOR), prime interest rate, the US dollar swap rate, the U.S. Treasury Bond rate or any other widely traded interest rate that is reset periodically. The credit spread may be observed from the Credit Default Swap (CDS) market. | 10-20-2011 |
20140207647 | Total Fair Value Swap - A synthetic instrument known as a “Total Fair Value Swap” is disclosed. According to one embodiment, the Total Fair Value Swap may comprise an agreement between two counterparties, a “Fixed Rate Payer” and a “Floating Rate Payer”. According to the agreement, the Fixed Rate Payer makes a stream of payments to the Floating Rate Payer based on a fixed rate, and the Floating Rate Payer makes a second stream of payments to the Fixed Rate Payer based on a floating rate, wherein a first portion of the floating rate is based on a reference interest rate, and wherein a second portion of the floating rate is based on a credit spread associated with the Floating Rate Payer. The reference interest rate may be, for example, London Inter-Bank Offer Rate (LIBOR), prime interest rate, the US dollar swap rate, the U.S. Treasury Bond rate or any other widely traded interest rate that is reset periodically. The credit spread may be observed from the Credit Default Swap (CDS) market. | 07-24-2014 |
Patent application number | Description | Published |
20080301563 | SYSTEM AND METHOD FOR TARGETED MESSAGE DELIVERY AND SUBSCRIPTION - A system, method and computer program product for product that enables users of broadcast messaging systems to more expediently and efficiently find communities, both for subscribing and for sending messages. The system, method and computer program product provides an end-user with the ability to send messages for delivery to more targeted communities of messaging users. In this aspect, the system and method determines one or more attributes of messaging activity associated with one or more communities of users communicating messages in a messaging system; and, displays via an interface, a graphical representation of the attributes and inter-relationships between the attributes. The user may then select via the interface a recipient community for receiving a message to be sent based on the graphical representation displayed. | 12-04-2008 |
20090316872 | DESCRIPTIVE AUDIO CHANNEL FOR USE WITH MULTIMEDIA CONFERENCING - A computer-implemented method of conducting a multimedia conference can include identifying a participant from a plurality of participants as a descriptive audio participant in the multimedia conference and detecting a state change during the multimedia conference. The method can include correlating the state change with an audio cue and outputting the audio cue to the descriptive audio participant. | 12-24-2009 |
20120134485 | SYSTEM AND METHOD FOR MANAGING A CONFERENCE CALL - A system, method, and computer program product for initiating a conference call are disclosed. The method includes running a conference call managing application. The method also includes receiving at least one participant-defined condition. The participant-defined condition is associated with at least one conference call defining a status of a participant's communication device to connect the participant to the conference call. At least one alert is sent out to at least all required participants of the conference call, in response to the participant-defined condition being satisfied to start the conference call. | 05-31-2012 |
20140082096 | PRESERVING COLLABORATION HISTORY WITH RELEVANT CONTEXTUAL INFORMATION - Preserving collaborative history includes detecting a trigger for a chat session between at least two participants using a processor and, responsive to the trigger, obtaining event data for an event occurring during the chat session and involving at least one of the participants. The event data is included within a transcript of the chat session. In other cases, event data is obtained from external systems that is correlated with the chat session and is included within the transcript. | 03-20-2014 |
20140082106 | PRESERVING COLLABORATION HISTORY WITH RELEVANT CONTEXTUAL INFORMATION - Preserving collaborative history includes detecting a trigger for a chat session between at least two participants using a processor and, responsive to the trigger, obtaining event data for an event occurring during the chat session and involving at least one of the participants. The event data is included within a transcript of the chat session. In other cases, event data is obtained from external systems that is correlated with the chat session and is included within the transcript. | 03-20-2014 |
20140142950 | INTERLEAVING VOICE COMMANDS FOR ELECTRONIC MEETINGS - A method, computer program product, and system for identifying collaborators is described. A command precursor associated with delivery of a voice command associated with an electronic meeting is received. An audio signal including the voice command is received. A portion of the audio signal is identified as representing the voice command, based upon, at least in part, receiving the command precursor. The voice command is interpreted. The interpreted voice command is caused to be executed. | 05-22-2014 |
20140142951 | INTERLEAVING VOICE COMMANDS FOR ELECTRONIC MEETINGS - A method, computer program product, and system for identifying collaborators is described. A command precursor associated with delivery of a voice command associated with an electronic meeting is received. An audio signal including the voice command is received. A portion of the audio signal is identified as representing the voice command, based upon, at least in part, receiving the command precursor. The voice command is interpreted. The interpreted voice command is caused to be executed. | 05-22-2014 |
20140181092 | MANAGEMENT OF INTENDED FUTURE CONVERSATIONS - Arrangements relate to the management of data items representing intended future conversations. A plurality of first inputs related to a respective intended future conversation can be received. At least one data item representing the respective intended future conversation can be created for each first input. At least one attribute can be received for each of the plurality of intended future conversations associated with-each first input. In response to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, the plurality of intended future conversations associated with each first input can be ranked in a particular order based on at least one of the received attributes. A listing of the intended future conversations that is based on the ranking can be generated. | 06-26-2014 |
20140181094 | MANAGEMENT OF INTENDED FUTURE CONVERSATIONS - Arrangements relate to the management of data items representing intended future conversations. A plurality of first inputs related to a respective intended future conversation can be received. At least one data item representing the respective intended future conversation can be created for each first input. At least one attribute can be received for each of the plurality of intended future conversations associated with-each first input. In response to receiving at least one attribute for each of the plurality of the intended future conversations associated with each first input, the plurality of intended future conversations associated with each first input can be ranked in a particular order based on at least one of the received attributes. A listing of the intended future conversations that is based on the ranking can be generated. | 06-26-2014 |
20140181696 | ARRANGING A CONVERSATION AMONG A PLURALITY OF PARTICIPANTS - Arrangements disclosed herein relate to arranging a conversation among a plurality of participants. At least one user input related to a conversation intended by at least one user to take place can be identified. The desired conversation can include the plurality of participants. The conversation need not pre-scheduled. Contextual information of the plurality of participants can be monitored in real time to determine whether it is presently appropriate for the conversation to take place. When the contextual information of the plurality of participants indicates that it is presently appropriate for the conversation to take place, initiation of the conversation can be attempted. | 06-26-2014 |
20140297741 | FOLLOWING CONTENT POSTING ENTITIES - A method, system, and/or computer program product enables a user to selectively follow content postings from a content posting entity. A set of desired content posting entity traits describes traits of an ideal content posting entity that the content follower desires to follow. The set of desired content posting entity traits is compared to traits of a first candidate content posting entity. In response to the traits of the first candidate content posting entity matching the desired content posting entity traits, and in response to the first candidate content posting entity posting from a preselected location, the first candidate content posting entity is selected for future content postings to be sent to the content follower. | 10-02-2014 |