Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
13,500 | 13,500 | 15,062,566 | 3,635 | A flood proof door includes a sealing flange around at least a portion of the perimeter of the door. The flood door includes laterally extending flanges. A plurality of hinges are mounted on the flange to secure the door to a door jamb. Seals are positioned on the flanges to provide a flood proof seal around the periphery of the door. | 1. A flood proof door comprising:
a door having a front portion, rear portion, a top and bottom portion and a pair of side portions; each of said pair of side portions having an outwardly extending flange on the front portion, the flange extending from the bottom portion of the door to a height above the bottom portion; the bottom portion of the door including a downwardly extending flange portion; a plurality of hinges having a first element of the each of said plurality of hinges attached to a first side of one of said outwardly extending flange of the door; 2. The flood proof door is claimed in claim 1 further including an upwardly extending flange at the top portion of the door. 3. The flood proof door as claimed in claim 1 further including at least one seal secured to the outwardly and downwardly extending flange. 4. A flood proof door comprising:
a door having a front portion, rear portion, a top and bottom portion and a pair of side portions; each side portions having an outwardly extending flange on the front portion, the flange extending from the bottom portion of the door to a height above the bottom portion; the bottom portion of the door including a downwardly extending flange portion; a plurality of hinges having a first element of the hinge attached to a first side flange of the door; a second element of hinge secured to a first leg of an L-shaped member which is adapted to be secured to a door jamb frame. 5. A flood proof door comprising:
a door having a top, bottom and side portions, a plurality of hinges for mounting the door to a door jamb frame, means for flood proofing the bottom portion of the door with respect to a door sill,
wherein at least a portion of the sides portions of the door comprise a laterally extending flange and a L-shaped member extending from a front surface of the door adapted to be fixed to a said door jamb frame and at least one gasket positioned between the laterally extending flange and the L-shaped member. | A flood proof door includes a sealing flange around at least a portion of the perimeter of the door. The flood door includes laterally extending flanges. A plurality of hinges are mounted on the flange to secure the door to a door jamb. Seals are positioned on the flanges to provide a flood proof seal around the periphery of the door.1. A flood proof door comprising:
a door having a front portion, rear portion, a top and bottom portion and a pair of side portions; each of said pair of side portions having an outwardly extending flange on the front portion, the flange extending from the bottom portion of the door to a height above the bottom portion; the bottom portion of the door including a downwardly extending flange portion; a plurality of hinges having a first element of the each of said plurality of hinges attached to a first side of one of said outwardly extending flange of the door; 2. The flood proof door is claimed in claim 1 further including an upwardly extending flange at the top portion of the door. 3. The flood proof door as claimed in claim 1 further including at least one seal secured to the outwardly and downwardly extending flange. 4. A flood proof door comprising:
a door having a front portion, rear portion, a top and bottom portion and a pair of side portions; each side portions having an outwardly extending flange on the front portion, the flange extending from the bottom portion of the door to a height above the bottom portion; the bottom portion of the door including a downwardly extending flange portion; a plurality of hinges having a first element of the hinge attached to a first side flange of the door; a second element of hinge secured to a first leg of an L-shaped member which is adapted to be secured to a door jamb frame. 5. A flood proof door comprising:
a door having a top, bottom and side portions, a plurality of hinges for mounting the door to a door jamb frame, means for flood proofing the bottom portion of the door with respect to a door sill,
wherein at least a portion of the sides portions of the door comprise a laterally extending flange and a L-shaped member extending from a front surface of the door adapted to be fixed to a said door jamb frame and at least one gasket positioned between the laterally extending flange and the L-shaped member. | 3,600 |
13,501 | 13,501 | 14,836,392 | 3,666 | A method is disclosed for representing road intersections as data. A database includes intersection object data entities that represent physical road intersections. Each intersection object data entity includes a maneuver list that identifies each permissible transversal of the intersection from each lane by which the represented intersection can be entered to each lane from which the intersection can be exited from the associated lane by which the intersection can be entered. Each transversal in the maneuver list indicates an entry lane, an exit lane, the geometry of a vehicle path connecting the entry and exit lanes, and an indication of a level of confidence associated with the specified geometry. The database can be used by a system in a vehicle to provide a safety-related function. The database is compatible with navigation-related applications that use a different data model to provide navigation-related functions. | 1. (canceled) 2. A method comprising:
receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving navigation data from the road database; and providing a driving assistance command based on the navigation data. 3. The method of claim 2, wherein the navigation data includes an intersection having one or more paths from at least one incoming lane to at least one outgoing lane. 4. The method of claim 2, wherein the navigation data includes an intersection associated with a predictable path for the vehicle. 5. The method of claim 4, wherein the navigation data includes a confidence value indicative of vehicle paths through the intersection. 6. The method of claim 2, wherein the navigation data includes an intersection type identifier. 7. The method of claim 5, wherein the intersection type identifier indicates a roundabout intersection, a railroad crossing intersection, or a standard intersection. 8. The method of claim 2, wherein the driving assistance command provides a safety feature for the vehicle. 9. The method of claim 2, wherein the driving assistance command engages a mechanical system of the vehicle. 10. The method of claim 9, wherein the mechanical system is a braking system. 11. An apparatus comprising:
at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following: receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving intersection data from the road database; and providing a driving assistance function based on the intersection data. 12. The apparatus of claim 11, wherein the intersection data describes one or more paths from at least one incoming lane to at least one outgoing lane. 13. The apparatus of claim 12, wherein the intersection data describes a predictable path for the vehicle. 14. The apparatus of claim 13, wherein the intersection data includes a confidence value indicative of vehicle paths through the intersection. 15. The apparatus of claim 11, wherein the intersection data includes an intersection type identifier indicative of a roundabout intersection, a railroad crossing intersection, or a standard intersection. 16. The apparatus of claim 11, wherein the driving assistance function includes a warning to the driver of the vehicle. 17. The apparatus of claim 11, wherein the driving assistance function engages a mechanical system of the vehicle. 18. A non-transitory computer readable medium including instructions that when executed are operable to:
receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving navigation data from the road database; and providing a driving assistance command based on the navigation data. 19. The non-transitory computer readable medium of claim 18, wherein the navigation data includes an intersection having one or more paths from at least one incoming lane to at least one outgoing lane. 20. The non-transitory computer readable medium of claim 18, wherein the driving assistance command provides a safety feature for the vehicle. 21. The non-transitory computer readable medium of claim 18, wherein the driving assistance command engages a mechanical system of the vehicle. | A method is disclosed for representing road intersections as data. A database includes intersection object data entities that represent physical road intersections. Each intersection object data entity includes a maneuver list that identifies each permissible transversal of the intersection from each lane by which the represented intersection can be entered to each lane from which the intersection can be exited from the associated lane by which the intersection can be entered. Each transversal in the maneuver list indicates an entry lane, an exit lane, the geometry of a vehicle path connecting the entry and exit lanes, and an indication of a level of confidence associated with the specified geometry. The database can be used by a system in a vehicle to provide a safety-related function. The database is compatible with navigation-related applications that use a different data model to provide navigation-related functions.1. (canceled) 2. A method comprising:
receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving navigation data from the road database; and providing a driving assistance command based on the navigation data. 3. The method of claim 2, wherein the navigation data includes an intersection having one or more paths from at least one incoming lane to at least one outgoing lane. 4. The method of claim 2, wherein the navigation data includes an intersection associated with a predictable path for the vehicle. 5. The method of claim 4, wherein the navigation data includes a confidence value indicative of vehicle paths through the intersection. 6. The method of claim 2, wherein the navigation data includes an intersection type identifier. 7. The method of claim 5, wherein the intersection type identifier indicates a roundabout intersection, a railroad crossing intersection, or a standard intersection. 8. The method of claim 2, wherein the driving assistance command provides a safety feature for the vehicle. 9. The method of claim 2, wherein the driving assistance command engages a mechanical system of the vehicle. 10. The method of claim 9, wherein the mechanical system is a braking system. 11. An apparatus comprising:
at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following: receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving intersection data from the road database; and providing a driving assistance function based on the intersection data. 12. The apparatus of claim 11, wherein the intersection data describes one or more paths from at least one incoming lane to at least one outgoing lane. 13. The apparatus of claim 12, wherein the intersection data describes a predictable path for the vehicle. 14. The apparatus of claim 13, wherein the intersection data includes a confidence value indicative of vehicle paths through the intersection. 15. The apparatus of claim 11, wherein the intersection data includes an intersection type identifier indicative of a roundabout intersection, a railroad crossing intersection, or a standard intersection. 16. The apparatus of claim 11, wherein the driving assistance function includes a warning to the driver of the vehicle. 17. The apparatus of claim 11, wherein the driving assistance function engages a mechanical system of the vehicle. 18. A non-transitory computer readable medium including instructions that when executed are operable to:
receiving position data from one or more sensors, wherein the position data describes a position of a vehicle on a road segment; querying a road database based on the position of the vehicle on the road segment; receiving navigation data from the road database; and providing a driving assistance command based on the navigation data. 19. The non-transitory computer readable medium of claim 18, wherein the navigation data includes an intersection having one or more paths from at least one incoming lane to at least one outgoing lane. 20. The non-transitory computer readable medium of claim 18, wherein the driving assistance command provides a safety feature for the vehicle. 21. The non-transitory computer readable medium of claim 18, wherein the driving assistance command engages a mechanical system of the vehicle. | 3,600 |
13,502 | 13,502 | 13,125,821 | 3,686 | A system and method receiving patient information entered via a user interface, processing the patient information to generate an initial worklist based on the patient information and a patient guideline, displaying the initial worklist, receiving a user input based on the initial worklist, processing the user input to generate an updated worklist based on the user input and displaying the updated worklist. | 1. A method, comprising:
receiving (210) patient information entered via a user interface; processing (230) the patient information to generate an initial worklist based on the patient information and a patient guideline; displaying (240) the initial worklist; receiving (250) a user input based on the initial worklist; processing (280) the user input to generate an updated worklist based on the user input; and displaying (290) the updated worklist. 2. The method of claim 1, further comprising:
receiving (250) further input based on the displayed worklist; processing (280) the further input to generate an altered updated worklist; and displaying (290) the altered updated worklist. 3. The method of claim 1, wherein processing the user input to generate the updated worklist includes communicating (270) with one of a guideline manager (112) and a rules engine (118). 4. The method of claim 3, wherein the guideline manager (112) generates a patient guideline representation (116) based on the patient information and an accepted healthcare industry guideline. 5. The method of claim 3, wherein the rules engine (118) includes criteria for sorting a list of tasks of the initial worklist. 6. The method of claim 1, wherein the initial worklist and the updated worklist include a list of recommended tasks (114). 7. The method of claim 6, wherein the list of recommended tasks (114) is sortable by one of importance, cost, risks, patient preferences and invasiveness. 8. The method of claim 1, further comprising:
storing the patient information in a patient information database (122). 9. The method of claim 1, wherein the patient information includes one of a patient symptom, disease, condition and test result. 10. The method of claim 1, wherein the user input includes one of an indication of completed task, a request to sort the worklist and additional patient information. 11. A system, comprising:
a user interface (104) to enter patient information and a user input; a memory (108) storing a patient guideline; a processor (102) generating a worklist based on one of the patient information and the user input along with a patient guideline, wherein the user input is based on a previously generated worklist; and a display (106) displaying the worklist (114). 12. The system of claim 11, wherein the display (106) simultaneously displays a patient guideline representation (116). 13. The system of claim 11, wherein the user interface (104) receives further input based on the displayed worklist (114), the processor (102) altering the display of the patient guideline representation (116) based on the further user input. 14. The system of claim 11, wherein the worklist (114) is further based on a work function of the user. 15. The system of claim 11, wherein the memory (108) stores criteria for sorting the worklist (114) and the processor (102) sorts the worklist (114) based on the criteria. 16. The system of claim 11, wherein the worklist (114) includes a list of recommended tasks. 17. The system of claim 16, wherein the list of recommended tasks is sortable by one of importance, cost, risks, patient preferences and invasiveness. 18. The system of claim 11, wherein the patient information includes one of a patient symptom, disease, condition and test result. 19. The system of claim 11, wherein the user input includes one of an indication of a completed task, a request to sort the worklist and additional patient information. 20. A computer-readable storage medium (108) including a set of instructions executable by a processor (102), the set of instructions operable to:
receive (210) patient information entered via a user interface; process (230) the patient information to generate an initial worklist based on the patient information and a patient guideline; display (240) the initial worklist; receive (250) a user input based on the initial worklist; process (280) the user input to generate an updated worklist based on the user input; and display (290) the updated worklist (114). | A system and method receiving patient information entered via a user interface, processing the patient information to generate an initial worklist based on the patient information and a patient guideline, displaying the initial worklist, receiving a user input based on the initial worklist, processing the user input to generate an updated worklist based on the user input and displaying the updated worklist.1. A method, comprising:
receiving (210) patient information entered via a user interface; processing (230) the patient information to generate an initial worklist based on the patient information and a patient guideline; displaying (240) the initial worklist; receiving (250) a user input based on the initial worklist; processing (280) the user input to generate an updated worklist based on the user input; and displaying (290) the updated worklist. 2. The method of claim 1, further comprising:
receiving (250) further input based on the displayed worklist; processing (280) the further input to generate an altered updated worklist; and displaying (290) the altered updated worklist. 3. The method of claim 1, wherein processing the user input to generate the updated worklist includes communicating (270) with one of a guideline manager (112) and a rules engine (118). 4. The method of claim 3, wherein the guideline manager (112) generates a patient guideline representation (116) based on the patient information and an accepted healthcare industry guideline. 5. The method of claim 3, wherein the rules engine (118) includes criteria for sorting a list of tasks of the initial worklist. 6. The method of claim 1, wherein the initial worklist and the updated worklist include a list of recommended tasks (114). 7. The method of claim 6, wherein the list of recommended tasks (114) is sortable by one of importance, cost, risks, patient preferences and invasiveness. 8. The method of claim 1, further comprising:
storing the patient information in a patient information database (122). 9. The method of claim 1, wherein the patient information includes one of a patient symptom, disease, condition and test result. 10. The method of claim 1, wherein the user input includes one of an indication of completed task, a request to sort the worklist and additional patient information. 11. A system, comprising:
a user interface (104) to enter patient information and a user input; a memory (108) storing a patient guideline; a processor (102) generating a worklist based on one of the patient information and the user input along with a patient guideline, wherein the user input is based on a previously generated worklist; and a display (106) displaying the worklist (114). 12. The system of claim 11, wherein the display (106) simultaneously displays a patient guideline representation (116). 13. The system of claim 11, wherein the user interface (104) receives further input based on the displayed worklist (114), the processor (102) altering the display of the patient guideline representation (116) based on the further user input. 14. The system of claim 11, wherein the worklist (114) is further based on a work function of the user. 15. The system of claim 11, wherein the memory (108) stores criteria for sorting the worklist (114) and the processor (102) sorts the worklist (114) based on the criteria. 16. The system of claim 11, wherein the worklist (114) includes a list of recommended tasks. 17. The system of claim 16, wherein the list of recommended tasks is sortable by one of importance, cost, risks, patient preferences and invasiveness. 18. The system of claim 11, wherein the patient information includes one of a patient symptom, disease, condition and test result. 19. The system of claim 11, wherein the user input includes one of an indication of a completed task, a request to sort the worklist and additional patient information. 20. A computer-readable storage medium (108) including a set of instructions executable by a processor (102), the set of instructions operable to:
receive (210) patient information entered via a user interface; process (230) the patient information to generate an initial worklist based on the patient information and a patient guideline; display (240) the initial worklist; receive (250) a user input based on the initial worklist; process (280) the user input to generate an updated worklist based on the user input; and display (290) the updated worklist (114). | 3,600 |
13,503 | 13,503 | 13,855,235 | 3,688 | One exemplary embodiment involves receiving input during a simulation of a website, the input providing a test value for a user characteristic associated with simulated use of the website, the website having a configuration to provide an e-commerce service and personalized content based on the user characteristic. The embodiment further involves determining the personalized content according to the configuration based at least in part on the test value for the user characteristic and rendering the personalized content on a simulated web page of the website during the simulation. | 1. A method comprising:
receiving input during a simulation of user characteristics associated with user behavior on a website, the input providing a test value for a simulated user characteristic associated with simulated use of the website, the website having a configuration to provide an e-commerce service and personalized content based on the simulated user characteristic; determining the personalized content according to the configuration based at least in part on the test value for the simulated user characteristic, wherein the determined personalized content is different for different test values for the simulated user characteristic; and rendering the personalized content on a web page of the website during the simulation; wherein the receiving, determining, and rendering are performed via a processor of an author device. 2. The method of claim 1 further comprising receiving additional input providing a second test value for the simulated user characteristic, determining revised personalized content based on the second test value for the simulated user characteristic, and rendering the revised personalized content on the web page of the website during the simulation. 3. The method of claim 1 further comprising providing a graphical interface displaying the web page during the simulation and separately displaying a portion for receiving the input providing the test value for the simulated user characteristic. 4. The method of claim 1 wherein the input is received as a change to a displayed item on the web page. 5. The method of claim 1 wherein the input is received as a change to a displayed item on the web page during the simulation, wherein the displayed item cannot be directly changed during end-user-use of the web page. 6. The method of claim 1 wherein the simulated user characteristic is a shopping cart characteristic. 7. The method of claim 1, further comprising:
receiving additional values for additional simulated user characteristics; determining, based at least in part on the additional values, revised personalized content; and dynamically refreshing the personalized content in the simulated web page with the revised promotional content. 8. The method of claim 1, wherein the simulated user characteristics are defined by a plurality of segments that are each associated with the personalized content. 9. The method of claim 1, wherein the simulated user characteristics are received from an author device associated with an author of the web page. 10. A system comprising:
a processor for executing instructions stored in computer-readable medium on one or more author devices, the application comprising one or more modules, the modules comprising:
an input module configured to receive input providing a test value for a simulated user characteristic for simulating personalized promotional content on a web page;
a simulation module configured to render the web page, identify the personalized promotional content to include in the web page based at least in part on the received simulated user characteristic, and dynamically refresh a personalized promotional content portion of the web page to include the identified personalized promotional content. 11. The system of claim 10, wherein the input module is configured to render a simulation panel for receiving the input providing the test value, the simulation panel separate from a rendering of the web page. 12. The system of claim 10, wherein the simulation module is configured to identify the personalized content by:
determining one or more segments based at least in part on the simulated user characteristic; and identifying the personalized promotional content associated with the one or more segments. 13. The system of claim 12, wherein the promotional content was previously associated with the one or more segments. 14. The system of claim 10, wherein the test value is for shopping cart data that cannot be changed to the test value through direct interaction with the web page. 15. The system of claim 14, wherein the shopping cart data is a total value of all items in the shopping cart. 16. A non-transitory computer-readable medium on which is encoded program code, the program code comprising:
program code for receiving, at a server device, a request, from an author device, to provide personalized promotional content from an end user perspective based at least in part on simulated user characteristics; program code for transmitting, to the author device, promotional content and a plurality of segments associated with the promotional content; and program code for transmitting, to the author device, a simulation executable to simulate the simulated user characteristics for generation of the personalized promotional content from the end user perspective. 17. The non-transitory computer-readable medium of claim 16, further comprising:
program code for receiving, at the server device, a request from the author device to manage the segments associated with the promotional content; and program code for providing, to the author device, a user interface for managing the segments, the segments at least comprising characteristics related to the shopping cart data. 18. The non-transitory computer-readable medium of claim 16, wherein the simulation executable is configured to:
receive, at the author device, the simulated user characteristics, the simulated user characteristics comprising data related to interaction with the e-commerce service; determining, at the author device, an item of personalized promotional content associated with the received simulated user characteristics; and dynamically rendering, on a display associated with the author device, the item of personalized promotional content based at least in part on the simulated user characteristics. 19. The non-transitory computer-readable medium of claim 18, wherein determining the promotional content associated with the received simulated user characteristics comprises:
identifying, at the author device, the segments that correspond with the received simulated user characteristics; and identifying, the author device, the promotional content associated with the identified segments. 20. The non-transitory computer-readable medium of claim 16, wherein the simulation executable is embedded in a browser. | One exemplary embodiment involves receiving input during a simulation of a website, the input providing a test value for a user characteristic associated with simulated use of the website, the website having a configuration to provide an e-commerce service and personalized content based on the user characteristic. The embodiment further involves determining the personalized content according to the configuration based at least in part on the test value for the user characteristic and rendering the personalized content on a simulated web page of the website during the simulation.1. A method comprising:
receiving input during a simulation of user characteristics associated with user behavior on a website, the input providing a test value for a simulated user characteristic associated with simulated use of the website, the website having a configuration to provide an e-commerce service and personalized content based on the simulated user characteristic; determining the personalized content according to the configuration based at least in part on the test value for the simulated user characteristic, wherein the determined personalized content is different for different test values for the simulated user characteristic; and rendering the personalized content on a web page of the website during the simulation; wherein the receiving, determining, and rendering are performed via a processor of an author device. 2. The method of claim 1 further comprising receiving additional input providing a second test value for the simulated user characteristic, determining revised personalized content based on the second test value for the simulated user characteristic, and rendering the revised personalized content on the web page of the website during the simulation. 3. The method of claim 1 further comprising providing a graphical interface displaying the web page during the simulation and separately displaying a portion for receiving the input providing the test value for the simulated user characteristic. 4. The method of claim 1 wherein the input is received as a change to a displayed item on the web page. 5. The method of claim 1 wherein the input is received as a change to a displayed item on the web page during the simulation, wherein the displayed item cannot be directly changed during end-user-use of the web page. 6. The method of claim 1 wherein the simulated user characteristic is a shopping cart characteristic. 7. The method of claim 1, further comprising:
receiving additional values for additional simulated user characteristics; determining, based at least in part on the additional values, revised personalized content; and dynamically refreshing the personalized content in the simulated web page with the revised promotional content. 8. The method of claim 1, wherein the simulated user characteristics are defined by a plurality of segments that are each associated with the personalized content. 9. The method of claim 1, wherein the simulated user characteristics are received from an author device associated with an author of the web page. 10. A system comprising:
a processor for executing instructions stored in computer-readable medium on one or more author devices, the application comprising one or more modules, the modules comprising:
an input module configured to receive input providing a test value for a simulated user characteristic for simulating personalized promotional content on a web page;
a simulation module configured to render the web page, identify the personalized promotional content to include in the web page based at least in part on the received simulated user characteristic, and dynamically refresh a personalized promotional content portion of the web page to include the identified personalized promotional content. 11. The system of claim 10, wherein the input module is configured to render a simulation panel for receiving the input providing the test value, the simulation panel separate from a rendering of the web page. 12. The system of claim 10, wherein the simulation module is configured to identify the personalized content by:
determining one or more segments based at least in part on the simulated user characteristic; and identifying the personalized promotional content associated with the one or more segments. 13. The system of claim 12, wherein the promotional content was previously associated with the one or more segments. 14. The system of claim 10, wherein the test value is for shopping cart data that cannot be changed to the test value through direct interaction with the web page. 15. The system of claim 14, wherein the shopping cart data is a total value of all items in the shopping cart. 16. A non-transitory computer-readable medium on which is encoded program code, the program code comprising:
program code for receiving, at a server device, a request, from an author device, to provide personalized promotional content from an end user perspective based at least in part on simulated user characteristics; program code for transmitting, to the author device, promotional content and a plurality of segments associated with the promotional content; and program code for transmitting, to the author device, a simulation executable to simulate the simulated user characteristics for generation of the personalized promotional content from the end user perspective. 17. The non-transitory computer-readable medium of claim 16, further comprising:
program code for receiving, at the server device, a request from the author device to manage the segments associated with the promotional content; and program code for providing, to the author device, a user interface for managing the segments, the segments at least comprising characteristics related to the shopping cart data. 18. The non-transitory computer-readable medium of claim 16, wherein the simulation executable is configured to:
receive, at the author device, the simulated user characteristics, the simulated user characteristics comprising data related to interaction with the e-commerce service; determining, at the author device, an item of personalized promotional content associated with the received simulated user characteristics; and dynamically rendering, on a display associated with the author device, the item of personalized promotional content based at least in part on the simulated user characteristics. 19. The non-transitory computer-readable medium of claim 18, wherein determining the promotional content associated with the received simulated user characteristics comprises:
identifying, at the author device, the segments that correspond with the received simulated user characteristics; and identifying, the author device, the promotional content associated with the identified segments. 20. The non-transitory computer-readable medium of claim 16, wherein the simulation executable is embedded in a browser. | 3,600 |
13,504 | 13,504 | 13,970,084 | 3,681 | A social networking system selects advertisements for presentation to a user while a client device used by the user is in a state that provides limited functionality to the user, such as a locked state. Based on objectives associated with various advertisements, the social networking system determines interactions associated with advertisements and selects advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user or associated with no interaction. The social networking system sends the advertisements to the client device for display to the user while the client device is in the state of limited functionality. | 1. A method comprising:
responsive to an indication that a client device of a user of a social networking system is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user; identifying one or more advertisements for presentation from the one or more candidate advertisements; and sending the identified one or more advertisements for presentation to the client device while the client device is in the state that provides limited functionality to the user. 2. The method of claim 1, further comprising:
identifying the one or more interactions associated with each advertisement from the plurality of advertisements based in part on an objective associated with presenting each advertisement from the plurality of advertisements to one or more users of the social networking system. 3. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions corresponding to interactions performed on content maintained by the social networking system. 4. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user. 5. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with no interaction. 6. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on bid amounts associated with the one or more candidate advertisements. 7. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information describing one or more device parameters associated with the client device wherein the one or more device parameters associated with the client device are selected from a group consisting of: an operating system, a display size, a type of network connection, a service provider, and any combination thereof. 8. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information associated with the user. 9. The method of claim 8, wherein the information associated with the user is selected from a group consisting of: information provided by the user and included in a user profile associated with the user by the social networking system, actions performed by the user on the social networking system, actions performed by the user on one or more third-party systems, information associated with one or more users of the social networking system connected to the user, a geographic location associated with the user, and any combination thereof. 10. The method of claim 1, further comprising:
sending, to the client device, information to modify a time interval controlling when the identified one or more advertisements are presented, the information including instructions modifying display of the identified one or more advertisements responsive to an interaction with the client device by the user. 11. A method comprising:
responsive to a request to present content on a client device of a user of a social networking system and an indication that the client device is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user; identifying one or more advertisements for presentation from the one or more candidate advertisements; selecting additional content items maintained by the social networking system for presentation to the user; and sending the identified one or more advertisements and the selected additional content items to the client device for presentation to the user while the client device is in the state that provides limited functionality to the user. 12. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions corresponding to interactions performed on content maintained by the social networking system. 13. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user. 14. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with no interaction. 15. The method of claim 11, wherein identifying the additional content items maintained by the social networking system for presentation to the user comprises:
identifying actions associated with one or more users of the social networking system connected to the user; generating information describing one or more of the identified actions; and selecting the generated information. 16. The method of claim 15, wherein generating information describing one or more of the identified actions comprises generating a story identifying an action and a user associated with the action. 17. The method of claim 11, wherein the request includes one or more device parameters of the client device selected from a group consisting of: an operating system, a display size, a type of network connection, a service provider, and any combination thereof. 18. The method of claim 11, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information associated with the user that is maintained by the social networking system. 19. The method of claim 18, wherein the information associated with the user is selected from a group consisting of: information provided by the user and included in a user profile associated with the user by the social networking system, actions performed by the user on the social networking system, actions performed by the user on one or more third-party systems, information associated with one or more users of the social networking system connected to the user, a geographic location associated with the user, and any combination thereof. 20. A system comprising:
a computer processor; and a computer-readable storage medium coupled to the computer processor, the computer-readable storage medium storing executable code, the code when executed by the computer processor performs steps comprising:
responsive to an indication that a client device of a user of a social networking system is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user,
identifying one or more advertisements for presentation from the one or more candidate advertisements, and
sending the identified one or more advertisements for presentation to the client device while the client device is in the state that provides limited functionality to the user. | A social networking system selects advertisements for presentation to a user while a client device used by the user is in a state that provides limited functionality to the user, such as a locked state. Based on objectives associated with various advertisements, the social networking system determines interactions associated with advertisements and selects advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user or associated with no interaction. The social networking system sends the advertisements to the client device for display to the user while the client device is in the state of limited functionality.1. A method comprising:
responsive to an indication that a client device of a user of a social networking system is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user; identifying one or more advertisements for presentation from the one or more candidate advertisements; and sending the identified one or more advertisements for presentation to the client device while the client device is in the state that provides limited functionality to the user. 2. The method of claim 1, further comprising:
identifying the one or more interactions associated with each advertisement from the plurality of advertisements based in part on an objective associated with presenting each advertisement from the plurality of advertisements to one or more users of the social networking system. 3. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions corresponding to interactions performed on content maintained by the social networking system. 4. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user. 5. The method of claim 1, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with no interaction. 6. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on bid amounts associated with the one or more candidate advertisements. 7. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information describing one or more device parameters associated with the client device wherein the one or more device parameters associated with the client device are selected from a group consisting of: an operating system, a display size, a type of network connection, a service provider, and any combination thereof. 8. The method of claim 1, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information associated with the user. 9. The method of claim 8, wherein the information associated with the user is selected from a group consisting of: information provided by the user and included in a user profile associated with the user by the social networking system, actions performed by the user on the social networking system, actions performed by the user on one or more third-party systems, information associated with one or more users of the social networking system connected to the user, a geographic location associated with the user, and any combination thereof. 10. The method of claim 1, further comprising:
sending, to the client device, information to modify a time interval controlling when the identified one or more advertisements are presented, the information including instructions modifying display of the identified one or more advertisements responsive to an interaction with the client device by the user. 11. A method comprising:
responsive to a request to present content on a client device of a user of a social networking system and an indication that the client device is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user; identifying one or more advertisements for presentation from the one or more candidate advertisements; selecting additional content items maintained by the social networking system for presentation to the user; and sending the identified one or more advertisements and the selected additional content items to the client device for presentation to the user while the client device is in the state that provides limited functionality to the user. 12. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
identifying one or more candidate advertisements associated with interactions corresponding to interactions performed on content maintained by the social networking system. 13. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with interactions capable of being performed while the client device is in the state that provides limited functionality to the user. 14. The method of claim 11, wherein identifying the one or more candidate advertisements from the plurality of advertisements comprises:
selecting one or more candidate advertisements associated with no interaction. 15. The method of claim 11, wherein identifying the additional content items maintained by the social networking system for presentation to the user comprises:
identifying actions associated with one or more users of the social networking system connected to the user; generating information describing one or more of the identified actions; and selecting the generated information. 16. The method of claim 15, wherein generating information describing one or more of the identified actions comprises generating a story identifying an action and a user associated with the action. 17. The method of claim 11, wherein the request includes one or more device parameters of the client device selected from a group consisting of: an operating system, a display size, a type of network connection, a service provider, and any combination thereof. 18. The method of claim 11, wherein identifying the one or more advertisements for presentation from the one or more candidate advertisements comprises:
identifying one or more advertisements for presentation based at least in part on information associated with the user that is maintained by the social networking system. 19. The method of claim 18, wherein the information associated with the user is selected from a group consisting of: information provided by the user and included in a user profile associated with the user by the social networking system, actions performed by the user on the social networking system, actions performed by the user on one or more third-party systems, information associated with one or more users of the social networking system connected to the user, a geographic location associated with the user, and any combination thereof. 20. A system comprising:
a computer processor; and a computer-readable storage medium coupled to the computer processor, the computer-readable storage medium storing executable code, the code when executed by the computer processor performs steps comprising:
responsive to an indication that a client device of a user of a social networking system is in a state that provides limited functionality to the user, identifying one or more candidate advertisements from a plurality of advertisements, each candidate advertisement being associated with one or more interactions capable of being performed while the client device is in the state that provides limited functionality to the user,
identifying one or more advertisements for presentation from the one or more candidate advertisements, and
sending the identified one or more advertisements for presentation to the client device while the client device is in the state that provides limited functionality to the user. | 3,600 |
13,505 | 13,505 | 14,909,488 | 3,623 | In one example of the disclosure, data indicative of a current message, sent via a first communications application for delivery to a user, is accessed. A preferred communications application is identified for delivering the current message to the user. Identification is in consideration of past behaviors of the user with respect to communication applications. The current message is caused to be delivered to the user via the preferred application. | 1. A memory resource storing instructions that when executed cause a processing resource to implement a system for message delivery, the instructions comprising:
a current message module for accessing data indicative of a current message, the current message sent via a first communications application for a planned delivery to a user via the first application; a behaviors module for accessing data indicative of past behaviors of the user with respect to utilization of communication applications; an identification module for identifying, in consideration of the past behaviors data, a preferred communications application for delivering the current message to the user; and a delivery module for causing the current message to be delivered to the user via the preferred application. 2. The medium of claim 1, wherein the delivery module includes instructions for causing the planned delivery via the first application to be cancelled. 3. The medium of claim 1, wherein identifying a preferred communications application includes
identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application; and consideration of a count of occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance. 4. The medium of claim 1, wherein the preferred application includes at least one of a text messaging application, a phone application, and a social networking web application. 5. The medium of claim 3, wherein the relevant circumstance includes at least one of a specific time, a time period, a specific date, and a range of dates. 6. The medium of claim 3, wherein the relevant circumstance is the presence of the user at a location. 7. The medium of claim 3, wherein the identification module includes instructions for accessing presence data from a mobile computing device associated with the user and the relevant circumstance is identified utilizing the presence data. 8. The medium of claim 7, wherein the presence data includes positioning data or motion analytics data. 9. The medium of claim 7, wherein the presence data is indicative that the user, or a computing device associated with user, has accessed a telephone connection, web application, or network. 10. The medium of claim 1,
wherein the user is a first user; wherein the current message was sent at the initiation of a second user through interaction with the first application; further comprising a response module for
accessing a response message generated responsive to interaction of the first user with the preferred application, and
causing sending of the response message to the second user via the first application. 11. A message delivery system, comprising
a current message engine to access data indicative of a current message, the current message sent via a first communications application and addressed for delivery to a user via the first application; a selection engine to select a preferred communications application for delivering the current message to the user, wherein the preferred application is selected according to past behaviors of the user with respect to a plurality of communication applications; and a delivery engine to cause the current message to be delivered to the user via the preferred application instead of via the first application. 12. The system of claim 11, wherein selecting a preferred communications application includes 1 identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application; and
applying a rule that considers a count of occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance. 13. The system of claim 12, wherein the relevant circumstance is that the user is scheduled to attend a meeting according to a calendar application. 14. The system of claim 12, wherein the relevant circumstance includes at least one of a driving travel, a passenger travel, an air travel, or a travel outside the user's home country. 15. A method for message delivery, comprising:
obtaining data indicative of a current message, the current message sent via a first communications application and addressed for delivery to a user via the first application; obtaining data indicative of past behaviors of the user with respect to utilization of communication applications; selecting a preferred communications application for delivering the current message to the user; including
identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application, and
counting occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance; and
causing the current message to be delivered to the user via the preferred application, wherein the current message is not delivered to the user via the first application. | In one example of the disclosure, data indicative of a current message, sent via a first communications application for delivery to a user, is accessed. A preferred communications application is identified for delivering the current message to the user. Identification is in consideration of past behaviors of the user with respect to communication applications. The current message is caused to be delivered to the user via the preferred application.1. A memory resource storing instructions that when executed cause a processing resource to implement a system for message delivery, the instructions comprising:
a current message module for accessing data indicative of a current message, the current message sent via a first communications application for a planned delivery to a user via the first application; a behaviors module for accessing data indicative of past behaviors of the user with respect to utilization of communication applications; an identification module for identifying, in consideration of the past behaviors data, a preferred communications application for delivering the current message to the user; and a delivery module for causing the current message to be delivered to the user via the preferred application. 2. The medium of claim 1, wherein the delivery module includes instructions for causing the planned delivery via the first application to be cancelled. 3. The medium of claim 1, wherein identifying a preferred communications application includes
identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application; and consideration of a count of occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance. 4. The medium of claim 1, wherein the preferred application includes at least one of a text messaging application, a phone application, and a social networking web application. 5. The medium of claim 3, wherein the relevant circumstance includes at least one of a specific time, a time period, a specific date, and a range of dates. 6. The medium of claim 3, wherein the relevant circumstance is the presence of the user at a location. 7. The medium of claim 3, wherein the identification module includes instructions for accessing presence data from a mobile computing device associated with the user and the relevant circumstance is identified utilizing the presence data. 8. The medium of claim 7, wherein the presence data includes positioning data or motion analytics data. 9. The medium of claim 7, wherein the presence data is indicative that the user, or a computing device associated with user, has accessed a telephone connection, web application, or network. 10. The medium of claim 1,
wherein the user is a first user; wherein the current message was sent at the initiation of a second user through interaction with the first application; further comprising a response module for
accessing a response message generated responsive to interaction of the first user with the preferred application, and
causing sending of the response message to the second user via the first application. 11. A message delivery system, comprising
a current message engine to access data indicative of a current message, the current message sent via a first communications application and addressed for delivery to a user via the first application; a selection engine to select a preferred communications application for delivering the current message to the user, wherein the preferred application is selected according to past behaviors of the user with respect to a plurality of communication applications; and a delivery engine to cause the current message to be delivered to the user via the preferred application instead of via the first application. 12. The system of claim 11, wherein selecting a preferred communications application includes 1 identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application; and
applying a rule that considers a count of occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance. 13. The system of claim 12, wherein the relevant circumstance is that the user is scheduled to attend a meeting according to a calendar application. 14. The system of claim 12, wherein the relevant circumstance includes at least one of a driving travel, a passenger travel, an air travel, or a travel outside the user's home country. 15. A method for message delivery, comprising:
obtaining data indicative of a current message, the current message sent via a first communications application and addressed for delivery to a user via the first application; obtaining data indicative of past behaviors of the user with respect to utilization of communication applications; selecting a preferred communications application for delivering the current message to the user; including
identifying, from the past behaviors data, a relevant circumstance with respect to utilization of a communication application, and
counting occurrences that the user utilized the preferred application relative to other communication applications during the relevant circumstance; and
causing the current message to be delivered to the user via the preferred application, wherein the current message is not delivered to the user via the first application. | 3,600 |
13,506 | 13,506 | 14,671,366 | 3,678 | A method for effective and efficient water or wastewater aerosolization and industry specific and regulatory agency approved ADC, soil stabilization or penetrating solution dissemination over identified and specific areas that are to be addressed. The water or wastewater and industry or regulatory body specifically approved ADC, soil stabilization or penetrating reagent solution(s) is directed to an “Integrated Mobile Aerosolization System (IMAS)” or other system having a turbine and being integrated and mobile. The turbine is driven so as to generate a system of air. Integrated pumps are utilized to move the water or wastewater and industry or regulatory body specific and ADC, soil stabilization or penetrating reagent solution(s) to a series of nozzles that aerosolizes the water or wastewater and ADC, soil stabilization or penetrating reagent solution into the path of the system of air. The water or wastewater and ADC, soil stabilization or penetrating reagent solution form a mixture that is entrained in the system of air. The mixture of water or wastewater and ADC, soil stabilizing or penetrating reagent solution is directed over a specific area that is to be covered with an approved material. The water or wastewater and ADC, soil stabilization or penetrating reagent solution form that industry specific and regulatory body approved covering material that is applied to the specific area. | 1. A method of applying a covering, stabilizing or penetrating reagent composition to a selected area comprising:
directing water to an aerosolization system that includes a turbine and a turbine housing; driving the turbine and generating a system of air that moves through the turbine housing; pumping the water under pressure to a series of nozzles associated with the aerosolization system; mixing the covering, stabilizing or penetrating reagent composition with the water to form a water-composition mixture before the water is emitted from the nozzles; pumping the water-composition mixture to and through the nozzle into the system of air generated by the turbine and passing through the turbine housing to form a water-composition-air mixture; and aerosolizing the water-composition-air mixture and directing the aerosolized water-composition-air mixture from the turbine housing through the air and towards the selected area where at least portions of the composition fall onto the selected area. 2. The method of claim 1 wherein the water comprises wastewater. 3. The method of claim 1 wherein the composition comprises an alternative daily covering composition and wherein the aerosolization system is operative to deliver the alternative daily cover composition to the selected area. 4. The method of claim 1 wherein a series of nozzles are communicatively connected to a ring pipe disposed adjacent the turbine housing, and the method includes directing the water into the ring pipe and directing the covering, stabilizing or penetrating reagent composition into the ring pipe where the composition and the water are mixed together in the ring pipe to form the water-composition mixture. 5. The method of claim 1 including directing the water under pressure into a ring pipe disposed adjacent the turbine housing and mixing the composition with the water in the ring pipe, and aerosolizing the water-composition mixture in the turbine housing causing the aerosolized mixture to be entrained in the system of air generated by the turbine and passing through the turbine housing past the ring pipe. 6. The method of claim 1 wherein the composition includes an antimicrobial composition, a soil stabilizing reagent, a penetrating reagent, an odor suppression composition, or an alternative daily cover composition. 7. The method of claim 1 wherein the aerosolization system includes a ring pipe disposed interiorly of the turbine housing adjacent an outlet end portion of the turbine housing and the method includes emitting the water-composition mixture from nozzles disposed around the ring pipe where the water-composition mixture mixes with the system of air passing through the turbine housing to form the water-composition-air mixture. 8. A method of applying a composition to a selected area with an aerosolization system having a tubular turbine housing and a turbine associated with the turbine housing, the method comprising:
pumping water under pressure to a ring pipe having a series of nozzles with the ring pipe being disposed adjacent an outlet end of the turbine housing; directing the composition to the ring pipe and mixing the composition with the water in the ring pipe to form a water-composition mixture; driving the turbine and generating a system of air within the turbine housing and moving the system of air through the turbine housing and out an outlet end of the turbine housing; emitting the water-composition mixture from the nozzles and aerosolizing the water-composition mixture and entraining the aerosolized water-composition mixture in the system of air moving through the turbine housing to form a water-composition-air mixture; and shooting the water-composition-air mixture, including the aerosolized water-composition mixture, from the outlet end of the turbine housing and towards the selected area such that the water-composition-air mixture travels through the atmosphere towards the selected area and wherein at least a portion of the composition lands on the selected area. 9. The method of claim 8 wherein the water comprises wastewater. 10. The method of claim 8 wherein the composition comprises an alternative daily covering composition and wherein the aerosolization system is operative to deliver the alternative daily cover composition to the selected area. 11. The method of claim 8 wherein a series of nozzles are communicatively connected to a ring pipe disposed adjacent the turbine housing, and the method includes directing the water into the ring pipe and directing a covering, stabilizing or penetrating reagent composition into the ring pipe where the composition and the water are mixed together in the ring pipe to form the water-composition mixture. 12. The method of claim 8 including directing the water under pressure into the ring pipe disposed adjacent the turbine housing and mixing the composition with the water in the ring pipe, and aerosolizing the water-composition mixture in the turbine housing causing the aerosolized mixture to be entrained in the system of air generated by the turbine and passing through the turbine housing past the ring pipe. 13. The method of claim 8 wherein the composition includes an antimicrobial composition, a soil stabilizing reagent, a penetrating reagent, an odor suppression composition, or an alternative daily cover composition. 14. The method of claim 8 wherein the ring pipe is disposed interiorly of the turbine housing adjacent an outlet end portion of the turbine housing and the method includes emitting the water-composition mixture from nozzles disposed around the ring pipe where the water-composition mixture mixes with the system of air passing through the turbine housing to form the water-composition-air mixture. | A method for effective and efficient water or wastewater aerosolization and industry specific and regulatory agency approved ADC, soil stabilization or penetrating solution dissemination over identified and specific areas that are to be addressed. The water or wastewater and industry or regulatory body specifically approved ADC, soil stabilization or penetrating reagent solution(s) is directed to an “Integrated Mobile Aerosolization System (IMAS)” or other system having a turbine and being integrated and mobile. The turbine is driven so as to generate a system of air. Integrated pumps are utilized to move the water or wastewater and industry or regulatory body specific and ADC, soil stabilization or penetrating reagent solution(s) to a series of nozzles that aerosolizes the water or wastewater and ADC, soil stabilization or penetrating reagent solution into the path of the system of air. The water or wastewater and ADC, soil stabilization or penetrating reagent solution form a mixture that is entrained in the system of air. The mixture of water or wastewater and ADC, soil stabilizing or penetrating reagent solution is directed over a specific area that is to be covered with an approved material. The water or wastewater and ADC, soil stabilization or penetrating reagent solution form that industry specific and regulatory body approved covering material that is applied to the specific area.1. A method of applying a covering, stabilizing or penetrating reagent composition to a selected area comprising:
directing water to an aerosolization system that includes a turbine and a turbine housing; driving the turbine and generating a system of air that moves through the turbine housing; pumping the water under pressure to a series of nozzles associated with the aerosolization system; mixing the covering, stabilizing or penetrating reagent composition with the water to form a water-composition mixture before the water is emitted from the nozzles; pumping the water-composition mixture to and through the nozzle into the system of air generated by the turbine and passing through the turbine housing to form a water-composition-air mixture; and aerosolizing the water-composition-air mixture and directing the aerosolized water-composition-air mixture from the turbine housing through the air and towards the selected area where at least portions of the composition fall onto the selected area. 2. The method of claim 1 wherein the water comprises wastewater. 3. The method of claim 1 wherein the composition comprises an alternative daily covering composition and wherein the aerosolization system is operative to deliver the alternative daily cover composition to the selected area. 4. The method of claim 1 wherein a series of nozzles are communicatively connected to a ring pipe disposed adjacent the turbine housing, and the method includes directing the water into the ring pipe and directing the covering, stabilizing or penetrating reagent composition into the ring pipe where the composition and the water are mixed together in the ring pipe to form the water-composition mixture. 5. The method of claim 1 including directing the water under pressure into a ring pipe disposed adjacent the turbine housing and mixing the composition with the water in the ring pipe, and aerosolizing the water-composition mixture in the turbine housing causing the aerosolized mixture to be entrained in the system of air generated by the turbine and passing through the turbine housing past the ring pipe. 6. The method of claim 1 wherein the composition includes an antimicrobial composition, a soil stabilizing reagent, a penetrating reagent, an odor suppression composition, or an alternative daily cover composition. 7. The method of claim 1 wherein the aerosolization system includes a ring pipe disposed interiorly of the turbine housing adjacent an outlet end portion of the turbine housing and the method includes emitting the water-composition mixture from nozzles disposed around the ring pipe where the water-composition mixture mixes with the system of air passing through the turbine housing to form the water-composition-air mixture. 8. A method of applying a composition to a selected area with an aerosolization system having a tubular turbine housing and a turbine associated with the turbine housing, the method comprising:
pumping water under pressure to a ring pipe having a series of nozzles with the ring pipe being disposed adjacent an outlet end of the turbine housing; directing the composition to the ring pipe and mixing the composition with the water in the ring pipe to form a water-composition mixture; driving the turbine and generating a system of air within the turbine housing and moving the system of air through the turbine housing and out an outlet end of the turbine housing; emitting the water-composition mixture from the nozzles and aerosolizing the water-composition mixture and entraining the aerosolized water-composition mixture in the system of air moving through the turbine housing to form a water-composition-air mixture; and shooting the water-composition-air mixture, including the aerosolized water-composition mixture, from the outlet end of the turbine housing and towards the selected area such that the water-composition-air mixture travels through the atmosphere towards the selected area and wherein at least a portion of the composition lands on the selected area. 9. The method of claim 8 wherein the water comprises wastewater. 10. The method of claim 8 wherein the composition comprises an alternative daily covering composition and wherein the aerosolization system is operative to deliver the alternative daily cover composition to the selected area. 11. The method of claim 8 wherein a series of nozzles are communicatively connected to a ring pipe disposed adjacent the turbine housing, and the method includes directing the water into the ring pipe and directing a covering, stabilizing or penetrating reagent composition into the ring pipe where the composition and the water are mixed together in the ring pipe to form the water-composition mixture. 12. The method of claim 8 including directing the water under pressure into the ring pipe disposed adjacent the turbine housing and mixing the composition with the water in the ring pipe, and aerosolizing the water-composition mixture in the turbine housing causing the aerosolized mixture to be entrained in the system of air generated by the turbine and passing through the turbine housing past the ring pipe. 13. The method of claim 8 wherein the composition includes an antimicrobial composition, a soil stabilizing reagent, a penetrating reagent, an odor suppression composition, or an alternative daily cover composition. 14. The method of claim 8 wherein the ring pipe is disposed interiorly of the turbine housing adjacent an outlet end portion of the turbine housing and the method includes emitting the water-composition mixture from nozzles disposed around the ring pipe where the water-composition mixture mixes with the system of air passing through the turbine housing to form the water-composition-air mixture. | 3,600 |
13,507 | 13,507 | 14,707,189 | 3,622 | A commerce system is controlled by a shopping agent and a manufacturer agent. A retailer provides the manufacturer agent. An intent to buy is generated using a camera of a mobile device. The intent to buy is received with the shopping agent. The intent to buy is transmitted to the manufacturer agent. The intent to buy is read from the manufacturer agent using an application programming interface. A negotiation is performed between the shopping agent and manufacturer agent to generate a personalized offer for a specific product satisfying the intent to buy. The specific product is selected from a consideration set. The specific product is purchased at the retailer. The personalized offer is redeemed by scanning a loyalty card at a point-of-sale station of the retailer. A commission is paid to the retailer to load the personalized offer on the loyalty card. | 1. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; performing a negotiation between the shopping agent and manufacturer agent to generate a personalized offer for a specific product satisfying the intent to buy; purchasing the specific product at a retailer; and redeeming the personalized offer by scanning a loyalty card at a point-of-sale station of the retailer. 2. The method of claim 1, further including paying a commission to the retailer to load the personalized offer on the loyalty card. 3. The method of claim 1, further including:
transmitting the intent to buy to the manufacturer agent; and reading the intent to buy from the manufacturer agent using an application programming interface (API). 4. The method of claim 1, wherein the retailer provides the manufacturer agent. 5. The method of claim 1, further including selecting the specific product from a consideration set. 6. The method of claim 1, further including scanning product information using a camera of a mobile device to generate the intent to buy. 7. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; performing a negotiation between the shopping agent and manufacturer agent to satisfy the intent to buy with a specific product; and loading a personalized offer for the specific product onto a loyalty card. 8. The method of claim 7, further including selecting the specific product from a consideration set. 9. The method of claim 7, further including selecting the specific product to satisfy weighted attributes. 10. The method of claim 7, further including paying a commission to a retailer to load the personalized offer on the loyalty card. 11. The method of claim 10, further including redeeming the personalized offer by scanning the loyalty card at the retailer. 12. The method of claim 7, wherein the loyalty card is a payment card. 13. The method of claim 7, further including performing a negotiation between the shopping agent and a plurality of manufacturer agents. 14. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; and satisfying the intent to buy using a negotiation between the shopping agent and manufacturer agent. 15. The method of claim 14, wherein the shopping agent represents a retailer. 16. The method of claim 15, wherein the retailer provides in-store advertising in return for a discount from the manufacturer agent. 17. The method of claim 15, wherein the retailer provides the manufacturing agent. 18. The method of claim 14, further including satisfying the intent to buy with a product selected from a consideration set. 19. The method of claim 14, further including generating a personalized offer for a specific product satisfying the intent to buy. 20. The method of claim 19, further including loading the personalized offer onto a loyalty card or payment card. 21. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; and performing a negotiation between the shopping agent and manufacturer agent. 22. The method of claim 21, further including determining a personalized offer for a product using the negotiation. 23. The method of claim 22, further including redeeming the personalized offer at a retailer. 24. The method of claim 21, further including:
receiving an intent to buy with the shopping agent; and satisfying the intent to buy using the negotiation. 25. The method of claim 21, wherein the shopping agent represents a retailer. | A commerce system is controlled by a shopping agent and a manufacturer agent. A retailer provides the manufacturer agent. An intent to buy is generated using a camera of a mobile device. The intent to buy is received with the shopping agent. The intent to buy is transmitted to the manufacturer agent. The intent to buy is read from the manufacturer agent using an application programming interface. A negotiation is performed between the shopping agent and manufacturer agent to generate a personalized offer for a specific product satisfying the intent to buy. The specific product is selected from a consideration set. The specific product is purchased at the retailer. The personalized offer is redeemed by scanning a loyalty card at a point-of-sale station of the retailer. A commission is paid to the retailer to load the personalized offer on the loyalty card.1. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; performing a negotiation between the shopping agent and manufacturer agent to generate a personalized offer for a specific product satisfying the intent to buy; purchasing the specific product at a retailer; and redeeming the personalized offer by scanning a loyalty card at a point-of-sale station of the retailer. 2. The method of claim 1, further including paying a commission to the retailer to load the personalized offer on the loyalty card. 3. The method of claim 1, further including:
transmitting the intent to buy to the manufacturer agent; and reading the intent to buy from the manufacturer agent using an application programming interface (API). 4. The method of claim 1, wherein the retailer provides the manufacturer agent. 5. The method of claim 1, further including selecting the specific product from a consideration set. 6. The method of claim 1, further including scanning product information using a camera of a mobile device to generate the intent to buy. 7. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; performing a negotiation between the shopping agent and manufacturer agent to satisfy the intent to buy with a specific product; and loading a personalized offer for the specific product onto a loyalty card. 8. The method of claim 7, further including selecting the specific product from a consideration set. 9. The method of claim 7, further including selecting the specific product to satisfy weighted attributes. 10. The method of claim 7, further including paying a commission to a retailer to load the personalized offer on the loyalty card. 11. The method of claim 10, further including redeeming the personalized offer by scanning the loyalty card at the retailer. 12. The method of claim 7, wherein the loyalty card is a payment card. 13. The method of claim 7, further including performing a negotiation between the shopping agent and a plurality of manufacturer agents. 14. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; receiving an intent to buy with the shopping agent; and satisfying the intent to buy using a negotiation between the shopping agent and manufacturer agent. 15. The method of claim 14, wherein the shopping agent represents a retailer. 16. The method of claim 15, wherein the retailer provides in-store advertising in return for a discount from the manufacturer agent. 17. The method of claim 15, wherein the retailer provides the manufacturing agent. 18. The method of claim 14, further including satisfying the intent to buy with a product selected from a consideration set. 19. The method of claim 14, further including generating a personalized offer for a specific product satisfying the intent to buy. 20. The method of claim 19, further including loading the personalized offer onto a loyalty card or payment card. 21. A method of controlling a commerce system, comprising:
providing a shopping agent; providing a manufacturer agent; and performing a negotiation between the shopping agent and manufacturer agent. 22. The method of claim 21, further including determining a personalized offer for a product using the negotiation. 23. The method of claim 22, further including redeeming the personalized offer at a retailer. 24. The method of claim 21, further including:
receiving an intent to buy with the shopping agent; and satisfying the intent to buy using the negotiation. 25. The method of claim 21, wherein the shopping agent represents a retailer. | 3,600 |
13,508 | 13,508 | 12,154,712 | 3,646 | A machine for producing flow of isotopic fuel through a material with a wire or rod anode which does not corrode, such as platinum, a solution, such as deuterium oxide (D2O), in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode, a power supply capable of apply an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts, a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of the isotopic fuel, a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000, a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees. | 1. A machine for producing flow of isotopic fuel through a material comprising:
a wire or rod anode which does not corrode, such as platinum; a solution, including deuterium oxide (D2O), in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; a power supply capable of applying an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; said material being a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees; and 2. A machine as in claim 1 which also has an illumination sources, in the near infrared or visible region—to increase loading the cathode. 3. A machine as in claim 1 which also has an mechanical separator to separate gases generated at said anode and cathode. 4. A machine as in claim 1 which also has a material which is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. 5. A machine as in claim 1 which said solution contains ions of the material to enable codeposition of said material. 6. A machine as in claim 1 which also has said cathode of a shape involving a curve which part of a helix. 7. A machine for producing flow of isotopic fuel through a material comprising:
a wire or rod anode which does not corrode, such as platinum; a solution, such as water, in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; a power supply capable of applying an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; a cathode of helical shape, long axis parallel to the anode, of nickel, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees. 8. A machine as in claim 7 which also has an illumination sources, in the near infrared or visible region—to increase loading the cathode. 9. A machine as in claim 7 which also has an mechanical separator to separate gases generated at said anode and cathode. 10. A machine as in claim 7 which also has a material which is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. 11. A machine as in claim 7 wherein said solution is one of the group consisting of light water, heavy water, heavy-water doped light water, a sol-gel containing said isotopic fuel, and a codepositional solute containing said material in which the isotopic fuel flows. 12. A machine as in claim 7 which also has said cathode of a shape which is a member of the group consisting of a curve which part of a helix, or part of a spiral, or part of a circle, or similar shape. 13. A machine as in claim 7 wherein said solution is replaced by said isotopic fuel in a gas phase. 14. A process for producing flow of isotopic fuel through a material comprising:
enclosing a volume of solution, such as deuterium oxide (D2O), in which are immersed two electrodes, anode and cathode, ensuring that the solution will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; providing a wire or rod anode which does not corrode, such as platinum; providing said material as a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; using a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; powering the system by an applied electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; maintaining a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees. 15. A process as in claim 14 which also has an external laser holding bracket to hold, position, an laser to illuminate the cathode 16. A process as in claim 14 which also has an mechanical protrusion on the slidable gas-catching hood to secure hood position during slide-up. 17. A process as in claim 14 which also has said fashioned with four leads so as to enable an in situ four terminal conductivity measurement and to provide for means provide a second applied electric field. 18. A process as in claim 14 which also has a reservoir of heavy water and pump, fittings, supply line, valves to maintain heavy water levels and purge the fuel cell line. 19. A process as in claim 14 where said metal loaded with hydrogen is palladium and the hydrogen is a deuteron. 20. A process as in claim 14 where said metal loaded is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. | A machine for producing flow of isotopic fuel through a material with a wire or rod anode which does not corrode, such as platinum, a solution, such as deuterium oxide (D2O), in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode, a power supply capable of apply an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts, a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of the isotopic fuel, a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000, a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees.1. A machine for producing flow of isotopic fuel through a material comprising:
a wire or rod anode which does not corrode, such as platinum; a solution, including deuterium oxide (D2O), in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; a power supply capable of applying an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; said material being a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees; and 2. A machine as in claim 1 which also has an illumination sources, in the near infrared or visible region—to increase loading the cathode. 3. A machine as in claim 1 which also has an mechanical separator to separate gases generated at said anode and cathode. 4. A machine as in claim 1 which also has a material which is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. 5. A machine as in claim 1 which said solution contains ions of the material to enable codeposition of said material. 6. A machine as in claim 1 which also has said cathode of a shape involving a curve which part of a helix. 7. A machine for producing flow of isotopic fuel through a material comprising:
a wire or rod anode which does not corrode, such as platinum; a solution, such as water, in which are immersed the electrodes, anode and cathode, which will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; a power supply capable of applying an electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; a cathode of helical shape, long axis parallel to the anode, of nickel, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees. 8. A machine as in claim 7 which also has an illumination sources, in the near infrared or visible region—to increase loading the cathode. 9. A machine as in claim 7 which also has an mechanical separator to separate gases generated at said anode and cathode. 10. A machine as in claim 7 which also has a material which is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. 11. A machine as in claim 7 wherein said solution is one of the group consisting of light water, heavy water, heavy-water doped light water, a sol-gel containing said isotopic fuel, and a codepositional solute containing said material in which the isotopic fuel flows. 12. A machine as in claim 7 which also has said cathode of a shape which is a member of the group consisting of a curve which part of a helix, or part of a spiral, or part of a circle, or similar shape. 13. A machine as in claim 7 wherein said solution is replaced by said isotopic fuel in a gas phase. 14. A process for producing flow of isotopic fuel through a material comprising:
enclosing a volume of solution, such as deuterium oxide (D2O), in which are immersed two electrodes, anode and cathode, ensuring that the solution will provide the isotopic fuel (hydrogen or deuterons) and load the cathode; providing a wire or rod anode which does not corrode, such as platinum; providing said material as a cathode of helical shape, long axis parallel to the anode, of palladium, able to load with the isotopic fuel to support intraelectrode flux of said isotopic fuel; using a ratio of diameters between the full width of the helical wound cathode and the anode of 4 to 1000; powering the system by an applied electric field intensity between the electrodes, able to produce loading and intraelectrode flux of the isotopic fuel, with a potential in the range of 4 to 4000 volts; maintaining a distance between the electrodes, adjusted to create direct loading, and over each portion of the helical cathode, closest to the anode, over a two dimensional angle of 45 to 130 degrees. 15. A process as in claim 14 which also has an external laser holding bracket to hold, position, an laser to illuminate the cathode 16. A process as in claim 14 which also has an mechanical protrusion on the slidable gas-catching hood to secure hood position during slide-up. 17. A process as in claim 14 which also has said fashioned with four leads so as to enable an in situ four terminal conductivity measurement and to provide for means provide a second applied electric field. 18. A process as in claim 14 which also has a reservoir of heavy water and pump, fittings, supply line, valves to maintain heavy water levels and purge the fuel cell line. 19. A process as in claim 14 where said metal loaded with hydrogen is palladium and the hydrogen is a deuteron. 20. A process as in claim 14 where said metal loaded is a member of the group consisting of Group VIII, Group IVb and Vb, and rare earth elements, including palladium, nickel, titanium, nickel, cerium, lanthanum, niobium, tantalum, thorium, vanadium, zirconium, and their alloys and composites, and those materials which are “preloaded” with protons or deuterons already in place, including PdDx and TiDx. | 3,600 |
13,509 | 13,509 | 14,317,574 | 3,695 | A method and terminal are provided for maintaining media and operational information for devices connected to a self service terminal. Self service terminals such as automatic teller machines (ATM) support multiple applications that use the devices attached to the ATM. During the ATM reconciliation process, operation device information is needed for each device and for application. The application specific device information is gathered by software extensions to the XFS components which operate the devices of the ATM. | 1. A computer implemented method of providing application specific device information on a self service terminal in which multiple applications control the same device, the method comprising the steps of:
receiving from a first application a command to operate a first device connected to the self service terminal; storing first application device specific information for the first device after receiving the command from the first application; receiving from a second application a command to operate the first device; and storing second application device specific information for the first device after receiving the command from the second application. 2. The method of claim 1, wherein storing first application device specific information for the first device comprises storing a count of the number of operations performed by the first device at the command of the first application and wherein storing second application device specific information for the first device comprises storing a count of the number of operations performed by the first device at the command of the second application. 3. The method of claim 1, further comprising communicating (i) the first application device specific information for the first device wherein the first application device specific information includes first information only for first device operations performed in response to commands from the first application and (ii) the second application device specific information wherein the second application device specific information includes first information only for first device operations performed in response to commands from the second application. 4. The method of claim 1, further comprising communicating the command from the first application to operate the first device to a software component to implement the command. 5. The method of claim 2, further comprising communicating the command from the second application to operate the first device to the software component to implement the command. 6. The method of claim 3, wherein the software component is an extension to an XFS component of the self service terminal. 7. The method of claim 1, wherein the self service terminal is an automatic teller machine. 8. The method of claim 1, further comprising reconciling the operations of the first and second application using device count information associated with the first application and the second application. 9. The method of claim 1, wherein the first device is a cash dispenser and the device specific information for the first device comprises a count of banknotes (number and value) dispensed by the first device. 10. The method of claim 1, wherein the first device is a cash or note acceptor and the device specific information for the first device comprises a count for each denomination of cash or notes accepted. 11. The method of claim 1, wherein the first device is a check acceptor. 12. The method of claim 1, wherein the first device is a card reader. 13. The method of claim 1, wherein the method is implemented with a software wrapper that includes XFS components and software that implements the steps of claim 1 and communicates with the XFS components and wherein the software wrapper exposes the software interface of the XFS components. 14. A self service terminal comprising:
a device; a first and second application, each of the first and second applications being operable to control the device; a device manager in communication with the first and second applications and being operable to:
receive from the first application a command relating to the device;
store first application information, where the first application information is associated with operations performed by the device in response to commands from the first application;
receive from a second application a command relating to the device;
store second application information, where the second application information is associated with operations performed by the device in response to commands from the second application. 15. The terminal of claim 14, further comprising communicating first and second application information to a third application, the third application being operable to perform a reconciliation function. 16. The terminal of claim 14, where the device is a cash dispenser. 17. The terminal of claim 14, where the device is a cash or note acceptor. 18. The terminal of claim 14, where the device is a check acceptor. 19. The terminal of claim 14, where the self service terminal is an automatic teller machine. 20. One or more non-transitory digital storage media storing data and instructions which, when the instructions are executed by one or more computing devices, cause performance of the method recited in claim 1. | A method and terminal are provided for maintaining media and operational information for devices connected to a self service terminal. Self service terminals such as automatic teller machines (ATM) support multiple applications that use the devices attached to the ATM. During the ATM reconciliation process, operation device information is needed for each device and for application. The application specific device information is gathered by software extensions to the XFS components which operate the devices of the ATM.1. A computer implemented method of providing application specific device information on a self service terminal in which multiple applications control the same device, the method comprising the steps of:
receiving from a first application a command to operate a first device connected to the self service terminal; storing first application device specific information for the first device after receiving the command from the first application; receiving from a second application a command to operate the first device; and storing second application device specific information for the first device after receiving the command from the second application. 2. The method of claim 1, wherein storing first application device specific information for the first device comprises storing a count of the number of operations performed by the first device at the command of the first application and wherein storing second application device specific information for the first device comprises storing a count of the number of operations performed by the first device at the command of the second application. 3. The method of claim 1, further comprising communicating (i) the first application device specific information for the first device wherein the first application device specific information includes first information only for first device operations performed in response to commands from the first application and (ii) the second application device specific information wherein the second application device specific information includes first information only for first device operations performed in response to commands from the second application. 4. The method of claim 1, further comprising communicating the command from the first application to operate the first device to a software component to implement the command. 5. The method of claim 2, further comprising communicating the command from the second application to operate the first device to the software component to implement the command. 6. The method of claim 3, wherein the software component is an extension to an XFS component of the self service terminal. 7. The method of claim 1, wherein the self service terminal is an automatic teller machine. 8. The method of claim 1, further comprising reconciling the operations of the first and second application using device count information associated with the first application and the second application. 9. The method of claim 1, wherein the first device is a cash dispenser and the device specific information for the first device comprises a count of banknotes (number and value) dispensed by the first device. 10. The method of claim 1, wherein the first device is a cash or note acceptor and the device specific information for the first device comprises a count for each denomination of cash or notes accepted. 11. The method of claim 1, wherein the first device is a check acceptor. 12. The method of claim 1, wherein the first device is a card reader. 13. The method of claim 1, wherein the method is implemented with a software wrapper that includes XFS components and software that implements the steps of claim 1 and communicates with the XFS components and wherein the software wrapper exposes the software interface of the XFS components. 14. A self service terminal comprising:
a device; a first and second application, each of the first and second applications being operable to control the device; a device manager in communication with the first and second applications and being operable to:
receive from the first application a command relating to the device;
store first application information, where the first application information is associated with operations performed by the device in response to commands from the first application;
receive from a second application a command relating to the device;
store second application information, where the second application information is associated with operations performed by the device in response to commands from the second application. 15. The terminal of claim 14, further comprising communicating first and second application information to a third application, the third application being operable to perform a reconciliation function. 16. The terminal of claim 14, where the device is a cash dispenser. 17. The terminal of claim 14, where the device is a cash or note acceptor. 18. The terminal of claim 14, where the device is a check acceptor. 19. The terminal of claim 14, where the self service terminal is an automatic teller machine. 20. One or more non-transitory digital storage media storing data and instructions which, when the instructions are executed by one or more computing devices, cause performance of the method recited in claim 1. | 3,600 |
13,510 | 13,510 | 14,181,620 | 3,691 | A decumulation management system provides guidance for decumulation of a portfolio over a decumulation period of time. A spending amount is withdrawn from the portfolio during the decumulation period of time. The decumulation management system determines the probability of successfully withdrawing the spending amount during the remaining decumulation period and establishes thresholds for adjusting the spending amount and a risk profile of the portfolio based on the performance of the portfolio during the decumulation. When the portfolio value decreases below the thresholds, the spending amount may be reduced, and when the portfolio value exceeds the thresholds, the spending amount may be increased and the risk profile of the portfolio is decreased. The decumulation management system may provide recommendations based on these thresholds, or may automatically manage withdrawals of the spending amount and investments to match the risk profile. | 1. A computer-implemented method for managing asset decumulation performed by a decumulation management system, the method comprising:
identifying a plurality of spending amounts for decumulation of a portfolio over a decumulation period of time, the portfolio including a portfolio value invested in assets with a risk profile, the spending amounts indicating an amount withdrawn from the portfolio value at designated times during the decumulation period; determining, for each spending amount at a plurality of points of time in the decumulation period and at a plurality of portfolio values, the probability of successfully withdrawing the spending amount at the designated times for a duration of the decumulation period at the risk profile; and determining, for each spending amount at a point of time in the plurality of points of time, a threshold portfolio value for decreasing the spending amount to a lower spending amount when the portfolio value is lower than the threshold portfolio value, the threshold portfolio value determined based on the probability of successfully withdrawing the spending amount for the duration. 2. The computer-implemented method of claim 1, wherein the threshold portfolio value for decreasing the spending amount is determined when the probability is lower than 60% 3. The computer-implemented method of claim 1, further comprising determining, for each spending amount at a point of time in the plurality of points of time, a threshold portfolio value for increasing the spending amount to a higher spending amount based on the probability of successfully withdrawing the spending amount. 4. The computer-implemented method of claim 3, wherein the threshold portfolio value for increasing the spending amount is determined when the probability is higher than 97%. 5. The computer-implemented method of claim 1, further comprising monitoring the portfolio value during the decumulation of the portfolio at an initial spending amount of the plurality of spending amounts and recommending a decrease in spending amount when the portfolio value is less than the threshold portfolio value. 6. The method of claim 5, wherein recommending a decrease in spending amount comprises automatically reducing the spending amount from the initial spending amount to a lower spending amount of the plurality of spending amounts. 7. The method of claim 1, further comprising determining another threshold portfolio value for decreasing the risk profile of the invested assets to a lower risk profile when the portfolio value is higher than the other threshold portfolio value, the other threshold portfolio value determined based on the probability of successfully withdrawing the spending amount. 8. The method of claim 1, wherein the probability of successfully withdrawing the spending amount is determined based on iterative Monte-Carlo simulations. 9. The method of claim 1, wherein the probability of successfully withdrawing the spending amount is determined based on a funded ratio. 10. A computer-implemented method for managing asset decumulation performed by a decumulation management system, the method comprising:
identifying a spending amount for decumulation of a portfolio over a decumulation period of time, the portfolio including a portfolio value, the spending amount indicating an amount withdrawn from the portfolio value at designated times during the decumulating period; determining, for each risk profile of a plurality of risk profiles at a plurality of points in time in the decumulation period and at a plurality of portfolio values, the probability of successfully withdrawing the spending amount at the designated times for a duration of the decumulation period, each risk profile representing investment of the portfolio in a mix of assets; and determining, for each of the plurality of risk profiles at a point in the plurality of points of time, a threshold portfolio value for decreasing the risk profile to a lower risk profile when the portfolio value is higher than the threshold portfolio value, the threshold portfolio value determined based on the probability of successfully withdrawing the spending amount for the duration of the decumulation period. 11. The computer-implemented method of claim 10, wherein the threshold portfolio value for decreasing the risk profile is determined when the probability is higher than 90%. 12. The computer-implemented method of claim 10, further comprising monitoring the portfolio value during the decumulation of the portfolio at an initial mix of assets corresponding to an initial risk profile and recommending a decrease in risk profile of the portfolio when the portfolio value is greater than the threshold portfolio value. 13. The computer-implemented method of claim 12, wherein recommending a decrease in risk profile of the portfolio comprises automatically reallocating the assets to the mix of assets corresponding to a lower risk profile. 14. The computer-implemented method of claim 10, further comprising determining another threshold portfolio value for decreasing the spending amount when the portfolio value is below the other threshold portfolio value, the other portfolio value determined based on the probability of successfully withdrawing the spending amount. 15. The method of claim 10, wherein the probability of successfully withdrawing the spending amount is determined based on iterative Monte-Carlo simulations. 16. The method of claim 10, wherein the probability of successfully withdrawing the spending amount is calculated based on a funded ratio. | A decumulation management system provides guidance for decumulation of a portfolio over a decumulation period of time. A spending amount is withdrawn from the portfolio during the decumulation period of time. The decumulation management system determines the probability of successfully withdrawing the spending amount during the remaining decumulation period and establishes thresholds for adjusting the spending amount and a risk profile of the portfolio based on the performance of the portfolio during the decumulation. When the portfolio value decreases below the thresholds, the spending amount may be reduced, and when the portfolio value exceeds the thresholds, the spending amount may be increased and the risk profile of the portfolio is decreased. The decumulation management system may provide recommendations based on these thresholds, or may automatically manage withdrawals of the spending amount and investments to match the risk profile.1. A computer-implemented method for managing asset decumulation performed by a decumulation management system, the method comprising:
identifying a plurality of spending amounts for decumulation of a portfolio over a decumulation period of time, the portfolio including a portfolio value invested in assets with a risk profile, the spending amounts indicating an amount withdrawn from the portfolio value at designated times during the decumulation period; determining, for each spending amount at a plurality of points of time in the decumulation period and at a plurality of portfolio values, the probability of successfully withdrawing the spending amount at the designated times for a duration of the decumulation period at the risk profile; and determining, for each spending amount at a point of time in the plurality of points of time, a threshold portfolio value for decreasing the spending amount to a lower spending amount when the portfolio value is lower than the threshold portfolio value, the threshold portfolio value determined based on the probability of successfully withdrawing the spending amount for the duration. 2. The computer-implemented method of claim 1, wherein the threshold portfolio value for decreasing the spending amount is determined when the probability is lower than 60% 3. The computer-implemented method of claim 1, further comprising determining, for each spending amount at a point of time in the plurality of points of time, a threshold portfolio value for increasing the spending amount to a higher spending amount based on the probability of successfully withdrawing the spending amount. 4. The computer-implemented method of claim 3, wherein the threshold portfolio value for increasing the spending amount is determined when the probability is higher than 97%. 5. The computer-implemented method of claim 1, further comprising monitoring the portfolio value during the decumulation of the portfolio at an initial spending amount of the plurality of spending amounts and recommending a decrease in spending amount when the portfolio value is less than the threshold portfolio value. 6. The method of claim 5, wherein recommending a decrease in spending amount comprises automatically reducing the spending amount from the initial spending amount to a lower spending amount of the plurality of spending amounts. 7. The method of claim 1, further comprising determining another threshold portfolio value for decreasing the risk profile of the invested assets to a lower risk profile when the portfolio value is higher than the other threshold portfolio value, the other threshold portfolio value determined based on the probability of successfully withdrawing the spending amount. 8. The method of claim 1, wherein the probability of successfully withdrawing the spending amount is determined based on iterative Monte-Carlo simulations. 9. The method of claim 1, wherein the probability of successfully withdrawing the spending amount is determined based on a funded ratio. 10. A computer-implemented method for managing asset decumulation performed by a decumulation management system, the method comprising:
identifying a spending amount for decumulation of a portfolio over a decumulation period of time, the portfolio including a portfolio value, the spending amount indicating an amount withdrawn from the portfolio value at designated times during the decumulating period; determining, for each risk profile of a plurality of risk profiles at a plurality of points in time in the decumulation period and at a plurality of portfolio values, the probability of successfully withdrawing the spending amount at the designated times for a duration of the decumulation period, each risk profile representing investment of the portfolio in a mix of assets; and determining, for each of the plurality of risk profiles at a point in the plurality of points of time, a threshold portfolio value for decreasing the risk profile to a lower risk profile when the portfolio value is higher than the threshold portfolio value, the threshold portfolio value determined based on the probability of successfully withdrawing the spending amount for the duration of the decumulation period. 11. The computer-implemented method of claim 10, wherein the threshold portfolio value for decreasing the risk profile is determined when the probability is higher than 90%. 12. The computer-implemented method of claim 10, further comprising monitoring the portfolio value during the decumulation of the portfolio at an initial mix of assets corresponding to an initial risk profile and recommending a decrease in risk profile of the portfolio when the portfolio value is greater than the threshold portfolio value. 13. The computer-implemented method of claim 12, wherein recommending a decrease in risk profile of the portfolio comprises automatically reallocating the assets to the mix of assets corresponding to a lower risk profile. 14. The computer-implemented method of claim 10, further comprising determining another threshold portfolio value for decreasing the spending amount when the portfolio value is below the other threshold portfolio value, the other portfolio value determined based on the probability of successfully withdrawing the spending amount. 15. The method of claim 10, wherein the probability of successfully withdrawing the spending amount is determined based on iterative Monte-Carlo simulations. 16. The method of claim 10, wherein the probability of successfully withdrawing the spending amount is calculated based on a funded ratio. | 3,600 |
13,511 | 13,511 | 15,164,272 | 3,689 | A method and system for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) website are provided. The method includes receiving by an e-commerce server a message that at least one product is added to an electronic shopping cart of the e-commerce website displayed on a consumer device; collecting by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identifying, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; selecting at least one motivational content item for display on the consumer device; and causing a display of the selected at least one motivational content item on a display of the consumer device. | 1. A method for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) website, comprising:
receiving by an e-commerce server a message that at least one product is added to an electronic shopping cart of the e-commerce website displayed on a consumer device; collecting by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identifying, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; selecting at least one motivational content item for display on the consumer device; and causing a display of the selected at least one motivational content item on a display of the consumer device. 2. The method of claim 1, wherein the at least one user-activity parameter is at least one of: behavioral information related to the user, demographic information, a time that the at least one product added to the cart, and shopping history. 3. The method of claim 1, wherein the message is received from any one of: the consumer device, a web source hosting the e-commerce website. 4. The method of claim 1, further comprising:
collecting at least one product-related parameter from a merchant device. 5. The method of claim 4, wherein the at least one product-related parameter includes at least one of: a type of product, a product price, shipping costs, a minimum price for the product, a minimum margin for the product, and an inventory level of the product. 6. The method of claim 1, wherein the identification of a user attempt not to complete a purchase transaction is based on at least one of: an explicit identification, and an implicit identification. 7. The method of claim 6, wherein determining the implicit identification further comprises:
comparing each of the at least one user-activity parameter to a baseline; generating a significant parameter for each user-activity parameter being deviate from the respective baseline by a predefined threshold, the implicit identification is determined upon generation of at least one significant parameter. 8. The method of claim 5, wherein the at least one motivational content item is selected based on at least one of the user-activity and the product related parameter. 9. The method of claim 5, wherein the at least one motivational content item is selected via the merchant device of the merchant. 10. The method of claim 1, wherein the at least one motivational content item is designed to incentivize the user to complete the purchase transaction. 11. The method of claim 1, wherein the at least one motivational content item includes at least a link inviting the user to make a counter offer on the product in interest. 12. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 13. A system for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) server website, comprising:
a processing system; and, a memory coupled to the processing system, the memory containing instructions that, when executed by the processing system, configure the system to: receive by an e-commerce server a message that at least one product is added to an electronic shopping cart of an e-commerce website displayed on a consumer device; collect by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identify, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; select at least one motivational content item for display on the consumer device; and cause a display of the selected at least one motivational content item on a display of the consumer device. 14. The system of claim 13, wherein the at least one user-activity parameter is at least one of: behavioral information related to the user, demographic information, a time that the at least one product added to the cart, and shopping history. 15. The system of claim 13, wherein the message is received from any one of: the consumer device, a web source hosting the e-commerce website. 16. The system of claim 13, wherein the system is further configured to:
collect at least one product-related parameter from a merchant device. 17. The system of claim 16, wherein the at least one product-related parameter includes at least one of: a type of product, a product price, shipping costs, a minimum price for the product, a minimum margin for the product, and an inventory level of the product. 18. The system of claim 13, wherein the identification of a user attempt not to complete a purchase transaction is based on at least one of: an explicit identification, and an implicit identification. 19. The system of claim 18, wherein in determining the implicit identification the system is further configured to:
compare each of the at least one user-activity parameter to a baseline; generate a significant parameter for each user-activity parameter being deviate from the respective baseline by a predefined threshold, the implicit identification is determined upon generation of at least one significant parameter. 20. The system of claim 17, wherein the at least one motivational content item is selected based on at least one of the user-activity and the product related parameter. 21. The system of claim 17, wherein the at least one motivational content item is selected via the merchant device of the merchant. 22. The system of claim 13, wherein the at least one motivational content item is designed to incentivize the user to complete the purchase transaction. 23. The system of claim 13, wherein the at least one motivational content item includes at least a link inviting the user to make a counter offer on the product in interest. | A method and system for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) website are provided. The method includes receiving by an e-commerce server a message that at least one product is added to an electronic shopping cart of the e-commerce website displayed on a consumer device; collecting by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identifying, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; selecting at least one motivational content item for display on the consumer device; and causing a display of the selected at least one motivational content item on a display of the consumer device.1. A method for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) website, comprising:
receiving by an e-commerce server a message that at least one product is added to an electronic shopping cart of the e-commerce website displayed on a consumer device; collecting by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identifying, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; selecting at least one motivational content item for display on the consumer device; and causing a display of the selected at least one motivational content item on a display of the consumer device. 2. The method of claim 1, wherein the at least one user-activity parameter is at least one of: behavioral information related to the user, demographic information, a time that the at least one product added to the cart, and shopping history. 3. The method of claim 1, wherein the message is received from any one of: the consumer device, a web source hosting the e-commerce website. 4. The method of claim 1, further comprising:
collecting at least one product-related parameter from a merchant device. 5. The method of claim 4, wherein the at least one product-related parameter includes at least one of: a type of product, a product price, shipping costs, a minimum price for the product, a minimum margin for the product, and an inventory level of the product. 6. The method of claim 1, wherein the identification of a user attempt not to complete a purchase transaction is based on at least one of: an explicit identification, and an implicit identification. 7. The method of claim 6, wherein determining the implicit identification further comprises:
comparing each of the at least one user-activity parameter to a baseline; generating a significant parameter for each user-activity parameter being deviate from the respective baseline by a predefined threshold, the implicit identification is determined upon generation of at least one significant parameter. 8. The method of claim 5, wherein the at least one motivational content item is selected based on at least one of the user-activity and the product related parameter. 9. The method of claim 5, wherein the at least one motivational content item is selected via the merchant device of the merchant. 10. The method of claim 1, wherein the at least one motivational content item is designed to incentivize the user to complete the purchase transaction. 11. The method of claim 1, wherein the at least one motivational content item includes at least a link inviting the user to make a counter offer on the product in interest. 12. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 13. A system for preventing electronic shopping cart abandonment in an electronic commerce (e-commerce) server website, comprising:
a processing system; and, a memory coupled to the processing system, the memory containing instructions that, when executed by the processing system, configure the system to: receive by an e-commerce server a message that at least one product is added to an electronic shopping cart of an e-commerce website displayed on a consumer device; collect by the e-commerce server at least one user-activity parameter related to a user of the consumer device; identify, using the at least one user-activity parameter, an attempt of a user of the consumer device not to complete a purchase transaction of the at least one product; select at least one motivational content item for display on the consumer device; and cause a display of the selected at least one motivational content item on a display of the consumer device. 14. The system of claim 13, wherein the at least one user-activity parameter is at least one of: behavioral information related to the user, demographic information, a time that the at least one product added to the cart, and shopping history. 15. The system of claim 13, wherein the message is received from any one of: the consumer device, a web source hosting the e-commerce website. 16. The system of claim 13, wherein the system is further configured to:
collect at least one product-related parameter from a merchant device. 17. The system of claim 16, wherein the at least one product-related parameter includes at least one of: a type of product, a product price, shipping costs, a minimum price for the product, a minimum margin for the product, and an inventory level of the product. 18. The system of claim 13, wherein the identification of a user attempt not to complete a purchase transaction is based on at least one of: an explicit identification, and an implicit identification. 19. The system of claim 18, wherein in determining the implicit identification the system is further configured to:
compare each of the at least one user-activity parameter to a baseline; generate a significant parameter for each user-activity parameter being deviate from the respective baseline by a predefined threshold, the implicit identification is determined upon generation of at least one significant parameter. 20. The system of claim 17, wherein the at least one motivational content item is selected based on at least one of the user-activity and the product related parameter. 21. The system of claim 17, wherein the at least one motivational content item is selected via the merchant device of the merchant. 22. The system of claim 13, wherein the at least one motivational content item is designed to incentivize the user to complete the purchase transaction. 23. The system of claim 13, wherein the at least one motivational content item includes at least a link inviting the user to make a counter offer on the product in interest. | 3,600 |
13,512 | 13,512 | 15,665,532 | 3,611 | A support assembly for a vehicle includes at least two spherical tires travelling on a road surface and rotating relative to the road surface and the vehicle and a drive system magnetically driving rotation of the tires relative to the drive system itself such that no portion of the drive system physically contacts the tires or the road surface. The tires each have an outer tread layer comprising a material having a first stiffness when dry and a second stiffness when wet, the first stiffness being greater than the second stiffness. | 1. A support assembly for a vehicle comprising:
at least two spherical tires travelling on a road surface and rotating relative to the road surface and the vehicle; the tires having an outer tread layer comprising a material having a first stiffness when dry and a second stiffness when wet, the first stiffness being greater than the second stiffness; and a drive system magnetically driving rotation of the tires relative to the drive system itself such that no portion of the drive system physically contacts the tires or the road surface, the drive system magnetically levitates the vehicle a first predetermined distance from the tires, at least one of the spherical tires comprising: an outer tread layer comprising a filler selected from the group consisting of carbon black and silica and a copolymer, the copolymer comprising: a polymeric backbone chain derived from a monomer comprising at least one conjugated diene monomer and, optionally, at least one vinyl aromatic monomer; and polymeric sidechains bonded to the backbone chain, the sidechains comprising a polymer capable of exhibiting a lower critical solution temperature (LCST) and, optionally, at least one additional diene based elastomer. 2. The support assembly as set forth in claim 1 wherein the drive system magnetically levitates itself a second predetermined distance from an inner surface of the tires. 3. The support assembly as set forth in claim 2 wherein the tires are closed sphere having and interior space completely separate from external environment. 4. The support assembly as set forth in claim 3 wherein the drive system comprises a first magnetically passive part and a second magnetically active part. 5. The support assembly as set forth in claim 4 wherein the first part generates only a constant magnetic field. 6. The support assembly as set forth in claim 5 wherein the second part generates a constant magnetic field and a variable magnetic field. 7. The support assembly as set forth in claim 6 wherein the drive system maintains the vehicle at a substantially constant orientation relative to the drive system. 8. The support assembly as set forth in claim 7 wherein the tires include a plurality off layers. 9. The support assembly as set forth in claim 8 wherein one of the plurality of layers mechanically supports a portion of a load determined by the vehicle. 10. The support assembly as set forth in claim 9 wherein one of the plurality of layers comprises a tread for generating traction between the tires and the road surface. 11. The support assembly as set forth in claim 10 wherein one of the plurality of layers comprises an elastomeric layer for damping vibration caused by the tires traveling over the road surface. | A support assembly for a vehicle includes at least two spherical tires travelling on a road surface and rotating relative to the road surface and the vehicle and a drive system magnetically driving rotation of the tires relative to the drive system itself such that no portion of the drive system physically contacts the tires or the road surface. The tires each have an outer tread layer comprising a material having a first stiffness when dry and a second stiffness when wet, the first stiffness being greater than the second stiffness.1. A support assembly for a vehicle comprising:
at least two spherical tires travelling on a road surface and rotating relative to the road surface and the vehicle; the tires having an outer tread layer comprising a material having a first stiffness when dry and a second stiffness when wet, the first stiffness being greater than the second stiffness; and a drive system magnetically driving rotation of the tires relative to the drive system itself such that no portion of the drive system physically contacts the tires or the road surface, the drive system magnetically levitates the vehicle a first predetermined distance from the tires, at least one of the spherical tires comprising: an outer tread layer comprising a filler selected from the group consisting of carbon black and silica and a copolymer, the copolymer comprising: a polymeric backbone chain derived from a monomer comprising at least one conjugated diene monomer and, optionally, at least one vinyl aromatic monomer; and polymeric sidechains bonded to the backbone chain, the sidechains comprising a polymer capable of exhibiting a lower critical solution temperature (LCST) and, optionally, at least one additional diene based elastomer. 2. The support assembly as set forth in claim 1 wherein the drive system magnetically levitates itself a second predetermined distance from an inner surface of the tires. 3. The support assembly as set forth in claim 2 wherein the tires are closed sphere having and interior space completely separate from external environment. 4. The support assembly as set forth in claim 3 wherein the drive system comprises a first magnetically passive part and a second magnetically active part. 5. The support assembly as set forth in claim 4 wherein the first part generates only a constant magnetic field. 6. The support assembly as set forth in claim 5 wherein the second part generates a constant magnetic field and a variable magnetic field. 7. The support assembly as set forth in claim 6 wherein the drive system maintains the vehicle at a substantially constant orientation relative to the drive system. 8. The support assembly as set forth in claim 7 wherein the tires include a plurality off layers. 9. The support assembly as set forth in claim 8 wherein one of the plurality of layers mechanically supports a portion of a load determined by the vehicle. 10. The support assembly as set forth in claim 9 wherein one of the plurality of layers comprises a tread for generating traction between the tires and the road surface. 11. The support assembly as set forth in claim 10 wherein one of the plurality of layers comprises an elastomeric layer for damping vibration caused by the tires traveling over the road surface. | 3,600 |
13,513 | 13,513 | 13,925,085 | 3,685 | One embodiment of the present invention provides a system that facilitates the transfer of a software license from a first client to a second client. The system operates by receiving a request at the first client to deactivate the software license for an associated application installed on the first client. The system then receives a deactivation request that includes an identifier for the license at a license activation server from the first client. Next, the system validates the identifier on the license activation server to determine if the identifier is a valid identifier. If so, the system sends a deactivation message to the first client, receives a deactivation response from the first client, and increments a count of license instances available for the identifier on the license activation server. | 1-20. (canceled) 21. A method implemented by one or more computing devices, the method comprising:
facilitating a request to transfer a software license from a first client to a second client by:
determining whether an identifier for a software license installed on the first client is valid;
in response to a result of the determining that the identifier is valid:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 22. A method as described in claim 21, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. 23. A method as described in claim 21, further comprising receiving a deactivation response from the first client, the deactivation response sent by the first client in response to the deactivation message. 24. A method as described in claim 23, wherein the activation message is sent in response to receipt of the deactivation response. 25. A method as described in claim 21, further comprising receiving an activation request that includes the identifier for the license from the second client, the activation request formed in response to receipt by the second client of the activation message. 26. A method as described in claim 21, further comprising incrementing a count of license instances available for the identifier in response to the forming of the deactivation message. 27. A method as described in claim 21, wherein the identifier includes a license serial number and a machine identifier that unique identifies a machine on which the first client is operating. 28. A method as described in claim 21, wherein the deactivation message includes a machine type for the first client such that transfer of the software license is permitted if the machine type for either the first or second client matches the specified machine type. 29. A method as described in claim 21, wherein the facilitating is performed by the computing device that also includes the second client. 30. A license activation server implemented by one or more computing devices that are configured to perform operations comprising:
facilitating a request to transfer a software license from a first client to a second client in response to a determination that an identifier for a software license installed on the first client is valid by:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 31. A license activation server as described in claim 30, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. 32. A license activation server as described in claim 30, further comprising receiving a deactivation response from the first client, the deactivation response sent by the first client in response to the deactivation message. 33. A license activation server as described in claim 32, wherein the activation message is sent in response to receipt of the deactivation response. 34. A license activation server as described in claim 30, further comprising receiving an activation request that includes the identifier for the license from the second client, the activation request formed in response to receipt by the second client of the activation message. 35. A license activation server as described in claim 30, further comprising incrementing a count of license instances available for the identifier in response to the forming of the deactivation message. 36. A license activation server as described in claim 30, wherein the identifier includes a license serial number and a machine identifier that unique identifies a machine on which the first client is operating. 37. A license activation server as described in claim 30, wherein the deactivation message includes a machine type for the first client such that transfer of the software license is permitted if the machine type for either the first or second client matches the specified machine type. 38. A license activation server as described in claim 30, wherein the facilitating is performed by the computing device that also includes the second client. 39. A computer-readable storage medium storing instructions that, in response to execution by a computing device, causes the computing device to perform operations comprising:
facilitating a request to transfer a software license from a first client to a second client in response to a determination that an identifier for a software license installed on the first client is valid by:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 40. A license activation server as described in claim 39, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. | One embodiment of the present invention provides a system that facilitates the transfer of a software license from a first client to a second client. The system operates by receiving a request at the first client to deactivate the software license for an associated application installed on the first client. The system then receives a deactivation request that includes an identifier for the license at a license activation server from the first client. Next, the system validates the identifier on the license activation server to determine if the identifier is a valid identifier. If so, the system sends a deactivation message to the first client, receives a deactivation response from the first client, and increments a count of license instances available for the identifier on the license activation server.1-20. (canceled) 21. A method implemented by one or more computing devices, the method comprising:
facilitating a request to transfer a software license from a first client to a second client by:
determining whether an identifier for a software license installed on the first client is valid;
in response to a result of the determining that the identifier is valid:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 22. A method as described in claim 21, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. 23. A method as described in claim 21, further comprising receiving a deactivation response from the first client, the deactivation response sent by the first client in response to the deactivation message. 24. A method as described in claim 23, wherein the activation message is sent in response to receipt of the deactivation response. 25. A method as described in claim 21, further comprising receiving an activation request that includes the identifier for the license from the second client, the activation request formed in response to receipt by the second client of the activation message. 26. A method as described in claim 21, further comprising incrementing a count of license instances available for the identifier in response to the forming of the deactivation message. 27. A method as described in claim 21, wherein the identifier includes a license serial number and a machine identifier that unique identifies a machine on which the first client is operating. 28. A method as described in claim 21, wherein the deactivation message includes a machine type for the first client such that transfer of the software license is permitted if the machine type for either the first or second client matches the specified machine type. 29. A method as described in claim 21, wherein the facilitating is performed by the computing device that also includes the second client. 30. A license activation server implemented by one or more computing devices that are configured to perform operations comprising:
facilitating a request to transfer a software license from a first client to a second client in response to a determination that an identifier for a software license installed on the first client is valid by:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 31. A license activation server as described in claim 30, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. 32. A license activation server as described in claim 30, further comprising receiving a deactivation response from the first client, the deactivation response sent by the first client in response to the deactivation message. 33. A license activation server as described in claim 32, wherein the activation message is sent in response to receipt of the deactivation response. 34. A license activation server as described in claim 30, further comprising receiving an activation request that includes the identifier for the license from the second client, the activation request formed in response to receipt by the second client of the activation message. 35. A license activation server as described in claim 30, further comprising incrementing a count of license instances available for the identifier in response to the forming of the deactivation message. 36. A license activation server as described in claim 30, wherein the identifier includes a license serial number and a machine identifier that unique identifies a machine on which the first client is operating. 37. A license activation server as described in claim 30, wherein the deactivation message includes a machine type for the first client such that transfer of the software license is permitted if the machine type for either the first or second client matches the specified machine type. 38. A license activation server as described in claim 30, wherein the facilitating is performed by the computing device that also includes the second client. 39. A computer-readable storage medium storing instructions that, in response to execution by a computing device, causes the computing device to perform operations comprising:
facilitating a request to transfer a software license from a first client to a second client in response to a determination that an identifier for a software license installed on the first client is valid by:
forming a deactivation message that is configured to be sent to the first client, the deactivation message usable by the first client to deactivate the software license installed on the first client; and
forming an activation message that is configured to be sent to the second client, the activation message usable by the second client to activate the software license to make an associated application usable on the second client. 40. A license activation server as described in claim 39, wherein the deactivation message is configured to cause the first client to deactivate the software license thereby causing the associated application to be unusable by the first client. | 3,600 |
13,514 | 13,514 | 15,045,475 | 3,686 | Mechanisms are provided to implement a medical code re-coding system. The mechanisms analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record. At least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code is applied to the patient medical record. Based on results of the application of the at least one medical code re-coding rule, a determination is made as to whether the medical code is a candidate for re-coding. A notification of the medical code being a candidate for re-coding is output in response to the determination indicating that the medical code is a candidate for re-coding. | 1. A method, in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to implement a medical code re-coding system, the method comprising:
analyzing, by the medical code re-coding system, a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; applying, by the medical code re-coding system, at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determining, by the medical code re-coding system, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and outputting, by the medical code re-coding system, a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. 2. The method of claim 1, wherein analyzing the patient medical record comprises:
analyzing a patient registry record in a patient registry to identify a historical set of medical codes present in the patient registry record, wherein the patient registry record is associated with a corresponding patient and comprising personal and medical information about the corresponding patient; and evaluating the historical set of medical codes to identify at least one medical code in the set of medical codes that has not been re-coded in a subsequent time frame. 3. The method of claim 1, wherein the method is performed in response to detecting the occurrence of a triggering event, and wherein the triggering event is one of the patient scheduling an appointment with a medical practitioner, an elapse of a time period corresponding to a medical incentive program, or a user initiated request to perform the method. 4. The method of claim 3, further comprising:
outputting, by an appointment scheduling system, a reminder output identifying a scheduled appointment of the patient with a medical practitioner, wherein the notification of the medical code is a notification added to the reminder output. 5. The method of claim 1, wherein each medical code re-coding rule in the at least one medical code re-coding rule defines a pattern of one or more medical codes corresponding to medical maladies that are likely to persist in a patient. 6. The method of claim 1, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
identifying occurrences of other medical codes within a predetermined time period of a current time in the patient medical record; and determining if the occurrences of the other medical codes match a pattern of medical codes specified by the at least one medical code re-coding rule. 7. The method of claim 1, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
determining if the medical code is present in one or more entries in the patient medical record within a specified time period prior to a current time; and determining that the medical code is a candidate for re-coding in response to the medical code not being present in any of the entries in the patient medical record within the specified time period. 8. The method of claim 7, wherein the specified time period prior to the current time is a specified time period associated with the medical code, and wherein different medical codes have different associated specified time periods. 9. The method of claim 1, further comprising:
automatically re-coding the medical code in response to the determination indicating that the medical code is a candidate for re-coding. 10. The method of claim 1, wherein the notification comprises user selectable features for confirming or rejecting re-coding of the medical code, and wherein, in response to a user selecting a feature confirming re-coding of the medical code, the medical code is re-coded in the patient medical record. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to implement a medical code re-coding system which operates to:
analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; apply at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determine, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and output a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. 12. The computer program product of claim 11, wherein analyzing the patient medical record comprises:
analyzing a patient registry record in a patient registry to identify a historical set of medical codes present in the patient registry record, wherein the patient registry record is associated with a corresponding patient and comprising personal and medical information about the corresponding patient; and evaluating the historical set of medical codes to identify at least one medical code in the set of medical codes that has not been re-coded in a subsequent time frame. 13. The computer program product of claim 11, wherein the computer program product is executed in response to detecting the occurrence of a triggering event, and wherein the triggering event is one of the patient scheduling an appointment with a medical practitioner, an elapse of a time period corresponding to a medical incentive program, or a user initiated request to perform the method. 14. The computer program product of claim 13, wherein the medical code re-coding system further operates to:
output, by an appointment scheduling system, a reminder output identifying a scheduled appointment of the patient with a medical practitioner, wherein the notification of the medical code is a notification added to the reminder output. 15. The computer program product of claim 11, wherein each medical code re-coding rule in the at least one medical code re-coding rule defines a pattern of one or more medical codes corresponding to medical maladies that are likely to persist in a patient. 16. The computer program product of claim 11, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
identifying occurrences of other medical codes within a predetermined time period of a current time in the patient medical record; and determining if the occurrences of the other medical codes match a pattern of medical codes specified by the at least one medical code re-coding rule. 17. The computer program product of claim 11, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
determining if the medical code is present in one or more entries in the patient medical record within a specified time period prior to a current time; and determining that the medical code is a candidate for re-coding in response to the medical code not being present in any of the entries in the patient medical record within the specified time period. 18. The computer program product of claim 17, wherein the specified time period prior to the current time is a specified time period associated with the medical code, and wherein different medical codes have different associated specified time periods. 19. The computer program product of claim 11, wherein the medical code re-coding system further operates to:
automatically re-code the medical code in response to the determination indicating that the medical code is a candidate for re-coding. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a medical code re-coding system which operates to: analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; apply at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determine, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and output a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. | Mechanisms are provided to implement a medical code re-coding system. The mechanisms analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record. At least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code is applied to the patient medical record. Based on results of the application of the at least one medical code re-coding rule, a determination is made as to whether the medical code is a candidate for re-coding. A notification of the medical code being a candidate for re-coding is output in response to the determination indicating that the medical code is a candidate for re-coding.1. A method, in a data processing system comprising at least one processor and a memory comprising instructions which, when executed by the at least one processor, causes the at least one processor to implement a medical code re-coding system, the method comprising:
analyzing, by the medical code re-coding system, a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; applying, by the medical code re-coding system, at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determining, by the medical code re-coding system, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and outputting, by the medical code re-coding system, a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. 2. The method of claim 1, wherein analyzing the patient medical record comprises:
analyzing a patient registry record in a patient registry to identify a historical set of medical codes present in the patient registry record, wherein the patient registry record is associated with a corresponding patient and comprising personal and medical information about the corresponding patient; and evaluating the historical set of medical codes to identify at least one medical code in the set of medical codes that has not been re-coded in a subsequent time frame. 3. The method of claim 1, wherein the method is performed in response to detecting the occurrence of a triggering event, and wherein the triggering event is one of the patient scheduling an appointment with a medical practitioner, an elapse of a time period corresponding to a medical incentive program, or a user initiated request to perform the method. 4. The method of claim 3, further comprising:
outputting, by an appointment scheduling system, a reminder output identifying a scheduled appointment of the patient with a medical practitioner, wherein the notification of the medical code is a notification added to the reminder output. 5. The method of claim 1, wherein each medical code re-coding rule in the at least one medical code re-coding rule defines a pattern of one or more medical codes corresponding to medical maladies that are likely to persist in a patient. 6. The method of claim 1, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
identifying occurrences of other medical codes within a predetermined time period of a current time in the patient medical record; and determining if the occurrences of the other medical codes match a pattern of medical codes specified by the at least one medical code re-coding rule. 7. The method of claim 1, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
determining if the medical code is present in one or more entries in the patient medical record within a specified time period prior to a current time; and determining that the medical code is a candidate for re-coding in response to the medical code not being present in any of the entries in the patient medical record within the specified time period. 8. The method of claim 7, wherein the specified time period prior to the current time is a specified time period associated with the medical code, and wherein different medical codes have different associated specified time periods. 9. The method of claim 1, further comprising:
automatically re-coding the medical code in response to the determination indicating that the medical code is a candidate for re-coding. 10. The method of claim 1, wherein the notification comprises user selectable features for confirming or rejecting re-coding of the medical code, and wherein, in response to a user selecting a feature confirming re-coding of the medical code, the medical code is re-coded in the patient medical record. 11. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to implement a medical code re-coding system which operates to:
analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; apply at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determine, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and output a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. 12. The computer program product of claim 11, wherein analyzing the patient medical record comprises:
analyzing a patient registry record in a patient registry to identify a historical set of medical codes present in the patient registry record, wherein the patient registry record is associated with a corresponding patient and comprising personal and medical information about the corresponding patient; and evaluating the historical set of medical codes to identify at least one medical code in the set of medical codes that has not been re-coded in a subsequent time frame. 13. The computer program product of claim 11, wherein the computer program product is executed in response to detecting the occurrence of a triggering event, and wherein the triggering event is one of the patient scheduling an appointment with a medical practitioner, an elapse of a time period corresponding to a medical incentive program, or a user initiated request to perform the method. 14. The computer program product of claim 13, wherein the medical code re-coding system further operates to:
output, by an appointment scheduling system, a reminder output identifying a scheduled appointment of the patient with a medical practitioner, wherein the notification of the medical code is a notification added to the reminder output. 15. The computer program product of claim 11, wherein each medical code re-coding rule in the at least one medical code re-coding rule defines a pattern of one or more medical codes corresponding to medical maladies that are likely to persist in a patient. 16. The computer program product of claim 11, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
identifying occurrences of other medical codes within a predetermined time period of a current time in the patient medical record; and determining if the occurrences of the other medical codes match a pattern of medical codes specified by the at least one medical code re-coding rule. 17. The computer program product of claim 11, wherein applying at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record comprises:
determining if the medical code is present in one or more entries in the patient medical record within a specified time period prior to a current time; and determining that the medical code is a candidate for re-coding in response to the medical code not being present in any of the entries in the patient medical record within the specified time period. 18. The computer program product of claim 17, wherein the specified time period prior to the current time is a specified time period associated with the medical code, and wherein different medical codes have different associated specified time periods. 19. The computer program product of claim 11, wherein the medical code re-coding system further operates to:
automatically re-code the medical code in response to the determination indicating that the medical code is a candidate for re-coding. 20. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to implement a medical code re-coding system which operates to: analyze a patient medical record corresponding to a patient, to identify at least one previous occurrence of a medical code in the patient medical record; apply at least one medical code re-coding rule corresponding to the at least one previous occurrence of the medical code to the patient medical record; determine, based on results of the application of the at least one medical code re-coding rule, whether the medical code is a candidate for re-coding; and output a notification of the medical code being a candidate for re-coding in response to the determination indicating that the medical code is a candidate for re-coding. | 3,600 |
13,515 | 13,515 | 13,294,134 | 3,685 | Systems and methods for securing mobile transactions are provided. An order including a credit card number and a user is sent from the user's mobile device over a communication network to a gateway server, which may be coupled to a point-of-sale terminal. The gateway server generates an encryption key that is based on the user key and a server key stored at the server. The encryption key is used to encrypt the credit card number, and the encrypted credit card number is sent to the mobile device for use in subsequent orders. | 1. A method for securing mobile transactions, the method comprising:
receiving an order including a credit card number and a user key from a mobile device associated with a user, the order sent over a communication network and received at a gateway server; executing instructions stored in memory of the gateway server, wherein execution of instructions by a processor of the gateway server:
generates an encryption key, the encryption key based on a server key stored in memory and the received user key, and
encrypts the credit card number using the encryption key; and
transmitting the encrypted credit card number over the communication from the gateway server to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 2. The method of claim 1, further comprising providing the order to a point-of-sale terminal for processing, the gateway server communicatively coupled to the point-of-sale terminal. 3. The method of claim 2, further comprising:
receiving information from the point-of-sale terminal indicating a status of the order; and sending a notification to the mobile device regarding the status of the order. 4. The method of claim 1, further comprising sending information regarding an offer from the gateway server to the mobile device, and wherein user acceptance of the offer initiates the order on the mobile device. 5. The method of claim 4, further comprising:
storing information in memory regarding a plurality of offers, each offer associated with at least one condition; and receiving information regarding the user, the information sent by the mobile device over the communication network to the gateway server, wherein further execution of instructions at the gateway server selects the offer from the plurality of offers to send to the mobile device, the selection based on the user information corresponding to the condition associated with the offer. 6. The method of claim 5, wherein the received information includes a location of the user and wherein the selection of the offer is further based on a determination that the location of the user is within a predetermined distance from the location of the gateway server. 7. The method of claim 1, further comprising receiving a subsequent order including the encrypted credit card number and the user key, the subsequent order sent from the mobile device to the gateway server, wherein further execution of instructions at the gateway server:
verifies the format of the encrypted credit card number, generates a decryption key based on the user key and the server key, and decrypts the encrypted credit card using the decryption key. 8. An apparatus for securing mobile transactions, the apparatus comprising:
an interface for receiving an order including a credit card number and a user key from a mobile device associated with a user, the order sent over a communication network; and a processor for executing instructions stored in memory, wherein execution of the instructions by the processor:
generates an encryption key based on a server key stored in memory and the received user key, and
encrypts the credit card number using the encryption key,
wherein the interface transmits the encrypted credit card number over the communication network to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 9. The apparatus of claim 8, further comprising a link to a point-of-sale terminal, wherein the link is used to provide the order to the point-of-sale terminal for processing. 10. The apparatus of claim 8, wherein the interface receives information from the point-of-sale terminal indicating a status of the order and sends a notification to the mobile device of the user regarding the status of the order. 11. The apparatus of claim 8, wherein the interface sends information regarding an offer over the communication network to the mobile device and wherein user acceptance of the offer generates the order on the mobile device. 12. The apparatus of claim 11, further comprising:
memory for storing information regarding a plurality of offers, each offer associated with at least one condition; and wherein the interface further receives information regarding the user, the information sent by the mobile device over the communication network, wherein the processor of the gateway server executes instructions to select the offer from the plurality of offers, the selection based on the user information corresponding to the condition associated with the offer, and wherein the interface sends information regarding the offer to the mobile device, wherein the offer is presented to the user. 13. The apparatus of claim 12, wherein the received information includes a location of the user and wherein the selection of the offer is further based on a determination that the location of the user is within a predetermined distance from the location of the gateway server. 14. The apparatus of claim 8, wherein the interface further receives a subsequent order including the encrypted credit card number and the user key, the subsequent order sent from the mobile device over the communication network, wherein further execution of instructions by the processor:
verifies the format of the encrypted credit card number, generates a decryption key based on the user key and the server key, and decrypts the encrypted credit card using the decryption key. 15. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
receiving an order including a credit card number and a user key from a mobile device associated with a user; generating an encryption key based on a server key stored in memory and the received user key; encrypting the credit card number using the encryption key; and sending the encrypted credit card number to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 16. A method for securing mobile transactions, the method comprising:
receiving order information entered on a mobile device associated with a user, the information including a credit card number and a user key; sending the order including the credit card number and the user key from the mobile device over a communication network to a gateway server; receiving an encrypted credit card number sent from the gateway server over the communication network to the mobile device, the credit card number having been encrypted using an encryption key based on a server key and the user key; and storing the encrypted credit card number in memory for use in subsequent orders generated at the mobile device. 17. The method of claim 16, further comprising receiving a credit card nickname from the user and storing the nickname in association with the encrypted credit card information. 18. The method of claim 17, further comprising:
receiving subsequent order information from the user, the subsequent order information indicating the nickname and the user key; executing instructions stored in memory of the mobile device, wherein execution of the instructions by a processor of the mobile device retrieves the encrypted credit card information stored in association with the nickname; and sending the subsequent order including the encrypted credit card information and the user key from the mobile device over the communication network to the gateway server. 19. The method of claim 16, further comprising:
receiving information regarding an offer sent from the gateway server over the communication network to the mobile device; presenting the offer to the user on a display of the mobile device; receiving an indication from the user regarding acceptance of the offer; and executing instructions stored in memory of the mobile device, wherein execution of the instructions by a processor of the mobile device initiates the order on the mobile device. 20. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
receiving order information including a credit card number and a user key, the order information entered on a mobile device associated with a user; sending the order including the credit card number and the user key from the mobile device over a communication network to a gateway server; receiving an encrypted credit card number sent from the gateway server over the communication network to the mobile device, the credit card number having been encrypted using an encryption key based on a server key and the user key; and storing the encrypted credit card number in memory for use in subsequent orders generated at the mobile device. 21. A method for securing mobile transactions, the method comprising:
generating a display on a mobile device to present merchant information to a user of the mobile device, the merchant information including a plurality of merchants; receiving order information including user information, the order entered on the mobile device of the user; sending the order from the mobile device over a communication network to a gateway server associated with a merchant designated by the user, wherein the gateway server discards the user information after processing of the order; and storing the user information in memory of the mobile device, wherein the user information automatically populates a subsequent order generated at the mobile device. 22. The method of claim 21, further comprising receiving an indication that the user wishes to change the stored user information and executing instructions stored in memory, wherein execution of the instructions by a processor changes the stored information in accordance with user wishes. 23. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
generating a display to present merchant information to a user of the mobile device, the merchant information including a plurality of merchants; receiving order information including user information, the order entered by the user; sending the order over a communication network to a gateway server associated with a merchant designated by the user, wherein the gateway server discards the user information after processing of the order; and storing the user information, wherein the user information automatically populates a subsequent order. 24. The method of claim 23, further comprising receiving an indication that the user wishes to change the stored user information and executing instructions stored in memory, wherein execution of the instructions by a processor changes the stored information in accordance with user wishes. | Systems and methods for securing mobile transactions are provided. An order including a credit card number and a user is sent from the user's mobile device over a communication network to a gateway server, which may be coupled to a point-of-sale terminal. The gateway server generates an encryption key that is based on the user key and a server key stored at the server. The encryption key is used to encrypt the credit card number, and the encrypted credit card number is sent to the mobile device for use in subsequent orders.1. A method for securing mobile transactions, the method comprising:
receiving an order including a credit card number and a user key from a mobile device associated with a user, the order sent over a communication network and received at a gateway server; executing instructions stored in memory of the gateway server, wherein execution of instructions by a processor of the gateway server:
generates an encryption key, the encryption key based on a server key stored in memory and the received user key, and
encrypts the credit card number using the encryption key; and
transmitting the encrypted credit card number over the communication from the gateway server to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 2. The method of claim 1, further comprising providing the order to a point-of-sale terminal for processing, the gateway server communicatively coupled to the point-of-sale terminal. 3. The method of claim 2, further comprising:
receiving information from the point-of-sale terminal indicating a status of the order; and sending a notification to the mobile device regarding the status of the order. 4. The method of claim 1, further comprising sending information regarding an offer from the gateway server to the mobile device, and wherein user acceptance of the offer initiates the order on the mobile device. 5. The method of claim 4, further comprising:
storing information in memory regarding a plurality of offers, each offer associated with at least one condition; and receiving information regarding the user, the information sent by the mobile device over the communication network to the gateway server, wherein further execution of instructions at the gateway server selects the offer from the plurality of offers to send to the mobile device, the selection based on the user information corresponding to the condition associated with the offer. 6. The method of claim 5, wherein the received information includes a location of the user and wherein the selection of the offer is further based on a determination that the location of the user is within a predetermined distance from the location of the gateway server. 7. The method of claim 1, further comprising receiving a subsequent order including the encrypted credit card number and the user key, the subsequent order sent from the mobile device to the gateway server, wherein further execution of instructions at the gateway server:
verifies the format of the encrypted credit card number, generates a decryption key based on the user key and the server key, and decrypts the encrypted credit card using the decryption key. 8. An apparatus for securing mobile transactions, the apparatus comprising:
an interface for receiving an order including a credit card number and a user key from a mobile device associated with a user, the order sent over a communication network; and a processor for executing instructions stored in memory, wherein execution of the instructions by the processor:
generates an encryption key based on a server key stored in memory and the received user key, and
encrypts the credit card number using the encryption key,
wherein the interface transmits the encrypted credit card number over the communication network to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 9. The apparatus of claim 8, further comprising a link to a point-of-sale terminal, wherein the link is used to provide the order to the point-of-sale terminal for processing. 10. The apparatus of claim 8, wherein the interface receives information from the point-of-sale terminal indicating a status of the order and sends a notification to the mobile device of the user regarding the status of the order. 11. The apparatus of claim 8, wherein the interface sends information regarding an offer over the communication network to the mobile device and wherein user acceptance of the offer generates the order on the mobile device. 12. The apparatus of claim 11, further comprising:
memory for storing information regarding a plurality of offers, each offer associated with at least one condition; and wherein the interface further receives information regarding the user, the information sent by the mobile device over the communication network, wherein the processor of the gateway server executes instructions to select the offer from the plurality of offers, the selection based on the user information corresponding to the condition associated with the offer, and wherein the interface sends information regarding the offer to the mobile device, wherein the offer is presented to the user. 13. The apparatus of claim 12, wherein the received information includes a location of the user and wherein the selection of the offer is further based on a determination that the location of the user is within a predetermined distance from the location of the gateway server. 14. The apparatus of claim 8, wherein the interface further receives a subsequent order including the encrypted credit card number and the user key, the subsequent order sent from the mobile device over the communication network, wherein further execution of instructions by the processor:
verifies the format of the encrypted credit card number, generates a decryption key based on the user key and the server key, and decrypts the encrypted credit card using the decryption key. 15. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
receiving an order including a credit card number and a user key from a mobile device associated with a user; generating an encryption key based on a server key stored in memory and the received user key; encrypting the credit card number using the encryption key; and sending the encrypted credit card number to the mobile device, wherein the encrypted credit card number is stored on the mobile device. 16. A method for securing mobile transactions, the method comprising:
receiving order information entered on a mobile device associated with a user, the information including a credit card number and a user key; sending the order including the credit card number and the user key from the mobile device over a communication network to a gateway server; receiving an encrypted credit card number sent from the gateway server over the communication network to the mobile device, the credit card number having been encrypted using an encryption key based on a server key and the user key; and storing the encrypted credit card number in memory for use in subsequent orders generated at the mobile device. 17. The method of claim 16, further comprising receiving a credit card nickname from the user and storing the nickname in association with the encrypted credit card information. 18. The method of claim 17, further comprising:
receiving subsequent order information from the user, the subsequent order information indicating the nickname and the user key; executing instructions stored in memory of the mobile device, wherein execution of the instructions by a processor of the mobile device retrieves the encrypted credit card information stored in association with the nickname; and sending the subsequent order including the encrypted credit card information and the user key from the mobile device over the communication network to the gateway server. 19. The method of claim 16, further comprising:
receiving information regarding an offer sent from the gateway server over the communication network to the mobile device; presenting the offer to the user on a display of the mobile device; receiving an indication from the user regarding acceptance of the offer; and executing instructions stored in memory of the mobile device, wherein execution of the instructions by a processor of the mobile device initiates the order on the mobile device. 20. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
receiving order information including a credit card number and a user key, the order information entered on a mobile device associated with a user; sending the order including the credit card number and the user key from the mobile device over a communication network to a gateway server; receiving an encrypted credit card number sent from the gateway server over the communication network to the mobile device, the credit card number having been encrypted using an encryption key based on a server key and the user key; and storing the encrypted credit card number in memory for use in subsequent orders generated at the mobile device. 21. A method for securing mobile transactions, the method comprising:
generating a display on a mobile device to present merchant information to a user of the mobile device, the merchant information including a plurality of merchants; receiving order information including user information, the order entered on the mobile device of the user; sending the order from the mobile device over a communication network to a gateway server associated with a merchant designated by the user, wherein the gateway server discards the user information after processing of the order; and storing the user information in memory of the mobile device, wherein the user information automatically populates a subsequent order generated at the mobile device. 22. The method of claim 21, further comprising receiving an indication that the user wishes to change the stored user information and executing instructions stored in memory, wherein execution of the instructions by a processor changes the stored information in accordance with user wishes. 23. A non-transitory computer-readable storage medium, having embodied thereon a program executable by a processor to perform a method for securing mobile transactions, the method comprising:
generating a display to present merchant information to a user of the mobile device, the merchant information including a plurality of merchants; receiving order information including user information, the order entered by the user; sending the order over a communication network to a gateway server associated with a merchant designated by the user, wherein the gateway server discards the user information after processing of the order; and storing the user information, wherein the user information automatically populates a subsequent order. 24. The method of claim 23, further comprising receiving an indication that the user wishes to change the stored user information and executing instructions stored in memory, wherein execution of the instructions by a processor changes the stored information in accordance with user wishes. | 3,600 |
13,516 | 13,516 | 14,147,897 | 3,628 | A method, system or computer usable program product for recommending a delivery locker based on user convenience and delivery cost including receiving a request to deliver an item to a user; analyzing user activity information to identify a user route including expected timing; analyzing the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection. | 1-9. (canceled) 10. A computer usable program product comprising a non-transitory computer usable storage medium including computer usable code for use in recommending a delivery locker based on user convenience and delivery cost, the computer usable program product comprising code for performing the steps of:
receiving a request to deliver an item to a user; utilizing a processor to analyze user activity information to identify a user route including expected timing; utilizing the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection. 11. The computer usable program product of claim 10 further comprising:
identifying a second user authorized by the first user for picking up the item;
utilizing the processor to analyze the second user activity information to identify a second person route including expected timing; and
utilize the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route. 12. The computer usable program product of claim 10 wherein analyzing user activity information includes analyzing user calendar and contact information. 13. The computer usable program product of claim 10 wherein analyzing the item for storage requirements includes analyzing the item for shipping characteristics to identify delivery vehicles delivering to the identified lockers. 14. The computer usable program product of claim 10 wherein the storage requirements are selected from a group consisting of regulations, signature requirements, compliance rules, security requirements, and environmental concerns. 15. The computer usable program product of claim 10 further comprising:
providing a user interface (UI) allowing a user to identify, adjust, and select the address, the others, and modify the criteria; and
responsive to the user utilizing the UI, adjusting the ranking based on user selections and presenting an updated ordering of the lockers based on the adjusted rankings. 16. A data processing system for recommending a delivery locker based on user convenience and delivery cost, the data processing system comprising:
a processor; and a memory storing program instructions which when executed by the processor execute the steps of: receiving a request to deliver an item to a user; utilizing the processor to analyze user activity information to identify a user route including expected timing; utilizing the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection. 17. The data processing system of claim 16 further comprising:
identifying a second user authorized by the first user for picking up the item;
utilizing the processor to analyze the second user activity information to identify a second person route including expected timing; and
utilize the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route. 18. The data processing system of claim 16 wherein analyzing user activity information includes analyzing user calendar and contact information. 19. The data processing system of claim 16 wherein analyzing the item for storage requirements includes analyzing the item for shipping characteristics to identify delivery vehicles delivering to the identified lockers. 20. The data processing system of claim 16 further comprising:
providing a user interface (UI) allowing a user to identify, adjust, and select the address, the others, and modify the criteria; and
responsive to the user utilizing the UI, adjusting the ranking based on user selections and presenting an updated ordering of the lockers based on the adjusted rankings. | A method, system or computer usable program product for recommending a delivery locker based on user convenience and delivery cost including receiving a request to deliver an item to a user; analyzing user activity information to identify a user route including expected timing; analyzing the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection.1-9. (canceled) 10. A computer usable program product comprising a non-transitory computer usable storage medium including computer usable code for use in recommending a delivery locker based on user convenience and delivery cost, the computer usable program product comprising code for performing the steps of:
receiving a request to deliver an item to a user; utilizing a processor to analyze user activity information to identify a user route including expected timing; utilizing the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection. 11. The computer usable program product of claim 10 further comprising:
identifying a second user authorized by the first user for picking up the item;
utilizing the processor to analyze the second user activity information to identify a second person route including expected timing; and
utilize the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route. 12. The computer usable program product of claim 10 wherein analyzing user activity information includes analyzing user calendar and contact information. 13. The computer usable program product of claim 10 wherein analyzing the item for storage requirements includes analyzing the item for shipping characteristics to identify delivery vehicles delivering to the identified lockers. 14. The computer usable program product of claim 10 wherein the storage requirements are selected from a group consisting of regulations, signature requirements, compliance rules, security requirements, and environmental concerns. 15. The computer usable program product of claim 10 further comprising:
providing a user interface (UI) allowing a user to identify, adjust, and select the address, the others, and modify the criteria; and
responsive to the user utilizing the UI, adjusting the ranking based on user selections and presenting an updated ordering of the lockers based on the adjusted rankings. 16. A data processing system for recommending a delivery locker based on user convenience and delivery cost, the data processing system comprising:
a processor; and a memory storing program instructions which when executed by the processor execute the steps of: receiving a request to deliver an item to a user; utilizing the processor to analyze user activity information to identify a user route including expected timing; utilizing the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route; ranking the identified lockers with a ranking based on criteria; and presenting an ordering of the identified lockers based on the ranking for user selection. 17. The data processing system of claim 16 further comprising:
identifying a second user authorized by the first user for picking up the item;
utilizing the processor to analyze the second user activity information to identify a second person route including expected timing; and
utilize the processor to analyze the item for storage requirements to identify lockers meeting the requirements which are navigationally proximate to the user route. 18. The data processing system of claim 16 wherein analyzing user activity information includes analyzing user calendar and contact information. 19. The data processing system of claim 16 wherein analyzing the item for storage requirements includes analyzing the item for shipping characteristics to identify delivery vehicles delivering to the identified lockers. 20. The data processing system of claim 16 further comprising:
providing a user interface (UI) allowing a user to identify, adjust, and select the address, the others, and modify the criteria; and
responsive to the user utilizing the UI, adjusting the ranking based on user selections and presenting an updated ordering of the lockers based on the adjusted rankings. | 3,600 |
13,517 | 13,517 | 15,502,386 | 3,636 | Stiffening assemblies for use with labels or shelf label channels are described. The stiffening assemblies can be incorporated with one or more labels and provided so as to be conveniently used with shelf label channels or other point-of-sale displays. | 1. A label stiffener system comprising:
a first support defining a front face and a rear face; a second support defining a front face and a rear face; a layer of a first adhesive disposed between the first and the second support; a patterned region of a second adhesive disposed on the front face of the first support. 2. The stiffener system of claim 1 further comprising:
a layer of a release material disposed on the rear face of the second support. 3. The stiffener system of claim 1 wherein at least one of the first support and the second support includes a polymeric material. 4. The stiffener system of claim 3 wherein the polymeric material is selected from the group consisting of polyvinyl chloride, polyolefins, polyethylene terephthalate, polycarbonate, polystyrene, and combinations thereof. 5. (canceled) 6. (canceled) 7. The stiffener system of claim 1 wherein each of the first support and the second support has a thickness within a range of from 1 mil to 7 mil. 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. The stiffener system of claim 1 wherein both of the first adhesive and the second adhesive are pressure sensitive adhesives. 13. (canceled) 14. (canceled) 15. The stiffener system of claim 2 wherein the release material includes a silicone release agent. 16. (canceled) 17. The stiffener system of claim 1, where in the first layer of adhesive is an acrylic adhesive. 18. The stiffener system of claim 1, wherein the second adhesive is a hybrid acrylic adhesive. 19. The stiffener system of claim 1, wherein the second adhesive is a rubber based adhesive. 20. A combined label and stiffener system comprising:
a label; and a stiffener system including (i) a first support defining a front face and a rear face, (ii) a second support defining a front face and a rear face, (iii) a layer of a first adhesive disposed between the first and the second support, and (iv) a patterned region of a second adhesive disposed on the front face of the first support; wherein the label is adhered to the patterned region of the second adhesive of the stiffener system. 21. The combined label and stiffener system of claim 20 further comprising:
a layer of a release material disposed on the rear face of the second support. 22. The combined label and stiffener system of claim 20 wherein at least one of the first support and the second support includes a polymeric material. 23. The combined label and stiffener system of claim 22 wherein the polymeric material is selected from the group consisting of polyvinyl chloride, polyolefins, polyethylene terephthalate, polycarbonate, polystyrene, and combinations thereof. 24. (canceled) 25. (canceled) 26. The combined label and stiffener system of claims 20 wherein each of the first support and the second support has a thickness within a range of from 1 mil to 7 mil. 27. (canceled) 28. (canceled) 29. (canceled) 30. (canceled) 31. The combined label and stiffener system of claim 20 wherein both of the first adhesive and the second adhesive are pressure sensitive adhesives. 32. (canceled) 33. (canceled) 34. The combined label and stiffener system of claim 20 wherein the release material includes a silicone release agent. 35. (canceled) 36. The combined label and stiffener system of claim 20, where in the first layer of adhesive is an acrylic adhesive. 37. The combined label and stiffener system of claim 20, wherein the second adhesive is a hybrid acrylic adhesive. 38. The combined label and stiffener system of claim 20, wherein the second adhesive is a rubber based adhesive. 39. A method for affixing a label to a label channel, the method comprising:
providing a label; providing a label channel defining a receiving region; providing a stiffener system including (i) a first support defining a front face and a rear face, (ii) a second support defining a front face and a rear face, (iii) a layer of a first adhesive disposed between the first and the second support, and (iv) a patterned region of a second adhesive disposed on the front face of the first support; adhering the label to the patterned region of the second adhesive of the stiffener system; inserting the stiffener system in the receiving region of the label channel, thereby affixing the label to the label channel. 40. The method of claim 39 wherein the inserting is performed prior to the adhering. 41. The method of claim 39 wherein the inserting is performed after the adhering. | Stiffening assemblies for use with labels or shelf label channels are described. The stiffening assemblies can be incorporated with one or more labels and provided so as to be conveniently used with shelf label channels or other point-of-sale displays.1. A label stiffener system comprising:
a first support defining a front face and a rear face; a second support defining a front face and a rear face; a layer of a first adhesive disposed between the first and the second support; a patterned region of a second adhesive disposed on the front face of the first support. 2. The stiffener system of claim 1 further comprising:
a layer of a release material disposed on the rear face of the second support. 3. The stiffener system of claim 1 wherein at least one of the first support and the second support includes a polymeric material. 4. The stiffener system of claim 3 wherein the polymeric material is selected from the group consisting of polyvinyl chloride, polyolefins, polyethylene terephthalate, polycarbonate, polystyrene, and combinations thereof. 5. (canceled) 6. (canceled) 7. The stiffener system of claim 1 wherein each of the first support and the second support has a thickness within a range of from 1 mil to 7 mil. 8. (canceled) 9. (canceled) 10. (canceled) 11. (canceled) 12. The stiffener system of claim 1 wherein both of the first adhesive and the second adhesive are pressure sensitive adhesives. 13. (canceled) 14. (canceled) 15. The stiffener system of claim 2 wherein the release material includes a silicone release agent. 16. (canceled) 17. The stiffener system of claim 1, where in the first layer of adhesive is an acrylic adhesive. 18. The stiffener system of claim 1, wherein the second adhesive is a hybrid acrylic adhesive. 19. The stiffener system of claim 1, wherein the second adhesive is a rubber based adhesive. 20. A combined label and stiffener system comprising:
a label; and a stiffener system including (i) a first support defining a front face and a rear face, (ii) a second support defining a front face and a rear face, (iii) a layer of a first adhesive disposed between the first and the second support, and (iv) a patterned region of a second adhesive disposed on the front face of the first support; wherein the label is adhered to the patterned region of the second adhesive of the stiffener system. 21. The combined label and stiffener system of claim 20 further comprising:
a layer of a release material disposed on the rear face of the second support. 22. The combined label and stiffener system of claim 20 wherein at least one of the first support and the second support includes a polymeric material. 23. The combined label and stiffener system of claim 22 wherein the polymeric material is selected from the group consisting of polyvinyl chloride, polyolefins, polyethylene terephthalate, polycarbonate, polystyrene, and combinations thereof. 24. (canceled) 25. (canceled) 26. The combined label and stiffener system of claims 20 wherein each of the first support and the second support has a thickness within a range of from 1 mil to 7 mil. 27. (canceled) 28. (canceled) 29. (canceled) 30. (canceled) 31. The combined label and stiffener system of claim 20 wherein both of the first adhesive and the second adhesive are pressure sensitive adhesives. 32. (canceled) 33. (canceled) 34. The combined label and stiffener system of claim 20 wherein the release material includes a silicone release agent. 35. (canceled) 36. The combined label and stiffener system of claim 20, where in the first layer of adhesive is an acrylic adhesive. 37. The combined label and stiffener system of claim 20, wherein the second adhesive is a hybrid acrylic adhesive. 38. The combined label and stiffener system of claim 20, wherein the second adhesive is a rubber based adhesive. 39. A method for affixing a label to a label channel, the method comprising:
providing a label; providing a label channel defining a receiving region; providing a stiffener system including (i) a first support defining a front face and a rear face, (ii) a second support defining a front face and a rear face, (iii) a layer of a first adhesive disposed between the first and the second support, and (iv) a patterned region of a second adhesive disposed on the front face of the first support; adhering the label to the patterned region of the second adhesive of the stiffener system; inserting the stiffener system in the receiving region of the label channel, thereby affixing the label to the label channel. 40. The method of claim 39 wherein the inserting is performed prior to the adhering. 41. The method of claim 39 wherein the inserting is performed after the adhering. | 3,600 |
13,518 | 13,518 | 14,732,304 | 3,695 | Analyzing a performance of an asset in a portfolio includes retrieving, from a number of financial sources, information for a list of trades, the list of trades representing assets associated with a portfolio that have been traded during a time interval, determining, based on the information, a number of returns associated with the list of trades over the time interval, creating, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade, determining, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over the time interval via trade attribution matching, computing an incidental exposure residual to the portfolio return over the time interval, and presenting, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio. | 1. A method for analyzing a performance of at least one asset in a portfolio, the method comprising:
retrieving, from a number of financial sources, information for a list of trades, the list of trades representing assets associated with a portfolio that have been traded during a time interval; determining, based on the information, a number of returns associated with the list of trades over the time interval; creating, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; determining, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over the time interval via trade attribution matching; computing an incidental exposure residual to the portfolio return over the time interval; and presenting, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio. 2. The method of claim 1, in which each of the assets in the portfolio are characterized by a time clock, a side of each trade, and the initial fraction. 3. The method of claim 1, in which the number of returns associated with the list of trades over the time interval comprises an asset return, a portfolio return, and a benchmark return. 4. The method of claim 1, in which determining, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching comprises:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time; computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 5. The method of claim 1, in which an aggregate trade of the assets replaces a trade of the assets when more than one trade of the assets occurs within an accuracy of a time clock. 6. The method of claim 1, in which the assets are modified based on corporate actions, the corporate actions comprising changing an identifier of at least one of the assets, creating a split or a reverse split of at least one of the assets, a demerging of at least one of the assets, a merging of at least one of the assets, or combinations thereof. 7. The method of claim 1, in which the assets of the portfolio created at a discrete instant in time are pretreated. 8. The method of claim 1, in which a collection of the assets are further pretreated when the collection of the assets is implemented at a specific clock time for a purpose of inserting or extracting cash liquidity to or from the portfolio. 9. A system for analyzing a performance of at least one asset in a portfolio, the system comprising:
a processor; a memory, comprising computer program code, communicatively coupled to the processor; a network interface for communicating data via a computer network; a display device; wherein, the computer program code comprising; a creating engine to create, for each trade of assets in a list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; a profit determining engine to determine, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over a time interval via trade attribution matching; a computing engine to compute an incidental exposure residual to the portfolio return over the time interval; and a presenting engine to present using the display device, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in a portfolio. 10. The system of claim 9, further comprising a retrieving engine to retrieve, from a number of financial sources, information for the list of trades, the list of trades representing the assets associated with the portfolio that have been traded during the time interval. 11. The system of claim 9, further comprising a return determining engine to determine, based on information, a number of returns associated with the list of trades over the time interval. 12. The system of claim 9, in which the profit determining engine determines, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching by:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; and computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time. 13. The system of claim 12, in which the profit determining engine further determines, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching by:
computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 14. A machine-readable storage medium encoded with instructions for analyzing a performance of at least one asset in a portfolio, the instructions executable by a processor of a system to cause the system to:
determine, for each sale of assets in a list of trades, a rebalancing trading profit contribution to a portfolio return over a time interval via trade attribution matching; and compute an incidental exposure residual to the portfolio return over the time interval. 15. The product of claim 14, further comprising instructions that, when executed, cause the processor to:
retrieve, from a number of financial sources, information for the list of trades, the list of trades representing the assets associated with a portfolio that have been traded during a time interval; and determine, based on the information, a number of returns associated with the list of trades over the time interval. 16. The product of claim 14, further comprising instructions that, when executed, cause the processor to:
create, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; and present, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio. 17. The product of claim 14, in which the trade attribution matching comprises:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time; computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 18. The product of claim 14, in which a collection of the assets are pretreated when the collection of the assets is implemented at a specific clock time for a purpose of inserting or extracting cash liquidity to or from a portfolio. 19. The product of claim 14, in which the assets are modified based on corporate actions, the corporate actions comprising changing an identifier of at least one of the assets, creating a split or a reverse split of at least one of the assets, a demerging of at least one of the assets, a merging of at least one of the assets, or combinations thereof. 20. The product of claim 14, in which a number of returns associated with the list of trades over the time interval comprises an asset return, a portfolio return, and a benchmark return. | Analyzing a performance of an asset in a portfolio includes retrieving, from a number of financial sources, information for a list of trades, the list of trades representing assets associated with a portfolio that have been traded during a time interval, determining, based on the information, a number of returns associated with the list of trades over the time interval, creating, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade, determining, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over the time interval via trade attribution matching, computing an incidental exposure residual to the portfolio return over the time interval, and presenting, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio.1. A method for analyzing a performance of at least one asset in a portfolio, the method comprising:
retrieving, from a number of financial sources, information for a list of trades, the list of trades representing assets associated with a portfolio that have been traded during a time interval; determining, based on the information, a number of returns associated with the list of trades over the time interval; creating, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; determining, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over the time interval via trade attribution matching; computing an incidental exposure residual to the portfolio return over the time interval; and presenting, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio. 2. The method of claim 1, in which each of the assets in the portfolio are characterized by a time clock, a side of each trade, and the initial fraction. 3. The method of claim 1, in which the number of returns associated with the list of trades over the time interval comprises an asset return, a portfolio return, and a benchmark return. 4. The method of claim 1, in which determining, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching comprises:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time; computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 5. The method of claim 1, in which an aggregate trade of the assets replaces a trade of the assets when more than one trade of the assets occurs within an accuracy of a time clock. 6. The method of claim 1, in which the assets are modified based on corporate actions, the corporate actions comprising changing an identifier of at least one of the assets, creating a split or a reverse split of at least one of the assets, a demerging of at least one of the assets, a merging of at least one of the assets, or combinations thereof. 7. The method of claim 1, in which the assets of the portfolio created at a discrete instant in time are pretreated. 8. The method of claim 1, in which a collection of the assets are further pretreated when the collection of the assets is implemented at a specific clock time for a purpose of inserting or extracting cash liquidity to or from the portfolio. 9. A system for analyzing a performance of at least one asset in a portfolio, the system comprising:
a processor; a memory, comprising computer program code, communicatively coupled to the processor; a network interface for communicating data via a computer network; a display device; wherein, the computer program code comprising; a creating engine to create, for each trade of assets in a list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; a profit determining engine to determine, for each sale of the assets in the list of trades, a rebalancing trading profit contribution to a portfolio return over a time interval via trade attribution matching; a computing engine to compute an incidental exposure residual to the portfolio return over the time interval; and a presenting engine to present using the display device, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in a portfolio. 10. The system of claim 9, further comprising a retrieving engine to retrieve, from a number of financial sources, information for the list of trades, the list of trades representing the assets associated with the portfolio that have been traded during the time interval. 11. The system of claim 9, further comprising a return determining engine to determine, based on information, a number of returns associated with the list of trades over the time interval. 12. The system of claim 9, in which the profit determining engine determines, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching by:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; and computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time. 13. The system of claim 12, in which the profit determining engine further determines, for each sale of the assets in the list of trades, the rebalancing trading profit contribution to the portfolio return over the time interval via the trade attribution matching by:
computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 14. A machine-readable storage medium encoded with instructions for analyzing a performance of at least one asset in a portfolio, the instructions executable by a processor of a system to cause the system to:
determine, for each sale of assets in a list of trades, a rebalancing trading profit contribution to a portfolio return over a time interval via trade attribution matching; and compute an incidental exposure residual to the portfolio return over the time interval. 15. The product of claim 14, further comprising instructions that, when executed, cause the processor to:
retrieve, from a number of financial sources, information for the list of trades, the list of trades representing the assets associated with a portfolio that have been traded during a time interval; and determine, based on the information, a number of returns associated with the list of trades over the time interval. 16. The product of claim 14, further comprising instructions that, when executed, cause the processor to:
create, for each trade of the assets in the list of trades, a remainder fraction, the remainder fraction being equal to an initial fraction for that trade; and present, based on the rebalancing trading profit contribution and the incidental exposure residual, a performance of the assets in the portfolio. 17. The product of claim 14, in which the trade attribution matching comprises:
ordering each sale of the assets in the list of trades sequentially based on a clock time; determining if a sell remainder fraction for one of the assets is zero; identifying a buy of one of the assets with a buy clock time prior to a sell clock time for which a buy remainder fraction is positive; computing a discount factor; computing a buy discount remainder fraction of a portfolio weight bought discounted at the sell clock time; computing a matched weight; reducing the buy remainder faction by a quantity of the matched weight divided by the discount factor; reducing the sell remainder fraction by the matched weight; computing a relative return difference; computing a contribution of a trade profit due to a trading of the assets; and accumulating, based on the sell clock time, the contribution of the trade profit to an overall sum, the overall sum representing the rebalancing trading profit contribution to the portfolio return over the time interval. 18. The product of claim 14, in which a collection of the assets are pretreated when the collection of the assets is implemented at a specific clock time for a purpose of inserting or extracting cash liquidity to or from a portfolio. 19. The product of claim 14, in which the assets are modified based on corporate actions, the corporate actions comprising changing an identifier of at least one of the assets, creating a split or a reverse split of at least one of the assets, a demerging of at least one of the assets, a merging of at least one of the assets, or combinations thereof. 20. The product of claim 14, in which a number of returns associated with the list of trades over the time interval comprises an asset return, a portfolio return, and a benchmark return. | 3,600 |
13,519 | 13,519 | 14,755,786 | 3,693 | The disclosed embodiments include methods and system for detecting error events, such as account shortfalls, within networked computer systems operated by the financial institutions and other business. In one aspect, a system includes a memory storing instructions and one or more processors configured to execute the instruction to perform operating, such as receiving a payment request for a payment amount from a first account of a user to a destination account. The operations may also include determining that the first account lacks sufficient funds to cover the payment amount, and determining that the user has pre-approved credit facility secured by a first set of investment holdings of the user that generate revenue that is periodically transferred to the first account. The operations may also include performing a fund transfer operation for the payment amount from the credit line account to the first account. | 1. A system, comprising:
a memory storing instructions; and one or more processors configured to execute the instructions to perform operations including:
identifying at least one scheduled funds transfer from a first investment account of a plurality of investment accounts to a destination account, the at least one scheduled funds transfer being associated with a funds transfer amount determined based on expected periodic returns from the first investment account;
determining a shortfall amount associated with a shortfall event, the shortfall event indicating that the funds transfer amount exceeds an amount of funds available from the first investment account, and the shortfall amount reflecting a difference between the amount of available funds and the funds transfer amount;
performing operations that trigger an automated funds transfer of at least a first portion of the shortfall amount from the shortfall account to the destination account; and
determining a repayment schedule for the shortfall account, based on funds available within at least a portion of the investment accounts after one or more future scheduled funds transfers. 2. The system of claim 1, wherein the at least one processor is further configured to perform operations including establishing the shortfall account for a first user, the shortfall account comprising a credit facility providing at least the shortfall amount. 3. The system of claim 1, wherein at least one of the first investment account or the destination account is at least one of held by a first user, held by a second user, or held jointly by the first and second users. 4. The system of claim 1, wherein the at least one processor is further configured to perform operations including identifying (i) a first scheduled funds transfer from the first investment account to the destination account and (ii) at least one second scheduled funds transfer from a second investment account to the destination account, the first scheduled funds transfer being associated with a first funds transfer amount, and the second scheduled funds transfer being associated with a second funds transfer amount. 5. The system of claim 1, wherein:
the determined shortfall event indicates that the first funds transfer amount exceeds a first amount of funds available from the first investment account; and the at least one processor is further configured to perform operations' including:
determining that a second amount of funds available from the second investment account exceeds the second funds transfer amount;
computing an amount of excess funds available within the second investment account, the excess funds amount representing a portion of the second available funds amount that exceeds the second funds transfer amount; and
performing operations that trigger a funds transfer of the excess funds amount from the second investment account to the destination account. 6. The system of claim 5, wherein the at least one processor is further configured to perform operations including:
computing a revised shortfall amount for the shortfall event, the revised shortfall amount reflecting a reduction of the shortfall amount by the excess funds amount; performing operations that trigger a funds transfer of at least a portion of the revised shortfall amount from the shortfall account to the destination account; and determining a repayment schedule for the portion of the revised shortfall amount transferred from the shortfall account, the repayment scheduled being based on funds remaining in at least one of the first or second investment accounts after one or more future scheduled funds transfers. 7. The system of claim 5, wherein the at least one processor is further configured to perform operations including:
determining that the excess funds amount is equivalent to or exceeds the shortfall amount; and establishing that the funds transfer of the excess funds amount from the second investment account to the destination account offsets the shortfall amount. 8. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
identifying scheduled funds transfers from the first investment account to corresponding ones of a plurality of destination accounts, the scheduled funds transfers being associated with corresponding funds transfer amounts; determining at least one shortfall event indicating that available funds from the first investment account are insufficient to meet at least one of the funds transfer amounts; determining at least one shortfall amount associated with the at least one shortfall event, the at least one shortfall amount reflecting a difference between the amount of available funds and at least one of the corresponding funds transfer amounts; and performing operations that trigger a funds transfer of at least a portion of the at least one shortfall amount from the shortfall account to corresponding ones of the destination accounts. 9. The system of claim 1, wherein the shortfall account is secured against at least one of the first investment account or one or more second investment accounts of the plurality of investment accounts. 10. The system of claim 1, wherein the credit facility comprises at least one of a line of credit, a loan, a demand product, an overdraft protection service, a borrowing facility, a source of crowdsourcing funds, a source of micro-financing, a friend capable of providing funds, or a family member capable of providing funds. 11. The system of claim 1, wherein:
the credit facility comprises a line of credit; and the at least one processor is further configured to perform operations including establishing the line of credit for the user based on one or more investment holdings associated with at least the first investment account, the shortfall account having an associated a shortfall balance and period of validity. 12. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
generating one or more electronic commands to liquidate at least a portion of the holdings of the first investment account to obtain funds corresponding to at least a second portion of the shortfall amount; and generating one or more electronic commands to transfer the obtained funds to the destination account. 13. The system of claim 12, wherein the at least one processor is further configured to perform operations including identifying the liquidated portion of the holdings based on at least one of a liquidation characteristic of the holdings, a penalty associated with the liquidation, a rate of return associated with the holdings, a user preference, or an interest rate associated with the repayment schedule. 14. The system of claim 12, wherein the at least one processor is further configured to perform operations including:
generating one or more electronic commands to liquidate at least a portion of the holdings of a second investment account of the plurality of investment accounts to obtain funds corresponding to at least a third portion of the shortfall amount; and generating one or more electronic commands to transfer the obtained funds to the destination account. 15. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
performing operations that trigger the funds transfer of the shortfall amount from the shortfall account to the destination account; and providing a notification to a device of the user indicating that the shortfall account was used to cover the shortfall amount. 16. The system of claim 1, wherein:
the at least one processor is further configured to perform operations including creating the shortfall account without liquidating investment holdings of the user; and the at least one processor is further configured to perform operations including executing the funds transfer in the shortfall amount from the shortfall account to the destination account without liquidating investment holdings of the user. 17. The system of claim 1, further comprising wherein the at least one processor is further configured to perform operations including:
determining a subsequent deposit amount to the first investment account following the shortfall event; determining a first excess fund amount for the first investment account that indicates a difference between the available funds from the investment account following the subsequent deposit amount to the investment account and the funds transfer amount; determining a shortfall account payment amount based on the first excess fund amount; performing a shortfall account payment funds transfer from the investment account to the shortfall account, for the shortfall account payment amount. 18. The system of claim 17, wherein the shortfall account payment amount is at least one of equal to the first excess fund amount or a portion of the first excess fund amount. 19. A device, comprising:
a memory storing instructions; and one or more processors configured to execute the instructions to perform operations including:
obtaining user registration information reflecting a request by a user for a shortfall account, the investment account being associated with at least one scheduled funds transfer of a funds transfer amount determined based on expected periodic returns from at least one of a plurality of investment accounts to one or more destination accounts;
providing the request for the shortfall account to a computing system associated with a financial institution, the computing system being connected to the device across a corresponding communications network;
receiving, from the computing system, a shortfall event notification of a shortfall event indicating that available funds from the at least one investment account are insufficient to meet the funds transfer amount;
receiving, from the computing system, a shortfall account payment notification that a shortfall account payment was made from the shortfall account to at least one of the destination accounts, the shortfall account payment including a first excess fund amount that reflects at least a portion of the difference between available funds from the at least one investment account and the funds transfer amount;
receiving, from the computing system, shortfall repayment schedule information reflecting a repayment schedule for the shortfall account, the repayment schedule being based on funds available from the investment accounts after future scheduled funds transfers from the investment accounts to the one or more destination accounts; and
generating one or more instructions to present the received shortfall account payment notification and shortfall repayment schedule information to the user. 20. A computer-implemented method, comprising:
identifying, by one or more processors, at least one scheduled funds transfer from a first investment account of a plurality of investment accounts to a destination account, the at least one scheduled funds transfer being associated with a funds transfer amount determined based on expected periodic returns from the first investment account; determining, by the one or more processors, a shortfall amount associated with a shortfall event, the shortfall event indicating that the funds transfer amount exceeds an amount of funds available from the first investment account, and the shortfall amount reflecting a difference between the amount of available funds and the funds transfer amount; performing, by the one or more processors, operations that trigger an automated funds transfer of at least a first portion of the shortfall amount from the shortfall account to the destination account; and determining, by the one or more processors, a repayment schedule for the shortfall account, based on funds available within at least a portion of the investment accounts after one or more future scheduled funds transfers. 21. The method of claim 20, further comprising establishing, by the one or more processors, a shortfall account for a first user, the shortfall account comprising a credit facility providing at least the shortfall amount. 22. The method of claim 20, wherein at least one of the first investment account or the destination account is at least one of held by a first user, held by a second user having a relationship with the first user, or held jointly by the first and second users. 23. The method of claim 20, further comprising identifying (i) a first scheduled funds transfer from the first investment account to the destination account and (ii) a least second scheduled funds transfer from a second investment account to the destination account, the first scheduled funds transfer being associated with a first funds transfer amount, and the second scheduled funds transfer being associated with a second funds transfer amount. 24. The method of claim 20, wherein:
the determined shortfall event indicates that the first funds transfer amount exceeds a first amount of funds available from the first investment account; and the method further comprises:
determining, by the one or more processors, that a second amount of funds available from the second investment account exceeds the second funds transfer amount;
computing, by the one or more processors, an amount of excess funds available within the second investment account, the excess funds amount representing a portion of the second available funds amount that exceeds the second funds transfer amount; and
performing, by the one or more processors, operations that trigger a funds transfer of the excess funds amount from the second investment account to the destination account. 25. The method of claim 24, further comprising:
computing, by the one or more processors, a revised shortfall amount for the shortfall event, the revised shortfall amount reflecting a reduction of the shortfall amount by the excess funds amount; performing, by the one or more processors, operations that trigger a funds transfer of at least a portion of the revised shortfall amount from the shortfall account to the destination account; and determining, by the one or more processors, a repayment schedule for the portion of the revised shortfall amount transferred from the shortfall account, the repayment scheduled being based on funds remaining in at least one of the first or second investment accounts after one or more future scheduled funds transfers. 26. The method of claim 24, further comprising:
determining, by the one or more processors, that the excess funds amount is equivalent to or exceeds the shortfall amount; and establishing, by the one or more processors, that the funds transfer of the excess funds amount from the second investment account to the destination account offsets the shortfall amount. 27. The method of claim 20, further comprising:
identifying, by the one or more processors, scheduled funds transfers from the first investment account to corresponding ones of a plurality of destination accounts, the scheduled funds transfers being associated with corresponding funds transfer amounts; determining, by the one or more processors, at least one shortfall event indicating that available funds from the first investment account are insufficient to meet the at least one of funds transfer amounts; determining, by the one or more processors, at least one shortfall amount associated with the at least one shortfall event, the at least one shortfall amount reflecting a difference between the amount of available funds and at least one of the corresponding funds transfer amounts; and performing, by the one or more processors, operations that trigger a funds transfer of at least a portion of the at least one shortfall amount from the shortfall account to corresponding ones of the destination accounts. 28. The method of claim 20, wherein the shortfall account is secured against the investment account. 29. The method of claim 20, wherein the credit facility comprises at least one of a line of credit, a loan, a demand product, an overdraft protection service, a borrowing facility, a source of crowdsourcing funds, a source of micro-financing, a friend capable of providing funds, or a family member capable of providing funds. 30. The method of claim 20, wherein:
the credit facility comprises a line of credit; and creating the shortfall account includes establishing the line of credit for the user based on one or more investment holdings associated with the investment account, the shortfall account comprising a shortfall balance and a period of validity. 31. The method of claim 20, further comprising:
generating, by the one or more processors, one or more electronic commands to liquidate at least a portion of the holdings of the first investment account to obtain funds corresponding to at least a second portion of the shortfall amount; and generating, by the one or more processors, one or more electronic commands to transfer the obtained funds to the destination account. 32. The method of claim 31, further comprising identifying the liquidated portion of the holdings based on at least one of a liquidation characteristic of the holdings, a penalty associated with the liquidation, a rate of return associated with the holdings, a user preference, or an interest rate associated with the repayment schedule. 33. The method of claim 31, wherein the at least one processor is further configured to perform operations including:
generating, by the one or more processors, one or more electronic commands to liquidate at least a portion of the holdings of a second investment account of the plurality of investment accounts to obtain funds corresponding to at least a third portion of the shortfall amount; and generating, by the one or more processors, one or more electronic commands to transfer the obtained funds to the destination account. 34. The method of claim 20, wherein:
the performing comprises performing operations that trigger the funds transfer of the shortfall amount from the shortfall account to the destination account; and the method further comprises providing, by the one or more processors, a notification to a device of the user reflecting that the shortfall account was used to cover the determined shortfall amount. 35. The method of claim 20, wherein at least one of (i) creating the shortfall account includes creating the shortfall account without liquidating investment holdings of the user, or (ii) executing the funds transfer of the shortfall amount from the shortfall account to the destination account without liquidating investment holdings of the user. | The disclosed embodiments include methods and system for detecting error events, such as account shortfalls, within networked computer systems operated by the financial institutions and other business. In one aspect, a system includes a memory storing instructions and one or more processors configured to execute the instruction to perform operating, such as receiving a payment request for a payment amount from a first account of a user to a destination account. The operations may also include determining that the first account lacks sufficient funds to cover the payment amount, and determining that the user has pre-approved credit facility secured by a first set of investment holdings of the user that generate revenue that is periodically transferred to the first account. The operations may also include performing a fund transfer operation for the payment amount from the credit line account to the first account.1. A system, comprising:
a memory storing instructions; and one or more processors configured to execute the instructions to perform operations including:
identifying at least one scheduled funds transfer from a first investment account of a plurality of investment accounts to a destination account, the at least one scheduled funds transfer being associated with a funds transfer amount determined based on expected periodic returns from the first investment account;
determining a shortfall amount associated with a shortfall event, the shortfall event indicating that the funds transfer amount exceeds an amount of funds available from the first investment account, and the shortfall amount reflecting a difference between the amount of available funds and the funds transfer amount;
performing operations that trigger an automated funds transfer of at least a first portion of the shortfall amount from the shortfall account to the destination account; and
determining a repayment schedule for the shortfall account, based on funds available within at least a portion of the investment accounts after one or more future scheduled funds transfers. 2. The system of claim 1, wherein the at least one processor is further configured to perform operations including establishing the shortfall account for a first user, the shortfall account comprising a credit facility providing at least the shortfall amount. 3. The system of claim 1, wherein at least one of the first investment account or the destination account is at least one of held by a first user, held by a second user, or held jointly by the first and second users. 4. The system of claim 1, wherein the at least one processor is further configured to perform operations including identifying (i) a first scheduled funds transfer from the first investment account to the destination account and (ii) at least one second scheduled funds transfer from a second investment account to the destination account, the first scheduled funds transfer being associated with a first funds transfer amount, and the second scheduled funds transfer being associated with a second funds transfer amount. 5. The system of claim 1, wherein:
the determined shortfall event indicates that the first funds transfer amount exceeds a first amount of funds available from the first investment account; and the at least one processor is further configured to perform operations' including:
determining that a second amount of funds available from the second investment account exceeds the second funds transfer amount;
computing an amount of excess funds available within the second investment account, the excess funds amount representing a portion of the second available funds amount that exceeds the second funds transfer amount; and
performing operations that trigger a funds transfer of the excess funds amount from the second investment account to the destination account. 6. The system of claim 5, wherein the at least one processor is further configured to perform operations including:
computing a revised shortfall amount for the shortfall event, the revised shortfall amount reflecting a reduction of the shortfall amount by the excess funds amount; performing operations that trigger a funds transfer of at least a portion of the revised shortfall amount from the shortfall account to the destination account; and determining a repayment schedule for the portion of the revised shortfall amount transferred from the shortfall account, the repayment scheduled being based on funds remaining in at least one of the first or second investment accounts after one or more future scheduled funds transfers. 7. The system of claim 5, wherein the at least one processor is further configured to perform operations including:
determining that the excess funds amount is equivalent to or exceeds the shortfall amount; and establishing that the funds transfer of the excess funds amount from the second investment account to the destination account offsets the shortfall amount. 8. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
identifying scheduled funds transfers from the first investment account to corresponding ones of a plurality of destination accounts, the scheduled funds transfers being associated with corresponding funds transfer amounts; determining at least one shortfall event indicating that available funds from the first investment account are insufficient to meet at least one of the funds transfer amounts; determining at least one shortfall amount associated with the at least one shortfall event, the at least one shortfall amount reflecting a difference between the amount of available funds and at least one of the corresponding funds transfer amounts; and performing operations that trigger a funds transfer of at least a portion of the at least one shortfall amount from the shortfall account to corresponding ones of the destination accounts. 9. The system of claim 1, wherein the shortfall account is secured against at least one of the first investment account or one or more second investment accounts of the plurality of investment accounts. 10. The system of claim 1, wherein the credit facility comprises at least one of a line of credit, a loan, a demand product, an overdraft protection service, a borrowing facility, a source of crowdsourcing funds, a source of micro-financing, a friend capable of providing funds, or a family member capable of providing funds. 11. The system of claim 1, wherein:
the credit facility comprises a line of credit; and the at least one processor is further configured to perform operations including establishing the line of credit for the user based on one or more investment holdings associated with at least the first investment account, the shortfall account having an associated a shortfall balance and period of validity. 12. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
generating one or more electronic commands to liquidate at least a portion of the holdings of the first investment account to obtain funds corresponding to at least a second portion of the shortfall amount; and generating one or more electronic commands to transfer the obtained funds to the destination account. 13. The system of claim 12, wherein the at least one processor is further configured to perform operations including identifying the liquidated portion of the holdings based on at least one of a liquidation characteristic of the holdings, a penalty associated with the liquidation, a rate of return associated with the holdings, a user preference, or an interest rate associated with the repayment schedule. 14. The system of claim 12, wherein the at least one processor is further configured to perform operations including:
generating one or more electronic commands to liquidate at least a portion of the holdings of a second investment account of the plurality of investment accounts to obtain funds corresponding to at least a third portion of the shortfall amount; and generating one or more electronic commands to transfer the obtained funds to the destination account. 15. The system of claim 1, wherein the at least one processor is further configured to perform operations including:
performing operations that trigger the funds transfer of the shortfall amount from the shortfall account to the destination account; and providing a notification to a device of the user indicating that the shortfall account was used to cover the shortfall amount. 16. The system of claim 1, wherein:
the at least one processor is further configured to perform operations including creating the shortfall account without liquidating investment holdings of the user; and the at least one processor is further configured to perform operations including executing the funds transfer in the shortfall amount from the shortfall account to the destination account without liquidating investment holdings of the user. 17. The system of claim 1, further comprising wherein the at least one processor is further configured to perform operations including:
determining a subsequent deposit amount to the first investment account following the shortfall event; determining a first excess fund amount for the first investment account that indicates a difference between the available funds from the investment account following the subsequent deposit amount to the investment account and the funds transfer amount; determining a shortfall account payment amount based on the first excess fund amount; performing a shortfall account payment funds transfer from the investment account to the shortfall account, for the shortfall account payment amount. 18. The system of claim 17, wherein the shortfall account payment amount is at least one of equal to the first excess fund amount or a portion of the first excess fund amount. 19. A device, comprising:
a memory storing instructions; and one or more processors configured to execute the instructions to perform operations including:
obtaining user registration information reflecting a request by a user for a shortfall account, the investment account being associated with at least one scheduled funds transfer of a funds transfer amount determined based on expected periodic returns from at least one of a plurality of investment accounts to one or more destination accounts;
providing the request for the shortfall account to a computing system associated with a financial institution, the computing system being connected to the device across a corresponding communications network;
receiving, from the computing system, a shortfall event notification of a shortfall event indicating that available funds from the at least one investment account are insufficient to meet the funds transfer amount;
receiving, from the computing system, a shortfall account payment notification that a shortfall account payment was made from the shortfall account to at least one of the destination accounts, the shortfall account payment including a first excess fund amount that reflects at least a portion of the difference between available funds from the at least one investment account and the funds transfer amount;
receiving, from the computing system, shortfall repayment schedule information reflecting a repayment schedule for the shortfall account, the repayment schedule being based on funds available from the investment accounts after future scheduled funds transfers from the investment accounts to the one or more destination accounts; and
generating one or more instructions to present the received shortfall account payment notification and shortfall repayment schedule information to the user. 20. A computer-implemented method, comprising:
identifying, by one or more processors, at least one scheduled funds transfer from a first investment account of a plurality of investment accounts to a destination account, the at least one scheduled funds transfer being associated with a funds transfer amount determined based on expected periodic returns from the first investment account; determining, by the one or more processors, a shortfall amount associated with a shortfall event, the shortfall event indicating that the funds transfer amount exceeds an amount of funds available from the first investment account, and the shortfall amount reflecting a difference between the amount of available funds and the funds transfer amount; performing, by the one or more processors, operations that trigger an automated funds transfer of at least a first portion of the shortfall amount from the shortfall account to the destination account; and determining, by the one or more processors, a repayment schedule for the shortfall account, based on funds available within at least a portion of the investment accounts after one or more future scheduled funds transfers. 21. The method of claim 20, further comprising establishing, by the one or more processors, a shortfall account for a first user, the shortfall account comprising a credit facility providing at least the shortfall amount. 22. The method of claim 20, wherein at least one of the first investment account or the destination account is at least one of held by a first user, held by a second user having a relationship with the first user, or held jointly by the first and second users. 23. The method of claim 20, further comprising identifying (i) a first scheduled funds transfer from the first investment account to the destination account and (ii) a least second scheduled funds transfer from a second investment account to the destination account, the first scheduled funds transfer being associated with a first funds transfer amount, and the second scheduled funds transfer being associated with a second funds transfer amount. 24. The method of claim 20, wherein:
the determined shortfall event indicates that the first funds transfer amount exceeds a first amount of funds available from the first investment account; and the method further comprises:
determining, by the one or more processors, that a second amount of funds available from the second investment account exceeds the second funds transfer amount;
computing, by the one or more processors, an amount of excess funds available within the second investment account, the excess funds amount representing a portion of the second available funds amount that exceeds the second funds transfer amount; and
performing, by the one or more processors, operations that trigger a funds transfer of the excess funds amount from the second investment account to the destination account. 25. The method of claim 24, further comprising:
computing, by the one or more processors, a revised shortfall amount for the shortfall event, the revised shortfall amount reflecting a reduction of the shortfall amount by the excess funds amount; performing, by the one or more processors, operations that trigger a funds transfer of at least a portion of the revised shortfall amount from the shortfall account to the destination account; and determining, by the one or more processors, a repayment schedule for the portion of the revised shortfall amount transferred from the shortfall account, the repayment scheduled being based on funds remaining in at least one of the first or second investment accounts after one or more future scheduled funds transfers. 26. The method of claim 24, further comprising:
determining, by the one or more processors, that the excess funds amount is equivalent to or exceeds the shortfall amount; and establishing, by the one or more processors, that the funds transfer of the excess funds amount from the second investment account to the destination account offsets the shortfall amount. 27. The method of claim 20, further comprising:
identifying, by the one or more processors, scheduled funds transfers from the first investment account to corresponding ones of a plurality of destination accounts, the scheduled funds transfers being associated with corresponding funds transfer amounts; determining, by the one or more processors, at least one shortfall event indicating that available funds from the first investment account are insufficient to meet the at least one of funds transfer amounts; determining, by the one or more processors, at least one shortfall amount associated with the at least one shortfall event, the at least one shortfall amount reflecting a difference between the amount of available funds and at least one of the corresponding funds transfer amounts; and performing, by the one or more processors, operations that trigger a funds transfer of at least a portion of the at least one shortfall amount from the shortfall account to corresponding ones of the destination accounts. 28. The method of claim 20, wherein the shortfall account is secured against the investment account. 29. The method of claim 20, wherein the credit facility comprises at least one of a line of credit, a loan, a demand product, an overdraft protection service, a borrowing facility, a source of crowdsourcing funds, a source of micro-financing, a friend capable of providing funds, or a family member capable of providing funds. 30. The method of claim 20, wherein:
the credit facility comprises a line of credit; and creating the shortfall account includes establishing the line of credit for the user based on one or more investment holdings associated with the investment account, the shortfall account comprising a shortfall balance and a period of validity. 31. The method of claim 20, further comprising:
generating, by the one or more processors, one or more electronic commands to liquidate at least a portion of the holdings of the first investment account to obtain funds corresponding to at least a second portion of the shortfall amount; and generating, by the one or more processors, one or more electronic commands to transfer the obtained funds to the destination account. 32. The method of claim 31, further comprising identifying the liquidated portion of the holdings based on at least one of a liquidation characteristic of the holdings, a penalty associated with the liquidation, a rate of return associated with the holdings, a user preference, or an interest rate associated with the repayment schedule. 33. The method of claim 31, wherein the at least one processor is further configured to perform operations including:
generating, by the one or more processors, one or more electronic commands to liquidate at least a portion of the holdings of a second investment account of the plurality of investment accounts to obtain funds corresponding to at least a third portion of the shortfall amount; and generating, by the one or more processors, one or more electronic commands to transfer the obtained funds to the destination account. 34. The method of claim 20, wherein:
the performing comprises performing operations that trigger the funds transfer of the shortfall amount from the shortfall account to the destination account; and the method further comprises providing, by the one or more processors, a notification to a device of the user reflecting that the shortfall account was used to cover the determined shortfall amount. 35. The method of claim 20, wherein at least one of (i) creating the shortfall account includes creating the shortfall account without liquidating investment holdings of the user, or (ii) executing the funds transfer of the shortfall amount from the shortfall account to the destination account without liquidating investment holdings of the user. | 3,600 |
13,520 | 13,520 | 13,076,791 | 3,644 | Cast pellets containing plants seeds and methods of making the cast pellets are described. The cast pellets include a mixture of one or more plant seeds and a setable, flowable casting substance. The casting substance can be a thermoplastic or another material such as plaster, polyacrylamide or a derivative thereof, polyacrylic acid, a melt processable starch, wax, polyvinyl alcohol, glyceride, partial glyceride, or mixtures thereof. The mixture can additionally contain other substances, such as fillers, plant growth regulators, insecticides, fungicides, bactericides, fertilizers, microorganisms, or mixtures thereof. The seeds can be of the same or different species, and can be selected to have, for example, the same or different flower colors. | 1. A composition comprising a mixture of one or more plant seeds and a setable, flowable casting substance wherein the mixture is configured as a cast pellet. 2. The composition of claim 1 wherein the casting substance is selected from water-soluble thermoplastics, plasters, polyacrylamides or derivatives thereof, polyacrylic acids, melt processable starches, hard fats, waxes, polyvinyl alcohols, glycerides, partial glycerides, and mixtures thereof. 3. The composition of claim 1 wherein the casting substance comprises a water-soluble thermoplastic. 4. The composition of claim 1 wherein the casting substance comprises plaster. 5. The composition of claim 1 wherein the casting substance comprises polyacrylamide or a derivative thereof. 6. The composition of claim 1 wherein the casting substance comprises polyacrylic acid. 7. The composition of claim 1 wherein the casting substance comprises a melt processable starch. 8. The composition of claim 1 wherein the casting substance comprises a hard fat. 9. The composition of claim 1 wherein the casting substance comprises a wax. 10. The composition of claim 1 wherein the casting substance comprises polyvinyl alcohol. 11. The composition of claim 1 wherein the casting substance comprises a glyceride. 12. The composition of claim 1 wherein the casting substance comprises a partial glyceride. 13. The composition of claim 1 wherein the pellet comprises at least two plant seeds. 14. The composition of claim 13 wherein the at least two plant seeds comprise seeds of one variety. 15. The composition of claim 13 wherein the at least two plant seeds comprise seeds of at least two different varieties of the same species. 16. The composition of claim 13 wherein the at least two plant seeds comprise seed of at least two different species. 17. The composition of claim 3 wherein the thermoplastic comprises polyethylene glycol. 18. The composition of claim 17 wherein the polyethylene glycol has a molecular weight of about 1,500 to about 20,000. 19. The composition of claim 3 wherein the thermoplastic has a glass transition temperature of 35.0° C. or higher. 20. The composition of claim 3 wherein the thermoplastic has a melting temperature of 65.6° C. or lower. 21. The composition of claim 1 wherein the mixture further comprises a filler. 22. The composition of claim 21 wherein the filler comprises a sand or clay. 23. The composition of claim 21 wherein the filler is inert. 24. The composition of claim 21 wherein the filler modifies the water solubility of the cast pellet. 25. The composition of claim 21 wherein the filler modifies the permeability of the cast pellet. 26. The composition of claim 21 wherein the filler modifies the color of the cast pellet. 27. The composition of claim 21 wherein the filler modifies the rheological properties of the cast pellet. 28. The composition of claim 1 further comprising one or more plant growth regulators, insecticides, fungicides, bactericides, fertilizers, microorganisms, or mixtures thereof. 29. The composition of claim 1 further comprising a dummy pellet or smart pill. 30. The composition of claim 1 further comprising an overcoating disposed on the cast pellet. 31. The composition of claim 1 wherein the one or more plant seeds are untreated, coated, pelleted, treated, primed, or mixtures thereof. 32. A method of making a cast pellet, the method comprising:
(a) placing in a mold a mixture of one or more plant seeds and a setable, flowable casting substance in a flowable state; and (b) causing the casting substance to set to result in the cast pellet. | Cast pellets containing plants seeds and methods of making the cast pellets are described. The cast pellets include a mixture of one or more plant seeds and a setable, flowable casting substance. The casting substance can be a thermoplastic or another material such as plaster, polyacrylamide or a derivative thereof, polyacrylic acid, a melt processable starch, wax, polyvinyl alcohol, glyceride, partial glyceride, or mixtures thereof. The mixture can additionally contain other substances, such as fillers, plant growth regulators, insecticides, fungicides, bactericides, fertilizers, microorganisms, or mixtures thereof. The seeds can be of the same or different species, and can be selected to have, for example, the same or different flower colors.1. A composition comprising a mixture of one or more plant seeds and a setable, flowable casting substance wherein the mixture is configured as a cast pellet. 2. The composition of claim 1 wherein the casting substance is selected from water-soluble thermoplastics, plasters, polyacrylamides or derivatives thereof, polyacrylic acids, melt processable starches, hard fats, waxes, polyvinyl alcohols, glycerides, partial glycerides, and mixtures thereof. 3. The composition of claim 1 wherein the casting substance comprises a water-soluble thermoplastic. 4. The composition of claim 1 wherein the casting substance comprises plaster. 5. The composition of claim 1 wherein the casting substance comprises polyacrylamide or a derivative thereof. 6. The composition of claim 1 wherein the casting substance comprises polyacrylic acid. 7. The composition of claim 1 wherein the casting substance comprises a melt processable starch. 8. The composition of claim 1 wherein the casting substance comprises a hard fat. 9. The composition of claim 1 wherein the casting substance comprises a wax. 10. The composition of claim 1 wherein the casting substance comprises polyvinyl alcohol. 11. The composition of claim 1 wherein the casting substance comprises a glyceride. 12. The composition of claim 1 wherein the casting substance comprises a partial glyceride. 13. The composition of claim 1 wherein the pellet comprises at least two plant seeds. 14. The composition of claim 13 wherein the at least two plant seeds comprise seeds of one variety. 15. The composition of claim 13 wherein the at least two plant seeds comprise seeds of at least two different varieties of the same species. 16. The composition of claim 13 wherein the at least two plant seeds comprise seed of at least two different species. 17. The composition of claim 3 wherein the thermoplastic comprises polyethylene glycol. 18. The composition of claim 17 wherein the polyethylene glycol has a molecular weight of about 1,500 to about 20,000. 19. The composition of claim 3 wherein the thermoplastic has a glass transition temperature of 35.0° C. or higher. 20. The composition of claim 3 wherein the thermoplastic has a melting temperature of 65.6° C. or lower. 21. The composition of claim 1 wherein the mixture further comprises a filler. 22. The composition of claim 21 wherein the filler comprises a sand or clay. 23. The composition of claim 21 wherein the filler is inert. 24. The composition of claim 21 wherein the filler modifies the water solubility of the cast pellet. 25. The composition of claim 21 wherein the filler modifies the permeability of the cast pellet. 26. The composition of claim 21 wherein the filler modifies the color of the cast pellet. 27. The composition of claim 21 wherein the filler modifies the rheological properties of the cast pellet. 28. The composition of claim 1 further comprising one or more plant growth regulators, insecticides, fungicides, bactericides, fertilizers, microorganisms, or mixtures thereof. 29. The composition of claim 1 further comprising a dummy pellet or smart pill. 30. The composition of claim 1 further comprising an overcoating disposed on the cast pellet. 31. The composition of claim 1 wherein the one or more plant seeds are untreated, coated, pelleted, treated, primed, or mixtures thereof. 32. A method of making a cast pellet, the method comprising:
(a) placing in a mold a mixture of one or more plant seeds and a setable, flowable casting substance in a flowable state; and (b) causing the casting substance to set to result in the cast pellet. | 3,600 |
13,521 | 13,521 | 14,951,916 | 3,628 | Managing an electric vehicle exchange is provided. An available electric vehicle having a highest exchange score is selected to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle. In response to determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, it is determined whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle. In response to determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, routing information is sent via a network to a navigation system of the available electric vehicle to the selected charging station. | 1. A computer-implemented method for managing an electric vehicle exchange, the computer-implemented method comprising:
selecting, by a computer, an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; responsive to the computer determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, determining, by the computer, whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle; and responsive to the computer determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, sending, by the computer, routing information via a network to a navigation system of the available electric vehicle to the selected charging station. 2. The computer-implemented method of claim 1, wherein the computer performs the selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 3. The computer-implemented method of claim 1 further comprising:
determining, by the computer, whether a user of the available electric vehicle agrees to the exchange at the selected charging station. 4. The computer-implemented method of claim 1 further comprising:
receiving, by the computer, the travel destination from a navigation system of the another electric vehicle via the network;
determining, by the computer, a current battery charge level of the another electric vehicle based on data received from a sensor system of the another electric vehicle; and
predicting, by the computer, a travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle. 5. The computer-implemented method of claim 4 further comprising:
determining, by the computer, whether the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle; and
responsive to the computer determining that the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle, sending, by the computer, the routing information via the network to a navigation system of the another electric vehicle to the selected charging station within the travel distance of the another electric vehicle at the current battery charge level. 6. The computer-implemented method of claim 1 further comprising:
receiving, by the computer, a set of images via the network of a set of vehicle parts of the available electric vehicle and the another electric vehicle involved in the exchange at the selected charging station. 7. The computer-implemented method of claim 6 further comprising:
determining, by the computer, whether each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle is included in the set of images;
identifying, by the computer, any vehicle damage in the set of images; and
authorizing, by the computer, the exchange at the selected charging station. 8. The computer-implemented method of claim 5, wherein each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle include a quick response code. 9. The computer-implemented method of claim 8, wherein the quick response code is a fractal quick response code. 10. The computer-implemented method of claim 1, wherein the computer utilizes an object detection module to identify objects onboard the available electric vehicle and the another electric vehicle to facilitate the exchange. 11. The computer-implemented method of claim 1, wherein the computer utilizes a routing module to automatically estimate in real time travel routes for the available electric vehicle and the another electric vehicle to the selected charging station using GPS localization and a Bayesian model of routes that users of the available electric vehicle and the another electric vehicle are likely to take given current contexts and locations and what travel routes other users have previously taken to reach the selected charging station. 12. A computer system for managing an electric vehicle exchange, the computer system comprising:
a bus system; a storage device connected to the bus system, wherein the storage device stores program instructions; and a processor connected to the bus system, wherein the processor executes the program instructions to select an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; determine whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle in response to determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle; and send routing information via a network to a navigation system of the available electric vehicle to the selected charging station in response to determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle. 13. The computer system of claim 12, wherein the processor further executes the program instructions to perform selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 14. A computer program product for managing an electric vehicle exchange, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising:
selecting, by the computer, an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; responsive to the computer determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, determining, by the computer, whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle; and responsive to the computer determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, sending, by the computer, routing information via a network to a navigation system of the available electric vehicle to the selected charging station. 15. The computer program product of claim 14, wherein the computer performs the selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 16. The computer program product of claim 14 further comprising:
determining, by the computer, whether a user of the available electric vehicle agrees to the exchange at the selected charging station. 17. The computer program product of claim 14 further comprising:
receiving, by the computer, the travel destination from a navigation system of the another electric vehicle via the network;
determining, by the computer, a current battery charge level of the another electric vehicle based on data received from a sensor system of the another electric vehicle; and
predicting, by the computer, a travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle. 18. The computer program product of claim 17 further comprising:
determining, by the computer, whether the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle; and
responsive to the computer determining that the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle, sending, by the computer, the routing information via the network to a navigation system of the another electric vehicle to the selected charging station within the travel distance of the another electric vehicle at the current battery charge level. 19. The computer program product of claim 14 further comprising:
receiving, by the computer, a set of images via the network of a set of vehicle parts of the available electric vehicle and the another electric vehicle involved in the exchange at the selected charging station. 20. The computer program product of claim 19 further comprising:
determining, by the computer, whether each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle is included in the set of images;
identifying, by the computer, any vehicle damage in the set of images; and
authorizing, by the computer, the exchange at the selected charging station. | Managing an electric vehicle exchange is provided. An available electric vehicle having a highest exchange score is selected to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle. In response to determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, it is determined whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle. In response to determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, routing information is sent via a network to a navigation system of the available electric vehicle to the selected charging station.1. A computer-implemented method for managing an electric vehicle exchange, the computer-implemented method comprising:
selecting, by a computer, an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; responsive to the computer determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, determining, by the computer, whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle; and responsive to the computer determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, sending, by the computer, routing information via a network to a navigation system of the available electric vehicle to the selected charging station. 2. The computer-implemented method of claim 1, wherein the computer performs the selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 3. The computer-implemented method of claim 1 further comprising:
determining, by the computer, whether a user of the available electric vehicle agrees to the exchange at the selected charging station. 4. The computer-implemented method of claim 1 further comprising:
receiving, by the computer, the travel destination from a navigation system of the another electric vehicle via the network;
determining, by the computer, a current battery charge level of the another electric vehicle based on data received from a sensor system of the another electric vehicle; and
predicting, by the computer, a travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle. 5. The computer-implemented method of claim 4 further comprising:
determining, by the computer, whether the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle; and
responsive to the computer determining that the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle, sending, by the computer, the routing information via the network to a navigation system of the another electric vehicle to the selected charging station within the travel distance of the another electric vehicle at the current battery charge level. 6. The computer-implemented method of claim 1 further comprising:
receiving, by the computer, a set of images via the network of a set of vehicle parts of the available electric vehicle and the another electric vehicle involved in the exchange at the selected charging station. 7. The computer-implemented method of claim 6 further comprising:
determining, by the computer, whether each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle is included in the set of images;
identifying, by the computer, any vehicle damage in the set of images; and
authorizing, by the computer, the exchange at the selected charging station. 8. The computer-implemented method of claim 5, wherein each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle include a quick response code. 9. The computer-implemented method of claim 8, wherein the quick response code is a fractal quick response code. 10. The computer-implemented method of claim 1, wherein the computer utilizes an object detection module to identify objects onboard the available electric vehicle and the another electric vehicle to facilitate the exchange. 11. The computer-implemented method of claim 1, wherein the computer utilizes a routing module to automatically estimate in real time travel routes for the available electric vehicle and the another electric vehicle to the selected charging station using GPS localization and a Bayesian model of routes that users of the available electric vehicle and the another electric vehicle are likely to take given current contexts and locations and what travel routes other users have previously taken to reach the selected charging station. 12. A computer system for managing an electric vehicle exchange, the computer system comprising:
a bus system; a storage device connected to the bus system, wherein the storage device stores program instructions; and a processor connected to the bus system, wherein the processor executes the program instructions to select an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; determine whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle in response to determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle; and send routing information via a network to a navigation system of the available electric vehicle to the selected charging station in response to determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle. 13. The computer system of claim 12, wherein the processor further executes the program instructions to perform selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 14. A computer program product for managing an electric vehicle exchange, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to perform a method comprising:
selecting, by the computer, an available electric vehicle having a highest exchange score to perform an exchange at a selected charging station with another electric vehicle that has an insufficient battery charge level to reach a travel destination of the another electric vehicle; responsive to the computer determining that a current battery charge level of the available electric vehicle is sufficient to reach the travel destination of the another electric vehicle, determining, by the computer, whether the exchange will allow the available electric vehicle to reach a travel destination of the available electric vehicle; and responsive to the computer determining that the exchange will allow the available electric vehicle to reach the travel destination of the available electric vehicle, sending, by the computer, routing information via a network to a navigation system of the available electric vehicle to the selected charging station. 15. The computer program product of claim 14, wherein the computer performs the selecting of the available electric vehicle and selecting a geographic location for the exchange using at least one order embedding algorithm among an elastic map, a Sammon's map, and a Kohonen map. 16. The computer program product of claim 14 further comprising:
determining, by the computer, whether a user of the available electric vehicle agrees to the exchange at the selected charging station. 17. The computer program product of claim 14 further comprising:
receiving, by the computer, the travel destination from a navigation system of the another electric vehicle via the network;
determining, by the computer, a current battery charge level of the another electric vehicle based on data received from a sensor system of the another electric vehicle; and
predicting, by the computer, a travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle. 18. The computer program product of claim 17 further comprising:
determining, by the computer, whether the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle; and
responsive to the computer determining that the travel destination of the another electric vehicle exceeds the travel distance of the another electric vehicle at the current battery charge level of the another electric vehicle, sending, by the computer, the routing information via the network to a navigation system of the another electric vehicle to the selected charging station within the travel distance of the another electric vehicle at the current battery charge level. 19. The computer program product of claim 14 further comprising:
receiving, by the computer, a set of images via the network of a set of vehicle parts of the available electric vehicle and the another electric vehicle involved in the exchange at the selected charging station. 20. The computer program product of claim 19 further comprising:
determining, by the computer, whether each vehicle part in the set of vehicle parts of the available electric vehicle and the another electric vehicle is included in the set of images;
identifying, by the computer, any vehicle damage in the set of images; and
authorizing, by the computer, the exchange at the selected charging station. | 3,600 |
13,522 | 13,522 | 14,482,485 | 3,685 | A method for sharing transaction data includes: storing, inside a point of sale device, a removable integrated circuit payment card, the card being configured to store payment credentials associated with a payment account and including an antenna configured to operate using electric power provided by the point of sale device; receiving, by a receiver of the integrated circuit payment card, transaction data for a payment transaction; encrypting, by a processor of the integrated circuit payment card, the received transaction data; receiving, by the receiver of the integrated circuit payment card, an indication of receipt of an authorization response associated with the payment transaction; and transmitting, by the antenna, the encrypted transaction data to a mobile communication device. | 1. A method for sharing transaction data, comprising:
storing, inside a point of sale device, a removable integrated circuit payment card, wherein the integrated circuit payment card is configured to store payment credentials associated with a payment account and includes an antenna configured to operate using electric power provided by the point of sale device; receiving, by a receiver of the integrated circuit payment card, transaction data for a payment transaction; encrypting, by a processor of the integrated circuit payment card, the received transaction data; receiving, by the receiver of the integrated circuit payment card, an indication of receipt of an authorization response associated with the payment transaction; and transmitting, by the antenna, the encrypted transaction data to a mobile communication device. 2. The method of claim 1, wherein the antenna is a radio frequency antenna. 3. The method of claim 1, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 4. The method of claim 1, wherein the transaction data for the payment transaction is received after the indication of receipt of an authorization response. 5. The method of claim 1, wherein the removable integrated circuit payment card includes an integrated circuit including at least the receiver and the processor. 6. A method for aggregating transaction data, comprising:
storing, in a memory, transaction data for a plurality of payment transactions; receiving, by a receiving device, encrypted transaction data for a new payment transaction from an antenna of a removable integrated circuit payment card; decrypting, by a processing device, the received encrypted transaction data to obtain unencrypted transaction data; storing, in the memory, the unencrypted transaction data; and displaying, by a display device, the stored transaction data for the plurality of payment transactions and the stored unencrypted transaction data for the new payment transaction. 7. The method of claim 6, wherein the antenna is a radio frequency antenna. 8. The method of claim 6, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 9. The method of claim 6, wherein the plurality of payment transactions are associated with more than one payment account. 10. The method of claim 6, wherein the antenna of the removable integrated circuit payment card is powered by a point of sale device storing the removable integrated circuit payment card. 11. A system for sharing transaction data, comprising:
a point of sale device configured to store a removable integrated circuit payment card, wherein the integrated circuit payment card is configured to store payment credentials associated with a payment account and includes
an antenna configured to operate using electric power provided by the point of sale device,
a receiver configured to receive transaction data for a payment transaction, and
a processor configured to encrypt the received transaction data,
the receiver of the integrated circuit payment card is further configured to receive an indication of receipt of an authorization response associated with the payment transaction, and the antenna is further configured to transmit the encrypted transaction data to a mobile communication device. 12. The system of claim 11, wherein the antenna is a radio frequency antenna. 13. The system of claim 11, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 14. The system of claim 11, wherein the transaction data for the payment transaction is received after the indication of receipt of an authorization response. 15. The system of claim 11, wherein the removable integrated circuit payment card includes an integrated circuit including at least the receiver and the processor. 16. A system for aggregating transaction data, comprising:
a memory configured to store transaction data for a plurality of payment transactions; a receiving device configured to receive encrypted transaction data for a new payment transaction from an antenna of a removable integrated circuit payment card; a processing device configured to
decrypt the received encrypted transaction data to obtain unencrypted transaction data, and
store, in the memory, the unencrypted transaction data; and
a display device configured to display the stored transaction data for the plurality of payment transactions and the stored unencrypted transaction data for the new payment transaction. 17. The system of claim 16, wherein the antenna is a radio frequency antenna. 18. The system of claim 16, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 19. The system of claim 16, wherein the plurality of payment transactions are associated with more than one payment account. 20. The system of claim 16, wherein the antenna of the removable integrated circuit payment card is powered by a point of sale device storing the removable integrated circuit payment card. | A method for sharing transaction data includes: storing, inside a point of sale device, a removable integrated circuit payment card, the card being configured to store payment credentials associated with a payment account and including an antenna configured to operate using electric power provided by the point of sale device; receiving, by a receiver of the integrated circuit payment card, transaction data for a payment transaction; encrypting, by a processor of the integrated circuit payment card, the received transaction data; receiving, by the receiver of the integrated circuit payment card, an indication of receipt of an authorization response associated with the payment transaction; and transmitting, by the antenna, the encrypted transaction data to a mobile communication device.1. A method for sharing transaction data, comprising:
storing, inside a point of sale device, a removable integrated circuit payment card, wherein the integrated circuit payment card is configured to store payment credentials associated with a payment account and includes an antenna configured to operate using electric power provided by the point of sale device; receiving, by a receiver of the integrated circuit payment card, transaction data for a payment transaction; encrypting, by a processor of the integrated circuit payment card, the received transaction data; receiving, by the receiver of the integrated circuit payment card, an indication of receipt of an authorization response associated with the payment transaction; and transmitting, by the antenna, the encrypted transaction data to a mobile communication device. 2. The method of claim 1, wherein the antenna is a radio frequency antenna. 3. The method of claim 1, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 4. The method of claim 1, wherein the transaction data for the payment transaction is received after the indication of receipt of an authorization response. 5. The method of claim 1, wherein the removable integrated circuit payment card includes an integrated circuit including at least the receiver and the processor. 6. A method for aggregating transaction data, comprising:
storing, in a memory, transaction data for a plurality of payment transactions; receiving, by a receiving device, encrypted transaction data for a new payment transaction from an antenna of a removable integrated circuit payment card; decrypting, by a processing device, the received encrypted transaction data to obtain unencrypted transaction data; storing, in the memory, the unencrypted transaction data; and displaying, by a display device, the stored transaction data for the plurality of payment transactions and the stored unencrypted transaction data for the new payment transaction. 7. The method of claim 6, wherein the antenna is a radio frequency antenna. 8. The method of claim 6, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 9. The method of claim 6, wherein the plurality of payment transactions are associated with more than one payment account. 10. The method of claim 6, wherein the antenna of the removable integrated circuit payment card is powered by a point of sale device storing the removable integrated circuit payment card. 11. A system for sharing transaction data, comprising:
a point of sale device configured to store a removable integrated circuit payment card, wherein the integrated circuit payment card is configured to store payment credentials associated with a payment account and includes
an antenna configured to operate using electric power provided by the point of sale device,
a receiver configured to receive transaction data for a payment transaction, and
a processor configured to encrypt the received transaction data,
the receiver of the integrated circuit payment card is further configured to receive an indication of receipt of an authorization response associated with the payment transaction, and the antenna is further configured to transmit the encrypted transaction data to a mobile communication device. 12. The system of claim 11, wherein the antenna is a radio frequency antenna. 13. The system of claim 11, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 14. The system of claim 11, wherein the transaction data for the payment transaction is received after the indication of receipt of an authorization response. 15. The system of claim 11, wherein the removable integrated circuit payment card includes an integrated circuit including at least the receiver and the processor. 16. A system for aggregating transaction data, comprising:
a memory configured to store transaction data for a plurality of payment transactions; a receiving device configured to receive encrypted transaction data for a new payment transaction from an antenna of a removable integrated circuit payment card; a processing device configured to
decrypt the received encrypted transaction data to obtain unencrypted transaction data, and
store, in the memory, the unencrypted transaction data; and
a display device configured to display the stored transaction data for the plurality of payment transactions and the stored unencrypted transaction data for the new payment transaction. 17. The system of claim 16, wherein the antenna is a radio frequency antenna. 18. The system of claim 16, wherein the transaction data includes at least one of: transaction amount, transaction time and/or date, merchant name, merchant category, merchant industry, product data, and user-supplied data. 19. The system of claim 16, wherein the plurality of payment transactions are associated with more than one payment account. 20. The system of claim 16, wherein the antenna of the removable integrated circuit payment card is powered by a point of sale device storing the removable integrated circuit payment card. | 3,600 |
13,523 | 13,523 | 11,786,543 | 3,694 | Loan application information routing systems and methods with real-time credit check and demographics augmentation are provided. Also provided are systems and methods for managing relationships with customers (e.g., initiating follow-up contacts) and interfacing with lenders. | 1. A system for processing loan application information electronically, comprising:
a routing engine configured to:
receive a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan;
submit at least a portion of the information from the lead to a credit checking system for a credit check;
receive credit information regarding the party in response to the submitting; and
based at least in part on the credit information, route the lead to a selected destination. 2. The system of claim 1, wherein the credit check comprises a soft credit check. 3. The system of claim 1, wherein the routing engine is configured to submit at least a portion of the information from the lead to a credit checking system in substantially real time. 4. The system of claim 1, wherein the routing engine is configured to receive the lead via a HyperText Transfer Protocol (“HTTP”) connection with an affiliate. 5. The system of claim 4, wherein the routing engine is further configured to:
determine whether to accept or reject the lead based at least in part on the credit information; and submit a response to the affiliate regarding the determination. 6. The system of claim 5, wherein the routing engine is configured to submit the response to the affiliate via the same HTTP connection with the affiliate. 7. The system of claim 1, wherein the routing engine is configured to:
provide a Secure Socket Layer (“SSL”) post page; and receive the lead via posting of an extensible markup language (“XML”) document to the post page. 8. The system of claim 1, wherein said credit information comprises a credit grade representative a range of credit scores. 9. The system of claim 1, further comprising a database comprising information regarding multiple car dealerships, wherein the routing engine is configured to:
select a car dealership from the database; and based at least in part on the credit information, determine whether to submit the lead to the selected car dealership. 10. The system of claim 9, wherein:
the lead comprises a zip code; the database comprises associations between the multiple car dealerships and zip codes; and the routing engine is configured to select the car dealership from the database based at least in part on a comparison between the zip code of the lead and the zip codes stored in the database. 11. The system of claim 9, wherein the routing engine is further configured to:
assign a set of one or more affiliate identifiers to each of the car dealerships, where each affiliate identifier is associated with an affiliate from which leads can be received; determine whether each dealership is on track to meet a lead cap or target; depending on the outcome of the determination, automatically adjust the sets of affiliate identifiers for the car dealerships; receive an affiliate identifier associated with the lead; and select the car dealership from the database based at least in part on a match between the affiliate identifier associated with the lead and the set of one or more affiliate identifiers assigned to the car dealership. 12. A system for processing leads electronically, comprising:
a routing engine configured to:
receive a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile;
submit a request for demographics information relating to the party;
receive the demographics information in response to the submitted request;
augment the lead with at least a portion of the received demographics information; and
route the augmented lead to a relevant destination. 13. The system of claim 12, further comprising a database comprising associations between multiple car dealerships and zip codes, wherein:
the lead comprises a zip code; and the routing engine is configured to select the car dealership from the database based at least in part on a comparison between the zip code of the lead and the zip codes stored in the database. 14. The system of claim 12, wherein the demographics information is selected from the group consisting of title, surname, gender, age, birth date, marital status, education level, occupation code, number of children, dwelling type, household income, length of residence, renter status, homeowner status, home value, and a combination thereof. 15. A system for managing follow-up contacts with customers, comprising:
a database comprising associations between events within a sales cycle and follow-up contacts; and a customer relationship management tool configured to:
receive information identifying a customer of a car dealership and a status of that customer; and
when the customer's status matches an event within the sales cycle, trigger a follow-up contact to the customer on behalf of the car dealership. 16. The system of claim 15, wherein the customer relationship management tool is implemented remotely from the car dealership. 17. The system of claim 15, wherein the customer relationship management tool is configured to trigger multiple follow-up contacts automatically according to a predetermined methodology. 18. The system of claim 15, wherein the customer relationship management tool is configured to:
receive an update with respect to the status of the customer; change the customer's status from a first status to a second status, wherein the second status is associated with an event in the sales cycle; and trigger a follow-up contact associated with the second status to the party. 19. The system of claim 15, wherein the customer relationship management tool is configured to trigger the sending of an e-mail to the party. 20. The system of claim 15, wherein the customer relationship management tool is configured to trigger the mailing of physical mail to the party. 21. The system of claim 15, wherein the customer relationship management tool is configured to trigger the placement of a telephone call to the party. 22. A method for processing loan application information electronically, comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan; submitting at least a portion of said information from the lead for a credit check; receiving credit information regarding the party in response to the submitting; and based at least in part on the credit information, routing the lead to a selected destination. 23. The method of claim 22, wherein submitting at least a portion of the information from the lead for a credit check comprises submitting at least a portion of the information from the lead for a soft credit check. 24. The method of claim 22, wherein submitting at least a portion of the information from the lead for a credit check comprises submitting at least a portion of the information from the lead for a credit check in substantially real time. 25. The method of claim 22, wherein receiving a lead electronically comprises receiving the lead via a HyperText Transfer Protocol (“HTTP”) connection with an affiliate. 26. The method of claim 25, further comprising:
determining whether to accept or reject the lead based at least in part on the credit information; and submitting a response to the affiliate regarding the determination. 27. The method of claim 26, wherein submitting a response to the affiliate comprises submitting the response via the same HTTP connection with the affiliate. 28. The method of claim 22, further comprising:
providing a Secure Socket Layer (“SSL”) post page; and receiving the lead via posting of an extensible markup language (“XML”) document to the post page. 29. The method of claim 22, further comprising:
storing information regarding multiple car dealerships; selecting a car dealership from the multiple car dealerships; and based at least in part on the credit information, determining whether to submit the lead to the selected car dealership. 30. The method of claim 29, wherein:
storing information regarding multiple car dealerships comprises storing associations between the multiple car dealerships and zip codes; and selecting a car dealership comprises selecting the car dealership based at least in part on a comparison between a zip code of the lead and the stored zip codes. 31. The method of claim 29, further comprising:
assigning a set of one or more affiliate identifiers to each of the car dealerships, where each affiliate identifier is associated with an affiliate from which leads can be received; determining whether each dealership is on track to meet a lead cap or target; depending on the outcome of the determination, automatically adjusting the sets of affiliate identifiers for the car dealerships; receiving an affiliate identifier associated with the lead; and selecting the car dealership from the database based at least in part on a match between the affiliate identifier associated with the lead and the set of one or more affiliate identifiers assigned to the car dealership. 32. A method for processing leads electronically, comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile; submitting a request for demographics information relating to the party; receiving the demographics information in response to the submitted request; augmenting the lead with at least a portion of the received demographics information; and routing the augmented lead to a relevant destination. 33. A method for managing follow-up contacts with customers, comprising:
storing associations between events within a sales cycle and follow-up contacts; receiving information identifying a customer of a car dealership and a status of that customer; and when the customer's status matches an event within the sales cycle, triggering a follow-up contact to the customer on behalf of the car dealership. 34. The method of claim 33, further comprising triggering multiple follow-up contacts to the party automatically according to a predetermined methodology. 35. The method of claim 33, further comprising:
receiving an update with respect to the status of the customer; changing the customer's status from a first status to a second status, wherein the second status is associated with an event in the sales cycle; and triggering a follow-up contact associated with the second status to the party. 36. A computer-readable medium comprising computer program logic encoded thereon for performing the method comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan; submitting at least a portion of said information from the lead for a credit check; receiving credit information regarding the party in response to the submitting; and based at least in part on the credit information, routing the lead to a selected destination. 37. A system for processing leads electronically, comprising:
at least one database comprising information regarding multiple car dealerships; a server for receiving a extensible markup language (“XML”) document electronically via a Secure Socket Layer (“SSL”) post page, wherein the XML document comprises information relating to a party seeking to purchase an automobile; and a processor in communication with the server and the at least one database for submitting, over a network, at least a portion of the information from the XML document to a system for at least one of a credit check and a demographics check, for augmenting at least a portion of the information from the XML document with information received in response to the submission, and for routing the augmented information to a car dealership selected based at least in part on a comparison between the information stored in the at least one database and the information from the XML document. 38. The system of claim 37, further comprising a customer relationship management tool in communication with the processor for receiving information from the processor regarding the party and the selected car dealership, and for triggering follow-up contacts to the party on behalf of the car dealership according to a predetermined, event-driven methodology. 39. The system of claim 37, wherein:
the at least one database further comprises lead tracking data for the car dealerships, information regarding multiple affiliates capable of posting XML documents to the SSL post page, and assignments of sets of affiliates to car dealerships, wherein an assignment of an affiliate to a car dealership renders that car dealership eligible to receive leads from that affiliate; and the processor adjusts automatically for each car dealership the set of affiliates from which the car dealership is eligible to receive leads based at least in part on the lead tracking data for the car dealership. 40. A system for processing leads electronically, comprising:
means for receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile; means for submitting at least a portion of said information from the lead for at least one of a credit check and a demographics check; means for receiving at least one of credit information and demographics information regarding the party in response to the submitting; means for augmenting the lead with the at least one of credit information and demographics information; and means for routing the augmented lead to a relevant destination. | Loan application information routing systems and methods with real-time credit check and demographics augmentation are provided. Also provided are systems and methods for managing relationships with customers (e.g., initiating follow-up contacts) and interfacing with lenders.1. A system for processing loan application information electronically, comprising:
a routing engine configured to:
receive a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan;
submit at least a portion of the information from the lead to a credit checking system for a credit check;
receive credit information regarding the party in response to the submitting; and
based at least in part on the credit information, route the lead to a selected destination. 2. The system of claim 1, wherein the credit check comprises a soft credit check. 3. The system of claim 1, wherein the routing engine is configured to submit at least a portion of the information from the lead to a credit checking system in substantially real time. 4. The system of claim 1, wherein the routing engine is configured to receive the lead via a HyperText Transfer Protocol (“HTTP”) connection with an affiliate. 5. The system of claim 4, wherein the routing engine is further configured to:
determine whether to accept or reject the lead based at least in part on the credit information; and submit a response to the affiliate regarding the determination. 6. The system of claim 5, wherein the routing engine is configured to submit the response to the affiliate via the same HTTP connection with the affiliate. 7. The system of claim 1, wherein the routing engine is configured to:
provide a Secure Socket Layer (“SSL”) post page; and receive the lead via posting of an extensible markup language (“XML”) document to the post page. 8. The system of claim 1, wherein said credit information comprises a credit grade representative a range of credit scores. 9. The system of claim 1, further comprising a database comprising information regarding multiple car dealerships, wherein the routing engine is configured to:
select a car dealership from the database; and based at least in part on the credit information, determine whether to submit the lead to the selected car dealership. 10. The system of claim 9, wherein:
the lead comprises a zip code; the database comprises associations between the multiple car dealerships and zip codes; and the routing engine is configured to select the car dealership from the database based at least in part on a comparison between the zip code of the lead and the zip codes stored in the database. 11. The system of claim 9, wherein the routing engine is further configured to:
assign a set of one or more affiliate identifiers to each of the car dealerships, where each affiliate identifier is associated with an affiliate from which leads can be received; determine whether each dealership is on track to meet a lead cap or target; depending on the outcome of the determination, automatically adjust the sets of affiliate identifiers for the car dealerships; receive an affiliate identifier associated with the lead; and select the car dealership from the database based at least in part on a match between the affiliate identifier associated with the lead and the set of one or more affiliate identifiers assigned to the car dealership. 12. A system for processing leads electronically, comprising:
a routing engine configured to:
receive a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile;
submit a request for demographics information relating to the party;
receive the demographics information in response to the submitted request;
augment the lead with at least a portion of the received demographics information; and
route the augmented lead to a relevant destination. 13. The system of claim 12, further comprising a database comprising associations between multiple car dealerships and zip codes, wherein:
the lead comprises a zip code; and the routing engine is configured to select the car dealership from the database based at least in part on a comparison between the zip code of the lead and the zip codes stored in the database. 14. The system of claim 12, wherein the demographics information is selected from the group consisting of title, surname, gender, age, birth date, marital status, education level, occupation code, number of children, dwelling type, household income, length of residence, renter status, homeowner status, home value, and a combination thereof. 15. A system for managing follow-up contacts with customers, comprising:
a database comprising associations between events within a sales cycle and follow-up contacts; and a customer relationship management tool configured to:
receive information identifying a customer of a car dealership and a status of that customer; and
when the customer's status matches an event within the sales cycle, trigger a follow-up contact to the customer on behalf of the car dealership. 16. The system of claim 15, wherein the customer relationship management tool is implemented remotely from the car dealership. 17. The system of claim 15, wherein the customer relationship management tool is configured to trigger multiple follow-up contacts automatically according to a predetermined methodology. 18. The system of claim 15, wherein the customer relationship management tool is configured to:
receive an update with respect to the status of the customer; change the customer's status from a first status to a second status, wherein the second status is associated with an event in the sales cycle; and trigger a follow-up contact associated with the second status to the party. 19. The system of claim 15, wherein the customer relationship management tool is configured to trigger the sending of an e-mail to the party. 20. The system of claim 15, wherein the customer relationship management tool is configured to trigger the mailing of physical mail to the party. 21. The system of claim 15, wherein the customer relationship management tool is configured to trigger the placement of a telephone call to the party. 22. A method for processing loan application information electronically, comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan; submitting at least a portion of said information from the lead for a credit check; receiving credit information regarding the party in response to the submitting; and based at least in part on the credit information, routing the lead to a selected destination. 23. The method of claim 22, wherein submitting at least a portion of the information from the lead for a credit check comprises submitting at least a portion of the information from the lead for a soft credit check. 24. The method of claim 22, wherein submitting at least a portion of the information from the lead for a credit check comprises submitting at least a portion of the information from the lead for a credit check in substantially real time. 25. The method of claim 22, wherein receiving a lead electronically comprises receiving the lead via a HyperText Transfer Protocol (“HTTP”) connection with an affiliate. 26. The method of claim 25, further comprising:
determining whether to accept or reject the lead based at least in part on the credit information; and submitting a response to the affiliate regarding the determination. 27. The method of claim 26, wherein submitting a response to the affiliate comprises submitting the response via the same HTTP connection with the affiliate. 28. The method of claim 22, further comprising:
providing a Secure Socket Layer (“SSL”) post page; and receiving the lead via posting of an extensible markup language (“XML”) document to the post page. 29. The method of claim 22, further comprising:
storing information regarding multiple car dealerships; selecting a car dealership from the multiple car dealerships; and based at least in part on the credit information, determining whether to submit the lead to the selected car dealership. 30. The method of claim 29, wherein:
storing information regarding multiple car dealerships comprises storing associations between the multiple car dealerships and zip codes; and selecting a car dealership comprises selecting the car dealership based at least in part on a comparison between a zip code of the lead and the stored zip codes. 31. The method of claim 29, further comprising:
assigning a set of one or more affiliate identifiers to each of the car dealerships, where each affiliate identifier is associated with an affiliate from which leads can be received; determining whether each dealership is on track to meet a lead cap or target; depending on the outcome of the determination, automatically adjusting the sets of affiliate identifiers for the car dealerships; receiving an affiliate identifier associated with the lead; and selecting the car dealership from the database based at least in part on a match between the affiliate identifier associated with the lead and the set of one or more affiliate identifiers assigned to the car dealership. 32. A method for processing leads electronically, comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile; submitting a request for demographics information relating to the party; receiving the demographics information in response to the submitted request; augmenting the lead with at least a portion of the received demographics information; and routing the augmented lead to a relevant destination. 33. A method for managing follow-up contacts with customers, comprising:
storing associations between events within a sales cycle and follow-up contacts; receiving information identifying a customer of a car dealership and a status of that customer; and when the customer's status matches an event within the sales cycle, triggering a follow-up contact to the customer on behalf of the car dealership. 34. The method of claim 33, further comprising triggering multiple follow-up contacts to the party automatically according to a predetermined methodology. 35. The method of claim 33, further comprising:
receiving an update with respect to the status of the customer; changing the customer's status from a first status to a second status, wherein the second status is associated with an event in the sales cycle; and triggering a follow-up contact associated with the second status to the party. 36. A computer-readable medium comprising computer program logic encoded thereon for performing the method comprising:
receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile with a loan; submitting at least a portion of said information from the lead for a credit check; receiving credit information regarding the party in response to the submitting; and based at least in part on the credit information, routing the lead to a selected destination. 37. A system for processing leads electronically, comprising:
at least one database comprising information regarding multiple car dealerships; a server for receiving a extensible markup language (“XML”) document electronically via a Secure Socket Layer (“SSL”) post page, wherein the XML document comprises information relating to a party seeking to purchase an automobile; and a processor in communication with the server and the at least one database for submitting, over a network, at least a portion of the information from the XML document to a system for at least one of a credit check and a demographics check, for augmenting at least a portion of the information from the XML document with information received in response to the submission, and for routing the augmented information to a car dealership selected based at least in part on a comparison between the information stored in the at least one database and the information from the XML document. 38. The system of claim 37, further comprising a customer relationship management tool in communication with the processor for receiving information from the processor regarding the party and the selected car dealership, and for triggering follow-up contacts to the party on behalf of the car dealership according to a predetermined, event-driven methodology. 39. The system of claim 37, wherein:
the at least one database further comprises lead tracking data for the car dealerships, information regarding multiple affiliates capable of posting XML documents to the SSL post page, and assignments of sets of affiliates to car dealerships, wherein an assignment of an affiliate to a car dealership renders that car dealership eligible to receive leads from that affiliate; and the processor adjusts automatically for each car dealership the set of affiliates from which the car dealership is eligible to receive leads based at least in part on the lead tracking data for the car dealership. 40. A system for processing leads electronically, comprising:
means for receiving a lead electronically, wherein the lead comprises information relating to a party seeking to purchase an automobile; means for submitting at least a portion of said information from the lead for at least one of a credit check and a demographics check; means for receiving at least one of credit information and demographics information regarding the party in response to the submitting; means for augmenting the lead with the at least one of credit information and demographics information; and means for routing the augmented lead to a relevant destination. | 3,600 |
13,524 | 13,524 | 14,719,014 | 3,685 | Techniques for enhancing the security of a communication device when conducting a transaction using the communication device may include using a limited-use key (LUK) to generate a transaction cryptogram, and using a signature key to generate a signature. The transaction can be an offline data authentication transaction, and access can be granted based on authentication of the signature prior to verifying the transaction cryptogram. | 1. A method for enhancing security of a communication device when conducting a transaction using the communication device, the method comprising:
receiving, from a remote computer, a signature key, and a limited-use key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK; generating, by the communication device, a transaction cryptogram using the LUK, and a signature using the signature key; sending, to an access device, the transaction cryptogram and the signature to request access to a good or a service associated with the transaction, wherein access to the good or the service associated with the transaction is granted based on authentication of the signature prior to verifying the transaction cryptogram. 2. The method of claim 1, wherein the signature key is associated with a second set of one or more limited-use thresholds that limits usage of the signature key. 3. The method of claim 2, further comprising:
receiving, from the access device, terminal transaction data, and wherein generating the signature includes generating a hash value over at least a portion of the terminal transaction data, and applying a signing function with the signature key to at least the hash value. 4. The method of claim 2, wherein the transaction cryptogram and the signature are sent to the access device in separate communications, and wherein the signature is sent to the access device after the transaction cryptogram. 5. The method of claim 2, further comprising:
sending, to the access device, a communication device public key certificate including a communication device public key that is used to authenticate the signature. 6. The method of claim 5, further comprising:
sending, to the access device, a certificate authority public key index and an issuer public key certificate, wherein the certificate authority public key index identifies a certificate authority public key that is used to authenticate the issuer public key certificate. 7. The method of claim 6, wherein the issuer public key certificate includes an issuer public key that is used to authenticate the communication device public key certificate. 8. A communication device comprising:
a processor; a contactless interface transceiver to interact with an access device; and a memory coupled to the processor and storing a mobile application that performs operations for enhancing security of the communication device when conducting a transaction using the communication device, the operations including:
receiving, from a remote computer, a signature key, and a limited-use key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK;
generating a transaction cryptogram using the LUK, and a signature using the signature key; and
sending, to the access device, the transaction cryptogram and the signature to request access to a good or a service associated with the transaction, wherein access to the good or the service associated with the transaction is granted based on authentication of the signature prior to verifying the transaction cryptogram. 9. The communication device of claim 8, wherein the signature key is associated with a second set of one or more limited-use thresholds that limits usage of the signature key. 10. The communication device of claim 9, wherein the operations further include:
receiving, from the access device, terminal transaction data, and wherein generating the signature includes generating a hash value over at least a portion of the terminal transaction data, and applying a signature function with the signature key to at least the hash value. 11. The communication device of claim 9, wherein the transaction cryptogram and the signature are sent to the access device in separate communications, and wherein the signature is sent to the access device after the transaction cryptogram. 12. The communication device of claim 9, wherein the operations further include:
sending, to the access device, a communication device public key certificate including a communication device public key that is used to authenticate the signature. 13. The communication device of claim 12, wherein the operations further include:
sending, to the access device, a certificate authority public key index and an issuer public key certificate, wherein the certificate authority public key index identifies a certificate authority public key that is used to authenticate the issuer public key certificate. 14. The communication device of claim 13, wherein the issuer public key certificate includes an issuer public key that is used to authenticate the communication device public key certificate. 15. An access device comprising:
a processor; a contactless interface transceiver to interact with a communication device; and a memory coupled to the processor and storing code executable by the processor to perform the operations including:
sending, to the communication device, terminal transaction data for a transaction;
receiving, from the communication device, a transaction cryptogram generated with a limited-use-key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK;
receiving, from the communication device, a signature generated with a signature key that is associated with a second set of one or more limited-use thresholds that limits usage of the signature key;
authenticating the signature base on a communication device public key associated with the communication device; and
in response to authenticating the signature, granting access to a good or a service associate with the transaction prior to verifying the transaction cryptogram. 16. The access device of claim 15, wherein the operations further include:
receiving, from the communication device, a certificate authority public key index and an issuer public key certificate; retrieving a certificate authority public key based on the certificate authority public key index; and authenticating the issuer public key certificate using the certificate authority public key. 17. The access device of claim 16, wherein the operations further include:
receiving, from the communication device, a communication device public key certificate that includes the communication device public key; and authenticating the communication device public key certificate using an issuer public key included in the issuer public key certificate. 18. The access device of claim 15, wherein the certificate authority public key is a first certificate authority public key, and wherein the operations further include:
receiving, from a remote computer, a second certificate authority public key after the signature key has exceeded the second set of one or more limited-use thresholds. 19. The access device of claim 15, wherein the second set of one or more limited-use thresholds includes a time-to-live that indicates an amount of time for which the signature key is valid. 20. The access device of claim 15, wherein authenticating the signature includes deciphering the signature using the communication device public key to obtain a hash value, and comparing the hash value against an access device hash value computed by the access device. | Techniques for enhancing the security of a communication device when conducting a transaction using the communication device may include using a limited-use key (LUK) to generate a transaction cryptogram, and using a signature key to generate a signature. The transaction can be an offline data authentication transaction, and access can be granted based on authentication of the signature prior to verifying the transaction cryptogram.1. A method for enhancing security of a communication device when conducting a transaction using the communication device, the method comprising:
receiving, from a remote computer, a signature key, and a limited-use key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK; generating, by the communication device, a transaction cryptogram using the LUK, and a signature using the signature key; sending, to an access device, the transaction cryptogram and the signature to request access to a good or a service associated with the transaction, wherein access to the good or the service associated with the transaction is granted based on authentication of the signature prior to verifying the transaction cryptogram. 2. The method of claim 1, wherein the signature key is associated with a second set of one or more limited-use thresholds that limits usage of the signature key. 3. The method of claim 2, further comprising:
receiving, from the access device, terminal transaction data, and wherein generating the signature includes generating a hash value over at least a portion of the terminal transaction data, and applying a signing function with the signature key to at least the hash value. 4. The method of claim 2, wherein the transaction cryptogram and the signature are sent to the access device in separate communications, and wherein the signature is sent to the access device after the transaction cryptogram. 5. The method of claim 2, further comprising:
sending, to the access device, a communication device public key certificate including a communication device public key that is used to authenticate the signature. 6. The method of claim 5, further comprising:
sending, to the access device, a certificate authority public key index and an issuer public key certificate, wherein the certificate authority public key index identifies a certificate authority public key that is used to authenticate the issuer public key certificate. 7. The method of claim 6, wherein the issuer public key certificate includes an issuer public key that is used to authenticate the communication device public key certificate. 8. A communication device comprising:
a processor; a contactless interface transceiver to interact with an access device; and a memory coupled to the processor and storing a mobile application that performs operations for enhancing security of the communication device when conducting a transaction using the communication device, the operations including:
receiving, from a remote computer, a signature key, and a limited-use key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK;
generating a transaction cryptogram using the LUK, and a signature using the signature key; and
sending, to the access device, the transaction cryptogram and the signature to request access to a good or a service associated with the transaction, wherein access to the good or the service associated with the transaction is granted based on authentication of the signature prior to verifying the transaction cryptogram. 9. The communication device of claim 8, wherein the signature key is associated with a second set of one or more limited-use thresholds that limits usage of the signature key. 10. The communication device of claim 9, wherein the operations further include:
receiving, from the access device, terminal transaction data, and wherein generating the signature includes generating a hash value over at least a portion of the terminal transaction data, and applying a signature function with the signature key to at least the hash value. 11. The communication device of claim 9, wherein the transaction cryptogram and the signature are sent to the access device in separate communications, and wherein the signature is sent to the access device after the transaction cryptogram. 12. The communication device of claim 9, wherein the operations further include:
sending, to the access device, a communication device public key certificate including a communication device public key that is used to authenticate the signature. 13. The communication device of claim 12, wherein the operations further include:
sending, to the access device, a certificate authority public key index and an issuer public key certificate, wherein the certificate authority public key index identifies a certificate authority public key that is used to authenticate the issuer public key certificate. 14. The communication device of claim 13, wherein the issuer public key certificate includes an issuer public key that is used to authenticate the communication device public key certificate. 15. An access device comprising:
a processor; a contactless interface transceiver to interact with a communication device; and a memory coupled to the processor and storing code executable by the processor to perform the operations including:
sending, to the communication device, terminal transaction data for a transaction;
receiving, from the communication device, a transaction cryptogram generated with a limited-use-key (LUK) that is associated with a first set of one or more limited-use thresholds that limits usage of the LUK;
receiving, from the communication device, a signature generated with a signature key that is associated with a second set of one or more limited-use thresholds that limits usage of the signature key;
authenticating the signature base on a communication device public key associated with the communication device; and
in response to authenticating the signature, granting access to a good or a service associate with the transaction prior to verifying the transaction cryptogram. 16. The access device of claim 15, wherein the operations further include:
receiving, from the communication device, a certificate authority public key index and an issuer public key certificate; retrieving a certificate authority public key based on the certificate authority public key index; and authenticating the issuer public key certificate using the certificate authority public key. 17. The access device of claim 16, wherein the operations further include:
receiving, from the communication device, a communication device public key certificate that includes the communication device public key; and authenticating the communication device public key certificate using an issuer public key included in the issuer public key certificate. 18. The access device of claim 15, wherein the certificate authority public key is a first certificate authority public key, and wherein the operations further include:
receiving, from a remote computer, a second certificate authority public key after the signature key has exceeded the second set of one or more limited-use thresholds. 19. The access device of claim 15, wherein the second set of one or more limited-use thresholds includes a time-to-live that indicates an amount of time for which the signature key is valid. 20. The access device of claim 15, wherein authenticating the signature includes deciphering the signature using the communication device public key to obtain a hash value, and comparing the hash value against an access device hash value computed by the access device. | 3,600 |
13,525 | 13,525 | 14,273,646 | 3,683 | A system is provided that that dynamically distributes tasks. The system calculates scores for tasks, where each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task. The system further determines an order that the tasks are executed based on the scores. The system further displays the tasks and a project plan timeline within a user interface, where the tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. The system further determines a buffer time distribution for the tasks based on the scores. The system further displays the tasks within the project plan timeline based on the buffer time distribution for the tasks. | 1. A computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to dynamically distribute tasks, the dynamic distributing comprising:
calculating a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; determining an order that the plurality of tasks are executed based on the plurality of scores; and displaying the plurality of tasks and a project plan timeline within a user interface; wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 2. The computer-readable medium of claim 1, the dynamic distributing further comprising determining whether a task violates its finish-by date-time. 3. The computer-readable medium of claim 2, the dynamic distributing further comprising identifying an eligible task for swapping when it is determined that a task violates its finish-by date-time. 4. The computer-readable medium of claim 3, wherein: (a) by swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed, the task does not violate its finish-by date-time; and (b) the eligible task has the lowest score of one or more tasks that satisfy (a). 5. The computer-readable medium of claim 3, the dynamic distributing further comprising swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 6. The computer-readable medium of claim 1, the dynamic distributing further comprising:
determining a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the plurality of tasks are displayed within the project plan timeline based on the buffer time distribution for the plurality of tasks. 7. The computer-readable medium of claim 6, the dynamic distributing further comprising calculating a plurality of self forward total scores for the tasks. 8. The computer-readable medium of claim 7, the dynamic distributing further comprising calculating a plurality of buffer values for the tasks. 9. The computer-readable medium of claim 8, wherein the plurality of buffer values comprises: a buffer self available initial value; a buffer forward minimum value, a buffer apportioned forward minimum value, and a buffer self available running value. 10. The computer-readable medium of claim 8, wherein the determining the buffer time distribution for the plurality of tasks is further based on the plurality of self forward total scores and the plurality of buffer values. 11. A computer-implemented method for dynamically distributing tasks, the computer-implemented method comprising:
calculating a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; determining an order that the plurality of tasks are executed based on the plurality of scores; and displaying the plurality of tasks and a project plan timeline within a user interface;
wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 12. The computer-implemented method of claim 11, further comprising:
determining whether a task violates its finish-by date-time; and identifying an eligible task for swapping when it is determined that a task violates its finish-by date-time. 13. The computer-implemented method of claim 12, further comprising swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 14. The computer-implemented method of claim 11, further comprising:
determining a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the plurality of tasks are displayed within the project plan timeline based on the buffer time distribution for the plurality of tasks. 15. The computer-implemented method of claim 14, further comprising:
calculating a plurality of self forward total scores for the tasks; and calculating a plurality of buffer values for the tasks; wherein the determining the buffer time distribution for the plurality of tasks is further based on the plurality of self forward total scores and the plurality of buffer values. 16. A system for dynamically distributing tasks, the system comprising:
a score calculation module configured to calculate a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; an order determination module configured to determine an order that the plurality of tasks are executed based on the plurality of scores; and a task display module configured to display the plurality of tasks and a project plan timeline within a user interface; wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 17. The system of claim 16, further comprising:
a task violation determination module configured to determine whether a task violates its finish-by date-time; and an eligible task identification module configured to identify an eligible task for swapping when it is determined that a task violates its finish-by date-time. 18. The system of claim 16, further comprising a task position module configured to swap a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 19. The system of claim 16, further comprising:
a buffer time distribution module configured to determine a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the task display module is further configured to display the plurality of tasks within the project plan timeline based on the buffer time distribution for the plurality of tasks. 20. The system of claim 19, further comprising:
a self forward total score module configured to calculate a plurality of self forward total scores for the tasks; and a buffer value module configured to calculate a plurality of buffer values for the tasks; wherein the buffer time distribution module is further configured to determine the buffer time distribution for the plurality of tasks based on the plurality of self forward total scores and the plurality of buffer values. | A system is provided that that dynamically distributes tasks. The system calculates scores for tasks, where each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task. The system further determines an order that the tasks are executed based on the scores. The system further displays the tasks and a project plan timeline within a user interface, where the tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. The system further determines a buffer time distribution for the tasks based on the scores. The system further displays the tasks within the project plan timeline based on the buffer time distribution for the tasks.1. A computer-readable medium having instructions stored thereon that, when executed by a processor, cause the processor to dynamically distribute tasks, the dynamic distributing comprising:
calculating a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; determining an order that the plurality of tasks are executed based on the plurality of scores; and displaying the plurality of tasks and a project plan timeline within a user interface; wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 2. The computer-readable medium of claim 1, the dynamic distributing further comprising determining whether a task violates its finish-by date-time. 3. The computer-readable medium of claim 2, the dynamic distributing further comprising identifying an eligible task for swapping when it is determined that a task violates its finish-by date-time. 4. The computer-readable medium of claim 3, wherein: (a) by swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed, the task does not violate its finish-by date-time; and (b) the eligible task has the lowest score of one or more tasks that satisfy (a). 5. The computer-readable medium of claim 3, the dynamic distributing further comprising swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 6. The computer-readable medium of claim 1, the dynamic distributing further comprising:
determining a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the plurality of tasks are displayed within the project plan timeline based on the buffer time distribution for the plurality of tasks. 7. The computer-readable medium of claim 6, the dynamic distributing further comprising calculating a plurality of self forward total scores for the tasks. 8. The computer-readable medium of claim 7, the dynamic distributing further comprising calculating a plurality of buffer values for the tasks. 9. The computer-readable medium of claim 8, wherein the plurality of buffer values comprises: a buffer self available initial value; a buffer forward minimum value, a buffer apportioned forward minimum value, and a buffer self available running value. 10. The computer-readable medium of claim 8, wherein the determining the buffer time distribution for the plurality of tasks is further based on the plurality of self forward total scores and the plurality of buffer values. 11. A computer-implemented method for dynamically distributing tasks, the computer-implemented method comprising:
calculating a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; determining an order that the plurality of tasks are executed based on the plurality of scores; and displaying the plurality of tasks and a project plan timeline within a user interface;
wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 12. The computer-implemented method of claim 11, further comprising:
determining whether a task violates its finish-by date-time; and identifying an eligible task for swapping when it is determined that a task violates its finish-by date-time. 13. The computer-implemented method of claim 12, further comprising swapping a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 14. The computer-implemented method of claim 11, further comprising:
determining a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the plurality of tasks are displayed within the project plan timeline based on the buffer time distribution for the plurality of tasks. 15. The computer-implemented method of claim 14, further comprising:
calculating a plurality of self forward total scores for the tasks; and calculating a plurality of buffer values for the tasks; wherein the determining the buffer time distribution for the plurality of tasks is further based on the plurality of self forward total scores and the plurality of buffer values. 16. A system for dynamically distributing tasks, the system comprising:
a score calculation module configured to calculate a plurality of scores for a plurality of tasks, wherein each score is calculated based on a finish-by date-time for each task, a planned finish date-time for each task, a planned effort for each task, and a base priority for each task; an order determination module configured to determine an order that the plurality of tasks are executed based on the plurality of scores; and a task display module configured to display the plurality of tasks and a project plan timeline within a user interface; wherein the plurality of tasks are displayed within the project plan timeline based on the order that the plurality of tasks are executed. 17. The system of claim 16, further comprising:
a task violation determination module configured to determine whether a task violates its finish-by date-time; and an eligible task identification module configured to identify an eligible task for swapping when it is determined that a task violates its finish-by date-time. 18. The system of claim 16, further comprising a task position module configured to swap a position of the task that violates its finish-by date-time with a position of the eligible task within the order that the plurality of tasks are executed. 19. The system of claim 16, further comprising:
a buffer time distribution module configured to determine a buffer time distribution for the plurality of tasks based on the plurality of scores; wherein the task display module is further configured to display the plurality of tasks within the project plan timeline based on the buffer time distribution for the plurality of tasks. 20. The system of claim 19, further comprising:
a self forward total score module configured to calculate a plurality of self forward total scores for the tasks; and a buffer value module configured to calculate a plurality of buffer values for the tasks; wherein the buffer time distribution module is further configured to determine the buffer time distribution for the plurality of tasks based on the plurality of self forward total scores and the plurality of buffer values. | 3,600 |
13,526 | 13,526 | 13,714,185 | 3,688 | Systems and methods are provided for location-based advertisements. In accordance with one exemplary implementation, a method is provided for providing advertisements to a user of a navigation system. The method may include identifying high-value intersections in a map. The method may also include identifying, based on the high-value intersections, a set of landmark locations and associating the landmark locations with the high-value intersections in a database. The method may also include detecting at least one of the high-value intersections in a route requested by the user. The method may also include presenting, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection. | 1. A method for providing location-based advertisements to a user of a navigation system, the method comprising:
identifying high-value intersections in a map; identifying, based on the high-value intersections, a set of landmark locations; associating the landmark locations with the high-value intersections in a database; detecting, by at least one processor, at least one of the high-value intersections in a route requested by the user; and presenting, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection. 2. The method of claim 1, wherein presenting the advertisement comprises presenting a textual representation. 3. The method of claim 1, wherein presenting the advertisement comprises presenting a logo. 4. The method of claim 1, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at the landmark location associated with the detected high-value intersection. 5. The method of claim 1, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 6. The method of claim 1, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a predetermined distance around at least one of the high-value intersections. 7. The method of claim 1, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a radius of time around at least one of the high-value intersections. 8. The method of claim 1, further comprising
receiving payment for the advertisement from at least one supplier or retailer associated with the landmark location, which is associated with the detected high-value intersection. 9. The method of claim 1, wherein the map is a digital map database. 10. A method for providing location-based advertisements to a user of navigation system, the method comprising:
detecting, by at least one processor, the presence of a user near a high-value location; offering an advertisement space for the high-value location, the advertisement space being associated with navigation information presented to the user; receiving payment for the advertisement space; and presenting, in connection with the paid advertisement space, an advertisement for display with the navigation information presented to the user. 11. The method of claim 10, wherein offering the advertisement space comprises offering, in an auction, the advertisement space to a highest bidder. 12. The method of claim 10, wherein the receiving payment comprises receiving payment from at least one supplier or retailer associated with the high-value location. 13. The method of claim 10, wherein presenting the advertisement comprises presenting a textual representation. 14. The method of claim 10, wherein presenting the advertisement comprises presenting a logo. 15. The method of claim 10, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at a business associated with the detected high-value location. 16. The method of claim 10, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 17. A system for providing location-based advertisements to a user of a navigation system, comprising:
a processor; a memory storing instructions which, when executed by the processor, cause the processor to:
identify high-value intersections in a map;
identify, based on the high-value intersections, a set of landmark locations;
associate the landmark locations with the high-value intersections in a database;
detect at least one of the high-value intersections in a route requested by the user; and
present, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection. 18. The system of claim 17, wherein presenting the advertisement comprises presenting a textual representation. 19. The system of claim 17, wherein presenting the advertisement comprises presenting a logo. 20. The system of claim 17, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at the landmark location associated with the detected high-value intersection. 21. The system of claim 17, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 22. The system of claim 17, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a predetermined distance around at least one of the high-value intersections. 23. The system of claim 17, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a radius of time around at least one of the high-value intersections. 24. The system of claim 17, the memory further containing instructions which, when executed by the processor, cause the processor to:
receive payment for the advertisement from at least one supplier or retailer associated with the landmark location that is associated with the detected high-value intersection. 25. The system of claim 17, wherein the map is a digital map database. 26. A system for providing location-based advertisements to a user of navigation system, comprising:
a processor; a memory storing instructions which, when executed by the processor, cause the processor to:
detect the presence of a user near a high-value location;
offer an advertisement space for the high-value location, the advertisement space being associated with navigation information presented to the user;
receive payment for the advertisement space; and
present, in connection with the paid advertisement space, an advertisement for display with the navigation information presented to the user. 27. The system of claim 26, wherein offering the advertisement space comprises offering, in an auction, the advertisement space to a highest bidder. 28. The system of claim 26, wherein the receiving payment comprises receiving payment from at least one supplier or retailer associated with the high-value location. 29. The system of claim 26, wherein presenting the advertisement comprises presenting a textual representation. 30. The system of claim 26, wherein presenting the advertisement comprises presenting a logo. 31. The system of claim 26, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at a business associated with the detected high-value location. 32. The system of claim 26, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. | Systems and methods are provided for location-based advertisements. In accordance with one exemplary implementation, a method is provided for providing advertisements to a user of a navigation system. The method may include identifying high-value intersections in a map. The method may also include identifying, based on the high-value intersections, a set of landmark locations and associating the landmark locations with the high-value intersections in a database. The method may also include detecting at least one of the high-value intersections in a route requested by the user. The method may also include presenting, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection.1. A method for providing location-based advertisements to a user of a navigation system, the method comprising:
identifying high-value intersections in a map; identifying, based on the high-value intersections, a set of landmark locations; associating the landmark locations with the high-value intersections in a database; detecting, by at least one processor, at least one of the high-value intersections in a route requested by the user; and presenting, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection. 2. The method of claim 1, wherein presenting the advertisement comprises presenting a textual representation. 3. The method of claim 1, wherein presenting the advertisement comprises presenting a logo. 4. The method of claim 1, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at the landmark location associated with the detected high-value intersection. 5. The method of claim 1, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 6. The method of claim 1, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a predetermined distance around at least one of the high-value intersections. 7. The method of claim 1, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a radius of time around at least one of the high-value intersections. 8. The method of claim 1, further comprising
receiving payment for the advertisement from at least one supplier or retailer associated with the landmark location, which is associated with the detected high-value intersection. 9. The method of claim 1, wherein the map is a digital map database. 10. A method for providing location-based advertisements to a user of navigation system, the method comprising:
detecting, by at least one processor, the presence of a user near a high-value location; offering an advertisement space for the high-value location, the advertisement space being associated with navigation information presented to the user; receiving payment for the advertisement space; and presenting, in connection with the paid advertisement space, an advertisement for display with the navigation information presented to the user. 11. The method of claim 10, wherein offering the advertisement space comprises offering, in an auction, the advertisement space to a highest bidder. 12. The method of claim 10, wherein the receiving payment comprises receiving payment from at least one supplier or retailer associated with the high-value location. 13. The method of claim 10, wherein presenting the advertisement comprises presenting a textual representation. 14. The method of claim 10, wherein presenting the advertisement comprises presenting a logo. 15. The method of claim 10, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at a business associated with the detected high-value location. 16. The method of claim 10, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 17. A system for providing location-based advertisements to a user of a navigation system, comprising:
a processor; a memory storing instructions which, when executed by the processor, cause the processor to:
identify high-value intersections in a map;
identify, based on the high-value intersections, a set of landmark locations;
associate the landmark locations with the high-value intersections in a database;
detect at least one of the high-value intersections in a route requested by the user; and
present, on a device of the user, an advertisement associated with at least one landmark location while presenting maneuver information for the at least one high-value intersection. 18. The system of claim 17, wherein presenting the advertisement comprises presenting a textual representation. 19. The system of claim 17, wherein presenting the advertisement comprises presenting a logo. 20. The system of claim 17, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at the landmark location associated with the detected high-value intersection. 21. The system of claim 17, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. 22. The system of claim 17, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a predetermined distance around at least one of the high-value intersections. 23. The system of claim 17, wherein identifying the set of landmark locations comprising querying a road database to identify landmark locations within a radius of time around at least one of the high-value intersections. 24. The system of claim 17, the memory further containing instructions which, when executed by the processor, cause the processor to:
receive payment for the advertisement from at least one supplier or retailer associated with the landmark location that is associated with the detected high-value intersection. 25. The system of claim 17, wherein the map is a digital map database. 26. A system for providing location-based advertisements to a user of navigation system, comprising:
a processor; a memory storing instructions which, when executed by the processor, cause the processor to:
detect the presence of a user near a high-value location;
offer an advertisement space for the high-value location, the advertisement space being associated with navigation information presented to the user;
receive payment for the advertisement space; and
present, in connection with the paid advertisement space, an advertisement for display with the navigation information presented to the user. 27. The system of claim 26, wherein offering the advertisement space comprises offering, in an auction, the advertisement space to a highest bidder. 28. The system of claim 26, wherein the receiving payment comprises receiving payment from at least one supplier or retailer associated with the high-value location. 29. The system of claim 26, wherein presenting the advertisement comprises presenting a textual representation. 30. The system of claim 26, wherein presenting the advertisement comprises presenting a logo. 31. The system of claim 26, wherein presenting the advertisement comprises presenting a coupon for a product or service sold at a business associated with the detected high-value location. 32. The system of claim 26, wherein presenting the advertisement comprises presenting a digital representation of the advertisement. | 3,600 |
13,527 | 13,527 | 14,503,113 | 3,683 | Techniques for enriching venue data are described. The venue data can include records describing physical features of a venue and records describing conceptual features of the venue. A data enrichment engine can enrich the venue data using probe data by automatically correcting inconsistencies in the venue data or adding additional information to the venue data. The probe data can include crowd-sourced data from multiple mobile devices. The probe data can include motion sensor data, application launch data, and site survey data. | 1. A method comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue; receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue; enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 2. The method of claim 1, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 3. The method of claim 1, wherein:
the probe data is crowd-sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 4. The method of claim 1, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 5. The method of claim 1, comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 6. The method of claim 1, comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 7. The method of claim 1, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 8. The method of claim 1, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 9. The method of claim 1, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 10. The method of claim 1, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 11. The method of claim 1, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 12. The method of claim 1, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 13. The method of claim 1, comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 14. The method of claim 1, comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. 15. A system, comprising:
one or more processors; and a non-transitory computer-readable medium storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue;
receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue;
enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and
storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 16. The system of claim 15, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 17. The system of claim 15, wherein:
the probe data is crowd-sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 18. The system of claim 15, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 19. The system of claim 15, the operations comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 20. The system of claim 15, comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 21. The system of claim 15, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 22. The system of claim 15, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 23. The system of claim 15, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 24. The system of claim 15, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 25. The system of claim 15, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 26. The system of claim 15, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 27. The system of claim 15, the operations comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 28. The system of claim 15, the operations comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. 29. A non-transitory computer-readable medium storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue; receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue; enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 30. The non-transitory computer-readable medium of claim 29, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 31. The non-transitory computer-readable medium of claim 29, wherein:
the probe data is crowd sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 32. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 33. The non-transitory computer-readable medium of claim 29, the operations comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 34. The non-transitory computer-readable medium of claim 29, the operations comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 35. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 36. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 37. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 38. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 39. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 40. The non-transitory computer-readable medium of claim 29, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 41. The non-transitory computer-readable medium of claim 29, the operations comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 42. The non-transitory computer-readable medium of claim 29, the operations comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. | Techniques for enriching venue data are described. The venue data can include records describing physical features of a venue and records describing conceptual features of the venue. A data enrichment engine can enrich the venue data using probe data by automatically correcting inconsistencies in the venue data or adding additional information to the venue data. The probe data can include crowd-sourced data from multiple mobile devices. The probe data can include motion sensor data, application launch data, and site survey data.1. A method comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue; receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue; enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 2. The method of claim 1, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 3. The method of claim 1, wherein:
the probe data is crowd-sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 4. The method of claim 1, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 5. The method of claim 1, comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 6. The method of claim 1, comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 7. The method of claim 1, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 8. The method of claim 1, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 9. The method of claim 1, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 10. The method of claim 1, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 11. The method of claim 1, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 12. The method of claim 1, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 13. The method of claim 1, comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 14. The method of claim 1, comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. 15. A system, comprising:
one or more processors; and a non-transitory computer-readable medium storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue;
receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue;
enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and
storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 16. The system of claim 15, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 17. The system of claim 15, wherein:
the probe data is crowd-sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 18. The system of claim 15, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 19. The system of claim 15, the operations comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 20. The system of claim 15, comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 21. The system of claim 15, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 22. The system of claim 15, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 23. The system of claim 15, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 24. The system of claim 15, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 25. The system of claim 15, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 26. The system of claim 15, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 27. The system of claim 15, the operations comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 28. The system of claim 15, the operations comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. 29. A non-transitory computer-readable medium storing instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
receiving venue data by a venue data server from a venue data provider computer, the venue data including a physical feature and a conceptual feature, the physical feature including a first data object describing a physical structure at a venue, the conceptual feature including a second data object describing an entity that occupies or is associated with a portion of the venue; receiving probe data, the probe data including at least one of survey data or application launch data, the probe data indicating user activities in the venue and user movements in the venue; enriching the venue data using the probe data, including revising inconsistencies in the venue data and adding information to the venue data by matching the user activities with an attribute of the entity and matching the user movements with the physical structure; and storing the enriched venue data on a storage device for providing an indoor location service of the venue to a user device. 30. The non-transitory computer-readable medium of claim 29, wherein the second data object of the conceptual feature is nested in the first data object of the physical feature by storing a reference to the first data object in a data field of the second data object. 31. The non-transitory computer-readable medium of claim 29, wherein:
the probe data is crowd sourced data received from a plurality of user devices; the application launch data includes records of launches of application programs on the user devices, the application programs being associated with a name, description, or product name of the entity. 32. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises determining a feature categorization based on the application launch data, the application launch data indicating that users launch application programs related to the entity in the physical structure, the application programs being associated with the feature categorization in a data store. 33. The non-transitory computer-readable medium of claim 29, the operations comprising:
obtaining a size of the physical feature; validating one or more attributes of the physical feature as stored in the venue data based on the size, including determining whether the one or more attributes and a state of the one or more attributes are permissible for the size according to a feature validation rule. 34. The non-transitory computer-readable medium of claim 29, the operations comprising:
validating an associated feature of the venue or detecting a missing or anomalous feature of the venue as stored in the venue data using a size of the physical structure, wherein the validating and detecting are based on indications of an expected quantity or an expected attribute. 35. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining, from the probe data, that pedestrian traffic or site survey is detected for a section of the physical structure that is not represented in the venue data; and at least one of identifying an inconsistency for investigation or adding a record of the section of the physical structure to the venue data in response to the determining. 36. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining one or more transition points using the probe data upon determining that mobile devices moved into or out of the venue at the transition points, the transition points including venue entry points or venue exit points; adding a record of each transition point to the venue data; and providing the added record to an upstream base map data service. 37. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining a connection point between an indoor space of the venue and a road network as recorded in base map data; and adding a record of the connection point to the venue data. 38. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining, from the probe data, that mobile devices switch on satellite navigation subsystems of the mobile devices at a portion of the physical structure; in response, determining that the portion of the physical structure is exposed space; and adding a record of the exposed space to the venue data. 39. The non-transitory computer-readable medium of claim 29, wherein adding information to the venue data comprises:
determining a mode of transportation in the physical structure and a physical feature type of the physical structure using velocity and altitude information in the probe data, the physical feature type including at least one of an escalator, an elevator bank, or a stairwell; and adding a record of the physical feature type to the venue data for distinguishing from other pedestrian foot traffic areas represented in the venue data. 40. The non-transitory computer-readable medium of claim 29, wherein revising inconsistencies in the venue data comprises:
determining hours of operation of the entity using the user activities in the venue and user movements in the venue as indicated in the probe data; determining that the hours of operation are inconsistent with hours of operation as recorded in the conceptual feature; and revising the hours of operation in the conceptual feature using the determined hours of operation. 41. The non-transitory computer-readable medium of claim 29, the operations comprising:
determining, using spatial and temporal information stored in the probe data, a time and a time interval for conducting a site survey at the venue, the time being a time of off-peak traffic at the venue as determined using the probe data, the time interval being an interval between two off-peak traffic days; and providing the time and time interval to a sampling device for surveying the venue. 42. The non-transitory computer-readable medium of claim 29, the operations comprising:
detecting, from the probe data, a change in pedestrian traffic patterns or an alignment of the pedestrian traffic patterns with existing venue feature data; and providing a notification to re-survey the venue or to update a geometry of the venue in response to the detecting. | 3,600 |
13,528 | 13,528 | 12,760,763 | 3,694 | A method, apparatus, and article of manufacture for incentivizing a plurality of participants to exchange goods or services on a marketplace. In one embodiment, at least one warrant is issued a participant who trades on the marketplace. The warrant is issued in accordance to an agreement among the plurality of participants. The warrant provides the participant with a right for converting the warrant into at least one ownership share of the marketplace. The right is conditioned on the participant's performance on the marketplace. The participant's performance on the marketplace is determined by the system, and is used to determine a quantity of warrants that may be converted into the at least one ownership share of the marketplace. The quantity of warrants that may be converted is outputted and communicated to the participant. | 1. An apparatus for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
a processor; and a memory, in which the memory stores instructions which, when executed by the processor, direct the processor to perform the acts of: issuing, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining the participant's performance on the marketplace; determining based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. 2. The apparatus of claim 1, in which the agreement comprises agreeing to exchange goods or services of a vertical market. 3. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the acts of:
determining the participant's performance by determining a revenue generated by the participant's trading activity on the marketplace over a period of time, and determining that the revenue generated by the participant during the period of time meets a threshold for converting the warrant to the at least one ownership share. 4. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the acts of:
determining the participant's performance by determining a revenue generated by the participant's trading activity on the marketplace over a period of time; determining that the revenue generated by the participant during the period of time exceeds a threshold for converting the warrant to the at least one ownership share. 5. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the participant's performance by determining a growth rate of the marketplace, in which the growth rate is attributed to the participant's trading activity over a period of time. 6. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining that the participant's performance comprises a trading activity that is accomplished via a plurality of services, in which at least one of the plurality of services is provided by the participant. 7. The apparatus of claim 6, in which the memory stores instructions which, when executed by the processor, further directed the processor to perform the steps of:
determining the participant's performance by determining a level of service provided by the participant over a period of time. 8. The apparatus of claim 7, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the participant's performance by determining fees derived from the level of service provided by the participant over the period of time. 9. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the quantity of warrants that may be converted by determining a ratio of a first revenue to a second revenue, in which the first revenue is generated by the participant during a first period of time and the second revenue is a pre-determined revenue that the participant is expected to generate over a second period of time. 10. The apparatus of claim 9, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
multiplying the ratio by an amount of warrants issued in accordance to the agreement. 11. The apparatus of claim 9, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining a percentage of the goods or services that is owned by the participant. 12. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
receiving an indication to convert to the warrant into at least one ownership share or the marketplace. 13. A method for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
issuing via a processor, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining, via the processor, the participant's performance on the marketplace; determining via the processor, based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting, via the processor, the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. 14. The method of claim 13, in which the agreement comprises agreeing to exchange goods or services of a vertical market. 15. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a revenue generated by the participant's trading activity on the marketplace over a period of time; and in which the act of determining the quantity of warrants that may be converted further comprises: determining that the revenue generated by the participant during the period of time meets a threshold for converting the warrant to the at least one ownership share. 16. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a revenue generated by the participant's trading activity on the marketplace over a period of time; and in which the act of determining the quantity of warrants that may be converted further comprises: determining that the revenue generated by the participant during the period of time exceeds the threshold, in which the warrants are converted at a full conversion rate. 17. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a growth rate of the marketplace, in which the growth rate is attributed to the participant's trading activity over a period of time. 18. The method of claim 13 further comprising:
determining that the participant's performance comprises a trading activity that is accomplished via a plurality of services, in which at least one of the plurality of services is provided by the participant. 19. The method of claim 18, in which the act of determining the participant's performance further comprises:
determining a level of service provided by the participant over a period of time. 20. The method of claim 19, in which the act of determining the participant's performance further comprises:
determining fees derived from the level of service provided by the participant over the period of time. 21. The method of claim 13, in which the act of determining the quantity of warrants that may be converted further comprises:
determining a ratio of a first revenue to a second revenue, in which the first revenue is generated by the participant during a first period of time and the second revenue is a pre-determined revenue that the participant is expected to generate over a second period of time. 22. The method of claim 21 further comprising:
multiplying the ratio by an amount of warrants issued in accordance to the agreement. 23. The method of claim 21, in which the act of determining the quantity of warrants that may be converted is based on:
determining a percentage of the goods or services that is owned by the participant. 24. The method of claim 13 further comprising:
receiving an indication to convert the warrant into at least one ownership share of the marketplace. 25. An article of manufacture for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
a storage medium, in which the storage medium stores instructions which, when executed by a processor, direct the processor to perform the acts of: issuing, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining the participant's performance on the marketplace; determining, based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. | A method, apparatus, and article of manufacture for incentivizing a plurality of participants to exchange goods or services on a marketplace. In one embodiment, at least one warrant is issued a participant who trades on the marketplace. The warrant is issued in accordance to an agreement among the plurality of participants. The warrant provides the participant with a right for converting the warrant into at least one ownership share of the marketplace. The right is conditioned on the participant's performance on the marketplace. The participant's performance on the marketplace is determined by the system, and is used to determine a quantity of warrants that may be converted into the at least one ownership share of the marketplace. The quantity of warrants that may be converted is outputted and communicated to the participant.1. An apparatus for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
a processor; and a memory, in which the memory stores instructions which, when executed by the processor, direct the processor to perform the acts of: issuing, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining the participant's performance on the marketplace; determining based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. 2. The apparatus of claim 1, in which the agreement comprises agreeing to exchange goods or services of a vertical market. 3. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the acts of:
determining the participant's performance by determining a revenue generated by the participant's trading activity on the marketplace over a period of time, and determining that the revenue generated by the participant during the period of time meets a threshold for converting the warrant to the at least one ownership share. 4. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the acts of:
determining the participant's performance by determining a revenue generated by the participant's trading activity on the marketplace over a period of time; determining that the revenue generated by the participant during the period of time exceeds a threshold for converting the warrant to the at least one ownership share. 5. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the participant's performance by determining a growth rate of the marketplace, in which the growth rate is attributed to the participant's trading activity over a period of time. 6. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining that the participant's performance comprises a trading activity that is accomplished via a plurality of services, in which at least one of the plurality of services is provided by the participant. 7. The apparatus of claim 6, in which the memory stores instructions which, when executed by the processor, further directed the processor to perform the steps of:
determining the participant's performance by determining a level of service provided by the participant over a period of time. 8. The apparatus of claim 7, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the participant's performance by determining fees derived from the level of service provided by the participant over the period of time. 9. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining the quantity of warrants that may be converted by determining a ratio of a first revenue to a second revenue, in which the first revenue is generated by the participant during a first period of time and the second revenue is a pre-determined revenue that the participant is expected to generate over a second period of time. 10. The apparatus of claim 9, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
multiplying the ratio by an amount of warrants issued in accordance to the agreement. 11. The apparatus of claim 9, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
determining a percentage of the goods or services that is owned by the participant. 12. The apparatus of claim 1, in which the memory stores instructions which, when executed by the processor, further direct the processor to perform the steps of:
receiving an indication to convert to the warrant into at least one ownership share or the marketplace. 13. A method for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
issuing via a processor, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining, via the processor, the participant's performance on the marketplace; determining via the processor, based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting, via the processor, the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. 14. The method of claim 13, in which the agreement comprises agreeing to exchange goods or services of a vertical market. 15. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a revenue generated by the participant's trading activity on the marketplace over a period of time; and in which the act of determining the quantity of warrants that may be converted further comprises: determining that the revenue generated by the participant during the period of time meets a threshold for converting the warrant to the at least one ownership share. 16. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a revenue generated by the participant's trading activity on the marketplace over a period of time; and in which the act of determining the quantity of warrants that may be converted further comprises: determining that the revenue generated by the participant during the period of time exceeds the threshold, in which the warrants are converted at a full conversion rate. 17. The method of claim 13, in which the act of determining the participant's performance further comprises:
determining a growth rate of the marketplace, in which the growth rate is attributed to the participant's trading activity over a period of time. 18. The method of claim 13 further comprising:
determining that the participant's performance comprises a trading activity that is accomplished via a plurality of services, in which at least one of the plurality of services is provided by the participant. 19. The method of claim 18, in which the act of determining the participant's performance further comprises:
determining a level of service provided by the participant over a period of time. 20. The method of claim 19, in which the act of determining the participant's performance further comprises:
determining fees derived from the level of service provided by the participant over the period of time. 21. The method of claim 13, in which the act of determining the quantity of warrants that may be converted further comprises:
determining a ratio of a first revenue to a second revenue, in which the first revenue is generated by the participant during a first period of time and the second revenue is a pre-determined revenue that the participant is expected to generate over a second period of time. 22. The method of claim 21 further comprising:
multiplying the ratio by an amount of warrants issued in accordance to the agreement. 23. The method of claim 21, in which the act of determining the quantity of warrants that may be converted is based on:
determining a percentage of the goods or services that is owned by the participant. 24. The method of claim 13 further comprising:
receiving an indication to convert the warrant into at least one ownership share of the marketplace. 25. An article of manufacture for incentivizing a plurality of participants to exchange goods or services on a marketplace, comprising:
a storage medium, in which the storage medium stores instructions which, when executed by a processor, direct the processor to perform the acts of: issuing, in accordance to an agreement among the plurality of participants, at least one warrant to a participant who trades on the marketplace, in which the warrant provides a right to the participant for converting the warrant into at least one ownership share of the marketplace, and in which the right is conditioned on the participant's performance on the marketplace; determining the participant's performance on the marketplace; determining, based on the participant's performance, a quantity of warrants that may be converted into the at least one ownership share of the marketplace; and outputting the quantity of warrants that may be converted into the at least one ownership share of the marketplace, in which the quantity of warrants that may be converted is communicated to the participant. | 3,600 |
13,529 | 13,529 | 14,637,174 | 3,625 | Various embodiments include systems, methods, and software to manage offers in a network-based commerce system. One embodiment includes providing sellers an option when listing an item for sale to receive best offers for the item from buyers. This embodiment further includes receiving best offers submitted by offerees via the network-based commerce system and notifying sellers of received best offers. Some embodiments further include providing sellers an option to accept, reject, or ignore the individual best offers received. In some such embodiments, ignored best offers expire after a period, such as 48 hours. Yet further embodiments include notifying offerees of acceptance or rejection of their submitted best offers. | 1. A method to generate a computer system user interface, the method comprising:
retrieving, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; generating a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and generating the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 2. The method of claim 1, wherein the second user-selectable interface component is a hyperlink. 3. The method of claim 1, including, responsive to user-selection of the first user-selectable interface component, submitting an indication to the computer system that the user will purchase the item at the published item price. 4. The method of claim 1, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 5. The method of claim 1, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 6. The method of claim 4, including, responsive to user-selection of the second user-selectable interface component, submitting an offer for the item at a price different from the published item price to the computer system for transmission to the seller. 7. The method of claim 6, wherein the submitted offer includes an offer price entered into the offer price input field. 8. A server system comprising:
a retrieval module, executing on one or more computer processors, to retrieve, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; a first generation module to generate a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and a second generation module, executing on one or more computer processors, to generate the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 9. The system of claim 8, wherein the second user-selectable interface component is a hyperlink. 10. The system of claim 8, including, a first submission module to, responsive to user-selection of the first user-selectable interface component, submit an indication to the computer system that the user will purchase the item at the published item price. 11. The system of claim 8, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 12. The system of claim 8, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 13. The system of claim 11, including, a second submission module to, responsive to user-selection of the second user-selectable interface component, submit an offer for the item at a price different from the published item price to the computer system for transmission to the seller. 14. The system of claim 13, wherein the submitted offer includes an offer price entered into the offer price input field. 15. A non-transitory machine-readable storage medium storing instructions that, when read by a machine, cause the machine to perform operations comprising:
retrieving, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; generating a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and generating the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 16. The non-transitory computer-readable storage medium of claim 15, wherein the second user-selectable interface component is a hyperlink. 17. The non-transitory computer-readable storage medium of claim 15, including, responsive to user-selection of the first user-selectable interface component, submitting an indication to the computer system that the user will purchase the item at the published item price. 18. The non-transitory computer-readable storage medium of claim 15, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 19. The non-transitory computer-readable storage medium of claim 15, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 20. The non-transitory computer-readable storage medium of claim 18, including, responsive to user-selection of the second user-selectable interface component, submitting an offer for the item at a price different from the published item price to the computer system for transmission to the seller. | Various embodiments include systems, methods, and software to manage offers in a network-based commerce system. One embodiment includes providing sellers an option when listing an item for sale to receive best offers for the item from buyers. This embodiment further includes receiving best offers submitted by offerees via the network-based commerce system and notifying sellers of received best offers. Some embodiments further include providing sellers an option to accept, reject, or ignore the individual best offers received. In some such embodiments, ignored best offers expire after a period, such as 48 hours. Yet further embodiments include notifying offerees of acceptance or rejection of their submitted best offers.1. A method to generate a computer system user interface, the method comprising:
retrieving, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; generating a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and generating the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 2. The method of claim 1, wherein the second user-selectable interface component is a hyperlink. 3. The method of claim 1, including, responsive to user-selection of the first user-selectable interface component, submitting an indication to the computer system that the user will purchase the item at the published item price. 4. The method of claim 1, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 5. The method of claim 1, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 6. The method of claim 4, including, responsive to user-selection of the second user-selectable interface component, submitting an offer for the item at a price different from the published item price to the computer system for transmission to the seller. 7. The method of claim 6, wherein the submitted offer includes an offer price entered into the offer price input field. 8. A server system comprising:
a retrieval module, executing on one or more computer processors, to retrieve, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; a first generation module to generate a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and a second generation module, executing on one or more computer processors, to generate the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 9. The system of claim 8, wherein the second user-selectable interface component is a hyperlink. 10. The system of claim 8, including, a first submission module to, responsive to user-selection of the first user-selectable interface component, submit an indication to the computer system that the user will purchase the item at the published item price. 11. The system of claim 8, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 12. The system of claim 8, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 13. The system of claim 11, including, a second submission module to, responsive to user-selection of the second user-selectable interface component, submit an offer for the item at a price different from the published item price to the computer system for transmission to the seller. 14. The system of claim 13, wherein the submitted offer includes an offer price entered into the offer price input field. 15. A non-transitory machine-readable storage medium storing instructions that, when read by a machine, cause the machine to perform operations comprising:
retrieving, from a database, a record related to an item to be transacted via a computer system, the record including: a published item price at which the seller is willing to sell the item under a buyout transaction format, and an offer indication that a seller of the item is willing to accept an offer from a seller under an offer transaction format; generating a user interface, using the record, to include the published item price and a first user-selectable interface component which is user-selectable by a user to initiate purchase of the item at the published item price during the buyout transaction format; and generating the user interface, based on the offer indication in the record, to include a second user-selectable interface component which is user selectable by the user to initiate submission of an offer for the item to the seller under the offer transaction format, the initiation of the submission of the offer including sending an email message from the computer system to the seller. 16. The non-transitory computer-readable storage medium of claim 15, wherein the second user-selectable interface component is a hyperlink. 17. The non-transitory computer-readable storage medium of claim 15, including, responsive to user-selection of the first user-selectable interface component, submitting an indication to the computer system that the user will purchase the item at the published item price. 18. The non-transitory computer-readable storage medium of claim 15, wherein the initiation of the submission of the offer includes generating a further user interface component that includes an offer price input field. 19. The non-transitory computer-readable storage medium of claim 15, including generating the user interface, based on the offer indication in the record, to include an offer price input field. 20. The non-transitory computer-readable storage medium of claim 18, including, responsive to user-selection of the second user-selectable interface component, submitting an offer for the item at a price different from the published item price to the computer system for transmission to the seller. | 3,600 |
13,530 | 13,530 | 14,072,583 | 3,681 | Systems and methods configured with a user interface to allow a user to request automated periodic offers that provide benefits to the consumer account of the user in exchange for a loyalty currency (e.g., loyalty points) the user has earned. | 1. A computer-implemented method, comprising:
receiving, in a computing apparatus, a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source; determining, by the computing apparatus, that the user is eligible for an offer that satisfies the preference; transmitting, by the computing apparatus, a message to the user identifying the offer, in response to the determination that the user is eligible for the offer; monitoring, by the computing apparatus, transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer; in response to the first transaction being processed for authorization, providing a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source; and transmitting, by the computing apparatus, a message to the user about the reduction in the balance in exchange for the benefit of the offer applied to the first transaction in the consumer payment account of the user. 2. The method of claim 1, wherein the offer is provided to the user periodically when the balance of the loyalty currency source is above a predetermined threshold. 3. The method of claim 1, wherein the offer provides a benefit of discount in additional to the exchange for the reduction in the balance. 4. The method of claim 3, wherein the benefit of discount is funded by a combination of redeemed loyalty currency from the loyalty currency source and funds provided by a sponsor processor of the offer. 5. The method of claim 1, further comprising:
periodically associating a respective offer that satisfies the preference of the user with the consumer payment account of the user to facilitate provisioning of a benefit of the respective offer during authorization processing of a respective transaction in the consumer payment account of the user. 6. The method of claim 5, further comprising:
generating a trigger record to detect the respective transaction that satisfies benefit redemption requirements of the respective offer that is associated with the consumer payment account of the user. 7. The method of claim 6, further comprising:
enrolling the user in an offer campaign configured to periodically associate the respective offer with the consumer payment account of the user. 8. The method of claim 1, further comprising:
monitoring the balance of the loyalty currency source, wherein the offer is communicated to the user when the balance of the loyalty current source is above a threshold. 9. The method of claim 1, wherein the providing of the benefit of the offer includes:
redeeming a predetermined amount of loyalty currency from the loyalty currency source during authorization of the first transaction. 10. The method of claim 9, wherein the providing of the benefit of the offer includes:
obtaining an authorization of a benefit sponsored by a sponsor processor of the offer during authorization of the first transaction. 11. The method of claim 10, further comprising:
providing an authorization response to an acquirer processor in response to an authorization request received from the acquirer processor, after the redeeming of the predetermined amount of loyalty currency from the loyalty currency source and the obtaining of the authorization of the benefit sponsored by the sponsor processor of the offer. 12. The method of claim 11, wherein the redeeming of the predetermined amount of loyalty currency from the loyalty currency source and the obtaining of the authorization of the benefit sponsored by the sponsor processor of the offer are preformed concurrently. 13. The method of claim 9, wherein the providing of the benefit of the offer includes:
modifying a transaction amount of the first transaction to provide a discount sponsored by a merchant. 14. The method of claim 9, further comprising:
communicating with an issuer processor of the consumer payment account to obtain an authorization of an amount in the consumer payment account reduced in accordance with the benefit. 15. The method of claim 14, wherein the authorization of the first transaction requested by a merchant is supported by loyalty currency redeemed from the loyalty currency source, the reduced amount in the consumer payment account, and authorization of funds provided by a sponsor processor of the offer. 16. A non-transitory computer-storage medium storing instructions configured to instruct a computing apparatus to at least:
receive, in the computing apparatus, a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source; determine, by the computing apparatus, that the user is eligible for an offer that satisfies the preference; monitor, by the computing apparatus, transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer; and in response to the first transaction being processed for authorization, provide a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source. 17. A computing apparatus, comprising:
at least one microprocessor; and a memory storing instructions configured to instruct the at least one microprocessor to perform operations, the computing apparatus including:
a portal configured to receive a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source, the portal further configured to determine that the user is eligible for an offer that satisfies the preference; and
a transaction handler configured to monitor transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer and in response to the first transaction being processed for authorization, provide a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source. 18. The computing apparatus of claim 17, further comprising:
a data warehouse configured to store the user input to periodically determine whether or nor an offer satisfying the preference of the user can be provided to the user. 19. The computing apparatus of claim 18, wherein the portal is further configured to transmit, in response to the determination that the user is eligible for the offer, a message to a communication reference of the user, the message configured to identify the offer. 20. The computing apparatus of claim 19, wherein the transaction handler is configured to combine the loyalty currency source of the user, the consumer payment account of the user, and a sponsor account of a sponsor to satisfy an authorization request received from a merchant for the first transaction. | Systems and methods configured with a user interface to allow a user to request automated periodic offers that provide benefits to the consumer account of the user in exchange for a loyalty currency (e.g., loyalty points) the user has earned.1. A computer-implemented method, comprising:
receiving, in a computing apparatus, a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source; determining, by the computing apparatus, that the user is eligible for an offer that satisfies the preference; transmitting, by the computing apparatus, a message to the user identifying the offer, in response to the determination that the user is eligible for the offer; monitoring, by the computing apparatus, transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer; in response to the first transaction being processed for authorization, providing a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source; and transmitting, by the computing apparatus, a message to the user about the reduction in the balance in exchange for the benefit of the offer applied to the first transaction in the consumer payment account of the user. 2. The method of claim 1, wherein the offer is provided to the user periodically when the balance of the loyalty currency source is above a predetermined threshold. 3. The method of claim 1, wherein the offer provides a benefit of discount in additional to the exchange for the reduction in the balance. 4. The method of claim 3, wherein the benefit of discount is funded by a combination of redeemed loyalty currency from the loyalty currency source and funds provided by a sponsor processor of the offer. 5. The method of claim 1, further comprising:
periodically associating a respective offer that satisfies the preference of the user with the consumer payment account of the user to facilitate provisioning of a benefit of the respective offer during authorization processing of a respective transaction in the consumer payment account of the user. 6. The method of claim 5, further comprising:
generating a trigger record to detect the respective transaction that satisfies benefit redemption requirements of the respective offer that is associated with the consumer payment account of the user. 7. The method of claim 6, further comprising:
enrolling the user in an offer campaign configured to periodically associate the respective offer with the consumer payment account of the user. 8. The method of claim 1, further comprising:
monitoring the balance of the loyalty currency source, wherein the offer is communicated to the user when the balance of the loyalty current source is above a threshold. 9. The method of claim 1, wherein the providing of the benefit of the offer includes:
redeeming a predetermined amount of loyalty currency from the loyalty currency source during authorization of the first transaction. 10. The method of claim 9, wherein the providing of the benefit of the offer includes:
obtaining an authorization of a benefit sponsored by a sponsor processor of the offer during authorization of the first transaction. 11. The method of claim 10, further comprising:
providing an authorization response to an acquirer processor in response to an authorization request received from the acquirer processor, after the redeeming of the predetermined amount of loyalty currency from the loyalty currency source and the obtaining of the authorization of the benefit sponsored by the sponsor processor of the offer. 12. The method of claim 11, wherein the redeeming of the predetermined amount of loyalty currency from the loyalty currency source and the obtaining of the authorization of the benefit sponsored by the sponsor processor of the offer are preformed concurrently. 13. The method of claim 9, wherein the providing of the benefit of the offer includes:
modifying a transaction amount of the first transaction to provide a discount sponsored by a merchant. 14. The method of claim 9, further comprising:
communicating with an issuer processor of the consumer payment account to obtain an authorization of an amount in the consumer payment account reduced in accordance with the benefit. 15. The method of claim 14, wherein the authorization of the first transaction requested by a merchant is supported by loyalty currency redeemed from the loyalty currency source, the reduced amount in the consumer payment account, and authorization of funds provided by a sponsor processor of the offer. 16. A non-transitory computer-storage medium storing instructions configured to instruct a computing apparatus to at least:
receive, in the computing apparatus, a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source; determine, by the computing apparatus, that the user is eligible for an offer that satisfies the preference; monitor, by the computing apparatus, transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer; and in response to the first transaction being processed for authorization, provide a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source. 17. A computing apparatus, comprising:
at least one microprocessor; and a memory storing instructions configured to instruct the at least one microprocessor to perform operations, the computing apparatus including:
a portal configured to receive a user input identifying a loyalty currency source and a preference for redeeming loyalty currency from the loyalty currency source, the portal further configured to determine that the user is eligible for an offer that satisfies the preference; and
a transaction handler configured to monitor transactions in a consumer payment account of the user to identify a first transaction that satisfies benefit redemption requirements of the offer and in response to the first transaction being processed for authorization, provide a benefit of the offer to the consumer account in exchange for an amount of reduction in a balance of the loyalty currency source. 18. The computing apparatus of claim 17, further comprising:
a data warehouse configured to store the user input to periodically determine whether or nor an offer satisfying the preference of the user can be provided to the user. 19. The computing apparatus of claim 18, wherein the portal is further configured to transmit, in response to the determination that the user is eligible for the offer, a message to a communication reference of the user, the message configured to identify the offer. 20. The computing apparatus of claim 19, wherein the transaction handler is configured to combine the loyalty currency source of the user, the consumer payment account of the user, and a sponsor account of a sponsor to satisfy an authorization request received from a merchant for the first transaction. | 3,600 |
13,531 | 13,531 | 14,733,795 | 3,685 | Disclosed is secure decryption and business rule validation of encrypted confidential data within a hardware security module (HSM). The validation may include the use of a Bloom filter stored and executing within the HSM. The return order of encrypted data within the HSM as well as requests for external data relating to validation may be randomized to further harden against correlation attacks. | 1. A method of validating encrypted payment information against business rules at least partially by a computer, the method comprising:
receiving at a hardware security module an application programming interface call to validate data, the application programming interface call made to an application programming interface provided by the hardware security module, the application programming interface call specifying a secret comprising encrypted payment information from a storage device external to the hardware security module, the hardware security module comprising a cryptographic processor and memory within a tamper resistant physical package; fulfilling the application programming interface call by at least:
decrypting the secret within the hardware security module to create cleartext that encodes the data;
validating the data within the hardware security module; and
generating a validation result that indicates whether the payment information is valid. 2. The method of claim 1, wherein the data comprises an identifier of a source of payment for a transaction. 3. The method of claim 2, wherein the identifier is a credit card number. 4. The method of claim 1, wherein:
fulfilling the application programming interface call further comprises:
requesting, from the hardware security module, validation data from a source external to the hardware security module; and
receiving the validation data in response to the request; and
generating the validation result is based at least in part on the received validation data. 5. The method of claim 1, further comprising selecting only specific portions of validation data to be retrieved. 6. A system comprising:
a tamper-resistant physical package; one or more processors disposed within the tamper-resistant physical package; and memory disposed within the tamper-resistant physical package, the memory including instructions that, when executed by the one or more processors, cause the system to at least:
provide an application programming interface to which application programming interface calls originating outside of the tamper-resistant physical package can be submitted;
receive, to the provided programming interface, an application programming interface call originating outside of the tamper-resistant physical package; and
fulfill the application programming interface call by at least:
decrypting encrypted data within the tamper-resistant physical package to obtain cleartext;
using a set of business rules to validate the obtained cleartext; and
generating a validation result that indicates whether the obtained cleartext is valid. 7. The system of claim 6, wherein the using the set of business rules to validate the obtained cleartext involves using a Bloom filter that is inaccessible outside of the tamper-resistant package. 8. The system of claim 6, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the system to provide the generated validation result without the obtained cleartext. 9. The system of claim 6, wherein:
the cleartext encodes an identifier of a payment instrument of a payment type; and using the set of business rules to validate the obtained cleartext includes using a validation check that matches the payment type. 10. The system of claim 6, wherein the memory includes instructions that enable the system to validate, within the tamper-resistant package, payment instruments of a variety of different payment types. 11. The system of claim 6, wherein the system stores information sufficient to validate the cleartext without obtaining additional information from outside of the tamper-resistant package. 12. The system of claim 11, wherein the information sufficient to validate the cleartext comprises a Bloom filter stored in the memory. 13. One or more non-transitory computer-readable storage media comprising instructions that when executed by a computer system cause the computer system to:
receive, from another computer system, an application programming interface call whose fulfillment involves decryption of encrypted data; decrypt, using one or more processors disposed inside a tamper-resistant physical package, the encrypted data to obtain cleartext that is inaccessible outside of the tamper-resistant physical package; perform a validation of the obtained cleartext using the one or more processors disposed inside the tamper-resistant physical package; generate a response to the application programming interface call based at least in part on the performed validation; and provide the generated response. 14. The computer-readable storage media of claim 13, wherein the validation utilizes a Bloom filter. 15. The computer-readable storage media of claim 13, wherein the application programming interface call comprises the encrypted data. 16. The computer-readable storage media of claim 13, wherein the encrypted data encrypts an identifier of a payment instrument. 17. The computer-readable storage media of claim 16, wherein the payment instrument is a payment card. 18. The computer-readable storage media of claim 16, wherein the validation comprises verification of a set of mathematical properties of the identifier of the payment instrument. 19. The computer-readable storage media of claim 13, wherein the validation comprises obtaining, from a server operating outside of the tamper-resistant physical package, data for use in the validation. 20. The computer-readable storage media of claim 13, wherein the computer system is a hardware security module. | Disclosed is secure decryption and business rule validation of encrypted confidential data within a hardware security module (HSM). The validation may include the use of a Bloom filter stored and executing within the HSM. The return order of encrypted data within the HSM as well as requests for external data relating to validation may be randomized to further harden against correlation attacks.1. A method of validating encrypted payment information against business rules at least partially by a computer, the method comprising:
receiving at a hardware security module an application programming interface call to validate data, the application programming interface call made to an application programming interface provided by the hardware security module, the application programming interface call specifying a secret comprising encrypted payment information from a storage device external to the hardware security module, the hardware security module comprising a cryptographic processor and memory within a tamper resistant physical package; fulfilling the application programming interface call by at least:
decrypting the secret within the hardware security module to create cleartext that encodes the data;
validating the data within the hardware security module; and
generating a validation result that indicates whether the payment information is valid. 2. The method of claim 1, wherein the data comprises an identifier of a source of payment for a transaction. 3. The method of claim 2, wherein the identifier is a credit card number. 4. The method of claim 1, wherein:
fulfilling the application programming interface call further comprises:
requesting, from the hardware security module, validation data from a source external to the hardware security module; and
receiving the validation data in response to the request; and
generating the validation result is based at least in part on the received validation data. 5. The method of claim 1, further comprising selecting only specific portions of validation data to be retrieved. 6. A system comprising:
a tamper-resistant physical package; one or more processors disposed within the tamper-resistant physical package; and memory disposed within the tamper-resistant physical package, the memory including instructions that, when executed by the one or more processors, cause the system to at least:
provide an application programming interface to which application programming interface calls originating outside of the tamper-resistant physical package can be submitted;
receive, to the provided programming interface, an application programming interface call originating outside of the tamper-resistant physical package; and
fulfill the application programming interface call by at least:
decrypting encrypted data within the tamper-resistant physical package to obtain cleartext;
using a set of business rules to validate the obtained cleartext; and
generating a validation result that indicates whether the obtained cleartext is valid. 7. The system of claim 6, wherein the using the set of business rules to validate the obtained cleartext involves using a Bloom filter that is inaccessible outside of the tamper-resistant package. 8. The system of claim 6, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the system to provide the generated validation result without the obtained cleartext. 9. The system of claim 6, wherein:
the cleartext encodes an identifier of a payment instrument of a payment type; and using the set of business rules to validate the obtained cleartext includes using a validation check that matches the payment type. 10. The system of claim 6, wherein the memory includes instructions that enable the system to validate, within the tamper-resistant package, payment instruments of a variety of different payment types. 11. The system of claim 6, wherein the system stores information sufficient to validate the cleartext without obtaining additional information from outside of the tamper-resistant package. 12. The system of claim 11, wherein the information sufficient to validate the cleartext comprises a Bloom filter stored in the memory. 13. One or more non-transitory computer-readable storage media comprising instructions that when executed by a computer system cause the computer system to:
receive, from another computer system, an application programming interface call whose fulfillment involves decryption of encrypted data; decrypt, using one or more processors disposed inside a tamper-resistant physical package, the encrypted data to obtain cleartext that is inaccessible outside of the tamper-resistant physical package; perform a validation of the obtained cleartext using the one or more processors disposed inside the tamper-resistant physical package; generate a response to the application programming interface call based at least in part on the performed validation; and provide the generated response. 14. The computer-readable storage media of claim 13, wherein the validation utilizes a Bloom filter. 15. The computer-readable storage media of claim 13, wherein the application programming interface call comprises the encrypted data. 16. The computer-readable storage media of claim 13, wherein the encrypted data encrypts an identifier of a payment instrument. 17. The computer-readable storage media of claim 16, wherein the payment instrument is a payment card. 18. The computer-readable storage media of claim 16, wherein the validation comprises verification of a set of mathematical properties of the identifier of the payment instrument. 19. The computer-readable storage media of claim 13, wherein the validation comprises obtaining, from a server operating outside of the tamper-resistant physical package, data for use in the validation. 20. The computer-readable storage media of claim 13, wherein the computer system is a hardware security module. | 3,600 |
13,532 | 13,532 | 14,651,163 | 3,694 | Disclosed is a method for providing advertisement to a user of a communication network. An advertisement database stores an association between the identifier of a further user and at least one visual advertisement associated with and selected by the further user. When a communication session is set up in the communication network between the user and the further user, an advertisement manager uses the identifier of the further user for retrieving from the advertisement database a visual advertisement selected amongst the visual advertisements associated with the further user. The advertisement manager then transmits the selected visual advertisement to the user for display on a display of the user device. | 1. A method for providing an advertisement to a user of a communication network, the method comprising steps of:
at an advertisement database, storing an association between an identifier of a further user of the communication network and at least one visual advertisement associated with the further user; setting up a communication session in the communication network between a user device of the user and a further user device of the further user; at an advertisement manager, using the identifier for retrieving from the advertisement database a visual advertisement selected amongst the at least one visual advertisement associated with the further user; and transmitting the selected visual advertisement from the advertisement manager to the user device of the user, the selected visual advertisement being displayed on a display of the user device. 2. The method according to claim 1, wherein:
the step (a) further comprises storing a further association between a further identifier of the user and at least one further visual advertisement associated with the user; the step (c) further comprises using the further identifier for retrieving a further visual advertisement selected amongst the at least one further visual advertisement associated with the user; and the step (d) further comprises transmitting the further selected visual advertisement from the advertisement manager to the further user device of the further user, the further selected visual advertisement being displayed on a display of the further user device. 3. The method according to claim 2, wherein the step (b) comprises transmitting a communication session set up request from the user device to the further user device. 4. The method according to claim 3, wherein the step (b) further comprises transmitting an advertisement request from the user device to the advertisement manager, the advertisement request comprising the identifier of the further user. 5. The method according to claim 4, wherein the advertisement request is automatically transmitted by the user device to the advertisement manager before the communication session set up request is transmitted by the user device to the further user device. 6. The method according to claim 5, wherein the selected visual advertisement is transmitted from the advertisement manager to the user device before the communication session set up request is transmitted by the user device to the further user device. 7. The method according to claim 6, wherein the user device automatically displays the selected visual advertisement as the selected visual advertisement is received from the advertisement manager, within a graphic interface through which the communication session is available to be set up. 8. The method according to claim 4, wherein the step (b) further comprises transmitting a further advertisement request from the further user device to the advertisement manager upon reception of the communication session set up request at the further user device, the further advertisement request comprising the further identifier of the user. 9. The method according to claim 8, wherein the step (c) includes retrieving the visual advertisement after the further advertisement request is received at the advertisement manager. 10. The method according to claim 9, wherein the step (c) includes retrieving the visual advertisement based on information of the user retrieved from a contact list of the further user and included in the further advertisement request, the information of the user comprising a contact group to which the user belongs in the contact list of the further user. 11. The method according to claim 3 wherein:
the step (b) comprises storing information on the communication session at a further database cooperating with the communication network, the information comprising the identifier of the further user; and
the step (c) comprises retrieving the identifier from the further database. 12. The method according to claim 4, wherein the selected visual advertisement is transmitted to the user device during the communication session or after the communication session is closed. 13. The method according to claim 12, wherein the selected visual advertisement is stored at the user device and is available to be displayed by the user device on demand. 14. The method according to claim 1, wherein the at least one visual advertisement comprises a banner comprising at least one of an image, a text word or a link to a web page. 15. A communication system configured to provide an advertisement to a user, the communication system comprising:
a communication network configured to support a communication session between a user device of the user and a further user device of a further user; an advertisement database storing an association between an identifier of the further user and at least one visual advertisement associated with the further user; and an advertisement manager configured to, upon setting up of the communication session, use the identifier for retrieving from the advertisement database a visual advertisement selected amongst the at least one visual advertisement associated with the further user and transmit the selected visual advertisement to the user device of the user, the selected visual advertisement being displayed on a display of the user device. | Disclosed is a method for providing advertisement to a user of a communication network. An advertisement database stores an association between the identifier of a further user and at least one visual advertisement associated with and selected by the further user. When a communication session is set up in the communication network between the user and the further user, an advertisement manager uses the identifier of the further user for retrieving from the advertisement database a visual advertisement selected amongst the visual advertisements associated with the further user. The advertisement manager then transmits the selected visual advertisement to the user for display on a display of the user device.1. A method for providing an advertisement to a user of a communication network, the method comprising steps of:
at an advertisement database, storing an association between an identifier of a further user of the communication network and at least one visual advertisement associated with the further user; setting up a communication session in the communication network between a user device of the user and a further user device of the further user; at an advertisement manager, using the identifier for retrieving from the advertisement database a visual advertisement selected amongst the at least one visual advertisement associated with the further user; and transmitting the selected visual advertisement from the advertisement manager to the user device of the user, the selected visual advertisement being displayed on a display of the user device. 2. The method according to claim 1, wherein:
the step (a) further comprises storing a further association between a further identifier of the user and at least one further visual advertisement associated with the user; the step (c) further comprises using the further identifier for retrieving a further visual advertisement selected amongst the at least one further visual advertisement associated with the user; and the step (d) further comprises transmitting the further selected visual advertisement from the advertisement manager to the further user device of the further user, the further selected visual advertisement being displayed on a display of the further user device. 3. The method according to claim 2, wherein the step (b) comprises transmitting a communication session set up request from the user device to the further user device. 4. The method according to claim 3, wherein the step (b) further comprises transmitting an advertisement request from the user device to the advertisement manager, the advertisement request comprising the identifier of the further user. 5. The method according to claim 4, wherein the advertisement request is automatically transmitted by the user device to the advertisement manager before the communication session set up request is transmitted by the user device to the further user device. 6. The method according to claim 5, wherein the selected visual advertisement is transmitted from the advertisement manager to the user device before the communication session set up request is transmitted by the user device to the further user device. 7. The method according to claim 6, wherein the user device automatically displays the selected visual advertisement as the selected visual advertisement is received from the advertisement manager, within a graphic interface through which the communication session is available to be set up. 8. The method according to claim 4, wherein the step (b) further comprises transmitting a further advertisement request from the further user device to the advertisement manager upon reception of the communication session set up request at the further user device, the further advertisement request comprising the further identifier of the user. 9. The method according to claim 8, wherein the step (c) includes retrieving the visual advertisement after the further advertisement request is received at the advertisement manager. 10. The method according to claim 9, wherein the step (c) includes retrieving the visual advertisement based on information of the user retrieved from a contact list of the further user and included in the further advertisement request, the information of the user comprising a contact group to which the user belongs in the contact list of the further user. 11. The method according to claim 3 wherein:
the step (b) comprises storing information on the communication session at a further database cooperating with the communication network, the information comprising the identifier of the further user; and
the step (c) comprises retrieving the identifier from the further database. 12. The method according to claim 4, wherein the selected visual advertisement is transmitted to the user device during the communication session or after the communication session is closed. 13. The method according to claim 12, wherein the selected visual advertisement is stored at the user device and is available to be displayed by the user device on demand. 14. The method according to claim 1, wherein the at least one visual advertisement comprises a banner comprising at least one of an image, a text word or a link to a web page. 15. A communication system configured to provide an advertisement to a user, the communication system comprising:
a communication network configured to support a communication session between a user device of the user and a further user device of a further user; an advertisement database storing an association between an identifier of the further user and at least one visual advertisement associated with the further user; and an advertisement manager configured to, upon setting up of the communication session, use the identifier for retrieving from the advertisement database a visual advertisement selected amongst the at least one visual advertisement associated with the further user and transmit the selected visual advertisement to the user device of the user, the selected visual advertisement being displayed on a display of the user device. | 3,600 |
13,533 | 13,533 | 13,157,533 | 3,662 | A path-dependent control of a hybrid electric vehicle (HEV) includes segmenting a route into segments, generating a sequence of battery state-of-charge (SoC) set-points for the segments, and controlling the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route. | 1. A method comprising:
segmenting a route into segments; generating a sequence of battery state-of-charge (SoC) set-points for the segments; and controlling a hybrid electric vehicle in accordance with the battery SoC set-points as the vehicle travels along the route. 2. The method of claim 1 wherein:
segmenting the route into segments is based on vehicle speed along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the vehicle speed at the node. 3. The method of claim 1 wherein:
segmenting the route into segments is based on road grade along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the road grade at the node. 4. The method of claim 1 wherein:
segmenting the route into segments is based on stop signs and traffic lights along the route such that a node where one segment ends and another segment begins corresponds either to the presence of a stop sign or a traffic light at the node. 5. The method of claim 1 wherein:
segmenting the route into segments is based on traffic congestion along the route such that a node where one segments ends and another segment begins corresponds to traffic congestion at the node. 6. The method of claim 1 wherein:
segmenting the route into segments is based on vehicle speed and road grade along the route such that a node where one segment ends and another segment begins corresponds to at least one of the initiation of a change in the vehicle speed and the initiation of a change in the road grade at the node. 7. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated to minimize fuel consumption of the vehicle such that fuel efficiency of the vehicle is greater when the vehicle is controlled in accordance with the battery SoC set-points as the vehicle travels along the route than when the vehicle is controlled in accordance with a constant battery SoC set-point as the vehicle travels along the route. 8. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated such that the battery SoC set-point for each segment is based on at least one of the length of the segment, the vehicle speed along the segment, the road grade of the segment, and the battery SoC at the beginning of the segment. 9. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated such that the battery SoC at the end of the route will be equal to the battery SoC at the origin of the route. 10. The method of claim 1 wherein:
controlling the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route includes updating the battery SoC set-point at each node between route segments and achieving the battery SoC set-point for a segment as the vehicle travels along the segment. 11. A system comprising:
a controller configured to segment a route into segments, generate a sequence of battery state-of-charge (SoC) set-points for the segments, and control a hybrid electric vehicle in accordance with the battery SoC set-points as the vehicle travels along the route. 12. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on vehicle speed along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the vehicle speed at the node. 13. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on road grade along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the road grade at the node. 14. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on stop signs and traffic lights along the route such that a node where one segment ends and another segment begins corresponds either to the presence of a stop sign or a traffic light at the node. 15. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on traffic congestion along the route such that a node wherein one segment ends and another segment begins corresponds to traffic congestion at the node. 16. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on vehicle speed and road grade along the route such that a node where one segment ends and another segment begins corresponds to at least one of the initiation of a change in the vehicle speed and the initiation of a change in the road grade at the node. 17. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments to minimize fuel consumption of the vehicle such that fuel efficiency of the vehicle is greater when the vehicle is controlled in accordance with the battery SoC set-points as the vehicle travels along the route than when the vehicle is controlled in accordance with a constant battery SoC set-point as the vehicle travels along the route. 18. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments such that the battery SoC set-point for each segment is based on at least one of the length of the segment, the vehicle speed along the segment, the road grade of the segment, and the battery SoC at the beginning of the segment. 19. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments such that the battery SoC at the end of the route will be equal to the battery SoC at the origin of the route. 20. The system of claim 11 wherein:
the controller is configured to control the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route includes updating the battery SoC set-point at each node between route segments and achieving the battery SoC set-point for a segment as the vehicle travels along the segment. | A path-dependent control of a hybrid electric vehicle (HEV) includes segmenting a route into segments, generating a sequence of battery state-of-charge (SoC) set-points for the segments, and controlling the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route.1. A method comprising:
segmenting a route into segments; generating a sequence of battery state-of-charge (SoC) set-points for the segments; and controlling a hybrid electric vehicle in accordance with the battery SoC set-points as the vehicle travels along the route. 2. The method of claim 1 wherein:
segmenting the route into segments is based on vehicle speed along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the vehicle speed at the node. 3. The method of claim 1 wherein:
segmenting the route into segments is based on road grade along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the road grade at the node. 4. The method of claim 1 wherein:
segmenting the route into segments is based on stop signs and traffic lights along the route such that a node where one segment ends and another segment begins corresponds either to the presence of a stop sign or a traffic light at the node. 5. The method of claim 1 wherein:
segmenting the route into segments is based on traffic congestion along the route such that a node where one segments ends and another segment begins corresponds to traffic congestion at the node. 6. The method of claim 1 wherein:
segmenting the route into segments is based on vehicle speed and road grade along the route such that a node where one segment ends and another segment begins corresponds to at least one of the initiation of a change in the vehicle speed and the initiation of a change in the road grade at the node. 7. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated to minimize fuel consumption of the vehicle such that fuel efficiency of the vehicle is greater when the vehicle is controlled in accordance with the battery SoC set-points as the vehicle travels along the route than when the vehicle is controlled in accordance with a constant battery SoC set-point as the vehicle travels along the route. 8. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated such that the battery SoC set-point for each segment is based on at least one of the length of the segment, the vehicle speed along the segment, the road grade of the segment, and the battery SoC at the beginning of the segment. 9. The method of claim 1 wherein:
the sequence of battery SoC set-points for the segments is generated such that the battery SoC at the end of the route will be equal to the battery SoC at the origin of the route. 10. The method of claim 1 wherein:
controlling the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route includes updating the battery SoC set-point at each node between route segments and achieving the battery SoC set-point for a segment as the vehicle travels along the segment. 11. A system comprising:
a controller configured to segment a route into segments, generate a sequence of battery state-of-charge (SoC) set-points for the segments, and control a hybrid electric vehicle in accordance with the battery SoC set-points as the vehicle travels along the route. 12. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on vehicle speed along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the vehicle speed at the node. 13. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on road grade along the route such that a node where one segment ends and another segment begins corresponds to the initiation of a change in the road grade at the node. 14. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on stop signs and traffic lights along the route such that a node where one segment ends and another segment begins corresponds either to the presence of a stop sign or a traffic light at the node. 15. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on traffic congestion along the route such that a node wherein one segment ends and another segment begins corresponds to traffic congestion at the node. 16. The system of claim 11 wherein:
the controller is further configured to segment the route into segments based on vehicle speed and road grade along the route such that a node where one segment ends and another segment begins corresponds to at least one of the initiation of a change in the vehicle speed and the initiation of a change in the road grade at the node. 17. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments to minimize fuel consumption of the vehicle such that fuel efficiency of the vehicle is greater when the vehicle is controlled in accordance with the battery SoC set-points as the vehicle travels along the route than when the vehicle is controlled in accordance with a constant battery SoC set-point as the vehicle travels along the route. 18. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments such that the battery SoC set-point for each segment is based on at least one of the length of the segment, the vehicle speed along the segment, the road grade of the segment, and the battery SoC at the beginning of the segment. 19. The system of claim 11 wherein:
the controller is configured to generate the sequence of battery SoC set-points for the segments such that the battery SoC at the end of the route will be equal to the battery SoC at the origin of the route. 20. The system of claim 11 wherein:
the controller is configured to control the vehicle in accordance with the battery SoC set-points as the vehicle travels along the route includes updating the battery SoC set-point at each node between route segments and achieving the battery SoC set-point for a segment as the vehicle travels along the segment. | 3,600 |
13,534 | 13,534 | 14,630,377 | 3,622 | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth. | 1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
receiving one or more inputs describing characteristics of the marketing activity and the content to be included as part of the marketing activity; locating metadata that describes creation of content that corresponds to the described characteristics of the content and the marketing activity; finding one or more content creators that have created content corresponding to the located metadata; and causing output of identifiers of the found one or more content creators for inclusion in a user interface. 2. A system as described in claim 1, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity. 3. A system as described in claim 1, wherein the one or more inputs include textual descriptions that describe the characteristics of the marketing activity and the content. 4. A system as described in claim 1, wherein the metadata describes characteristics of a device used to create the content. 5. A system as described in claim 3, wherein the characteristics include device type, flash usage, focal length, aperture value, exposure time, zoom level, digital versus analog zoom, lens type, device identifier. 6. A system as described in claim 1, wherein the metadata also describes characteristics of the content. 7. A system as described in claim 6, wherein described characteristics of the content include identification of one or more objects in the content or scene classification. 8. A system as described in claim 1, wherein the metadata also describes environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors. 9. A system as described in claim 1, wherein the metadata describes processing performed to edit the content as part of creation of the content. 10. A system as described in claim 9, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. 11. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method comprising:
receiving one or more inputs, at one or more computing devices, describing characteristics of the marketing activity and content to be included as part of the marketing activity; locating metadata, by the one or more computing devices, that describes creation of content that corresponds to the described characteristics of the content and the marketing activity; finding one or more items of content having the located metadata by the one or more computing devices; and causing output of the found one or more items of content for output in a user interface by the one or more computing devices. 12. A method as described in claim 11, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity or include textual descriptions that describe the characteristics of the marketing activity and the content. 13. A method as described in claim 11, wherein the metadata describes characteristics of a device used to create the content. 14. A method as described in claim 11, wherein the metadata also describes characteristics of the content that include identification of one or more objects in the content or scene classification. 15. A method as described in claim 11, wherein the metadata describes processing performed to edit the content as part of creation of the content. 16. A method as described in claim 15, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. 17. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to generate suggestions to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
receiving one or more inputs describing characteristics of a marketing activity and content to be included as part of the marketing activity; locating metadata that describes creation of content that corresponds to the described characteristics of the content and the marketing activity, the locating based at least in part on tracked deployment of the created content as part of respective ones of a plurality of other marketing activities; generating one or more suggestions describing characteristics of the content for inclusion as part of the marketing activity based on the located metadata; and exposing an offer for output in a user interface for viewing by one or more content creators, the offer indicating the content to be included as part of the marketing activity and including the generated one or more suggestions. 18. A system as described in claim 17, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity or include textual descriptions that describe the characteristics of the marketing activity and the content. 19. A system as described in claim 17, wherein the metadata describes characteristics of a device used to create the content. 20. A system as described in claim 17, wherein the metadata describes processing performed to edit the content as part of creation of the content including one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth.1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
receiving one or more inputs describing characteristics of the marketing activity and the content to be included as part of the marketing activity; locating metadata that describes creation of content that corresponds to the described characteristics of the content and the marketing activity; finding one or more content creators that have created content corresponding to the located metadata; and causing output of identifiers of the found one or more content creators for inclusion in a user interface. 2. A system as described in claim 1, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity. 3. A system as described in claim 1, wherein the one or more inputs include textual descriptions that describe the characteristics of the marketing activity and the content. 4. A system as described in claim 1, wherein the metadata describes characteristics of a device used to create the content. 5. A system as described in claim 3, wherein the characteristics include device type, flash usage, focal length, aperture value, exposure time, zoom level, digital versus analog zoom, lens type, device identifier. 6. A system as described in claim 1, wherein the metadata also describes characteristics of the content. 7. A system as described in claim 6, wherein described characteristics of the content include identification of one or more objects in the content or scene classification. 8. A system as described in claim 1, wherein the metadata also describes environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors. 9. A system as described in claim 1, wherein the metadata describes processing performed to edit the content as part of creation of the content. 10. A system as described in claim 9, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. 11. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method comprising:
receiving one or more inputs, at one or more computing devices, describing characteristics of the marketing activity and content to be included as part of the marketing activity; locating metadata, by the one or more computing devices, that describes creation of content that corresponds to the described characteristics of the content and the marketing activity; finding one or more items of content having the located metadata by the one or more computing devices; and causing output of the found one or more items of content for output in a user interface by the one or more computing devices. 12. A method as described in claim 11, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity or include textual descriptions that describe the characteristics of the marketing activity and the content. 13. A method as described in claim 11, wherein the metadata describes characteristics of a device used to create the content. 14. A method as described in claim 11, wherein the metadata also describes characteristics of the content that include identification of one or more objects in the content or scene classification. 15. A method as described in claim 11, wherein the metadata describes processing performed to edit the content as part of creation of the content. 16. A method as described in claim 15, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. 17. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to generate suggestions to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
receiving one or more inputs describing characteristics of a marketing activity and content to be included as part of the marketing activity; locating metadata that describes creation of content that corresponds to the described characteristics of the content and the marketing activity, the locating based at least in part on tracked deployment of the created content as part of respective ones of a plurality of other marketing activities; generating one or more suggestions describing characteristics of the content for inclusion as part of the marketing activity based on the located metadata; and exposing an offer for output in a user interface for viewing by one or more content creators, the offer indicating the content to be included as part of the marketing activity and including the generated one or more suggestions. 18. A system as described in claim 17, wherein the one or more inputs reference examples of the content to be included as part of the marketing activity or include textual descriptions that describe the characteristics of the marketing activity and the content. 19. A system as described in claim 17, wherein the metadata describes characteristics of a device used to create the content. 20. A system as described in claim 17, wherein the metadata describes processing performed to edit the content as part of creation of the content including one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. | 3,600 |
13,535 | 13,535 | 14,630,442 | 3,622 | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth. | 1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
monitoring interaction of one or more users with content available via a shared network resource; collecting comments and markups made in association with the content as part of the monitored interaction; and exposing a user interface for display that includes:
the content and the markups in which at least one of the markups is disposed over a display of the content; and
an activity stream that includes the collected comments. 2. A system as described in claim 1, wherein at least one comment corresponds to and is visibly associated with a respective one of the markups. 3. A system as described in claim 1, wherein the activity stream includes indications of users that provided respective said comments. 4. A system as described in claim 1, wherein access to the shared network resource is managed by a managing user of the shared network resource and access is granted to the shared network resource to at least one other said user by the managing user. 5. A system as described in claim 4, wherein the access is granted as part of a workflow initiated by the managing user to create the content, the workflow including one or more tasks that are specified through interaction with the activity stream. 6. A system as described in claim 5, wherein the workflow involves a marketing activity, the content is an image to be included in the marketing activity, and the at least one other said user is given access to the shared network resource in association with a content creation service that is accessible via a network. 7. A system as described in claim 6, wherein the content creation service exposes a plurality of different image editing operations that are accessible to the at least one other said user to create the content. 8. A system as described in claim 6, wherein the marketing activity is configured to include the content as a banner ad, link, webpage, online video, email, or message. 9. A system as described in claim 6, wherein the managing user:
gives the access to the shared network resource as an invitation to the at least one other said user to create the content for the marketing activity; and retains control of the content available via the shared network resource after access by the least one other said user to the shared network resource is revoked. 10. A system as described in claim 1, further comprising maintaining a plurality of versions of the content as part of the shared network resource, each of the plurality of versions being associated with a corresponding change made to the content. 11. A system as described in claim 1, wherein the exposing is performed in real time. 12. A system as described in claim 1, further comprising automatically converting the content to be exposed in the user interface to include watermarking, digital rights management, or generated thumbnails. 13. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method comprising:
controlling display of a user interface by one or more computing devices, the user interface including a display of content available via a shared network resource to a plurality of users and an activity stream that includes comments associated with markups displayed as an overlay over the content, the activity stream including tasks involving creation of the content that are to be performed by respective said users; and updating the activity stream and the content in real time by the one or more computing devices in response to performance of the tasks or receipt of additional comments and associated markups. 14. A method as described in claim 13, wherein access to the shared network resource is granted as part of a workflow initiated by a managing one of the plurality of users to create the content, the workflow including the tasks that are specified through interaction with the activity stream. 15. A method as described in claim 14, wherein the workflow involves a marketing activity, the content is an image to be included in the marketing activity, and the at least one other said user is given access to the shared network resource in association with a content creation service that is accessible via a network. 16. A method as described in claim 15, wherein the content creation service exposed a plurality of different image editing operations that are accessible to the at least one other said user to create the content. 17. In a digital medium environment for creating and deploying a marketing activity, where the marketing activity involves creation and deployment of content as part of the marketing activity, a system to create and deploy the content comprising:
a content creation service implemented by one or more computing devices, the content creation service being accessible via a network to a plurality of users and configured to expose a plurality of image editing operations that are configured to create content; and a content deployment service implemented by one or more computing devices and accessible via a network, the content deployment service configured to expose:
a shared network resource as part of a workflow that is accessible via invitation to a plurality of users of the content creation service to create an item of content; and
a user interface having a display of content available via the shared network resource to the plurality of users and an activity stream that includes comments associated with annotations displayed as an overlay over the content, the activity stream including tasks involving creation of the content that are to be performed by respective said users through interaction with the content creation service as part of the workflow. 18. A system as described in claim 17, wherein the workflow specifies tasks that are to be performed in creation of the item of content as part of a marketing activity. 19. A system as described in claim 17, wherein the content deployment service is configured to perform operations comprising:
aggregating data describing tracked deployment of a plurality of marketing activities and content included as part of respective ones of the plurality of marketing activities to a plurality of potential consumers; and exposing a user interface for display via the content creation service as a suggestion in the creation of the item of content, by indicating:
similarity of metadata, one to another, that describes creation of the content; and
correspondence of the similar metadata with the tracked deployment of the plurality of marketing activities described by the aggregated data. 20. A system as described in claim 19, wherein the metadata describes characteristics of:
a device used to create the content, the characteristics including device type, flash usage, focal length, aperture value, exposure, time, zoom level, digital versus analog zoom, lens type, or device identifier; the content including identification of one or more objects in the content or scene classification; environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors; or processing operations including one or more image processing operations applied to the content, identifies one or more applications used to perform the processing, or identifies processing performed by respective applications. | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth.1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to perform operations comprising:
monitoring interaction of one or more users with content available via a shared network resource; collecting comments and markups made in association with the content as part of the monitored interaction; and exposing a user interface for display that includes:
the content and the markups in which at least one of the markups is disposed over a display of the content; and
an activity stream that includes the collected comments. 2. A system as described in claim 1, wherein at least one comment corresponds to and is visibly associated with a respective one of the markups. 3. A system as described in claim 1, wherein the activity stream includes indications of users that provided respective said comments. 4. A system as described in claim 1, wherein access to the shared network resource is managed by a managing user of the shared network resource and access is granted to the shared network resource to at least one other said user by the managing user. 5. A system as described in claim 4, wherein the access is granted as part of a workflow initiated by the managing user to create the content, the workflow including one or more tasks that are specified through interaction with the activity stream. 6. A system as described in claim 5, wherein the workflow involves a marketing activity, the content is an image to be included in the marketing activity, and the at least one other said user is given access to the shared network resource in association with a content creation service that is accessible via a network. 7. A system as described in claim 6, wherein the content creation service exposes a plurality of different image editing operations that are accessible to the at least one other said user to create the content. 8. A system as described in claim 6, wherein the marketing activity is configured to include the content as a banner ad, link, webpage, online video, email, or message. 9. A system as described in claim 6, wherein the managing user:
gives the access to the shared network resource as an invitation to the at least one other said user to create the content for the marketing activity; and retains control of the content available via the shared network resource after access by the least one other said user to the shared network resource is revoked. 10. A system as described in claim 1, further comprising maintaining a plurality of versions of the content as part of the shared network resource, each of the plurality of versions being associated with a corresponding change made to the content. 11. A system as described in claim 1, wherein the exposing is performed in real time. 12. A system as described in claim 1, further comprising automatically converting the content to be exposed in the user interface to include watermarking, digital rights management, or generated thumbnails. 13. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method comprising:
controlling display of a user interface by one or more computing devices, the user interface including a display of content available via a shared network resource to a plurality of users and an activity stream that includes comments associated with markups displayed as an overlay over the content, the activity stream including tasks involving creation of the content that are to be performed by respective said users; and updating the activity stream and the content in real time by the one or more computing devices in response to performance of the tasks or receipt of additional comments and associated markups. 14. A method as described in claim 13, wherein access to the shared network resource is granted as part of a workflow initiated by a managing one of the plurality of users to create the content, the workflow including the tasks that are specified through interaction with the activity stream. 15. A method as described in claim 14, wherein the workflow involves a marketing activity, the content is an image to be included in the marketing activity, and the at least one other said user is given access to the shared network resource in association with a content creation service that is accessible via a network. 16. A method as described in claim 15, wherein the content creation service exposed a plurality of different image editing operations that are accessible to the at least one other said user to create the content. 17. In a digital medium environment for creating and deploying a marketing activity, where the marketing activity involves creation and deployment of content as part of the marketing activity, a system to create and deploy the content comprising:
a content creation service implemented by one or more computing devices, the content creation service being accessible via a network to a plurality of users and configured to expose a plurality of image editing operations that are configured to create content; and a content deployment service implemented by one or more computing devices and accessible via a network, the content deployment service configured to expose:
a shared network resource as part of a workflow that is accessible via invitation to a plurality of users of the content creation service to create an item of content; and
a user interface having a display of content available via the shared network resource to the plurality of users and an activity stream that includes comments associated with annotations displayed as an overlay over the content, the activity stream including tasks involving creation of the content that are to be performed by respective said users through interaction with the content creation service as part of the workflow. 18. A system as described in claim 17, wherein the workflow specifies tasks that are to be performed in creation of the item of content as part of a marketing activity. 19. A system as described in claim 17, wherein the content deployment service is configured to perform operations comprising:
aggregating data describing tracked deployment of a plurality of marketing activities and content included as part of respective ones of the plurality of marketing activities to a plurality of potential consumers; and exposing a user interface for display via the content creation service as a suggestion in the creation of the item of content, by indicating:
similarity of metadata, one to another, that describes creation of the content; and
correspondence of the similar metadata with the tracked deployment of the plurality of marketing activities described by the aggregated data. 20. A system as described in claim 19, wherein the metadata describes characteristics of:
a device used to create the content, the characteristics including device type, flash usage, focal length, aperture value, exposure, time, zoom level, digital versus analog zoom, lens type, or device identifier; the content including identification of one or more objects in the content or scene classification; environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors; or processing operations including one or more image processing operations applied to the content, identifies one or more applications used to perform the processing, or identifies processing performed by respective applications. | 3,600 |
13,536 | 13,536 | 14,860,865 | 3,628 | When an indication of an incident is received, it may be determined whether the incident is located in an area that is defined to surround an entity of a supply chain network and whether the entity of the supply chain network is relevant for a shipment associated with a company. The entity is one of a supply chain node and a supply chain lane. A reporting of the incident to a user may be caused, in case at least one criterion is met. The at least one criterion comprises that it is determined that the incident is located in an area that is defined to surround an entity of the supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. A company may make use of the report for an incident monitoring. | 1. A method, performed by at least one apparatus, the method comprising:
receiving an indication of an incident; determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and causing a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. 2. The method according to claim 1, further comprising at least one of:
making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network; making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network; making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network and wherein the data about the supply chain network results from a modelling of the company specific supply chain network based on shipments transported for the company in the past; and making use of data about shipments associated with the company stored in a shipment database of a logistics service provider as a basis for determining whether the entity of the supply chain network is relevant for a shipment associated with the company. 3. The method according to claim 1, wherein the entity of the supply chain network is relevant for a shipment associated with the company if at least one of:
a shipment associated with the company is present at the entity of the supply chain network; and a shipment associated with the company is scheduled to arrive at the entity of the supply chain network. 4. The method according to claim 1, wherein one of
the entity is a supply chain node and the area surrounding the supply chain node is a circular area with a predetermined radius; and the entity is a supply chain lane and the area surrounding the supply chain lane is a corridor of a predetermined width. 5. The method according to claim 1, wherein a size of the area surrounding the entity is defined by one of:
a default value; one of a plurality of default values predetermined for different severity levels of incidents; one of a plurality of default values predetermined for different types of entities; one of a plurality of default values predetermined for different categories of incidents; a value defined by a user; one of a plurality of values defined by a user for different severity levels of incidents; one of a plurality of values defined by a user for different types of entities; and one of a plurality of values defined by a user for different categories of incidents. 6. The method according to claim 1, wherein the incident is reported to the user only, in case at least one additional criterion is met, the at least one additional criterion comprising at least one of:
the incident is an incident of a predetermined category of incidents; the incident is an incident of a category of incidents selected by a user; the incident is at least of a predetermined severity; the incident is at least of a severity selected by a user; and the entity is of a minimum relevance for the company. 7. The method according to claim 1, further comprising, in case it is determined that the entity of the supply chain network is relevant for a shipment associated with the company, at least one of:
determining an action to be carried out in response to the incident; causing an action to be carried out in response to the incident; providing a suggestion of an action to be carried out in response to the incident to the user; determining alternative routes to be used for the shipment; and determining alternative routes to be used for the shipment based on data obtained from a database storing information on routes that have been taken successfully for previous shipments. 8. The method according to claim 1, the method comprising
in case it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network, determining whether the entity of the supply chain network is relevant for a shipment associated with any of a plurality of companies; and causing a reporting of the incident to a respective one of a plurality of users in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the supply chain network is relevant for a shipment associated with a respective company. 9. The method according to claim 1, wherein the supply chain network is a company specific supply chain network, the method comprising
determining for a plurality of companies whether the incident is located in an area that is defined to surround an entity of a company specific supply chain network of a respective company; in case it is determined that the incident is located in an area that is defined to surround an entity of at least one company specific supply chain network, determining whether the entity of the at least one company specific supply chain network is relevant for a shipment associated with the respective company of the at least one company specific supply chain network; and causing a reporting of the incident to a respective user in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the company specific supply chain network is relevant for a shipment associated with the respective company. 10. A system comprising at least one processor and at least one memory, the at least one memory storing a computer program, and the at least one memory and the computer program configured to cause at least one apparatus to perform at least the following, when the computer program is executed by the at least one processor:
receive an indication of an incident; determine whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and cause a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. 11. The system according to claim 10, wherein the at least one memory and the computer program are further configured to the at least one apparatus to perform at least one of:
make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network; make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network; make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network and wherein the data about the supply chain network results from a modelling of the company specific supply chain network based on shipments transported for the company in the past; and make use of data about shipments associated with the company stored in a shipment database of a logistics service provider as a basis for determining whether the entity of the supply chain network is relevant for a shipment associated with the company. 12. The system according to claim 10, wherein the entity of the supply chain network is relevant for a shipment associated with the company if at least one of:
a shipment associated with the company is present at the entity of the supply chain network; and a shipment associated with the company is scheduled to arrive at the entity of the supply chain network. 13. The system according to claim 10, wherein one of
the entity is a supply chain node and the area surrounding the supply chain node is a circular area with a predetermined radius; and the entity is a supply chain lane and the area surrounding the supply chain lane is a corridor of a predetermined width. 14. The system according to claim 10, wherein a size of the area surrounding the entity is defined by one of:
a default value; one of a plurality of default values predetermined for different severity levels of incidents; one of a plurality of default values predetermined for different types of entities; one of a plurality of default values predetermined for different categories of incidents; a value defined by a user; one of a plurality of values defined by a user for different severity levels of incidents; one of a plurality of values defined by a user for different types of entities; and one of a plurality of values defined by a user for different categories of incidents. 15. The system according to claim 10, wherein the incident is reported to the user only, in case at least one additional criterion is met, the at least one additional criterion comprising at least one of:
the incident is an incident of a predetermined category of incidents; the incident is an incident of a category of incidents selected by a user; the incident is at least of a predetermined severity; the incident is at least of a severity selected by a user; and the entity is of a minimum relevance for the company. 16. The system according to claim 10, wherein the at least one memory and the computer program are further configured to cause the at least one apparatus to perform at least one of the following, in case it is determined that the entity of the supply chain network is relevant for a shipment associated with the company:
determine an action to be carried out in response to the incident; cause an action to be carried out in response to the incident; provide a suggestion of an action to be carried out in response to the incident to the user; determine alternative routes to be used for the shipment; and determine alternative routes to be used for the shipment based on data obtained from a database storing information on routes that have been taken successfully for previous shipments. 17. The system according to claim 10, wherein the at least one memory and the computer program are configured to cause the at least one apparatus to perform the following:
in case it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network, determine whether the entity of the supply chain network is relevant for a shipment associated with any of a plurality of companies; and cause a reporting of the incident to a respective one of a plurality of users in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the supply chain network is relevant for a shipment associated with a respective company. 18. The system according to claim 10, wherein the supply chain network is a company specific supply chain network, and wherein the at least one memory and the computer program are configured to cause the at least one apparatus to perform the following:
determine for a plurality of companies whether the incident is located in an area that is defined to surround an entity of a company specific supply chain network of a respective company; in case it is determined that the incident is located in an area that is defined to surround an entity of at least one company specific supply chain network, determine whether the entity of the at least one company specific supply chain network is relevant for a shipment associated with the respective company of the at least one company specific supply chain network; and cause a reporting of the incident to a respective user in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the company specific supply chain network is relevant for a shipment associated with the respective company. 19. The system according to claim 10, wherein the system comprises one of:
an apparatus; a plurality of apparatuses; a server; and a component for a server. 20. A computer program product storing a computer program configured to cause at least one apparatus to perform the following when executed by at least one processor:
receive an indication of an incident; determine whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and cause a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. | When an indication of an incident is received, it may be determined whether the incident is located in an area that is defined to surround an entity of a supply chain network and whether the entity of the supply chain network is relevant for a shipment associated with a company. The entity is one of a supply chain node and a supply chain lane. A reporting of the incident to a user may be caused, in case at least one criterion is met. The at least one criterion comprises that it is determined that the incident is located in an area that is defined to surround an entity of the supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. A company may make use of the report for an incident monitoring.1. A method, performed by at least one apparatus, the method comprising:
receiving an indication of an incident; determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and causing a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. 2. The method according to claim 1, further comprising at least one of:
making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network; making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network; making use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network and wherein the data about the supply chain network results from a modelling of the company specific supply chain network based on shipments transported for the company in the past; and making use of data about shipments associated with the company stored in a shipment database of a logistics service provider as a basis for determining whether the entity of the supply chain network is relevant for a shipment associated with the company. 3. The method according to claim 1, wherein the entity of the supply chain network is relevant for a shipment associated with the company if at least one of:
a shipment associated with the company is present at the entity of the supply chain network; and a shipment associated with the company is scheduled to arrive at the entity of the supply chain network. 4. The method according to claim 1, wherein one of
the entity is a supply chain node and the area surrounding the supply chain node is a circular area with a predetermined radius; and the entity is a supply chain lane and the area surrounding the supply chain lane is a corridor of a predetermined width. 5. The method according to claim 1, wherein a size of the area surrounding the entity is defined by one of:
a default value; one of a plurality of default values predetermined for different severity levels of incidents; one of a plurality of default values predetermined for different types of entities; one of a plurality of default values predetermined for different categories of incidents; a value defined by a user; one of a plurality of values defined by a user for different severity levels of incidents; one of a plurality of values defined by a user for different types of entities; and one of a plurality of values defined by a user for different categories of incidents. 6. The method according to claim 1, wherein the incident is reported to the user only, in case at least one additional criterion is met, the at least one additional criterion comprising at least one of:
the incident is an incident of a predetermined category of incidents; the incident is an incident of a category of incidents selected by a user; the incident is at least of a predetermined severity; the incident is at least of a severity selected by a user; and the entity is of a minimum relevance for the company. 7. The method according to claim 1, further comprising, in case it is determined that the entity of the supply chain network is relevant for a shipment associated with the company, at least one of:
determining an action to be carried out in response to the incident; causing an action to be carried out in response to the incident; providing a suggestion of an action to be carried out in response to the incident to the user; determining alternative routes to be used for the shipment; and determining alternative routes to be used for the shipment based on data obtained from a database storing information on routes that have been taken successfully for previous shipments. 8. The method according to claim 1, the method comprising
in case it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network, determining whether the entity of the supply chain network is relevant for a shipment associated with any of a plurality of companies; and causing a reporting of the incident to a respective one of a plurality of users in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the supply chain network is relevant for a shipment associated with a respective company. 9. The method according to claim 1, wherein the supply chain network is a company specific supply chain network, the method comprising
determining for a plurality of companies whether the incident is located in an area that is defined to surround an entity of a company specific supply chain network of a respective company; in case it is determined that the incident is located in an area that is defined to surround an entity of at least one company specific supply chain network, determining whether the entity of the at least one company specific supply chain network is relevant for a shipment associated with the respective company of the at least one company specific supply chain network; and causing a reporting of the incident to a respective user in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the company specific supply chain network is relevant for a shipment associated with the respective company. 10. A system comprising at least one processor and at least one memory, the at least one memory storing a computer program, and the at least one memory and the computer program configured to cause at least one apparatus to perform at least the following, when the computer program is executed by the at least one processor:
receive an indication of an incident; determine whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and cause a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. 11. The system according to claim 10, wherein the at least one memory and the computer program are further configured to the at least one apparatus to perform at least one of:
make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network; make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network; make use of data about the supply chain network stored in a supply chain network database as a basis for determining whether the incident is located in an area that is defined to surround an entity of a supply chain network, wherein the supply chain network is a company specific supply chain network and wherein the data about the supply chain network results from a modelling of the company specific supply chain network based on shipments transported for the company in the past; and make use of data about shipments associated with the company stored in a shipment database of a logistics service provider as a basis for determining whether the entity of the supply chain network is relevant for a shipment associated with the company. 12. The system according to claim 10, wherein the entity of the supply chain network is relevant for a shipment associated with the company if at least one of:
a shipment associated with the company is present at the entity of the supply chain network; and a shipment associated with the company is scheduled to arrive at the entity of the supply chain network. 13. The system according to claim 10, wherein one of
the entity is a supply chain node and the area surrounding the supply chain node is a circular area with a predetermined radius; and the entity is a supply chain lane and the area surrounding the supply chain lane is a corridor of a predetermined width. 14. The system according to claim 10, wherein a size of the area surrounding the entity is defined by one of:
a default value; one of a plurality of default values predetermined for different severity levels of incidents; one of a plurality of default values predetermined for different types of entities; one of a plurality of default values predetermined for different categories of incidents; a value defined by a user; one of a plurality of values defined by a user for different severity levels of incidents; one of a plurality of values defined by a user for different types of entities; and one of a plurality of values defined by a user for different categories of incidents. 15. The system according to claim 10, wherein the incident is reported to the user only, in case at least one additional criterion is met, the at least one additional criterion comprising at least one of:
the incident is an incident of a predetermined category of incidents; the incident is an incident of a category of incidents selected by a user; the incident is at least of a predetermined severity; the incident is at least of a severity selected by a user; and the entity is of a minimum relevance for the company. 16. The system according to claim 10, wherein the at least one memory and the computer program are further configured to cause the at least one apparatus to perform at least one of the following, in case it is determined that the entity of the supply chain network is relevant for a shipment associated with the company:
determine an action to be carried out in response to the incident; cause an action to be carried out in response to the incident; provide a suggestion of an action to be carried out in response to the incident to the user; determine alternative routes to be used for the shipment; and determine alternative routes to be used for the shipment based on data obtained from a database storing information on routes that have been taken successfully for previous shipments. 17. The system according to claim 10, wherein the at least one memory and the computer program are configured to cause the at least one apparatus to perform the following:
in case it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network, determine whether the entity of the supply chain network is relevant for a shipment associated with any of a plurality of companies; and cause a reporting of the incident to a respective one of a plurality of users in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the supply chain network is relevant for a shipment associated with a respective company. 18. The system according to claim 10, wherein the supply chain network is a company specific supply chain network, and wherein the at least one memory and the computer program are configured to cause the at least one apparatus to perform the following:
determine for a plurality of companies whether the incident is located in an area that is defined to surround an entity of a company specific supply chain network of a respective company; in case it is determined that the incident is located in an area that is defined to surround an entity of at least one company specific supply chain network, determine whether the entity of the at least one company specific supply chain network is relevant for a shipment associated with the respective company of the at least one company specific supply chain network; and cause a reporting of the incident to a respective user in case at least one criterion is met, the at least one criterion comprising that it is determined that the entity of the company specific supply chain network is relevant for a shipment associated with the respective company. 19. The system according to claim 10, wherein the system comprises one of:
an apparatus; a plurality of apparatuses; a server; and a component for a server. 20. A computer program product storing a computer program configured to cause at least one apparatus to perform the following when executed by at least one processor:
receive an indication of an incident; determine whether the incident is located in an area that is defined to surround an entity of a supply chain network, the entity being one of a supply chain node and a supply chain lane, and whether the entity of the supply chain network is relevant for a shipment associated with a company; and cause a reporting of the incident to a user in case at least one criterion is met, the at least one criterion comprising that it is determined that the incident is located in an area that is defined to surround an entity of a supply chain network and that the entity of the supply chain network is relevant for a shipment associated with the company. | 3,600 |
13,537 | 13,537 | 14,413,484 | 3,619 | An exemplary elevator guiderail includes a metal sheet bent into a configuration that establishes at least one mounting portion configured to facilitate mounting the guiderail within an elevator hoistway. At least one guiding portion is configured to guide movement of an elevator car along the guiderail. The metal sheet includes an exterior surface treated to resist corrosion. A cover over at least some of the guiding surface has an exterior that is different than the exterior surface of the metal sheet. The cover is configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car along the guiderail. | 1. An elevator guide rail, comprising:
a metal sheet comprising a first metal bent into a configuration that establishes at least one mounting portion configured to facilitate mounting the guiderail within an elevator hoistway and at least one guiding portion configured to guide movement of an elevator car or counterweight along the guiderail, the metal sheet including an exterior surface treated to resist corrosion; and a cover over at least some of the guiding surface, the cover comprising a second, different metal having an exterior that is different than the exterior surface of the metal sheet, the cover exterior being configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car or counterweight along the guiderail. 2. The elevator guide rail of claim 1, wherein
the guiding portion comprises two guiding segments of the metal sheet parallel to each other with the exterior surface of the two guiding segments facing in opposite directions; and the mounting portion comprises at least one mounting segment of the metal sheet that is situated generally perpendicular to the guiding segments. 3. The elevator guide rail of claim 2, wherein there are two mounting segments spaced from each other. 4. The elevator guide rail of claim 2, wherein there are two intermediate segments, each intermediate segment being between one of the guiding segments and the at least one mounting segment, the intermediate segments being situated at an oblique angle relative to the guiding segments. 5. The elevator guide rail of claim 4, wherein there is a single mounting segment that extends between the intermediate segments. 6. The elevator guide rail of claim 4,
wherein one mounting segment is at an end of one of the intermediate segments and another mounting segment is at an end of the other of the intermediate segments. 7. The elevator guide rail of claim 6, comprising a strengthening segment at an end of each of the mounting segments, the strengthening segments being generally parallel to the guiding segments. 8. The elevator guide rail of claim 1, wherein
the metal sheet comprises galvanized steel; and the cover comprises at least one of cold rolled metal, hot rolled metal, pickled and oiled metal or oil coated metal. 9. The elevator guide rail of claim 1, wherein
the cover comprises at least one sheet of metal secured to at least a portion of the guiding portion. 10. The elevator guide rail of claim 9, wherein the cover comprises a bent sheet of metal having
a first cover segment on one side of the guiding portion, a second cover segment generally perpendicular to the first cover segment, and a third cover segment generally parallel to the first cover segment, the third cover segment being on another side of the guiding portion that faces in an opposite direction from the one side. 11. The elevator guide rail of claim 9, wherein the cover comprises two sheets that are each secured to a distinct surface of the guiding portion. 12. A method of making an elevator guide rail, comprising the steps of:
(A) bending a metal sheet comprising a first metal to establish a guiding portion from at least a guiding segment of the metal sheet, the guiding portion being configured to guide movement of an elevator car or counterweight along the guiderail and a mounting portion from at least a mounting segment of the metal sheet, the mounting portion being configured to facilitate mounting the guiderail within an elevator hoistway; and (B) securing a cover comprising a second, different metal to at least the guiding portion during step (A). 13. The method of claim 12, wherein step (B) includes bending the cover into position over the guiding portion. 14. The method of claim 12, wherein step (B) comprises adhesively securing the cover to the guiding portion. 15. The method of claim 12, wherein
the metal sheet includes an exterior surface treated to resist corrosion; and the cover includes an exterior that is different than the exterior surface of the metal sheet, the cover exterior being configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car along the guiderail. 16. The method of claim 12, wherein step (A) comprises
bending the metal sheet at a first location a selected distance from one edge of the metal sheet to thereby establish a guiding segment of the metal sheet between the first location and the one edge; bending the metal sheet at a second location a selected distance from the first location to thereby establish an intermediate segment between the first location and the second location, the intermediate segment being at an oblique angle relative to the guiding segment; bending the metal sheet at a third location a selected distance from the second location to thereby establish a mounting segment between the second location and the third location, the mounting segment being generally perpendicular to the guiding segment; bending the metal sheet at a fourth location a selected distance from the third location to thereby establish a second intermediate segment between the third location and the fourth location, the second intermediate segment being at an oblique angle relative to the mounting segment; and bending the metal sheet at a fifth location a selected distance from the fourth location to thereby establish a second guiding segment between the fifth location and another edge of the metal sheet, the second guiding segment being parallel to the guiding segment between the first location and the one edge. 17. The method of claim 12, wherein step (A) comprises
bending the metal sheet at a first location a selected distance from one edge of the metal sheet to thereby establish a first mounting segment of the metal sheet between the first location and the one edge; bending the metal sheet at a second location a selected distance from the first location to thereby establish an intermediate segment between the first location and the second location, the intermediate segment being at an oblique angle relative to the first mounting segment; bending the metal sheet at a third location a selected distance from the second location to thereby establish a first guiding segment between the second location and the third location, the first guiding segment being generally perpendicular to the first mounting segment; bending the metal sheet at a fourth location a selected distance from the third location to thereby establish a second guiding segment between the third location and the fourth location, the second guiding segment being parallel to the first guiding segment; and bending the metal sheet at a fifth location a selected distance from the fourth location to thereby establish a second intermediate segment between the fourth location and the fifth location and a second mounting segment between the fifth location and another edge of the metal sheet, the second intermediate segment being at an oblique angle relative to the second guiding segment, the second mounting segment being generally parallel with the first mounting segment. 18. The method of claim 17, comprising
making an additional bend in the metal sheet at a selected location on each mounting portion to thereby establish a strengthening segment between each additional bend and the corresponding edge of the metal sheet, wherein the strengthening segments are generally perpendicular to the mounting portions. 19. The method of claim 12, comprising
positioning a sheet of cover material adjacent the metal sheet; and simultaneously establishing at least one bend in each of the sheet of cover material and the metal sheet. 20. A method of installing an elevator guide rail, comprising the steps of:
(A) bending a metal sheet comprising a first metal to establish a guiding portion from at least a guiding segment of the metal sheet, the guiding portion being configured to guide movement of an elevator car along the guiderail and a mounting portion from at least a mounting segment of the metal sheet, the mounting portion being configured to facilitate mounting the guiderail within an elevator hoistway; (B) situating the bent metal sheet in a desired orientation at a site of an elevator system that is to include the guide rail; and (C) securing a cover comprising a second, different metal to at least the guiding portion while the bent metal sheet is at the site of the elevator system. | An exemplary elevator guiderail includes a metal sheet bent into a configuration that establishes at least one mounting portion configured to facilitate mounting the guiderail within an elevator hoistway. At least one guiding portion is configured to guide movement of an elevator car along the guiderail. The metal sheet includes an exterior surface treated to resist corrosion. A cover over at least some of the guiding surface has an exterior that is different than the exterior surface of the metal sheet. The cover is configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car along the guiderail.1. An elevator guide rail, comprising:
a metal sheet comprising a first metal bent into a configuration that establishes at least one mounting portion configured to facilitate mounting the guiderail within an elevator hoistway and at least one guiding portion configured to guide movement of an elevator car or counterweight along the guiderail, the metal sheet including an exterior surface treated to resist corrosion; and a cover over at least some of the guiding surface, the cover comprising a second, different metal having an exterior that is different than the exterior surface of the metal sheet, the cover exterior being configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car or counterweight along the guiderail. 2. The elevator guide rail of claim 1, wherein
the guiding portion comprises two guiding segments of the metal sheet parallel to each other with the exterior surface of the two guiding segments facing in opposite directions; and the mounting portion comprises at least one mounting segment of the metal sheet that is situated generally perpendicular to the guiding segments. 3. The elevator guide rail of claim 2, wherein there are two mounting segments spaced from each other. 4. The elevator guide rail of claim 2, wherein there are two intermediate segments, each intermediate segment being between one of the guiding segments and the at least one mounting segment, the intermediate segments being situated at an oblique angle relative to the guiding segments. 5. The elevator guide rail of claim 4, wherein there is a single mounting segment that extends between the intermediate segments. 6. The elevator guide rail of claim 4,
wherein one mounting segment is at an end of one of the intermediate segments and another mounting segment is at an end of the other of the intermediate segments. 7. The elevator guide rail of claim 6, comprising a strengthening segment at an end of each of the mounting segments, the strengthening segments being generally parallel to the guiding segments. 8. The elevator guide rail of claim 1, wherein
the metal sheet comprises galvanized steel; and the cover comprises at least one of cold rolled metal, hot rolled metal, pickled and oiled metal or oil coated metal. 9. The elevator guide rail of claim 1, wherein
the cover comprises at least one sheet of metal secured to at least a portion of the guiding portion. 10. The elevator guide rail of claim 9, wherein the cover comprises a bent sheet of metal having
a first cover segment on one side of the guiding portion, a second cover segment generally perpendicular to the first cover segment, and a third cover segment generally parallel to the first cover segment, the third cover segment being on another side of the guiding portion that faces in an opposite direction from the one side. 11. The elevator guide rail of claim 9, wherein the cover comprises two sheets that are each secured to a distinct surface of the guiding portion. 12. A method of making an elevator guide rail, comprising the steps of:
(A) bending a metal sheet comprising a first metal to establish a guiding portion from at least a guiding segment of the metal sheet, the guiding portion being configured to guide movement of an elevator car or counterweight along the guiderail and a mounting portion from at least a mounting segment of the metal sheet, the mounting portion being configured to facilitate mounting the guiderail within an elevator hoistway; and (B) securing a cover comprising a second, different metal to at least the guiding portion during step (A). 13. The method of claim 12, wherein step (B) includes bending the cover into position over the guiding portion. 14. The method of claim 12, wherein step (B) comprises adhesively securing the cover to the guiding portion. 15. The method of claim 12, wherein
the metal sheet includes an exterior surface treated to resist corrosion; and the cover includes an exterior that is different than the exterior surface of the metal sheet, the cover exterior being configured to establish a coefficient of friction to facilitate brake engagement with the cover for resisting movement of an elevator car along the guiderail. 16. The method of claim 12, wherein step (A) comprises
bending the metal sheet at a first location a selected distance from one edge of the metal sheet to thereby establish a guiding segment of the metal sheet between the first location and the one edge; bending the metal sheet at a second location a selected distance from the first location to thereby establish an intermediate segment between the first location and the second location, the intermediate segment being at an oblique angle relative to the guiding segment; bending the metal sheet at a third location a selected distance from the second location to thereby establish a mounting segment between the second location and the third location, the mounting segment being generally perpendicular to the guiding segment; bending the metal sheet at a fourth location a selected distance from the third location to thereby establish a second intermediate segment between the third location and the fourth location, the second intermediate segment being at an oblique angle relative to the mounting segment; and bending the metal sheet at a fifth location a selected distance from the fourth location to thereby establish a second guiding segment between the fifth location and another edge of the metal sheet, the second guiding segment being parallel to the guiding segment between the first location and the one edge. 17. The method of claim 12, wherein step (A) comprises
bending the metal sheet at a first location a selected distance from one edge of the metal sheet to thereby establish a first mounting segment of the metal sheet between the first location and the one edge; bending the metal sheet at a second location a selected distance from the first location to thereby establish an intermediate segment between the first location and the second location, the intermediate segment being at an oblique angle relative to the first mounting segment; bending the metal sheet at a third location a selected distance from the second location to thereby establish a first guiding segment between the second location and the third location, the first guiding segment being generally perpendicular to the first mounting segment; bending the metal sheet at a fourth location a selected distance from the third location to thereby establish a second guiding segment between the third location and the fourth location, the second guiding segment being parallel to the first guiding segment; and bending the metal sheet at a fifth location a selected distance from the fourth location to thereby establish a second intermediate segment between the fourth location and the fifth location and a second mounting segment between the fifth location and another edge of the metal sheet, the second intermediate segment being at an oblique angle relative to the second guiding segment, the second mounting segment being generally parallel with the first mounting segment. 18. The method of claim 17, comprising
making an additional bend in the metal sheet at a selected location on each mounting portion to thereby establish a strengthening segment between each additional bend and the corresponding edge of the metal sheet, wherein the strengthening segments are generally perpendicular to the mounting portions. 19. The method of claim 12, comprising
positioning a sheet of cover material adjacent the metal sheet; and simultaneously establishing at least one bend in each of the sheet of cover material and the metal sheet. 20. A method of installing an elevator guide rail, comprising the steps of:
(A) bending a metal sheet comprising a first metal to establish a guiding portion from at least a guiding segment of the metal sheet, the guiding portion being configured to guide movement of an elevator car along the guiderail and a mounting portion from at least a mounting segment of the metal sheet, the mounting portion being configured to facilitate mounting the guiderail within an elevator hoistway; (B) situating the bent metal sheet in a desired orientation at a site of an elevator system that is to include the guide rail; and (C) securing a cover comprising a second, different metal to at least the guiding portion while the bent metal sheet is at the site of the elevator system. | 3,600 |
13,538 | 13,538 | 13,717,541 | 3,621 | Advertisements in a social networking system may be targeted to searching users in relation with a real-time search engine operated by a social networking system. Ads are targeted to users based in part on social information included in a structured search query and/or search results on a page. In a typeahead search, a user of the social networking system may receive prefix search results of objects in the search box. The prefix search results are ranked by relevance to the user, and advertisers may bid for particular objects to increase their ranking in the results list. An option may be provided to a viewer of search query results to buy an ad that would be seen by other users who performed the same search query, received a targeted search result, or based on targeting criteria as determined by the viewer bidding on the ad. | 1. A method comprising:
receiving a plurality of ad requests, where the plurality of ad requests include targeting criteria that specify the corresponding ad be displayed where a search result includes a particular object in a social networking system; receiving a query by a social networking system, the query received from a user of the social networking system; determining a plurality of search results based on the received query; retrieving a plurality of advertisements targeting the plurality of search results; and selecting an advertisement from the retrieved plurality of advertisements based, in part, on the determined plurality of search results including the particular object. 2. The method of claim 1, further comprising:
retrieving information about a plurality of connections of the user, wherein selecting the advertisement is further based on the retrieved information about the plurality of connections of the user. 3. The method of claim 1, wherein receiving a query by a social networking system comprises:
receiving the query through an application programming interface (API) through the social networking system. 4. The method of claim 1, wherein receiving a query by a social networking system comprises:
receiving the query through a user interface hosted on an external system outside of the social networking system, the user interface communicatively coupled to the social networking system. 5. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through an iFrame. 6. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through a social plugin. 7. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through a native application programming interface (API). 8. The method of claim 1, wherein retrieving a plurality of advertisements targeting the plurality of search results comprises:
determining a plurality of keywords included in the plurality of search results; and retrieving a plurality of advertisements having targeting criteria that include at least one keyword of the determined plurality of keywords included in the plurality of search results. 9. The method of claim 1, wherein retrieving a plurality of advertisements targeting the plurality of search results comprises:
determining one or more object types of a plurality of objects in the social networking system included in the plurality of search results; and retrieving a plurality of advertisements having targeting criteria that include at least one object type of the determined one or more object types of the plurality of objects included in the plurality of search results. 10. The method of claim 9, wherein the retrieved plurality of advertisements target a type of object included in the plurality of search results, the type of object selected from the group consisting of an event type, a user type, an entity type, an application type, a group type, a topic type, and a page type. 11. The method of claim 1, wherein selecting an advertisement from the retrieved plurality of advertisements based in part on the determined plurality of search results including the particular object comprises:
determining a plurality of expected values of the retrieved plurality of advertisements based on information about the user; and selecting an advertisement from the retrieved plurality of advertisements based, in part, on the determined plurality of expected values. 12. The method of claim 1, further comprising:
providing the selected advertisement for display to the user. 13. A method comprising:
receiving a query in a social networking system, the query comprising one or more terms from a user of the social networking system; determining a plurality of search results based on the received query; retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query; selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements; and providing the selected advertisement for display to the user. 14. The method of claim 13, further comprising:
retrieving information about a plurality of connections of the user, wherein selecting the advertisement is further based on the retrieved information about the plurality of connections of the user. 15. The method of claim 13, wherein retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query comprises:
retrieving a plurality of advertisements having targeting criteria that include at least one term of the one or more terms in the received query. 16. The method of claim 13, wherein retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query comprises:
determining one or more object types of a plurality of objects in the social networking system represented by the one or more terms in the received query; and retrieving a plurality of advertisements having targeting criteria that include at least one object type of the determined one or more object types of the plurality of objects represented by the one or more terms in the received query. 17. The method of claim 13, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements comprises:
determining one or more object types of a plurality of objects in the social networking system corresponding to at least one of the determined plurality of search results; and selecting an advertisement from the plurality of advertisements, where the selected advertisement targets at least one object type of the determined one or more object types of the plurality of objects corresponding to at least one of the determined plurality of search results. 18. The method of claim 13, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements comprises:
determining one or more objects in the social networking system corresponding to at least one of the determined plurality of search results; and selecting an advertisement from the plurality of advertisements, where the selected advertisement targets at least one object of the determined one or more objects corresponding to at least one of the determined plurality of search results. 19. A method comprising:
receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system; determining a plurality of search results based on the received search query; retrieving a plurality of advertisements targeting a particular object included in the plurality of search results; selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results; and providing the selected advertisement responsive to the request. 20. The method of claim 19, wherein receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system further comprises:
receiving the request for an advertisement through an application programming interface (API) from an external system outside of the social networking system. 21. The method of claim 19, wherein receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system further comprises:
receiving the search query through an application programming interface (API) from an external system outside of the social networking system. 22. The method of claim 19, wherein determining a plurality of search results based on the received search query comprises:
determining a structured query based on the received search query, where the structured query includes identifying information of one or more objects in the social networking system; and determining the plurality of search results based on processing the structured query using a search engine on the social networking system. 23. The method of claim 19, wherein determining a plurality of search results based on the received search query comprises:
determining the plurality of search results based on processing the received search query using a search engine on the social networking system. 24. The method of claim 19, wherein retrieving a plurality of advertisements targeting one or more terms about the plurality of search results comprises:
determining the one or more terms about the plurality of search results; and retrieving the plurality of advertisements based on the determined one or more terms about the plurality of search results. 25. The method of claim 19, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results comprises:
retrieving one or more information items about the user; determining a plurality of scores for the retrieved plurality of advertisements based on the retrieved one or more information items about the user; and selecting an advertisement from the plurality of advertisements based on the determined plurality of scores for the retrieved plurality of advertisements. | Advertisements in a social networking system may be targeted to searching users in relation with a real-time search engine operated by a social networking system. Ads are targeted to users based in part on social information included in a structured search query and/or search results on a page. In a typeahead search, a user of the social networking system may receive prefix search results of objects in the search box. The prefix search results are ranked by relevance to the user, and advertisers may bid for particular objects to increase their ranking in the results list. An option may be provided to a viewer of search query results to buy an ad that would be seen by other users who performed the same search query, received a targeted search result, or based on targeting criteria as determined by the viewer bidding on the ad.1. A method comprising:
receiving a plurality of ad requests, where the plurality of ad requests include targeting criteria that specify the corresponding ad be displayed where a search result includes a particular object in a social networking system; receiving a query by a social networking system, the query received from a user of the social networking system; determining a plurality of search results based on the received query; retrieving a plurality of advertisements targeting the plurality of search results; and selecting an advertisement from the retrieved plurality of advertisements based, in part, on the determined plurality of search results including the particular object. 2. The method of claim 1, further comprising:
retrieving information about a plurality of connections of the user, wherein selecting the advertisement is further based on the retrieved information about the plurality of connections of the user. 3. The method of claim 1, wherein receiving a query by a social networking system comprises:
receiving the query through an application programming interface (API) through the social networking system. 4. The method of claim 1, wherein receiving a query by a social networking system comprises:
receiving the query through a user interface hosted on an external system outside of the social networking system, the user interface communicatively coupled to the social networking system. 5. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through an iFrame. 6. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through a social plugin. 7. The method of claim 4, wherein the user interface hosted on the external system is communicatively coupled to the social networking system through a native application programming interface (API). 8. The method of claim 1, wherein retrieving a plurality of advertisements targeting the plurality of search results comprises:
determining a plurality of keywords included in the plurality of search results; and retrieving a plurality of advertisements having targeting criteria that include at least one keyword of the determined plurality of keywords included in the plurality of search results. 9. The method of claim 1, wherein retrieving a plurality of advertisements targeting the plurality of search results comprises:
determining one or more object types of a plurality of objects in the social networking system included in the plurality of search results; and retrieving a plurality of advertisements having targeting criteria that include at least one object type of the determined one or more object types of the plurality of objects included in the plurality of search results. 10. The method of claim 9, wherein the retrieved plurality of advertisements target a type of object included in the plurality of search results, the type of object selected from the group consisting of an event type, a user type, an entity type, an application type, a group type, a topic type, and a page type. 11. The method of claim 1, wherein selecting an advertisement from the retrieved plurality of advertisements based in part on the determined plurality of search results including the particular object comprises:
determining a plurality of expected values of the retrieved plurality of advertisements based on information about the user; and selecting an advertisement from the retrieved plurality of advertisements based, in part, on the determined plurality of expected values. 12. The method of claim 1, further comprising:
providing the selected advertisement for display to the user. 13. A method comprising:
receiving a query in a social networking system, the query comprising one or more terms from a user of the social networking system; determining a plurality of search results based on the received query; retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query; selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements; and providing the selected advertisement for display to the user. 14. The method of claim 13, further comprising:
retrieving information about a plurality of connections of the user, wherein selecting the advertisement is further based on the retrieved information about the plurality of connections of the user. 15. The method of claim 13, wherein retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query comprises:
retrieving a plurality of advertisements having targeting criteria that include at least one term of the one or more terms in the received query. 16. The method of claim 13, wherein retrieving a plurality of advertisements having targeting criteria relevant to the one or more terms in the received query comprises:
determining one or more object types of a plurality of objects in the social networking system represented by the one or more terms in the received query; and retrieving a plurality of advertisements having targeting criteria that include at least one object type of the determined one or more object types of the plurality of objects represented by the one or more terms in the received query. 17. The method of claim 13, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements comprises:
determining one or more object types of a plurality of objects in the social networking system corresponding to at least one of the determined plurality of search results; and selecting an advertisement from the plurality of advertisements, where the selected advertisement targets at least one object type of the determined one or more object types of the plurality of objects corresponding to at least one of the determined plurality of search results. 18. The method of claim 13, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results and the targeting criteria of the plurality of advertisements comprises:
determining one or more objects in the social networking system corresponding to at least one of the determined plurality of search results; and selecting an advertisement from the plurality of advertisements, where the selected advertisement targets at least one object of the determined one or more objects corresponding to at least one of the determined plurality of search results. 19. A method comprising:
receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system; determining a plurality of search results based on the received search query; retrieving a plurality of advertisements targeting a particular object included in the plurality of search results; selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results; and providing the selected advertisement responsive to the request. 20. The method of claim 19, wherein receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system further comprises:
receiving the request for an advertisement through an application programming interface (API) from an external system outside of the social networking system. 21. The method of claim 19, wherein receiving a request for an advertisement and a search query comprising one or more terms representing one or more objects in a social networking system further comprises:
receiving the search query through an application programming interface (API) from an external system outside of the social networking system. 22. The method of claim 19, wherein determining a plurality of search results based on the received search query comprises:
determining a structured query based on the received search query, where the structured query includes identifying information of one or more objects in the social networking system; and determining the plurality of search results based on processing the structured query using a search engine on the social networking system. 23. The method of claim 19, wherein determining a plurality of search results based on the received search query comprises:
determining the plurality of search results based on processing the received search query using a search engine on the social networking system. 24. The method of claim 19, wherein retrieving a plurality of advertisements targeting one or more terms about the plurality of search results comprises:
determining the one or more terms about the plurality of search results; and retrieving the plurality of advertisements based on the determined one or more terms about the plurality of search results. 25. The method of claim 19, wherein selecting an advertisement from the retrieved plurality of advertisements based on the determined plurality of search results comprises:
retrieving one or more information items about the user; determining a plurality of scores for the retrieved plurality of advertisements based on the retrieved one or more information items about the user; and selecting an advertisement from the plurality of advertisements based on the determined plurality of scores for the retrieved plurality of advertisements. | 3,600 |
13,539 | 13,539 | 14,235,261 | 3,688 | A method includes for late content qualification includes obtaining metadata and content for each of a plurality of publications. The availability of the plurality of products for production is advertised without first confirming that content for any of the plurality of publications can be qualified. An attempt is made to qualify content for an ordered one of the publications having been advertised. The order is fulfilled with qualified content only if the attempt is successful. | 1. A method for late content qualification, comprising:
obtaining metadata and content for each of a plurality of publications: advertising the availability of the plurality of products for production without first confirming that content for any of the plurality of publications can be qualified; attempting to qualify content for an ordered one of the publications having been advertised; and fulfilling the order with qualified content only if the attempt is successful. 2. The method of claim 1, comprising performing a sanity check on the content for each of the plurality of publications and wherein advertising comprises advertising only those of the plurality of publications whose content passes the sanity check. 3. The method of claim 1, comprising receiving the order for the one of the plurality of publications, and wherein attempting to qualify content comprises, in response to the order, ingesting the content for the ordered publication and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 4. The method of claim 3, wherein ingesting comprises characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 5. The method of claim 3, wherein fulfilling comprises:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, communicating a production instruction for the content and communicating the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, communicating a rejection of the order for the one of the plurality of publications. 6. A system comprising a catalog service and a content service, wherein:
the catalog service is configured to obtain metadata for each of a plurality of publications and to advertise the availability of the plurality of publications for production without first confirming that content for any of the plurality of publications can be qualified: and the content service is configured to obtain, content for the plurality of publications, attempt to qualify content for an ordered one of the publications having been advertised by the catalog service, and to fulfill the order with qualified content only if the attempt is successful. 7. The system of claim 6, wherein the content service includes an order distribution service and a content distribution service, wherein:
the order distribution is configured to receive an order for the one of the plurality of publications and, in response, communicate a request to ingest the content for the ordered publication to the content distribution service; and the content distribution service is configured to qualify the content for the ordered publication by ingesting, the content and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 8. The system of claim 7, wherein the content distribution service is configured to ingest the content by characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 9. The system of claim 7, herein:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, the order distribution service is operable to communicate a production instruction for the content and the content distribution service is configured to communicate the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, the order distribution service is configured to reject the order for the one of the plurality of publications. 10. The system of claim 9, wherein upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, the catalog service is configured to stop advertising that publication as being available for publication. 11. A computer readable medium having instructions stored thereon that when executed by a processor implement a method comprising:
obtaining metadata and content for each of a plurality of publications advertising the availability of the plurality of publications for production without first confirming that content for any of the plurality of publications can be qualified; and attempting to qualify content for an ordered one of the publications having been advertised; and fulfilling the order with qualified content only if the attempt is successful. 12. The medium of claim 11, wherein the method comprises receiving the order for the one of the plurality of publications, and wherein attempting to qualify content comprises, in response to the order, ingesting the content for the ordered publication and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 13. The medium of claim 12, wherein ingesting comprises characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 14. The medium of claim 12, wherein fulfilling comprises:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, communicating a production instruction for the content and communicating the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, communicating a rejection of the order for the one of the plurality of publications. 15. The medium of claim 14, wherein the method comprises, upon a determination that the content can be used to produce the ordered publication at or above the predetermined standard, identifying the publication as qualified and, in response to a subsequent order for the publication, communicating a subsequent production instruction for the publication without first requesting that the content distribution service ingest the content for the ordered publication. | A method includes for late content qualification includes obtaining metadata and content for each of a plurality of publications. The availability of the plurality of products for production is advertised without first confirming that content for any of the plurality of publications can be qualified. An attempt is made to qualify content for an ordered one of the publications having been advertised. The order is fulfilled with qualified content only if the attempt is successful.1. A method for late content qualification, comprising:
obtaining metadata and content for each of a plurality of publications: advertising the availability of the plurality of products for production without first confirming that content for any of the plurality of publications can be qualified; attempting to qualify content for an ordered one of the publications having been advertised; and fulfilling the order with qualified content only if the attempt is successful. 2. The method of claim 1, comprising performing a sanity check on the content for each of the plurality of publications and wherein advertising comprises advertising only those of the plurality of publications whose content passes the sanity check. 3. The method of claim 1, comprising receiving the order for the one of the plurality of publications, and wherein attempting to qualify content comprises, in response to the order, ingesting the content for the ordered publication and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 4. The method of claim 3, wherein ingesting comprises characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 5. The method of claim 3, wherein fulfilling comprises:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, communicating a production instruction for the content and communicating the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, communicating a rejection of the order for the one of the plurality of publications. 6. A system comprising a catalog service and a content service, wherein:
the catalog service is configured to obtain metadata for each of a plurality of publications and to advertise the availability of the plurality of publications for production without first confirming that content for any of the plurality of publications can be qualified: and the content service is configured to obtain, content for the plurality of publications, attempt to qualify content for an ordered one of the publications having been advertised by the catalog service, and to fulfill the order with qualified content only if the attempt is successful. 7. The system of claim 6, wherein the content service includes an order distribution service and a content distribution service, wherein:
the order distribution is configured to receive an order for the one of the plurality of publications and, in response, communicate a request to ingest the content for the ordered publication to the content distribution service; and the content distribution service is configured to qualify the content for the ordered publication by ingesting, the content and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 8. The system of claim 7, wherein the content distribution service is configured to ingest the content by characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 9. The system of claim 7, herein:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, the order distribution service is operable to communicate a production instruction for the content and the content distribution service is configured to communicate the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, the order distribution service is configured to reject the order for the one of the plurality of publications. 10. The system of claim 9, wherein upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, the catalog service is configured to stop advertising that publication as being available for publication. 11. A computer readable medium having instructions stored thereon that when executed by a processor implement a method comprising:
obtaining metadata and content for each of a plurality of publications advertising the availability of the plurality of publications for production without first confirming that content for any of the plurality of publications can be qualified; and attempting to qualify content for an ordered one of the publications having been advertised; and fulfilling the order with qualified content only if the attempt is successful. 12. The medium of claim 11, wherein the method comprises receiving the order for the one of the plurality of publications, and wherein attempting to qualify content comprises, in response to the order, ingesting the content for the ordered publication and determining if the ingested content can be used to produce the ordered publication at or above a predetermined standard. 13. The medium of claim 12, wherein ingesting comprises characterizing the content and, if indicated by the characterization, converting the content to a format from which it can be used to produce the publication. 14. The medium of claim 12, wherein fulfilling comprises:
upon a determination that the content can be used to produce the publication at or above the predetermined standard, communicating a production instruction for the content and communicating the ingested content for use in producing the ordered publication according to the production instruction; and upon a determination that the content cannot be used to produce the ordered publication at or above the predetermined standard, communicating a rejection of the order for the one of the plurality of publications. 15. The medium of claim 14, wherein the method comprises, upon a determination that the content can be used to produce the ordered publication at or above the predetermined standard, identifying the publication as qualified and, in response to a subsequent order for the publication, communicating a subsequent production instruction for the publication without first requesting that the content distribution service ingest the content for the ordered publication. | 3,600 |
13,540 | 13,540 | 14,636,467 | 3,685 | A mobile computing device has a processor and a memory. The processor is programmed with a mobile transaction application 101. The memory comprises a local database 102 to hold data items for use by the mobile transaction application 101. The mobile transaction application 101 is adapted to encrypt data items for storage in the local database 102 and to decrypt data items stored in the local database 102 using white-box cryptographic techniques. | 1. A mobile computing device having a processor and a memory, wherein the processor is programmed with a mobile transaction application, wherein:
the memory comprises a local database to hold data items for use by the mobile transaction application; wherein the mobile transaction application is adapted to encrypt data items for storage in the local database and to decrypt data items stored in the local database using white-box cryptographic techniques. 2. A mobile computing device as claimed in claim 1, wherein an entry in the local database comprises an index and an encrypted parameter for use by the mobile transaction algorithm. 3. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is adapted to use static white-box cryptography and uses a key derivation algorithm in encryption and storage of data in the local encrypted database. 4. A mobile computing device as claimed in claim 3, wherein an entry in the local database further comprises an application sequence counter to indicate a transaction in which an operation associated with the entry was performed. 5. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is adapted to use dynamic white-box cryptography and uses a key transportation algorithm in encryption and storage of data in the local encrypted database. 6. A mobile computing device as claimed in claim 5, wherein an entry in the local database comprises an index and an encrypted parameter for use by the mobile transaction algorithm and wherein an entry in the local database further comprises an encrypted key for that entry. 7. A mobile computing device as claimed in claim 5, wherein the mobile transaction application communicates with a server adapted to secure one or more parameters used by the mobile transaction application. 8. A mobile computing device as claimed in claim 1, wherein the mobile transaction application and the local database are protected by software obfuscation. 9. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is downloaded to the mobile computing device without customisation to the mobile computing device or its user. 10. A mobile computing device as claimed in claim 9, wherein on installation or initialization, the mobile transaction application is customised to the mobile computing device or its user. 11. A mobile computing device as claimed in claim 1, wherein the mobile computing device is adapted to act as a payment device and wherein the mobile transaction application is a payment application. 12. A mobile computing device as claimed in claim 11 wherein the mobile computing device is adapted to emulate a contactless payment card. 13. A mobile computing device as claimed in claim 1, wherein the mobile computing device is or comprises a mobile telephone. 14. A method of operating a mobile transaction application at a mobile computing device, wherein the mobile computing device comprises a processor adapted to execute the mobile transaction application and a memory comprising a local database to hold data items for use by the mobile transaction application, the method comprising:
identifying one or more data items for storage in or retrieval from the local database; and either encrypt the one or more data items for storage in the local database using white-box cryptographic techniques, or decrypt the one or more data items stored in the local database using white-box cryptographic techniques. 15. The method of claim 14, wherein the mobile transaction application uses static white-box cryptography and uses a key derivation algorithm in encryption and storage of data in the local encrypted database. 16. The method of claim 14, wherein the mobile transaction application uses dynamic white-box cryptography and uses a key transportation algorithm in encryption and storage of data in the local encrypted database. 17. The method of claim 14, wherein the mobile transaction application and the local database are protected by software obfuscation. 18. The method of claim 14, further comprising:
downloading the mobile transaction application to the mobile computing device without customisation to the mobile computing device or its user; and on installation or initialization, customising the mobile transaction application to the mobile computing device or its user. 19. The method of claim 14, wherein the mobile computing device is adapted to act as a payment device and wherein the mobile transaction application is a payment application. 20. The method of claim 19, wherein the mobile computing device is adapted to emulate a contactless payment card. | A mobile computing device has a processor and a memory. The processor is programmed with a mobile transaction application 101. The memory comprises a local database 102 to hold data items for use by the mobile transaction application 101. The mobile transaction application 101 is adapted to encrypt data items for storage in the local database 102 and to decrypt data items stored in the local database 102 using white-box cryptographic techniques.1. A mobile computing device having a processor and a memory, wherein the processor is programmed with a mobile transaction application, wherein:
the memory comprises a local database to hold data items for use by the mobile transaction application; wherein the mobile transaction application is adapted to encrypt data items for storage in the local database and to decrypt data items stored in the local database using white-box cryptographic techniques. 2. A mobile computing device as claimed in claim 1, wherein an entry in the local database comprises an index and an encrypted parameter for use by the mobile transaction algorithm. 3. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is adapted to use static white-box cryptography and uses a key derivation algorithm in encryption and storage of data in the local encrypted database. 4. A mobile computing device as claimed in claim 3, wherein an entry in the local database further comprises an application sequence counter to indicate a transaction in which an operation associated with the entry was performed. 5. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is adapted to use dynamic white-box cryptography and uses a key transportation algorithm in encryption and storage of data in the local encrypted database. 6. A mobile computing device as claimed in claim 5, wherein an entry in the local database comprises an index and an encrypted parameter for use by the mobile transaction algorithm and wherein an entry in the local database further comprises an encrypted key for that entry. 7. A mobile computing device as claimed in claim 5, wherein the mobile transaction application communicates with a server adapted to secure one or more parameters used by the mobile transaction application. 8. A mobile computing device as claimed in claim 1, wherein the mobile transaction application and the local database are protected by software obfuscation. 9. A mobile computing device as claimed in claim 1, wherein the mobile transaction application is downloaded to the mobile computing device without customisation to the mobile computing device or its user. 10. A mobile computing device as claimed in claim 9, wherein on installation or initialization, the mobile transaction application is customised to the mobile computing device or its user. 11. A mobile computing device as claimed in claim 1, wherein the mobile computing device is adapted to act as a payment device and wherein the mobile transaction application is a payment application. 12. A mobile computing device as claimed in claim 11 wherein the mobile computing device is adapted to emulate a contactless payment card. 13. A mobile computing device as claimed in claim 1, wherein the mobile computing device is or comprises a mobile telephone. 14. A method of operating a mobile transaction application at a mobile computing device, wherein the mobile computing device comprises a processor adapted to execute the mobile transaction application and a memory comprising a local database to hold data items for use by the mobile transaction application, the method comprising:
identifying one or more data items for storage in or retrieval from the local database; and either encrypt the one or more data items for storage in the local database using white-box cryptographic techniques, or decrypt the one or more data items stored in the local database using white-box cryptographic techniques. 15. The method of claim 14, wherein the mobile transaction application uses static white-box cryptography and uses a key derivation algorithm in encryption and storage of data in the local encrypted database. 16. The method of claim 14, wherein the mobile transaction application uses dynamic white-box cryptography and uses a key transportation algorithm in encryption and storage of data in the local encrypted database. 17. The method of claim 14, wherein the mobile transaction application and the local database are protected by software obfuscation. 18. The method of claim 14, further comprising:
downloading the mobile transaction application to the mobile computing device without customisation to the mobile computing device or its user; and on installation or initialization, customising the mobile transaction application to the mobile computing device or its user. 19. The method of claim 14, wherein the mobile computing device is adapted to act as a payment device and wherein the mobile transaction application is a payment application. 20. The method of claim 19, wherein the mobile computing device is adapted to emulate a contactless payment card. | 3,600 |
13,541 | 13,541 | 14,322,870 | 3,636 | A business card comprises front and back sides and a flap permanently attached to the business card. The flap comprises front and back sides and an adhesive on at least a portion of the flap's back side. The adhesive is capable of removably and reusably adhering to objects. The flap is foldable with respect to the business card such that the flap can be placed in at least two configurations. In a first configuration, the adhesive adheres to a portion of the back side of the business card, so that the business card is non-adhesive and can be used like a convention business card. In a second configuration, the flap aligns at least approximately with the business card, thereby presenting the flap's adhesive to be able to adhere to another object such that the front side of the business card faces outward from said another object. | 1. A business card comprising:
a front side; a back side opposite the front side; and a flap permanently attached to the business card, the flap comprising:
a front side;
a back side opposite the front side of the flap; and
an adhesive on at least a portion of the back side of the flap, wherein the adhesive is capable of removably and reusably adhering to objects, the flap being foldable with respect to the business card such that the flap can be placed in at least two configurations, including:
a first configuration wherein the adhesive on the back side of the flap adheres to a portion of the back side of the business card, and
a second configuration wherein the flap aligns at least approximately with the business card such that the front of the business card and the front of the flap face the same general forward direction, and the back of the business card and the back of the flap face the same general direction that is generally opposite the forward direction, thereby presenting the flap's adhesive to be able to adhere to another object such that the front side of the business card faces outward from said another object. 2. A business card according to claim 1, wherein the business card has a form of a conventional business card in the first configuration. 3. A business card according to claim 1, wherein no adhesive is exposed in the first configuration. 4. A business card according to claim 1, wherein the business card is substantially flat against said another object in the second configuration. 5. A business card according to claim 1, wherein the flap can be placed in a third configuration wherein the flap's adhesive is able to adhere to said another object, and the business card is further pivoted with respect to the flap such that the front side of the business card faces the front side of the flap, thereby exposing the back side of the business card outward from said another object. 6. A business card according to claim 1, wherein the flap attaches to the business card along a periphery edge of the business card. 7. A business card according to claim 1, wherein in the flap extends across substantially the entire length of the business card. 8. A business card according to claim 1, wherein the flap has an area that is between about 10% and about 33% of an area of the business card. 9. A business card according to claim 1, wherein the portion of the back side of the flap on which there is adhesive is less than the entire area of the back side of the flap. 10. A business card according to claim 9, wherein the back side of the flap has no adhesive in a lengthwise central area of the flap. 11. A business card according to claim 10, wherein the lengthwise central area is configured to permit an object to fit between the back side of the flap and the back side of the business card in the first configuration to facilitate unsticking the flap from the business card so as to move the flap toward the second configuration. 12. A business card according to claim 11, wherein said object fitting between the back side of the flap and the back side of the business card is a person's thumb or finger. 13. A business card according to claim 1, wherein the flap is a plastic. 14. A business card according to claim 13, wherein the plastic is a polyvinylidene chloride. 15. A business card according to claim 1, wherein the flap is more flexible than the non-flap portion of the business card. 16. A business card according to claim 1, wherein the flap is sufficiently flexible such that the business card is operable to pivot readily approximately 180° relative to the flap in response to manual force from a finger of a person. 17. A business card according to claim 1, wherein the flap is sufficiently flexible such that the business card is operable to pivot readily approximately 180° relative to the flap in response to blowing by a person. 18. A business card according to claim 1, wherein the adhesive has a tackiness sufficiently weak to be overcome manually to remove the business card from the surface of said another object, and wherein the adhesive is sufficiently persistent after removal to reapply the business card to the same or different surface. 19. A business card according to claim 1, wherein the adhesive is a pressure-activated adhesive. 20. A business card according to claim 1, wherein the flap comprises:
a portion of a piece of a plastic sheet; double-sided tape, a first side of which is adhered to the portion of a first side of the piece of the plastic sheet; and talc on a portion of second side of the double-sided tape, and wherein the second side of another portion of the piece of the plastic sheet is secured to the back side of the business card with a permanent adhesive. 21. A business card changeable between an adhesive configuration and non-adhesive configuration, the business card comprising:
a generally flat business card body having opposing front and back sides; and a flap permanently attached to the generally flat business card body, the flap having an adhesive side and an opposing non-adhesive side, the adhesive side of the flap having an adhesive area that is adherable to, removable from, and re-adherable to another object, the flap being moveable from a first position to a second position, wherein the flap in the first position is folded against the business card body such that the adhesive side of the flap adheres to the back side of the business card body, and wherein the flap in the second position exposes the adhesive area to permit the business card to adhere to another object. 22. A business card according to claim 21, wherein the business card body has a form of a conventional business card and no part of the adhesive area is exposed when the flap is in the first position. 23. A business card according to claim 21, wherein the flap can be placed in a third position wherein the flap's adhesive is able to adhere to said another object, and the business card body is further able to pivot with respect to the flap such that the back side of the business card body is exposed outward from said another object. 24. A business card according to claim 21, wherein the adhesive area does not include a portion of the adhesive side of the flap where an object can fit between the business card body and the adhesive side of the flap in the first position to facilitate unsticking the flap from the business card body so as to move the flap toward the second position. 25. A business card according to claim 21, wherein the flap is substantially transparent. 26. A business card according to claim 21, wherein the flap is more flexible than the business card body. 27. A business card according to claim 21, wherein the flap comprises a hinge, wherein the hinge is located adjacent the business card body. 28. A business card according to claim 27, wherein the hinge rotates approximately 360°. 29. A business card according to claim 27, wherein the hinge is more flexible than the remainder of the flap. 30. A business card according to claim 27, wherein there is no adhesive on the hinge. 31. A business card according to claim 27, wherein the hinge has a height greater than the thicknesses of the business card body and also greater than the thickness of any other portion of the flap. 32. A business card comprising:
a means for displaying business information; and a means for converting the means for displaying business information from an adhesive configuration to a non-adhesive configuration and vice versa. 33. A method of using a selectively adhesive business card, the method comprising:
storing the business card in a non-adhesive form such that an adhesive flap of the business card is folded down against and adheres to a portion of the business card; unsticking the flap from the portion of the business card; sticking the adhesive flap to another object to thereby adhere the business card to said another object; removing the adhesive flap from said another object; and re-sticking the adhesive flap to the portion of the business card to thereby return the business card to the non-adhesive form. 34. A selectively adhesive business card made by a process comprising:
permanently attaching to a business card a portion of one side of a plastic sheet, thereby creating an attached portion of the plastic sheet and a free portion of the plastic sheet; and adhering a first side of double-sided tape to at least a part of the free portion of the plastic sheet on a side of the plastic sheet opposite said one side of the plastic sheet. 35. A selectively adhesive business card made according to a process recited in claim 34, wherein the process further comprises:
applying an anti-tackiness substance to substantially the entire attached portion of the plastic sheet on the side of the plastic sheet opposite said one side of the plastic sheet; and applying an anti-tackiness substance to a portion of the second side of the double sided tape. 36. A selectively adhesive business card made according to a process recited in claim 34, wherein the step of permanently attaching to a business card a portion of one side of a plastic sheet further comprises:
applying permanent adhesive to a section of a back side of the business card; and attaching said one side of the attached portion of the plastic sheet to the permanent adhesive on the back side of the business card. | A business card comprises front and back sides and a flap permanently attached to the business card. The flap comprises front and back sides and an adhesive on at least a portion of the flap's back side. The adhesive is capable of removably and reusably adhering to objects. The flap is foldable with respect to the business card such that the flap can be placed in at least two configurations. In a first configuration, the adhesive adheres to a portion of the back side of the business card, so that the business card is non-adhesive and can be used like a convention business card. In a second configuration, the flap aligns at least approximately with the business card, thereby presenting the flap's adhesive to be able to adhere to another object such that the front side of the business card faces outward from said another object.1. A business card comprising:
a front side; a back side opposite the front side; and a flap permanently attached to the business card, the flap comprising:
a front side;
a back side opposite the front side of the flap; and
an adhesive on at least a portion of the back side of the flap, wherein the adhesive is capable of removably and reusably adhering to objects, the flap being foldable with respect to the business card such that the flap can be placed in at least two configurations, including:
a first configuration wherein the adhesive on the back side of the flap adheres to a portion of the back side of the business card, and
a second configuration wherein the flap aligns at least approximately with the business card such that the front of the business card and the front of the flap face the same general forward direction, and the back of the business card and the back of the flap face the same general direction that is generally opposite the forward direction, thereby presenting the flap's adhesive to be able to adhere to another object such that the front side of the business card faces outward from said another object. 2. A business card according to claim 1, wherein the business card has a form of a conventional business card in the first configuration. 3. A business card according to claim 1, wherein no adhesive is exposed in the first configuration. 4. A business card according to claim 1, wherein the business card is substantially flat against said another object in the second configuration. 5. A business card according to claim 1, wherein the flap can be placed in a third configuration wherein the flap's adhesive is able to adhere to said another object, and the business card is further pivoted with respect to the flap such that the front side of the business card faces the front side of the flap, thereby exposing the back side of the business card outward from said another object. 6. A business card according to claim 1, wherein the flap attaches to the business card along a periphery edge of the business card. 7. A business card according to claim 1, wherein in the flap extends across substantially the entire length of the business card. 8. A business card according to claim 1, wherein the flap has an area that is between about 10% and about 33% of an area of the business card. 9. A business card according to claim 1, wherein the portion of the back side of the flap on which there is adhesive is less than the entire area of the back side of the flap. 10. A business card according to claim 9, wherein the back side of the flap has no adhesive in a lengthwise central area of the flap. 11. A business card according to claim 10, wherein the lengthwise central area is configured to permit an object to fit between the back side of the flap and the back side of the business card in the first configuration to facilitate unsticking the flap from the business card so as to move the flap toward the second configuration. 12. A business card according to claim 11, wherein said object fitting between the back side of the flap and the back side of the business card is a person's thumb or finger. 13. A business card according to claim 1, wherein the flap is a plastic. 14. A business card according to claim 13, wherein the plastic is a polyvinylidene chloride. 15. A business card according to claim 1, wherein the flap is more flexible than the non-flap portion of the business card. 16. A business card according to claim 1, wherein the flap is sufficiently flexible such that the business card is operable to pivot readily approximately 180° relative to the flap in response to manual force from a finger of a person. 17. A business card according to claim 1, wherein the flap is sufficiently flexible such that the business card is operable to pivot readily approximately 180° relative to the flap in response to blowing by a person. 18. A business card according to claim 1, wherein the adhesive has a tackiness sufficiently weak to be overcome manually to remove the business card from the surface of said another object, and wherein the adhesive is sufficiently persistent after removal to reapply the business card to the same or different surface. 19. A business card according to claim 1, wherein the adhesive is a pressure-activated adhesive. 20. A business card according to claim 1, wherein the flap comprises:
a portion of a piece of a plastic sheet; double-sided tape, a first side of which is adhered to the portion of a first side of the piece of the plastic sheet; and talc on a portion of second side of the double-sided tape, and wherein the second side of another portion of the piece of the plastic sheet is secured to the back side of the business card with a permanent adhesive. 21. A business card changeable between an adhesive configuration and non-adhesive configuration, the business card comprising:
a generally flat business card body having opposing front and back sides; and a flap permanently attached to the generally flat business card body, the flap having an adhesive side and an opposing non-adhesive side, the adhesive side of the flap having an adhesive area that is adherable to, removable from, and re-adherable to another object, the flap being moveable from a first position to a second position, wherein the flap in the first position is folded against the business card body such that the adhesive side of the flap adheres to the back side of the business card body, and wherein the flap in the second position exposes the adhesive area to permit the business card to adhere to another object. 22. A business card according to claim 21, wherein the business card body has a form of a conventional business card and no part of the adhesive area is exposed when the flap is in the first position. 23. A business card according to claim 21, wherein the flap can be placed in a third position wherein the flap's adhesive is able to adhere to said another object, and the business card body is further able to pivot with respect to the flap such that the back side of the business card body is exposed outward from said another object. 24. A business card according to claim 21, wherein the adhesive area does not include a portion of the adhesive side of the flap where an object can fit between the business card body and the adhesive side of the flap in the first position to facilitate unsticking the flap from the business card body so as to move the flap toward the second position. 25. A business card according to claim 21, wherein the flap is substantially transparent. 26. A business card according to claim 21, wherein the flap is more flexible than the business card body. 27. A business card according to claim 21, wherein the flap comprises a hinge, wherein the hinge is located adjacent the business card body. 28. A business card according to claim 27, wherein the hinge rotates approximately 360°. 29. A business card according to claim 27, wherein the hinge is more flexible than the remainder of the flap. 30. A business card according to claim 27, wherein there is no adhesive on the hinge. 31. A business card according to claim 27, wherein the hinge has a height greater than the thicknesses of the business card body and also greater than the thickness of any other portion of the flap. 32. A business card comprising:
a means for displaying business information; and a means for converting the means for displaying business information from an adhesive configuration to a non-adhesive configuration and vice versa. 33. A method of using a selectively adhesive business card, the method comprising:
storing the business card in a non-adhesive form such that an adhesive flap of the business card is folded down against and adheres to a portion of the business card; unsticking the flap from the portion of the business card; sticking the adhesive flap to another object to thereby adhere the business card to said another object; removing the adhesive flap from said another object; and re-sticking the adhesive flap to the portion of the business card to thereby return the business card to the non-adhesive form. 34. A selectively adhesive business card made by a process comprising:
permanently attaching to a business card a portion of one side of a plastic sheet, thereby creating an attached portion of the plastic sheet and a free portion of the plastic sheet; and adhering a first side of double-sided tape to at least a part of the free portion of the plastic sheet on a side of the plastic sheet opposite said one side of the plastic sheet. 35. A selectively adhesive business card made according to a process recited in claim 34, wherein the process further comprises:
applying an anti-tackiness substance to substantially the entire attached portion of the plastic sheet on the side of the plastic sheet opposite said one side of the plastic sheet; and applying an anti-tackiness substance to a portion of the second side of the double sided tape. 36. A selectively adhesive business card made according to a process recited in claim 34, wherein the step of permanently attaching to a business card a portion of one side of a plastic sheet further comprises:
applying permanent adhesive to a section of a back side of the business card; and attaching said one side of the attached portion of the plastic sheet to the permanent adhesive on the back side of the business card. | 3,600 |
13,542 | 13,542 | 11,947,114 | 3,623 | A device for evaluating a trend analysis system comprises: an allowable value input unit for receiving allowable values of false positives and allowable values of false negatives made by the trend analysis system; and an accuracy computation unit for computing an accuracy of the trend analysis system as a function of the allowable values of false positives and the allowable values of false negatives. | 1. A device for evaluating a trend analysis system, comprising:
an allowable value input unit for receiving allowable values of false positives and allowable values of false negatives made by the trend analysis system; and an accuracy computation unit for computing an accuracy of the trend analysis system as a function of said allowable values of false positives and said allowable values of false negatives. 2. The device according to claim 1 wherein said accuracy computation unit comprises a weight determination unit for assigning weights to said values of false positives and said values of false negatives. 3. The device according to claim 2 wherein said weight determination unit further functions to read relevance data containing information correctly indicating the presence or absence of relationships among data pieces included in a default data set stored in a storage device. 4. The device according to claim 2 wherein said weight determination unit further functions to indicate whether said weights have been successfully computed. 5. The device according to claim 2 wherein said accuracy computation unit further comprises a computation unit for computing an accuracy for the trend analysis system by using said number of false positives, said assigned weights, said number of false negatives, and a total number of said data pieces. 6. The device according to claim 4, wherein said computed accuracy comprises a value computed by subtracting from unity a quotient derived by dividing said total number of data pieces into a numerator, said numerator found by multiplying said number of false positives by a first said weight and summing the product with said number of false negatives multiplied by a second said weight. 7. The device according to claim 2, wherein said weight determination unit functions to satisfy a condition for determining that there is no difference in the trend analysis system with a probability not less than a default probability in a case where there is no difference between accuracies of the trend analysis system. 8. The device according to claim 2, wherein said weight determination unit functions to satisfy a condition for determining that there is a difference in the trend analysis system with a probability not less than said default probability in a case where there is a difference between accuracies of the trend analysis system. 9. A method for evaluating a trend analysis system, comprising the steps of:
receiving relationships among attributes of data pieces in a data set, said relationships extracted by the trend analysis system; setting allowable ranges of errors for said relationships; and computing an accuracy for the trend analysis system as a function of said errors that fall within said allowable ranges. 10. The method according to claim 9 wherein said step of receiving relationships comprises the steps of:
receiving false positives, each said false positive being a determination that said data pieces are related to each other although not actually related; and receiving false negatives, each said false negative being a determination that said data pieces are not related to each other although actually related. 11. The method according to claim 9 wherein the step of computing an accuracy comprises using a number of false positives, a weight assigned thereto, a number of false negatives, a weight assigned thereto, and a total number of said data pieces. 12. The method according to claim 11 wherein the step of using said number of false positives and said number of false negatives comprises the step of using a ratio between said number of false positives and said number of false negatives. 13. The method according to claim 9 wherein the step of step of computing an accuracy comprises the steps of:
reading relevance data containing correct information indicating the presence or absence of relationships among said data pieces ; and assigning weights to a numbers of false positives and a number of false negatives made by the trend analysis system, said weights determined from allowable values for false positives and false negatives by using said relevance data. 14. The method according to claim 9 further comprising the step of performing a parameter tuning based on said computed accuracy. 15. The method according to claim 14 wherein said step of performing a parameter tuning comprises at least one of modifying a text mining parameter or upgrading a dictionary used for text mining. 16. The method according to claim 14 wherein said step of performing a parameter tuning comprises the step of modifying a confidence coefficient for the trend analysis system. 17. The method according to claim 14 further comprising the step of terminating said parameter tuning when said computed accuracy satisfies a termination condition. 18. A program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to evaluate a trend analysis system by executing the steps of:
receiving an allowable value of false positives, each said false positive being a determination that data pieces are related although said data pieces are not related; receiving an allowable value of false negatives, each said false negative being a determination that said data pieces are not related although said data pieces are related; and computing an accuracy for the trend analysis system. 19. The program product according to claim 18 wherein said accuracy computing step comprises the steps of:
reading relevance data containing correct information indicating the presence or absence of relationships among data pieces included in a default data set stored in a storage device; and determining weights assigned to the number of false positives and number of false negatives made by the system, from said allowable values for false positives and said allowable values for false negatives by using said relevance data containing correct information. 20. The program product according to claim 19 wherein said step of computing an accuracy for the trend analysis system comprises using said number of false positives, said weight assigned to said false positives number, said number of false negatives, said weight assigned to said false negatives number, and a total number of said data pieces. | A device for evaluating a trend analysis system comprises: an allowable value input unit for receiving allowable values of false positives and allowable values of false negatives made by the trend analysis system; and an accuracy computation unit for computing an accuracy of the trend analysis system as a function of the allowable values of false positives and the allowable values of false negatives.1. A device for evaluating a trend analysis system, comprising:
an allowable value input unit for receiving allowable values of false positives and allowable values of false negatives made by the trend analysis system; and an accuracy computation unit for computing an accuracy of the trend analysis system as a function of said allowable values of false positives and said allowable values of false negatives. 2. The device according to claim 1 wherein said accuracy computation unit comprises a weight determination unit for assigning weights to said values of false positives and said values of false negatives. 3. The device according to claim 2 wherein said weight determination unit further functions to read relevance data containing information correctly indicating the presence or absence of relationships among data pieces included in a default data set stored in a storage device. 4. The device according to claim 2 wherein said weight determination unit further functions to indicate whether said weights have been successfully computed. 5. The device according to claim 2 wherein said accuracy computation unit further comprises a computation unit for computing an accuracy for the trend analysis system by using said number of false positives, said assigned weights, said number of false negatives, and a total number of said data pieces. 6. The device according to claim 4, wherein said computed accuracy comprises a value computed by subtracting from unity a quotient derived by dividing said total number of data pieces into a numerator, said numerator found by multiplying said number of false positives by a first said weight and summing the product with said number of false negatives multiplied by a second said weight. 7. The device according to claim 2, wherein said weight determination unit functions to satisfy a condition for determining that there is no difference in the trend analysis system with a probability not less than a default probability in a case where there is no difference between accuracies of the trend analysis system. 8. The device according to claim 2, wherein said weight determination unit functions to satisfy a condition for determining that there is a difference in the trend analysis system with a probability not less than said default probability in a case where there is a difference between accuracies of the trend analysis system. 9. A method for evaluating a trend analysis system, comprising the steps of:
receiving relationships among attributes of data pieces in a data set, said relationships extracted by the trend analysis system; setting allowable ranges of errors for said relationships; and computing an accuracy for the trend analysis system as a function of said errors that fall within said allowable ranges. 10. The method according to claim 9 wherein said step of receiving relationships comprises the steps of:
receiving false positives, each said false positive being a determination that said data pieces are related to each other although not actually related; and receiving false negatives, each said false negative being a determination that said data pieces are not related to each other although actually related. 11. The method according to claim 9 wherein the step of computing an accuracy comprises using a number of false positives, a weight assigned thereto, a number of false negatives, a weight assigned thereto, and a total number of said data pieces. 12. The method according to claim 11 wherein the step of using said number of false positives and said number of false negatives comprises the step of using a ratio between said number of false positives and said number of false negatives. 13. The method according to claim 9 wherein the step of step of computing an accuracy comprises the steps of:
reading relevance data containing correct information indicating the presence or absence of relationships among said data pieces ; and assigning weights to a numbers of false positives and a number of false negatives made by the trend analysis system, said weights determined from allowable values for false positives and false negatives by using said relevance data. 14. The method according to claim 9 further comprising the step of performing a parameter tuning based on said computed accuracy. 15. The method according to claim 14 wherein said step of performing a parameter tuning comprises at least one of modifying a text mining parameter or upgrading a dictionary used for text mining. 16. The method according to claim 14 wherein said step of performing a parameter tuning comprises the step of modifying a confidence coefficient for the trend analysis system. 17. The method according to claim 14 further comprising the step of terminating said parameter tuning when said computed accuracy satisfies a termination condition. 18. A program product comprising a computer useable medium including a computer readable program, wherein the computer readable program when executed on a computer causes the computer to evaluate a trend analysis system by executing the steps of:
receiving an allowable value of false positives, each said false positive being a determination that data pieces are related although said data pieces are not related; receiving an allowable value of false negatives, each said false negative being a determination that said data pieces are not related although said data pieces are related; and computing an accuracy for the trend analysis system. 19. The program product according to claim 18 wherein said accuracy computing step comprises the steps of:
reading relevance data containing correct information indicating the presence or absence of relationships among data pieces included in a default data set stored in a storage device; and determining weights assigned to the number of false positives and number of false negatives made by the system, from said allowable values for false positives and said allowable values for false negatives by using said relevance data containing correct information. 20. The program product according to claim 19 wherein said step of computing an accuracy for the trend analysis system comprises using said number of false positives, said weight assigned to said false positives number, said number of false negatives, said weight assigned to said false negatives number, and a total number of said data pieces. | 3,600 |
13,543 | 13,543 | 14,632,289 | 3,621 | Techniques for efficiently selecting upsell content to serve to users of an online service based on complex user archetypes. Serving upsell content to a user may include selecting upsell content to serve to the user based on efficiently matching the user to a complex user archetype in response to receiving a request from a computing device of the user. The user archetype may be complex in the sense that it represents a specific pattern of user interaction with the online service over a period of time, as opposed to being based solely on user demographic information such as the users' age, sex, gender, ethnicity, location of residence, profession, and the like. In addition, the specific pattern may vary depending on the type of online service. For example, according to some of the disclosed embodiments, upsell content may be efficiently selected to serve to a user of a content item management service based on the user having added five or more work files to the content item management service or edited one or more work files hosted with the content item management service during the last twenty-eight days. | 1. A method for efficiently serving upsell content to a user of an online service based on complex user archetypes, the online service comprising one or more server computers with memory and one or more processors, the method comprising:
based on user events reflecting a user's interaction with primary application content of the online service over a period of time, for each of a plurality of predefined complex user archetypes, determining, by at least one of the processors, whether a user is or is not the predefined complex user archetype; based on the determining, storing, by at least one of the processors, a set of a plurality of user upsell attributes for the user in a database, each of the plurality of user upsell attributes corresponding to one of the plurality of predefined complex user archetypes and having a value that indicates whether the user is or is not the corresponding predefined complex user archetype; in response to receiving a request from a computing device used by the user:
identifying, by at least one of the processors, a plurality of upsell campaigns associated with particular primary application content of the online service, each of the plurality of upsell campaigns associated with upsell content and associated with a user archetype rule;
determining, by at least one of the processors, whether the user archetype rule associated with an upsell campaign of the plurality of upsell campaigns is satisfied by the set of user upsell attributes for the user; and
serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by the user, if the user archetype rule is satisfied by the set of user upsell attributes. 2. The method of claim 1, further comprising:
collecting, by at least one of the processors, the user events reflecting the user's interaction with primary application content of the online service over the period of time; processing, by at least one of the processors, the user events through a data pipeline to produce the plurality of user upsell attributes; and storing, by at least one of the processors, the plurality of upsell attributes in the database. 3. The method of claim 1, wherein processing, by at least one of the processors, the user events through the data pipeline to produce the plurality of user upsell attributes comprises processing, by at least one of the processors, the user events through a series of a plurality of MapReduce phases. 4. The method of claim 1, further comprising:
evaluating, by at least one of the processors, the user archetype rule against the set of user upsell attributes; obtaining, by at least one of the processors, a result of the evaluating; and serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by user, if the result of the evaluating is TRUE; 5. The method of claim 1, further comprising:
determining, by at least one of the processors, that at least one of the upsell campaigns belongs to a group of upsell campaigns having, as a member of the group, an upsell campaign that was previously dismissed by the user; and wherein the upsell campaign associated with the upsell content served to the computing device used by the user does not belong to the group of upsell campaigns. 6. The method of claim 1, wherein the request is for the particular primary application content. 7. The method of claim 1, wherein the period of time is at least one day. 8. The method of claim 1, wherein each of the plurality of user upsell attributes has a Boolean value that specifies whether the user is or is not the predefined complex user archetype corresponding to the each user upsell attribute. 9. The method of claim 1, wherein determining, by at least one of the processors, whether the user archetype rule is satisfied by the set of user upsell attributes for the user comprises evaluating, by at least one of the processors, a Boolean expression against the set of user upsell attributes for the user. 10. The method of claim 1, further comprising
if the user archetype rule is satisfied by the set of user upsell attributes, querying, by at least one of the processors, a database to determine if the user passes a gating condition on serving the upsell content to the user; and serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by user, if the user passes the gating condition. 11. The method of claim 1, further comprising:
wherein the upsell campaign is associated with a monetary or non-monetary incentive for the user to interact with the online service in a manner intended by the upsell campaign; and causing, by at least one of the processors, the user to receive the incentive in response to detecting the user interacting with the online service in the manner intended by the upsell campaign. 12. A method for efficiently serving upsell content to a user of an online service based on complex user archetypes, the online service comprising one or more server computers with memory and one or more processors, the method comprising:
based on user events reflecting a user's interaction with upsell content of the online service over a period of time, determining, by at least one of the processors, whether a user is or is not a predefined complex user archetype; based on the determining, storing, by at least one of the processors, a user upsell attribute for the user in a database, the user upsell attribute corresponding to the predefined complex user archetype and having a value that indicates whether the user is or is not the predefined complex user archetype; determining, by at least one of the processors, whether a user archetype rule associated with an upsell campaign is satisfied by the user upsell attribute for the user; and serving, by at least one of the processors, upsell content associated with the upsell campaign to the computing device used by user, if the user archetype rule is satisfied by the set of user upsell attributes. 13. A computer system for efficiently serving upsell content to a user, the system comprising one or more computing devices with memory and one or more processors configured for:
based on user events reflecting a user's interaction with primary application content of the online service over a period of time, for each of a plurality of predefined complex user archetypes, determining whether a user is or is not the predefined complex user archetype; based on the determining, storing a set of a plurality of user upsell attributes for the user in a database, each of the plurality of user upsell attributes corresponding to one of the plurality of predefined complex user archetypes and having a value that indicates whether the user is or is not the corresponding predefined complex user archetype; in response to receiving a request from a computing device used by the user:
identifying a plurality of upsell campaigns associated with particular primary application content of the online service, each of the plurality of upsell campaigns associated with upsell content and associated with a user archetype rule;
determining whether the user archetype rule associated with an upsell campaign of the plurality of upsell campaigns is satisfied by the set of user upsell attributes for the user; and
serving the upsell content associated with the upsell campaign to the computing device used by the user, if the user archetype rule is satisfied by the set of user upsell attributes. 14. The system of claim 13, the one or more processors further configured for:
collecting the user events reflecting the user's interaction with primary application content of the online service over the period of time; processing the user events through a data pipeline to produce the plurality of user upsell attributes; and storing the plurality of upsell attributes in the database. 15. The system of claim 13, wherein processing the user events through the data pipeline to produce the plurality of user upsell attributes comprises processing, by at least one of the processors, the user events through a series of a plurality of MapReduce phases. 16. The system of claim 13, the one or more processors further configured for:
evaluating the user archetype rule against the set of user upsell attributes; obtaining a result of the evaluating; and serving the upsell content associated with the upsell campaign to the computing device used by user, if the result of the evaluating is TRUE; 17. The system of claim 13, the one or more processors further configured for:
determining that at least one of the upsell campaigns belongs to a group of upsell campaigns having, as a member of the group, an upsell campaign that was previously dismissed by the user; and wherein the upsell campaign associated with the upsell content served to the computing device used by the user does not belong to the group of upsell campaigns. 18. The system of claim 13, wherein the request is for the particular primary application content. 19. The system of claim 13, wherein the period of time is at least one day. 20. The system of claim 13, wherein each of the plurality of user upsell attributes has a Boolean value that specifies whether the user is or is not the predefined complex user archetype corresponding to the each user upsell attribute. 21. The system of claim 13, wherein determining whether the user archetype rule is satisfied by the set of user upsell attributes for the user comprises evaluating a Boolean expression against the set of user upsell attributes for the user. 22. The system of claim 13, the one or more processors further configured for:
if the user archetype rule is satisfied by the set of user upsell attributes, querying a database to determine if the user passes a gating condition on serving the upsell content to the user; and serving the upsell content associated with the upsell campaign to the computing device used by user, if the user passes the gating condition. 23. The system of claim 13, wherein the upsell campaign is associated with a monetary or non-monetary incentive for the user to interact with the online service in a manner intended by the upsell campaign; and wherein the one or more processors are further configured for causing the user to receive the incentive in response to detecting the user interacting with the online service in the manner intended by the upsell campaign. 24. A computer system for efficiently serving upsell content to a user, the system comprising one or more computing devices with memory and one or more processors configured for:
based on user events reflecting a user's interaction with upsell content of the online service over a period of time, determining whether a user is or is not a predefined complex user archetype; based on the determining, storing a user upsell attribute for the user in a database, the user upsell attribute corresponding to the predefined complex user archetype and having a value that indicates whether the user is or is not the predefined complex user archetype; determining whether a user archetype rule associated with an upsell campaign is satisfied by the user upsell attribute for the user; and serving upsell content associated with the upsell campaign to the computing device used by user, if the user archetype rule is satisfied by the set of user upsell attributes. | Techniques for efficiently selecting upsell content to serve to users of an online service based on complex user archetypes. Serving upsell content to a user may include selecting upsell content to serve to the user based on efficiently matching the user to a complex user archetype in response to receiving a request from a computing device of the user. The user archetype may be complex in the sense that it represents a specific pattern of user interaction with the online service over a period of time, as opposed to being based solely on user demographic information such as the users' age, sex, gender, ethnicity, location of residence, profession, and the like. In addition, the specific pattern may vary depending on the type of online service. For example, according to some of the disclosed embodiments, upsell content may be efficiently selected to serve to a user of a content item management service based on the user having added five or more work files to the content item management service or edited one or more work files hosted with the content item management service during the last twenty-eight days.1. A method for efficiently serving upsell content to a user of an online service based on complex user archetypes, the online service comprising one or more server computers with memory and one or more processors, the method comprising:
based on user events reflecting a user's interaction with primary application content of the online service over a period of time, for each of a plurality of predefined complex user archetypes, determining, by at least one of the processors, whether a user is or is not the predefined complex user archetype; based on the determining, storing, by at least one of the processors, a set of a plurality of user upsell attributes for the user in a database, each of the plurality of user upsell attributes corresponding to one of the plurality of predefined complex user archetypes and having a value that indicates whether the user is or is not the corresponding predefined complex user archetype; in response to receiving a request from a computing device used by the user:
identifying, by at least one of the processors, a plurality of upsell campaigns associated with particular primary application content of the online service, each of the plurality of upsell campaigns associated with upsell content and associated with a user archetype rule;
determining, by at least one of the processors, whether the user archetype rule associated with an upsell campaign of the plurality of upsell campaigns is satisfied by the set of user upsell attributes for the user; and
serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by the user, if the user archetype rule is satisfied by the set of user upsell attributes. 2. The method of claim 1, further comprising:
collecting, by at least one of the processors, the user events reflecting the user's interaction with primary application content of the online service over the period of time; processing, by at least one of the processors, the user events through a data pipeline to produce the plurality of user upsell attributes; and storing, by at least one of the processors, the plurality of upsell attributes in the database. 3. The method of claim 1, wherein processing, by at least one of the processors, the user events through the data pipeline to produce the plurality of user upsell attributes comprises processing, by at least one of the processors, the user events through a series of a plurality of MapReduce phases. 4. The method of claim 1, further comprising:
evaluating, by at least one of the processors, the user archetype rule against the set of user upsell attributes; obtaining, by at least one of the processors, a result of the evaluating; and serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by user, if the result of the evaluating is TRUE; 5. The method of claim 1, further comprising:
determining, by at least one of the processors, that at least one of the upsell campaigns belongs to a group of upsell campaigns having, as a member of the group, an upsell campaign that was previously dismissed by the user; and wherein the upsell campaign associated with the upsell content served to the computing device used by the user does not belong to the group of upsell campaigns. 6. The method of claim 1, wherein the request is for the particular primary application content. 7. The method of claim 1, wherein the period of time is at least one day. 8. The method of claim 1, wherein each of the plurality of user upsell attributes has a Boolean value that specifies whether the user is or is not the predefined complex user archetype corresponding to the each user upsell attribute. 9. The method of claim 1, wherein determining, by at least one of the processors, whether the user archetype rule is satisfied by the set of user upsell attributes for the user comprises evaluating, by at least one of the processors, a Boolean expression against the set of user upsell attributes for the user. 10. The method of claim 1, further comprising
if the user archetype rule is satisfied by the set of user upsell attributes, querying, by at least one of the processors, a database to determine if the user passes a gating condition on serving the upsell content to the user; and serving, by at least one of the processors, the upsell content associated with the upsell campaign to the computing device used by user, if the user passes the gating condition. 11. The method of claim 1, further comprising:
wherein the upsell campaign is associated with a monetary or non-monetary incentive for the user to interact with the online service in a manner intended by the upsell campaign; and causing, by at least one of the processors, the user to receive the incentive in response to detecting the user interacting with the online service in the manner intended by the upsell campaign. 12. A method for efficiently serving upsell content to a user of an online service based on complex user archetypes, the online service comprising one or more server computers with memory and one or more processors, the method comprising:
based on user events reflecting a user's interaction with upsell content of the online service over a period of time, determining, by at least one of the processors, whether a user is or is not a predefined complex user archetype; based on the determining, storing, by at least one of the processors, a user upsell attribute for the user in a database, the user upsell attribute corresponding to the predefined complex user archetype and having a value that indicates whether the user is or is not the predefined complex user archetype; determining, by at least one of the processors, whether a user archetype rule associated with an upsell campaign is satisfied by the user upsell attribute for the user; and serving, by at least one of the processors, upsell content associated with the upsell campaign to the computing device used by user, if the user archetype rule is satisfied by the set of user upsell attributes. 13. A computer system for efficiently serving upsell content to a user, the system comprising one or more computing devices with memory and one or more processors configured for:
based on user events reflecting a user's interaction with primary application content of the online service over a period of time, for each of a plurality of predefined complex user archetypes, determining whether a user is or is not the predefined complex user archetype; based on the determining, storing a set of a plurality of user upsell attributes for the user in a database, each of the plurality of user upsell attributes corresponding to one of the plurality of predefined complex user archetypes and having a value that indicates whether the user is or is not the corresponding predefined complex user archetype; in response to receiving a request from a computing device used by the user:
identifying a plurality of upsell campaigns associated with particular primary application content of the online service, each of the plurality of upsell campaigns associated with upsell content and associated with a user archetype rule;
determining whether the user archetype rule associated with an upsell campaign of the plurality of upsell campaigns is satisfied by the set of user upsell attributes for the user; and
serving the upsell content associated with the upsell campaign to the computing device used by the user, if the user archetype rule is satisfied by the set of user upsell attributes. 14. The system of claim 13, the one or more processors further configured for:
collecting the user events reflecting the user's interaction with primary application content of the online service over the period of time; processing the user events through a data pipeline to produce the plurality of user upsell attributes; and storing the plurality of upsell attributes in the database. 15. The system of claim 13, wherein processing the user events through the data pipeline to produce the plurality of user upsell attributes comprises processing, by at least one of the processors, the user events through a series of a plurality of MapReduce phases. 16. The system of claim 13, the one or more processors further configured for:
evaluating the user archetype rule against the set of user upsell attributes; obtaining a result of the evaluating; and serving the upsell content associated with the upsell campaign to the computing device used by user, if the result of the evaluating is TRUE; 17. The system of claim 13, the one or more processors further configured for:
determining that at least one of the upsell campaigns belongs to a group of upsell campaigns having, as a member of the group, an upsell campaign that was previously dismissed by the user; and wherein the upsell campaign associated with the upsell content served to the computing device used by the user does not belong to the group of upsell campaigns. 18. The system of claim 13, wherein the request is for the particular primary application content. 19. The system of claim 13, wherein the period of time is at least one day. 20. The system of claim 13, wherein each of the plurality of user upsell attributes has a Boolean value that specifies whether the user is or is not the predefined complex user archetype corresponding to the each user upsell attribute. 21. The system of claim 13, wherein determining whether the user archetype rule is satisfied by the set of user upsell attributes for the user comprises evaluating a Boolean expression against the set of user upsell attributes for the user. 22. The system of claim 13, the one or more processors further configured for:
if the user archetype rule is satisfied by the set of user upsell attributes, querying a database to determine if the user passes a gating condition on serving the upsell content to the user; and serving the upsell content associated with the upsell campaign to the computing device used by user, if the user passes the gating condition. 23. The system of claim 13, wherein the upsell campaign is associated with a monetary or non-monetary incentive for the user to interact with the online service in a manner intended by the upsell campaign; and wherein the one or more processors are further configured for causing the user to receive the incentive in response to detecting the user interacting with the online service in the manner intended by the upsell campaign. 24. A computer system for efficiently serving upsell content to a user, the system comprising one or more computing devices with memory and one or more processors configured for:
based on user events reflecting a user's interaction with upsell content of the online service over a period of time, determining whether a user is or is not a predefined complex user archetype; based on the determining, storing a user upsell attribute for the user in a database, the user upsell attribute corresponding to the predefined complex user archetype and having a value that indicates whether the user is or is not the predefined complex user archetype; determining whether a user archetype rule associated with an upsell campaign is satisfied by the user upsell attribute for the user; and serving upsell content associated with the upsell campaign to the computing device used by user, if the user archetype rule is satisfied by the set of user upsell attributes. | 3,600 |
13,544 | 13,544 | 14,157,938 | 3,693 | The present invention provides methods and systems for stabilizing revenue derived by a variable annuity provider from variable annuities having a mortality and expense fee computed based on at least one variable that is not directly affected by market conditions, e.g., the annuity premium or a portion thereof, such as the premium that has been paid, or the premium that has been paid and invested in one or more investment divisions available to an annuity owner. The mortality and expense fee may also account for any withdrawals paid out of and disbursements made from the premium paid accordingly. The mortality and expense fee generally funds at least in part a risk associated with an annuity death benefit, such as a return of premium that has been paid death benefit. | 1. A computerized method for offering variable annuities, the method comprising:
electronically generating, via a processing device, a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; electronically calculating, via the processing device, a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and using the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. 2. The method of claim 1 wherein calculating the mortality and expense fee includes calculating the mortality and expense fee based on at least partially on a portion of the one or more premiums paid. 3. The method of claim 1 wherein calculating the mortality and expense fee includes calculating the mortality and expense fee based on at least withdrawals and disbursements. 4. The method of claim 1, wherein the guaranteed minimum death benefit provides a return of premium payments that have been paid or the variable annuity's cash value if the variable annuity's cash value is greater than the premium payments that have been paid, in the event the individual dies before commencement of annuity payments. 5. The method of claim 4, further comprising offering a guaranteed minimum death benefit rider providing a death benefit selected from a group consisting of an annual reset, the greater of an annual reset, the premium payments that have been paid, and the variable annuity's cash value. 6. The method of claim 1, wherein the at least one variable includes a life expectancy of the individual. 7. The method of claim 1, wherein the at least one variable includes a gender of the individual. 8. The method of claim 1, wherein the at least one variable includes at least one of the individual's age at inception of the variable annuity and the individual's age at a payout date. 9. The method of claim 1, further comprising increasing the mortality and expense fee throughout the plurality of periods to reflect higher mortality risk as the individual ages. 10. A system for offering variable annuities, the system comprising:
computer readable medium having executable instructions stored thereon; and a computing device including a processor, in operative communication with the computer readable medium such that the computing device receives the executable instructions therefrom and the computing device, in response to the executable instructions, operative to: generate a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; calculate a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and use the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. 11. The system of claim 10, the computing device further operative to calculate the mortality and expense fee based on at least partially on a portion of the one or more premiums paid. 12. The system of claim 10, the computing device further operative to calculate the mortality and expense fee based on at least withdrawals and disbursements. 13. The system of claim 10, wherein the guaranteed minimum death benefit provides a return of premium payments that have been paid or the variable annuity's cash value if the variable annuity's cash value is greater than the premium payments that have been paid, in the event the individual dies before commencement of annuity payments. 14. The system of claim 13, the computing device further operative to offer a guaranteed minimum death benefit rider providing a death benefit selected from a group consisting of an annual reset, the greater of an annual reset, the premium payments that have been paid, and the variable annuity's cash value. 15. The system of claim 10, wherein the at least one variable includes a life expectancy of the individual. 16. The system of claim 10, wherein the at least one variable includes a gender of the individual. 17. The system of claim 10, wherein the at least one variable includes at least one of the individual's age at inception of the variable annuity and the individual's age at a payout date. 18. The system of claim 10, the computing device further operative to increase the mortality and expense fee throughout the plurality of periods to reflect higher mortality risk as the individual ages. 19. Non-transitory computer readable media comprising program code that when executed by a programmable processor causes execution of a method for offering variable annuities, the computer readable media comprising:
computer program code for generating a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; computer program code for calculating a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and computer program code for using the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. | The present invention provides methods and systems for stabilizing revenue derived by a variable annuity provider from variable annuities having a mortality and expense fee computed based on at least one variable that is not directly affected by market conditions, e.g., the annuity premium or a portion thereof, such as the premium that has been paid, or the premium that has been paid and invested in one or more investment divisions available to an annuity owner. The mortality and expense fee may also account for any withdrawals paid out of and disbursements made from the premium paid accordingly. The mortality and expense fee generally funds at least in part a risk associated with an annuity death benefit, such as a return of premium that has been paid death benefit.1. A computerized method for offering variable annuities, the method comprising:
electronically generating, via a processing device, a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; electronically calculating, via the processing device, a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and using the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. 2. The method of claim 1 wherein calculating the mortality and expense fee includes calculating the mortality and expense fee based on at least partially on a portion of the one or more premiums paid. 3. The method of claim 1 wherein calculating the mortality and expense fee includes calculating the mortality and expense fee based on at least withdrawals and disbursements. 4. The method of claim 1, wherein the guaranteed minimum death benefit provides a return of premium payments that have been paid or the variable annuity's cash value if the variable annuity's cash value is greater than the premium payments that have been paid, in the event the individual dies before commencement of annuity payments. 5. The method of claim 4, further comprising offering a guaranteed minimum death benefit rider providing a death benefit selected from a group consisting of an annual reset, the greater of an annual reset, the premium payments that have been paid, and the variable annuity's cash value. 6. The method of claim 1, wherein the at least one variable includes a life expectancy of the individual. 7. The method of claim 1, wherein the at least one variable includes a gender of the individual. 8. The method of claim 1, wherein the at least one variable includes at least one of the individual's age at inception of the variable annuity and the individual's age at a payout date. 9. The method of claim 1, further comprising increasing the mortality and expense fee throughout the plurality of periods to reflect higher mortality risk as the individual ages. 10. A system for offering variable annuities, the system comprising:
computer readable medium having executable instructions stored thereon; and a computing device including a processor, in operative communication with the computer readable medium such that the computing device receives the executable instructions therefrom and the computing device, in response to the executable instructions, operative to: generate a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; calculate a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and use the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. 11. The system of claim 10, the computing device further operative to calculate the mortality and expense fee based on at least partially on a portion of the one or more premiums paid. 12. The system of claim 10, the computing device further operative to calculate the mortality and expense fee based on at least withdrawals and disbursements. 13. The system of claim 10, wherein the guaranteed minimum death benefit provides a return of premium payments that have been paid or the variable annuity's cash value if the variable annuity's cash value is greater than the premium payments that have been paid, in the event the individual dies before commencement of annuity payments. 14. The system of claim 13, the computing device further operative to offer a guaranteed minimum death benefit rider providing a death benefit selected from a group consisting of an annual reset, the greater of an annual reset, the premium payments that have been paid, and the variable annuity's cash value. 15. The system of claim 10, wherein the at least one variable includes a life expectancy of the individual. 16. The system of claim 10, wherein the at least one variable includes a gender of the individual. 17. The system of claim 10, wherein the at least one variable includes at least one of the individual's age at inception of the variable annuity and the individual's age at a payout date. 18. The system of claim 10, the computing device further operative to increase the mortality and expense fee throughout the plurality of periods to reflect higher mortality risk as the individual ages. 19. Non-transitory computer readable media comprising program code that when executed by a programmable processor causes execution of a method for offering variable annuities, the computer readable media comprising:
computer program code for generating a variable annuity with a guaranteed minimum death benefit for an individual, wherein the guaranteed minimum death benefit comprises a payment of the annuity's cash value in the event the individual dies before commencement of annuity payments and wherein the annuity's cash value is determined based at least in part on a value of investments associated with in the variable annuity; computer program code for calculating a mortality and expense fee for a plurality of periods based on at least one variable having a value that is independent of a value of investments associated with in the variable annuity; and computer program code for using the mortality and expense fee to fund, at least in part, a risk associated with the guaranteed minimum death benefit of the variable annuity. | 3,600 |
13,545 | 13,545 | 13,866,525 | 3,675 | In accordance with an embodiment, electronic control is provided for the locking function of Lift-Handle and T-Handle products, while maintaining desirable mechanical latching mechanism functions and operations. | 1. An electronic control lift-handle product configured for mounting to a door of a cabinet to securely close the cabinet, the electronic control lift-handle product comprising:
a handle, a housing, a slider bolt, slider bolt pin, slider bolt guide, and one or more springs 4; and a CAM, motor, circuit board controller, eye, handle sensor, one or more CAM sensors, and an IRDA infrared transceiver, configured such that the handle seats in the housing when the unit is in the latched or locked position, the motor serves to rotate the CAM by 360 degrees to change the state of handle from locked to unlocked to latched, and wherein the slider bolt seats in the housing and is biased downward to the latched position by the one or more springs, and wherein the CAM maintains the slider bolt in the locked position if there is an attempt to push the slider bolt up to the unlocked position when the unit is locked. 2. An electronic control T-handle product configured for mounting to a door of a cabinet to securely close the cabinet, the electronic control t-handle product comprising:
a handle, a housing, latch hardware, a MCU and CPU control electronics, the handle residing inside of the housing, the MCU being controlled by the CPU to latch, lock and unlock the handle within the housing; wherein the MCU consists of a slider bolt, a spring, a CAM, a motor, a mount, a cover, a handle sensor, and one or more CAM sensors; and wherein the handle is locked into the housing by the slider bolt protruding into a handle slot when the unit is latched or locked, the motor serves to rotate the CAM through 360 degrees to change the state of the handle from locked, to unlocked, to latched, and wherein the CAM controls the slider bolt to maintain a locked position if there is an attempt to push the bolt toward the upward unlocked position when the unit is locked. | In accordance with an embodiment, electronic control is provided for the locking function of Lift-Handle and T-Handle products, while maintaining desirable mechanical latching mechanism functions and operations.1. An electronic control lift-handle product configured for mounting to a door of a cabinet to securely close the cabinet, the electronic control lift-handle product comprising:
a handle, a housing, a slider bolt, slider bolt pin, slider bolt guide, and one or more springs 4; and a CAM, motor, circuit board controller, eye, handle sensor, one or more CAM sensors, and an IRDA infrared transceiver, configured such that the handle seats in the housing when the unit is in the latched or locked position, the motor serves to rotate the CAM by 360 degrees to change the state of handle from locked to unlocked to latched, and wherein the slider bolt seats in the housing and is biased downward to the latched position by the one or more springs, and wherein the CAM maintains the slider bolt in the locked position if there is an attempt to push the slider bolt up to the unlocked position when the unit is locked. 2. An electronic control T-handle product configured for mounting to a door of a cabinet to securely close the cabinet, the electronic control t-handle product comprising:
a handle, a housing, latch hardware, a MCU and CPU control electronics, the handle residing inside of the housing, the MCU being controlled by the CPU to latch, lock and unlock the handle within the housing; wherein the MCU consists of a slider bolt, a spring, a CAM, a motor, a mount, a cover, a handle sensor, and one or more CAM sensors; and wherein the handle is locked into the housing by the slider bolt protruding into a handle slot when the unit is latched or locked, the motor serves to rotate the CAM through 360 degrees to change the state of the handle from locked, to unlocked, to latched, and wherein the CAM controls the slider bolt to maintain a locked position if there is an attempt to push the bolt toward the upward unlocked position when the unit is locked. | 3,600 |
13,546 | 13,546 | 11,693,554 | 3,685 | A technique in which content is supplied to an electronic reader device from a server is described. The reader device establishes a connection with the server and then automatically transmits its identification information to the server. In response, the server provides the electronic reader device with a representation corresponding to electronic content available from the server for purchase and/or display. The electronic reader device displays the representation wherein a user of the client electronic device purchases content by selecting the representation on the display. The server acknowledges the selection and/or purchase and automatically provides the electronic reader device with the corresponding electronic content for display. | 1. A method for directly transferring electronic content from a server to an electronic reader device, the method comprising:
establishing a direct connection between the server and the electronic reader device; upon establishment of the connection, automatically transmitting identification information of the electronic reader device to the server; directly transferring from the server a list of electronic content available from the server; directly transferring from the server to the electronic reader device selected electronic content; and storing the selected electronic content into a memory of the electronic reader device. 2. The method as recited in claim 1 further comprising providing an indication to the server with the electronic reader device of the selected content, and automatically acknowledging by the server purchase of content selection. 3. The method as recited in claim 1 wherein the electronic content is selected from the group of electronic content comprising: an eBook, and electronic magazine, an electronic newspaper and an electronic photograph. 4. The method as recited in claim 1 wherein the selected content is automatically purchased by debiting an account of the user of the electronic reader device on a server, wherein the account is automatically determined using the identification information. 5. The method as recited in claim 1 wherein the establishing, transmitting, receiving and transferring is done automatically without human intervention. 6. The method as recited in claim 1 wherein the server and electronic reader device is directly connected using a wireless connection. 7. A method for delivering electronic content from a server to an electronic reader device, the method comprising:
establishing a connection between the server and the electronic reader device; upon establishment of the connection, automatically receiving with the server the identification information of the electronic reader device; transmitting from the server to the client electronic device content available on the server for purchase; receiving an indication from the electronic reader device of a selection of the content; automatically purchasing the content corresponding to the selection using the identification information; and transmitting from the server the purchased electronic content for storage into a memory of the electronic reader device and for display by the electronic reader device. 8. The method as recited in claim 7 wherein the electronic content is selected from the group of electronic content comprising: an eBook, and electronic magazine, an electronic newspaper and an electronic photograph. 9. The method as recited in claim 7 wherein the automatic purchase of the content occurs by debiting an account of the user of the electronic reader device on a server, and wherein the account is automatically determined using the identification information. 10. The method as recited in claim 7 wherein the establishing, receiving, and transmitting the purchase is completed without human intervention. 11. The method as recited in claim 7 further comprising storing identification information about a user of a electronic reader device in a database of the server prior to establishing connection between the server and the electronic reader device. 12. The method as recited in claim 7 wherein a connection between the server and electronic reader device are directly connected and such direct connection is established using a wireless connection. 13. A method for obtaining electronic content from a server with an electronic reader device, the method comprising:
establishing a direct connection between the server and the electronic reader device; upon establishment of the connection, automatically transmitting identification information of the electronic reader device to the server; receiving from the server a list of representative content available from the server and previously purchased by a user of the electronic reader device; selecting content from the list; providing an indication to the server with the electronic reader device of the content selection, wherein the identification information is used by the server to verify an identity of the user prior to purchase of corresponding electronic content; and receiving from the server electronic content corresponding to the content selection. 14. The method as recited in claim 13 further comprising automatically displaying the stored content on the display of the electronic reader device. 15. The method as recited in claim 13 wherein the electronic content is previously purchased pursuant to a subscription service. 16. The method as recited in claim 13 further comprising:
selecting additional content on the display; providing an indication to the server with the electronic device of the additional content selection; receiving from the server electronic content corresponding to the second content selection; storing the received additional content in the memory of the client electronic device; and automatically displaying a representation corresponding to the additional stored content with the display. 17. A computer readable medium comprising computer-executable instructions for performing:
establishing a virtual connection with a server via a network; upon establishment of the virtual connection, automatically transmitting identification information to the server; receiving from the server a representation indicating electronic content available from the server for purchase; receiving an indication of a selection of content; providing the received indication to the server such that the server acknowledges a purchase of content corresponding to the content selection; receiving from the server electronic content corresponding to the content selection; and storing the received electronic content. 18. The computer readable medium as recited in claim 17, further comprising displaying the stored content. 19. The computer readable medium as recited in claim 17, wherein the content is automatically purchased by debiting an account of the user of the electronic reader device with the server, wherein the account is automatically determined using the identification information. 20. A computer readable medium comprising computer-executable instructions that, when executed by one or more processors, perform acts comprising:
establishing a virtual direct connection with an electronic reader device; upon establishment of the connection, automatically receiving the identification information of the electronic reader device; transmitting to the client electronic device representations indicating the electronic content available, said representations being displayable on a display of the electronic reader device; receiving an indication from the electronic reader device of a selection of representations made by a user of the electronic reader device; automatically registering a selection of the content corresponding to the symbol selection using the identification information; and transmitting the selected electronic content for storage into a memory of the electronic reader device and for subsequent display by the electronic reader device. 21. The computer readable medium as recited in claim 20 wherein the automatically registering of a selected of the content occurs by debiting an account of the user of the electronic reader device, and wherein the account is automatically determined using the identification information. 22. The computer readable medium as recited in claim 20 further comprising storing identification information about a user of a electronic reader device in a database prior to establishing a virtual connection with the electronic reader device. 23. The computer readable medium as recited in claim 20 further comprising automatically displaying the selected electronic content. 24. An electronic reader device comprising:
a transceiver module to establish a connection with a server via a network, upon establishment of the connection, to automatically transmit identification information to the server, and to receive from the server a representation indicating electronic content available from the server for purchase; a display; an input device; a display interface module to display the representation on the display; a user interface module to receive a selection of the representation on the display from the input device; said transceiver module to provide an indication to the server of the representation selection wherein a purchase of content corresponding to the symbol selection being automatically acknowledged by the server, and to receive from the server electronic content corresponding to the representation selection; storage module to store the received electronic content into a memory; and said display interface module to provide the stored received electronic content to the display. 25. The method as recited in claim 24 wherein the purchase of the content is acknowledged by debiting an account on the server, wherein the account is automatically determined using the identification information. | A technique in which content is supplied to an electronic reader device from a server is described. The reader device establishes a connection with the server and then automatically transmits its identification information to the server. In response, the server provides the electronic reader device with a representation corresponding to electronic content available from the server for purchase and/or display. The electronic reader device displays the representation wherein a user of the client electronic device purchases content by selecting the representation on the display. The server acknowledges the selection and/or purchase and automatically provides the electronic reader device with the corresponding electronic content for display.1. A method for directly transferring electronic content from a server to an electronic reader device, the method comprising:
establishing a direct connection between the server and the electronic reader device; upon establishment of the connection, automatically transmitting identification information of the electronic reader device to the server; directly transferring from the server a list of electronic content available from the server; directly transferring from the server to the electronic reader device selected electronic content; and storing the selected electronic content into a memory of the electronic reader device. 2. The method as recited in claim 1 further comprising providing an indication to the server with the electronic reader device of the selected content, and automatically acknowledging by the server purchase of content selection. 3. The method as recited in claim 1 wherein the electronic content is selected from the group of electronic content comprising: an eBook, and electronic magazine, an electronic newspaper and an electronic photograph. 4. The method as recited in claim 1 wherein the selected content is automatically purchased by debiting an account of the user of the electronic reader device on a server, wherein the account is automatically determined using the identification information. 5. The method as recited in claim 1 wherein the establishing, transmitting, receiving and transferring is done automatically without human intervention. 6. The method as recited in claim 1 wherein the server and electronic reader device is directly connected using a wireless connection. 7. A method for delivering electronic content from a server to an electronic reader device, the method comprising:
establishing a connection between the server and the electronic reader device; upon establishment of the connection, automatically receiving with the server the identification information of the electronic reader device; transmitting from the server to the client electronic device content available on the server for purchase; receiving an indication from the electronic reader device of a selection of the content; automatically purchasing the content corresponding to the selection using the identification information; and transmitting from the server the purchased electronic content for storage into a memory of the electronic reader device and for display by the electronic reader device. 8. The method as recited in claim 7 wherein the electronic content is selected from the group of electronic content comprising: an eBook, and electronic magazine, an electronic newspaper and an electronic photograph. 9. The method as recited in claim 7 wherein the automatic purchase of the content occurs by debiting an account of the user of the electronic reader device on a server, and wherein the account is automatically determined using the identification information. 10. The method as recited in claim 7 wherein the establishing, receiving, and transmitting the purchase is completed without human intervention. 11. The method as recited in claim 7 further comprising storing identification information about a user of a electronic reader device in a database of the server prior to establishing connection between the server and the electronic reader device. 12. The method as recited in claim 7 wherein a connection between the server and electronic reader device are directly connected and such direct connection is established using a wireless connection. 13. A method for obtaining electronic content from a server with an electronic reader device, the method comprising:
establishing a direct connection between the server and the electronic reader device; upon establishment of the connection, automatically transmitting identification information of the electronic reader device to the server; receiving from the server a list of representative content available from the server and previously purchased by a user of the electronic reader device; selecting content from the list; providing an indication to the server with the electronic reader device of the content selection, wherein the identification information is used by the server to verify an identity of the user prior to purchase of corresponding electronic content; and receiving from the server electronic content corresponding to the content selection. 14. The method as recited in claim 13 further comprising automatically displaying the stored content on the display of the electronic reader device. 15. The method as recited in claim 13 wherein the electronic content is previously purchased pursuant to a subscription service. 16. The method as recited in claim 13 further comprising:
selecting additional content on the display; providing an indication to the server with the electronic device of the additional content selection; receiving from the server electronic content corresponding to the second content selection; storing the received additional content in the memory of the client electronic device; and automatically displaying a representation corresponding to the additional stored content with the display. 17. A computer readable medium comprising computer-executable instructions for performing:
establishing a virtual connection with a server via a network; upon establishment of the virtual connection, automatically transmitting identification information to the server; receiving from the server a representation indicating electronic content available from the server for purchase; receiving an indication of a selection of content; providing the received indication to the server such that the server acknowledges a purchase of content corresponding to the content selection; receiving from the server electronic content corresponding to the content selection; and storing the received electronic content. 18. The computer readable medium as recited in claim 17, further comprising displaying the stored content. 19. The computer readable medium as recited in claim 17, wherein the content is automatically purchased by debiting an account of the user of the electronic reader device with the server, wherein the account is automatically determined using the identification information. 20. A computer readable medium comprising computer-executable instructions that, when executed by one or more processors, perform acts comprising:
establishing a virtual direct connection with an electronic reader device; upon establishment of the connection, automatically receiving the identification information of the electronic reader device; transmitting to the client electronic device representations indicating the electronic content available, said representations being displayable on a display of the electronic reader device; receiving an indication from the electronic reader device of a selection of representations made by a user of the electronic reader device; automatically registering a selection of the content corresponding to the symbol selection using the identification information; and transmitting the selected electronic content for storage into a memory of the electronic reader device and for subsequent display by the electronic reader device. 21. The computer readable medium as recited in claim 20 wherein the automatically registering of a selected of the content occurs by debiting an account of the user of the electronic reader device, and wherein the account is automatically determined using the identification information. 22. The computer readable medium as recited in claim 20 further comprising storing identification information about a user of a electronic reader device in a database prior to establishing a virtual connection with the electronic reader device. 23. The computer readable medium as recited in claim 20 further comprising automatically displaying the selected electronic content. 24. An electronic reader device comprising:
a transceiver module to establish a connection with a server via a network, upon establishment of the connection, to automatically transmit identification information to the server, and to receive from the server a representation indicating electronic content available from the server for purchase; a display; an input device; a display interface module to display the representation on the display; a user interface module to receive a selection of the representation on the display from the input device; said transceiver module to provide an indication to the server of the representation selection wherein a purchase of content corresponding to the symbol selection being automatically acknowledged by the server, and to receive from the server electronic content corresponding to the representation selection; storage module to store the received electronic content into a memory; and said display interface module to provide the stored received electronic content to the display. 25. The method as recited in claim 24 wherein the purchase of the content is acknowledged by debiting an account on the server, wherein the account is automatically determined using the identification information. | 3,600 |
13,547 | 13,547 | 13,726,295 | 3,649 | An improved method for providing data based awards for an electronic gaming device has been developed. The method includes receiving a wager from a player, generating an outcome for the wager with the electronic gaming device, and displaying an outcome associated with the wager. Finally, the method includes a step for paying the player with an award comprised entirely of data. | 1. A method for electronic gambling, comprising:
receiving a wager from a player at an electronic gaming device; generating an outcome for the wager with the electronic gaming device; displaying an outcome associated with the wager by the electronic gaming device; and step for paying the player with an award comprised entirely of data. 2. A method for electronic gambling, comprising:
receiving a wager from a player at an electronic gaming device; generating an outcome for the wager with the electronic gaming device; displaying an outcome associated with the wager by the electronic gaming device; paying the player with an award comprised entirely of data; and step for electronically delivering the payment into a player's possession. 3. The method of claim 2, where the award is reusable. 4. The method of claim 2, where the payment is a digital key. 5. The method of claim 2, where the payment is software. 6. The method of claim 2, where the payment is digital content. 7. The method of claim 2, where the payment is an audio file. 8. The method of claim 2, where the payment is a video file. 9. The method of claim 2, where the payment is a still image file. 10. The method of claim 2, where the payment is a movie file. 11. The method of claim 2, where the payment is a game file. 12. The method of claim 2, where the payment is a ring tone for a cellular telephone. 13. The method of claim 2, where the payment is an undisclosed gambling game outcome. 14. The method of claim 2, where the delivery is made via email. 15. The method of claim 2, where the delivery is made via a wireless connection. 16. The method of claim 2, where the delivery is made via a physical connection. 17. The method of claim 2, where the payment is in response to a machine event. 18. The method of claim 17, where the machine event is a payment by the player. 19. The method of claim 17, where the machine event is payment to the player. 20. The method of claim 17, where the machine event is a jackpot. 21. The method of claim 17, where the machine event is based on a player tracking measure. 22. The method of claim 17, where the machine event is a player engaging the gaming device. | An improved method for providing data based awards for an electronic gaming device has been developed. The method includes receiving a wager from a player, generating an outcome for the wager with the electronic gaming device, and displaying an outcome associated with the wager. Finally, the method includes a step for paying the player with an award comprised entirely of data.1. A method for electronic gambling, comprising:
receiving a wager from a player at an electronic gaming device; generating an outcome for the wager with the electronic gaming device; displaying an outcome associated with the wager by the electronic gaming device; and step for paying the player with an award comprised entirely of data. 2. A method for electronic gambling, comprising:
receiving a wager from a player at an electronic gaming device; generating an outcome for the wager with the electronic gaming device; displaying an outcome associated with the wager by the electronic gaming device; paying the player with an award comprised entirely of data; and step for electronically delivering the payment into a player's possession. 3. The method of claim 2, where the award is reusable. 4. The method of claim 2, where the payment is a digital key. 5. The method of claim 2, where the payment is software. 6. The method of claim 2, where the payment is digital content. 7. The method of claim 2, where the payment is an audio file. 8. The method of claim 2, where the payment is a video file. 9. The method of claim 2, where the payment is a still image file. 10. The method of claim 2, where the payment is a movie file. 11. The method of claim 2, where the payment is a game file. 12. The method of claim 2, where the payment is a ring tone for a cellular telephone. 13. The method of claim 2, where the payment is an undisclosed gambling game outcome. 14. The method of claim 2, where the delivery is made via email. 15. The method of claim 2, where the delivery is made via a wireless connection. 16. The method of claim 2, where the delivery is made via a physical connection. 17. The method of claim 2, where the payment is in response to a machine event. 18. The method of claim 17, where the machine event is a payment by the player. 19. The method of claim 17, where the machine event is payment to the player. 20. The method of claim 17, where the machine event is a jackpot. 21. The method of claim 17, where the machine event is based on a player tracking measure. 22. The method of claim 17, where the machine event is a player engaging the gaming device. | 3,600 |
13,548 | 13,548 | 14,309,397 | 3,685 | Methods, systems, and devices for secure transaction management are provided. Embodiments include a method for providing secure transactions that include receiving an identifier of a financial account at a payment processor system. A token may be generated that is linked with the identifier of the financial account at the payment processor system. The identifier of the financial account and the token may be stored securely at the payment processor system. The token may be transmitted without the identifier of the financial account to at least a recipient system or a recipient device where the token replaces the identifier of the financial account. | 1-22. (canceled) 23. A method for providing secure transactions, the method comprising:
receiving an identifier of a financial account; creating a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account; storing the identifier of the financial account and the customer identifier; initiating a transaction using the customer identifier; transmitting the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution; receiving authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and replacing the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 24. The method for providing secure transactions of claim 23, further comprising:
encrypting the identifier of the financial account. 25. The method for providing secure transactions of claim 24, wherein:
encrypting the identifier of the financial account utilizes an asymmetric key. 26. The method for providing secure transactions of claim 23, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 27. The method for providing secure transactions of claim 23, further comprising:
initiating at least a transaction adjustment, a transaction refund, or a transaction settlement using the token. 28. The method for providing secure transactions of claim 23, further comprising:
enrolling the customer in a registered card program. 29. The method for providing secure transactions of claim 23, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account. 30. A computer program embodied on a computer readable medium, the computer program comprising instructions executable by a computer to:
receive an identifier of the financial account; create a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account; store the identifier of the financial account and the customer identifier; initiate a transaction using the customer identifier; transmit the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution; receive authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and replace the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 31. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
encrypt the at least one of the one or more identifiers of financial accounts. 32. The computer program embodied on a computer readable medium of claim 31, wherein:
encryption of the identifier of the financial account utilizes an asymmetric key. 33. The computer program embodied on a computer readable medium of claim 30, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 34. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
initiate at least a transaction adjustment, a transaction refund, or a transaction settlement using the token. 35. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
enroll the customer in a registered card program. 36. The computer program embodied on a computer readable medium of claim 30, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account. 37. A system for providing secure transactions, the system comprising:
an input component for receiving an identifier of the financial account; a processor communicatively coupled with the input component; an output component communicatively coupled with the processor; a memory communicatively coupled with and readable by the processor, the memory having stored therein a series of instructions which, when executed by the processor, cause the processor to:
create a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account;
store the identifier of the financial account and the customer identifier;
initiate a transaction using the customer identifier;
transmit the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution;
receive authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and
replace the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 38. The system for providing secure transactions of claim 37, wherein the series of instructions further comprises instructions causing the processor to:
encrypt the identifier of the financial account. 39. The system for providing secure transactions of claim 38, wherein:
encryption of the identifier of the financial account utilizes an asymmetric key. 40. The system for providing secure transactions of claim 37, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 41. The system for providing secure transactions of claim 37, wherein the series of instructions further comprises instructions causing the processor to:
enroll the customer in a registered card program. 42. The system for providing secure transactions of claim 37, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account | Methods, systems, and devices for secure transaction management are provided. Embodiments include a method for providing secure transactions that include receiving an identifier of a financial account at a payment processor system. A token may be generated that is linked with the identifier of the financial account at the payment processor system. The identifier of the financial account and the token may be stored securely at the payment processor system. The token may be transmitted without the identifier of the financial account to at least a recipient system or a recipient device where the token replaces the identifier of the financial account.1-22. (canceled) 23. A method for providing secure transactions, the method comprising:
receiving an identifier of a financial account; creating a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account; storing the identifier of the financial account and the customer identifier; initiating a transaction using the customer identifier; transmitting the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution; receiving authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and replacing the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 24. The method for providing secure transactions of claim 23, further comprising:
encrypting the identifier of the financial account. 25. The method for providing secure transactions of claim 24, wherein:
encrypting the identifier of the financial account utilizes an asymmetric key. 26. The method for providing secure transactions of claim 23, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 27. The method for providing secure transactions of claim 23, further comprising:
initiating at least a transaction adjustment, a transaction refund, or a transaction settlement using the token. 28. The method for providing secure transactions of claim 23, further comprising:
enrolling the customer in a registered card program. 29. The method for providing secure transactions of claim 23, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account. 30. A computer program embodied on a computer readable medium, the computer program comprising instructions executable by a computer to:
receive an identifier of the financial account; create a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account; store the identifier of the financial account and the customer identifier; initiate a transaction using the customer identifier; transmit the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution; receive authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and replace the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 31. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
encrypt the at least one of the one or more identifiers of financial accounts. 32. The computer program embodied on a computer readable medium of claim 31, wherein:
encryption of the identifier of the financial account utilizes an asymmetric key. 33. The computer program embodied on a computer readable medium of claim 30, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 34. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
initiate at least a transaction adjustment, a transaction refund, or a transaction settlement using the token. 35. The computer program embodied on a computer readable medium of claim 30, wherein the computer program further comprises instructions executable by a computer to:
enroll the customer in a registered card program. 36. The computer program embodied on a computer readable medium of claim 30, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account. 37. A system for providing secure transactions, the system comprising:
an input component for receiving an identifier of the financial account; a processor communicatively coupled with the input component; an output component communicatively coupled with the processor; a memory communicatively coupled with and readable by the processor, the memory having stored therein a series of instructions which, when executed by the processor, cause the processor to:
create a customer identifier linking a customer to a merchant, the customer identifier associated with the identifier of the financial account;
store the identifier of the financial account and the customer identifier;
initiate a transaction using the customer identifier;
transmit the customer identifier or the identifier of the financial account to a payment processor system for transmission to a financial institution;
receive authorization and a token associated with the customer identifier and the identifier of the financial account, wherein the token comprises a random number; and
replace the identifier of the financial account with the token to limit the use of the identifier of the financial account for enhanced security. 38. The system for providing secure transactions of claim 37, wherein the series of instructions further comprises instructions causing the processor to:
encrypt the identifier of the financial account. 39. The system for providing secure transactions of claim 38, wherein:
encryption of the identifier of the financial account utilizes an asymmetric key. 40. The system for providing secure transactions of claim 37, wherein:
a first checksum from the token equals a second checksum from the identifier of the financial account. 41. The system for providing secure transactions of claim 37, wherein the series of instructions further comprises instructions causing the processor to:
enroll the customer in a registered card program. 42. The system for providing secure transactions of claim 37, wherein:
the token includes a subset of digits that form a sequence of digits that are the same as in the identifier of the financial account | 3,600 |
13,549 | 13,549 | 14,457,963 | 3,684 | A user may request a recommendation for an item from other users. Other users may respond to the request by recommending for or against items. Users may up-vote or down-vote the recommendations or responses of other users. The recommendations of the other users may be used to identify items and provide one or more recommendations to the requesting user. The original question and the responses may form a conversation thread. The recommendations may be inserted into the thread as responses, may be presented alongside the thread, or may be presented at the end of the thread. The recommendations may be based on one or more attributes of the user. The weight of the recommendations provided by other users may vary. | 1. A method comprising:
detecting that a user has requested a recommendation of an item; detecting a set of recommendations provided by one or more other users in response to the request; parsing the set of recommendations using a processor of a machine to identify a set of items in a database; selecting a recommended item from the set of items; and presenting information about the recommended item to the user. 2. The method of claim 1, wherein:
the selecting of the recommended item is based on an attribute of the user that requested the recommendation. 3. The method of claim 1, wherein:
the information about the recommended item is presented alongside the recommendations provided by the one or more other users. 4. The method of claim 1, wherein:
the information about the recommended item is presented inline with the recommendations provided by the one or more other users. 5. The method of claim 1, further comprising:
identifying a location of the user; and wherein the selecting of the recommended item is further based on the location of the user. 6. The method of claim 1, wherein the information about the item is one or more of a banner advertisement, a text advertisement, a message, and a pop-up window. 7. The method of claim 1, wherein the detecting of the set of recommendations provided by the one or more other users in response to the request includes:
accessing a set of comments by the one or more other users; and for each comment in the set of comments:
determining if a product is mentioned in the comment; and
if a product is mentioned, determining if the comment is positive or negative. 8. The method of claim 1, further comprising:
accessing a size of the set of recommendations provided by the one or more other users; and wherein the selecting of the recommended item occurs in response to a determination that the size exceeds a threshold. 9. The method of claim 1, wherein:
the selecting of the recommended item is based on a weight associated with each recommendation provided by the one or more other users. 10. The method of claim 9, further comprising:
identifying a user corresponding to each recommendation, from the one or more other users; for each identified user, determining a number of previously-provided recommendations that were followed; and wherein the weight associated with each recommendation is based on the determined number for the user providing the recommendation. 11. The method of claim 10, further comprising:
for each previously-provided recommendation that was followed, determining whether the following of the recommendation resulted in a purchase; and wherein the number for the user that provided the recommendation that resulted in a purchase is adjusted based on the determination. 12. The method of claim 9, wherein
the detecting of the set of recommendations includes detecting, for each recommendation in the set, a degree to which the recommendation was agreed with by users; and wherein the selecting of the recommended item from the set of items is based on the degree to which one or more recommendations corresponding to the recommended item were agreed with. 13. The method of claim 1, further comprising:
detecting an end of a batch of comments, the detection based on an elapsed time after a last comment exceeding a threshold without a further comment; and wherein the identifying of the recommended item occurs after the detecting of the end of the batch. 14. The method of claim 13, further comprising:
detecting a beginning of a second batch of comments, the detection based on a first comment after the presenting of the information about the recommended item; detecting an end of the second batch of comments, the detection based on an elapsed time after a second comment exceeding a threshold without an additional comment; based on one or more recommendations provided in the second batch of comments, identifying a second recommended item; and presenting information about the second recommended item to the user. 15. The method of claim 1, further comprising:
identifying a category of the item based on the request of the user; and wherein the identifying of the recommended item is further based on the category of the item. 16. The method of claim 15, further comprising:
identifying a user corresponding to each recommendation, from the one or more other users; for each identified user, accessing an affinity between the user and the category; and wherein the weight associated with each recommendation is based on the affinity for the user providing the recommendation. 17. A system comprising:
a memory; and one or more modules coupled to the memory and configured to:
detect that a user has requested a recommendation of an item;
detect one or more recommendations provided by one or more other users in response to the request;
based on the one or more recommendations provided by the other users, identify a recommended item; and
present information about the recommended item to the user. 18. The system of claim 17, wherein:
the identifying of the recommended item is based on a weight associated with each recommendation provided by the one or more other users. 19. The system of claim 17, wherein:
the identifying of the recommended item is based on an attribute of the user that requested the recommendation. 20. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
detecting that a user has requested a recommendation of an item; detecting one or more recommendations provided by one or more other users in response to the request; based on the one or more recommendations provided by the other users, identifying a recommended item; and presenting the recommended item to the user. | A user may request a recommendation for an item from other users. Other users may respond to the request by recommending for or against items. Users may up-vote or down-vote the recommendations or responses of other users. The recommendations of the other users may be used to identify items and provide one or more recommendations to the requesting user. The original question and the responses may form a conversation thread. The recommendations may be inserted into the thread as responses, may be presented alongside the thread, or may be presented at the end of the thread. The recommendations may be based on one or more attributes of the user. The weight of the recommendations provided by other users may vary.1. A method comprising:
detecting that a user has requested a recommendation of an item; detecting a set of recommendations provided by one or more other users in response to the request; parsing the set of recommendations using a processor of a machine to identify a set of items in a database; selecting a recommended item from the set of items; and presenting information about the recommended item to the user. 2. The method of claim 1, wherein:
the selecting of the recommended item is based on an attribute of the user that requested the recommendation. 3. The method of claim 1, wherein:
the information about the recommended item is presented alongside the recommendations provided by the one or more other users. 4. The method of claim 1, wherein:
the information about the recommended item is presented inline with the recommendations provided by the one or more other users. 5. The method of claim 1, further comprising:
identifying a location of the user; and wherein the selecting of the recommended item is further based on the location of the user. 6. The method of claim 1, wherein the information about the item is one or more of a banner advertisement, a text advertisement, a message, and a pop-up window. 7. The method of claim 1, wherein the detecting of the set of recommendations provided by the one or more other users in response to the request includes:
accessing a set of comments by the one or more other users; and for each comment in the set of comments:
determining if a product is mentioned in the comment; and
if a product is mentioned, determining if the comment is positive or negative. 8. The method of claim 1, further comprising:
accessing a size of the set of recommendations provided by the one or more other users; and wherein the selecting of the recommended item occurs in response to a determination that the size exceeds a threshold. 9. The method of claim 1, wherein:
the selecting of the recommended item is based on a weight associated with each recommendation provided by the one or more other users. 10. The method of claim 9, further comprising:
identifying a user corresponding to each recommendation, from the one or more other users; for each identified user, determining a number of previously-provided recommendations that were followed; and wherein the weight associated with each recommendation is based on the determined number for the user providing the recommendation. 11. The method of claim 10, further comprising:
for each previously-provided recommendation that was followed, determining whether the following of the recommendation resulted in a purchase; and wherein the number for the user that provided the recommendation that resulted in a purchase is adjusted based on the determination. 12. The method of claim 9, wherein
the detecting of the set of recommendations includes detecting, for each recommendation in the set, a degree to which the recommendation was agreed with by users; and wherein the selecting of the recommended item from the set of items is based on the degree to which one or more recommendations corresponding to the recommended item were agreed with. 13. The method of claim 1, further comprising:
detecting an end of a batch of comments, the detection based on an elapsed time after a last comment exceeding a threshold without a further comment; and wherein the identifying of the recommended item occurs after the detecting of the end of the batch. 14. The method of claim 13, further comprising:
detecting a beginning of a second batch of comments, the detection based on a first comment after the presenting of the information about the recommended item; detecting an end of the second batch of comments, the detection based on an elapsed time after a second comment exceeding a threshold without an additional comment; based on one or more recommendations provided in the second batch of comments, identifying a second recommended item; and presenting information about the second recommended item to the user. 15. The method of claim 1, further comprising:
identifying a category of the item based on the request of the user; and wherein the identifying of the recommended item is further based on the category of the item. 16. The method of claim 15, further comprising:
identifying a user corresponding to each recommendation, from the one or more other users; for each identified user, accessing an affinity between the user and the category; and wherein the weight associated with each recommendation is based on the affinity for the user providing the recommendation. 17. A system comprising:
a memory; and one or more modules coupled to the memory and configured to:
detect that a user has requested a recommendation of an item;
detect one or more recommendations provided by one or more other users in response to the request;
based on the one or more recommendations provided by the other users, identify a recommended item; and
present information about the recommended item to the user. 18. The system of claim 17, wherein:
the identifying of the recommended item is based on a weight associated with each recommendation provided by the one or more other users. 19. The system of claim 17, wherein:
the identifying of the recommended item is based on an attribute of the user that requested the recommendation. 20. A non-transitory machine-readable storage medium comprising instructions that, when executed by one or more processors of a machine, cause the machine to perform operations comprising:
detecting that a user has requested a recommendation of an item; detecting one or more recommendations provided by one or more other users in response to the request; based on the one or more recommendations provided by the other users, identifying a recommended item; and presenting the recommended item to the user. | 3,600 |
13,550 | 13,550 | 14,524,536 | 3,626 | A method, system and computer-usable medium are disclosed for conditionally overriding strict criteria for a prospective medical treatment. Criteria for answering a question are received by a Question/Answer (QA) system, wherein the question is associated with a proposed medical treatment and the criteria are associated with a first condition. A second condition affecting the first condition is identified, which results in a modification to the first condition when it is determined that the second condition exceeds a predetermined threshold. | 1-8. (canceled) 9. A system comprising:
a processor, a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code used for answering questions based upon conditional criteria and comprising instructions executable by the processor and configured for:
receiving criteria for answering a question, the criteria associated with a first condition and received by a system configured to answer questions;
identifying a second condition affecting the first condition; and
answering the question with a modification of the first condition, the answering performed in response to determining that the second condition exceeds a threshold. 10. The system of claim 9, wherein:
the question is a prospective treatment for a medical condition associated with a person. 11. The system of claim 9, wherein:
the first condition is a numerical value; and the second condition is a factor affecting the prospective treatment associated with the first condition. 12. The system of claim 11, wherein:
the factor affecting the prospective treatment is determined to improve results for the prospective treatment. 13. The system of claim 9, wherein:
the modification of the first condition results in a first evaluation of the prospective treatment being changed to a second evaluation. 14. The system of claim 13, wherein:
the second evaluation is the opposite of the first evaluation. 15. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
receiving criteria for answering a question, the criteria associated with a first condition and received by a system configured to answer questions; identifying a second condition affecting the first condition; and answering the question with a modification of the first condition, the answering performed in response to determining that the second condition exceeds a threshold. 16. The non-transitory, computer-readable storage medium of claim 15, wherein:
the question is a prospective treatment for a medical condition associated with a person. 17. The non-transitory, computer-readable storage medium of claim 15, wherein:
the first condition is a numerical value; and the second condition is a factor affecting the prospective treatment associated with the first condition. 18. The non-transitory, computer-readable storage medium of claim 17, wherein:
the factor affecting the prospective treatment is determined to improve results for the prospective treatment. 19. The non-transitory, computer-readable storage medium of claim 15, wherein:
the modification of the first condition results in a first evaluation of the prospective treatment being changed to a second evaluation. 20. The non-transitory, computer-readable storage medium of claim 19, wherein:
the second evaluation is the opposite of the first evaluation. | A method, system and computer-usable medium are disclosed for conditionally overriding strict criteria for a prospective medical treatment. Criteria for answering a question are received by a Question/Answer (QA) system, wherein the question is associated with a proposed medical treatment and the criteria are associated with a first condition. A second condition affecting the first condition is identified, which results in a modification to the first condition when it is determined that the second condition exceeds a predetermined threshold.1-8. (canceled) 9. A system comprising:
a processor, a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code used for answering questions based upon conditional criteria and comprising instructions executable by the processor and configured for:
receiving criteria for answering a question, the criteria associated with a first condition and received by a system configured to answer questions;
identifying a second condition affecting the first condition; and
answering the question with a modification of the first condition, the answering performed in response to determining that the second condition exceeds a threshold. 10. The system of claim 9, wherein:
the question is a prospective treatment for a medical condition associated with a person. 11. The system of claim 9, wherein:
the first condition is a numerical value; and the second condition is a factor affecting the prospective treatment associated with the first condition. 12. The system of claim 11, wherein:
the factor affecting the prospective treatment is determined to improve results for the prospective treatment. 13. The system of claim 9, wherein:
the modification of the first condition results in a first evaluation of the prospective treatment being changed to a second evaluation. 14. The system of claim 13, wherein:
the second evaluation is the opposite of the first evaluation. 15. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
receiving criteria for answering a question, the criteria associated with a first condition and received by a system configured to answer questions; identifying a second condition affecting the first condition; and answering the question with a modification of the first condition, the answering performed in response to determining that the second condition exceeds a threshold. 16. The non-transitory, computer-readable storage medium of claim 15, wherein:
the question is a prospective treatment for a medical condition associated with a person. 17. The non-transitory, computer-readable storage medium of claim 15, wherein:
the first condition is a numerical value; and the second condition is a factor affecting the prospective treatment associated with the first condition. 18. The non-transitory, computer-readable storage medium of claim 17, wherein:
the factor affecting the prospective treatment is determined to improve results for the prospective treatment. 19. The non-transitory, computer-readable storage medium of claim 15, wherein:
the modification of the first condition results in a first evaluation of the prospective treatment being changed to a second evaluation. 20. The non-transitory, computer-readable storage medium of claim 19, wherein:
the second evaluation is the opposite of the first evaluation. | 3,600 |
13,551 | 13,551 | 13,297,117 | 3,622 | A social networking system may identify a first set of users as part of a training cluster and identify a second set of users that is similar to the first set of users for purposes of targeting advertisements related to the advertiser. Using past engagement history (e.g., click-through rates), demographic information, and keywords associated with the training cluster of users, a social networking system may generate a training model specific to the training cluster. Confidence scores may be used to identify similar users across the total population of users of the social networking system for creating a targeting cluster of users for the advertisement. A revenue sharing scheme may be used induce page administrators to increase their fan base by enabling advertisers to target advertisements to users that have expressed interest in pages associated with the page administrators. | 1. A method comprising:
maintaining a plurality of ad objects in a social networking system corresponding to a plurality of advertisements for display to users of the social networking system; maintaining a plurality of user profile objects in a social networking system, the plurality of user profile objects associated with a plurality of users of the social networking system; receiving a selection of targeting criteria for an advertisement by an advertiser, where the targeting criteria of the advertisement includes targeting the advertisement to users that are similar to a training cluster of users; determining the training cluster of users for the advertisement based on the selection of the targeting criteria; determining a targeting cluster of users for the advertisement based on the training cluster of users; and for a viewing user in the targeting cluster of users interacting with the social networking system, providing the advertisement by the advertiser to the viewing user. 2. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of a page on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the page on the social networking system. 3. The method of claim 2, further comprising:
providing a share of revenue collected from the advertisement to an administrator of the page. 4. The method of claim 2, further comprising:
providing an interface for selecting a brand associated with an advertiser of a plurality of advertisers, where the interface is used for selecting targeting criteria for advertisements on the social networking system and the brand is embodied in the page of the social networking system. 5. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of an action type on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the action type on the social networking system. 6. The method of claim 1, wherein the targeting cluster of users is larger than the training cluster of users. 7. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of an application on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the application on the social networking system. 8. The method of claim 1, wherein determining a targeting cluster of users for the advertisement based on the training cluster of users further comprises:
generating a user model based on the training cluster of users; determining a confidence score for each user of a population of users on the social networking system based on the user model; and determining the targeting cluster of users based on the confidence scores of the population of users. 9. The method of claim 1, wherein providing the advertisement by the advertiser to the viewing user further comprises:
marking the advertisement as a candidate advertisement; determining a score for the advertisement against a plurality of other candidate advertisements based on a bidding auction; and selecting the advertisement based on the score. 10. A method comprising:
determining a training cluster of users of a social networking system where the training cluster of users is defined by targeting criteria associated with an advertisement; generating a user model based on the training cluster of users, where the user model evaluates one or more features of a user to determine a confidence score for the user; determining a confidence score for each user of a population of users of the social networking system based on the user model; selecting a plurality of users from the population of users based on the determined confidence scores to create a targeting cluster of users; and for a viewing user, providing the advertisement associated with the training cluster of users for display to the viewing user based on whether the viewing user is in the targeting cluster of users. 11. The method of claim 10, wherein determining a training cluster of users of a social networking system further comprises:
receiving identifying information of users of the social networking system that are included in the training cluster of users. 12. The method of claim 10, wherein determining a training cluster of users of a social networking system further comprises:
determining identifying information of users of the social networking system that are included in the training cluster of users based on the users previously engaging with a selected advertisement. 13. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving a keyword profile describing each user of the training cluster of users, the keyword profile including a plurality of keywords; determining a list of keyword features for the user model, the list of keyword features comprising a selection of keywords from the keyword profiles of the training cluster of users; and generating the user model based on the list of keyword features. 14. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving demographics information describing each user of the training cluster of users; determining a list of demographics features for the user model, the list of demographics features comprising a selection of types of demographics information describing the training cluster of users; and generating the user model based on the list of demographics features. 15. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving a user engagement history for each user of the training cluster of users, the user engagement history for each user including a history of behavior for the user; determining a user engagement distribution for the training cluster of users based on the received user engagement histories for the training cluster of users; and generating the user model using the user engagement distribution for the training cluster of users. 16. The method of claim 15, wherein selecting similar users from the population of users based on confidence scores of the similar users further comprises:
generating a plurality of bins based on the user engagement distribution for the training cluster of users; distributing the population of users into the plurality of bins based on user engagement histories of the population of users; and selecting a top percentage of similar users from each of the plurality of bins based on confidence scores of the similar users. 17. The method of claim 10, further comprising:
storing the user model for the advertisement in the social networking system; 18. The method of claim 10, wherein a population of users includes users located in a specified geographic location. 19. A method comprising:
maintaining a plurality of user profile objects on a social networking system, the plurality of user profile objects representing a plurality of users of the social networking system; maintaining a plurality of edge objects connecting a plurality of nodes in the social networking system, where a subset of the plurality of nodes represent a plurality of advertisers; determining a subset of the plurality of user profile objects associated with a specified advertiser based on at least one edge object connecting at least one node representing the specified advertiser to each of the user profile objects in the subset of the plurality of user profile objects; determining a plurality of features for a training model based on the subset of the plurality of user profile objects; determining a plurality of confidence scores for the subset of the plurality of user profile objects based on the training model; selecting a plurality of targeted user profile objects based on the plurality of confidence scores; and storing the plurality of targeted user profile objects as a cluster in the social networking system. 20. The method of claim 19, wherein a subset of the plurality of edge objects are generated based on a plurality of graph actions performed by a subset of the plurality of users on a plurality of graph objects on external systems, the plurality of graph actions and the plurality of graph objects defined by a plurality of entities external to the social networking system. 21. The method of claim 19, wherein the cluster is filtered to include a subset of the plurality of targeted user profile objects based on the subset of the plurality of targeted user profile objects associated with the subset of the plurality of user profile objects associated with the specified advertiser. 22. The method of claim 19, wherein the cluster is filtered to include a subset of the plurality of targeted user profile objects based on a specified geographic location. 23. The method of claim 19, wherein the training model comprises a machine learning model. 24. The method of claim 19, wherein determining a plurality of features for a training model based on the subset of the plurality of user profile objects further comprises:
determining a plurality of affinity scores for a plurality of interests based on the subset of the plurality of user profile objects as the plurality of features for the training model. 25. The method of claim 19, wherein determining a plurality of features for a training model based on the subset of the plurality of user profile objects further comprises:
receiving a performance metric for a feature in the training model; and modifying the training model based on the performance metric for the feature. 26. The method of claim 19, further comprising:
storing the cluster as targeting criteria for an advertisement in the social networking system. | A social networking system may identify a first set of users as part of a training cluster and identify a second set of users that is similar to the first set of users for purposes of targeting advertisements related to the advertiser. Using past engagement history (e.g., click-through rates), demographic information, and keywords associated with the training cluster of users, a social networking system may generate a training model specific to the training cluster. Confidence scores may be used to identify similar users across the total population of users of the social networking system for creating a targeting cluster of users for the advertisement. A revenue sharing scheme may be used induce page administrators to increase their fan base by enabling advertisers to target advertisements to users that have expressed interest in pages associated with the page administrators.1. A method comprising:
maintaining a plurality of ad objects in a social networking system corresponding to a plurality of advertisements for display to users of the social networking system; maintaining a plurality of user profile objects in a social networking system, the plurality of user profile objects associated with a plurality of users of the social networking system; receiving a selection of targeting criteria for an advertisement by an advertiser, where the targeting criteria of the advertisement includes targeting the advertisement to users that are similar to a training cluster of users; determining the training cluster of users for the advertisement based on the selection of the targeting criteria; determining a targeting cluster of users for the advertisement based on the training cluster of users; and for a viewing user in the targeting cluster of users interacting with the social networking system, providing the advertisement by the advertiser to the viewing user. 2. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of a page on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the page on the social networking system. 3. The method of claim 2, further comprising:
providing a share of revenue collected from the advertisement to an administrator of the page. 4. The method of claim 2, further comprising:
providing an interface for selecting a brand associated with an advertiser of a plurality of advertisers, where the interface is used for selecting targeting criteria for advertisements on the social networking system and the brand is embodied in the page of the social networking system. 5. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of an action type on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the action type on the social networking system. 6. The method of claim 1, wherein the targeting cluster of users is larger than the training cluster of users. 7. The method of claim 1, wherein determining the training cluster of users for the advertisement based on the targeting criteria further comprises:
receiving a selection of an application on the social networking system as part of the selection of the targeting criteria; determining the training cluster of users comprising a subset of the plurality of users associated with a subset of the plurality of user profile objects associated with the application on the social networking system. 8. The method of claim 1, wherein determining a targeting cluster of users for the advertisement based on the training cluster of users further comprises:
generating a user model based on the training cluster of users; determining a confidence score for each user of a population of users on the social networking system based on the user model; and determining the targeting cluster of users based on the confidence scores of the population of users. 9. The method of claim 1, wherein providing the advertisement by the advertiser to the viewing user further comprises:
marking the advertisement as a candidate advertisement; determining a score for the advertisement against a plurality of other candidate advertisements based on a bidding auction; and selecting the advertisement based on the score. 10. A method comprising:
determining a training cluster of users of a social networking system where the training cluster of users is defined by targeting criteria associated with an advertisement; generating a user model based on the training cluster of users, where the user model evaluates one or more features of a user to determine a confidence score for the user; determining a confidence score for each user of a population of users of the social networking system based on the user model; selecting a plurality of users from the population of users based on the determined confidence scores to create a targeting cluster of users; and for a viewing user, providing the advertisement associated with the training cluster of users for display to the viewing user based on whether the viewing user is in the targeting cluster of users. 11. The method of claim 10, wherein determining a training cluster of users of a social networking system further comprises:
receiving identifying information of users of the social networking system that are included in the training cluster of users. 12. The method of claim 10, wherein determining a training cluster of users of a social networking system further comprises:
determining identifying information of users of the social networking system that are included in the training cluster of users based on the users previously engaging with a selected advertisement. 13. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving a keyword profile describing each user of the training cluster of users, the keyword profile including a plurality of keywords; determining a list of keyword features for the user model, the list of keyword features comprising a selection of keywords from the keyword profiles of the training cluster of users; and generating the user model based on the list of keyword features. 14. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving demographics information describing each user of the training cluster of users; determining a list of demographics features for the user model, the list of demographics features comprising a selection of types of demographics information describing the training cluster of users; and generating the user model based on the list of demographics features. 15. The method of claim 10, wherein generating a user model based on the training cluster of users further comprises:
receiving a user engagement history for each user of the training cluster of users, the user engagement history for each user including a history of behavior for the user; determining a user engagement distribution for the training cluster of users based on the received user engagement histories for the training cluster of users; and generating the user model using the user engagement distribution for the training cluster of users. 16. The method of claim 15, wherein selecting similar users from the population of users based on confidence scores of the similar users further comprises:
generating a plurality of bins based on the user engagement distribution for the training cluster of users; distributing the population of users into the plurality of bins based on user engagement histories of the population of users; and selecting a top percentage of similar users from each of the plurality of bins based on confidence scores of the similar users. 17. The method of claim 10, further comprising:
storing the user model for the advertisement in the social networking system; 18. The method of claim 10, wherein a population of users includes users located in a specified geographic location. 19. A method comprising:
maintaining a plurality of user profile objects on a social networking system, the plurality of user profile objects representing a plurality of users of the social networking system; maintaining a plurality of edge objects connecting a plurality of nodes in the social networking system, where a subset of the plurality of nodes represent a plurality of advertisers; determining a subset of the plurality of user profile objects associated with a specified advertiser based on at least one edge object connecting at least one node representing the specified advertiser to each of the user profile objects in the subset of the plurality of user profile objects; determining a plurality of features for a training model based on the subset of the plurality of user profile objects; determining a plurality of confidence scores for the subset of the plurality of user profile objects based on the training model; selecting a plurality of targeted user profile objects based on the plurality of confidence scores; and storing the plurality of targeted user profile objects as a cluster in the social networking system. 20. The method of claim 19, wherein a subset of the plurality of edge objects are generated based on a plurality of graph actions performed by a subset of the plurality of users on a plurality of graph objects on external systems, the plurality of graph actions and the plurality of graph objects defined by a plurality of entities external to the social networking system. 21. The method of claim 19, wherein the cluster is filtered to include a subset of the plurality of targeted user profile objects based on the subset of the plurality of targeted user profile objects associated with the subset of the plurality of user profile objects associated with the specified advertiser. 22. The method of claim 19, wherein the cluster is filtered to include a subset of the plurality of targeted user profile objects based on a specified geographic location. 23. The method of claim 19, wherein the training model comprises a machine learning model. 24. The method of claim 19, wherein determining a plurality of features for a training model based on the subset of the plurality of user profile objects further comprises:
determining a plurality of affinity scores for a plurality of interests based on the subset of the plurality of user profile objects as the plurality of features for the training model. 25. The method of claim 19, wherein determining a plurality of features for a training model based on the subset of the plurality of user profile objects further comprises:
receiving a performance metric for a feature in the training model; and modifying the training model based on the performance metric for the feature. 26. The method of claim 19, further comprising:
storing the cluster as targeting criteria for an advertisement in the social networking system. | 3,600 |
13,552 | 13,552 | 14,555,499 | 3,693 | A method for providing user content may obtain multiple fields. The method may generate, by a user content flow driver, a priority field list for an application workflow. The method may sort the fields based on the priority field list to obtain sorted fields. The method may select a next field from the sorted fields to obtain a selected next field. The method may generate content based on the selected next field. The method may transmit, to a user experience player, the generated content. | 1. A method for providing user content, comprising:
obtaining a plurality of fields; generating, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used; sorting the plurality of fields based on the priority field list to obtain a sorted plurality of fields; selecting a next field from the sorted plurality of fields to obtain a selected next field; generating content based on the selected next field; and transmitting, to a user experience player, the generated content. 2. The method of claim 1, further comprising:
determining a respective score for each field of the plurality of fields; and ranking the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 3. The method of claim 1, further comprising:
receiving, in response to transmitting the generated content, user data associated with the selected next field; weighting at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modifying the priority field list to change an order of the at least one predetermined field in the priority field list, wherein a declarative content engine uses the at least one predetermined field. 4. The method of claim 1, further comprising:
computing an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 5. The method of claim 1, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 6. The method of claim 1,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 7. The method of claim 1,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. 8. A system for providing application content, comprising:
a computer processor; a memory; a user content flow driver executing on the computer processor and configured to:
obtain a plurality of fields;
generate, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used;
sort the plurality of fields based on the priority field list to obtain a sorted plurality of fields;
select a next field from the sorted plurality of fields to obtain a selected next field; and
a declarative content engine executing on the computer processor and configured to:
generate content based on the selected next field; and
transmit, to a user experience player, the generated content. 9. The system of claim 8, wherein the user content flow driver is further configured to:
determine a respective score for each field of the plurality of fields; and rank the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 10. The system of claim 8, wherein the user content flow driver is further configured to:
receive, in response to transmitting the declarative content, user data associated with the selected next field; weight at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modify the priority field list to change an order of the at least one predetermined field in the priority field list, wherein the declarative content engine uses the at least one predetermined field. 11. The system of claim 8, wherein the user content flow driver is further configured to:
compute an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 12. The system of claim 8, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 13. The system of claim 8,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 14. The system of claim 8,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. 15. A non-transitory computer readable medium for providing user content, comprising computer readable program code for:
obtaining a plurality of fields; generating, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used; sorting the plurality of fields based on the priority field list to obtain a sorted plurality of fields; selecting a next field from the sorted plurality of fields to obtain a selected next field; generating content based on the selected next field; and transmitting, to a user experience player, the generated content. 16. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
determining a respective score for each field of the plurality of fields; and ranking the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 17. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
receiving, in response to transmitting the generated content, user data associated with the selected next field; weighting at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modifying the priority field list to change an order of the at least one predetermined field in the priority field list, wherein a declarative content engine uses the at least one predetermined field. 18. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
computing an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 19. The non-transitory computer readable medium of claim 15, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 20. The non-transitory computer readable medium of claim 15,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 21. The non-transitory computer readable medium of claim 15,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. | A method for providing user content may obtain multiple fields. The method may generate, by a user content flow driver, a priority field list for an application workflow. The method may sort the fields based on the priority field list to obtain sorted fields. The method may select a next field from the sorted fields to obtain a selected next field. The method may generate content based on the selected next field. The method may transmit, to a user experience player, the generated content.1. A method for providing user content, comprising:
obtaining a plurality of fields; generating, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used; sorting the plurality of fields based on the priority field list to obtain a sorted plurality of fields; selecting a next field from the sorted plurality of fields to obtain a selected next field; generating content based on the selected next field; and transmitting, to a user experience player, the generated content. 2. The method of claim 1, further comprising:
determining a respective score for each field of the plurality of fields; and ranking the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 3. The method of claim 1, further comprising:
receiving, in response to transmitting the generated content, user data associated with the selected next field; weighting at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modifying the priority field list to change an order of the at least one predetermined field in the priority field list, wherein a declarative content engine uses the at least one predetermined field. 4. The method of claim 1, further comprising:
computing an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 5. The method of claim 1, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 6. The method of claim 1,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 7. The method of claim 1,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. 8. A system for providing application content, comprising:
a computer processor; a memory; a user content flow driver executing on the computer processor and configured to:
obtain a plurality of fields;
generate, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used;
sort the plurality of fields based on the priority field list to obtain a sorted plurality of fields;
select a next field from the sorted plurality of fields to obtain a selected next field; and
a declarative content engine executing on the computer processor and configured to:
generate content based on the selected next field; and
transmit, to a user experience player, the generated content. 9. The system of claim 8, wherein the user content flow driver is further configured to:
determine a respective score for each field of the plurality of fields; and rank the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 10. The system of claim 8, wherein the user content flow driver is further configured to:
receive, in response to transmitting the declarative content, user data associated with the selected next field; weight at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modify the priority field list to change an order of the at least one predetermined field in the priority field list, wherein the declarative content engine uses the at least one predetermined field. 11. The system of claim 8, wherein the user content flow driver is further configured to:
compute an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 12. The system of claim 8, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 13. The system of claim 8,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 14. The system of claim 8,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. 15. A non-transitory computer readable medium for providing user content, comprising computer readable program code for:
obtaining a plurality of fields; generating, by a user content flow driver, a priority field list for an application workflow, wherein the priority field list provides an order that the plurality of fields is used; sorting the plurality of fields based on the priority field list to obtain a sorted plurality of fields; selecting a next field from the sorted plurality of fields to obtain a selected next field; generating content based on the selected next field; and transmitting, to a user experience player, the generated content. 16. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
determining a respective score for each field of the plurality of fields; and ranking the plurality of fields based on the respective score of each field of the plurality of fields to obtain a ranking of the plurality of fields, wherein generating the priority field list is based on the ranking of the plurality of fields. 17. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
receiving, in response to transmitting the generated content, user data associated with the selected next field; weighting at least one predetermined field in the plurality of fields based on the user data associated with the selected next field; and modifying the priority field list to change an order of the at least one predetermined field in the priority field list, wherein a declarative content engine uses the at least one predetermined field. 18. The non-transitory computer readable medium of claim 15, further comprising computer readable program code for:
computing an amount of tax owed to a tax entity based on user data corresponding to the sorted plurality of fields, wherein the sorted plurality of fields correspond to respective data fields in a tax model for calculating a tax return. 19. The non-transitory computer readable medium of claim 15, wherein the priority field list comprises a greater number of fields than in the plurality of fields. 20. The non-transitory computer readable medium of claim 15,
wherein the plurality of fields comprise at least one user experience field, wherein the at least one user experience field designates a page provided by the user experience player in an application workflow. 21. The non-transitory computer readable medium of claim 15,
wherein the plurality of fields comprise at least one user input field for a data model, wherein the at least one user input field corresponds to data supplied by a user as one or more inputs for the data model. | 3,600 |
13,553 | 13,553 | 14,254,786 | 3,624 | One embodiment of the present disclosure relates to a method that includes sending a negotiating message from a user to one or more invitees using a messaging protocol, the negotiating message comprising one or more plans for a meeting, each plan including a time information and a location information for the meeting. The method further includes receiving, using the messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans and determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees. | 1. A method comprising:
forming a group that comprising of members; sending or receiving one or more group chat messages to or from each of the members in the group; sending a chat message to group members for one or more plans for a meeting, the one or more plans comprises a time and location information; updating the calendar system of each of the group members by placing a tentative calendar event based on the received chat messages. 2. The method of claim 1, further comprising tracking the geolocation of each of the group members and alerting the group members when one or more of the groups member are in a geographic vicinity of each other. 3. A method comprising,
sending a negotiating message from a user to one or more invitees using a messaging protocol; the negotiating message comprising one or more plans for a meeting, each plan including a time information and a location information for the meeting; receiving, using the messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans; and determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees. 4. The method of claim 3, further comprising the one or more invitees proposing alternative plans that the organizer and the other invitees can approve or reject. 5. The method of claim 3, further comprising, responsive to receiving the approval or rejection for one or more plans from the one or more invitees, sending a message to indicate the approval or rejection by the one or more invitees. 6. The method of claim 5, further comprising visually displaying the approval or rejection to the organizer and the one or more invitees on their mobile device. 7. The method of claim 3, further comprising placing a placeholder for each of the one or more plans in a calendar system of the organizer and a calendar system of the one or more invitees prior to booking the event. 8. The method of claim 3, further comprising booking a selected plan for the event based on the received responses and updating a calendar system of the organizer and a calendar system of the one or more invitees to remove each of the plans that were not booked. 9. The method of claim 3, wherein the messaging protocol is at least one of SMS or push notifications to deliver communication instead of e-mail. 10. The method of claim 3, further comprising providing a messaging user interface that allows one or more invitees and the organizer to send and receive messages to each other. 11. The method of claim 10, further comprising creating new plans using natural language parsing conducted on the chat messages. 12. An apparatus comprising:
a appointment negotiation system configured to receive one or more plans for a meeting from an organizer, each plan including a time information and a location information for the meeting between an organizer and one or more invitees; receiving, using a text messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans; determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees; and sending a message to the organizer and the one or more invitee regarding the status of the one or more plans based on the responses received from the organizer and the one or more invitees. 13. The apparatus of claim 12, further comprising the one or more invitees, using their mobile device, proposing alternative plans that the organizer and the other invitees can approve or reject. 14. The apparatus of claim 12, further comprising responsive to receiving the approval or rejection for one or more plans from a mobile device or computer of the one or more invitees, a server computer a message to indicate the approval or rejection by the one or more invitees. 15. The apparatus of claim 14, further comprising displaying the approval or rejection on the mobile device of the organizer and the mobile device of the one or more invitees. 16. The apparatus of claim 12, further comprising placing a placeholder for each of the one or more plans in a calendar system of the organizer and a calendar system of the one or more invitees prior to booking the event. 17. The apparatus of claim 12, further comprising a server computer configured to book a selected plan for the meeting based on the received responses and updating a calendar system of a mobile device of the organizer and a calendar system of a the one or more invitees to remove each of the plans that were not booked. 18. The apparatus of claim 12, wherein the messaging protocol is at least one of SMS or push notifications to deliver communication instead of e-mail. | One embodiment of the present disclosure relates to a method that includes sending a negotiating message from a user to one or more invitees using a messaging protocol, the negotiating message comprising one or more plans for a meeting, each plan including a time information and a location information for the meeting. The method further includes receiving, using the messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans and determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees.1. A method comprising:
forming a group that comprising of members; sending or receiving one or more group chat messages to or from each of the members in the group; sending a chat message to group members for one or more plans for a meeting, the one or more plans comprises a time and location information; updating the calendar system of each of the group members by placing a tentative calendar event based on the received chat messages. 2. The method of claim 1, further comprising tracking the geolocation of each of the group members and alerting the group members when one or more of the groups member are in a geographic vicinity of each other. 3. A method comprising,
sending a negotiating message from a user to one or more invitees using a messaging protocol; the negotiating message comprising one or more plans for a meeting, each plan including a time information and a location information for the meeting; receiving, using the messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans; and determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees. 4. The method of claim 3, further comprising the one or more invitees proposing alternative plans that the organizer and the other invitees can approve or reject. 5. The method of claim 3, further comprising, responsive to receiving the approval or rejection for one or more plans from the one or more invitees, sending a message to indicate the approval or rejection by the one or more invitees. 6. The method of claim 5, further comprising visually displaying the approval or rejection to the organizer and the one or more invitees on their mobile device. 7. The method of claim 3, further comprising placing a placeholder for each of the one or more plans in a calendar system of the organizer and a calendar system of the one or more invitees prior to booking the event. 8. The method of claim 3, further comprising booking a selected plan for the event based on the received responses and updating a calendar system of the organizer and a calendar system of the one or more invitees to remove each of the plans that were not booked. 9. The method of claim 3, wherein the messaging protocol is at least one of SMS or push notifications to deliver communication instead of e-mail. 10. The method of claim 3, further comprising providing a messaging user interface that allows one or more invitees and the organizer to send and receive messages to each other. 11. The method of claim 10, further comprising creating new plans using natural language parsing conducted on the chat messages. 12. An apparatus comprising:
a appointment negotiation system configured to receive one or more plans for a meeting from an organizer, each plan including a time information and a location information for the meeting between an organizer and one or more invitees; receiving, using a text messaging protocol, one or more responses from the one or more invitees, the one or more responses indicating an approval or rejection of the one or more plans; determining based at least partially on the one or more responses received from the one or more invitees to book the event based on the received responses from the one or more invitees; and sending a message to the organizer and the one or more invitee regarding the status of the one or more plans based on the responses received from the organizer and the one or more invitees. 13. The apparatus of claim 12, further comprising the one or more invitees, using their mobile device, proposing alternative plans that the organizer and the other invitees can approve or reject. 14. The apparatus of claim 12, further comprising responsive to receiving the approval or rejection for one or more plans from a mobile device or computer of the one or more invitees, a server computer a message to indicate the approval or rejection by the one or more invitees. 15. The apparatus of claim 14, further comprising displaying the approval or rejection on the mobile device of the organizer and the mobile device of the one or more invitees. 16. The apparatus of claim 12, further comprising placing a placeholder for each of the one or more plans in a calendar system of the organizer and a calendar system of the one or more invitees prior to booking the event. 17. The apparatus of claim 12, further comprising a server computer configured to book a selected plan for the meeting based on the received responses and updating a calendar system of a mobile device of the organizer and a calendar system of a the one or more invitees to remove each of the plans that were not booked. 18. The apparatus of claim 12, wherein the messaging protocol is at least one of SMS or push notifications to deliver communication instead of e-mail. | 3,600 |
13,554 | 13,554 | 14,148,435 | 3,686 | One embodiment of the present invention provides a system for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application. During operation, the system generates a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data. The system generates a table containing topology and edge identifier information and a table containing edge attribute information. Next, the system generates headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information. The system then generates files containing the one or more headers and data from the tables, in which the data describes a graph with edges representing transactions and vertices representing customers or products. Subsequently, the system submits the one or more files as input to the graph analytics application to generate a product recommendation. | 1. A computer-executable method for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, comprising:
generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 2. The method of claim 1, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 3. The method of claim 1, wherein the transactions are purchase transactions. 4. The method of claim 1, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 5. The method of claim 1, further comprising sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 6. The method of claim 1, wherein every step of the method is executed by a single script. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, comprising:
generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 8. The computer-readable storage medium of claim 7, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 9. The computer-readable storage medium of claim 7, wherein the transactions are purchase transactions. 10. The computer-readable storage medium of claim 7, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 11. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 12. The computer-readable storage medium of claim 7, wherein every step of the method is executed by a single script. 13. A computing system for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 14. The computing system claim 13, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 15. The computing system of claim 13, wherein the transactions are purchase transactions. 16. The computing system of claim 13, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 17. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 18. The computing system of claim 13, wherein every step of the method is executed by a single script. | One embodiment of the present invention provides a system for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application. During operation, the system generates a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data. The system generates a table containing topology and edge identifier information and a table containing edge attribute information. Next, the system generates headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information. The system then generates files containing the one or more headers and data from the tables, in which the data describes a graph with edges representing transactions and vertices representing customers or products. Subsequently, the system submits the one or more files as input to the graph analytics application to generate a product recommendation.1. A computer-executable method for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, comprising:
generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 2. The method of claim 1, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 3. The method of claim 1, wherein the transactions are purchase transactions. 4. The method of claim 1, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 5. The method of claim 1, further comprising sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 6. The method of claim 1, wherein every step of the method is executed by a single script. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, comprising:
generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 8. The computer-readable storage medium of claim 7, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 9. The computer-readable storage medium of claim 7, wherein the transactions are purchase transactions. 10. The computer-readable storage medium of claim 7, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 11. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 12. The computer-readable storage medium of claim 7, wherein every step of the method is executed by a single script. 13. A computing system for generating a product recommendation by translating transaction data to graph representation for input to a graph analytics application, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: generating a transaction table to store transaction data, a customer table to store customer data, and a product table to store products data; generating, with data from the transaction table, a table containing topology and edge identifier information and a table containing edge attribute information; generating one or more headers that include data describing the customer table and/or the product table and/or the table containing edge attribute information; generating one or more files containing the one or more headers and data from the tables, wherein the data describes a graph with edges representing transactions and vertices representing customers or products; and submitting the one or more files as input to the graph analytics application to generate a product recommendation. 14. The computing system claim 13, wherein generating a transaction table, a customer table, and a products table comprises:
retrieving data from a table storing data according to a relational model. 15. The computing system of claim 13, wherein the transactions are purchase transactions. 16. The computing system of claim 13, wherein generating a customer table and/or product table and/or transaction table further comprises assigning unique consecutive integer values to each row of the customer table and/or product table and/or transaction table. 17. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
sorting the table containing topology and edge identifier information first by the customer ID, then the edge type, then the product ID, and then the transaction ID. 18. The computing system of claim 13, wherein every step of the method is executed by a single script. | 3,600 |
13,555 | 13,555 | 14,637,247 | 3,694 | Fairnetting and distribution of electronic trades is described, where, a computing device includes a reception module, a trade organization module, and a trade netting module. The trade organization module organizes one or more trades, received by the reception module, by currency pairs. The trade netting module generates, at a first point in time, a netting plan designed to offset a trade against at least one other trade, and estimates, for the netting plan, a first value that is proportional to an expected savings based on real-time market data and associated with executing the trades according to the netting plan versus executing the trades without the netting plan, where the first value is not exceeded by a cost of trading proportional to a change in market value of the trades between the first point in time and a time that a first trade included in the trades is executed. | 1. A computing device, comprising:
a processor; and a memory that includes a reception module, a trade organization module, and a trade netting module, wherein, when executed by the processor:
the reception module is configured to receive trade information describing one or more trades included in a portfolio of trades that is to be executed;
the trade organization module is configured to organize the one or more trades by currency pairs; and
the trade netting module is configured to:
generate, at a first point in time, a first netting plan that is designed to offset at least one trade included in the one or more trades organized by currency pairs against at least one other trade included in the one or more trades organized by currency pairs, and
estimate, for the first netting plan, a first value that is proportional to an expected savings based on real-time market data and associated with executing the portfolio of trades according to the netting plan versus executing the portfolio of trades without the netting plan;
wherein the first value is not exceeded by a cost of trading that is proportional to a change in market value of the portfolio of trades between the first point in time and a time that a first trade included in the portfolio of trades is executed. 2. The computing device of claim 1, wherein, when executed by the processor, the reception module is further configured to receive a selection of the first netting plan included in the plurality of netting plans. 3. The computing device of claim 2, wherein the total estimated cost associated with executing the one or more trades according to the first netting plan is lower than the total estimated costs associated with executing the one or more trades according to a second netting plan included in the plurality of netting plans. 4. The computing device of claim 3, further comprising a trade execution module that, when executed by the processor, is configured to execute the market trade based on the first netting plan. 5. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a simple netting plan that is designed to:
net all buy base trades included in the one or more trades against all sell base trades included in the one or more trades; and net all buy term trades included in the one or more trades against all sell term trades included in the one or more trades. 6. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a base/term netting plan that is designed to:
identify a first trade included in the one or more trades, wherein the first trade specifies a base amount expressed in a base currency of a currency pair; identify a second trade included in the one or more trades, wherein the second trade specifies a term amount expressed in a term currency of the currency pair; generate a third trade that includes an estimated base amount expressed in the base currency corresponding to the term amount of the second trade; and net the first trade against the third trade. 7. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a base/term plus cross-currency netting plan that is designed to:
identify a first trade included in the one or more trades, wherein the first trade specifies a base currency and a term currency of a first currency pair; split the first trade into a second trade for a second currency pair associated with the base currency and an intermediate currency and a third trade for a third currency pair associated with the intermediate currency and the term currency; and net at least one of:
the second trade against a fourth trade included in the one or more trades, wherein the fourth trade corresponds to the second currency pair; and
the third trade against a fifth trade included in the one or more trades, wherein the fifth trade corresponds to the third currency pair. 8. The computing device of claim 1, wherein, when executed by the processor, the trade netting module is further configured to:
obtain current market rates associated with the one or more trades as the market rates change; and update the total estimated cost associated with executing the one or more trades for each netting plan based on based on the current market rates. | Fairnetting and distribution of electronic trades is described, where, a computing device includes a reception module, a trade organization module, and a trade netting module. The trade organization module organizes one or more trades, received by the reception module, by currency pairs. The trade netting module generates, at a first point in time, a netting plan designed to offset a trade against at least one other trade, and estimates, for the netting plan, a first value that is proportional to an expected savings based on real-time market data and associated with executing the trades according to the netting plan versus executing the trades without the netting plan, where the first value is not exceeded by a cost of trading proportional to a change in market value of the trades between the first point in time and a time that a first trade included in the trades is executed.1. A computing device, comprising:
a processor; and a memory that includes a reception module, a trade organization module, and a trade netting module, wherein, when executed by the processor:
the reception module is configured to receive trade information describing one or more trades included in a portfolio of trades that is to be executed;
the trade organization module is configured to organize the one or more trades by currency pairs; and
the trade netting module is configured to:
generate, at a first point in time, a first netting plan that is designed to offset at least one trade included in the one or more trades organized by currency pairs against at least one other trade included in the one or more trades organized by currency pairs, and
estimate, for the first netting plan, a first value that is proportional to an expected savings based on real-time market data and associated with executing the portfolio of trades according to the netting plan versus executing the portfolio of trades without the netting plan;
wherein the first value is not exceeded by a cost of trading that is proportional to a change in market value of the portfolio of trades between the first point in time and a time that a first trade included in the portfolio of trades is executed. 2. The computing device of claim 1, wherein, when executed by the processor, the reception module is further configured to receive a selection of the first netting plan included in the plurality of netting plans. 3. The computing device of claim 2, wherein the total estimated cost associated with executing the one or more trades according to the first netting plan is lower than the total estimated costs associated with executing the one or more trades according to a second netting plan included in the plurality of netting plans. 4. The computing device of claim 3, further comprising a trade execution module that, when executed by the processor, is configured to execute the market trade based on the first netting plan. 5. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a simple netting plan that is designed to:
net all buy base trades included in the one or more trades against all sell base trades included in the one or more trades; and net all buy term trades included in the one or more trades against all sell term trades included in the one or more trades. 6. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a base/term netting plan that is designed to:
identify a first trade included in the one or more trades, wherein the first trade specifies a base amount expressed in a base currency of a currency pair; identify a second trade included in the one or more trades, wherein the second trade specifies a term amount expressed in a term currency of the currency pair; generate a third trade that includes an estimated base amount expressed in the base currency corresponding to the term amount of the second trade; and net the first trade against the third trade. 7. The computing device of claim 1, wherein the first netting plan included in the plurality of netting plans comprises a base/term plus cross-currency netting plan that is designed to:
identify a first trade included in the one or more trades, wherein the first trade specifies a base currency and a term currency of a first currency pair; split the first trade into a second trade for a second currency pair associated with the base currency and an intermediate currency and a third trade for a third currency pair associated with the intermediate currency and the term currency; and net at least one of:
the second trade against a fourth trade included in the one or more trades, wherein the fourth trade corresponds to the second currency pair; and
the third trade against a fifth trade included in the one or more trades, wherein the fifth trade corresponds to the third currency pair. 8. The computing device of claim 1, wherein, when executed by the processor, the trade netting module is further configured to:
obtain current market rates associated with the one or more trades as the market rates change; and update the total estimated cost associated with executing the one or more trades for each netting plan based on based on the current market rates. | 3,600 |
13,556 | 13,556 | 15,176,644 | 3,646 | An aircraft ice detection system is configured to determine a condition of a cloud and includes a radar transmitter, a radar receiver, optics and a splitter. The radar transmitter is configured to produce quasi-optical radiation. The optics are configured to direct the quasi-optical radiation from the radar transmitter to the cloud and receive reflected quasi-optical radiation from the cloud. The radar receiver is configured to receive the reflected quasi-optical radiation from the optics and the splitter is configured to direct the reflected quasi-optical radiation from the optics to the radar receiver. | 1. An aircraft ice detection system configured to determine a condition of a cloud, the aircraft ice detection system comprising:
a radar transmitter configured to produce quasi-optical radiation optics configured to direct the quasi-optical radiation from the radar transmitter to the cloud and receive reflected quasi-optical radiation from the cloud; a radar receiver configured to receive the reflected quasi-optical radiation from the optics; and a splitter configured to direct the reflected quasi-optical radiation from the optics to the radar receiver. 2. The aircraft ice detection system of claim 1, wherein the quasi-optical radiation is infrared radiation with a wavelength between 0.1 and 3 millimeters. 3. The aircraft ice detection system of claim 1, wherein the optics are configured as a Cassegrain telescope. 4. The aircraft ice detection system of claim 1, wherein the radar transmitter is configured to project the quasi-optical radiation having a transmitted circular polarization. 5. The aircraft ice detection system of claim 4, wherein the radar receiver comprises a first receiver component configured to receive a first polarization component of the reflected quasi-optical radiation, and wherein the first polarization component is opposite the transmitted circular polarization. 6. The aircraft ice detection system of claim 5, wherein the radar receiver further comprises a second receiver component configured to receive a second polarization component of the reflected quasi-optical radiation, wherein the second polarization component is of the same polarization as the transmitted circular polarization. 7. The aircraft ice detection system of claim 6, wherein the radar receiver further comprises a septum duplexer configured to direct the first polarization component to the first receiver component and the second polarization component to the second receiver component. 8. The aircraft ice detection system of claim 1, wherein the splitter is a three decibel splitter. 9. The aircraft ice detection system of claim 1, wherein the optics are configured to provide the quasi-optical radiation through a window of the aircraft to the cloud, and wherein the optics receive the reflected quasi-optical radiation through the window. 10. A method of detection icing conditions for an aircraft, the method comprising:
transmitting, by a radar transmitter, quasi-optical radiation to optics; directing, by the optics, the quasi-optical radiation to a cloud; receiving, by the optics, reflected quasi-optical radiation from the cloud; directing, using a splitter, the reflected quasi-optical radiation from the optics to a radar receiver; and receiving, by the radar receiver, the reflected quasi-optical radiation from the optics. 11. The method of claim 10, wherein transmitting, by the radar transmitter, quasi-optical radiation comprises transmitting the quasi-optical radiation having a wavelength between 0.1 and 3 millimeters. 12. The method of claim 10, wherein directing, by the optics, the quasi-optical radiation to the cloud comprises directing, by a Cassegrain telescope, the quasi-optical radiation to the cloud. 13. The method of claim 10, wherein transmitting, by the radar transmitter the quasi-optical radiation comprises transmitting the quasi-optical radiation with a circular polarization. 14. The method of claim 13, wherein receiving, by the radar receiver, the reflected quasi-optical radiation comprises receiving, by a first receiver component, a first polarization component of the reflected quasi-optical radiation, and wherein the first polarization component is orthogonal to the transmitted circular polarization. 15. The method of claim 14, wherein receiving, by the radar receiver, the reflected quasi-optical radiation further comprises receiving, by a second receiver component, a second polarization component of the reflected quasi-optical radiation, wherein the second polarization component is of the same polarization as the transmitted circular polarization. 16. The method of claim 15, wherein receiving, by the radar receiver, the reflected quasi-optical radiation further comprises directing, by a septum duplexer, the first polarization component to the first receiver component and the second polarization component to the second receiver component. 17. The method of claim 10, wherein directing, using the splitter, the reflected quasi-optical radiation from the optics to the radar receiver comprises directing the reflected quasi-optical radiation using a three decibel splitter. 18. The method of claim 10, wherein directing, by the optics, the quasi-optical radiation to the cloud comprises directing the quasi-optical radiation through a window of the aircraft to the cloud. | An aircraft ice detection system is configured to determine a condition of a cloud and includes a radar transmitter, a radar receiver, optics and a splitter. The radar transmitter is configured to produce quasi-optical radiation. The optics are configured to direct the quasi-optical radiation from the radar transmitter to the cloud and receive reflected quasi-optical radiation from the cloud. The radar receiver is configured to receive the reflected quasi-optical radiation from the optics and the splitter is configured to direct the reflected quasi-optical radiation from the optics to the radar receiver.1. An aircraft ice detection system configured to determine a condition of a cloud, the aircraft ice detection system comprising:
a radar transmitter configured to produce quasi-optical radiation optics configured to direct the quasi-optical radiation from the radar transmitter to the cloud and receive reflected quasi-optical radiation from the cloud; a radar receiver configured to receive the reflected quasi-optical radiation from the optics; and a splitter configured to direct the reflected quasi-optical radiation from the optics to the radar receiver. 2. The aircraft ice detection system of claim 1, wherein the quasi-optical radiation is infrared radiation with a wavelength between 0.1 and 3 millimeters. 3. The aircraft ice detection system of claim 1, wherein the optics are configured as a Cassegrain telescope. 4. The aircraft ice detection system of claim 1, wherein the radar transmitter is configured to project the quasi-optical radiation having a transmitted circular polarization. 5. The aircraft ice detection system of claim 4, wherein the radar receiver comprises a first receiver component configured to receive a first polarization component of the reflected quasi-optical radiation, and wherein the first polarization component is opposite the transmitted circular polarization. 6. The aircraft ice detection system of claim 5, wherein the radar receiver further comprises a second receiver component configured to receive a second polarization component of the reflected quasi-optical radiation, wherein the second polarization component is of the same polarization as the transmitted circular polarization. 7. The aircraft ice detection system of claim 6, wherein the radar receiver further comprises a septum duplexer configured to direct the first polarization component to the first receiver component and the second polarization component to the second receiver component. 8. The aircraft ice detection system of claim 1, wherein the splitter is a three decibel splitter. 9. The aircraft ice detection system of claim 1, wherein the optics are configured to provide the quasi-optical radiation through a window of the aircraft to the cloud, and wherein the optics receive the reflected quasi-optical radiation through the window. 10. A method of detection icing conditions for an aircraft, the method comprising:
transmitting, by a radar transmitter, quasi-optical radiation to optics; directing, by the optics, the quasi-optical radiation to a cloud; receiving, by the optics, reflected quasi-optical radiation from the cloud; directing, using a splitter, the reflected quasi-optical radiation from the optics to a radar receiver; and receiving, by the radar receiver, the reflected quasi-optical radiation from the optics. 11. The method of claim 10, wherein transmitting, by the radar transmitter, quasi-optical radiation comprises transmitting the quasi-optical radiation having a wavelength between 0.1 and 3 millimeters. 12. The method of claim 10, wherein directing, by the optics, the quasi-optical radiation to the cloud comprises directing, by a Cassegrain telescope, the quasi-optical radiation to the cloud. 13. The method of claim 10, wherein transmitting, by the radar transmitter the quasi-optical radiation comprises transmitting the quasi-optical radiation with a circular polarization. 14. The method of claim 13, wherein receiving, by the radar receiver, the reflected quasi-optical radiation comprises receiving, by a first receiver component, a first polarization component of the reflected quasi-optical radiation, and wherein the first polarization component is orthogonal to the transmitted circular polarization. 15. The method of claim 14, wherein receiving, by the radar receiver, the reflected quasi-optical radiation further comprises receiving, by a second receiver component, a second polarization component of the reflected quasi-optical radiation, wherein the second polarization component is of the same polarization as the transmitted circular polarization. 16. The method of claim 15, wherein receiving, by the radar receiver, the reflected quasi-optical radiation further comprises directing, by a septum duplexer, the first polarization component to the first receiver component and the second polarization component to the second receiver component. 17. The method of claim 10, wherein directing, using the splitter, the reflected quasi-optical radiation from the optics to the radar receiver comprises directing the reflected quasi-optical radiation using a three decibel splitter. 18. The method of claim 10, wherein directing, by the optics, the quasi-optical radiation to the cloud comprises directing the quasi-optical radiation through a window of the aircraft to the cloud. | 3,600 |
13,557 | 13,557 | 14,630,418 | 3,682 | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth. | 1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to:
control functionality that is exposed to be accessible to a content creator via a network to create content; and associate a badge with a user profile of the content creator in a user interface of the content creation service that is indicative of deployment of content created by the content creator as part of one or more marketing activities. 2. A system as described in claim 1, wherein the badge is indicative of a particular one of a plurality of different levels of deployment of the content as part of one or more marketing activities. 3. A system as described in claim 1, wherein the deployment references a number of times the content is viewed by potential consumers. 4. A system as described in claim 1, wherein the badge is based on a plurality of said content created by the content creator for a plurality of said marketing activities. 5. A system as described in claim 1, wherein the badge includes a counter indicating a number of times the content is viewed by potential consumers. 6. A system as described in claim 5, wherein the counter is associated with particular items of the content created by the content creator. 7. A system as described in claim 5, wherein the counter is not associated with particular items of the content created by the content creator. 8. A system as described in claim 5, wherein the counter is configured to perform delayed reporting. 9. A system as described in claim 1, wherein the content creation service is further configured to associate metadata with the content that describes the creation of the content. 10. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to:
control functionality that is exposed to be accessible to a content creator via a network to create content; and associate a badge with the content in a user interface of the content creation service that is indicative of deployment of the content as part of one or more marketing activities. 11. A system as described in claim 10, wherein the badge is indicative of a particular one of a plurality of different levels of deployment of the content as part of one or more marketing activities. 12. A system as described in claim 10, wherein the deployment references a number of times the content is viewed by potential consumers. 13. A system as described in claim 10, wherein the badge includes a counter indicating a number of times the content is viewed by potential consumers. 14. A system as described in claim 13, wherein the counter is configured to perform delayed reporting. 15. A system as described in claim 10, wherein the badge is usable to indicate a corresponding amount of computing resources that are accessible to the content creator. 16. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method to create the content and track deployment of the content, the method comprising:
tracking deployment of a marketing activity and content included as part of the marketing activity to a plurality of potential consumers, the content having metadata associated therewith describing one or more devices utilized in creating the content; and exposing data for output in a user interface that describes the tracked deployment of the marketing activity and the metadata describing the one or more devices utilized in creating the content. 17. A method as described in claim 16, wherein the device is an image capture device. 18. A method as described in claim 16, wherein the device is an accessory utilized at least in part to capture the content. 19. A method as described in claim 16, wherein the device is a sound capture device. 20. A method as described in claim 16, wherein the metadata further comprises metadata describing one or more settings of the device used to capture the content. | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth.1. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to:
control functionality that is exposed to be accessible to a content creator via a network to create content; and associate a badge with a user profile of the content creator in a user interface of the content creation service that is indicative of deployment of content created by the content creator as part of one or more marketing activities. 2. A system as described in claim 1, wherein the badge is indicative of a particular one of a plurality of different levels of deployment of the content as part of one or more marketing activities. 3. A system as described in claim 1, wherein the deployment references a number of times the content is viewed by potential consumers. 4. A system as described in claim 1, wherein the badge is based on a plurality of said content created by the content creator for a plurality of said marketing activities. 5. A system as described in claim 1, wherein the badge includes a counter indicating a number of times the content is viewed by potential consumers. 6. A system as described in claim 5, wherein the counter is associated with particular items of the content created by the content creator. 7. A system as described in claim 5, wherein the counter is not associated with particular items of the content created by the content creator. 8. A system as described in claim 5, wherein the counter is configured to perform delayed reporting. 9. A system as described in claim 1, wherein the content creation service is further configured to associate metadata with the content that describes the creation of the content. 10. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a system to create the content comprising one or more modules implemented at least partially in hardware, the one or more modules configured to:
control functionality that is exposed to be accessible to a content creator via a network to create content; and associate a badge with the content in a user interface of the content creation service that is indicative of deployment of the content as part of one or more marketing activities. 11. A system as described in claim 10, wherein the badge is indicative of a particular one of a plurality of different levels of deployment of the content as part of one or more marketing activities. 12. A system as described in claim 10, wherein the deployment references a number of times the content is viewed by potential consumers. 13. A system as described in claim 10, wherein the badge includes a counter indicating a number of times the content is viewed by potential consumers. 14. A system as described in claim 13, wherein the counter is configured to perform delayed reporting. 15. A system as described in claim 10, wherein the badge is usable to indicate a corresponding amount of computing resources that are accessible to the content creator. 16. In a digital medium environment for creating a marketing activity, where the marketing activity involves creation of content as part of the marketing activity, a method to create the content and track deployment of the content, the method comprising:
tracking deployment of a marketing activity and content included as part of the marketing activity to a plurality of potential consumers, the content having metadata associated therewith describing one or more devices utilized in creating the content; and exposing data for output in a user interface that describes the tracked deployment of the marketing activity and the metadata describing the one or more devices utilized in creating the content. 17. A method as described in claim 16, wherein the device is an image capture device. 18. A method as described in claim 16, wherein the device is an accessory utilized at least in part to capture the content. 19. A method as described in claim 16, wherein the device is a sound capture device. 20. A method as described in claim 16, wherein the metadata further comprises metadata describing one or more settings of the device used to capture the content. | 3,600 |
13,558 | 13,558 | 14,168,371 | 3,689 | A video signature system and method. A unique identifier for an agreement document is generated. Consecutive video frames with the unique identifier are captured for each party to the agreement. | 1. A method comprising:
receiving, at a client computer, a document configured to have text forming at least one or more signature areas or blocks, wherein execution of the at least one or more signature areas or block indicates acceptance by a user of said client computer to form an agreement; using said client computer to generate an identifier, namely, a numeric or alphanumeric number, uniquely associated with said document that is configured to have text forming at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture consecutive video frames of the user verbalizing the identifier that is uniquely associated with the document, wherein said user verbalizing said identifier is configured to form an agreement by indicating acceptance of terms of said document; storing, by said client computer, said consecutive video frames in a video file and associating said video file with the document; and upon user selection or interaction with the at least one or more signature areas or blocks of the document, initiating playback of said video file including said consecutive video frames displaying the user verbalizing said unique identifier and authenticating the user's acceptance of said agreement. 2. The method of claim 1 further comprising
receiving, at a second client computer, the document and the associated video files for review by a user of said second client computer;
accepting signals from a user input device of said second client computer to capture consecutive video frames of the user of said second client computer as said user verbalizes the identifier uniquely associated with the document to accept terms of the document to form said agreement;
storing said consecutive video frames of the user of said second client computer in a second video file and associating said second video file with the document such that playback of said consecutive video frames is initiated by interacting with or selecting a second signature block of said document, playback of said consecutive video frames displaying the user of said second client computer verbalizing said unique identifier and authenticating the user of the second client computer's acceptance of said agreement. 3. A method comprising:
generating, at a first client computer, a document configured to have text that form at least one or more signature areas or blocks, execution of a signature block indicating acceptance by a user of said client computer to form an agreement; generating, by said first client computer, a unique identifier namely a numeric or alphanumeric number uniquely associated with the document configured to have text forming the at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture a first set of consecutive video frames of the user of said first client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement; and storing said first set of consecutive video frames in a first video file and associating said first video file with the document such the user's acceptance of said agreement may be authenticated by playback of said video file displaying the user verbalizing said unique identifier. 4. The method of claim 3 further comprising
authenticating said document by using a second client computer to display the document and the first set of consecutive video frames of the user of said first client computer. 5. The method of claim 4 further comprising
accepting signals from a user input device of said second client computer to capture a second set of consecutive video frames of the user of said second client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement. 6. A computer program product including a non-transitory computer readable storage medium having executable code, the code when executed by a processor is adapted for performing the following:
generating, at a first client computer, a document configured to have text that form at least one or more signature areas or blocks, execution of a signature block indicating acceptance by a user of said client computer to form an agreement; generating, by said first client computer, a unique identifier namely a numeric or alphanumeric number uniquely associated with the document configured to have text forming the at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture a first set of consecutive video frames of the user of said first client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement; and storing said first set of consecutive video frames in a first video file and associating said first video file with the document such the user's acceptance of said agreement may be authenticated by playback of said video file displaying the user verbalizing said unique identifier. 7. The computer program product of claim 6 further comprising
authenticating said document by using a second client computer to display the document and the first set of consecutive video frames of the user of said first client computer. 8. The computer program product of claim 7 further comprising
accepting signals from a user input device of said second client computer to capture a second set of consecutive video frames of the user of said second client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement. | A video signature system and method. A unique identifier for an agreement document is generated. Consecutive video frames with the unique identifier are captured for each party to the agreement.1. A method comprising:
receiving, at a client computer, a document configured to have text forming at least one or more signature areas or blocks, wherein execution of the at least one or more signature areas or block indicates acceptance by a user of said client computer to form an agreement; using said client computer to generate an identifier, namely, a numeric or alphanumeric number, uniquely associated with said document that is configured to have text forming at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture consecutive video frames of the user verbalizing the identifier that is uniquely associated with the document, wherein said user verbalizing said identifier is configured to form an agreement by indicating acceptance of terms of said document; storing, by said client computer, said consecutive video frames in a video file and associating said video file with the document; and upon user selection or interaction with the at least one or more signature areas or blocks of the document, initiating playback of said video file including said consecutive video frames displaying the user verbalizing said unique identifier and authenticating the user's acceptance of said agreement. 2. The method of claim 1 further comprising
receiving, at a second client computer, the document and the associated video files for review by a user of said second client computer;
accepting signals from a user input device of said second client computer to capture consecutive video frames of the user of said second client computer as said user verbalizes the identifier uniquely associated with the document to accept terms of the document to form said agreement;
storing said consecutive video frames of the user of said second client computer in a second video file and associating said second video file with the document such that playback of said consecutive video frames is initiated by interacting with or selecting a second signature block of said document, playback of said consecutive video frames displaying the user of said second client computer verbalizing said unique identifier and authenticating the user of the second client computer's acceptance of said agreement. 3. A method comprising:
generating, at a first client computer, a document configured to have text that form at least one or more signature areas or blocks, execution of a signature block indicating acceptance by a user of said client computer to form an agreement; generating, by said first client computer, a unique identifier namely a numeric or alphanumeric number uniquely associated with the document configured to have text forming the at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture a first set of consecutive video frames of the user of said first client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement; and storing said first set of consecutive video frames in a first video file and associating said first video file with the document such the user's acceptance of said agreement may be authenticated by playback of said video file displaying the user verbalizing said unique identifier. 4. The method of claim 3 further comprising
authenticating said document by using a second client computer to display the document and the first set of consecutive video frames of the user of said first client computer. 5. The method of claim 4 further comprising
accepting signals from a user input device of said second client computer to capture a second set of consecutive video frames of the user of said second client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement. 6. A computer program product including a non-transitory computer readable storage medium having executable code, the code when executed by a processor is adapted for performing the following:
generating, at a first client computer, a document configured to have text that form at least one or more signature areas or blocks, execution of a signature block indicating acceptance by a user of said client computer to form an agreement; generating, by said first client computer, a unique identifier namely a numeric or alphanumeric number uniquely associated with the document configured to have text forming the at least one or more signature areas or blocks; accepting signals from a user input device of said client computer to capture a first set of consecutive video frames of the user of said first client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement; and storing said first set of consecutive video frames in a first video file and associating said first video file with the document such the user's acceptance of said agreement may be authenticated by playback of said video file displaying the user verbalizing said unique identifier. 7. The computer program product of claim 6 further comprising
authenticating said document by using a second client computer to display the document and the first set of consecutive video frames of the user of said first client computer. 8. The computer program product of claim 7 further comprising
accepting signals from a user input device of said second client computer to capture a second set of consecutive video frames of the user of said second client computer verbalizing the identifier uniquely associated with the document to accept terms of the document to form said agreement. | 3,600 |
13,559 | 13,559 | 14,737,740 | 3,635 | An extendible height container is provided in which the corner elements telescope to extend the height of the container from standard ISO dimensions. An enlarged shelter can be formed from the container by providing sides which fold down to form the floor of the shelter and a flexible cover supported above the floor thus created. | 1. A portable, collapsible shelter comprising:
a) a rigid, hollow container comprising opposed ends, opposed vertical sides, a horizontal top and bottom and four corner rail elements, and wherein said corner rail elements each comprise outer and inner telescopic elements, each said inner element being secured at its upper end to said horizontal top and being reversibly telescopically slidable within said outer element between a lowered position for transit and an extended position when not in transit; said ends, sides, top and bottom being secured to form a rigid container having ISO Series 1 freight container external dimensions and corner fitting locations when said inner telescopic elements are in said lowered transit position; b) at least one of said vertical sides comprising a pivoting wall portion hingedly connected to said vertical side along the lower edge of said pivoting wall portion to pivot between a closed vertical position whereby said pivoting wall portion forms part of said at least one of said vertical sides of the container when said inner telescopic elements are in said lowered position for transit and an open horizontal position, said pivoting wall portion having an outer edge, and whereby an opening is formed in said vertical side when said pivoting wall portion is in the horizontal position; c) means associated with said container and with said pivoting wall portion for releasably securing said pivoting wall portion in said vertical position; d) means adapted to support said pivoting wall portion for releasably maintaining said pivoting wall portion in said horizontal position; e) a foldable frame for supporting a flexible cover above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and said inner element is in said extended position, said foldable frame being removably attached to said outer edge of said pivoting wall portion and to said container when said pivoting wall portion is in said lowered horizontal position; and f) a flexible cover removably secured to said foldable frame, to the edges of said pivoting wall portion and to the edges of said opening in said vertical side to be thereby supported above said pivoting wall portion when said pivoting wall portion is in said lowered horizontal position thereby forming an enclosed space above said pivoting wall portion open to the interior of said container when said pivoting wall portion is lowered to the horizontal position. 2. The shelter of claim 1 further comprising power means for reversibly telescopically lowering and extending each said inner element within said outer element. 3. The shelter of claim 2 wherein said power means for reversibly telescopically lowering and extending each said inner telescopic element within each said outer telescopic element comprises a hydraulic cylinder. 4. The shelter of claim 1 wherein said means for releasably maintaining said pivoting wall portion in said horizontal position comprises leveling means. 5. The shelter of claim 1 further comprising means for raising and lowering said pivoting wall portion. 6. The shelter of claim 5 wherein said means for raising and lowering said pivoting wall portion comprises a cable connected to said pivoting wall portion and winching means. 7. The shelter of claim 1 wherein said foldable frame comprises rigid or semi-rigid beams attached to said container at either end of said beams. 8. The shelter of claim 7 wherein said flexible cover is constructed from a fabric material. 9. The shelter of claim 1 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises a nut and bolt. 10. The shelter of claim 1 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises latching means. 11. The shelter of claim 1 wherein said flexible cover when supported on said foldable frame extends from an edge of said horizontal top above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and is secured to said container around said opening and to outer edges of said pivoting wall portion. 12. The shelter of claim 1 wherein said foldable frame comprises a collapsible frame secured at a lower end thereof to said pivoting wall portion and at an upper end thereof to said container. 13. The shelter of claim 1 further comprising a flexible cover extending between a top edge of one of said end walls and an edge of said horizontal top when said inner telescopic elements are in said extended position. 14. A portable, collapsible shelter comprising:
a) a rigid, hollow container comprising opposed ends, opposed vertical sides, a horizontal top and bottom and four corner rail elements, and wherein said corner rail elements each comprise outer and inner telescopic elements, each said inner element being secured at its upper end to said horizontal top and being reversibly telescopically slidable within said outer element a lowered position for transit and an extended position when not in transit; said ends, sides, top and bottom being secured to form a rigid container having ISO Series 1 freight container external dimensions and corner fitting locations when each said inner telescopic element is in said lowered position; b) at least one of said vertical sides comprising a pivoting wall portion hingedly connected to said vertical side along the lower edge of said pivoting wall portion to pivot between a closed vertical position whereby said pivoting wall portion forms part of said at least one of said vertical sides of the container when said inner telescopic elements are in said lowered position for transit and an open horizontal position, said pivoting wall portion having an outer edge, and whereby an opening is formed in said vertical side when said pivoting wall portion is in the horizontal position; c) means associated with said container and with said pivoting wall portion for releasably securing said pivoting wall portion in said vertical position; d) means adapted to support said pivoting wall portion for releasably maintaining said pivoting wall portion in said horizontal position; e) a flexible cover removably secured to said outer edge of said pivoting wall portion and secured to said container around said opening formed when said pivoting wall portion is in said lowered horizontal position, and adapted to be supported above said pivoting wall portion when said pivoting wall portion is in said lowered horizontal position, thereby forming an enclosed space above said pivoting wall portion open to the interior of said container when said pivoting wall portion is lowered to the horizontal position; and f) a folding frame for supporting said flexible cover above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and said inner element is in said extended position, said folding frame being removably attached to said outer edge of said pivoting wall portion and to said container when said pivoting wall portion is in said lowered horizontal position. 15. The shelter of claim 14 further comprising power means for reversibly telescopically lowering and extending each said inner element within said outer element. 16. The shelter of claim 15 wherein said power means for reversibly telescopically lowering and extending each said inner telescopic element within each said outer telescopic element comprises a hydraulic cylinder. 17. The shelter of claim 14 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises latching means. | An extendible height container is provided in which the corner elements telescope to extend the height of the container from standard ISO dimensions. An enlarged shelter can be formed from the container by providing sides which fold down to form the floor of the shelter and a flexible cover supported above the floor thus created.1. A portable, collapsible shelter comprising:
a) a rigid, hollow container comprising opposed ends, opposed vertical sides, a horizontal top and bottom and four corner rail elements, and wherein said corner rail elements each comprise outer and inner telescopic elements, each said inner element being secured at its upper end to said horizontal top and being reversibly telescopically slidable within said outer element between a lowered position for transit and an extended position when not in transit; said ends, sides, top and bottom being secured to form a rigid container having ISO Series 1 freight container external dimensions and corner fitting locations when said inner telescopic elements are in said lowered transit position; b) at least one of said vertical sides comprising a pivoting wall portion hingedly connected to said vertical side along the lower edge of said pivoting wall portion to pivot between a closed vertical position whereby said pivoting wall portion forms part of said at least one of said vertical sides of the container when said inner telescopic elements are in said lowered position for transit and an open horizontal position, said pivoting wall portion having an outer edge, and whereby an opening is formed in said vertical side when said pivoting wall portion is in the horizontal position; c) means associated with said container and with said pivoting wall portion for releasably securing said pivoting wall portion in said vertical position; d) means adapted to support said pivoting wall portion for releasably maintaining said pivoting wall portion in said horizontal position; e) a foldable frame for supporting a flexible cover above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and said inner element is in said extended position, said foldable frame being removably attached to said outer edge of said pivoting wall portion and to said container when said pivoting wall portion is in said lowered horizontal position; and f) a flexible cover removably secured to said foldable frame, to the edges of said pivoting wall portion and to the edges of said opening in said vertical side to be thereby supported above said pivoting wall portion when said pivoting wall portion is in said lowered horizontal position thereby forming an enclosed space above said pivoting wall portion open to the interior of said container when said pivoting wall portion is lowered to the horizontal position. 2. The shelter of claim 1 further comprising power means for reversibly telescopically lowering and extending each said inner element within said outer element. 3. The shelter of claim 2 wherein said power means for reversibly telescopically lowering and extending each said inner telescopic element within each said outer telescopic element comprises a hydraulic cylinder. 4. The shelter of claim 1 wherein said means for releasably maintaining said pivoting wall portion in said horizontal position comprises leveling means. 5. The shelter of claim 1 further comprising means for raising and lowering said pivoting wall portion. 6. The shelter of claim 5 wherein said means for raising and lowering said pivoting wall portion comprises a cable connected to said pivoting wall portion and winching means. 7. The shelter of claim 1 wherein said foldable frame comprises rigid or semi-rigid beams attached to said container at either end of said beams. 8. The shelter of claim 7 wherein said flexible cover is constructed from a fabric material. 9. The shelter of claim 1 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises a nut and bolt. 10. The shelter of claim 1 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises latching means. 11. The shelter of claim 1 wherein said flexible cover when supported on said foldable frame extends from an edge of said horizontal top above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and is secured to said container around said opening and to outer edges of said pivoting wall portion. 12. The shelter of claim 1 wherein said foldable frame comprises a collapsible frame secured at a lower end thereof to said pivoting wall portion and at an upper end thereof to said container. 13. The shelter of claim 1 further comprising a flexible cover extending between a top edge of one of said end walls and an edge of said horizontal top when said inner telescopic elements are in said extended position. 14. A portable, collapsible shelter comprising:
a) a rigid, hollow container comprising opposed ends, opposed vertical sides, a horizontal top and bottom and four corner rail elements, and wherein said corner rail elements each comprise outer and inner telescopic elements, each said inner element being secured at its upper end to said horizontal top and being reversibly telescopically slidable within said outer element a lowered position for transit and an extended position when not in transit; said ends, sides, top and bottom being secured to form a rigid container having ISO Series 1 freight container external dimensions and corner fitting locations when each said inner telescopic element is in said lowered position; b) at least one of said vertical sides comprising a pivoting wall portion hingedly connected to said vertical side along the lower edge of said pivoting wall portion to pivot between a closed vertical position whereby said pivoting wall portion forms part of said at least one of said vertical sides of the container when said inner telescopic elements are in said lowered position for transit and an open horizontal position, said pivoting wall portion having an outer edge, and whereby an opening is formed in said vertical side when said pivoting wall portion is in the horizontal position; c) means associated with said container and with said pivoting wall portion for releasably securing said pivoting wall portion in said vertical position; d) means adapted to support said pivoting wall portion for releasably maintaining said pivoting wall portion in said horizontal position; e) a flexible cover removably secured to said outer edge of said pivoting wall portion and secured to said container around said opening formed when said pivoting wall portion is in said lowered horizontal position, and adapted to be supported above said pivoting wall portion when said pivoting wall portion is in said lowered horizontal position, thereby forming an enclosed space above said pivoting wall portion open to the interior of said container when said pivoting wall portion is lowered to the horizontal position; and f) a folding frame for supporting said flexible cover above said pivoting wall portion while said pivoting wall portion is in said lowered horizontal position and said inner element is in said extended position, said folding frame being removably attached to said outer edge of said pivoting wall portion and to said container when said pivoting wall portion is in said lowered horizontal position. 15. The shelter of claim 14 further comprising power means for reversibly telescopically lowering and extending each said inner element within said outer element. 16. The shelter of claim 15 wherein said power means for reversibly telescopically lowering and extending each said inner telescopic element within each said outer telescopic element comprises a hydraulic cylinder. 17. The shelter of claim 14 wherein said means for releasably securing said pivoting wall portion in said vertical position comprises latching means. | 3,600 |
13,560 | 13,560 | 13,602,685 | 3,682 | A social networking system identifies a user's relative preference for objects maintained by the social networking system, such as pages associated with movies, restaurants, businesses, or other content. To obtain the user's preferences, the system provides pairs, or groups, of objects to a user and prompts the user to indicate a preference between the objects in each pair. This obtained information about the user's relative preferences is stored in conjunction with the user's profile, which can then be used to select content subsequently presented to the user. | 1. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a plurality of user profiles associated with users of the social networking system, the plurality of user profiles including a user profile associated with a viewing user; selecting a pair of objects for the user profile associated with the viewing user; presenting the pair of objects to the viewing user; receiving a selection of an object from the pair of objects from the viewing user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the viewing user's preference for the selected object from the pair of objects; and associating the relative preference information with the user profile associated with the viewing user. 2. The computer-implemented method of claim 1, further comprising:
selecting content for presentation to the viewing user based at least in part on the relative preference information; and presenting the selected content to the viewing user. 3. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
selecting an advertisement associated with the selected object from the pair of objects. 4. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
selecting an advertisement from a plurality of advertisements based on bid amounts associated with each of the advertisements, objects associated with each of the advertisements and the relative preference information for the viewing user. 5. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
modifying one or more affinities of the viewing user for one or more objects based at least in part on the relative preference information; ranking the one or more objects using the modified one or more affinities; and selecting content based at least in part on the ranking 6. The computer-implemented method of claim 1, wherein storing relative preference information for the viewing user in the social networking system comprises:
generating an object assocaited with the pair of objects; storing the object associated with the pair of objects in the social networking system; storing a connection between the user profile of the viewing user and the object associated with the pair of objects, the connection identifying the selected object. 7. The computer-implemented method of claim 1, wherein storing relative preference information for the viewing user in the social networking system comprises:
storing the information identifying the pair of objects and the selected object in the user profile associated with the viewing user. 8. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
selecting the pair from one or more specified pairings of objects. 9. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
receiving, by the social networking system, an action performed by the viewing user; selecting the pair of objects based at least in part on the action performed by the viewing user. 10. The computer-implemented method of claim 9, wherein the action comprises a check-in at a location. 11. The computer-implemented method of claim 11, wherein the pair of objects is selected at least in part based on the location. 12. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
accessing user profiles associated with a plurality of users of the social networking system connected to the viewing user; selecting the pair of objects based at least in part on information in the accessed user profiles. 13. The computer-implemented method of claim 12, wherein the information in the accessed user profiles comprises one or more interests. 14. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a user profile associated with a user of a social networking system; receiving, by the social networking system, an action performed by the user; selecting a group of objects including at least two of objects based at least in part on the action performed by the user; presenting the group of objects to the user; receiving a selection of an object from the group of objects from the user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the user's preference for the selected object from the group of objects; and associating the relative preference information with the user profile associated with the user. 15. The computer-implemented method of claim 14, further comprising:
selecting content for presentation to the user based at least in part on the relative preference information; and presenting the selected content to the user. 16. The computer-implemented method of claim 15, wherein selecting content for presentation to the user comprises:
selecting an advertisement associated with the selected object from the group of objects. 17. The computer-implemented method of claim 15, wherein selecting content for presentation to the user comprises:
selecting an advertisement from a plurality of advertisements based on bid amounts associated with each of the advertisements, objects associated with each of the advertisements and the relative preference information for the user. 18. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a user profile associated with a viewing user of a social networking system; generating a plurality of pairs of objects from a set of the stored objects; presenting multiple pairs of objects selected form the plurality of pairs of objects to the viewing user; receiving a selection of an object from each presented pair of objects from the viewing user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the viewing user's preference for the object selected from the pair of objects by the viewing user; ranking objects in the set of objects based at least in part on the stored relative preference information for the viewing user; and presenting additional content to a user of the social networking system based on the ranking 19. The computer-implemented method of claim 18, wherein presenting additional content to the user of the social networking system based on the ranking comprises:
presenting an advertisement associated with an object from the set of objects to a user connected to the viewing user, the advertisement including information about the ranking 20. The computer-implemented method of claim 18, wherein presenting additional content to the user of the social networking system based on the ranking comprises:
selecting information about an object in the set for a user connected to the viewing user based at least in part on the object's position in the ranking; and presenting the selected information to the user connected to the viewing user. | A social networking system identifies a user's relative preference for objects maintained by the social networking system, such as pages associated with movies, restaurants, businesses, or other content. To obtain the user's preferences, the system provides pairs, or groups, of objects to a user and prompts the user to indicate a preference between the objects in each pair. This obtained information about the user's relative preferences is stored in conjunction with the user's profile, which can then be used to select content subsequently presented to the user.1. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a plurality of user profiles associated with users of the social networking system, the plurality of user profiles including a user profile associated with a viewing user; selecting a pair of objects for the user profile associated with the viewing user; presenting the pair of objects to the viewing user; receiving a selection of an object from the pair of objects from the viewing user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the viewing user's preference for the selected object from the pair of objects; and associating the relative preference information with the user profile associated with the viewing user. 2. The computer-implemented method of claim 1, further comprising:
selecting content for presentation to the viewing user based at least in part on the relative preference information; and presenting the selected content to the viewing user. 3. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
selecting an advertisement associated with the selected object from the pair of objects. 4. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
selecting an advertisement from a plurality of advertisements based on bid amounts associated with each of the advertisements, objects associated with each of the advertisements and the relative preference information for the viewing user. 5. The computer-implemented method of claim 2, wherein selecting content for presentation to the viewing user based at least in part on the relative preference information comprises:
modifying one or more affinities of the viewing user for one or more objects based at least in part on the relative preference information; ranking the one or more objects using the modified one or more affinities; and selecting content based at least in part on the ranking 6. The computer-implemented method of claim 1, wherein storing relative preference information for the viewing user in the social networking system comprises:
generating an object assocaited with the pair of objects; storing the object associated with the pair of objects in the social networking system; storing a connection between the user profile of the viewing user and the object associated with the pair of objects, the connection identifying the selected object. 7. The computer-implemented method of claim 1, wherein storing relative preference information for the viewing user in the social networking system comprises:
storing the information identifying the pair of objects and the selected object in the user profile associated with the viewing user. 8. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
selecting the pair from one or more specified pairings of objects. 9. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
receiving, by the social networking system, an action performed by the viewing user; selecting the pair of objects based at least in part on the action performed by the viewing user. 10. The computer-implemented method of claim 9, wherein the action comprises a check-in at a location. 11. The computer-implemented method of claim 11, wherein the pair of objects is selected at least in part based on the location. 12. The computer-implemented method of claim 1, wherein selecting the pair of objects for the user profile associated with the viewing user comprises:
accessing user profiles associated with a plurality of users of the social networking system connected to the viewing user; selecting the pair of objects based at least in part on information in the accessed user profiles. 13. The computer-implemented method of claim 12, wherein the information in the accessed user profiles comprises one or more interests. 14. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a user profile associated with a user of a social networking system; receiving, by the social networking system, an action performed by the user; selecting a group of objects including at least two of objects based at least in part on the action performed by the user; presenting the group of objects to the user; receiving a selection of an object from the group of objects from the user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the user's preference for the selected object from the group of objects; and associating the relative preference information with the user profile associated with the user. 15. The computer-implemented method of claim 14, further comprising:
selecting content for presentation to the user based at least in part on the relative preference information; and presenting the selected content to the user. 16. The computer-implemented method of claim 15, wherein selecting content for presentation to the user comprises:
selecting an advertisement associated with the selected object from the group of objects. 17. The computer-implemented method of claim 15, wherein selecting content for presentation to the user comprises:
selecting an advertisement from a plurality of advertisements based on bid amounts associated with each of the advertisements, objects associated with each of the advertisements and the relative preference information for the user. 18. A computer-implemented method comprising:
storing a plurality of objects in a social networking system; storing a user profile associated with a viewing user of a social networking system; generating a plurality of pairs of objects from a set of the stored objects; presenting multiple pairs of objects selected form the plurality of pairs of objects to the viewing user; receiving a selection of an object from each presented pair of objects from the viewing user; storing relative preference information for the viewing user in the social networking system, the relative preference information identifying the viewing user's preference for the object selected from the pair of objects by the viewing user; ranking objects in the set of objects based at least in part on the stored relative preference information for the viewing user; and presenting additional content to a user of the social networking system based on the ranking 19. The computer-implemented method of claim 18, wherein presenting additional content to the user of the social networking system based on the ranking comprises:
presenting an advertisement associated with an object from the set of objects to a user connected to the viewing user, the advertisement including information about the ranking 20. The computer-implemented method of claim 18, wherein presenting additional content to the user of the social networking system based on the ranking comprises:
selecting information about an object in the set for a user connected to the viewing user based at least in part on the object's position in the ranking; and presenting the selected information to the user connected to the viewing user. | 3,600 |
13,561 | 13,561 | 15,851,862 | 3,636 | A child safety seat comprising a seat body and first and second side wings depending from the seat body, the first and second side wings each comprising an outwardly facing exterior surface, an impact energy absorbing device depending from at least a part of the exterior surface of the first and second side wings, the impact energy absorbing device comprising a hollow and/or gas, liquid, gel or other energy absorbing material filled shell of deformable material formed by blow moulding, comprising an outwardly facing surface and an inwardly or occupant facing surface, and a plurality of energy absorbing elements in the form of recesses extending into the shell from the inwardly facing surface toward the outwardly facing surface; wherein the impact absorbing system is adapted to absorb impact through a combination of the shell plastically or elastically deforming, cushioning, rupturing, deflating or bursting, and the plurality of energy absorbing elements cooperatively plastically or elastically deforming, cushioning or crushing, as a result of the impact. | 1. A child safety seat comprising:
a seat body and first and second side wings depending from the seat body, the first and second side wings each comprising an outwardly facing exterior surface; an impact energy absorbing device depending from at least a part of the exterior surface of the first and second side wings, the impact energy absorbing device comprising:
a hollow and/or gas, liquid, gel or other energy absorbing material filled shell of deformable material formed by blow moulding, comprising an outwardly facing surface and an inwardly or occupant facing surface; and
a plurality of energy absorbing elements in the form of recesses extending into the shell from the inwardly facing surface toward the outwardly facing surface;
wherein the impact absorbing system is adapted to absorb impact through a combination of the shell plastically or elastically deforming, cushioning, rupturing, deflating or bursting, and the plurality of energy absorbing elements cooperatively plastically or elastically deforming, cushioning or crushing, as a result of the impact. 2. The child safety seat of claim 1, wherein the shell has a thin wall of polymeric material. 3. The child safety seat of claim 2, wherein the shell is manufactured from low density polyethylene. 4. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are circular. 5. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are square. 6. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are elongate. 7. The child safety seat of claim 1, wherein the shell features apertures so that some of any air in the shell can be released in a controlled fashion as the device is compressed as a result of the impact. 8. An impact energy absorbing device comprising a shell with a pair of opposing surfaces, wherein one of the surfaces comprises at least one energy absorbing element in the form of a recess extending into the shell toward the other surface. | A child safety seat comprising a seat body and first and second side wings depending from the seat body, the first and second side wings each comprising an outwardly facing exterior surface, an impact energy absorbing device depending from at least a part of the exterior surface of the first and second side wings, the impact energy absorbing device comprising a hollow and/or gas, liquid, gel or other energy absorbing material filled shell of deformable material formed by blow moulding, comprising an outwardly facing surface and an inwardly or occupant facing surface, and a plurality of energy absorbing elements in the form of recesses extending into the shell from the inwardly facing surface toward the outwardly facing surface; wherein the impact absorbing system is adapted to absorb impact through a combination of the shell plastically or elastically deforming, cushioning, rupturing, deflating or bursting, and the plurality of energy absorbing elements cooperatively plastically or elastically deforming, cushioning or crushing, as a result of the impact.1. A child safety seat comprising:
a seat body and first and second side wings depending from the seat body, the first and second side wings each comprising an outwardly facing exterior surface; an impact energy absorbing device depending from at least a part of the exterior surface of the first and second side wings, the impact energy absorbing device comprising:
a hollow and/or gas, liquid, gel or other energy absorbing material filled shell of deformable material formed by blow moulding, comprising an outwardly facing surface and an inwardly or occupant facing surface; and
a plurality of energy absorbing elements in the form of recesses extending into the shell from the inwardly facing surface toward the outwardly facing surface;
wherein the impact absorbing system is adapted to absorb impact through a combination of the shell plastically or elastically deforming, cushioning, rupturing, deflating or bursting, and the plurality of energy absorbing elements cooperatively plastically or elastically deforming, cushioning or crushing, as a result of the impact. 2. The child safety seat of claim 1, wherein the shell has a thin wall of polymeric material. 3. The child safety seat of claim 2, wherein the shell is manufactured from low density polyethylene. 4. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are circular. 5. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are square. 6. The child safety seat of claim 1, wherein the plurality of energy absorbing elements are elongate. 7. The child safety seat of claim 1, wherein the shell features apertures so that some of any air in the shell can be released in a controlled fashion as the device is compressed as a result of the impact. 8. An impact energy absorbing device comprising a shell with a pair of opposing surfaces, wherein one of the surfaces comprises at least one energy absorbing element in the form of a recess extending into the shell toward the other surface. | 3,600 |
13,562 | 13,562 | 14,345,383 | 3,643 | A branching position having two supporting legs of a fishing rod guide having two supporting legs formed by three sets of fiber-reinforced resin layers disposed in a fishing rod is sealed by a thermoset resin member or a prepreg. | 1. A fishing line guide in which a fishing line guide section guiding a fishing line, a first leg portion extending in one direction from an end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching from either one of the end portion of the fishing line guide section and the first leg portion to extend in another direction and having a fixed portion disposed at a tip are integrally configured, the fishing line guide comprising:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer to the branching position; a third fiber-reinforced resin layer where the synthetic resins are laminated to reach from the first leg portion to the second leg portion through the branching position and be fixed to the first fiber-reinforced resin layer and the second fiber-reinforced resin layer; and a branching gap member surrounded by the first fiber-reinforced resin layer to the third fiber-reinforced resin layer and positioned in the branching position. 2. A fishing line guide in which a fishing line guide section guiding a fishing line, a first leg portion extending in one direction from an end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching from either one of the end portion of the fishing line guide section and the first leg portion to extend in another direction and having a fixed portion disposed at a tip are integrally configured, the fishing line guide comprising:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer between the fishing line guide section and the branching position; and a branching gap member positioned at the branching position of the first fiber-reinforced resin layer and the second fiber-reinforced resin layer. 3. The fishing line guide according to claim 1,
wherein a bending radius of the third fiber-reinforced resin layer reaching from the first leg portion to the second leg portion through the branching position is larger than a layer thickness of each of the first fiber-reinforced resin layer and the second fiber-reinforced resin layer, and breaking is not generated at least in the reinforced fiber in the third fiber-reinforced resin layer. 4. The fishing line guide according to claim 1,
wherein the branching gap member is formed by a prepreg in which a plurality of reinforced fibers are arranged in a row and impregnated with a thermoset resin. 5. A fishing rod for fishing in which a plurality of fishing line guides in which an annular fishing line guide section, a first leg portion extending from an annular end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching and extending from either one of the annular end portion of the fishing line guide section and the first leg portion and having a fixed portion disposed at a tip are integrally configured are disposed, the fishing rod comprising the fishing line guide including:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer between the fishing line guide section and the branching position; a third fiber-reinforced resin layer where the synthetic resins are laminated to reach from the first leg portion to the second leg portion through the branching position and be fixed to the first fiber-reinforced resin layer and the second fiber-reinforced resin layer; and a branching gap member surrounded by the first fiber-reinforced resin layer to the third fiber-reinforced resin layer and positioned in the branching position. 6. A fishing line guide with a frame main body in which a plurality of fiber sheets in which a plurality of reinforced fibers are arranged and impregnated with a resin material having either thermosetting properties or a thermoplastic properties are laminated such that an annular fishing line guide section guiding a fishing line, a supporting leg portion extending from an end portion of the fishing line guide section, and a fixed portion bent and extending from a tip side of the supporting leg portion are integrally configured, the fishing line guide comprising:
a gap sealing member impregnating the reinforced fiber arranged along an extension direction of a surface of the end portion with the resin material with respect to a short-width fiber sheet not reaching an end surface of the frame main body and having an end portion in a lamination, wherein the gap sealing member is arranged to abut along the surface of the end portion of the short-width fiber sheet and blocks a gap generated between a surface of the end portion and the fiber sheet laminated to pinch the surface by changing a cross-sectional shape during pressing and heating toward the frame main body. 7. The fishing line guide according to claim 6,
wherein the short-width fiber sheet is a reinforcing member applied between the tip of the fixed portion and a bent part. 8. A fishing rod comprising a plurality of fishing line guides mounted on the fishing rod,
wherein a plurality of fiber sheets in which a plurality of reinforced fibers are arranged and impregnated with a resin material having either thermosetting properties or a thermoplastic properties are laminated such that an annular fishing line guide section guiding a fishing line, a supporting leg portion extending from an end portion of the fishing line guide section, and a fixed portion bent and extending from a tip side of the supporting leg portion are integrally configured, and wherein the fishing line guide includes a gap sealing member impregnating the reinforced fiber arranged along an extension direction of a surface of the end portion with the resin material with respect to a short-width fiber sheet not reaching an end surface of the frame main body and having an end portion in a lamination, and the gap sealing member is arranged to abut along the surface of the end portion of the short-width fiber sheet and blocks a gap generated between a surface of the end portion and the fiber sheet laminated to pinch the surface by changing a cross-sectional shape during pressing and heating toward the frame main body. | A branching position having two supporting legs of a fishing rod guide having two supporting legs formed by three sets of fiber-reinforced resin layers disposed in a fishing rod is sealed by a thermoset resin member or a prepreg.1. A fishing line guide in which a fishing line guide section guiding a fishing line, a first leg portion extending in one direction from an end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching from either one of the end portion of the fishing line guide section and the first leg portion to extend in another direction and having a fixed portion disposed at a tip are integrally configured, the fishing line guide comprising:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer to the branching position; a third fiber-reinforced resin layer where the synthetic resins are laminated to reach from the first leg portion to the second leg portion through the branching position and be fixed to the first fiber-reinforced resin layer and the second fiber-reinforced resin layer; and a branching gap member surrounded by the first fiber-reinforced resin layer to the third fiber-reinforced resin layer and positioned in the branching position. 2. A fishing line guide in which a fishing line guide section guiding a fishing line, a first leg portion extending in one direction from an end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching from either one of the end portion of the fishing line guide section and the first leg portion to extend in another direction and having a fixed portion disposed at a tip are integrally configured, the fishing line guide comprising:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer between the fishing line guide section and the branching position; and a branching gap member positioned at the branching position of the first fiber-reinforced resin layer and the second fiber-reinforced resin layer. 3. The fishing line guide according to claim 1,
wherein a bending radius of the third fiber-reinforced resin layer reaching from the first leg portion to the second leg portion through the branching position is larger than a layer thickness of each of the first fiber-reinforced resin layer and the second fiber-reinforced resin layer, and breaking is not generated at least in the reinforced fiber in the third fiber-reinforced resin layer. 4. The fishing line guide according to claim 1,
wherein the branching gap member is formed by a prepreg in which a plurality of reinforced fibers are arranged in a row and impregnated with a thermoset resin. 5. A fishing rod for fishing in which a plurality of fishing line guides in which an annular fishing line guide section, a first leg portion extending from an annular end portion of the fishing line guide section and having a fixed portion disposed at a tip, and a second leg portion branching and extending from either one of the annular end portion of the fishing line guide section and the first leg portion and having a fixed portion disposed at a tip are integrally configured are disposed, the fishing rod comprising the fishing line guide including:
a first fiber-reinforced resin layer where a plurality of sheet-shaped synthetic resins containing reinforced fibers are laminated to form the fishing line guide section and the first leg portion; a second fiber-reinforced resin layer where the synthetic resins forming the fishing line guide section and the second leg portion are laminated to be fixed to the first fiber-reinforced resin layer between the fishing line guide section and the branching position; a third fiber-reinforced resin layer where the synthetic resins are laminated to reach from the first leg portion to the second leg portion through the branching position and be fixed to the first fiber-reinforced resin layer and the second fiber-reinforced resin layer; and a branching gap member surrounded by the first fiber-reinforced resin layer to the third fiber-reinforced resin layer and positioned in the branching position. 6. A fishing line guide with a frame main body in which a plurality of fiber sheets in which a plurality of reinforced fibers are arranged and impregnated with a resin material having either thermosetting properties or a thermoplastic properties are laminated such that an annular fishing line guide section guiding a fishing line, a supporting leg portion extending from an end portion of the fishing line guide section, and a fixed portion bent and extending from a tip side of the supporting leg portion are integrally configured, the fishing line guide comprising:
a gap sealing member impregnating the reinforced fiber arranged along an extension direction of a surface of the end portion with the resin material with respect to a short-width fiber sheet not reaching an end surface of the frame main body and having an end portion in a lamination, wherein the gap sealing member is arranged to abut along the surface of the end portion of the short-width fiber sheet and blocks a gap generated between a surface of the end portion and the fiber sheet laminated to pinch the surface by changing a cross-sectional shape during pressing and heating toward the frame main body. 7. The fishing line guide according to claim 6,
wherein the short-width fiber sheet is a reinforcing member applied between the tip of the fixed portion and a bent part. 8. A fishing rod comprising a plurality of fishing line guides mounted on the fishing rod,
wherein a plurality of fiber sheets in which a plurality of reinforced fibers are arranged and impregnated with a resin material having either thermosetting properties or a thermoplastic properties are laminated such that an annular fishing line guide section guiding a fishing line, a supporting leg portion extending from an end portion of the fishing line guide section, and a fixed portion bent and extending from a tip side of the supporting leg portion are integrally configured, and wherein the fishing line guide includes a gap sealing member impregnating the reinforced fiber arranged along an extension direction of a surface of the end portion with the resin material with respect to a short-width fiber sheet not reaching an end surface of the frame main body and having an end portion in a lamination, and the gap sealing member is arranged to abut along the surface of the end portion of the short-width fiber sheet and blocks a gap generated between a surface of the end portion and the fiber sheet laminated to pinch the surface by changing a cross-sectional shape during pressing and heating toward the frame main body. | 3,600 |
13,563 | 13,563 | 14,534,744 | 3,683 | Methods, computer readable storage media, and systems for estimating and predicting audience segment sizes are provided. An exemplary method receives a request for segment sizes for a defined audience segment, the request indicating one or more traits of visitors of network content and a time range. The method then retrieves audience data based at least in part on the one or more traits and the time range. Next, the method calculates, based at least in part on the retrieved audience data, audience segment population sizes for a plurality of durations in the time range. | 1. A computer-implemented method, comprising:
receiving, at a computing device, a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range; retrieving audience data based at least in part on the one or more traits and the time range; and calculating, by the computing device, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 2. The method of claim 1, wherein the retrieving comprises:
translating the request into one or more queries for the audience data; and executing the one or more queries to obtain a time series. 3. The method of claim 1, wherein the retrieving comprises retrieving audience data from a data store populated by evaluating a combined recency and frequency of one or more qualification events together according to a segment rule defining the audience segment. 4. The method of claim 1, wherein the plurality of durations include at least one duration in the past and one duration in the future. 5. The method of claim 1, wherein the plurality of durations include one or more hours, days, weeks, or portions thereof in the time range. 6. The method of claim 1, wherein the calculating comprises:
identifying patterns in the retrieved audience data; estimating, based at least in part on the identified patterns, audience segment sizes for a plurality of past durations in the time range; and predicting, based at least in part on the estimated audience segment sizes, at least one audience segment size for a future duration in the time range. 7. The method of claim 1, further comprising providing the calculated audience segment sizes for display, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 8. The method of claim 1, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size, the method further comprising: displaying, on a display of the computing device, the estimated at least one past audience segment size and the predicted at least one future audience segment size. 9. The method of claim 8, wherein the displaying comprises graphically depicting the estimated and predicted audience segment sizes for selected durations within the time range. 10. The method of claim 1, wherein the calculating comprises estimating an audience segment size in near real-time, and wherein the estimating comprises using a distributed search cluster service to search one or more qualification events within the time range. 11. The method of claim 1, wherein the calculating comprises estimating one or more audience segment sizes, wherein the estimating includes evaluating a combined recency and frequency of each of one or more qualification events that are within the time range. 12. The method of claim 11, wherein each of the one or more qualification events is associated with a time of occurrence of the respective qualification event, wherein each time of occurrence is stored with an indication of the respective qualification event. 13. The method of claim 1, wherein the calculated audience segment sizes indicate a respective number of unique visitors who qualify in respective ones of the plurality of durations in the time range, according to a segment rule. 14. A non-transitory computer readable storage medium having executable instructions stored thereon, that, if executed by a computing device, cause the computing device to perform operations comprising:
receiving a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range; retrieving audience data based at least in part on the one or more traits and the time range; and calculating, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 15. The computer readable storage medium of claim 14, the operations further comprising:
displaying, on a display of the computing device, calculated audience segment sizes, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 16. The computer readable storage medium of claim 14, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size. 17. A system, comprising:
a display device; a processor; and a memory having instructions stored thereon that, if executed by the processor, cause the processor to perform operations, the operations
comprising:
receiving a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range;
retrieving audience data based at least in part on the one or more traits and the time range; and
calculating, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 18. The system of claim 17, the operations further comprising:
displaying, on the display device, calculated audience segment sizes, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 19. The system of claim 17, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size, the operations further comprising: displaying, on the display device, the estimated at least one past audience segment size and the predicted at least one future audience segment size. 20. The system of claim 17, wherein the retrieving comprises:
translating the request into a plurality of queries for the audience data, each of the plurality of queries corresponding to respective ones of the plurality of durations; and executing the plurality of queries to obtain a time series. | Methods, computer readable storage media, and systems for estimating and predicting audience segment sizes are provided. An exemplary method receives a request for segment sizes for a defined audience segment, the request indicating one or more traits of visitors of network content and a time range. The method then retrieves audience data based at least in part on the one or more traits and the time range. Next, the method calculates, based at least in part on the retrieved audience data, audience segment population sizes for a plurality of durations in the time range.1. A computer-implemented method, comprising:
receiving, at a computing device, a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range; retrieving audience data based at least in part on the one or more traits and the time range; and calculating, by the computing device, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 2. The method of claim 1, wherein the retrieving comprises:
translating the request into one or more queries for the audience data; and executing the one or more queries to obtain a time series. 3. The method of claim 1, wherein the retrieving comprises retrieving audience data from a data store populated by evaluating a combined recency and frequency of one or more qualification events together according to a segment rule defining the audience segment. 4. The method of claim 1, wherein the plurality of durations include at least one duration in the past and one duration in the future. 5. The method of claim 1, wherein the plurality of durations include one or more hours, days, weeks, or portions thereof in the time range. 6. The method of claim 1, wherein the calculating comprises:
identifying patterns in the retrieved audience data; estimating, based at least in part on the identified patterns, audience segment sizes for a plurality of past durations in the time range; and predicting, based at least in part on the estimated audience segment sizes, at least one audience segment size for a future duration in the time range. 7. The method of claim 1, further comprising providing the calculated audience segment sizes for display, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 8. The method of claim 1, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size, the method further comprising: displaying, on a display of the computing device, the estimated at least one past audience segment size and the predicted at least one future audience segment size. 9. The method of claim 8, wherein the displaying comprises graphically depicting the estimated and predicted audience segment sizes for selected durations within the time range. 10. The method of claim 1, wherein the calculating comprises estimating an audience segment size in near real-time, and wherein the estimating comprises using a distributed search cluster service to search one or more qualification events within the time range. 11. The method of claim 1, wherein the calculating comprises estimating one or more audience segment sizes, wherein the estimating includes evaluating a combined recency and frequency of each of one or more qualification events that are within the time range. 12. The method of claim 11, wherein each of the one or more qualification events is associated with a time of occurrence of the respective qualification event, wherein each time of occurrence is stored with an indication of the respective qualification event. 13. The method of claim 1, wherein the calculated audience segment sizes indicate a respective number of unique visitors who qualify in respective ones of the plurality of durations in the time range, according to a segment rule. 14. A non-transitory computer readable storage medium having executable instructions stored thereon, that, if executed by a computing device, cause the computing device to perform operations comprising:
receiving a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range; retrieving audience data based at least in part on the one or more traits and the time range; and calculating, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 15. The computer readable storage medium of claim 14, the operations further comprising:
displaying, on a display of the computing device, calculated audience segment sizes, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 16. The computer readable storage medium of claim 14, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size. 17. A system, comprising:
a display device; a processor; and a memory having instructions stored thereon that, if executed by the processor, cause the processor to perform operations, the operations
comprising:
receiving a request for an audience segment calculation, wherein the request indicates one or more traits of visitors of network content and a time range;
retrieving audience data based at least in part on the one or more traits and the time range; and
calculating, based at least in part on the retrieved audience data, audience segment sizes for a plurality of durations in the time range. 18. The system of claim 17, the operations further comprising:
displaying, on the display device, calculated audience segment sizes, wherein the audience segment sizes each correspond to a respective one of the plurality of durations in the time range. 19. The system of claim 17, wherein the calculating comprises:
estimating at least one past audience segment size for a past duration in the time range; and predicting at least one future audience segment size based at least in part on the estimated at least one past audience segment size, the operations further comprising: displaying, on the display device, the estimated at least one past audience segment size and the predicted at least one future audience segment size. 20. The system of claim 17, wherein the retrieving comprises:
translating the request into a plurality of queries for the audience data, each of the plurality of queries corresponding to respective ones of the plurality of durations; and executing the plurality of queries to obtain a time series. | 3,600 |
13,564 | 13,564 | 14,060,518 | 3,685 | Systems and methods are provided for securing payment card information. A user may present a payment card such as a credit card to point-of-sale equipment. The point-of-sale equipment may encrypt the payment card information. An encryption algorithm may be used that takes as inputs a first part of the payment card information, a tweak formed by a second part of the payment card information, and an encryption key. The encrypted payment card information may be conveyed to a gateway over a communications network. The gateway may identify which encryption algorithm was used in encrypting the payment card information and may re-encrypt the payment card information using a format preserving encryption algorithm. A network-based service may be used to remotely perform functions for the gateway. | 1. A computer-implemented method for securing payment card data in a system having at least one point of sale terminal and at least one payment card transaction processing gateway, the method comprising:
deriving, with a key server, an intermediate key from a master key; sending, with the key server, the intermediate key from the key server to the at least one payment card transaction processing gateway; deriving, with the key server, a first terminal key from the intermediate key; sending, with the key server, the first terminal key to the at least one point of sale terminal; obtaining, with the at least one point of sale terminal, payment card data associated with a payment card of a user during a purchase transaction; generating, with the at least one point of sale terminal, a second terminal key; encrypting, by the at least one point of sale terminal, the payment card data using an encryption algorithm that takes as inputs a first part of the payment card data, a tweak formed from a second part of the payment card data, and the second terminal key; transmitting, with the at least one point of sale terminal, the encrypted payment card data and the tweak to the at least one payment card transaction processing gateway; deriving, with the at least one payment card transaction processing gateway, the second terminal key using the intermediate key; and decrypting, with the at least one payment card transaction processing gateway, the encrypted payment card data using the second terminal key and the tweak. 2. The computer-implemented method defined in claim 1, further comprising:
with the at least one payment card transaction processing gateway, re-encrypting the payment card data that has been decrypted. 3. The computer-implemented method defined in claim 2, wherein the step of re-encrypting the payment card data comprises re-encrypting the payment card data using a format-preserving encryption algorithm. 4. The computer-implemented method defined in claim 1, wherein the at least one point of sale terminal comprises a plurality of point of sale terminals, the method further comprising:
with the at least one payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals. 5. The computer-implemented method defined in claim 4, wherein the at least one payment card transaction processing gateway comprises a plurality of payment card transaction processing gateways, the method further comprising:
with the plurality of payment card transaction processing gateways, receiving the encrypted payment card data from the plurality of point of sale terminals. 6. The computer-implemented method defined in claim 1, wherein the payment card data includes a 16-digit primary account number, wherein the first part of the payment card data is the last 10 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the second part of the payment card data. 7. The computer-implemented method defined in claim 6, wherein the second part of the payment card data is the first 6 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the first 6 digits of the 16-digit primary account number. 8. The computer-implemented method defined in claim 1, wherein sending the intermediate key to the at least one payment card transaction processing gateway comprises:
sending the intermediate key to the at least one payment card transaction processing gateway over a secure sockets layer link. 9. The computer-implemented method defined in claim 1, wherein the step of encrypting the payment card data comprises encrypting the payment card data using a format-preserving encryption algorithm. 10. A computer-implemented method for securing payment card data in a system having a plurality of point of sale terminals and at least one payment card transaction processing gateway, the method comprising:
with the plurality of point of sale terminals, obtaining the payment card data during purchase transactions; with the plurality of point of sale terminals, encrypting the payment card data using a plurality of respective encryption algorithms, each of which produces respective encrypted data using a different encryption algorithm format; with the payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals; with the payment card transaction processing gateway, identifying each of the different encryption algorithm formats used in encrypting the payment card data; and with the payment card transaction processing gateway, decrypting the payment data using a plurality of decryption algorithms that respectively correspond to the different encryption algorithm formats. 11. The computer-implemented method defined in claim 10, further comprising:
with the payment card transaction processing gateway, encrypting the payment card data that has been decrypted using the plurality of decryption algorithms using a single encryption algorithm. 12. The computer-implemented method defined in claim 11, wherein encrypting the payment card data decrypted using the plurality of decryption algorithms comprises encrypting the payment card data using a format-preserving encryption algorithm. 13. The computer-implemented method defined in claim 11, wherein encrypting the payment card data that has been decrypted comprises:
with the payment card transaction processing gateway, encrypting a first portion of a payment card number while leaving a second portion of the payment card number unencrypted; and with the payment card transaction processing gateway, storing the encrypted first portion and the second portion in a database. 14. The computer-implemented method defined in claim 13, wherein the payment card number comprises a 16-digit primary account number and wherein the second portion of the payment card number is the first six digits of the 16-digit primary account number. 15. The computer-implemented method defined in claim 13, wherein the payment card number comprises a primary account number having multiple primary account number digits and wherein the second portion of the payment card number is the first digit of the primary account number. 16. The computer-implemented method defined in claim 10, wherein each encryption algorithm format has a different encryption algorithm identifier, the method further comprising:
with the payment card transaction processing gateway, receiving the different encryption algorithm identifiers from the plurality of point of sale terminals. 17. A computer-implemented method for securing payment card data in a system having at least one point of sale terminal and at least one payment card transaction processing gateway, the method comprising:
deriving, with a key server, an intermediate key from a master key; sending, with the key server, the intermediate key to the at least one payment card transaction processing gateway; generating, with the at least one point of sale terminal, a random terminal key; identifying, with the at least one point of sale terminal, a public key; encrypting, with the at least one point of sale terminal, the random terminal key using the public key; obtaining, with the at least one point of sale terminal, payment card data associated with a payment card of a user during a purchase transaction; encrypting, with the at least one point of sale terminal, the payment card data using an encryption algorithm that takes as inputs a first part of the payment card data, a tweak formed from a second part of the payment card data, and the random terminal key; transmitting, with the at least point of sale terminal, the encrypted payment card data, the tweak and the encrypted random terminal key to the at least one payment card transaction processing gateway; decrypting, with the at least one payment card transaction processing gateway, the random terminal key using the intermediate key; and decrypting, with the at least one payment card transaction processing gateway, the encrypted payment card data using the random terminal key and the tweak. 18. The computer-implemented method defined in claim 17, wherein the at least one point of sale terminal comprises a plurality of point of sale terminals, the method further comprising:
with the at least one payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals. 19. The computer-implemented method defined in claim 17, wherein the payment card data includes a 16-digit primary account number, wherein the first part of the payment card data is the last 10 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the second part of the payment card data. 20. The computer-implemented method defined in claim 15, further comprising:
with the at least one payment card transaction processing gateway, re-encrypting the payment card data that has been decrypted. | Systems and methods are provided for securing payment card information. A user may present a payment card such as a credit card to point-of-sale equipment. The point-of-sale equipment may encrypt the payment card information. An encryption algorithm may be used that takes as inputs a first part of the payment card information, a tweak formed by a second part of the payment card information, and an encryption key. The encrypted payment card information may be conveyed to a gateway over a communications network. The gateway may identify which encryption algorithm was used in encrypting the payment card information and may re-encrypt the payment card information using a format preserving encryption algorithm. A network-based service may be used to remotely perform functions for the gateway.1. A computer-implemented method for securing payment card data in a system having at least one point of sale terminal and at least one payment card transaction processing gateway, the method comprising:
deriving, with a key server, an intermediate key from a master key; sending, with the key server, the intermediate key from the key server to the at least one payment card transaction processing gateway; deriving, with the key server, a first terminal key from the intermediate key; sending, with the key server, the first terminal key to the at least one point of sale terminal; obtaining, with the at least one point of sale terminal, payment card data associated with a payment card of a user during a purchase transaction; generating, with the at least one point of sale terminal, a second terminal key; encrypting, by the at least one point of sale terminal, the payment card data using an encryption algorithm that takes as inputs a first part of the payment card data, a tweak formed from a second part of the payment card data, and the second terminal key; transmitting, with the at least one point of sale terminal, the encrypted payment card data and the tweak to the at least one payment card transaction processing gateway; deriving, with the at least one payment card transaction processing gateway, the second terminal key using the intermediate key; and decrypting, with the at least one payment card transaction processing gateway, the encrypted payment card data using the second terminal key and the tweak. 2. The computer-implemented method defined in claim 1, further comprising:
with the at least one payment card transaction processing gateway, re-encrypting the payment card data that has been decrypted. 3. The computer-implemented method defined in claim 2, wherein the step of re-encrypting the payment card data comprises re-encrypting the payment card data using a format-preserving encryption algorithm. 4. The computer-implemented method defined in claim 1, wherein the at least one point of sale terminal comprises a plurality of point of sale terminals, the method further comprising:
with the at least one payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals. 5. The computer-implemented method defined in claim 4, wherein the at least one payment card transaction processing gateway comprises a plurality of payment card transaction processing gateways, the method further comprising:
with the plurality of payment card transaction processing gateways, receiving the encrypted payment card data from the plurality of point of sale terminals. 6. The computer-implemented method defined in claim 1, wherein the payment card data includes a 16-digit primary account number, wherein the first part of the payment card data is the last 10 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the second part of the payment card data. 7. The computer-implemented method defined in claim 6, wherein the second part of the payment card data is the first 6 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the first 6 digits of the 16-digit primary account number. 8. The computer-implemented method defined in claim 1, wherein sending the intermediate key to the at least one payment card transaction processing gateway comprises:
sending the intermediate key to the at least one payment card transaction processing gateway over a secure sockets layer link. 9. The computer-implemented method defined in claim 1, wherein the step of encrypting the payment card data comprises encrypting the payment card data using a format-preserving encryption algorithm. 10. A computer-implemented method for securing payment card data in a system having a plurality of point of sale terminals and at least one payment card transaction processing gateway, the method comprising:
with the plurality of point of sale terminals, obtaining the payment card data during purchase transactions; with the plurality of point of sale terminals, encrypting the payment card data using a plurality of respective encryption algorithms, each of which produces respective encrypted data using a different encryption algorithm format; with the payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals; with the payment card transaction processing gateway, identifying each of the different encryption algorithm formats used in encrypting the payment card data; and with the payment card transaction processing gateway, decrypting the payment data using a plurality of decryption algorithms that respectively correspond to the different encryption algorithm formats. 11. The computer-implemented method defined in claim 10, further comprising:
with the payment card transaction processing gateway, encrypting the payment card data that has been decrypted using the plurality of decryption algorithms using a single encryption algorithm. 12. The computer-implemented method defined in claim 11, wherein encrypting the payment card data decrypted using the plurality of decryption algorithms comprises encrypting the payment card data using a format-preserving encryption algorithm. 13. The computer-implemented method defined in claim 11, wherein encrypting the payment card data that has been decrypted comprises:
with the payment card transaction processing gateway, encrypting a first portion of a payment card number while leaving a second portion of the payment card number unencrypted; and with the payment card transaction processing gateway, storing the encrypted first portion and the second portion in a database. 14. The computer-implemented method defined in claim 13, wherein the payment card number comprises a 16-digit primary account number and wherein the second portion of the payment card number is the first six digits of the 16-digit primary account number. 15. The computer-implemented method defined in claim 13, wherein the payment card number comprises a primary account number having multiple primary account number digits and wherein the second portion of the payment card number is the first digit of the primary account number. 16. The computer-implemented method defined in claim 10, wherein each encryption algorithm format has a different encryption algorithm identifier, the method further comprising:
with the payment card transaction processing gateway, receiving the different encryption algorithm identifiers from the plurality of point of sale terminals. 17. A computer-implemented method for securing payment card data in a system having at least one point of sale terminal and at least one payment card transaction processing gateway, the method comprising:
deriving, with a key server, an intermediate key from a master key; sending, with the key server, the intermediate key to the at least one payment card transaction processing gateway; generating, with the at least one point of sale terminal, a random terminal key; identifying, with the at least one point of sale terminal, a public key; encrypting, with the at least one point of sale terminal, the random terminal key using the public key; obtaining, with the at least one point of sale terminal, payment card data associated with a payment card of a user during a purchase transaction; encrypting, with the at least one point of sale terminal, the payment card data using an encryption algorithm that takes as inputs a first part of the payment card data, a tweak formed from a second part of the payment card data, and the random terminal key; transmitting, with the at least point of sale terminal, the encrypted payment card data, the tweak and the encrypted random terminal key to the at least one payment card transaction processing gateway; decrypting, with the at least one payment card transaction processing gateway, the random terminal key using the intermediate key; and decrypting, with the at least one payment card transaction processing gateway, the encrypted payment card data using the random terminal key and the tweak. 18. The computer-implemented method defined in claim 17, wherein the at least one point of sale terminal comprises a plurality of point of sale terminals, the method further comprising:
with the at least one payment card transaction processing gateway, receiving the encrypted payment card data from the plurality of point of sale terminals. 19. The computer-implemented method defined in claim 17, wherein the payment card data includes a 16-digit primary account number, wherein the first part of the payment card data is the last 10 digits of the 16-digit primary account number, the method further comprising:
at the at least one point of sale terminal, forming the tweak from the second part of the payment card data. 20. The computer-implemented method defined in claim 15, further comprising:
with the at least one payment card transaction processing gateway, re-encrypting the payment card data that has been decrypted. | 3,600 |
13,565 | 13,565 | 14,913,938 | 3,674 | An invert emulsion drilling fluid employing as a suspension agent very fine sized fumed silica in combination with a primary viscosifier such as for example a fatty dimer diamine, and a method for the use thereof in drilling wellbores, with good rheological properties at high temperatures and pressures. In one embodiment the drilling fluid is free of organophilic clays and lignites and free of non-hydrophilic “low gravity solids,” and the fumed silica is a hydrophilic fumed silica, which provides enhanced suspension of drill cuttings without barite sag while maintaining good rheological properties at high temperatures and pressures. | 1. An invert emulsion drilling fluid for drilling in a subterranean formation comprising:
an oleaginous continuous phase; an aqueous internal phase; and a suspension agent comprising very fine sized fumed silica in combination with a primary viscosifier. 2. The drilling fluid of claim 1 wherein the fluid is substantially free of additives comprising non-hydrophilic low gravity solids. 3. The drilling fluid of claim 2 wherein the non-hydrophilic low gravity solids consist of sized calcium carbonate, ground marble, zeogel, bentonite, attapulgite, and other organophilic clay materials. 4. The drilling fluid of claim 1 wherein the fluid is substantially free of organophilic clays and lignites. 5. The drilling fluid of claim 1 wherein the base oil is selected from the group consisting of: paraffins; mineral oils; desulfurized hydrogenated kerosenes; diesel, esters, and combinations thereof. 6. The drilling fluid of claim 1 wherein the very fine sized fumed silica has a specific surface area in the range of 90 m2/gm to 700 m2/gm. 7. The drilling fluid of claim 1 wherein the fluid has a barite sag factor of less than about 0.53 after hot rolling at 250° F. 8. The drilling fluid of claim 1 wherein the very fine sized fumed silica comprises a combination of two different grades, one having an average particle size of 7 nm and the other having an average particle size of 0.1 to 0.3 μm. 9. The drilling fluid of claim 1 wherein the primary viscosifier is selected from the group consisting of dimer diamines, fatty dimer diamines, dimer fatty acids, pentaerythirtol tetrastearate and combinations thereof. 9. The drilling fluid of claim 1 wherein the ratio of primary viscosifier to fumed silica is about 1:5. 10. The drilling fluid of claim 1 wherein the quantity of primary viscosifier ranges from about 0.5 ppb to about 3.0 ppb and the quantity of fumed silica ranges from 0.5 ppb to about 15 ppb. 11. The drilling fluid of claim 1 wherein the primary viscosifier has about 28 to about 48 carbon atoms. 12. The drilling fluid of claim 1 wherein the primary viscosifier has about 36 carbon atoms. 13. The drilling fluid of claim 1 wherein the fumed silica has an average specific surface area of about 380 m2/gm or an average particle size of about 7 μm. 14. The drilling fluid of claim 1 wherein the fumed silica is hydrophilic. 15. A method for drilling in a subterranean formation having shales comprising:
providing or using an invert emulsion drilling fluid having:
a base oil;
an internal aqueous phase; and
a suspension agent comprising a combination of a primary viscosifier and very fine sized fumed silica; and
drilling through shales in the subterranean formation with the drilling fluid. 16. The method of claim 15 wherein the drilling fluid contains substantially no organophilic clays or lignites and no non-hydrophilic low gravity solids. 17. The method of claim 15 wherein the base oil of the drilling fluid is selected from the group of oils consisting of paraffins, mineral oils, kerosene, and combinations thereof. 18. The method of claim 15 wherein the primary viscosifier of the drilling fluid is selected from the group consisting of dimer diamines, fatty dimer diamines, dimer fatty acids, and pentaerythirtol tetrastearate. 19. The method of claim 15 wherein the very fine sized fumed silica of the drilling fluid has a specific surface area in the range of in the range of 90 m2/gm to 700 m2/gm. 20. The method of claim 15 wherein the drilling fluid has a barite sag factor of less than about 0.53 after hot rolling at 250° F. | An invert emulsion drilling fluid employing as a suspension agent very fine sized fumed silica in combination with a primary viscosifier such as for example a fatty dimer diamine, and a method for the use thereof in drilling wellbores, with good rheological properties at high temperatures and pressures. In one embodiment the drilling fluid is free of organophilic clays and lignites and free of non-hydrophilic “low gravity solids,” and the fumed silica is a hydrophilic fumed silica, which provides enhanced suspension of drill cuttings without barite sag while maintaining good rheological properties at high temperatures and pressures.1. An invert emulsion drilling fluid for drilling in a subterranean formation comprising:
an oleaginous continuous phase; an aqueous internal phase; and a suspension agent comprising very fine sized fumed silica in combination with a primary viscosifier. 2. The drilling fluid of claim 1 wherein the fluid is substantially free of additives comprising non-hydrophilic low gravity solids. 3. The drilling fluid of claim 2 wherein the non-hydrophilic low gravity solids consist of sized calcium carbonate, ground marble, zeogel, bentonite, attapulgite, and other organophilic clay materials. 4. The drilling fluid of claim 1 wherein the fluid is substantially free of organophilic clays and lignites. 5. The drilling fluid of claim 1 wherein the base oil is selected from the group consisting of: paraffins; mineral oils; desulfurized hydrogenated kerosenes; diesel, esters, and combinations thereof. 6. The drilling fluid of claim 1 wherein the very fine sized fumed silica has a specific surface area in the range of 90 m2/gm to 700 m2/gm. 7. The drilling fluid of claim 1 wherein the fluid has a barite sag factor of less than about 0.53 after hot rolling at 250° F. 8. The drilling fluid of claim 1 wherein the very fine sized fumed silica comprises a combination of two different grades, one having an average particle size of 7 nm and the other having an average particle size of 0.1 to 0.3 μm. 9. The drilling fluid of claim 1 wherein the primary viscosifier is selected from the group consisting of dimer diamines, fatty dimer diamines, dimer fatty acids, pentaerythirtol tetrastearate and combinations thereof. 9. The drilling fluid of claim 1 wherein the ratio of primary viscosifier to fumed silica is about 1:5. 10. The drilling fluid of claim 1 wherein the quantity of primary viscosifier ranges from about 0.5 ppb to about 3.0 ppb and the quantity of fumed silica ranges from 0.5 ppb to about 15 ppb. 11. The drilling fluid of claim 1 wherein the primary viscosifier has about 28 to about 48 carbon atoms. 12. The drilling fluid of claim 1 wherein the primary viscosifier has about 36 carbon atoms. 13. The drilling fluid of claim 1 wherein the fumed silica has an average specific surface area of about 380 m2/gm or an average particle size of about 7 μm. 14. The drilling fluid of claim 1 wherein the fumed silica is hydrophilic. 15. A method for drilling in a subterranean formation having shales comprising:
providing or using an invert emulsion drilling fluid having:
a base oil;
an internal aqueous phase; and
a suspension agent comprising a combination of a primary viscosifier and very fine sized fumed silica; and
drilling through shales in the subterranean formation with the drilling fluid. 16. The method of claim 15 wherein the drilling fluid contains substantially no organophilic clays or lignites and no non-hydrophilic low gravity solids. 17. The method of claim 15 wherein the base oil of the drilling fluid is selected from the group of oils consisting of paraffins, mineral oils, kerosene, and combinations thereof. 18. The method of claim 15 wherein the primary viscosifier of the drilling fluid is selected from the group consisting of dimer diamines, fatty dimer diamines, dimer fatty acids, and pentaerythirtol tetrastearate. 19. The method of claim 15 wherein the very fine sized fumed silica of the drilling fluid has a specific surface area in the range of in the range of 90 m2/gm to 700 m2/gm. 20. The method of claim 15 wherein the drilling fluid has a barite sag factor of less than about 0.53 after hot rolling at 250° F. | 3,600 |
13,566 | 13,566 | 13,936,981 | 3,693 | A method for processing a payment transaction and a personal record associated with the payment transaction is provided. The method includes receiving a request to authorize the payment transaction wherein the authorization request includes a cardholder ID and a payment transaction amount, and transmitting an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device. The method also includes receiving a request to process a personal record transaction associated with the payment transaction and a second service provider, and processing the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record to at least one of the cardholder and the second service provider. The second service provider may be the same as or different than the first service provider. | 1. A computer-implemented method for processing a payment transaction and a personal record associated with the payment transaction, the payment transaction initiated by a cardholder, said method implemented by a host computing device communicatively coupled to a memory, said method comprising:
receiving, at the host computing device, a request to authorize the payment transaction, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmitting an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receiving a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and processing, by the host computing device, the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 2. The method of claim 1, wherein processing the personal record transaction includes:
receiving the personal record from one of the cardholder computing device and the second service provider computing device; associating the personal record with the cardholder ID; and storing the personal record in the memory. 3. The method of claim 1, wherein processing the personal record transaction includes:
retrieving the personal record from the memory based at least in part on the cardholder ID; and transmitting the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 4. The method of claim 1, wherein said method further includes
verifying the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verifying the identity of the second service provider before processing the personal record transaction. 5. The method of claim 1, wherein said method further includes transmitting a transaction reward message associated with the payment transaction to the cardholder computing device after processing the request to authorize the payment transaction, wherein the transaction reward message includes information regarding at least one of a coupon, discount, rebate, rewards point offer, or product review. 6. The method of claim 1, wherein said method further includes causing to be displayed on the cardholder computing device, at least one of a list of personal records stored within the memory and available to be transmitted to the second service provider, a list of personal records generated based on the payment transaction and available to be stored in the memory, and a list of payment accounts associated with the cardholder and available to send payments to the first service provider. 7. The method of claim 1, wherein said method further includes prompting the cardholder to instruct the host computing device to store the personal record in the memory. 8. The method of claim 1, wherein said method further includes prompting the cardholder to instruct the host computing device to transmit the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 9. A method in accordance with claim 8, wherein transmitting the personal record includes at least one of transmitting an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. 10. The method of claim 1, wherein receiving the request to process a personal record transaction occurs before receiving the request to authorize a payment transaction. 11. A payment and record management computer system for processing a payment transaction and a personal record associated with the payment transaction, the payment transaction initiated by a cardholder, said computer system comprising:
a memory; and a host computing device communicatively coupled to the memory, the host computing device configured to: receive a request to authorize the payment transaction, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmit an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receive a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and process the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 12. The system of claim 11, wherein the host computing device is further configured to:
receive the personal record from one of the cardholder computing device and the second service provider computing device; associate the personal record with the cardholder ID; and store the personal record in the memory. 13. The system of claim 11, wherein the host computing device is further configured to:
retrieve the personal record from the memory based at least in part on the cardholder ID; and transmit the personal record to at least one of the cardholder computing device and the second service provider computing device. 14. The system of claim 11, wherein the host computing device is further configured to:
verify the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verify the identity of the second service provider before processing the personal record transaction. 15. The system of claim 11, wherein the host computing device is further configured to transmit a transaction reward message associated with the payment transaction to the cardholder computing device after processing the request to authorize the payment transaction, wherein the transaction reward message includes information regarding at least one of a coupon, discount, rebate, rewards point offer, or product review. 16. The system of claim 11, wherein the host computing device is further configured to cause to be displayed on the cardholder computing device, at least one of a list of personal records stored within the memory and available to be transmitted to the second service provider, a list of personal records generated based on the payment transaction and available to be stored in the memory, and a list of payment accounts associated with the cardholder and available to send payments to the first service provider. 17. The system of claim 11, wherein the host computing device is further configured to prompt the cardholder to instruct the host computing device to store the personal record in the memory. 18. The system of claim 11, wherein the host computing device is further configured to prompt the cardholder to instruct the host computing device to transmit the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 19. The system of claim 18, wherein the personal record includes at least one of an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. 20. A computer readable medium having computer-executable instructions embodied thereon, wherein, when executed by a host computing device having at least one processor, the computer-executable instructions cause the at least one processor to:
receive a request to authorize a payment transaction initiated by a cardholder, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmit an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receive a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and process the personal record transaction including at least one of (i) storing the personal record in a memory, and (ii) transmitting the personal record to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 21. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to:
receive the personal record from at least one of the cardholder computing device and the second service provider computing device; associate the personal record with the cardholder ID; and store the personal record in the memory. 22. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to:
retrieve the personal record from the memory based at least in part on the cardholder ID; and transmit the personal record to at least one of the cardholder computing device and the second service provider computing device. 23. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to
verify the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verify the identity of the second service provider before processing the personal record transaction. 24. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to prompt the cardholder to instruct the at least one processor to store the personal record in the memory. 25. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to prompt the cardholder to instruct the at least one processor to transmit the personal record from the memory to at least one of the cardholder computing device and the second service provider computing device. 26. The computer readable medium of claim 25, wherein the personal record includes at least one of an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. | A method for processing a payment transaction and a personal record associated with the payment transaction is provided. The method includes receiving a request to authorize the payment transaction wherein the authorization request includes a cardholder ID and a payment transaction amount, and transmitting an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device. The method also includes receiving a request to process a personal record transaction associated with the payment transaction and a second service provider, and processing the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record to at least one of the cardholder and the second service provider. The second service provider may be the same as or different than the first service provider.1. A computer-implemented method for processing a payment transaction and a personal record associated with the payment transaction, the payment transaction initiated by a cardholder, said method implemented by a host computing device communicatively coupled to a memory, said method comprising:
receiving, at the host computing device, a request to authorize the payment transaction, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmitting an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receiving a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and processing, by the host computing device, the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 2. The method of claim 1, wherein processing the personal record transaction includes:
receiving the personal record from one of the cardholder computing device and the second service provider computing device; associating the personal record with the cardholder ID; and storing the personal record in the memory. 3. The method of claim 1, wherein processing the personal record transaction includes:
retrieving the personal record from the memory based at least in part on the cardholder ID; and transmitting the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 4. The method of claim 1, wherein said method further includes
verifying the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verifying the identity of the second service provider before processing the personal record transaction. 5. The method of claim 1, wherein said method further includes transmitting a transaction reward message associated with the payment transaction to the cardholder computing device after processing the request to authorize the payment transaction, wherein the transaction reward message includes information regarding at least one of a coupon, discount, rebate, rewards point offer, or product review. 6. The method of claim 1, wherein said method further includes causing to be displayed on the cardholder computing device, at least one of a list of personal records stored within the memory and available to be transmitted to the second service provider, a list of personal records generated based on the payment transaction and available to be stored in the memory, and a list of payment accounts associated with the cardholder and available to send payments to the first service provider. 7. The method of claim 1, wherein said method further includes prompting the cardholder to instruct the host computing device to store the personal record in the memory. 8. The method of claim 1, wherein said method further includes prompting the cardholder to instruct the host computing device to transmit the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 9. A method in accordance with claim 8, wherein transmitting the personal record includes at least one of transmitting an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. 10. The method of claim 1, wherein receiving the request to process a personal record transaction occurs before receiving the request to authorize a payment transaction. 11. A payment and record management computer system for processing a payment transaction and a personal record associated with the payment transaction, the payment transaction initiated by a cardholder, said computer system comprising:
a memory; and a host computing device communicatively coupled to the memory, the host computing device configured to: receive a request to authorize the payment transaction, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmit an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receive a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and process the personal record transaction including at least one of (i) storing the personal record in the memory, and (ii) transmitting the personal record to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 12. The system of claim 11, wherein the host computing device is further configured to:
receive the personal record from one of the cardholder computing device and the second service provider computing device; associate the personal record with the cardholder ID; and store the personal record in the memory. 13. The system of claim 11, wherein the host computing device is further configured to:
retrieve the personal record from the memory based at least in part on the cardholder ID; and transmit the personal record to at least one of the cardholder computing device and the second service provider computing device. 14. The system of claim 11, wherein the host computing device is further configured to:
verify the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verify the identity of the second service provider before processing the personal record transaction. 15. The system of claim 11, wherein the host computing device is further configured to transmit a transaction reward message associated with the payment transaction to the cardholder computing device after processing the request to authorize the payment transaction, wherein the transaction reward message includes information regarding at least one of a coupon, discount, rebate, rewards point offer, or product review. 16. The system of claim 11, wherein the host computing device is further configured to cause to be displayed on the cardholder computing device, at least one of a list of personal records stored within the memory and available to be transmitted to the second service provider, a list of personal records generated based on the payment transaction and available to be stored in the memory, and a list of payment accounts associated with the cardholder and available to send payments to the first service provider. 17. The system of claim 11, wherein the host computing device is further configured to prompt the cardholder to instruct the host computing device to store the personal record in the memory. 18. The system of claim 11, wherein the host computing device is further configured to prompt the cardholder to instruct the host computing device to transmit the personal record from the host computing device to at least one of the cardholder computing device and the second service provider computing device. 19. The system of claim 18, wherein the personal record includes at least one of an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. 20. A computer readable medium having computer-executable instructions embodied thereon, wherein, when executed by a host computing device having at least one processor, the computer-executable instructions cause the at least one processor to:
receive a request to authorize a payment transaction initiated by a cardholder, wherein the authorization request includes a cardholder ID and a payment transaction amount; transmit an authorization confirmation message to at least one of a cardholder computing device and a first service provider computing device, the first service provider computing device being associated with a first service provider, the first service provider being associated with the payment transaction; receive a request to process a personal record transaction associated with the payment transaction and a second service provider, the second service provider having a second service provider computing device; and process the personal record transaction including at least one of (i) storing the personal record in a memory, and (ii) transmitting the personal record to at least one of the cardholder computing device and the second service provider computing device, wherein the second service provider is the same as the first service provider or different than the first service provider. 21. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to:
receive the personal record from at least one of the cardholder computing device and the second service provider computing device; associate the personal record with the cardholder ID; and store the personal record in the memory. 22. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to:
retrieve the personal record from the memory based at least in part on the cardholder ID; and transmit the personal record to at least one of the cardholder computing device and the second service provider computing device. 23. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to
verify the identity of the cardholder and the first service provider before transmitting an authorization confirmation message; and verify the identity of the second service provider before processing the personal record transaction. 24. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to prompt the cardholder to instruct the at least one processor to store the personal record in the memory. 25. The computer readable medium of claim 20, wherein the computer-executable instructions further cause the at least one processor to prompt the cardholder to instruct the at least one processor to transmit the personal record from the memory to at least one of the cardholder computing device and the second service provider computing device. 26. The computer readable medium of claim 25, wherein the personal record includes at least one of an identifying document, financial history, insurance history, medical history, educational history, and legal history of the cardholder. | 3,600 |
13,567 | 13,567 | 15,136,118 | 3,675 | A circumferential seal assembly for sealing about a rotatable shaft includes two or more generally arcuate bodies coupleable together to form a generally annular seal disposeable about a shaft outer surface. Each arcuate body has opposing female and male circumferential ends. Each female end includes a recess defined between a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body. Each male end includes a projection extending circumferentially from the remainder of the arcuate body and is sized to be disposeable within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body. Further, the female end inner arm of each arcuate body is disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body. | 1. A circumferential shaft seal assembly for sealing about a shaft rotatable about a central axis, the shaft having an outer circumferential surface, the seal assembly comprising:
at least two generally arcuate bodies coupleable together to form a generally annular seal disposeable about the shaft outer surface, each arcuate body having opposing female and male circumferential ends, each female end including a recess defined at least partially by a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body, each male end including a projection extending circumferentially from the remainder of the arcuate body and sized to be disposeable within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body, the female end inner arm of each arcuate body being disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body; wherein each arcuate body has at least one lift recess extending radially outwardly from the body inner circumferential surface and configured to generate a radially outwardly directed force to bias the arcuate body from the shaft outer surface during rotation of the shaft and the inner arm of each arcuate body female end is configured to generally prevent radially-inward displacement of the male end of the adjacent arcuate body coupled with the arcuate body toward the outer surface of the shaft during rotation. 2. (canceled) 3. The seal assembly as recited in claim 1 wherein each arcuate body has an inner circumferential sealing surface extending between the female and male ends and having a first edge at a free end of the female end inner arm and an opposing second edge spaced circumferentially inwardly from a free end of the male end projection, the second edge of the inner surface of each arcuate body being located substantially adjacent to the first edge of the inner surface of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body so as to form a generally continuous sealing surface of the seal assembly. 4. (canceled) 5. The seal assembly as recited in claim 1 wherein each arcuate body has two, opposing axial side surfaces and at least one slot extending generally axially between the two axial side surfaces and fluidly coupled with the at least one lift recess. 6. The seal assembly as recited in claim 1:
wherein each arcuate body has an outer circumferential surface and a generally annular groove extending radially inwardly from the outer surface and circumferentially between the male and female ends, the groove of each arcuate body being generally circumferentially aligned with the groove of each adjacent arcuate body so as to form a generally continuous annular groove of the seal assembly; and the seal assembly further comprises a generally annular biasing member disposed within the seal assembly continuous groove. 7. The seal assembly as recited in claim 1 wherein the outer arm of each arcuate body female end has a circumferential length that is substantially greater than a circumferential length of the inner arm of the arcuate body female end. 8. The seal assembly as recited in claim 1 wherein one of:
the female end of each arcuate body has a concave surface partially defined by and extending between an inner surface section of the outer arm and an inner surface section of the inner arm and the male end projection of each arcuate body has a convex surface sized to be disposed against the female end concave surface of an adjacent arcuate body; and
the female end inner arm of each arcuate body has an inner surface, the female end outer arm of each arcuate body has an inner surface spaced from and facing generally toward the inner arm inner surface, the two arm inner surfaces at least partially defining the recess, and the male end projection of each arcuate body has two, opposing outer surfaces each disposable against a separate one of the female end arm inner surfaces of an adjacent arcuate body. 9. The seal assembly as recited in claim 1 wherein each seal body is formed of at least one of carbon, carbon graphite, ceramic, a ceramic-carbon mixture, a polymer and a ferrous metal. 10. A circumferential shaft seal assembly for sealing about a shaft rotatable about a central axis, the shaft having an outer circumferential surface extending about the axis, the seal assembly comprising:
a plurality of generally arcuate bodies spaced circumferentially about the shaft axis and coupled together to form a generally annular seal disposed about the shaft outer surface, each arcuate body having opposing female and male circumferential ends and an inner circumferential surface extending between the male and female ends, each female end including a recess defined at least partially by a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body, each male end including a projection extending circumferentially from the remainder of the arcuate body and sized to be disposed within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body, the female end inner arm of each arcuate body being disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body; wherein each arcuate body has at least one lift recess extending radially outwardly from the body inner circumferential surface and configured to generate a radially outwardly directed force to bias the arcuate body from the shaft outer surface during rotation of the shaft and the inner arm of each arcuate body female end is configured to generally prevent radially-inward displacement of the male end of the adjacent arcuate body coupled with the arcuate body toward the outer surface of the shaft during rotation. 11. (canceled) | A circumferential seal assembly for sealing about a rotatable shaft includes two or more generally arcuate bodies coupleable together to form a generally annular seal disposeable about a shaft outer surface. Each arcuate body has opposing female and male circumferential ends. Each female end includes a recess defined between a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body. Each male end includes a projection extending circumferentially from the remainder of the arcuate body and is sized to be disposeable within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body. Further, the female end inner arm of each arcuate body is disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body.1. A circumferential shaft seal assembly for sealing about a shaft rotatable about a central axis, the shaft having an outer circumferential surface, the seal assembly comprising:
at least two generally arcuate bodies coupleable together to form a generally annular seal disposeable about the shaft outer surface, each arcuate body having opposing female and male circumferential ends, each female end including a recess defined at least partially by a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body, each male end including a projection extending circumferentially from the remainder of the arcuate body and sized to be disposeable within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body, the female end inner arm of each arcuate body being disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body; wherein each arcuate body has at least one lift recess extending radially outwardly from the body inner circumferential surface and configured to generate a radially outwardly directed force to bias the arcuate body from the shaft outer surface during rotation of the shaft and the inner arm of each arcuate body female end is configured to generally prevent radially-inward displacement of the male end of the adjacent arcuate body coupled with the arcuate body toward the outer surface of the shaft during rotation. 2. (canceled) 3. The seal assembly as recited in claim 1 wherein each arcuate body has an inner circumferential sealing surface extending between the female and male ends and having a first edge at a free end of the female end inner arm and an opposing second edge spaced circumferentially inwardly from a free end of the male end projection, the second edge of the inner surface of each arcuate body being located substantially adjacent to the first edge of the inner surface of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body so as to form a generally continuous sealing surface of the seal assembly. 4. (canceled) 5. The seal assembly as recited in claim 1 wherein each arcuate body has two, opposing axial side surfaces and at least one slot extending generally axially between the two axial side surfaces and fluidly coupled with the at least one lift recess. 6. The seal assembly as recited in claim 1:
wherein each arcuate body has an outer circumferential surface and a generally annular groove extending radially inwardly from the outer surface and circumferentially between the male and female ends, the groove of each arcuate body being generally circumferentially aligned with the groove of each adjacent arcuate body so as to form a generally continuous annular groove of the seal assembly; and the seal assembly further comprises a generally annular biasing member disposed within the seal assembly continuous groove. 7. The seal assembly as recited in claim 1 wherein the outer arm of each arcuate body female end has a circumferential length that is substantially greater than a circumferential length of the inner arm of the arcuate body female end. 8. The seal assembly as recited in claim 1 wherein one of:
the female end of each arcuate body has a concave surface partially defined by and extending between an inner surface section of the outer arm and an inner surface section of the inner arm and the male end projection of each arcuate body has a convex surface sized to be disposed against the female end concave surface of an adjacent arcuate body; and
the female end inner arm of each arcuate body has an inner surface, the female end outer arm of each arcuate body has an inner surface spaced from and facing generally toward the inner arm inner surface, the two arm inner surfaces at least partially defining the recess, and the male end projection of each arcuate body has two, opposing outer surfaces each disposable against a separate one of the female end arm inner surfaces of an adjacent arcuate body. 9. The seal assembly as recited in claim 1 wherein each seal body is formed of at least one of carbon, carbon graphite, ceramic, a ceramic-carbon mixture, a polymer and a ferrous metal. 10. A circumferential shaft seal assembly for sealing about a shaft rotatable about a central axis, the shaft having an outer circumferential surface extending about the axis, the seal assembly comprising:
a plurality of generally arcuate bodies spaced circumferentially about the shaft axis and coupled together to form a generally annular seal disposed about the shaft outer surface, each arcuate body having opposing female and male circumferential ends and an inner circumferential surface extending between the male and female ends, each female end including a recess defined at least partially by a radially-inner arm and a radially-outer arm each extending generally circumferentially from a remainder of the arcuate body, each male end including a projection extending circumferentially from the remainder of the arcuate body and sized to be disposed within the recess of an adjacent arcuate body to couple the arcuate body with the adjacent arcuate body, the female end inner arm of each arcuate body being disposed radially between the shaft outer surface and at least a portion of the male end projection of the adjacent arcuate body when the arcuate body is coupled with the adjacent arcuate body; wherein each arcuate body has at least one lift recess extending radially outwardly from the body inner circumferential surface and configured to generate a radially outwardly directed force to bias the arcuate body from the shaft outer surface during rotation of the shaft and the inner arm of each arcuate body female end is configured to generally prevent radially-inward displacement of the male end of the adjacent arcuate body coupled with the arcuate body toward the outer surface of the shaft during rotation. 11. (canceled) | 3,600 |
13,568 | 13,568 | 13,579,327 | 3,694 | The present invention relates to an apparatus, method, and computer program product for controlling a recommender system, wherein placement of auxiliary media in relation to at least one content item presented to a user is controlled. A first scheduler ( 111 ) is provided for scheduling the at least one content item based on a user profile obtained from a recommender system. Additionally, a second scheduler ( 118 ) is provided for scheduling placement of the auxiliary media in response to the first scheduler ( 111 ), wherein the second scheduler ( 118 ) is adapted to receive information about a scheduled content from the first scheduler ( 111 ) and to decide which auxiliary media to place into a presentation space based on the received information. | 1. An apparatus for controlling placement of auxiliary media in relation to at least one content item presented to a user, said apparatus comprising:
a) a first scheduler (111) for scheduling said at least one content item based on a user profile obtained from a recommender system; and b) a second scheduler (118) for scheduling placement of said auxiliary media in response to said first scheduler (111), c) wherein said second scheduler (118) is adapted to receive information about a scheduled content from said first scheduler (111) and to decide which auxiliary media to place into a presentation space based on said received information. 2. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to initiate downloading of auxiliary media to be placed in relation to a specific content item and to discard further auxiliary media not to be placed in relation to the specific content item. 3. The apparatus according to claim 1, wherein second scheduler (118) is adapted to map a video advertisement to a predetermined event of a scheduled content and to insert said video advertisement into a content channel as visible programming. 4. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to map a video advertisement to a predetermined event or channel of a scheduled content and to replay said video advertisement before or after said event or channel. 5. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to allocate a priority to items of said auxiliary media based on at least one of targeting information, a prioritization information, a factoring information and a popularity information, wherein said popularity information is determined based on a user rating or by measuring a dropping or watching rate of an item of said auxiliary media. 6. The apparatus according to claim 5, wherein said prioritization information is determined based on at least one of a watching behaviour of a user in a target channel, a coefficient of popularity, an expected click-through rate, and an expected return. 7. The apparatus according to claim 1, wherein said second scheduler (118) is adapted
to store information about the number of placements of an item of said auxiliary media in a content channel and to suppress placement of an item of said auxiliary media if said item has been placed and watched more than a predetermined number of times. 8. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to determine a relevance coefficient which indicates relevance of an item of said auxiliary media, and wherein the item with the highest relevance coefficient is used for placement. 9. The apparatus according to claim 1, wherein said apparatus is adapted to record events of said content items and to create new content channels, and wherein said second scheduler (118) is adapted to determine a location for placement and an item of said auxiliary media that fits in a determined location if placement is allowed. 10. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to control said placement of said auxiliary media based on at least one of content profile information and auxiliary media profile information, obtained from a source of said auxiliary media. 11. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to store first identification information for identifying an item of said auxiliary media and second identification information for identifying a content channel. 12. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to determine a ratio between said auxiliary media and said content items for each content channel, wherein said placement of said auxiliary media is scheduled based on said determined ratio. 13. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to delete an item of said auxiliary media when a predetermined lifecycle has expired, and wherein said second scheduler (118) is adapted to suppress said deletion if said item is marked with a predetermined information indicating that said item is to be kept. 14. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to initiate download of an item of said auxiliary media when said item has been determined as a matching item for placement, and wherein said second scheduler (118) is adapted to delete said item when an expiration time of a matched content item has expired. 15. A method of controlling placement of auxiliary media in relation to at least one content item presented to a user, said method comprising:
a) scheduling said at least one content item in a first scheduler (111) based on a user profile obtained from a recommender system; b) receiving from said first scheduler (111) information about a scheduled content; and c) deciding in a second scheduler (118) based on said received information which auxiliary media to place into a presentation space. 16. A computer program product comprising code stored in a memory for producing the steps of method claim 15 when run on a computer device. | The present invention relates to an apparatus, method, and computer program product for controlling a recommender system, wherein placement of auxiliary media in relation to at least one content item presented to a user is controlled. A first scheduler ( 111 ) is provided for scheduling the at least one content item based on a user profile obtained from a recommender system. Additionally, a second scheduler ( 118 ) is provided for scheduling placement of the auxiliary media in response to the first scheduler ( 111 ), wherein the second scheduler ( 118 ) is adapted to receive information about a scheduled content from the first scheduler ( 111 ) and to decide which auxiliary media to place into a presentation space based on the received information.1. An apparatus for controlling placement of auxiliary media in relation to at least one content item presented to a user, said apparatus comprising:
a) a first scheduler (111) for scheduling said at least one content item based on a user profile obtained from a recommender system; and b) a second scheduler (118) for scheduling placement of said auxiliary media in response to said first scheduler (111), c) wherein said second scheduler (118) is adapted to receive information about a scheduled content from said first scheduler (111) and to decide which auxiliary media to place into a presentation space based on said received information. 2. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to initiate downloading of auxiliary media to be placed in relation to a specific content item and to discard further auxiliary media not to be placed in relation to the specific content item. 3. The apparatus according to claim 1, wherein second scheduler (118) is adapted to map a video advertisement to a predetermined event of a scheduled content and to insert said video advertisement into a content channel as visible programming. 4. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to map a video advertisement to a predetermined event or channel of a scheduled content and to replay said video advertisement before or after said event or channel. 5. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to allocate a priority to items of said auxiliary media based on at least one of targeting information, a prioritization information, a factoring information and a popularity information, wherein said popularity information is determined based on a user rating or by measuring a dropping or watching rate of an item of said auxiliary media. 6. The apparatus according to claim 5, wherein said prioritization information is determined based on at least one of a watching behaviour of a user in a target channel, a coefficient of popularity, an expected click-through rate, and an expected return. 7. The apparatus according to claim 1, wherein said second scheduler (118) is adapted
to store information about the number of placements of an item of said auxiliary media in a content channel and to suppress placement of an item of said auxiliary media if said item has been placed and watched more than a predetermined number of times. 8. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to determine a relevance coefficient which indicates relevance of an item of said auxiliary media, and wherein the item with the highest relevance coefficient is used for placement. 9. The apparatus according to claim 1, wherein said apparatus is adapted to record events of said content items and to create new content channels, and wherein said second scheduler (118) is adapted to determine a location for placement and an item of said auxiliary media that fits in a determined location if placement is allowed. 10. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to control said placement of said auxiliary media based on at least one of content profile information and auxiliary media profile information, obtained from a source of said auxiliary media. 11. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to store first identification information for identifying an item of said auxiliary media and second identification information for identifying a content channel. 12. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to determine a ratio between said auxiliary media and said content items for each content channel, wherein said placement of said auxiliary media is scheduled based on said determined ratio. 13. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to delete an item of said auxiliary media when a predetermined lifecycle has expired, and wherein said second scheduler (118) is adapted to suppress said deletion if said item is marked with a predetermined information indicating that said item is to be kept. 14. The apparatus according to claim 1, wherein said second scheduler (118) is adapted to initiate download of an item of said auxiliary media when said item has been determined as a matching item for placement, and wherein said second scheduler (118) is adapted to delete said item when an expiration time of a matched content item has expired. 15. A method of controlling placement of auxiliary media in relation to at least one content item presented to a user, said method comprising:
a) scheduling said at least one content item in a first scheduler (111) based on a user profile obtained from a recommender system; b) receiving from said first scheduler (111) information about a scheduled content; and c) deciding in a second scheduler (118) based on said received information which auxiliary media to place into a presentation space. 16. A computer program product comprising code stored in a memory for producing the steps of method claim 15 when run on a computer device. | 3,600 |
13,569 | 13,569 | 14,985,931 | 3,686 | Systems and methods for proactively identifying impacts and making recommendations regarding modifications to a drug formulary are provided. In an embodiment, a proposed modification to a formulary is received. One or more data sources are accessed, and an impact of the proposed modification to the formulary is determined based on the one or more data sources. The impact of the proposed modification is then provided to a user prior to implementation of the proposed modification. | 1. A computer-implemented method for identifying impacts of a proposed modification to a formulary, the method comprising, by at least one hardware processor:
receiving a proposed modification to a formulary from a user; in response to receiving the proposed modification to the formulary,
accessing one or more data sources,
determining an impact of the proposed modification to the formulary based on the one or more data sources;
automatically identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification, and
providing the impact of the proposed modification to a user, along with the one or more alternative modifications, prior to implementation of the proposed modification;
receiving either an approval or disapproval of at least one modification to the formulary, from among the proposed modification and one or more alternative modifications, from the user; and, when an approval of at least one modification is received from the user, making the approved at least one modification to the formulary, and initiating a communication to each of a plurality of members of a prescription plan that have been affected by the approved at least one modification to the formulary. 2. The method of claim 1, wherein identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification comprises:
determining an impact of each of a plurality of potential modifications to the formulary; and identifying one or more alternative modifications from the plurality of potential modifications having an impact that is more positive than the impact of the proposed modification to the formulary. 3. The method of claim 2, further comprising identifying one or more optimal modifications from the plurality of potential modifications having a most positive impact. 4. The method of claim 1, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the impact comprises at least one of an increase in rebate amount or decrease in rebate amount. 5. The method of claim 1, wherein the one or more data sources comprise member information, and wherein the impact comprises a number of members affected by the proposed modification. 6. The method of claim 1, wherein the one or more data sources comprise marketplace information, and the method further comprises predicting a shift in market share, resulting from the proposed modification, based on the marketplace information. 7. The method of claim 1, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. 8. The method of claim 1, further comprising, in response to receiving the proposed modification to the formulary:
determining whether the proposed modification is compliant with one or more formulary requirements, wherein the one or more formulary requirements comprise at least one of a contractual requirement, regulatory requirement, and pharmacy benefit management requirement; and, when the proposed modification is not compliant with the one or more formulary requirements, warning the user that the proposed modification is not compliant with the one or more formulary requirements. 9. A system for identifying impacts of a proposed modification to a formulary, the system comprising:
at least one hardware processor; and at least one executable software module that, when executed by the at least one hardware processor,
receives a proposed modification to a formulary from a user,
in response to receiving the proposed modification to the formulary,
accesses one or more data sources,
determines an impact of the proposed modification to the formulary based on the one or more data sources, and
automatically identifies one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification,
provides the impact of the proposed modification to a user, along with the one or more alternative modifications, prior to implementation of the proposed modification,
receives either an approval or disapproval of at least one modification to the formulary, from among the proposed modification and one or more alternative modifications, from the user, and,
when an approval of at least one modification is received from the user, makes the approved at least one modification to the formulary, and initiates a communication to each of a plurality of members of a prescription plan that have been affected by the approved at least one modification to the formulary. 10. The system of claim 9, wherein identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification comprises:
determining an impact of each of a plurality of potential modifications to the formulary; and identifying one or more alternative modifications from the plurality of potential modifications having an impact that is more positive than the impact of the proposed modification to the formulary. 11. The system of claim 10, wherein the at least one executable software module further identifies one or more optimal modifications from the plurality of potential modifications having a most positive impact. 12. The system of claim 9, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the impact comprises at least one of an increase in rebate amount or decrease in rebate amount. 13. The system of claim 9, wherein the one or more data sources comprise member information, and wherein the impact comprises a number of members affected by the proposed modification. 14. The system of claim 9, wherein the one or more data sources comprise marketplace information, and the at least one executable software module further predicts a shift in market share, resulting from the proposed modification, based on the marketplace information. 15. The system of claim 9, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. 16. A computer-implemented method for optimizing a formulary, the method comprising, by at least one hardware processor:
receiving a plurality of criteria, wherein the plurality of criteria are weighted; accessing one or more data sources; identifying a plurality of potential modifications to the formulary; determining one or more impacts of the plurality of potential modifications to the formulary based on the one or more data sources; determining an optimal set of the plurality of potential modifications based on the plurality of criteria, wherein adherence to at least one of the plurality of criteria is given more weight than adherence to at least another one of the plurality of criteria; providing the optimal set of the plurality of potential modifications to a user; receiving either an approval or disapproval of the optimal set of the plurality of potential modifications; and, when an approval of the optimal set of the plurality of potential modifications is received, making each potential modification, from the optimal set of the plurality of potential modifications, to the formulary, and initiating a communication to each of a plurality of members of a prescription plan that have been affected by the optimal set of the plurality of potential modifications. 17. The method of claim 16, wherein determining an optimal set of the plurality of potential modifications comprises determining a subset of the plurality of potential modifications which substantially achieves the plurality of criteria with a most positive impact. 18. The method of claim 16, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the one or more impacts comprise at least one of an increase in rebate amount or decrease in rebate amount. 19. The method of claim 16, wherein the one or more data sources comprise member information, and wherein the one or more impacts comprise a number of members affected by the one or more of the plurality of potential modifications. 20. The method of claim 16, wherein the one or more data sources comprise marketplace information, and the method further comprises predicting a shift in market share, resulting from one or more of the plurality of modifications, based on the marketplace information. 21. The method of claim 16, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. | Systems and methods for proactively identifying impacts and making recommendations regarding modifications to a drug formulary are provided. In an embodiment, a proposed modification to a formulary is received. One or more data sources are accessed, and an impact of the proposed modification to the formulary is determined based on the one or more data sources. The impact of the proposed modification is then provided to a user prior to implementation of the proposed modification.1. A computer-implemented method for identifying impacts of a proposed modification to a formulary, the method comprising, by at least one hardware processor:
receiving a proposed modification to a formulary from a user; in response to receiving the proposed modification to the formulary,
accessing one or more data sources,
determining an impact of the proposed modification to the formulary based on the one or more data sources;
automatically identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification, and
providing the impact of the proposed modification to a user, along with the one or more alternative modifications, prior to implementation of the proposed modification;
receiving either an approval or disapproval of at least one modification to the formulary, from among the proposed modification and one or more alternative modifications, from the user; and, when an approval of at least one modification is received from the user, making the approved at least one modification to the formulary, and initiating a communication to each of a plurality of members of a prescription plan that have been affected by the approved at least one modification to the formulary. 2. The method of claim 1, wherein identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification comprises:
determining an impact of each of a plurality of potential modifications to the formulary; and identifying one or more alternative modifications from the plurality of potential modifications having an impact that is more positive than the impact of the proposed modification to the formulary. 3. The method of claim 2, further comprising identifying one or more optimal modifications from the plurality of potential modifications having a most positive impact. 4. The method of claim 1, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the impact comprises at least one of an increase in rebate amount or decrease in rebate amount. 5. The method of claim 1, wherein the one or more data sources comprise member information, and wherein the impact comprises a number of members affected by the proposed modification. 6. The method of claim 1, wherein the one or more data sources comprise marketplace information, and the method further comprises predicting a shift in market share, resulting from the proposed modification, based on the marketplace information. 7. The method of claim 1, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. 8. The method of claim 1, further comprising, in response to receiving the proposed modification to the formulary:
determining whether the proposed modification is compliant with one or more formulary requirements, wherein the one or more formulary requirements comprise at least one of a contractual requirement, regulatory requirement, and pharmacy benefit management requirement; and, when the proposed modification is not compliant with the one or more formulary requirements, warning the user that the proposed modification is not compliant with the one or more formulary requirements. 9. A system for identifying impacts of a proposed modification to a formulary, the system comprising:
at least one hardware processor; and at least one executable software module that, when executed by the at least one hardware processor,
receives a proposed modification to a formulary from a user,
in response to receiving the proposed modification to the formulary,
accesses one or more data sources,
determines an impact of the proposed modification to the formulary based on the one or more data sources, and
automatically identifies one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification,
provides the impact of the proposed modification to a user, along with the one or more alternative modifications, prior to implementation of the proposed modification,
receives either an approval or disapproval of at least one modification to the formulary, from among the proposed modification and one or more alternative modifications, from the user, and,
when an approval of at least one modification is received from the user, makes the approved at least one modification to the formulary, and initiates a communication to each of a plurality of members of a prescription plan that have been affected by the approved at least one modification to the formulary. 10. The system of claim 9, wherein identifying one or more alternative modifications to the formulary that achieve a same or similar objective as the proposed modification with less impact than the proposed modification comprises:
determining an impact of each of a plurality of potential modifications to the formulary; and identifying one or more alternative modifications from the plurality of potential modifications having an impact that is more positive than the impact of the proposed modification to the formulary. 11. The system of claim 10, wherein the at least one executable software module further identifies one or more optimal modifications from the plurality of potential modifications having a most positive impact. 12. The system of claim 9, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the impact comprises at least one of an increase in rebate amount or decrease in rebate amount. 13. The system of claim 9, wherein the one or more data sources comprise member information, and wherein the impact comprises a number of members affected by the proposed modification. 14. The system of claim 9, wherein the one or more data sources comprise marketplace information, and the at least one executable software module further predicts a shift in market share, resulting from the proposed modification, based on the marketplace information. 15. The system of claim 9, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. 16. A computer-implemented method for optimizing a formulary, the method comprising, by at least one hardware processor:
receiving a plurality of criteria, wherein the plurality of criteria are weighted; accessing one or more data sources; identifying a plurality of potential modifications to the formulary; determining one or more impacts of the plurality of potential modifications to the formulary based on the one or more data sources; determining an optimal set of the plurality of potential modifications based on the plurality of criteria, wherein adherence to at least one of the plurality of criteria is given more weight than adherence to at least another one of the plurality of criteria; providing the optimal set of the plurality of potential modifications to a user; receiving either an approval or disapproval of the optimal set of the plurality of potential modifications; and, when an approval of the optimal set of the plurality of potential modifications is received, making each potential modification, from the optimal set of the plurality of potential modifications, to the formulary, and initiating a communication to each of a plurality of members of a prescription plan that have been affected by the optimal set of the plurality of potential modifications. 17. The method of claim 16, wherein determining an optimal set of the plurality of potential modifications comprises determining a subset of the plurality of potential modifications which substantially achieves the plurality of criteria with a most positive impact. 18. The method of claim 16, wherein the formulary comprises a plurality of drug entries, wherein the one or more data sources comprises rebate information for one or more of the plurality of drug entries, and wherein the one or more impacts comprise at least one of an increase in rebate amount or decrease in rebate amount. 19. The method of claim 16, wherein the one or more data sources comprise member information, and wherein the one or more impacts comprise a number of members affected by the one or more of the plurality of potential modifications. 20. The method of claim 16, wherein the one or more data sources comprise marketplace information, and the method further comprises predicting a shift in market share, resulting from one or more of the plurality of modifications, based on the marketplace information. 21. The method of claim 16, wherein the formulary comprises a plurality of drug entries, arranged in two or more tiers, and one or more utilization management rules. | 3,600 |
13,570 | 13,570 | 12,325,288 | 3,623 | A method and system for generating a business architecture by decomposing an asset based model of the business to a threshold level of decomposition, at which level the decomposition resolves into elemental design elements having asset types which are commercialized by corresponding elemental control structures. At this level of decomposition the elemental design elements and their elemental control structures are reusable in other businesses. This decomposition technique may be applied incrementally to gradually displace legacy systems in the course of developing an asset based architecture for the business. | 1. A method of developing an architecture for a business, comprising:
decomposing an asset based model of the business to a threshold level, the asset based model being comprised of business components, each business component being defined by an asset type of the business and a mechanism for commercializing said asset type to produce a value for the business, where each decomposed asset type and corresponding commercialization mechanism at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding commercialization mechanisms at the threshold level have at least one child in common; associating each asset type and corresponding commercialization mechanism at the threshold of decomposition with an elemental design element from a component business model (CBM) map of an industry within which the business competes. 2. The method of claim 1, wherein said decomposing is accomplished in a series of steps over time, each incremental decomposition being directed to assets and commercialization mechanisms associated with adapting the business to a particular change in a market within which the business competes. 3. The method of claim 2, further comprising, for each step in said series:
decomposing the assets associated with adapting the business to the particular market change to distinct and non-overlapping asset types; and associating each said asset type with a distinct commercialization mechanism, the commercialization mechanism operating on the asset type to produce a result that contributes to adapting the business to said particular market change. 4. The method of claim 3, further comprising, for each step in said series:
confirming from said industry CBM map that each asset type and associated commercialization mechanism corresponds to an elemental design element on said industry CBM map. 5. The method of claim 4, further comprising, for each step in said series:
providing each elemental design element with information systems support for operation of the commercialization mechanism. 6. The method of claim 5, further comprising, for each step in said series:
configuring the adaptation to said particular market change as a collaborative network among the elemental design elements. 7. The method of claim 6, wherein each collaborative network is implemented through services provided and received among the elemental design elements. 8. The method of claim 7, wherein operation of each collaborative network includes movement of assets between elemental design elements. 9. The method of claim 6, wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map. 10. The method of claim 6, wherein the information systems support for at least one of the collaborative networks replaces a legacy information system with information systems aligned to respective elemental design elements and combined through the collaborative network. 11. The method of claim 6, wherein the step of configuring is supported by a computer system providing a display of the industry CBM map with a capability of selecting business components from the industry CBM map and creating a CBM map of the selected components adapted to the business. 12. A system for developing an architecture for a business, comprising:
means for incrementally decomposing an asset based model of the business to a threshold level, the incremental decomposition being directed to assets and corresponding commercialization mechanisms associated with adapting the business to a particular market change, there being one or more elemental design elements encompassing the assets and corresponding commercialization mechanisms, each elemental design element having a stable and persistent commercial role and being defined by an asset type of the business and an elemental control structure for commercializing the asset type to produce a value for the business; means for associating each elemental design element at the threshold of decomposition with a corresponding elemental design element from a component business model (CBM) map of an industry within which the business competes. 13. The system of claim 12, wherein each decomposed asset type and corresponding elemental control structure at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding elemental control structure at the threshold level have at least one child in common. 14. The system of claim 12, further comprising:
means for providing each elemental design element with information systems support for operation of the elemental control structure. 15. The system of claim 14, further comprising:
means for adapting to said particular market change by configuring the elemental design elements and their respective supporting information systems as a collaborative network. 16. The system of claim 15, wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map. 17. The system of claim 15, wherein the information systems supporting the respective elemental design elements, by combination in the collaborative network, displace a legacy information system. 18. A computer implemented system for developing an architecture for a business, comprising:
first computer code for incrementally decomposing an asset based model of the business to a threshold level, the incremental decomposition being directed to assets and corresponding commercialization mechanisms associated with adapting the business to a particular market change, the threshold level defining one or more elemental design elements encompassing the assets and corresponding commercialization mechanisms, each incremental design element being defined by an asset type of the business and an elemental control structure for commercializing the asset type to produce a value for the business; second computer code for associating each elemental design element at the threshold of decomposition with a corresponding elemental design element from a component business model (CBM) map of an industry within which the business competes, wherein each decomposed asset type and corresponding elemental control structure at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding elemental control structure at the threshold level have at least one child in common. 19. The computer implemented system of claim 18, further comprising:
third computer code for providing each elemental design element with information systems support for operation of the elemental control structure; and fourth computer code for adapting to said particular market change by configuring the elemental design elements and their respective supporting information systems as a collaborative network. 20. The computer implemented system of claim 19,
wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map, and wherein the information systems supporting the respective elemental design elements, by combination in the collaborative network, displace a legacy information system. | A method and system for generating a business architecture by decomposing an asset based model of the business to a threshold level of decomposition, at which level the decomposition resolves into elemental design elements having asset types which are commercialized by corresponding elemental control structures. At this level of decomposition the elemental design elements and their elemental control structures are reusable in other businesses. This decomposition technique may be applied incrementally to gradually displace legacy systems in the course of developing an asset based architecture for the business.1. A method of developing an architecture for a business, comprising:
decomposing an asset based model of the business to a threshold level, the asset based model being comprised of business components, each business component being defined by an asset type of the business and a mechanism for commercializing said asset type to produce a value for the business, where each decomposed asset type and corresponding commercialization mechanism at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding commercialization mechanisms at the threshold level have at least one child in common; associating each asset type and corresponding commercialization mechanism at the threshold of decomposition with an elemental design element from a component business model (CBM) map of an industry within which the business competes. 2. The method of claim 1, wherein said decomposing is accomplished in a series of steps over time, each incremental decomposition being directed to assets and commercialization mechanisms associated with adapting the business to a particular change in a market within which the business competes. 3. The method of claim 2, further comprising, for each step in said series:
decomposing the assets associated with adapting the business to the particular market change to distinct and non-overlapping asset types; and associating each said asset type with a distinct commercialization mechanism, the commercialization mechanism operating on the asset type to produce a result that contributes to adapting the business to said particular market change. 4. The method of claim 3, further comprising, for each step in said series:
confirming from said industry CBM map that each asset type and associated commercialization mechanism corresponds to an elemental design element on said industry CBM map. 5. The method of claim 4, further comprising, for each step in said series:
providing each elemental design element with information systems support for operation of the commercialization mechanism. 6. The method of claim 5, further comprising, for each step in said series:
configuring the adaptation to said particular market change as a collaborative network among the elemental design elements. 7. The method of claim 6, wherein each collaborative network is implemented through services provided and received among the elemental design elements. 8. The method of claim 7, wherein operation of each collaborative network includes movement of assets between elemental design elements. 9. The method of claim 6, wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map. 10. The method of claim 6, wherein the information systems support for at least one of the collaborative networks replaces a legacy information system with information systems aligned to respective elemental design elements and combined through the collaborative network. 11. The method of claim 6, wherein the step of configuring is supported by a computer system providing a display of the industry CBM map with a capability of selecting business components from the industry CBM map and creating a CBM map of the selected components adapted to the business. 12. A system for developing an architecture for a business, comprising:
means for incrementally decomposing an asset based model of the business to a threshold level, the incremental decomposition being directed to assets and corresponding commercialization mechanisms associated with adapting the business to a particular market change, there being one or more elemental design elements encompassing the assets and corresponding commercialization mechanisms, each elemental design element having a stable and persistent commercial role and being defined by an asset type of the business and an elemental control structure for commercializing the asset type to produce a value for the business; means for associating each elemental design element at the threshold of decomposition with a corresponding elemental design element from a component business model (CBM) map of an industry within which the business competes. 13. The system of claim 12, wherein each decomposed asset type and corresponding elemental control structure at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding elemental control structure at the threshold level have at least one child in common. 14. The system of claim 12, further comprising:
means for providing each elemental design element with information systems support for operation of the elemental control structure. 15. The system of claim 14, further comprising:
means for adapting to said particular market change by configuring the elemental design elements and their respective supporting information systems as a collaborative network. 16. The system of claim 15, wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map. 17. The system of claim 15, wherein the information systems supporting the respective elemental design elements, by combination in the collaborative network, displace a legacy information system. 18. A computer implemented system for developing an architecture for a business, comprising:
first computer code for incrementally decomposing an asset based model of the business to a threshold level, the incremental decomposition being directed to assets and corresponding commercialization mechanisms associated with adapting the business to a particular market change, the threshold level defining one or more elemental design elements encompassing the assets and corresponding commercialization mechanisms, each incremental design element being defined by an asset type of the business and an elemental control structure for commercializing the asset type to produce a value for the business; second computer code for associating each elemental design element at the threshold of decomposition with a corresponding elemental design element from a component business model (CBM) map of an industry within which the business competes, wherein each decomposed asset type and corresponding elemental control structure at the threshold level and levels above the threshold level has one and only one parent, and at least two decomposed assets and corresponding elemental control structure at the threshold level have at least one child in common. 19. The computer implemented system of claim 18, further comprising:
third computer code for providing each elemental design element with information systems support for operation of the elemental control structure; and fourth computer code for adapting to said particular market change by configuring the elemental design elements and their respective supporting information systems as a collaborative network. 20. The computer implemented system of claim 19,
wherein the information systems support for at least one elemental design element is configured from a template provided on said industry CBM map, and wherein the information systems supporting the respective elemental design elements, by combination in the collaborative network, displace a legacy information system. | 3,600 |
13,571 | 13,571 | 13,462,129 | 3,696 | A method and system for computing a stable index value of fresh water based on water quality category and/or grade from current values of root commodities (i.e. freely marketed products) that either have fresh water as a constituent and/or utilize fresh water in their production, usable to develop a stable investment instrument for investing in fresh water. A processor may process associations between a root commodity and a water quality category of fresh water. A display associated with a computer may display updateable current prices of fresh water of a particular water quality category and/or grade and updateable current prices of one or more root commodities. A water measurement device may measure at least one water source of fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio and compare against standards to categorize the fresh water. | 1. A method for investing in fresh water based on a quality of the fresh water, comprising:
a computer processor obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; matching each of at least one water quality category from among domestic, agricultural and industrial water quality categories with said each root commodity of the at least one root commodity, such that a quality of water used in production of a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500 mg/l, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was matched with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was matched with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was matched with said each water quality category. 2. The method of claim 1, further comprising
measuring at least one water source having fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by one or more of (i) water quality category and (ii) water quality grade. 3. The method of claim 1, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular
(i) water quality category including domestic, agricultural and industrial water quality categories, (ii) water quality grade including low, medium and high water quality grades or (iii) water quality category and water quality grade,
the updateable current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 4. The method of claim 1, further comprising displaying on a first portion of a display associated with a computer one or more current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying the at least one root commodity whose current price is displayed on the second portion. 4. (canceled) 5. The method of claim 1, further comprising determining, using a processor, a price of fresh water derived from a particular water source by determining a current level of suitability of fresh water derived from the particular water source for each of the plurality of water quality categories and by combining current index values of the fresh water of each water quality categories by weighting each index value being combined by (i) the determined current level of suitability of the fresh water from the particular water source for each of the plurality of water quality categories and by (ii) a market share of water from each water quality category. 6. A method for investing in fresh water based on a quality of the fresh water, comprising:
(a) using a computer processor obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; (b) matching each of at least one water quality category from among domestic, agricultural and industrial water quality categories with said each root commodity of the at least one root commodity, such that a quality of water that is constituent in a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and (c) determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was matched with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was matched with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was matched with said each water quality category. 7. The method of claim 6, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
the current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 8. The method of claim 6, further comprising displaying on a first portion of a display associated with a computer one or more of the current index values for fresh water and an indicia, identifying either water or a category of fresh water, whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying a root commodity whose current price is displayed on the second portion. 9. A method of using financial instruments to invest in fresh water based of water quality, comprising:
a computer processor; obtaining a price of each of the financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using an index value of fresh water of a particular water quality category, having a computer store water quality standards for at least one water quality category; determining, using a computer processor, current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; associating each water quality category of the at least one water quality category from among domestic, agricultural and industrial water quality categories with a root commodity of the at least one root commodity, such that a quality of water either (i) constituent in a respective root commodity or (ii) used in production of the respective root commodity, meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, the index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity associated with said each water quality category and (ii) a quantity of water used in production of said each root commodity associated with said each water quality category. 10. The method of claim 9, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
the current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 11. The method of claim 9, further comprising displaying on a first portion of a display associated with a computer at least one of the index values for fresh water, the display also displaying on a second portion of the display a price of at least one root commodity from which the at least one of the index values is derived, the at least one of the index values and the price of the at least one root commodity each being updated over time. 12. The method of claim 9, further comprising the water quality categories having standards specifying ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 13. The method of claim 12, further comprising the water quality categories having standards specifying ranges for TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 14. The method of claim 9, further comprising using a specific body of fresh water as collateral for the amount of fresh water on the face of each of the financial instruments. 15. A system for trading fresh water based on water quality, comprising:
a computer for
obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent and (ii) water utilized in production of the said each root commodity,
storing water quality standards for at least one water quality category,
processing associations between each of at least one water quality category from among domestic, agricultural and industrial water quality categories with at least one root commodity of the at least one root commodity, such that a quality of water used in production of the root commodity meets water quality standards of the respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and
determining a current index value for fresh water of each of the water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 16. The system of claim 15, a display associated with a computer for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 17. The system of claim 15, further comprising a display associated with the computer for displaying one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the display. 18. The system of claim 15, further comprising a display associated with the computer for displaying on a first portion of the display one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the second portion. 19. The system of claim 15, further comprising the at least one water quality category including at least one from (i) a first water quality category for water that meets minimal standards for either drinking or domestic use, (ii) a second water quality category for water that does not meet standards for drinking water but meets minimal standards for agricultural quality water and (iii) a third water quality category for water that does not meet standards for agricultural quality water or drinking water but meets minimal standards for industrial quality water. 20. The system of claim 15, wherein the water quality standards specify ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 21. The system of claim 15, further comprising
a water quality measurement device for measuring fresh water from at least one water source that has fresh water, with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality category. 22. The system of claim 15, further comprising the computer also for determining a price of fresh water that comes from a particular water source by determining a current level of suitability of fresh water derived from the particular water source for each of the at least one water quality category and by combining current index values of the fresh water of each water quality categories by weighting each index value being combined by (i) the determined current level of suitability of the fresh water from the particular water source for each of the at least one water quality category and by (ii) a market share of water from each of the at least one water quality category. 23. A system for trading fresh water based on water quality, comprising:
a computer for
obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in the root commodity and (ii) water utilized in production of the root commodity,
storing water quality standards for at least one water quality category,
determining and storing associations between each of at least one water quality category from among domestic, agricultural and industrial water quality categories of the at least one water quality categories with at least one root commodity, such that a quality of water used to produce or constituent in a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and
determining a current index value for fresh water of each of the water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 24. The system of claim 23, a display associated with a computer for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 25. The system of claim 23, further comprising a display associated with the computer for displaying one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the display. 26. The system of claim 23, wherein the water quality standards specify ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 27. A system for trading fresh water based on water quality, the system comprising:
at least one computer of at least one commodities exchange outputting prices of commodities that are not water, at least one of the commodities being a root commodity that either has fresh water as a constituent or whose production utilizes fresh water; a system computer having a processor, the system computer linked with and configured to receive from the at least one computer of the at least one commodities exchange updateable price data for the commodities, the system computer configured to identify root commodities and extract, from the updateable price data, the current price for said identified root commodities, the processor also configured to
store water quality standards for at least one water quality category,
associate each water quality category of the at least one water quality categories from among domestic, agricultural and industrial water quality categories with at least one said identified root commodity, such that a quality of water used in production of a respective identified root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100,
compute, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the current index value determined based on a current price of said each identified root commodity associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each identified root commodity associated with said each water quality category and (ii) a quantity of water used in production of said each identified root commodity associated with said each water quality category,
the system computer configured to transmit the computed current index value of each water quality category to the at least one computer. 28. The system of claim 27, further comprising a display associated with the at least one computer, the display displaying at least one current index value for fresh water of a water quality category and displaying a price of at least one identified root commodity from which the at least one current index value for fresh water is derived, the displayed at least one current index value for fresh water being updated over time and the displayed price of the at least one identified root commodity being updated over time. 29. The system of claim 27, further comprising a display associated with the at least one computer, the display displaying at least one current index value for fresh water of a water quality category in a first portion of the display and displaying a price of at least one identified root commodity from which the at least one current index value for fresh water is derived on a second portion of the display, the displayed at least one current index value for fresh water being updated over time and the displayed price of the at least one identified root commodity being updated over time. 30. The system of claim 27, further comprising a computer processor for determining a price of each of a plurality of financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using the current index value of fresh water for one water quality category. 31. A method for investing in fresh water based on a quality of the fresh water, comprising:
(a) a computer processor obtaining current prices of at least one root commodity, root commodities being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; (b) associating each of at least one water quality category with at least one root commodity of the at least one root commodity, the at least one water quality category defined by falling within a range with regard to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio; and (c) determining, using a computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was associated with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was associated with said each water quality category. 32. The method of claim 31, further comprising displaying on a display associated with a computer one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the display, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each root commodity of the at least one root commodity whose current price is displayed. 33. The method of claim 31, further comprising displaying on a first portion of a display associated with a computer one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each root commodity of the at least one root commodity whose current price is displayed on the second portion. 34. The method of claim 31, further comprising using a processor to adjust a price of pristine water based on a suitability of the pristine water for at least one of (i) drinking, (ii) agricultural use and (iii) industrial use. 35. The method of claim 31, further comprising using a processor to adjust a price of non-pristine water based on a suitability of the non-pristine water for at least one of (i) drinking, (ii) agricultural use and (iii) industrial use. 36. The method of claim 31, further comprising determining, using a computer processor, a price of each of a plurality of financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using the current index value of fresh water for one water quality category. 37. The method of claim 31, further comprising
measuring at least one water source that has fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality category. 38. The method of claim 31, further comprising
measuring the at least one water source with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality grade within a water quality category of the fresh water of the at least one water source. 39. A system for trading fresh water based on water quality, comprising:
a water quality measuring device for measuring fresh water of at least one water source with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio; a computer for receiving data from the water quality measuring device with respect to the fresh water in regard to the at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio and for comparing the received data to stored water quality standards to determine a water quality category for the fresh water, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, obtaining current prices of at least one root commodity, each root commodity being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in the root commodity and (ii) water utilized in production of the root commodity, processing associations between each of at least one water quality category and at least one root commodity, the at least one water quality category defined by an amount present of at least one of TDS, H2CO3, CaCO3, Na, Cl, NO3; and determining a current index value for fresh water of each water quality category of the at least one water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 40. The system of claim 39, further comprising the computer also
for determining a water quality grade, processing associations between each of at least one water quality grade with the at least one root commodity, and determining a current index value for fresh water of each water quality grade based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality grade and (ii) a quantity of water used in production of the root commodity. 41. The system of claim 40, further comprising a display associated with the computer, the display for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 42. The system of claim 41, wherein the updateable current price of one or more root commodities and the updateable current price of fresh water of a particular
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
are situated in different portions of the display. 43. A method for investing in fresh water based on a quality of the fresh water, comprising:
a computer processor obtaining current prices of at least one root commodity, root commodities being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; associating at least one water quality category with at least one root commodity, the at least one water quality category defined by an amount present of at least two of TDS, H2CO3, CaCO3, Na, Cl, NO3; and determining, using a computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of the at least one root commodity that was associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said at least one root commodity that was associated with said each water quality category and (ii) a quantity of water used in production of said at least one root commodity that was associated with said each water quality category. 44. The method of claim 3, further comprising, updating over time and making accessible to the public a displayed at least one of the current index values and updating over time and making available to the public a displayed current price of the at least one root commodity. | A method and system for computing a stable index value of fresh water based on water quality category and/or grade from current values of root commodities (i.e. freely marketed products) that either have fresh water as a constituent and/or utilize fresh water in their production, usable to develop a stable investment instrument for investing in fresh water. A processor may process associations between a root commodity and a water quality category of fresh water. A display associated with a computer may display updateable current prices of fresh water of a particular water quality category and/or grade and updateable current prices of one or more root commodities. A water measurement device may measure at least one water source of fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio and compare against standards to categorize the fresh water.1. A method for investing in fresh water based on a quality of the fresh water, comprising:
a computer processor obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; matching each of at least one water quality category from among domestic, agricultural and industrial water quality categories with said each root commodity of the at least one root commodity, such that a quality of water used in production of a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500 mg/l, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was matched with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was matched with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was matched with said each water quality category. 2. The method of claim 1, further comprising
measuring at least one water source having fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by one or more of (i) water quality category and (ii) water quality grade. 3. The method of claim 1, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular
(i) water quality category including domestic, agricultural and industrial water quality categories, (ii) water quality grade including low, medium and high water quality grades or (iii) water quality category and water quality grade,
the updateable current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 4. The method of claim 1, further comprising displaying on a first portion of a display associated with a computer one or more current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying the at least one root commodity whose current price is displayed on the second portion. 4. (canceled) 5. The method of claim 1, further comprising determining, using a processor, a price of fresh water derived from a particular water source by determining a current level of suitability of fresh water derived from the particular water source for each of the plurality of water quality categories and by combining current index values of the fresh water of each water quality categories by weighting each index value being combined by (i) the determined current level of suitability of the fresh water from the particular water source for each of the plurality of water quality categories and by (ii) a market share of water from each water quality category. 6. A method for investing in fresh water based on a quality of the fresh water, comprising:
(a) using a computer processor obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; (b) matching each of at least one water quality category from among domestic, agricultural and industrial water quality categories with said each root commodity of the at least one root commodity, such that a quality of water that is constituent in a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and (c) determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was matched with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was matched with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was matched with said each water quality category. 7. The method of claim 6, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
the current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 8. The method of claim 6, further comprising displaying on a first portion of a display associated with a computer one or more of the current index values for fresh water and an indicia, identifying either water or a category of fresh water, whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying a root commodity whose current price is displayed on the second portion. 9. A method of using financial instruments to invest in fresh water based of water quality, comprising:
a computer processor; obtaining a price of each of the financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using an index value of fresh water of a particular water quality category, having a computer store water quality standards for at least one water quality category; determining, using a computer processor, current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; associating each water quality category of the at least one water quality category from among domestic, agricultural and industrial water quality categories with a root commodity of the at least one root commodity, such that a quality of water either (i) constituent in a respective root commodity or (ii) used in production of the respective root commodity, meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; determining, using a further computer processor, the further computer processor being either the computer processor or another computer processor, for each water quality category of the at least one water quality category, the index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity associated with said each water quality category and (ii) a quantity of water used in production of said each root commodity associated with said each water quality category. 10. The method of claim 9, further comprising displaying on a display associated with a computer an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
the current price of the fresh water of the particular water quality being dependent on the current price of the one or more root commodities. 11. The method of claim 9, further comprising displaying on a first portion of a display associated with a computer at least one of the index values for fresh water, the display also displaying on a second portion of the display a price of at least one root commodity from which the at least one of the index values is derived, the at least one of the index values and the price of the at least one root commodity each being updated over time. 12. The method of claim 9, further comprising the water quality categories having standards specifying ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 13. The method of claim 12, further comprising the water quality categories having standards specifying ranges for TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 14. The method of claim 9, further comprising using a specific body of fresh water as collateral for the amount of fresh water on the face of each of the financial instruments. 15. A system for trading fresh water based on water quality, comprising:
a computer for
obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent and (ii) water utilized in production of the said each root commodity,
storing water quality standards for at least one water quality category,
processing associations between each of at least one water quality category from among domestic, agricultural and industrial water quality categories with at least one root commodity of the at least one root commodity, such that a quality of water used in production of the root commodity meets water quality standards of the respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and
determining a current index value for fresh water of each of the water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 16. The system of claim 15, a display associated with a computer for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 17. The system of claim 15, further comprising a display associated with the computer for displaying one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the display. 18. The system of claim 15, further comprising a display associated with the computer for displaying on a first portion of the display one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the second portion. 19. The system of claim 15, further comprising the at least one water quality category including at least one from (i) a first water quality category for water that meets minimal standards for either drinking or domestic use, (ii) a second water quality category for water that does not meet standards for drinking water but meets minimal standards for agricultural quality water and (iii) a third water quality category for water that does not meet standards for agricultural quality water or drinking water but meets minimal standards for industrial quality water. 20. The system of claim 15, wherein the water quality standards specify ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 21. The system of claim 15, further comprising
a water quality measurement device for measuring fresh water from at least one water source that has fresh water, with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality category. 22. The system of claim 15, further comprising the computer also for determining a price of fresh water that comes from a particular water source by determining a current level of suitability of fresh water derived from the particular water source for each of the at least one water quality category and by combining current index values of the fresh water of each water quality categories by weighting each index value being combined by (i) the determined current level of suitability of the fresh water from the particular water source for each of the at least one water quality category and by (ii) a market share of water from each of the at least one water quality category. 23. A system for trading fresh water based on water quality, comprising:
a computer for
obtaining current prices of at least one root commodity other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in the root commodity and (ii) water utilized in production of the root commodity,
storing water quality standards for at least one water quality category,
determining and storing associations between each of at least one water quality category from among domestic, agricultural and industrial water quality categories of the at least one water quality categories with at least one root commodity, such that a quality of water used to produce or constituent in a respective root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100; and
determining a current index value for fresh water of each of the water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 24. The system of claim 23, a display associated with a computer for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 25. The system of claim 23, further comprising a display associated with the computer for displaying one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water for each one of the current index value displayed on the first portion, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each of the at least one root commodity whose current price is displayed on the display. 26. The system of claim 23, wherein the water quality standards specify ranges for at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio. 27. A system for trading fresh water based on water quality, the system comprising:
at least one computer of at least one commodities exchange outputting prices of commodities that are not water, at least one of the commodities being a root commodity that either has fresh water as a constituent or whose production utilizes fresh water; a system computer having a processor, the system computer linked with and configured to receive from the at least one computer of the at least one commodities exchange updateable price data for the commodities, the system computer configured to identify root commodities and extract, from the updateable price data, the current price for said identified root commodities, the processor also configured to
store water quality standards for at least one water quality category,
associate each water quality category of the at least one water quality categories from among domestic, agricultural and industrial water quality categories with at least one said identified root commodity, such that a quality of water used in production of a respective identified root commodity meets water quality standards of a respective water quality category with regard to at least one of TDS, H2CO3, CaCO3, Na, Cl and NO3, wherein the domestic water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<500, H2CO3<500, CaCO3<400, Na<50, Cl<400, NO3<20, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, and wherein the industrial water quality category standards are at least as strict as the following regarding at least one of the following six criteria: TDS<500, H2CO3<500, CaCO3<200, Na<50, Cl<400, NO3<100,
compute, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the current index value determined based on a current price of said each identified root commodity associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each identified root commodity associated with said each water quality category and (ii) a quantity of water used in production of said each identified root commodity associated with said each water quality category,
the system computer configured to transmit the computed current index value of each water quality category to the at least one computer. 28. The system of claim 27, further comprising a display associated with the at least one computer, the display displaying at least one current index value for fresh water of a water quality category and displaying a price of at least one identified root commodity from which the at least one current index value for fresh water is derived, the displayed at least one current index value for fresh water being updated over time and the displayed price of the at least one identified root commodity being updated over time. 29. The system of claim 27, further comprising a display associated with the at least one computer, the display displaying at least one current index value for fresh water of a water quality category in a first portion of the display and displaying a price of at least one identified root commodity from which the at least one current index value for fresh water is derived on a second portion of the display, the displayed at least one current index value for fresh water being updated over time and the displayed price of the at least one identified root commodity being updated over time. 30. The system of claim 27, further comprising a computer processor for determining a price of each of a plurality of financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using the current index value of fresh water for one water quality category. 31. A method for investing in fresh water based on a quality of the fresh water, comprising:
(a) a computer processor obtaining current prices of at least one root commodity, root commodities being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; (b) associating each of at least one water quality category with at least one root commodity of the at least one root commodity, the at least one water quality category defined by falling within a range with regard to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio; and (c) determining, using a computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of said each root commodity that was associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said each root commodity that was associated with said each water quality category and (ii) a quantity of water used in production of said each root commodity that was associated with said each water quality category. 32. The method of claim 31, further comprising displaying on a display associated with a computer one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the display, the display also displaying a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each root commodity of the at least one root commodity whose current price is displayed. 33. The method of claim 31, further comprising displaying on a first portion of a display associated with a computer one or more of the current index values for fresh water and an indicia identifying either water or a category of fresh water whose current index value is displayed on the first portion, the display also displaying on a second portion of the display a current price of at least one root commodity from which the at least one of the current index values is derived and an indicia identifying each root commodity of the at least one root commodity whose current price is displayed on the second portion. 34. The method of claim 31, further comprising using a processor to adjust a price of pristine water based on a suitability of the pristine water for at least one of (i) drinking, (ii) agricultural use and (iii) industrial use. 35. The method of claim 31, further comprising using a processor to adjust a price of non-pristine water based on a suitability of the non-pristine water for at least one of (i) drinking, (ii) agricultural use and (iii) industrial use. 36. The method of claim 31, further comprising determining, using a computer processor, a price of each of a plurality of financial instruments identifying on its face a particular amount of fresh water of a particular water quality category, the price of each financial instrument determined using the current index value of fresh water for one water quality category. 37. The method of claim 31, further comprising
measuring at least one water source that has fresh water with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality category. 38. The method of claim 31, further comprising
measuring the at least one water source with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio to categorize the fresh water of the at least one water source by water quality grade within a water quality category of the fresh water of the at least one water source. 39. A system for trading fresh water based on water quality, comprising:
a water quality measuring device for measuring fresh water of at least one water source with respect to at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio; a computer for receiving data from the water quality measuring device with respect to the fresh water in regard to the at least one of TDS, carbonate content, pH, hardness, sodium, chloride, nitrate, toxins and sodium adsorption ratio and for comparing the received data to stored water quality standards to determine a water quality category for the fresh water, wherein the agricultural water quality category standards are at least as strict as the following regarding at least one of the following six criteria measured in mg/liter: TDS<2000, H2CO3<500, CaCO3<2000, Na<800, Cl<800, NO3<50, obtaining current prices of at least one root commodity, each root commodity being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in the root commodity and (ii) water utilized in production of the root commodity, processing associations between each of at least one water quality category and at least one root commodity, the at least one water quality category defined by an amount present of at least one of TDS, H2CO3, CaCO3, Na, Cl, NO3; and determining a current index value for fresh water of each water quality category of the at least one water quality categories based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality category and (ii) a quantity of water used in production of the root commodity. 40. The system of claim 39, further comprising the computer also
for determining a water quality grade, processing associations between each of at least one water quality grade with the at least one root commodity, and determining a current index value for fresh water of each water quality grade based on a current price of said each root commodity and based on at least one of (i) a quantity of fresh water constituent in the root commodity associated with said each water quality grade and (ii) a quantity of water used in production of the root commodity. 41. The system of claim 40, further comprising a display associated with the computer, the display for displaying an updateable current price of one or more root commodities and an updateable current price of fresh water of a particular water quality selected from
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
such that the current price of the fresh water of the particular water quality is dependent on the current price of the one or more root commodities. 42. The system of claim 41, wherein the updateable current price of one or more root commodities and the updateable current price of fresh water of a particular
(i) water quality category, (ii) water quality grade or (iii) water quality category and water quality grade,
are situated in different portions of the display. 43. A method for investing in fresh water based on a quality of the fresh water, comprising:
a computer processor obtaining current prices of at least one root commodity, root commodities being other than water, each root commodity of the at least one root commodity having at least one of (i) water as a constituent in said each root commodity and (ii) water utilized in production of said each root commodity; associating at least one water quality category with at least one root commodity, the at least one water quality category defined by an amount present of at least two of TDS, H2CO3, CaCO3, Na, Cl, NO3; and determining, using a computer processor, for each water quality category of the at least one water quality category, a current index value for fresh water meeting said each water quality category, the index value determined based on a current price of the at least one root commodity that was associated with said each water quality category and based on at least one of (i) a quantity of fresh water constituent in said at least one root commodity that was associated with said each water quality category and (ii) a quantity of water used in production of said at least one root commodity that was associated with said each water quality category. 44. The method of claim 3, further comprising, updating over time and making accessible to the public a displayed at least one of the current index values and updating over time and making available to the public a displayed current price of the at least one root commodity. | 3,600 |
13,572 | 13,572 | 14,822,498 | 3,628 | A system performs a method for processing travel reservations. The method includes receiving an indication of a hotel reservation made by an employee of a company. The method also includes determining whether the hotel reservation complies with a travel policy of the company. The method further includes determining whether the hotel reservation meets an exception to the travel policy. The method still further includes determining whether the hotel reservation is cancelable. In addition, the method includes, upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee. | 1. A method by at least one processor, the method comprising:
receiving an indication of a hotel reservation made by an employee of a company; determining whether the hotel reservation complies with a travel policy of the company; determining whether the hotel reservation meets an exception to the travel policy; determining whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee. 2. The method of claim 1, wherein receiving an indication of a hotel reservation comprises receiving, by an email server, an email sent to the employee's work email address that includes hotel reservation information. 3. The method of claim 1, wherein determining whether the hotel reservation complies with a travel policy of the company comprises at least one of:
determining whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determining whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 4. The method of claim 1, wherein determining whether the hotel reservation meets an exception to the travel policy comprises at least one of:
determining whether the hotel reservation is associated with non-business travel; or determining whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 5. The method of claim 1, wherein determining whether the hotel reservation is cancelable comprises:
parsing a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpreting the one or more text strings or keywords to determine the cancellation policy. 6. The method of claim 1, wherein determining a list of recommended hotels that are within the travel policy comprises searching a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. 7. The method of claim 6, further comprising:
presenting the list of recommended hotels to the employee; receiving a selection by the employee of a hotel among the list of recommended hotels; and making a second hotel reservation at the selected hotel. 8. A system comprising:
at least one memory; and at least one processor coupled to the at least one memory, the at least one processor configured to: receive an indication of a hotel reservation made by an employee of a company; determine whether the hotel reservation complies with a travel policy of the company; determine whether the hotel reservation meets an exception to the travel policy; determine whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically cancel the hotel reservation or alert the employee so the employee may cancel the hotel reservation, and determine a list of recommended hotels that are within the travel policy for presentation to the employee. 9. The system of claim 8, wherein to receive an indication of a hotel reservation, the at least one processor is configured to receive, an email sent to the employee's work email address that includes hotel reservation information. 10. The system of claim 8, wherein to determine whether the hotel reservation complies with a travel policy of the company, the at least one processor is configured to at least one of:
determine whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determine whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 11. The system of claim 8, wherein to determine whether the hotel reservation meets an exception to the travel policy, the at least one processor is configured to at least one of:
determine whether the hotel reservation is associated with non-business travel; or determine whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 12. The system of claim 8, wherein to determine whether the hotel reservation is cancelable, the at least one processor is configured to:
parse a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpret the one or more text strings or keywords to determine the cancellation policy. 13. The system of claim 8, wherein to determine a list of recommended hotels that are within the travel policy, the at least one processor is configured to search a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. 14. The system of claim 13, wherein the at least one processor is further configured to:
present the list of recommended hotels to the employee; receive a selection by the employee of a hotel among the list of recommended hotels; and make a second hotel reservation at the selected hotel. 15. A non-transitory computer readable medium embodying a computer program, the computer program comprising computer readable program code for:
receiving an indication of a hotel reservation made by an employee of a company; determining whether the hotel reservation complies with a travel policy of the company; determining whether the hotel reservation meets an exception to the travel policy; determining whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee. 16. The non-transitory computer readable medium of claim 15, wherein receiving an indication of a hotel reservation comprises receiving, by an email server, an email sent to the employee's work email address that includes hotel reservation information. 17. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation complies with a travel policy of the company comprises at least one of:
determining whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determining whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 18. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation meets an exception to the travel policy comprises at least one of:
determining whether the hotel reservation is associated with non-business travel; or determining whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 19. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation is cancelable comprises:
parsing a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpreting the one or more text strings or keywords to determine the cancellation policy. 20. The non-transitory computer readable medium of claim 15, wherein determining a list of recommended hotels that are within the travel policy comprises searching a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. | A system performs a method for processing travel reservations. The method includes receiving an indication of a hotel reservation made by an employee of a company. The method also includes determining whether the hotel reservation complies with a travel policy of the company. The method further includes determining whether the hotel reservation meets an exception to the travel policy. The method still further includes determining whether the hotel reservation is cancelable. In addition, the method includes, upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee.1. A method by at least one processor, the method comprising:
receiving an indication of a hotel reservation made by an employee of a company; determining whether the hotel reservation complies with a travel policy of the company; determining whether the hotel reservation meets an exception to the travel policy; determining whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee. 2. The method of claim 1, wherein receiving an indication of a hotel reservation comprises receiving, by an email server, an email sent to the employee's work email address that includes hotel reservation information. 3. The method of claim 1, wherein determining whether the hotel reservation complies with a travel policy of the company comprises at least one of:
determining whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determining whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 4. The method of claim 1, wherein determining whether the hotel reservation meets an exception to the travel policy comprises at least one of:
determining whether the hotel reservation is associated with non-business travel; or determining whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 5. The method of claim 1, wherein determining whether the hotel reservation is cancelable comprises:
parsing a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpreting the one or more text strings or keywords to determine the cancellation policy. 6. The method of claim 1, wherein determining a list of recommended hotels that are within the travel policy comprises searching a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. 7. The method of claim 6, further comprising:
presenting the list of recommended hotels to the employee; receiving a selection by the employee of a hotel among the list of recommended hotels; and making a second hotel reservation at the selected hotel. 8. A system comprising:
at least one memory; and at least one processor coupled to the at least one memory, the at least one processor configured to: receive an indication of a hotel reservation made by an employee of a company; determine whether the hotel reservation complies with a travel policy of the company; determine whether the hotel reservation meets an exception to the travel policy; determine whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically cancel the hotel reservation or alert the employee so the employee may cancel the hotel reservation, and determine a list of recommended hotels that are within the travel policy for presentation to the employee. 9. The system of claim 8, wherein to receive an indication of a hotel reservation, the at least one processor is configured to receive, an email sent to the employee's work email address that includes hotel reservation information. 10. The system of claim 8, wherein to determine whether the hotel reservation complies with a travel policy of the company, the at least one processor is configured to at least one of:
determine whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determine whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 11. The system of claim 8, wherein to determine whether the hotel reservation meets an exception to the travel policy, the at least one processor is configured to at least one of:
determine whether the hotel reservation is associated with non-business travel; or determine whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 12. The system of claim 8, wherein to determine whether the hotel reservation is cancelable, the at least one processor is configured to:
parse a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpret the one or more text strings or keywords to determine the cancellation policy. 13. The system of claim 8, wherein to determine a list of recommended hotels that are within the travel policy, the at least one processor is configured to search a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. 14. The system of claim 13, wherein the at least one processor is further configured to:
present the list of recommended hotels to the employee; receive a selection by the employee of a hotel among the list of recommended hotels; and make a second hotel reservation at the selected hotel. 15. A non-transitory computer readable medium embodying a computer program, the computer program comprising computer readable program code for:
receiving an indication of a hotel reservation made by an employee of a company; determining whether the hotel reservation complies with a travel policy of the company; determining whether the hotel reservation meets an exception to the travel policy; determining whether the hotel reservation is cancelable; and upon a determination that the hotel reservation is cancelable, automatically canceling the hotel reservation or alerting the employee so the employee may cancel the hotel reservation, and determining a list of recommended hotels that are within the travel policy for presentation to the employee. 16. The non-transitory computer readable medium of claim 15, wherein receiving an indication of a hotel reservation comprises receiving, by an email server, an email sent to the employee's work email address that includes hotel reservation information. 17. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation complies with a travel policy of the company comprises at least one of:
determining whether a record of the hotel reservation comprises a flag or text indicating that the reservation complies with the travel policy; or determining whether an email having the record of the hotel reservation was sent from an email address or email domain that is associated with the travel policy. 18. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation meets an exception to the travel policy comprises at least one of:
determining whether the hotel reservation is associated with non-business travel; or determining whether a reserved hotel rate in the hotel reservation is less than or equal to a hotel rate available within the travel policy. 19. The non-transitory computer readable medium of claim 15, wherein determining whether the hotel reservation is cancelable comprises:
parsing a record of the hotel reservation to determine whether the record includes one or more text strings or keywords associated with a cancellation policy; and interpreting the one or more text strings or keywords to determine the cancellation policy. 20. The non-transitory computer readable medium of claim 15, wherein determining a list of recommended hotels that are within the travel policy comprises searching a database of hotels to determine hotels that (i) are within a predetermined geographical distance of the hotel associated with the hotel reservation, and (ii) have availability during a time period associated with the hotel reservation. | 3,600 |
13,573 | 13,573 | 14,097,057 | 3,697 | Methods, systems and computer program products for generating decision and meta rules used for determining which questions to present to a tax preparation application user and determine whether a tax situation or topic is applicable to the user. Decision and meta rule sets are generated for tax topics such that as inputs or answers to questions are received and no generated decision rule can be executed, at least one generated meta rule is execute to invalidate one or more generated decision rules. A next question is selected for presentation to the user based at least in part upon a meta rule involving at least one rule of the subset of potentially executable decision rules. Decision rules, and corresponding questions, are invalidated in response to input and when no decision rule can be executed to reduce user questioning while still making a determination whether a tax situation or topic applies. | 1. A computer-implemented method, comprising:
a computer, programmed according to instructions of a tax return preparation application operable to prepare an electronic tax return, transforming at least one representation of questions pertaining to a tax topic into a first transformed representation of questions; the computer, programmed according to instructions of the tax return preparation application, generating a first rule set based at least in part upon the first transformed representation of questions pertaining to the tax topic, and generating a second rule set and a third rule set based at least in part upon the first rule set; the computer, programmed according to instructions of the tax return preparation application, receiving a first input in response to a first question presented to the user and determining whether any rule of the first rule set can be executed based on the first input; and when no rule of the first rule set can be executed,
the computer, programmed according to instructions of the tax return preparation application, executing at least one rule of the second rule set to invalidate at least one rule of the first rule set resulting in a first subset of the first rule set, and the computer, programmed according to instructions of the tax return preparation application, determining a second question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the first subset,
else executing a rule of the first rule set to determine whether the tax topic applies to the user. 2. The method of claim 1, the first transformed representation comprising a decision table, respective rules of the first rule set being based on respective rows of the decision table. 3. The method of claim 2, a number of rows in the decision table being the same as a number of rules in the first rule set. 4. (canceled) 5. The method of claim 1, wherein the first transformed representation is a decision table that is based at least in part upon a second transformed representation of questions pertaining to the tax return topic, wherein the second transformed representation of questions is transformed into the first representation of questions 6. The method of claim 5, the second transformed representation comprising a directed graph, wherein
a beginning node and intermediate nodes of the directed graph correspond to respective questions, inter-node connections of the directed graph correspond to respective answers to respective questions, and a terminal node of the directed graph indicates whether the tax return topic applies to the user. 7. The method of claim 6, further comprising the computer, programmed according to the tax preparation application, generating the directed graph. 8. The method of claim 7, the directed graph being generated based at least in part upon a third representation of questions pertaining to the tax return topic, wherein the third representation of questions is transformed into the second representation of questions, and wherein the second transformed representation of questions is transformed into the first representation of questions. 9. The method of claim 8, the third representation comprising a flow chart. 10. The method of claim 9, the flow chart comprising a static sequence of questions, wherein the beginning and intermediate nodes of the directed graph are based on respective questions or decisions blocks of the flow chart, and respective connections of the directed graph are based on respective answers to respective questions or decision blocks of the flow chart. 11-12. (canceled) 13. The method of claim 8, the first transformed representation comprising a table, the second transformed representation comprising a directed graph, and the third representation comprising a flow chart. 14. The method of claim 13, wherein a beginning node and intermediate nodes of the directed graph are based on respective questions of the flow chart, inter-node connections of the directed graph are based on respective answers to respective questions of the flow chart, and a terminal node of the directed graph indicates whether the tax return topic applies to the user, respective rows of the table are based on respective paths from the beginning node to the terminal node, and each rule in the first rule set is based on a row in the table. 15. The method of claim 1, wherein each rule of the first rule set is executable to generate a result indicating whether the tax return topic applies to the user. 16. The method of claim 1, each rule of the selected first subset being a rule that is not executed based only upon the first input but that may potentially be executed based at least in part upon the received first input and at least one other input. 17. The method of claim 1, wherein the second rule set and the third rule set do not include any rule that is executable to generate a result indicating whether the tax return topic applies to the user. 18. The method of claim 1, the second rule set comprising a first meta data rule set based at least in part upon the first rule set, and the third rule set comprising a second meta data rule set based at least in part upon the first rule set. 19. The method of claim 18, rules of the first meta rule set being based at least in part upon inverses of respective operands of respective rules of the first rule set. 20. The method of claim 19, further comprising the computer, programmed according to the tax preparation application:
parsing rules of the first rule set to determine respective operands of respective rules of the first rule set; for each operand of each rule of the first rule set, determining an inverse of the operand, wherein each rule of the first meta rule set specifies how at least one rule of the first rule set is invalid based at least in part upon at least one determined inverse. 21. The method of claim 20, each rule of the first meta rule set involving at least one inverse of an operand of at least one rule of the first rule set. 22. The method of claim 18, rules of the second meta rule set indicating which inputs are needed in order for respective rules of the first rule set to be valid and executable. 23. The method of claim 18, rules of the first meta rule set being based at least in part upon inverses of respective operands of respective rules of the first rule set, each rule of the first meta rule set involving at least one inverse of an operand of at least one rule of the first rule set, and rules of the second meta rule set indicating which inputs are needed in order for respective rules of the first rule set to be valid and executable. 24. The method of claim 1, the tax return topic comprising whether the user qualifies for a tax deduction or a tax credit. 25. The method of claim 1, wherein when at least one rule of the first rule set can be executed, further comprising the computer, programmed according to the tax preparation application, executing the at least one rule to determine whether the tax return topic applies to the user. 26. The method of claim 25, further comprising the computer, programmed according to the tax preparation application, executing an action following determination of the result. 27. The method of claim 26, the action comprising
identifying at least one tax form of the electronic tax return pertaining to the tax return topic, and populating the at least one tax form with data of answers based on inputs previously received by the computer. 28. The method of claim 26, the action comprising:
determining a pre-determined sequence of interview screens or questions pertaining to the tax situation to the user; and presenting the pre-determined sequence of interview screens or questions to the user. 29. The method of claim 26, the action comprising notifying the user that a different version of the tax preparation application should be utilized. 30. The method of claim 1, wherein no rule of the first rule set was executed based on the first input resulting in selection of the first subset, the method further comprising the computer, programmed according to the tax preparation application:
receiving a second input in response to the second question and determining whether any rule of the first subset can be executed based on the first input and the second input; and when no rule of the first subset can be executed, the computer executing at least one rule of the second rule set to invalidate at least one rule of the first subset resulting in a second subset of the first rule set, and determining a third question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the second subset, else executing a rule of the first subset to determine whether the tax return topic applies to the user. 31. The method of claim 30, wherein no rule of the first subset was executed based on the first input and the second input resulting in selection of the second subset, the method further comprising the computer, programmed according to the tax preparation application:
receiving a third input in response to the third question and determining whether any rule of the second subset can be executed based on the first input, the second input and the third input; and when no rule of the second subset can be executed, the computer executing at least one rule of the second rule set to invalidate at least one rule of the second subset resulting in a third subset of the first rule set, and determining a fourth question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the third subset, else executing a rule of the second subset to determine whether the tax return topic applies to the user. 32. The method of claim 1, wherein a rule of the first rule set was executed based on the first input resulting in determining whether the tax return topic applies to the user, the method further comprising the computer, programmed according to the tax preparation application:
determining another tax return topic; generating a fourth rule set based at least in part upon a fourth representation of questions pertaining to the other tax return topic; generating a fifth rule set and a sixth rule set based at least in part upon the fourth rule set; receiving a second input in response to a second question presented to the user and determining whether any rule of the fourth rule set can be executed based on the second input; and when no rule of the fourth rule set can be executed, the computer executing at least one rule of the fifth rule set to invalidate at least one rule of the fourth rule set resulting in a subset of the fourth rule set, and determining a third question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the subset of the fourth rule set, else executing a rule of the fourth rule set to determine whether the other tax return topic applies to the user. 33. The method of claim 1, wherein a sequence of questions beginning with the first question followed by the second question is different compared to a pre-determined sequence of questions programmed within the tax preparation application for that tax return topic. 34. The method of claim 1, the first representation comprising a table, respective rules of the first rule set being based on respective rows of the table, and the second representation comprising a directed graph, wherein a beginning node and intermediate nodes of the directed graph correspond to respective questions, inter-node connections correspond to respective answers to respective questions, and a terminal node of the directed graph indicates whether the tax return topic applies to the user, wherein a sequence of questions beginning with the first question followed by the second question is different compared to a pre-determined sequence of questions of a path through the directed graph. 35. The method of claim 34, wherein the sequence beginning with the first question followed by the second question skips or does not include at least one question within the path through the directed graph that includes the first question and the second question. 36. The method of claim 34, the directed graph being generated based at least in part upon a third representation of questions pertaining to the tax return topic comprising a flow chart including a pre-determined sequence of questions, wherein the beginning and intermediate nodes of the directed graph are based on respective questions or decisions blocks of the flow chart, and respective connections of the directed graph are based on respective answers to respective questions or decision blocks of the flow chart, and wherein the sequence beginning with the first question followed by the second question skips or does not include at least question within the path through the directed graph and within the flow chart including the first question and the second question. 37. The method of claim 1, wherein a sequence of questions including the first question and the second question is not a pre-determined sequence. 38-39. (canceled) | Methods, systems and computer program products for generating decision and meta rules used for determining which questions to present to a tax preparation application user and determine whether a tax situation or topic is applicable to the user. Decision and meta rule sets are generated for tax topics such that as inputs or answers to questions are received and no generated decision rule can be executed, at least one generated meta rule is execute to invalidate one or more generated decision rules. A next question is selected for presentation to the user based at least in part upon a meta rule involving at least one rule of the subset of potentially executable decision rules. Decision rules, and corresponding questions, are invalidated in response to input and when no decision rule can be executed to reduce user questioning while still making a determination whether a tax situation or topic applies.1. A computer-implemented method, comprising:
a computer, programmed according to instructions of a tax return preparation application operable to prepare an electronic tax return, transforming at least one representation of questions pertaining to a tax topic into a first transformed representation of questions; the computer, programmed according to instructions of the tax return preparation application, generating a first rule set based at least in part upon the first transformed representation of questions pertaining to the tax topic, and generating a second rule set and a third rule set based at least in part upon the first rule set; the computer, programmed according to instructions of the tax return preparation application, receiving a first input in response to a first question presented to the user and determining whether any rule of the first rule set can be executed based on the first input; and when no rule of the first rule set can be executed,
the computer, programmed according to instructions of the tax return preparation application, executing at least one rule of the second rule set to invalidate at least one rule of the first rule set resulting in a first subset of the first rule set, and the computer, programmed according to instructions of the tax return preparation application, determining a second question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the first subset,
else executing a rule of the first rule set to determine whether the tax topic applies to the user. 2. The method of claim 1, the first transformed representation comprising a decision table, respective rules of the first rule set being based on respective rows of the decision table. 3. The method of claim 2, a number of rows in the decision table being the same as a number of rules in the first rule set. 4. (canceled) 5. The method of claim 1, wherein the first transformed representation is a decision table that is based at least in part upon a second transformed representation of questions pertaining to the tax return topic, wherein the second transformed representation of questions is transformed into the first representation of questions 6. The method of claim 5, the second transformed representation comprising a directed graph, wherein
a beginning node and intermediate nodes of the directed graph correspond to respective questions, inter-node connections of the directed graph correspond to respective answers to respective questions, and a terminal node of the directed graph indicates whether the tax return topic applies to the user. 7. The method of claim 6, further comprising the computer, programmed according to the tax preparation application, generating the directed graph. 8. The method of claim 7, the directed graph being generated based at least in part upon a third representation of questions pertaining to the tax return topic, wherein the third representation of questions is transformed into the second representation of questions, and wherein the second transformed representation of questions is transformed into the first representation of questions. 9. The method of claim 8, the third representation comprising a flow chart. 10. The method of claim 9, the flow chart comprising a static sequence of questions, wherein the beginning and intermediate nodes of the directed graph are based on respective questions or decisions blocks of the flow chart, and respective connections of the directed graph are based on respective answers to respective questions or decision blocks of the flow chart. 11-12. (canceled) 13. The method of claim 8, the first transformed representation comprising a table, the second transformed representation comprising a directed graph, and the third representation comprising a flow chart. 14. The method of claim 13, wherein a beginning node and intermediate nodes of the directed graph are based on respective questions of the flow chart, inter-node connections of the directed graph are based on respective answers to respective questions of the flow chart, and a terminal node of the directed graph indicates whether the tax return topic applies to the user, respective rows of the table are based on respective paths from the beginning node to the terminal node, and each rule in the first rule set is based on a row in the table. 15. The method of claim 1, wherein each rule of the first rule set is executable to generate a result indicating whether the tax return topic applies to the user. 16. The method of claim 1, each rule of the selected first subset being a rule that is not executed based only upon the first input but that may potentially be executed based at least in part upon the received first input and at least one other input. 17. The method of claim 1, wherein the second rule set and the third rule set do not include any rule that is executable to generate a result indicating whether the tax return topic applies to the user. 18. The method of claim 1, the second rule set comprising a first meta data rule set based at least in part upon the first rule set, and the third rule set comprising a second meta data rule set based at least in part upon the first rule set. 19. The method of claim 18, rules of the first meta rule set being based at least in part upon inverses of respective operands of respective rules of the first rule set. 20. The method of claim 19, further comprising the computer, programmed according to the tax preparation application:
parsing rules of the first rule set to determine respective operands of respective rules of the first rule set; for each operand of each rule of the first rule set, determining an inverse of the operand, wherein each rule of the first meta rule set specifies how at least one rule of the first rule set is invalid based at least in part upon at least one determined inverse. 21. The method of claim 20, each rule of the first meta rule set involving at least one inverse of an operand of at least one rule of the first rule set. 22. The method of claim 18, rules of the second meta rule set indicating which inputs are needed in order for respective rules of the first rule set to be valid and executable. 23. The method of claim 18, rules of the first meta rule set being based at least in part upon inverses of respective operands of respective rules of the first rule set, each rule of the first meta rule set involving at least one inverse of an operand of at least one rule of the first rule set, and rules of the second meta rule set indicating which inputs are needed in order for respective rules of the first rule set to be valid and executable. 24. The method of claim 1, the tax return topic comprising whether the user qualifies for a tax deduction or a tax credit. 25. The method of claim 1, wherein when at least one rule of the first rule set can be executed, further comprising the computer, programmed according to the tax preparation application, executing the at least one rule to determine whether the tax return topic applies to the user. 26. The method of claim 25, further comprising the computer, programmed according to the tax preparation application, executing an action following determination of the result. 27. The method of claim 26, the action comprising
identifying at least one tax form of the electronic tax return pertaining to the tax return topic, and populating the at least one tax form with data of answers based on inputs previously received by the computer. 28. The method of claim 26, the action comprising:
determining a pre-determined sequence of interview screens or questions pertaining to the tax situation to the user; and presenting the pre-determined sequence of interview screens or questions to the user. 29. The method of claim 26, the action comprising notifying the user that a different version of the tax preparation application should be utilized. 30. The method of claim 1, wherein no rule of the first rule set was executed based on the first input resulting in selection of the first subset, the method further comprising the computer, programmed according to the tax preparation application:
receiving a second input in response to the second question and determining whether any rule of the first subset can be executed based on the first input and the second input; and when no rule of the first subset can be executed, the computer executing at least one rule of the second rule set to invalidate at least one rule of the first subset resulting in a second subset of the first rule set, and determining a third question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the second subset, else executing a rule of the first subset to determine whether the tax return topic applies to the user. 31. The method of claim 30, wherein no rule of the first subset was executed based on the first input and the second input resulting in selection of the second subset, the method further comprising the computer, programmed according to the tax preparation application:
receiving a third input in response to the third question and determining whether any rule of the second subset can be executed based on the first input, the second input and the third input; and when no rule of the second subset can be executed, the computer executing at least one rule of the second rule set to invalidate at least one rule of the second subset resulting in a third subset of the first rule set, and determining a fourth question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the third subset, else executing a rule of the second subset to determine whether the tax return topic applies to the user. 32. The method of claim 1, wherein a rule of the first rule set was executed based on the first input resulting in determining whether the tax return topic applies to the user, the method further comprising the computer, programmed according to the tax preparation application:
determining another tax return topic; generating a fourth rule set based at least in part upon a fourth representation of questions pertaining to the other tax return topic; generating a fifth rule set and a sixth rule set based at least in part upon the fourth rule set; receiving a second input in response to a second question presented to the user and determining whether any rule of the fourth rule set can be executed based on the second input; and when no rule of the fourth rule set can be executed, the computer executing at least one rule of the fifth rule set to invalidate at least one rule of the fourth rule set resulting in a subset of the fourth rule set, and determining a third question to present to the user based at least in part upon at least one rule of the third rule set involving at least one rule of the subset of the fourth rule set, else executing a rule of the fourth rule set to determine whether the other tax return topic applies to the user. 33. The method of claim 1, wherein a sequence of questions beginning with the first question followed by the second question is different compared to a pre-determined sequence of questions programmed within the tax preparation application for that tax return topic. 34. The method of claim 1, the first representation comprising a table, respective rules of the first rule set being based on respective rows of the table, and the second representation comprising a directed graph, wherein a beginning node and intermediate nodes of the directed graph correspond to respective questions, inter-node connections correspond to respective answers to respective questions, and a terminal node of the directed graph indicates whether the tax return topic applies to the user, wherein a sequence of questions beginning with the first question followed by the second question is different compared to a pre-determined sequence of questions of a path through the directed graph. 35. The method of claim 34, wherein the sequence beginning with the first question followed by the second question skips or does not include at least one question within the path through the directed graph that includes the first question and the second question. 36. The method of claim 34, the directed graph being generated based at least in part upon a third representation of questions pertaining to the tax return topic comprising a flow chart including a pre-determined sequence of questions, wherein the beginning and intermediate nodes of the directed graph are based on respective questions or decisions blocks of the flow chart, and respective connections of the directed graph are based on respective answers to respective questions or decision blocks of the flow chart, and wherein the sequence beginning with the first question followed by the second question skips or does not include at least question within the path through the directed graph and within the flow chart including the first question and the second question. 37. The method of claim 1, wherein a sequence of questions including the first question and the second question is not a pre-determined sequence. 38-39. (canceled) | 3,600 |
13,574 | 13,574 | 13,059,795 | 3,645 | A method for monitoring a fluid carrying conduit by introducing an acoustic pulse into the conduit, and interrogating an optic fibre positioned along the path of said conduit to provide distributed acoustic sensing. By measuring the response at each of a plurality of locations, a conduit condition profile can be derived. A condition profile can be obtained quickly and easily with minimum disruption to the pipeline infrastructure and contained flow. Existing optic fibres running along the path of a pipe can be employed for sensing purposes, allowing relatively long spans of pipeline to be monitored with only limited access to the pipe. | 1. A method for monitoring a fluid carrying conduit comprising:
interrogating an optic fibre positioned along the path of said conduit to provide distributed acoustic sensing; introducing an acoustic pulse into the conduit; measuring by distributed acoustic sensing the response to said acoustic pulse at each of a plurality of discrete longitudinal sensing portions; and deriving from said plurality of measurements a conduit condition profile. 2. A method according to claim 1, comprising deriving one or more further conduit profiles and comparing said profiles to determine a change in conduit characteristics. 3. A method according to claim 2, comprising determining the longitudinal location of a change in conduit characteristics. 4. A method according to claim 1, wherein the amplitude of response to said acoustic pulse is measured. 5. A method according to claim 1, wherein the spectral content of the response to said acoustic pulse is measured. 6. A method according to claim 1, wherein the distributed acoustic fibre is located inside said conduit. 7. A method according to claim 1, wherein the distributed acoustic fibre is located adjacent to said conduit. 8. A method according to claim 1, wherein the spatial resolution of said distributed fibre optic sensor is less than or equal to 25 m. 9. A method according to claim 1, wherein the length of said distributed fibre optic sensor is greater than or equal to 20 km. 10. A method according to claim 1, wherein said pulse is introduced by a dedicated impulser. 11. A method according to claim 1, wherein said pulse is introduced by the passage of a pig through said pipeline. 12. Pipeline monitoring apparatus comprising:
an optic fibre interrogator adapted to interrogate an optic fibre and provide distributed acoustic sensing; an impulser adapted to produce pressure pulses in a fluid contained in a pipeline; and a processor adapted to receive sensed data from said interrogator in response to said pressure pulses and to derive a conduit condition profile from said sensed data. | A method for monitoring a fluid carrying conduit by introducing an acoustic pulse into the conduit, and interrogating an optic fibre positioned along the path of said conduit to provide distributed acoustic sensing. By measuring the response at each of a plurality of locations, a conduit condition profile can be derived. A condition profile can be obtained quickly and easily with minimum disruption to the pipeline infrastructure and contained flow. Existing optic fibres running along the path of a pipe can be employed for sensing purposes, allowing relatively long spans of pipeline to be monitored with only limited access to the pipe.1. A method for monitoring a fluid carrying conduit comprising:
interrogating an optic fibre positioned along the path of said conduit to provide distributed acoustic sensing; introducing an acoustic pulse into the conduit; measuring by distributed acoustic sensing the response to said acoustic pulse at each of a plurality of discrete longitudinal sensing portions; and deriving from said plurality of measurements a conduit condition profile. 2. A method according to claim 1, comprising deriving one or more further conduit profiles and comparing said profiles to determine a change in conduit characteristics. 3. A method according to claim 2, comprising determining the longitudinal location of a change in conduit characteristics. 4. A method according to claim 1, wherein the amplitude of response to said acoustic pulse is measured. 5. A method according to claim 1, wherein the spectral content of the response to said acoustic pulse is measured. 6. A method according to claim 1, wherein the distributed acoustic fibre is located inside said conduit. 7. A method according to claim 1, wherein the distributed acoustic fibre is located adjacent to said conduit. 8. A method according to claim 1, wherein the spatial resolution of said distributed fibre optic sensor is less than or equal to 25 m. 9. A method according to claim 1, wherein the length of said distributed fibre optic sensor is greater than or equal to 20 km. 10. A method according to claim 1, wherein said pulse is introduced by a dedicated impulser. 11. A method according to claim 1, wherein said pulse is introduced by the passage of a pig through said pipeline. 12. Pipeline monitoring apparatus comprising:
an optic fibre interrogator adapted to interrogate an optic fibre and provide distributed acoustic sensing; an impulser adapted to produce pressure pulses in a fluid contained in a pipeline; and a processor adapted to receive sensed data from said interrogator in response to said pressure pulses and to derive a conduit condition profile from said sensed data. | 3,600 |
13,575 | 13,575 | 14,630,342 | 3,622 | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth. | 1. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a system to track deployment of the content comprising:
one or more modules implemented at least partially in hardware to track deployment of content for use as part of a marketing activity, the one or more modules configured to expose functionality configured to:
create the content and associate a usage tracking monitor with the created content;
deploy the created content and associated usage tracking monitor as part of a marketing activity; and
causing output of data for display in a user interface that describes the tracked deployment of the marketing activity and the created content. 2. A system as described in claim 1, wherein the tracked deployment of the market activity describes a number of times the created content is viewed by one or more potential consumers. 3. A system as described in claim 1, wherein the content is an image, sound data, or media. 4. A system as described in claim 1, wherein the output data further comprises metadata describing the creation of the content included as part of the marketing activity. 5. A system as described in claim 1, wherein the output data is performed in real time during deployment of the marketing activity. 6. A system as described in claim 1, wherein the output data includes a badge associated with the content that is indicative of a level of deployment of the content as part of the marketing activity. 7. A system as described in claim 1, wherein the output data includes a badge associated with a user profile of a content creator that is indicative of a level of deployment of content created by the content creator as part of one or more marketing activities. 8. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a method to track deployment of the content comprising:
tracking deployment of a marketing activity and the content included as part of the marketing activity to a plurality of potential consumers, the content having metadata associated therewith describing creation of the content; and exposing data for output in a user interface that describes the tracked deployment of the marketing activity and the metadata describing the creation of the content included as part of the marketing activity. 9. A method as described in claim 8, further comprising aggregating a plurality of the exposed data corresponding to a plurality of said marketing activities, the aggregating indicating similarities of the metadata associated with the creation of the content with deployment of corresponding said marketing activities. 10. A method as described in claim 8, wherein the metadata describes characteristics of a device used to create the content. 11. A method as described in claim 10, wherein the characteristics include device type, flash usage, focal length, aperture value, exposure time, zoom level, digital versus analog zoom, lens type, or device identifier. 12. A method as described in claim 8, wherein the metadata also describes characteristics of the content. 13. A method as described in claim 12, wherein described characteristics of the content include identification of one or more objects in the content or scene classification. 14. A method as described in claim 8, wherein the metadata also describes environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors. 15. A method as described in claim 8, wherein the metadata describes processing performed to edit the content as part of creation of the content. 16. A method as described in claim 15, wherein the metadata describes one or more image processing operations applied to the content, identifies one or more applications used to perform the processing, or identifies processing performed by respective applications. 17. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a system to track deployment of the content comprising:
one or more modules implemented at least partially in hardware to track deployment of content for use as part of marketing activities, the one or more modules configured to expose functionality configured to:
aggregating data describing tracked deployment of a plurality of the marketing activities and content included as part of respective ones of the plurality of marketing activities to a plurality of potential consumers; and
causing output in a user interface that indicates:
similarity of metadata, one to another, that describes creation of the content; and
correspondence of the similar metadata with the tracked deployment of the plurality of marketing activities described by the aggregated data. 18. A system as described in claim 17, wherein the metadata describes characteristics of a device used to create the content. 19. A system as described in claim 17, wherein the metadata describes processing performed to edit the content as part of creation of the content. 20. A system as described in claim 19, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. | Content creation and deployment collaboration techniques are described. In one or more implementations, metadata that describes the creation of the content may be associated with the content. The content may then be provided from a content creation service to a content deployment service for deployment as part of a marketing activity. Deployment data obtained from this tracking may be utilized to support a variety of functionality, such as by content creators to determine which of their content has been successfully employed as part of marketing activities, marketers may also use knowledge of the deployment of the content to choose content to be included in a marketing activity as well as select content creators that are best suited to provide this content, used to configure badges, by retailers and manufacturers, and so forth.1. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a system to track deployment of the content comprising:
one or more modules implemented at least partially in hardware to track deployment of content for use as part of a marketing activity, the one or more modules configured to expose functionality configured to:
create the content and associate a usage tracking monitor with the created content;
deploy the created content and associated usage tracking monitor as part of a marketing activity; and
causing output of data for display in a user interface that describes the tracked deployment of the marketing activity and the created content. 2. A system as described in claim 1, wherein the tracked deployment of the market activity describes a number of times the created content is viewed by one or more potential consumers. 3. A system as described in claim 1, wherein the content is an image, sound data, or media. 4. A system as described in claim 1, wherein the output data further comprises metadata describing the creation of the content included as part of the marketing activity. 5. A system as described in claim 1, wherein the output data is performed in real time during deployment of the marketing activity. 6. A system as described in claim 1, wherein the output data includes a badge associated with the content that is indicative of a level of deployment of the content as part of the marketing activity. 7. A system as described in claim 1, wherein the output data includes a badge associated with a user profile of a content creator that is indicative of a level of deployment of content created by the content creator as part of one or more marketing activities. 8. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a method to track deployment of the content comprising:
tracking deployment of a marketing activity and the content included as part of the marketing activity to a plurality of potential consumers, the content having metadata associated therewith describing creation of the content; and exposing data for output in a user interface that describes the tracked deployment of the marketing activity and the metadata describing the creation of the content included as part of the marketing activity. 9. A method as described in claim 8, further comprising aggregating a plurality of the exposed data corresponding to a plurality of said marketing activities, the aggregating indicating similarities of the metadata associated with the creation of the content with deployment of corresponding said marketing activities. 10. A method as described in claim 8, wherein the metadata describes characteristics of a device used to create the content. 11. A method as described in claim 10, wherein the characteristics include device type, flash usage, focal length, aperture value, exposure time, zoom level, digital versus analog zoom, lens type, or device identifier. 12. A method as described in claim 8, wherein the metadata also describes characteristics of the content. 13. A method as described in claim 12, wherein described characteristics of the content include identification of one or more objects in the content or scene classification. 14. A method as described in claim 8, wherein the metadata also describes environmental conditions of a scene in which the content is captured, the environmental conditions including a scene classification, lighting conditions, or whether the environment is likely indoors or outdoors. 15. A method as described in claim 8, wherein the metadata describes processing performed to edit the content as part of creation of the content. 16. A method as described in claim 15, wherein the metadata describes one or more image processing operations applied to the content, identifies one or more applications used to perform the processing, or identifies processing performed by respective applications. 17. In a digital medium environment for deploying marketing activities, where the deployed marketing activities involve deployment of content as part of the marketing activities, a system to track deployment of the content comprising:
one or more modules implemented at least partially in hardware to track deployment of content for use as part of marketing activities, the one or more modules configured to expose functionality configured to:
aggregating data describing tracked deployment of a plurality of the marketing activities and content included as part of respective ones of the plurality of marketing activities to a plurality of potential consumers; and
causing output in a user interface that indicates:
similarity of metadata, one to another, that describes creation of the content; and
correspondence of the similar metadata with the tracked deployment of the plurality of marketing activities described by the aggregated data. 18. A system as described in claim 17, wherein the metadata describes characteristics of a device used to create the content. 19. A system as described in claim 17, wherein the metadata describes processing performed to edit the content as part of creation of the content. 20. A system as described in claim 19, wherein the metadata describes one or more image processing operations applied to the content or identifies one or more applications used to perform the processing. | 3,600 |
13,576 | 13,576 | 13,768,427 | 3,624 | A method is provided that includes receiving a plan model for a process including a plurality of tasks, and generating a layout including a network diagram that expresses the plan model. The method also includes simulating execution of the plan model, and dynamically updating the network diagram to reflect an actual task duration tracked for each task during the simulation. The network diagram includes along a time-directed axis, a plurality of task nodes that express respective tasks, with each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task. In the updated network diagram, then, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. | 1. A plan executor comprising:
a layout engine configured to receive a plan model for a process including a plurality of tasks to produce respective internal products, and generate a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; and a simulator coupled to the layout engine and configured to simulate execution of the plan model, the simulator being configured to track and communicate to the layout engine, actual task duration of each task during the simulation, the layout engine being configured to dynamically update the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 2. The plan executor of claim 1, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 3. The plan executor of claim 1, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein the simulator is further configured to track and communicate to the layout engine, buffer consumption of each buffer during the simulation, the layout engine being configured to dynamically update the network diagram to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 4. The plan executor of claim 3, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 5. The plan executor of claim 1, wherein the simulator is configured to simulate execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 6. The plan executor of claim 1, wherein the simulator is configured to simulate execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 7. The plan executor of claim 6, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. 8. A method comprising:
receiving a plan model for a process including a plurality of tasks to produce respective internal products; generating a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; simulating execution of the plan model, including tracking actual task duration of each task during the simulation; and dynamically updating the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 9. The method of claim 8, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 10. The method of claim 8, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein tracking actual task duration further includes tracking buffer consumption of each buffer during the simulation, the network diagram being dynamically updated to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 11. The method of claim 10, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 12. The method of claim 8, wherein simulating execution of the plan model includes simulating execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 13. The method of claim 8, wherein simulating execution of the plan model includes simulating execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 14. The method of claim 13, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. 15. A computer-readable storage medium having computer-readable program code portions stored therein that, in response to execution by a processor, cause an apparatus to at least:
receive a plan model for a process including a plurality of tasks to produce respective internal products; generate a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; simulate execution of the plan model, including the apparatus being caused to track actual task duration of each task during the simulation; and dynamically update the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 16. The computer-readable storage medium of claim 15, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 17. The computer-readable storage medium of claim 15, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein the apparatus is further caused to track buffer consumption of each buffer during the simulation, the network diagram being dynamically updated to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 18. The computer-readable storage medium of claim 17, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 19. The computer-readable storage medium of claim 15, wherein the apparatus is caused to simulate execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 20. The computer-readable storage medium of claim 15, wherein the apparatus is caused to simulate execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 21. The computer-readable storage medium of claim 20, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. | A method is provided that includes receiving a plan model for a process including a plurality of tasks, and generating a layout including a network diagram that expresses the plan model. The method also includes simulating execution of the plan model, and dynamically updating the network diagram to reflect an actual task duration tracked for each task during the simulation. The network diagram includes along a time-directed axis, a plurality of task nodes that express respective tasks, with each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task. In the updated network diagram, then, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task.1. A plan executor comprising:
a layout engine configured to receive a plan model for a process including a plurality of tasks to produce respective internal products, and generate a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; and a simulator coupled to the layout engine and configured to simulate execution of the plan model, the simulator being configured to track and communicate to the layout engine, actual task duration of each task during the simulation, the layout engine being configured to dynamically update the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 2. The plan executor of claim 1, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 3. The plan executor of claim 1, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein the simulator is further configured to track and communicate to the layout engine, buffer consumption of each buffer during the simulation, the layout engine being configured to dynamically update the network diagram to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 4. The plan executor of claim 3, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 5. The plan executor of claim 1, wherein the simulator is configured to simulate execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 6. The plan executor of claim 1, wherein the simulator is configured to simulate execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 7. The plan executor of claim 6, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. 8. A method comprising:
receiving a plan model for a process including a plurality of tasks to produce respective internal products; generating a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; simulating execution of the plan model, including tracking actual task duration of each task during the simulation; and dynamically updating the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 9. The method of claim 8, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 10. The method of claim 8, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein tracking actual task duration further includes tracking buffer consumption of each buffer during the simulation, the network diagram being dynamically updated to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 11. The method of claim 10, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 12. The method of claim 8, wherein simulating execution of the plan model includes simulating execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 13. The method of claim 8, wherein simulating execution of the plan model includes simulating execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 14. The method of claim 13, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. 15. A computer-readable storage medium having computer-readable program code portions stored therein that, in response to execution by a processor, cause an apparatus to at least:
receive a plan model for a process including a plurality of tasks to produce respective internal products; generate a layout including a network diagram that expresses the plan model, the network diagram including along a time-directed axis, a plurality of task nodes that express respective tasks of the process, each task node being expressed as a first multi-dimensional shape having an outline with a dimension along the axis sized according to a task duration for a respective task; simulate execution of the plan model, including the apparatus being caused to track actual task duration of each task during the simulation; and dynamically update the network diagram to reflect the actual task duration, wherein in the updated network diagram, each task node further includes a fill in the same first multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the actual task duration of the respective task. 16. The computer-readable storage medium of claim 15, wherein each task node is expressed as a rectangular cuboid having an outline with a length along the axis sized according to the task duration for the respective task, and
wherein each task node further includes a fill in the same rectangular cuboid shape as the respective outline but with a length along the axis sized according to the actual task duration of the respective task, the length of the fill originating coincident with the length of the outline. 17. The computer-readable storage medium of claim 15, wherein the network diagram further includes one or more buffer nodes that express respective buffers for respective one or more chains in which the tasks are arranged, each buffer node being expressed as a second multi-dimensional shape having an outline with a dimension along the axis sized according to a size of a respective buffer,
wherein the apparatus is further caused to track buffer consumption of each buffer during the simulation, the network diagram being dynamically updated to reflect the buffer consumption, and wherein in the updated network diagram, each buffer node further includes a fill in the same second multi-dimensional shape as the respective outline but with a dimension along the axis sized according to the buffer consumption of the respective buffer. 18. The computer-readable storage medium of claim 17, wherein each buffer node is expressed as a sphere having an outline with a diameter along the axis sized according to the size of the respective buffer, and
wherein each buffer node further includes a fill in the same spherical shape as the respective outline but with a diameter along the axis sized according to the buffer consumption of the respective buffer, the center of the fill originating coincident with the center of the outline. 19. The computer-readable storage medium of claim 15, wherein the apparatus is caused to simulate execution of the plan model in a data-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task requires availability of all of its inputs before being initiated. 20. The computer-readable storage medium of claim 15, wherein the apparatus is caused to simulate execution of the plan model in a schedule-driven configuration in which for at least some of the tasks that utilize or require one or more inputs, each task is initiable in accordance with a schedule even if before all of its inputs are available. 21. The computer-readable storage medium of claim 20, wherein the fill includes a first fill that expresses the actual task duration of a task in an instance in which the task is initiated after all of its inputs are available, and
wherein the fill includes a second fill that expresses the actual task duration of a task executed out of sequence before all of its inputs are available, and a third fill that expresses the actual task duration of the task reworked after all of its inputs become available, in an instance in which the task is initiated before all of its inputs are available. | 3,600 |
13,577 | 13,577 | 14,214,305 | 3,696 | A system for generating and utilizing financial trading metrics, comprising: (i) a data-obtaining module configured to obtain raw financial trade data; (ii) a data-normalizing module, operatively connected to the data-obtaining module and configured to convert raw financial-trade data into normalized financial-trade data; and (iii) a metric-generating module, operatively connected to the data-normalizing module and configured to generate financial-trade metrics based on the normalized financial-trade data. | 1. A system for generating and utilizing financial trading metrics, comprising:
a data-obtaining module configured to obtain raw financial trade data; a data-normalizing module, operatively connected to the data-obtaining module and configured to convert the raw financial-trade data into normalized financial-trade data; a metric-generating module, operatively connected to the data-normalizing module and configured to generate financial-trade metrics based on the normalized financial-trade data. 2. The system of claim 1, wherein one of the generated financial-trade metrics comprises effective spread. 3. The system of 1 wherein one of the generated financial-trade metrics generated comprises a realized spread. 4. The system of claim 1, wherein the metric-generating module is configured to generate the financial-trade metrics by calculating a realized spread, and wherein calculating a realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 5. The system of claim 4, wherein the realized spread is calculated relative to a fixed time following a trade. 6. The system of claim 4, wherein the metric-generating module is further configured to:
automatically adjust a quoted spread, based on the realized spread. 7. The system of claim 1, wherein the metric-generating module is further configured to:
generate the financial-trade metrics for one or more discrete lag times. 8. The system of claim 1, wherein the financial-trade metrics comprises the prices available to the trader from a list of liquidity providers at a specific time. 9. The system of claim 1, further comprising an intelligence-generating module operatively connected to the metric-generating module and configured to generate operational intelligence data based on the financial-trade metrics. 10. The system of claim 9, wherein operational intelligence data comprises a report comparing an actual trade with a trade optimized price, across a set of liquidity partners. 11. The system of claim 9, wherein the intelligence-generating module is further configured to:
calculate an actual profit or loss for a trade, wherein the trade has a known execution price; determine an optimum price for the trade within a specified time period; and generate an optimized profit or loss for the trade based on the known execution price and the optimum price. 12. The system of claim 9, further wherein the intelligence-generating module is further configured to:
determine, based on the financial-trade metrics, one or more profit conditions under which profit may arise from acting as an execution intermediary between one or more liquidity providers and one or more traders; and generate a potential profit margin from acting as an execution intermediary between the one or more liquidity providers and the one or more traders, based on the profit conditions and the financial-trade metrics. 13. The system of claim 9, wherein operational intelligence data comprises at least one of:
an actual order-fill ratio; a potential order-fill ratio; and a comparison of the actual order-fill ratio and the potential order-fill ratio. 14. The system of claim 9, wherein operational intelligence data comprises termination likelihood information, wherein the termination likelihood information comprises an estimate of the likelihood that one or more liquidity providers will terminate transactions with the trader, based on the trader's prior trades and the one or more liquidity providers prior termination behavior. 15. The system of claim 9, wherein operational intelligence data comprises a customer flow analysis report. 16. The system of claim 9, wherein operational intelligence data comprises a comparative analysis, wherein the comparative analysis comprises a comparison of the robustness of a single FX market-maker's market to the robustness of a larger FX market. 17. The system of claim 9, wherein operational intelligence data comprises a temporal analysis, wherein the temporal analysis comprises a comparison of the robustness of an FX during two or more different time periods. 18. The system of claim 1, wherein the data-obtaining module is configured to obtain raw data by performing at least one of:
sending an http file listing query to a log server; performing an ETL dump of a reporting database; and executing an http request under programmatic control. 19. A computer-implemented method for calculating realized spreads in financial transactions, comprising the following steps:
obtaining, via one or more processing units, one or more data files comprised of raw financial transaction data converting the raw financial data into normalized financial transaction data; and generating one or more financial-trade metrics from the normalized financial data. 20. The method of claim 19, wherein the one or more financial-trade metrics comprises a realized spread, wherein the realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 21. The method of claim 20, wherein the realized spread is calculated relative to a fixed time following the trade. 22. The method of claim 20, further comprising the steps of:
automatically adjusting a quoted spread based on the realized spread. 23. The method of claim 19, further comprising the steps of:
generating the one or more financial-trade metrics for one or more discrete lag times. 24. The method of claim 19, wherein one of the one or more financial-trade metrics comprises the prices available to the trader from a list of liquidity providers at a specific time. 25. The method of claim 19, wherein the one or more financial-trade metrics comprises effective spread. 26. The method of claim 19, further comprising the step of generating operational intelligence data. 27. The method of claim 26, wherein generating operational intelligence data comprises:
comparing actual trade with trade optimized for price across a different set of liquidity partners. 28. The method of claim 26, wherein generating operational intelligence data comprises:
calculating an actual profit or loss for a trade, wherein the trade has a known execution price; determining an optimum price for the trade within a specified time period; and generating an optimized profit or loss for the trade based on the known execution price and the optimum price. 29. The method of claim 26, wherein generating operational intelligence data comprises:
determining, based on the generated metrics, one or more conditions under which profit may arise from acting as an execution intermediary between one or more liquidity providers and one or more traders; and generating a potential profit margin, based on the generated metrics, from acting as an execution intermediary between the one or more liquidity providers and the one or more traders. 30. The method of claim 26, wherein operational intelligence data comprises at least one of:
an actual order-fill ratio; a potential order-fill ratio; and a comparison of the actual order-fill ratio and the potential order-fill ratio. 31. The method of claim 26, wherein generating operational intelligence data comprises termination likelihood information, wherein the termination likelihood information comprises an estimate of the likelihood one or more of the one or more liquidity providers will terminate transactions with the trader, based on a trader's prior trades and one or liquidity providers prior termination behavior. 32. The method of claim 26, wherein operational intelligence data comprises a customer flow analysis report. 33. The method of claim 26, wherein operational intelligence data comprises a comparative analysis, wherein the comparative analysis comprises a comparison of the robustness of a single FX market-maker's market to the robustness of a larger FX market. 34. The method of claim 26, wherein operational intelligence data comprises a temporal analysis, wherein the temporal analysis comprises a comparison of the robustness of an FX during two or more different time periods.18 35. The method of claim 19, further comprising the steps of checking the data for errors. 36. The method of claim 19, further comprising the steps of:
checking the data for outliers; and at least one of:
discarding the outliers;
flagging the outliers. 37. The method of claim 19, wherein obtaining raw financial-trade data consists of at least one of:
sending an http file listing query to a log server; performing an ETL dump of a reporting database; and executing an http request under programmatic control. 38. A non-transitory computer-readable medium comprising executable instructions that when executed by one or more processing units cause the one or more processing units to carry out a method comprising:
obtaining, via one or more processing units, one or more data files comprised of raw financial transaction data converting the raw financial data into normalized financial transaction data; and generating one or more financial-trade metrics from the normalized financial data. 39. The non-transitory computer-readable medium of claim 37, wherein the one or more financial-trade metrics comprises a realized spread, wherein the realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 40. The non-transitory computer-readable medium of claim 38, wherein the realized spread is calculated relative to a fixed time following the trade. 41. The non-transitory computer-readable medium of claim 37, wherein the method further comprising the step of:
automatically adjusting a quoted spread based on the realized spread. | A system for generating and utilizing financial trading metrics, comprising: (i) a data-obtaining module configured to obtain raw financial trade data; (ii) a data-normalizing module, operatively connected to the data-obtaining module and configured to convert raw financial-trade data into normalized financial-trade data; and (iii) a metric-generating module, operatively connected to the data-normalizing module and configured to generate financial-trade metrics based on the normalized financial-trade data.1. A system for generating and utilizing financial trading metrics, comprising:
a data-obtaining module configured to obtain raw financial trade data; a data-normalizing module, operatively connected to the data-obtaining module and configured to convert the raw financial-trade data into normalized financial-trade data; a metric-generating module, operatively connected to the data-normalizing module and configured to generate financial-trade metrics based on the normalized financial-trade data. 2. The system of claim 1, wherein one of the generated financial-trade metrics comprises effective spread. 3. The system of 1 wherein one of the generated financial-trade metrics generated comprises a realized spread. 4. The system of claim 1, wherein the metric-generating module is configured to generate the financial-trade metrics by calculating a realized spread, and wherein calculating a realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 5. The system of claim 4, wherein the realized spread is calculated relative to a fixed time following a trade. 6. The system of claim 4, wherein the metric-generating module is further configured to:
automatically adjust a quoted spread, based on the realized spread. 7. The system of claim 1, wherein the metric-generating module is further configured to:
generate the financial-trade metrics for one or more discrete lag times. 8. The system of claim 1, wherein the financial-trade metrics comprises the prices available to the trader from a list of liquidity providers at a specific time. 9. The system of claim 1, further comprising an intelligence-generating module operatively connected to the metric-generating module and configured to generate operational intelligence data based on the financial-trade metrics. 10. The system of claim 9, wherein operational intelligence data comprises a report comparing an actual trade with a trade optimized price, across a set of liquidity partners. 11. The system of claim 9, wherein the intelligence-generating module is further configured to:
calculate an actual profit or loss for a trade, wherein the trade has a known execution price; determine an optimum price for the trade within a specified time period; and generate an optimized profit or loss for the trade based on the known execution price and the optimum price. 12. The system of claim 9, further wherein the intelligence-generating module is further configured to:
determine, based on the financial-trade metrics, one or more profit conditions under which profit may arise from acting as an execution intermediary between one or more liquidity providers and one or more traders; and generate a potential profit margin from acting as an execution intermediary between the one or more liquidity providers and the one or more traders, based on the profit conditions and the financial-trade metrics. 13. The system of claim 9, wherein operational intelligence data comprises at least one of:
an actual order-fill ratio; a potential order-fill ratio; and a comparison of the actual order-fill ratio and the potential order-fill ratio. 14. The system of claim 9, wherein operational intelligence data comprises termination likelihood information, wherein the termination likelihood information comprises an estimate of the likelihood that one or more liquidity providers will terminate transactions with the trader, based on the trader's prior trades and the one or more liquidity providers prior termination behavior. 15. The system of claim 9, wherein operational intelligence data comprises a customer flow analysis report. 16. The system of claim 9, wherein operational intelligence data comprises a comparative analysis, wherein the comparative analysis comprises a comparison of the robustness of a single FX market-maker's market to the robustness of a larger FX market. 17. The system of claim 9, wherein operational intelligence data comprises a temporal analysis, wherein the temporal analysis comprises a comparison of the robustness of an FX during two or more different time periods. 18. The system of claim 1, wherein the data-obtaining module is configured to obtain raw data by performing at least one of:
sending an http file listing query to a log server; performing an ETL dump of a reporting database; and executing an http request under programmatic control. 19. A computer-implemented method for calculating realized spreads in financial transactions, comprising the following steps:
obtaining, via one or more processing units, one or more data files comprised of raw financial transaction data converting the raw financial data into normalized financial transaction data; and generating one or more financial-trade metrics from the normalized financial data. 20. The method of claim 19, wherein the one or more financial-trade metrics comprises a realized spread, wherein the realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 21. The method of claim 20, wherein the realized spread is calculated relative to a fixed time following the trade. 22. The method of claim 20, further comprising the steps of:
automatically adjusting a quoted spread based on the realized spread. 23. The method of claim 19, further comprising the steps of:
generating the one or more financial-trade metrics for one or more discrete lag times. 24. The method of claim 19, wherein one of the one or more financial-trade metrics comprises the prices available to the trader from a list of liquidity providers at a specific time. 25. The method of claim 19, wherein the one or more financial-trade metrics comprises effective spread. 26. The method of claim 19, further comprising the step of generating operational intelligence data. 27. The method of claim 26, wherein generating operational intelligence data comprises:
comparing actual trade with trade optimized for price across a different set of liquidity partners. 28. The method of claim 26, wherein generating operational intelligence data comprises:
calculating an actual profit or loss for a trade, wherein the trade has a known execution price; determining an optimum price for the trade within a specified time period; and generating an optimized profit or loss for the trade based on the known execution price and the optimum price. 29. The method of claim 26, wherein generating operational intelligence data comprises:
determining, based on the generated metrics, one or more conditions under which profit may arise from acting as an execution intermediary between one or more liquidity providers and one or more traders; and generating a potential profit margin, based on the generated metrics, from acting as an execution intermediary between the one or more liquidity providers and the one or more traders. 30. The method of claim 26, wherein operational intelligence data comprises at least one of:
an actual order-fill ratio; a potential order-fill ratio; and a comparison of the actual order-fill ratio and the potential order-fill ratio. 31. The method of claim 26, wherein generating operational intelligence data comprises termination likelihood information, wherein the termination likelihood information comprises an estimate of the likelihood one or more of the one or more liquidity providers will terminate transactions with the trader, based on a trader's prior trades and one or liquidity providers prior termination behavior. 32. The method of claim 26, wherein operational intelligence data comprises a customer flow analysis report. 33. The method of claim 26, wherein operational intelligence data comprises a comparative analysis, wherein the comparative analysis comprises a comparison of the robustness of a single FX market-maker's market to the robustness of a larger FX market. 34. The method of claim 26, wherein operational intelligence data comprises a temporal analysis, wherein the temporal analysis comprises a comparison of the robustness of an FX during two or more different time periods.18 35. The method of claim 19, further comprising the steps of checking the data for errors. 36. The method of claim 19, further comprising the steps of:
checking the data for outliers; and at least one of:
discarding the outliers;
flagging the outliers. 37. The method of claim 19, wherein obtaining raw financial-trade data consists of at least one of:
sending an http file listing query to a log server; performing an ETL dump of a reporting database; and executing an http request under programmatic control. 38. A non-transitory computer-readable medium comprising executable instructions that when executed by one or more processing units cause the one or more processing units to carry out a method comprising:
obtaining, via one or more processing units, one or more data files comprised of raw financial transaction data converting the raw financial data into normalized financial transaction data; and generating one or more financial-trade metrics from the normalized financial data. 39. The non-transitory computer-readable medium of claim 37, wherein the one or more financial-trade metrics comprises a realized spread, wherein the realized spread comprises at least one of:
subtracting an executed trade price from a forward offer; subtracting a forward bid from the executed trade price; subtracting the forward bid from the executed trade price; subtracting the executed trade price from the forward bid; subtracting the forward offer from the executed trade price; subtracting the executed trade price from a midpoint between a bid and an offer; and subtracting the midpoint between the bid and the offer from the executed trade price. 40. The non-transitory computer-readable medium of claim 38, wherein the realized spread is calculated relative to a fixed time following the trade. 41. The non-transitory computer-readable medium of claim 37, wherein the method further comprising the step of:
automatically adjusting a quoted spread based on the realized spread. | 3,600 |
13,578 | 13,578 | 13,763,458 | 3,674 | A process is provided for recovering hydrocarbons, such as heavy oils, from a subterranean reservoir. The process includes providing a supercritical aqueous fluid at a high temperature and high pressure to the underground hydrocarbon reservoir, injecting the aqueous fluid into the reservoir to heat the hydrocarbons in the reservoir, and recovering the heated hydrocarbons from the reservoir. In some cases, the supercritical fluid is also used to upgrade the hydrocarbons and/or facilitate the transportation of the hydrocarbons from the production field to another location, such as a refinery. | 1. A process for recovering hydrocarbons, comprising:
providing a first aqueous fluid in a supercritical phase at a temperature from 374° C. to 1000° C. and a pressure from 3205 to 10000 psia to an underground hydrocarbon reservoir; injecting the first aqueous fluid into the underground hydrocarbon reservoir to heat the hydrocarbons; and recovering the heated hydrocarbons from the reservoir. 2. A process according to claim 1, wherein the step of injecting the first aqueous fluid comprises delivering the first aqueous fluid through a wall of a wellbore to the hydrocarbon reservoir in the supercritical phase. 3. A process according to claim 1, wherein the first aqueous fluid flashes across a venturi choke from a fluid injector into the underground hydrocarbon reservoir. 4. A process according to claim 6, wherein the first aqueous fluid flashes to at least 70% steam quality. 5. A process according to claim 1, wherein the hydrocarbons are heavy hydrocarbons selected from the group consisting of sandstone, diatomite, shale oil, carbonate heavy petroleum crude oil and tar sand bitumen. 6. A process according to claim 1, wherein the first aqueous fluid is drinking water, treated wastewater, untreated wastewater, river water, lake water, seawater, produced water or their mixtures. 7. A process according to claim 1, further comprising:
mixing a second aqueous fluid with the recovered hydrocarbons at conditions sufficient to upgrade at least a portion of the hydrocarbons. 8. A process according to claim 7, wherein the second aqueous fluid is in the supercritical phase. 9. A process according to claim 7, wherein the step of upgrading comprises reducing the viscosity of at least a portion of the hydrocarbons. 10. A process according to claim 7, wherein the upgrade has a reaction residence time from 8 minutes to 2 hours. 11. A process according to claim 7, wherein the mixing occurs in at least one of a wellbore and a production pipeline. 12. A process according to claim 7, wherein the first aqueous fluid and the second aqueous fluid are generated from a modified oilfield steam generator or modified heat recovery steam generator. 13. A process according to claim 7, wherein the first aqueous fluid and the second aqueous fluid are generated from a 50 MMBTU/HR modified oilfield steam generator. 14. A process according to claim 7, wherein heat is exchanged between the second aqueous stream and the recovered hydrocarbons before mixing. 15. A system for recovering hydrocarbons, the system comprising:
a source for providing a first aqueous fluid; a heater for receiving the first aqueous fluid and heating the first aqueous fluid to a temperature from 374° C. to 1000° C. at a pressure from 3205 to 10000 psia, such that the first aqueous fluid is in a supercritical phase; a delivery system configured to receive the first aqueous fluid from the heater and delivery the first aqueous fluid for injection into an underground hydrocarbon reservoir in the supercritical phase; and a well configured to recover from the reservoir hydrocarbons that have been heated by the first aqueous fluid. 16. A system according to claim 15, further comprising at least one venturi choke disposed in the reservoir and configured to inject the supercritical first aqueous fluid such that the first aqueous fluid flashes across the venturi choke. 17. A system according to claim 15, wherein the source is configured to provide at least one of the groups consisting of drinking water, treated wastewater, untreated wastewater, river water, lake water, seawater, produced water as the first aqueous fluid. 18. A system according to claim 15, wherein the system is configured to mix a second aqueous fluid with the recovered hydrocarbons at conditions sufficient to upgrade at least a portion of the hydrocarbons. 19. A system according to claim 15, wherein the system is configured to provide the second aqueous fluid in a supercritical phase. | A process is provided for recovering hydrocarbons, such as heavy oils, from a subterranean reservoir. The process includes providing a supercritical aqueous fluid at a high temperature and high pressure to the underground hydrocarbon reservoir, injecting the aqueous fluid into the reservoir to heat the hydrocarbons in the reservoir, and recovering the heated hydrocarbons from the reservoir. In some cases, the supercritical fluid is also used to upgrade the hydrocarbons and/or facilitate the transportation of the hydrocarbons from the production field to another location, such as a refinery.1. A process for recovering hydrocarbons, comprising:
providing a first aqueous fluid in a supercritical phase at a temperature from 374° C. to 1000° C. and a pressure from 3205 to 10000 psia to an underground hydrocarbon reservoir; injecting the first aqueous fluid into the underground hydrocarbon reservoir to heat the hydrocarbons; and recovering the heated hydrocarbons from the reservoir. 2. A process according to claim 1, wherein the step of injecting the first aqueous fluid comprises delivering the first aqueous fluid through a wall of a wellbore to the hydrocarbon reservoir in the supercritical phase. 3. A process according to claim 1, wherein the first aqueous fluid flashes across a venturi choke from a fluid injector into the underground hydrocarbon reservoir. 4. A process according to claim 6, wherein the first aqueous fluid flashes to at least 70% steam quality. 5. A process according to claim 1, wherein the hydrocarbons are heavy hydrocarbons selected from the group consisting of sandstone, diatomite, shale oil, carbonate heavy petroleum crude oil and tar sand bitumen. 6. A process according to claim 1, wherein the first aqueous fluid is drinking water, treated wastewater, untreated wastewater, river water, lake water, seawater, produced water or their mixtures. 7. A process according to claim 1, further comprising:
mixing a second aqueous fluid with the recovered hydrocarbons at conditions sufficient to upgrade at least a portion of the hydrocarbons. 8. A process according to claim 7, wherein the second aqueous fluid is in the supercritical phase. 9. A process according to claim 7, wherein the step of upgrading comprises reducing the viscosity of at least a portion of the hydrocarbons. 10. A process according to claim 7, wherein the upgrade has a reaction residence time from 8 minutes to 2 hours. 11. A process according to claim 7, wherein the mixing occurs in at least one of a wellbore and a production pipeline. 12. A process according to claim 7, wherein the first aqueous fluid and the second aqueous fluid are generated from a modified oilfield steam generator or modified heat recovery steam generator. 13. A process according to claim 7, wherein the first aqueous fluid and the second aqueous fluid are generated from a 50 MMBTU/HR modified oilfield steam generator. 14. A process according to claim 7, wherein heat is exchanged between the second aqueous stream and the recovered hydrocarbons before mixing. 15. A system for recovering hydrocarbons, the system comprising:
a source for providing a first aqueous fluid; a heater for receiving the first aqueous fluid and heating the first aqueous fluid to a temperature from 374° C. to 1000° C. at a pressure from 3205 to 10000 psia, such that the first aqueous fluid is in a supercritical phase; a delivery system configured to receive the first aqueous fluid from the heater and delivery the first aqueous fluid for injection into an underground hydrocarbon reservoir in the supercritical phase; and a well configured to recover from the reservoir hydrocarbons that have been heated by the first aqueous fluid. 16. A system according to claim 15, further comprising at least one venturi choke disposed in the reservoir and configured to inject the supercritical first aqueous fluid such that the first aqueous fluid flashes across the venturi choke. 17. A system according to claim 15, wherein the source is configured to provide at least one of the groups consisting of drinking water, treated wastewater, untreated wastewater, river water, lake water, seawater, produced water as the first aqueous fluid. 18. A system according to claim 15, wherein the system is configured to mix a second aqueous fluid with the recovered hydrocarbons at conditions sufficient to upgrade at least a portion of the hydrocarbons. 19. A system according to claim 15, wherein the system is configured to provide the second aqueous fluid in a supercritical phase. | 3,600 |
13,579 | 13,579 | 14,641,435 | 3,649 | The present invention is related to a radiofrequency treatment probe and method delivering radiofrequency for controlled heating of tissue within the vagina for the treatment of vaginal laxity. The treatment probe may include a curved, rounded disposable treatment tip that may be designed to accommodate vaginal anatomy. An electrode assembly may be coupled to the treatment tip, wherein the electrode coupled to the treatment tip may be configured to transfer radiofrequency energy through vaginal skin surface to the tissue. A temperature measuring feature may include or be coupled to the electrode assembly, wherein the electrode assembly may be configured to regulate and maintain a pre-determined skin temperature. A radiofrequency handle may be configured to connect to a disposable treatment tip. A connector may be configured to connect to the radiofrequency handle to a radiofrequency generator. A protective apparatus may be configured to protect the radiofrequency handle. | 1. A treatment probe comprising:
a. a curved, rounded treatment tip designed to accommodate vaginal anatomy; b. an electrode assembly coupled to the treatment tip, wherein the electrode coupled to the treatment tip is configured to transfer radiofrequency energy to specific vaginal structures; c. a temperature measuring feature coupled to the electrode assembly, wherein the temperature measuring feature coupled to the electrode assembly is configured to monitor and regulate electrode and skin temperature; d. a connector configured to connect the treatment tip to a radiofrequency generator. 2. The treatment probe according to claim 1 further comprising a protective apparatus configured to protect the treatment tip. 3. The treatment probe according to claim 1 wherein the treatment tip is connected to the radiofrequency generator by a radiofrequency handle, and wherein the radiofrequency handle is configured to be reusable. 4. The treatment probe according to claim 1 wherein the electrode assembly comprises:
a. a conductive portion;
b. a dielectric portion;
c. a radiofrequency electrode configured to capacitively couple radiofrequency energy with vaginal tissue when at least one of the conductive portion and the dielectric portion is in contact with a skin surface; and
d. a flex circuit electronically coupled to the radiofrequency electrode in which:
i. the conductive portion comprises a plurality of voids; and
ii. the dielectric portion is configured to be positioned between the conductive portion and the skin surface when the radiofrequency electrode is positioned at the skin surface. 5. The treatment probe according to claim 4 wherein the electrode assembly further comprises a back plate and a plurality of electrical contact pads, wherein the back plate is coupled to a support structure, and the plurality of electrical contact pads are coupled to the back plate. 6. The treatment probe according to claim 5 in which the support structure comprises a first engagement member and a second engagement member, and the first and second engagement members are configured to provide engagement and disengagement with a hand-piece support structure. 7. The treatment probe according to claim 1 wherein the temperature measuring feature is configured to be positioned along a back surface of the radiofrequency electrode. 8. The treatment probe according to claim 1 wherein the temperature measuring feature is configured to detect temperature along the back side of the radiofrequency electrode. 9. The treatment probe according to claim 1, further comprising a feedback mechanism configured to integrate a central processing unit to turn off the radiofrequency electrode when temperatures exceed a preset temperature. 10. The treatment probe claim 1, wherein the protective apparatus protecting the reusable treatment handle is a thin disposable cover such as flexible latex, flexible polypropylene or solid PVC or acrylic material. 11. A treatment probe comprising:
a. a curved, rounded disposable treatment tip designed to accommodate vaginal anatomy; b. an electrode assembly coupled to the treatment tip, wherein the electrode coupled to the treatment tip is configured to transfer radiofrequency energy to specific vaginal structures; c. a temperature measuring feature coupled to the electrode assembly, wherein the temperature measuring feature is coupled to the electrode assembly and configured to monitor and regulate electrode and skin temperature; d. a reusable radiofrequency handle configured to connect to the treatment tip; e. a disposable protective apparatus configured to protect the radiofrequency handle; f. a connector configured to connect the radiofrequency handle to a radiofrequency generator source such that the treatment tip is excited by a frequency, a power level, and pattern configured to operate within a vulvovaginal cavity for the purpose of treating vulvovaginal laxity. 12. A method of treating vaginal laxity with a treatment probe, the treatment probe comprising a treatment tip designed to accommodate vaginal anatomy, an electrode assembly coupled to the treatment tip, wherein the electrode assembly is configured to transfer radiofrequency energy to specific vaginal structures, a temperature measuring feature coupled to the electrode assembly, a radiofrequency handle configured to connect to the treatment tip, a connecter configured to connect the radiofrequency handle to a radiofrequency generator, and a protective apparatus configured to protect the radiofrequency handle, the method comprising the steps of:
a. applying the treatment tip along the specific vaginal structure; b. repeating the applying the treatment tip along the specific vaginal structure to achieve a sustained endpoint temperature within the specific vaginal structure; c. generating power with the radiofrequency generator, wherein the power creates an electric field strength that is configured to penetrate the specific vaginal structure through a connective submucosa tissue layer to a layer of loose connective tissue. 13. The method according to claim 12 wherein the specific vaginal structure comprises one or more elements from the following list: majora and labia minora and clitoral hood, perineum, vestibule and deeper vagina. 14. The method according to claim 16 wherein the applying the treatment tip along the specific vaginal structure comprises applying to the labia majora bilaterally from a lowest edge of a mons pubis to a perineal body and laterally to a crural fold to achieve vulvar and perineal temperatures of about 40-45° C. for approximately five minutes or more of total heat time per area. 15. The method according to claim 12 wherein the applying the treatment tip along the specific vaginal structure further comprises treating a mucosal surface of the introitus starting at a hymenal ring and advancing approximately 4-12 centimeters into a vaginal cavity, wherein the vaginal cavity comprises vaginal walls, a vaginal floor, and a vaginal ceiling, and wherein the treating comprises treating the vaginal walls, the vaginal floor, and the vaginal ceiling, which includes the anterior vaginal wall, urethra, and bladder. 16. The method according to claim 15 further comprising moving the treatment probe in a steady-paced manner along the introitus and vaginal cavity to effectively provide a complete vaginal contracture without compromising a urethra. 17. The method according to claim 1 wherein the treatment probe is rounded and curved to provide smooth steady-paced movement, wherein the smooth steady-paced movement is configured to provide improved patient comfort. | The present invention is related to a radiofrequency treatment probe and method delivering radiofrequency for controlled heating of tissue within the vagina for the treatment of vaginal laxity. The treatment probe may include a curved, rounded disposable treatment tip that may be designed to accommodate vaginal anatomy. An electrode assembly may be coupled to the treatment tip, wherein the electrode coupled to the treatment tip may be configured to transfer radiofrequency energy through vaginal skin surface to the tissue. A temperature measuring feature may include or be coupled to the electrode assembly, wherein the electrode assembly may be configured to regulate and maintain a pre-determined skin temperature. A radiofrequency handle may be configured to connect to a disposable treatment tip. A connector may be configured to connect to the radiofrequency handle to a radiofrequency generator. A protective apparatus may be configured to protect the radiofrequency handle.1. A treatment probe comprising:
a. a curved, rounded treatment tip designed to accommodate vaginal anatomy; b. an electrode assembly coupled to the treatment tip, wherein the electrode coupled to the treatment tip is configured to transfer radiofrequency energy to specific vaginal structures; c. a temperature measuring feature coupled to the electrode assembly, wherein the temperature measuring feature coupled to the electrode assembly is configured to monitor and regulate electrode and skin temperature; d. a connector configured to connect the treatment tip to a radiofrequency generator. 2. The treatment probe according to claim 1 further comprising a protective apparatus configured to protect the treatment tip. 3. The treatment probe according to claim 1 wherein the treatment tip is connected to the radiofrequency generator by a radiofrequency handle, and wherein the radiofrequency handle is configured to be reusable. 4. The treatment probe according to claim 1 wherein the electrode assembly comprises:
a. a conductive portion;
b. a dielectric portion;
c. a radiofrequency electrode configured to capacitively couple radiofrequency energy with vaginal tissue when at least one of the conductive portion and the dielectric portion is in contact with a skin surface; and
d. a flex circuit electronically coupled to the radiofrequency electrode in which:
i. the conductive portion comprises a plurality of voids; and
ii. the dielectric portion is configured to be positioned between the conductive portion and the skin surface when the radiofrequency electrode is positioned at the skin surface. 5. The treatment probe according to claim 4 wherein the electrode assembly further comprises a back plate and a plurality of electrical contact pads, wherein the back plate is coupled to a support structure, and the plurality of electrical contact pads are coupled to the back plate. 6. The treatment probe according to claim 5 in which the support structure comprises a first engagement member and a second engagement member, and the first and second engagement members are configured to provide engagement and disengagement with a hand-piece support structure. 7. The treatment probe according to claim 1 wherein the temperature measuring feature is configured to be positioned along a back surface of the radiofrequency electrode. 8. The treatment probe according to claim 1 wherein the temperature measuring feature is configured to detect temperature along the back side of the radiofrequency electrode. 9. The treatment probe according to claim 1, further comprising a feedback mechanism configured to integrate a central processing unit to turn off the radiofrequency electrode when temperatures exceed a preset temperature. 10. The treatment probe claim 1, wherein the protective apparatus protecting the reusable treatment handle is a thin disposable cover such as flexible latex, flexible polypropylene or solid PVC or acrylic material. 11. A treatment probe comprising:
a. a curved, rounded disposable treatment tip designed to accommodate vaginal anatomy; b. an electrode assembly coupled to the treatment tip, wherein the electrode coupled to the treatment tip is configured to transfer radiofrequency energy to specific vaginal structures; c. a temperature measuring feature coupled to the electrode assembly, wherein the temperature measuring feature is coupled to the electrode assembly and configured to monitor and regulate electrode and skin temperature; d. a reusable radiofrequency handle configured to connect to the treatment tip; e. a disposable protective apparatus configured to protect the radiofrequency handle; f. a connector configured to connect the radiofrequency handle to a radiofrequency generator source such that the treatment tip is excited by a frequency, a power level, and pattern configured to operate within a vulvovaginal cavity for the purpose of treating vulvovaginal laxity. 12. A method of treating vaginal laxity with a treatment probe, the treatment probe comprising a treatment tip designed to accommodate vaginal anatomy, an electrode assembly coupled to the treatment tip, wherein the electrode assembly is configured to transfer radiofrequency energy to specific vaginal structures, a temperature measuring feature coupled to the electrode assembly, a radiofrequency handle configured to connect to the treatment tip, a connecter configured to connect the radiofrequency handle to a radiofrequency generator, and a protective apparatus configured to protect the radiofrequency handle, the method comprising the steps of:
a. applying the treatment tip along the specific vaginal structure; b. repeating the applying the treatment tip along the specific vaginal structure to achieve a sustained endpoint temperature within the specific vaginal structure; c. generating power with the radiofrequency generator, wherein the power creates an electric field strength that is configured to penetrate the specific vaginal structure through a connective submucosa tissue layer to a layer of loose connective tissue. 13. The method according to claim 12 wherein the specific vaginal structure comprises one or more elements from the following list: majora and labia minora and clitoral hood, perineum, vestibule and deeper vagina. 14. The method according to claim 16 wherein the applying the treatment tip along the specific vaginal structure comprises applying to the labia majora bilaterally from a lowest edge of a mons pubis to a perineal body and laterally to a crural fold to achieve vulvar and perineal temperatures of about 40-45° C. for approximately five minutes or more of total heat time per area. 15. The method according to claim 12 wherein the applying the treatment tip along the specific vaginal structure further comprises treating a mucosal surface of the introitus starting at a hymenal ring and advancing approximately 4-12 centimeters into a vaginal cavity, wherein the vaginal cavity comprises vaginal walls, a vaginal floor, and a vaginal ceiling, and wherein the treating comprises treating the vaginal walls, the vaginal floor, and the vaginal ceiling, which includes the anterior vaginal wall, urethra, and bladder. 16. The method according to claim 15 further comprising moving the treatment probe in a steady-paced manner along the introitus and vaginal cavity to effectively provide a complete vaginal contracture without compromising a urethra. 17. The method according to claim 1 wherein the treatment probe is rounded and curved to provide smooth steady-paced movement, wherein the smooth steady-paced movement is configured to provide improved patient comfort. | 3,600 |
13,580 | 13,580 | 14,221,233 | 3,688 | Aspects of the disclosure include generation and management of promotional campaigns that can provide a satisfactory performance for a specific amount of resources allocated to the campaigns. In one aspect, at least one of the promotional campaigns can be distributed via media channels that pertain to an organization that administers the promotional campaigns and/or media channels associated with a third-party partner (e.g., a syndication or reseller partner) of such an organization. In another aspect, a promotional campaign can be developed for a predetermined resource allocation, where the promotional campaign can include satisfactory offers that can reach a satisfactory audience at an adequate time via an adequate distribution channel. In order to attain an adequate level of transactions, the promotional campaign can be dynamically restructured based on performance of the campaign across distribution channels available for the predetermined resource allocation. | 1. A method for promotional campaigns, comprising:
accessing promotional intelligence by a computing system having at least one processor functionally coupled to at least one memory device; generating, by the computing system, a plurality of promotional products based on the promotional intelligence; generating, by the computing system, a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign; distributing, by the computing system, the plurality of products according to the distribution allocation; measuring, by the computing system, performance of at least one product of the plurality of promotional products; and generating, by the computing system, an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 2. The method of claim 1, further comprising distributing, by the computing system, the updated distribution allocation of the plurality of products across the plurality of distribution channels. 3. The method of claim 1, wherein the accessing comprises receiving one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period;
promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 4. The method of claim 1, wherein generating the plurality of promotional products based on the promotional intelligence comprises configuring at least one of promotional content or an offer. 5. The method of claim 1, wherein generating the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 6. The method of claim 1, wherein measuring the performance of at least one product of the plurality of promotional products comprises accessing information indicative of audience activity in response to the at least one product. 7. The method of claim 6, wherein measuring the performance of at least one product of the plurality of promotional products further comprises generating one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. 8. A system for promotional campaigns, comprising:
at least one memory device having instructions encoded thereon; and at least one processor functionally coupled to the at least one memory device and configured, by the instructions,
to access promotional intelligence;
to generate a plurality of promotional products based on the promotional intelligence;
to generate a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign;
distribute the plurality of products according to the distribution allocation;
to measure performance of at least one product of the plurality of promotional products; and
to generate an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 9. The system of claim 8, wherein the at least one processor is further configured to distribute the updated distribution allocation of the plurality of products across the plurality of distribution channels. 10. The system of claim 8, wherein the at least one processor is further configured to receive one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period; promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 11. The system of claim 8, wherein the at least one processor is further configured to configure at least one of promotional content or an offer. 12. The system of claim 8, wherein the at least one processor is further configured to generate the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 13. The system of claim 8, wherein the at least one processor is further configured to access information indicative of audience activity in response to the at least one product. 14. The system of claim 13, wherein the at least one processor is further configured to generate one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. 15. At least one non-transitory storage medium having instructions for promotional campaigns encoded thereon that, in response to execution, cause at least one computing system having at least one processor functionally coupled to at least one memory device to perform operations comprising:
accessing promotional intelligence; generating a plurality of promotional products based on the promotional intelligence; generating a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign; distributing the plurality of products according to the distribution allocation; measuring performance of at least one product of the plurality of promotional products; and generating an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 16. The at least one non-transitory storage medium of claim 15, wherein the operations further comprise distributing the updated distribution allocation of the plurality of products across the plurality of distribution channels. 17. The at least one non-transitory storage medium of claim 15, wherein the accessing comprises receiving one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period; promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 18. The at least one non-transitory storage medium of claim 15, wherein generating the plurality of promotional products based on the promotional intelligence comprises configuring at least one of promotional content or an offer. 19. The at least one non-transitory storage medium of claim 15, wherein generating the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 20. The at least one non-transitory storage medium of claim 15, wherein measuring the performance of at least one product of the plurality of promotional products comprises accessing information indicative of audience activity in response to the at least one product. 21. The at least one non-transitory storage medium of claim 20, wherein measuring the performance of at least one product of the plurality of promotional products further comprises generating one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. | Aspects of the disclosure include generation and management of promotional campaigns that can provide a satisfactory performance for a specific amount of resources allocated to the campaigns. In one aspect, at least one of the promotional campaigns can be distributed via media channels that pertain to an organization that administers the promotional campaigns and/or media channels associated with a third-party partner (e.g., a syndication or reseller partner) of such an organization. In another aspect, a promotional campaign can be developed for a predetermined resource allocation, where the promotional campaign can include satisfactory offers that can reach a satisfactory audience at an adequate time via an adequate distribution channel. In order to attain an adequate level of transactions, the promotional campaign can be dynamically restructured based on performance of the campaign across distribution channels available for the predetermined resource allocation.1. A method for promotional campaigns, comprising:
accessing promotional intelligence by a computing system having at least one processor functionally coupled to at least one memory device; generating, by the computing system, a plurality of promotional products based on the promotional intelligence; generating, by the computing system, a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign; distributing, by the computing system, the plurality of products according to the distribution allocation; measuring, by the computing system, performance of at least one product of the plurality of promotional products; and generating, by the computing system, an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 2. The method of claim 1, further comprising distributing, by the computing system, the updated distribution allocation of the plurality of products across the plurality of distribution channels. 3. The method of claim 1, wherein the accessing comprises receiving one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period;
promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 4. The method of claim 1, wherein generating the plurality of promotional products based on the promotional intelligence comprises configuring at least one of promotional content or an offer. 5. The method of claim 1, wherein generating the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 6. The method of claim 1, wherein measuring the performance of at least one product of the plurality of promotional products comprises accessing information indicative of audience activity in response to the at least one product. 7. The method of claim 6, wherein measuring the performance of at least one product of the plurality of promotional products further comprises generating one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. 8. A system for promotional campaigns, comprising:
at least one memory device having instructions encoded thereon; and at least one processor functionally coupled to the at least one memory device and configured, by the instructions,
to access promotional intelligence;
to generate a plurality of promotional products based on the promotional intelligence;
to generate a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign;
distribute the plurality of products according to the distribution allocation;
to measure performance of at least one product of the plurality of promotional products; and
to generate an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 9. The system of claim 8, wherein the at least one processor is further configured to distribute the updated distribution allocation of the plurality of products across the plurality of distribution channels. 10. The system of claim 8, wherein the at least one processor is further configured to receive one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period; promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 11. The system of claim 8, wherein the at least one processor is further configured to configure at least one of promotional content or an offer. 12. The system of claim 8, wherein the at least one processor is further configured to generate the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 13. The system of claim 8, wherein the at least one processor is further configured to access information indicative of audience activity in response to the at least one product. 14. The system of claim 13, wherein the at least one processor is further configured to generate one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. 15. At least one non-transitory storage medium having instructions for promotional campaigns encoded thereon that, in response to execution, cause at least one computing system having at least one processor functionally coupled to at least one memory device to perform operations comprising:
accessing promotional intelligence; generating a plurality of promotional products based on the promotional intelligence; generating a distribution allocation of the plurality of products across a plurality of distribution channels based on an amount of resources for a promotional campaign; distributing the plurality of products according to the distribution allocation; measuring performance of at least one product of the plurality of promotional products; and generating an updated distribution allocation of the plurality of products across the plurality of distribution channels based on the measured performance. 16. The at least one non-transitory storage medium of claim 15, wherein the operations further comprise distributing the updated distribution allocation of the plurality of products across the plurality of distribution channels. 17. The at least one non-transitory storage medium of claim 15, wherein the accessing comprises receiving one or more of catalog information indicative contemporaneous and historical promotional campaigns and related offers for a group of organizations spanning a predetermined period; promotional content associated with one or more of contemporaneous offers or historical offers; knowledge indicative of practices for issuance of offers according to one or more of season, product category, service category, or organization category; or satisfactory content for promotional content of an offer or satisfactory type of the offer. 18. The at least one non-transitory storage medium of claim 15, wherein generating the plurality of promotional products based on the promotional intelligence comprises configuring at least one of promotional content or an offer. 19. The at least one non-transitory storage medium of claim 15, wherein generating the distribution allocation of the plurality of products across the plurality of distribution channels based on the amount of resources for the promotional campaign comprises assigning a group of products for in a distribution channel based on a portion of the amount of resources,
wherein the distribution channel is a media channel that pertains to an administrator organization that administers the promotional campaign or media channel associated with a third-party partner of the organization. 20. The at least one non-transitory storage medium of claim 15, wherein measuring the performance of at least one product of the plurality of promotional products comprises accessing information indicative of audience activity in response to the at least one product. 21. The at least one non-transitory storage medium of claim 20, wherein measuring the performance of at least one product of the plurality of promotional products further comprises generating one or more metrics indicative of the audience activity,
wherein the audience activity comprises one or more of acquisition of an offer associated with the promotional product; redistribution of the promotional product; redemption of the offer; initiation of a call session with an organization associated with the at least one promotional product; or completion of a survey or other market research instrument. | 3,600 |
13,581 | 13,581 | 14,573,204 | 3,635 | A bumper assembly includes an elongate rigid shell formed of a metallic material and an elongate base. The elongate rigid shell includes an inner surface, an outer surface, a first shell edge, and a first flange protruding from the first shell edge in a direction toward the inner surface of the elongate rigid shell. The elongate base includes a base body including a first base edge and a first flexible latching element extending from the first base edge of the base body, the first flexible latching element including a first latching protrusion having a first inclined outer surface and a first shoulder. The elongate base is configured for insertion into the elongate rigid shell with the first flange compressing the first flexible latching element and engaging the first shoulder of the first latching protrusion. | 1. A bumper assembly comprising:
an elongate rigid shell formed of a metallic material, the shell including
an inner surface;
an outer surface;
a first shell edge; and
a first flange protruding from the first shell edge in a direction toward the inner surface of the elongate rigid shell;
an elongate base including
a base body including a first base edge; and
a first flexible latching element extending from the first base edge of the base body, the first flexible latching element including a first latching protrusion having a first inclined outer surface and a first shoulder;
wherein the elongate base is configured for insertion into the elongate rigid shell with the first flange compressing the first flexible latching element and engaging the first shoulder of the first latching protrusion. 2. The bumper assembly of claim 1 wherein the elongate base includes a plurality of support members extending from the base body, each support member having a proximal end attached to the base body and a distal end configured to lie adjacent to the elongate rigid shell when the elongate base is inserted into the elongate rigid shell. 3. The bumper assembly of claim 2 wherein each support member of the plurality of support members includes a contact portion at its distal end, the contact portion having a thickness greater than a thickness of other portions of the support member. 4. The bumper assembly of claim 1 wherein the first flexible latching element includes a first portion extending from the base body and a cantilever portion extending from the first portion, wherein the shoulder and the latching protrusion are disposed on the cantilever portion. 5. The bumper assembly of claim 4 wherein a thickness of the flexible latching element at a point on the flexible latching element where the first portion and the cantilever portion connect is reduced to increase a flexibility of the flexible latching element. 6. The bumper assembly of claim 1 wherein the outer surface of the elongate rigid shell has a substantially semi-cylindrical shape. 7. The bumper assembly of claim 1 wherein a cross section of the outer surface of the elongate rigid shell has a substantially trapezoidal shape. 8. The bumper assembly of claim 1 wherein a cross section of the outer surface of the elongate rigid shell has a substantially rectangular shape. 9. The bumper assembly of claim 1 wherein the elongate rigid shell is made of stainless steel. 10. The bumper assembly of claim 1 wherein
the elongate rigid shell further includes
an second shell edge, and
an second flange protruding from the second shell edge in a direction toward the inner surface of the elongate rigid shell, and
the elongate base further includes
a second base edge, and
a second flexible latching element extending from the second base edge of the base body, the second flexible latching element including a second latching protrusion having a second inclined outer surface and a second shoulder,
wherein the elongate base is further configured for insertion into the elongate rigid shell with the second flange compressing the second flexible latching element and engaging the second shoulder of the second latching protrusion. 11. The bumper assembly of claim 1 further comprising an end cap configured to engage an end of the elongate base. 12. The bumper assembly of claim 11 wherein the end cap includes a hollow portion and a fastening protrusion for insertion into the elongate base and attachment to the elongate base. 13. The bumper assembly of claim 11 wherein the hollow portion has a rounded shape. 14. The bumper assembly of claim 11 wherein the hollow portion is substantially wedge-shaped. 15. The bumper assembly of claim 11 wherein the hollow portion includes one or more reinforcing ribs. 16. The bumper assembly of claim 11 wherein the hollow portion is configured to abut the end of the elongate base. 17. The bumper assembly of claim 11 wherein the end cap further includes a receiving portion configured to receive a portion of the end of the elongate base. 18. The bumper assembly of claim 11 wherein the end is formed of a metallic material. 19. The bumper assembly of claim 11 wherein the end cap is formed of a plastic material. 20. The bumper assembly of claim 11 wherein the end cap is formed of both a metallic material and a plastic material. | A bumper assembly includes an elongate rigid shell formed of a metallic material and an elongate base. The elongate rigid shell includes an inner surface, an outer surface, a first shell edge, and a first flange protruding from the first shell edge in a direction toward the inner surface of the elongate rigid shell. The elongate base includes a base body including a first base edge and a first flexible latching element extending from the first base edge of the base body, the first flexible latching element including a first latching protrusion having a first inclined outer surface and a first shoulder. The elongate base is configured for insertion into the elongate rigid shell with the first flange compressing the first flexible latching element and engaging the first shoulder of the first latching protrusion.1. A bumper assembly comprising:
an elongate rigid shell formed of a metallic material, the shell including
an inner surface;
an outer surface;
a first shell edge; and
a first flange protruding from the first shell edge in a direction toward the inner surface of the elongate rigid shell;
an elongate base including
a base body including a first base edge; and
a first flexible latching element extending from the first base edge of the base body, the first flexible latching element including a first latching protrusion having a first inclined outer surface and a first shoulder;
wherein the elongate base is configured for insertion into the elongate rigid shell with the first flange compressing the first flexible latching element and engaging the first shoulder of the first latching protrusion. 2. The bumper assembly of claim 1 wherein the elongate base includes a plurality of support members extending from the base body, each support member having a proximal end attached to the base body and a distal end configured to lie adjacent to the elongate rigid shell when the elongate base is inserted into the elongate rigid shell. 3. The bumper assembly of claim 2 wherein each support member of the plurality of support members includes a contact portion at its distal end, the contact portion having a thickness greater than a thickness of other portions of the support member. 4. The bumper assembly of claim 1 wherein the first flexible latching element includes a first portion extending from the base body and a cantilever portion extending from the first portion, wherein the shoulder and the latching protrusion are disposed on the cantilever portion. 5. The bumper assembly of claim 4 wherein a thickness of the flexible latching element at a point on the flexible latching element where the first portion and the cantilever portion connect is reduced to increase a flexibility of the flexible latching element. 6. The bumper assembly of claim 1 wherein the outer surface of the elongate rigid shell has a substantially semi-cylindrical shape. 7. The bumper assembly of claim 1 wherein a cross section of the outer surface of the elongate rigid shell has a substantially trapezoidal shape. 8. The bumper assembly of claim 1 wherein a cross section of the outer surface of the elongate rigid shell has a substantially rectangular shape. 9. The bumper assembly of claim 1 wherein the elongate rigid shell is made of stainless steel. 10. The bumper assembly of claim 1 wherein
the elongate rigid shell further includes
an second shell edge, and
an second flange protruding from the second shell edge in a direction toward the inner surface of the elongate rigid shell, and
the elongate base further includes
a second base edge, and
a second flexible latching element extending from the second base edge of the base body, the second flexible latching element including a second latching protrusion having a second inclined outer surface and a second shoulder,
wherein the elongate base is further configured for insertion into the elongate rigid shell with the second flange compressing the second flexible latching element and engaging the second shoulder of the second latching protrusion. 11. The bumper assembly of claim 1 further comprising an end cap configured to engage an end of the elongate base. 12. The bumper assembly of claim 11 wherein the end cap includes a hollow portion and a fastening protrusion for insertion into the elongate base and attachment to the elongate base. 13. The bumper assembly of claim 11 wherein the hollow portion has a rounded shape. 14. The bumper assembly of claim 11 wherein the hollow portion is substantially wedge-shaped. 15. The bumper assembly of claim 11 wherein the hollow portion includes one or more reinforcing ribs. 16. The bumper assembly of claim 11 wherein the hollow portion is configured to abut the end of the elongate base. 17. The bumper assembly of claim 11 wherein the end cap further includes a receiving portion configured to receive a portion of the end of the elongate base. 18. The bumper assembly of claim 11 wherein the end is formed of a metallic material. 19. The bumper assembly of claim 11 wherein the end cap is formed of a plastic material. 20. The bumper assembly of claim 11 wherein the end cap is formed of both a metallic material and a plastic material. | 3,600 |
13,582 | 13,582 | 13,297,041 | 3,621 | A graphical user interface presents an image to a user and two labeled axes of that image corresponding to evaluations by the user of the image or of something represented by the image. The user moves a computer mouse or other input device to select a single location on the image. The display screen provides immediate feedback to the user of the location currently being pointed to by the input device, such as the x and y coordinates currently being moused over. The user then selects the location on the screen being pointed to, thus inputting his two dimensional evaluation. Optionally, based on the user's multidimensional evaluation, commercial offers such as coupons can then be presented to the user based on the user's likes and dislikes. | 1. A method of receiving scoring information comprising:
providing a graphical interface to a user, the graphical interface including an image, a first label associated with a first dimension of the image, and a second label associated with a second dimension of the image; the user interface allowing the user to identify a two-dimensional location on the image using a single user motion, the image being updated simultaneously with the motion to provide an immediate visual numerical feedback to the user corresponding to said location on the image; the user interface further allowing the user to select the two-dimensional location on the image using a single user selection action; wherein the two-dimensional location selected by the user corresponds to the user's subjective evaluation in two different criteria of at least one of the image itself and something represented by the image, the two different criteria corresponding to the first label associated with the first dimension of the image and the second label associated with the second dimension of the image. 2. The method of claim 1 further comprising presenting a coupon to the user, the coupon being selected for presentation to the user based on the user's subject evaluation of at least one product or service represented by the image. 3. The method of claim 1 wherein the single user motion comprises at least one of moving a mouse and touching a touch activated display screen, and the single user selection action comprises at least one of pressing a single mouse button and touching the touch activated screen. 4. The method of claim 1 wherein the images defines a first image, the first and second labels define a first pair of axis labels, and the selected location on the first image defines a first selected location, the method further comprising:
displaying a second image to the user on a same page on which the first image is displayed, and displaying a first and second label pair associated with first and second dimensions, respectively, of the second image;
the user interface allowing the user to identify a second location on the second image using a second user motion, the second image being updated simultaneously with the second motion to provide an immediate visual numerical feedback to the user corresponding to said second location on the second image;
the user interface further allowing the user to select the two-dimensional second location on the second image using a second single user selection action;
wherein the two-dimensional second location selected by the user corresponds to the user's subjective evaluation in two different criteria of at least one of the second image itself and something represented by the second image;
whereby the user can provide multi-dimensional subject evaluation scores of at least two images or things represented by those images, on a single user page. 5. A method of receiving scoring information comprising:
providing a graphical user interface, the graphical user interface providing instantaneous visual feedback to a user in at least two dimensions in response to the user manipulating a user input device in at least two corresponding dimensions, the user interface allowing the user to select a two-dimensional scoring input by a single action. 6. The method device of claim 5 wherein the scoring represents a two-dimensional user rating of at least one of an image presented at the user interface and something represented by the image. 7. The method device of claim 5 wherein the single action constitutes a single mouse click. 8. The method of claim 5 wherein the manipulating of the user input device comprises positioning the user input device. 9. The method of claim 8 wherein the positioning comprises moving a mouse or joystick to position an on-screen cursor. 10. The method of claim 5 wherein the user selects a two dimensional scoring input by clicking a mouse button, the two-dimensional scoring input corresponding to the x-position and y-position of an on-screen cursor within an on-screen image. 11. The method of claim 5, further comprising a score aggregator that aggregates the scores input from a number of different users and wherein the user interface displays the averages of those scores to the user. 12. The method of claim 5, further comprising allowing a poster to post an image and to label x- and y-axis labels that will be displayed alongside the image, for the user to score. 13. The method of claim 5 wherein the scoring information represents at least one of political polling information and consumer survey information. 14. The method of claim 5, further comprising presenting a commercial offer to the user based upon the two-dimensional scoring input selected by the user. 15. The method of claim 14 wherein the user selects the two-dimensional scoring input by selecting a location on an image by said single action, and wherein the presenting of the commercial offer comprises presenting a coupon to the user, the coupon pertaining to goods or services represented by the image. 16. The method of claim 15 wherein the coupon is an electronic coupon sent to a portable electronic device. 17. The method of claim 15 wherein axes of the image are labeled with a first good or service and a second good or service, and the coupon pertains to whichever of the first or second good or service that the user scored higher than the other good or service. 18. The method of claim 15 wherein axes of the image are labeled with a first good or service and a second good or service, and the coupon pertains to both goods or services. 19. The method of claim 14 wherein the commercial offer comprises a future benefit in exchange for an immediate payment. | A graphical user interface presents an image to a user and two labeled axes of that image corresponding to evaluations by the user of the image or of something represented by the image. The user moves a computer mouse or other input device to select a single location on the image. The display screen provides immediate feedback to the user of the location currently being pointed to by the input device, such as the x and y coordinates currently being moused over. The user then selects the location on the screen being pointed to, thus inputting his two dimensional evaluation. Optionally, based on the user's multidimensional evaluation, commercial offers such as coupons can then be presented to the user based on the user's likes and dislikes.1. A method of receiving scoring information comprising:
providing a graphical interface to a user, the graphical interface including an image, a first label associated with a first dimension of the image, and a second label associated with a second dimension of the image; the user interface allowing the user to identify a two-dimensional location on the image using a single user motion, the image being updated simultaneously with the motion to provide an immediate visual numerical feedback to the user corresponding to said location on the image; the user interface further allowing the user to select the two-dimensional location on the image using a single user selection action; wherein the two-dimensional location selected by the user corresponds to the user's subjective evaluation in two different criteria of at least one of the image itself and something represented by the image, the two different criteria corresponding to the first label associated with the first dimension of the image and the second label associated with the second dimension of the image. 2. The method of claim 1 further comprising presenting a coupon to the user, the coupon being selected for presentation to the user based on the user's subject evaluation of at least one product or service represented by the image. 3. The method of claim 1 wherein the single user motion comprises at least one of moving a mouse and touching a touch activated display screen, and the single user selection action comprises at least one of pressing a single mouse button and touching the touch activated screen. 4. The method of claim 1 wherein the images defines a first image, the first and second labels define a first pair of axis labels, and the selected location on the first image defines a first selected location, the method further comprising:
displaying a second image to the user on a same page on which the first image is displayed, and displaying a first and second label pair associated with first and second dimensions, respectively, of the second image;
the user interface allowing the user to identify a second location on the second image using a second user motion, the second image being updated simultaneously with the second motion to provide an immediate visual numerical feedback to the user corresponding to said second location on the second image;
the user interface further allowing the user to select the two-dimensional second location on the second image using a second single user selection action;
wherein the two-dimensional second location selected by the user corresponds to the user's subjective evaluation in two different criteria of at least one of the second image itself and something represented by the second image;
whereby the user can provide multi-dimensional subject evaluation scores of at least two images or things represented by those images, on a single user page. 5. A method of receiving scoring information comprising:
providing a graphical user interface, the graphical user interface providing instantaneous visual feedback to a user in at least two dimensions in response to the user manipulating a user input device in at least two corresponding dimensions, the user interface allowing the user to select a two-dimensional scoring input by a single action. 6. The method device of claim 5 wherein the scoring represents a two-dimensional user rating of at least one of an image presented at the user interface and something represented by the image. 7. The method device of claim 5 wherein the single action constitutes a single mouse click. 8. The method of claim 5 wherein the manipulating of the user input device comprises positioning the user input device. 9. The method of claim 8 wherein the positioning comprises moving a mouse or joystick to position an on-screen cursor. 10. The method of claim 5 wherein the user selects a two dimensional scoring input by clicking a mouse button, the two-dimensional scoring input corresponding to the x-position and y-position of an on-screen cursor within an on-screen image. 11. The method of claim 5, further comprising a score aggregator that aggregates the scores input from a number of different users and wherein the user interface displays the averages of those scores to the user. 12. The method of claim 5, further comprising allowing a poster to post an image and to label x- and y-axis labels that will be displayed alongside the image, for the user to score. 13. The method of claim 5 wherein the scoring information represents at least one of political polling information and consumer survey information. 14. The method of claim 5, further comprising presenting a commercial offer to the user based upon the two-dimensional scoring input selected by the user. 15. The method of claim 14 wherein the user selects the two-dimensional scoring input by selecting a location on an image by said single action, and wherein the presenting of the commercial offer comprises presenting a coupon to the user, the coupon pertaining to goods or services represented by the image. 16. The method of claim 15 wherein the coupon is an electronic coupon sent to a portable electronic device. 17. The method of claim 15 wherein axes of the image are labeled with a first good or service and a second good or service, and the coupon pertains to whichever of the first or second good or service that the user scored higher than the other good or service. 18. The method of claim 15 wherein axes of the image are labeled with a first good or service and a second good or service, and the coupon pertains to both goods or services. 19. The method of claim 14 wherein the commercial offer comprises a future benefit in exchange for an immediate payment. | 3,600 |
13,583 | 13,583 | 14,877,666 | 3,681 | The cardinality of an audience logical expression is estimated in real time based on Hyperloglog data structures. In embodiments, an apparatus includes a communication module to receive a query for cardinality estimation associated with an audience logical expression. Further, the apparatus includes a conversion module to convert the audience logical expression into an equivalent expression based on selected Hyperloglog data structures, and an estimation module estimates the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with the selected Hyperloglog data structures. | 1. An apparatus for determining cardinalities of audience segments, comprising:
a communication module to receive a query for a cardinality associated with an audience logical expression in order to determine a number of individuals in an audience segment associated with the audience logical expression; a conversion module, coupled to the networking module, to identify, based on the audience logical expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; and an estimation module, coupled to the conversion module, to estimate respective cardinality associated with respective components of the plurality of components from respective Hyperloglog data structures or union of Hyperloglog data structures, and to determine the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 2. The apparatus of claim 1, wherein the communication module is further to receive the audience logical expression having audience segments for a given time period with at least one selected operator from conjunction, disjunction, and negation. 3. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including a negation of a plurality of disjunctive expressions. 4. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions. 5. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation. 6. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including a conjunction operator. 7. The apparatus of claim 1, wherein the conversion module is further to identify a term associated with a negation operator in the audience logical expression; estimate a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term; and subtract the cardinality associated with the term from the cardinality associated with the union of all Hyperloglog data structures. 8. The apparatus of claim 1, wherein the estimation module is further to find respective Hyperloglog value of respective Hyperloglog data structures or union of Hyperloglog data structures. 9. A computer-implemented method for determining cardinalities of audience segments, comprising:
receiving a query for a cardinality associated with a Boolean expression; identifying based on the Boolean expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; estimating respective cardinality associated with respective components of the plurality of components, based on respective Hyperloglog data structures or union of Hyperloglog data structures; and determining the cardinality associated with the Boolean expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 10. The method of claim 9, wherein the receiving comprises receiving the Boolean expression over audience segments with at least one selected operator from conjunction, disjunction, and negation. 11. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including a negation of a plurality of disjunctive expressions. 12. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including an intersection of two disjunctive expressions. 13. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation. 14. The method of claim 9, wherein the identifying comprises identifying a component with a union of two terms from the Boolean expression in response to a conjunction operator between the two terms in the Boolean expression. 15. The method of claim 9, wherein the identifying comprises identifying at least one of the plurality of components based on an inclusion-exclusion principle applied on the Boolean expression with at least one conjunction operator. 16. The method of claim 9, wherein the identifying comprises identifying a term associated with a negation operator in the Boolean expression; and wherein estimating comprises estimating a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term. 17. The method of claim 9, wherein the estimating comprises finding respective Hyperloglog value of respective Hyperloglog data structures or union of Hyperloglog data structures. 18. One or more non-transient computer storage media storing computer-readable instructions that, when executed by one or more processors of a computer system, cause the computer system to perform operations comprising:
receiving a query for a cardinality associated with an audience logical expression having one or more audience segments; identifying, based on the audience logical expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; estimating respective cardinality associated with respective components of the plurality of components, based on respective Hyperloglog data structures or union of Hyperloglog data structures; and determining the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 19. The storage media of claim 18, wherein the instructions further cause the one or more computing devices to perform operations comprising:
identifying the plurality of components corresponding to the audience logical expression including a negation of a plurality of disjunctive expressions; identifying a component with a union of two terms from the audience logical expression in response to a conjunction operator between the two terms in the audience logical expression; r identifying the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation; 20. The storage media of claim 18, wherein the instructions further cause the one or more computing devices to perform operations comprising:
identifying a term associated with a negation operator in the audience logical expression; estimating a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term; and subtracting the cardinality associated with the term from the cardinality associated with the union of all Hyperloglog data structures. | The cardinality of an audience logical expression is estimated in real time based on Hyperloglog data structures. In embodiments, an apparatus includes a communication module to receive a query for cardinality estimation associated with an audience logical expression. Further, the apparatus includes a conversion module to convert the audience logical expression into an equivalent expression based on selected Hyperloglog data structures, and an estimation module estimates the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with the selected Hyperloglog data structures.1. An apparatus for determining cardinalities of audience segments, comprising:
a communication module to receive a query for a cardinality associated with an audience logical expression in order to determine a number of individuals in an audience segment associated with the audience logical expression; a conversion module, coupled to the networking module, to identify, based on the audience logical expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; and an estimation module, coupled to the conversion module, to estimate respective cardinality associated with respective components of the plurality of components from respective Hyperloglog data structures or union of Hyperloglog data structures, and to determine the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 2. The apparatus of claim 1, wherein the communication module is further to receive the audience logical expression having audience segments for a given time period with at least one selected operator from conjunction, disjunction, and negation. 3. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including a negation of a plurality of disjunctive expressions. 4. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions. 5. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation. 6. The apparatus of claim 1, wherein the conversion module is further to identify the plurality of components corresponding to the audience logical expression including a conjunction operator. 7. The apparatus of claim 1, wherein the conversion module is further to identify a term associated with a negation operator in the audience logical expression; estimate a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term; and subtract the cardinality associated with the term from the cardinality associated with the union of all Hyperloglog data structures. 8. The apparatus of claim 1, wherein the estimation module is further to find respective Hyperloglog value of respective Hyperloglog data structures or union of Hyperloglog data structures. 9. A computer-implemented method for determining cardinalities of audience segments, comprising:
receiving a query for a cardinality associated with a Boolean expression; identifying based on the Boolean expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; estimating respective cardinality associated with respective components of the plurality of components, based on respective Hyperloglog data structures or union of Hyperloglog data structures; and determining the cardinality associated with the Boolean expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 10. The method of claim 9, wherein the receiving comprises receiving the Boolean expression over audience segments with at least one selected operator from conjunction, disjunction, and negation. 11. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including a negation of a plurality of disjunctive expressions. 12. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including an intersection of two disjunctive expressions. 13. The method of claim 9, wherein the identifying comprises identifying the plurality of components corresponding to the Boolean expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation. 14. The method of claim 9, wherein the identifying comprises identifying a component with a union of two terms from the Boolean expression in response to a conjunction operator between the two terms in the Boolean expression. 15. The method of claim 9, wherein the identifying comprises identifying at least one of the plurality of components based on an inclusion-exclusion principle applied on the Boolean expression with at least one conjunction operator. 16. The method of claim 9, wherein the identifying comprises identifying a term associated with a negation operator in the Boolean expression; and wherein estimating comprises estimating a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term. 17. The method of claim 9, wherein the estimating comprises finding respective Hyperloglog value of respective Hyperloglog data structures or union of Hyperloglog data structures. 18. One or more non-transient computer storage media storing computer-readable instructions that, when executed by one or more processors of a computer system, cause the computer system to perform operations comprising:
receiving a query for a cardinality associated with an audience logical expression having one or more audience segments; identifying, based on the audience logical expression, a plurality of components with each component represented by a Hyperloglog data structure or a union of Hyperloglog data structures; estimating respective cardinality associated with respective components of the plurality of components, based on respective Hyperloglog data structures or union of Hyperloglog data structures; and determining the cardinality associated with the audience logical expression based on one or more addition or subtraction operations with the respective cardinality associated with respective components of the plurality of components. 19. The storage media of claim 18, wherein the instructions further cause the one or more computing devices to perform operations comprising:
identifying the plurality of components corresponding to the audience logical expression including a negation of a plurality of disjunctive expressions; identifying a component with a union of two terms from the audience logical expression in response to a conjunction operator between the two terms in the audience logical expression; r identifying the plurality of components corresponding to the audience logical expression including an intersection of two disjunctive expressions wherein exactly one of the two disjunctive expressions has a negation; 20. The storage media of claim 18, wherein the instructions further cause the one or more computing devices to perform operations comprising:
identifying a term associated with a negation operator in the audience logical expression; estimating a cardinality associated with a union of all Hyperloglog data structures and a cardinality associated with the term; and subtracting the cardinality associated with the term from the cardinality associated with the union of all Hyperloglog data structures. | 3,600 |
13,584 | 13,584 | 15,135,137 | 3,677 | The invention relates to pocket door hardware. Devices are disclosed that include a plate configured to fit over a surface pull of a pocket door, and members protruding from the plate away from the broad plane of the door. | 1. A device comprising:
a pocket door surface pull having a top surface and a plurality of mounting fastener holes, and a pocket door surface pull cover comprising: a plate configured to fit over the pocket door surface pull such that it substantially covers the top surface, and grippable flange members protruding from the plate, wherein the plate includes mounting fastener holes that are positioned to align with the mounting fastener holes of the pocket door surface pull when the plate substantially covers the top surface of the pocket door surface pull. 2. The device of claim 1, wherein the grippable flange members are generally perpendicular to a plane of the plate. 3. The device of claim 1, wherein the grippable flange members have sufficient surface area to allow a user to apply a force to open or close the door. 4. The device of claim 1, wherein the grippable flange members protrude from a surface of the plate at least 5 mm. 5. The device of claim 1, wherein the grippable flange members are positioned on opposite edges of the plate. 6. The device of claim 1, wherein the mounting fastener holes in the plate are elongated. 7. A method of installing a cover for a pocket door surface pull, the method comprising:
(a) placing, over a pocket door surface pull having a top surface and a plurality of mounting fastener holes, a pocket door surface pull cover comprising a plate configured to fit over the pocket door surface pull such that it substantially covers the top surface, and grippable flange members protruding from the plate, and (b) inserting fasteners through mounting fastener holes in the plate, which are aligned with the mounting fastener holes of the pocket door surface pull when the plate substantially covers the top surface. 8. The method of claim 7 further comprising mounting the plate on a door such that the gripping flange members extend generally parallel to a long axis of the door and one of the gripping flange members is aligned with an edge of the door. | The invention relates to pocket door hardware. Devices are disclosed that include a plate configured to fit over a surface pull of a pocket door, and members protruding from the plate away from the broad plane of the door.1. A device comprising:
a pocket door surface pull having a top surface and a plurality of mounting fastener holes, and a pocket door surface pull cover comprising: a plate configured to fit over the pocket door surface pull such that it substantially covers the top surface, and grippable flange members protruding from the plate, wherein the plate includes mounting fastener holes that are positioned to align with the mounting fastener holes of the pocket door surface pull when the plate substantially covers the top surface of the pocket door surface pull. 2. The device of claim 1, wherein the grippable flange members are generally perpendicular to a plane of the plate. 3. The device of claim 1, wherein the grippable flange members have sufficient surface area to allow a user to apply a force to open or close the door. 4. The device of claim 1, wherein the grippable flange members protrude from a surface of the plate at least 5 mm. 5. The device of claim 1, wherein the grippable flange members are positioned on opposite edges of the plate. 6. The device of claim 1, wherein the mounting fastener holes in the plate are elongated. 7. A method of installing a cover for a pocket door surface pull, the method comprising:
(a) placing, over a pocket door surface pull having a top surface and a plurality of mounting fastener holes, a pocket door surface pull cover comprising a plate configured to fit over the pocket door surface pull such that it substantially covers the top surface, and grippable flange members protruding from the plate, and (b) inserting fasteners through mounting fastener holes in the plate, which are aligned with the mounting fastener holes of the pocket door surface pull when the plate substantially covers the top surface. 8. The method of claim 7 further comprising mounting the plate on a door such that the gripping flange members extend generally parallel to a long axis of the door and one of the gripping flange members is aligned with an edge of the door. | 3,600 |
13,585 | 13,585 | 14,407,864 | 3,689 | The invention is a system and a method for renting portable property, which can be a pre-purchase sample. The invention includes catering identification of an article onto the Internet. Receiving a plurality of requests via network from potential lessees to rent the article for requested rental periods then occurs. Sorting occurs for the requests to rent the article according to a chronology of the requested rental periods. Then, agreeing via network to rent the article to a plurality of lessees occurs. Transferring possession of the article from a lessor to a first lessee occurs such that the first lessee is the first in the chronology of the sorted, requested rental periods. Transferring sequentially the article between lessees according to the chronology of the sorted, requested rental periods is performed. Monitoring each rental and transfer of the article is done. Then, distributing a payment for each rental of the article occurs. | 1. A method for renting portable property comprising:
entering on a processor and storage system via information network identification of an article of portable property for rent; receiving a plurality of requests via the information network from potential lessees to rent the article for requested rental periods; sorting by the processor and storage system the requests to rent the article according to a chronology of the requested rental periods; agreeing via the information network to rent the article to a plurality of lessees according to the chronology of the requested rental periods; transferring possession of the article from a lessor to a first lessee, the first lessee being first in the chronology of the sorted, requested rental periods; transferring sequentially the article between lessees according to the chronology of the sorted, requested rental periods; monitoring for the lessor by the processor and storage system each rental and transfer of the article; and distributing by the processor and storage system a payment for each rental of the article. 2. The method for renting of claim 1 wherein the identification of the article includes a location of the article. 3. The method for renting of claim 2 wherein the identification of the article includes a rental value for the article. 4. The method for renting of claim 3 wherein the identification of the article includes a fixed or limited rental duration. 5. The method for renting of claim 3 wherein the requests by potential lessees include competitive bidding to purchase the article. 6. The method for renting of claim 3 wherein the processor and storage system calculates a reduced rental value, required deposit, or purchase price based upon predetermined criteria including the usage of the article or the age of the article. 7. The method for renting of claim 1 wherein the sorting of the requests to rent denies requests for rental periods that begin during a pending rental period. 8. The method for renting of claim 1 further comprising:
qualifying the potential lessees by the processor and storage system based upon predetermined criteria. 9. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes as geographical location of each of the potential lessees in relation to a lessor of the article. 10. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes as credit score for each of the potential lessees. 11. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes a review of a numerical rating for each of the potential lessees in a database of the processor and storage system. 12. The method for renting of claim 1 wherein the monitoring by the processor and storage system includes tracking geographically a location of the article. 13. The method for renting of claim 12 wherein the tracking geographically a location of the article is by an RFID attached to the article. 14. The method for renting of claim 1 wherein the agreeing to rent the article includes selecting acceptable bids submitted by potential lessees of the article through the processor and storage device based upon predetermined criteria. 15. The method for renting of claim 14 wherein the predetermined criteria for selecting acceptable bids submitted by potential lessees of the article through the processor and storage device includes denying bids for failure of the potential lessees to submit an agreement to a minimum rental value, a minimum rental period, or a required deposit. 16. The method of claim 1 wherein the article is a sample of a product for evaluation by the first lessee before the first lessee decides whether to purchase the product, the first lessee forwards the sample to another lessee for evaluation. 17. A system for renting portable property comprising:
communication devices for submitting individually a plurality of requests via an information network from potential lessees to rent an article for requested rental periods; a processor and storage system in communication with the communication devices via the information network whereby a. identification of the article of portable property for rent can be entered and displayed; b. requests to rent the article can be sorted according to a chronology of the requested rental periods; c. agreements can be made via the information network to rent the article to a plurality of lessees according to the chronology of the requested rental periods; d. entry is received of possession of the article from a lessor to a first lessee, the first lessee being first in the chronology of the sorted, requested rental periods; and sequential transfers the article between lessees according to the chronology of the sorted, requested rental periods; e. the lessor can monitor each rental and transfer of the article; and f. distribute a payment for each rental of the article. | The invention is a system and a method for renting portable property, which can be a pre-purchase sample. The invention includes catering identification of an article onto the Internet. Receiving a plurality of requests via network from potential lessees to rent the article for requested rental periods then occurs. Sorting occurs for the requests to rent the article according to a chronology of the requested rental periods. Then, agreeing via network to rent the article to a plurality of lessees occurs. Transferring possession of the article from a lessor to a first lessee occurs such that the first lessee is the first in the chronology of the sorted, requested rental periods. Transferring sequentially the article between lessees according to the chronology of the sorted, requested rental periods is performed. Monitoring each rental and transfer of the article is done. Then, distributing a payment for each rental of the article occurs.1. A method for renting portable property comprising:
entering on a processor and storage system via information network identification of an article of portable property for rent; receiving a plurality of requests via the information network from potential lessees to rent the article for requested rental periods; sorting by the processor and storage system the requests to rent the article according to a chronology of the requested rental periods; agreeing via the information network to rent the article to a plurality of lessees according to the chronology of the requested rental periods; transferring possession of the article from a lessor to a first lessee, the first lessee being first in the chronology of the sorted, requested rental periods; transferring sequentially the article between lessees according to the chronology of the sorted, requested rental periods; monitoring for the lessor by the processor and storage system each rental and transfer of the article; and distributing by the processor and storage system a payment for each rental of the article. 2. The method for renting of claim 1 wherein the identification of the article includes a location of the article. 3. The method for renting of claim 2 wherein the identification of the article includes a rental value for the article. 4. The method for renting of claim 3 wherein the identification of the article includes a fixed or limited rental duration. 5. The method for renting of claim 3 wherein the requests by potential lessees include competitive bidding to purchase the article. 6. The method for renting of claim 3 wherein the processor and storage system calculates a reduced rental value, required deposit, or purchase price based upon predetermined criteria including the usage of the article or the age of the article. 7. The method for renting of claim 1 wherein the sorting of the requests to rent denies requests for rental periods that begin during a pending rental period. 8. The method for renting of claim 1 further comprising:
qualifying the potential lessees by the processor and storage system based upon predetermined criteria. 9. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes as geographical location of each of the potential lessees in relation to a lessor of the article. 10. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes as credit score for each of the potential lessees. 11. The method for renting of claim 8 wherein the predetermined criteria for qualifying the potential lessees includes a review of a numerical rating for each of the potential lessees in a database of the processor and storage system. 12. The method for renting of claim 1 wherein the monitoring by the processor and storage system includes tracking geographically a location of the article. 13. The method for renting of claim 12 wherein the tracking geographically a location of the article is by an RFID attached to the article. 14. The method for renting of claim 1 wherein the agreeing to rent the article includes selecting acceptable bids submitted by potential lessees of the article through the processor and storage device based upon predetermined criteria. 15. The method for renting of claim 14 wherein the predetermined criteria for selecting acceptable bids submitted by potential lessees of the article through the processor and storage device includes denying bids for failure of the potential lessees to submit an agreement to a minimum rental value, a minimum rental period, or a required deposit. 16. The method of claim 1 wherein the article is a sample of a product for evaluation by the first lessee before the first lessee decides whether to purchase the product, the first lessee forwards the sample to another lessee for evaluation. 17. A system for renting portable property comprising:
communication devices for submitting individually a plurality of requests via an information network from potential lessees to rent an article for requested rental periods; a processor and storage system in communication with the communication devices via the information network whereby a. identification of the article of portable property for rent can be entered and displayed; b. requests to rent the article can be sorted according to a chronology of the requested rental periods; c. agreements can be made via the information network to rent the article to a plurality of lessees according to the chronology of the requested rental periods; d. entry is received of possession of the article from a lessor to a first lessee, the first lessee being first in the chronology of the sorted, requested rental periods; and sequential transfers the article between lessees according to the chronology of the sorted, requested rental periods; e. the lessor can monitor each rental and transfer of the article; and f. distribute a payment for each rental of the article. | 3,600 |
13,586 | 13,586 | 15,369,334 | 3,623 | Disclosed herein are a computer apparatus, non-transitory computer readable medium, and method for predicting real estate bubbles based on big data analysis. Historical variable data associated with real estate assets are obtained from remote data sources. Portions of the historical variable data are distributed among a plurality nodes. Historical real estate values are received from the plurality of nodes. A plurality of previous peaks in the historical real estate values are identified. A prediction of a future peak in real estate values is generated. An alert comprising the prediction is transmitted. | 1. An apparatus comprising:
a memory device; a network interface; at least one processor to:
communicate via the network interface with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets;
distribute portions of the historical variable data via the network interface to a plurality of nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in the memory device;
receive historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data;
identify a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes;
generate a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and
transmit an alert comprising the prediction. 2. The apparatus of claim 1, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 3. The apparatus of claim 1, wherein to generate the prediction the at least one processor is further configured to generate a distribution of future real estate value peak probabilities during a future time period. 4. The apparatus of claim 1, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 5. The apparatus of claim 1, wherein the at least one processor is further configured to distribute the portions of the historical variable data in accordance with a map reduce algorithm. 6. The apparatus of claim 1, wherein to generate the prediction the at least one processor is further configured to predict the future peak within a given future time period, the given future time period being configurable. 7. The apparatus of claim 1, wherein the at least one processor is further configured to identify a time duration between each of the plurality of previous peaks. 8. The apparatus of claim 1, wherein the plurality of diverse data sets comprise structured data sets and unstructured data. 9. A method comprising:
communicating, by at least one processor, with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets; distributing, by the at least one processor, portions of the historical variable data via a network interface to a plurality nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in a memory device coupled to the at least one processor; receiving, by the at least one processor, historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data; identifying, by the at least one processor, a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes; generating, by the at least one processor, a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and transmitting, by the at least one processor, an alert comprising the prediction. 10. The method of claim 9, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 11. The method of claim 9, wherein generating the prediction of the future peak further comprises generating, by the at least one processor, a distribution of future value metric peak probabilities during a plurality of future time periods. 12. The method of claim 9, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 13. The method of claim 9, wherein distributing the portions of the historical variable data further comprises distributing, by the at least one processor, the portions in accordance with a map reduce algorithm. 14. The method of claim 9, wherein generating the prediction further comprises predicting, by the at least one processor, the future peak within a given future time period, the given future time period being configurable. 15. The method of claim 9, further comprising identifying, by the at least one processor, a time period between each of the plurality of previous peaks. 16. The method of claim 9, wherein the plurality of diverse data sets comprise structured data sets and unstructured data sets. 17. A non-transitory computer readable medium with instructions stored therein which upon execution cause at least one processor to:
communicate via a network interface with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets; distribute portions of the historical variable data via the network interface to a plurality nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in a memory device coupled to the at least one processor; receive historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data; identify a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes; generate a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and transmit an alert comprising the prediction. 18. The non-transitory computer readable medium of claim 17, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 19. The non-transitory computer readable medium of claim 17, wherein to generate the prediction of the future peak the instructions, when executed, further cause the at least one processor to generate a distribution of future real estate value peak probabilities during a future time period. 20. The non-transitory computer readable medium of claim 17, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 21. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to distribute the portions of the historical variable data in accordance with a map reduce algorithm. 22. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to generate the prediction of the future peak within a given future time period, the given future time period being configurable. 23. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to identify a time duration between each of the plurality of previous peaks. 24. The non-transitory computer readable medium of claim 17, wherein the plurality of diverse data sets comprise structured data sets and unstructured data sets. | Disclosed herein are a computer apparatus, non-transitory computer readable medium, and method for predicting real estate bubbles based on big data analysis. Historical variable data associated with real estate assets are obtained from remote data sources. Portions of the historical variable data are distributed among a plurality nodes. Historical real estate values are received from the plurality of nodes. A plurality of previous peaks in the historical real estate values are identified. A prediction of a future peak in real estate values is generated. An alert comprising the prediction is transmitted.1. An apparatus comprising:
a memory device; a network interface; at least one processor to:
communicate via the network interface with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets;
distribute portions of the historical variable data via the network interface to a plurality of nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in the memory device;
receive historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data;
identify a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes;
generate a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and
transmit an alert comprising the prediction. 2. The apparatus of claim 1, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 3. The apparatus of claim 1, wherein to generate the prediction the at least one processor is further configured to generate a distribution of future real estate value peak probabilities during a future time period. 4. The apparatus of claim 1, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 5. The apparatus of claim 1, wherein the at least one processor is further configured to distribute the portions of the historical variable data in accordance with a map reduce algorithm. 6. The apparatus of claim 1, wherein to generate the prediction the at least one processor is further configured to predict the future peak within a given future time period, the given future time period being configurable. 7. The apparatus of claim 1, wherein the at least one processor is further configured to identify a time duration between each of the plurality of previous peaks. 8. The apparatus of claim 1, wherein the plurality of diverse data sets comprise structured data sets and unstructured data. 9. A method comprising:
communicating, by at least one processor, with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets; distributing, by the at least one processor, portions of the historical variable data via a network interface to a plurality nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in a memory device coupled to the at least one processor; receiving, by the at least one processor, historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data; identifying, by the at least one processor, a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes; generating, by the at least one processor, a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and transmitting, by the at least one processor, an alert comprising the prediction. 10. The method of claim 9, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 11. The method of claim 9, wherein generating the prediction of the future peak further comprises generating, by the at least one processor, a distribution of future value metric peak probabilities during a plurality of future time periods. 12. The method of claim 9, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 13. The method of claim 9, wherein distributing the portions of the historical variable data further comprises distributing, by the at least one processor, the portions in accordance with a map reduce algorithm. 14. The method of claim 9, wherein generating the prediction further comprises predicting, by the at least one processor, the future peak within a given future time period, the given future time period being configurable. 15. The method of claim 9, further comprising identifying, by the at least one processor, a time period between each of the plurality of previous peaks. 16. The method of claim 9, wherein the plurality of diverse data sets comprise structured data sets and unstructured data sets. 17. A non-transitory computer readable medium with instructions stored therein which upon execution cause at least one processor to:
communicate via a network interface with remote data sources containing historical variable data associated with real estate assets, the historical variable data being stored in a plurality of diverse data sets; distribute portions of the historical variable data via the network interface to a plurality nodes on a network such that a size of a portion assigned to a respective node is in accordance with a real-time workload of the respective node, a total size of the historical variable data being larger than an available size in a memory device coupled to the at least one processor; receive historical real estate values from the plurality of nodes that are based at least partially on the distributed portions of the historical variable data; identify a plurality of previous peaks in the historical real estate values based at least partially on the historical real estate values received from the plurality of nodes; generate a prediction of a future peak in real estate values based at least partially on the plurality of previous peaks; and transmit an alert comprising the prediction. 18. The non-transitory computer readable medium of claim 17, wherein the historical variable data stored in the remote data sources comprises local appraisal based capitalization rates, national appraisal based capitalization rates, change in ten year bond yields, and two year constant maturity yields. 19. The non-transitory computer readable medium of claim 17, wherein to generate the prediction of the future peak the instructions, when executed, further cause the at least one processor to generate a distribution of future real estate value peak probabilities during a future time period. 20. The non-transitory computer readable medium of claim 17, wherein the historical variable data stored in the remote data sources comprises change in median consumer price index, consumer confidence, implied net operating income growth, change in employment, change in ten year bond yields, and two year constant maturity yields. 21. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to distribute the portions of the historical variable data in accordance with a map reduce algorithm. 22. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to generate the prediction of the future peak within a given future time period, the given future time period being configurable. 23. The non-transitory computer readable medium of claim 17, wherein the instructions stored therein, when executed, further cause the at least one processor to identify a time duration between each of the plurality of previous peaks. 24. The non-transitory computer readable medium of claim 17, wherein the plurality of diverse data sets comprise structured data sets and unstructured data sets. | 3,600 |
13,587 | 13,587 | 14,516,253 | 3,688 | A system may use optical character recognition (“OCR”) techniques to identify license plates or other textual information associated with vehicles. Based on this OCR information, the system may determine additional information, such as users associated with the vehicles. The system may further obtain other information, such as history information associated with the vehicles and/or the users (e.g., via an “opt-in” data collection service). Ad content may be selected based on trends associated with the users and/or vehicles, and may be presented via “smart” billboards (e.g., billboards that may dynamically display different content). | 1. A method, comprising:
receiving, by one or more devices, information regarding a set of license plates associated with a set of vehicles that are located within a particular region,
the particular region being associated with a billboard device;
identifying, by the one or more devices and based on the information regarding the set of license plates, one or more trends associated with the set of vehicles; selecting, by the one or more devices, ad content to display on the billboard device,
the ad content being selected based on the one or more trends associated with the set of vehicles; and
outputting, by the one or more devices, an instruction to the billboard device, the instruction causing the billboard device to present the selected ad content. 2. The method of claim 1, wherein the information regarding a particular license plate, of the set of license plates, includes a license plate number associated with the particular license plate. 3. The method of claim 1, wherein the information regarding the set of license plates includes text that has been identified using an optical character recognition (“OCR”) technique on one or more images that include the set of vehicles. 4. The method of claim 3, wherein the one or more images, that include the set of vehicles, have been captured within a predetermined duration of time. 5. The method of claim 1, further comprising:
determining an average speed of the set of vehicles; and determining, based on the average speed of the vehicles, a duration that the selected ad content should be presented, wherein the instruction further causes the billboard to present the selected ad content for the determined duration. 6. The method of claim 1, further comprising:
identifying one or more user devices associated with one or more vehicles, of the set of vehicles, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more user devices associated with the one or more vehicles. 7. The method of claim 6, further comprising:
identifying one or more trends, associated with the one or more user devices, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more trends, associated with the one or more user devices. 8. The method of claim 7, wherein the one or more trends, associated with the one or more user devices, are based on at least one of:
a location history of a particular user device, of the one or more devices, a web browsing history of the particular user device, or a purchase history associated with the particular user device. 9. The method of claim 1, wherein the one or more trends, associated with the set of vehicles, are based on at least one of:
a location history associated with a particular vehicle, of the set of vehicles, or a quantity or proportion of vehicles, of the set of vehicles, that are a particular make or model. 10. A device, comprising:
a memory device storing a set of processor-executable instructions; and a processor configured to execute the processor-executable instructions, wherein executing the processor-executable instructions causes the processor to:
receive information regarding a set of license plates associated with a set of vehicles that are located within a particular region,
the particular region being associated with a billboard device;
identify, based on the information regarding the set of license plates, one or more trends associated with the set of vehicles;
select ad content to display on the billboard device,
the ad content being selected based on the one or more trends associated with the set of vehicles; and
output an instruction to the billboard device, the instruction causing the billboard device to present the selected ad content. 11. The device of claim 10, wherein the one or more trends, associated with the set of vehicles, are based on at least one of:
a location history associated with a particular vehicle, of the set of vehicles, or a quantity or proportion of vehicles, of the set of vehicles, that are a particular make or model. 12. The device of claim 10, wherein the information regarding the set of license plates includes text that has been identified using an optical character recognition (“OCR”) technique on one or more images that include the set of vehicles. 13. The device of claim 12, wherein the one or more images, that include the set of vehicles, have been captured within a predetermined duration of time. 14. The device of claim 10, wherein executing the processor-executable instructions further causes the processor to:
determine an average speed of the set of vehicles; and determine, based on the average speed of the vehicles, a duration that the selected ad content should be presented, wherein the instruction, outputted to the billboard, further causes the billboard to present the selected ad content for the determined duration. 15. The device of claim 10, wherein executing the processor-executable instructions further causes the processor to:
identify one or more user devices associated with one or more vehicles, of the set of vehicles, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more user devices associated with the one or more vehicles. 16. The device of claim 15, wherein executing the processor-executable instructions further causes the processor to:
identify one or more trends, associated with the one or more user devices, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more trends, associated with the one or more user devices. 17. The device of claim 16, wherein the one or more trends, associated with the one or more user devices, are based on at least one of:
a location history of a particular user device, of the one or more devices, a web browsing history of the particular user device, or a purchase history associated with the particular user device. 18. A method, comprising:
receiving, by one or more devices, one or more images associated with a set of vehicles that are present on a particular portion of a road within a particular timeframe; identifying, by the one or more devices and using an optical character recognition (“OCR”) technique, license plate information associated with the set of vehicles; identifying, by the one or more devices and based on the license plate information, a set of users associated with the set of vehicles; selecting, by the one or more devices, ad content,
the selecting being based on the information identifying the set of users; and
presenting, by the one or more devices, the ad content to the set of vehicles,
the presenting including presenting the ad content via a billboard display that is located within a particular proximity of the particular portion of the road. 19. The method of claim 18, further comprising:
receiving, from a particular user, of the set of users, linking information that identifies a license plate associated with the particular user, wherein identifying the set of users includes identifying the particular user using the linking information and the license plate information. 20. The method of claim 18, further comprising:
determining that a particular user, of the set of users, is associated with a particular vehicle, of the set of vehicles, based on: a presence of a user device, associated with the particular user, in a same geographic location as the particular vehicle within a particular timeframe. | A system may use optical character recognition (“OCR”) techniques to identify license plates or other textual information associated with vehicles. Based on this OCR information, the system may determine additional information, such as users associated with the vehicles. The system may further obtain other information, such as history information associated with the vehicles and/or the users (e.g., via an “opt-in” data collection service). Ad content may be selected based on trends associated with the users and/or vehicles, and may be presented via “smart” billboards (e.g., billboards that may dynamically display different content).1. A method, comprising:
receiving, by one or more devices, information regarding a set of license plates associated with a set of vehicles that are located within a particular region,
the particular region being associated with a billboard device;
identifying, by the one or more devices and based on the information regarding the set of license plates, one or more trends associated with the set of vehicles; selecting, by the one or more devices, ad content to display on the billboard device,
the ad content being selected based on the one or more trends associated with the set of vehicles; and
outputting, by the one or more devices, an instruction to the billboard device, the instruction causing the billboard device to present the selected ad content. 2. The method of claim 1, wherein the information regarding a particular license plate, of the set of license plates, includes a license plate number associated with the particular license plate. 3. The method of claim 1, wherein the information regarding the set of license plates includes text that has been identified using an optical character recognition (“OCR”) technique on one or more images that include the set of vehicles. 4. The method of claim 3, wherein the one or more images, that include the set of vehicles, have been captured within a predetermined duration of time. 5. The method of claim 1, further comprising:
determining an average speed of the set of vehicles; and determining, based on the average speed of the vehicles, a duration that the selected ad content should be presented, wherein the instruction further causes the billboard to present the selected ad content for the determined duration. 6. The method of claim 1, further comprising:
identifying one or more user devices associated with one or more vehicles, of the set of vehicles, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more user devices associated with the one or more vehicles. 7. The method of claim 6, further comprising:
identifying one or more trends, associated with the one or more user devices, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more trends, associated with the one or more user devices. 8. The method of claim 7, wherein the one or more trends, associated with the one or more user devices, are based on at least one of:
a location history of a particular user device, of the one or more devices, a web browsing history of the particular user device, or a purchase history associated with the particular user device. 9. The method of claim 1, wherein the one or more trends, associated with the set of vehicles, are based on at least one of:
a location history associated with a particular vehicle, of the set of vehicles, or a quantity or proportion of vehicles, of the set of vehicles, that are a particular make or model. 10. A device, comprising:
a memory device storing a set of processor-executable instructions; and a processor configured to execute the processor-executable instructions, wherein executing the processor-executable instructions causes the processor to:
receive information regarding a set of license plates associated with a set of vehicles that are located within a particular region,
the particular region being associated with a billboard device;
identify, based on the information regarding the set of license plates, one or more trends associated with the set of vehicles;
select ad content to display on the billboard device,
the ad content being selected based on the one or more trends associated with the set of vehicles; and
output an instruction to the billboard device, the instruction causing the billboard device to present the selected ad content. 11. The device of claim 10, wherein the one or more trends, associated with the set of vehicles, are based on at least one of:
a location history associated with a particular vehicle, of the set of vehicles, or a quantity or proportion of vehicles, of the set of vehicles, that are a particular make or model. 12. The device of claim 10, wherein the information regarding the set of license plates includes text that has been identified using an optical character recognition (“OCR”) technique on one or more images that include the set of vehicles. 13. The device of claim 12, wherein the one or more images, that include the set of vehicles, have been captured within a predetermined duration of time. 14. The device of claim 10, wherein executing the processor-executable instructions further causes the processor to:
determine an average speed of the set of vehicles; and determine, based on the average speed of the vehicles, a duration that the selected ad content should be presented, wherein the instruction, outputted to the billboard, further causes the billboard to present the selected ad content for the determined duration. 15. The device of claim 10, wherein executing the processor-executable instructions further causes the processor to:
identify one or more user devices associated with one or more vehicles, of the set of vehicles, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more user devices associated with the one or more vehicles. 16. The device of claim 15, wherein executing the processor-executable instructions further causes the processor to:
identify one or more trends, associated with the one or more user devices, wherein selecting the ad content, to display on the billboard device, is further based on identifying the one or more trends, associated with the one or more user devices. 17. The device of claim 16, wherein the one or more trends, associated with the one or more user devices, are based on at least one of:
a location history of a particular user device, of the one or more devices, a web browsing history of the particular user device, or a purchase history associated with the particular user device. 18. A method, comprising:
receiving, by one or more devices, one or more images associated with a set of vehicles that are present on a particular portion of a road within a particular timeframe; identifying, by the one or more devices and using an optical character recognition (“OCR”) technique, license plate information associated with the set of vehicles; identifying, by the one or more devices and based on the license plate information, a set of users associated with the set of vehicles; selecting, by the one or more devices, ad content,
the selecting being based on the information identifying the set of users; and
presenting, by the one or more devices, the ad content to the set of vehicles,
the presenting including presenting the ad content via a billboard display that is located within a particular proximity of the particular portion of the road. 19. The method of claim 18, further comprising:
receiving, from a particular user, of the set of users, linking information that identifies a license plate associated with the particular user, wherein identifying the set of users includes identifying the particular user using the linking information and the license plate information. 20. The method of claim 18, further comprising:
determining that a particular user, of the set of users, is associated with a particular vehicle, of the set of vehicles, based on: a presence of a user device, associated with the particular user, in a same geographic location as the particular vehicle within a particular timeframe. | 3,600 |
13,588 | 13,588 | 14,587,899 | 3,678 | A threaded connection has at least one male end threaded zone, and one female end threaded zone. A tooth width of the male threaded zone, CWT p , increases from CWT p min to CWT p max for the tooth closest to, and furthest from the terminal surface of the male end. A tooth width CWT b of the female threaded zone decreases from CWT b max to CWT b min for the tooth furthest from, and closest to, the terminal surface of the female end. At least one portion of the female threaded zone and at least one portion of the male threaded zone cooperate in accordance with self-locking make-up, with
CWT
p
min
CWT
b
max
≥
0.2
,
CWT
b
min
CWT
p
max
≤
CWT
p
min
CWT
b
max
,
CWR
p
max
≤
3
CWR
p
min
,
and
CWR
b
max
≤
3
CWR
b
min
. | 1: A threaded connection comprising:
a first and a second tubular component, with a respective male and female end, the male end including, on an external peripheral surface, at least one threaded zone and finishing in a terminal surface oriented radially with respect to an axis of the connection, the female end including, on an internal peripheral surface, at least one threaded zone and finishing in a terminal surface oriented radially with respect to the axis of the connection, wherein a width of the teeth of the male threaded zone, CWTp, increases from a value CWTpmin of a width of a tooth closest to the terminal surface of the male end to a value CWTpmax of a width of a tooth furthest from the terminal surface of the male end, and a width of valleys of the male threaded zone, CWRp, increases from a value CWRpmin of a width of a valley furthest from the terminal surface of the male end to a value CWRpmax of a width of a valley closest from said terminal surface, wherein a width of the teeth of the female threaded zone, CWTb, decreases from a value CWTbmax of a width of a tooth furthest from the terminal surface of the female end to a value CWTbmin of a width of a tooth closest to the terminal surface of the female end (8), and a width of valleys of the female threaded zone, CWRb, decreases from a value CWRbmax of a width of a valley closest to the terminal surface of the female end to a value CWRbmin of a width of a valley furthest from the terminal surface, and wherein at least one portion of the at least one threaded zone on the male end, and at least one portion of the at least one threaded zone on the female end cooperate in accordance with self-locking make-up, with
CWT
p
min
CWT
b
max
≥
0.2
,
CWT
b
min
CWT
p
max
≤
CWT
p
min
CWT
b
max
,
CWR
p
max
≤
3
CWR
p
min
,
and
CWR
b
max
≤
3
CWR
b
min
. 2. A threaded connection according to claim 1, wherein the ratio between the width, CWTpmin, of the tooth closest to the terminal surface of the male end and the width, CWTbmax, of the tooth furthest from the terminal surface of the female end is in the range 0.3 to 0.7. 3. A threaded connection according to claim 1, wherein at make-up at least the male threading tooth closest to the terminal surface is located in a run-out groove provided on the female end. 4. A threaded connection according to claim 3, wherein an inner diameter of the run-out groove is greater than an outer diameter of a last engaged tooth diameter, such that a critical cross-section of the connection system is a cross-section of the run-out groove. 5. A threaded connection according to claim 3, wherein a width of the run-out groove is configured to be at least 1.5 greater than a loading flank pitch. 6. A threaded connection according to claim 3, wherein a width of the run-out groove is configured to be at least:
L
F
P
b
+
(
I
C
W
-
(
L
F
P
b
-
S
F
P
b
)
)
+
(
L
F
H
+
L
F
P
b
TT
2
)
tan
15
°
where LFP is a loading flank pitch, ICW is an insert crest width, SFP is a stabbing flank pitch, LFH is a loading flank height, and TT is a taper line angle. 7. A threaded connection according to claim 1, wherein an outside collar diameter is configured based on both tension and torsion criteria at a critical cross-section. 8. A threaded connection according to claim 1, wherein at least a tooth furthest from a terminal surface is a vanishing tooth. 9. A threaded connection according to claim 8, wherein at least a male threading tooth furthest from the terminal surface of the male end is a vanishing tooth. 10. A threaded connection according to claim 1, wherein the male and female threaded zones have a taper generatrix forming an angle with the axis of the connection in a range between 1 degree and 5 degrees. 11. A threaded connection according to claim 1, wherein teeth of the male and female threaded zones have a dovetail profile. 12. A threaded connection according to claim 1, wherein crests of the teeth and roots of the valleys of the male and female threaded zones are parallel to the axis of the threaded connection. 13. A threaded connection according to claim 1, wherein a clearance h is provided between crests of the teeth of the male threaded zone and roots of the valleys of the female threaded zone. 14. A threaded connection according to claim 1, wherein at least one of the male and female ends comprises a first sealing surface to cooperate in interfering contact with a second sealing surface on at least one of the male and female ends when the threaded zones cooperate following self-locking make-up. 15. A threaded connection according to claim 14, wherein at least one sealing surface is axially spaced from the terminal surface of the male end by at least 3 millimeters. 16. A threaded connection according to claim 15, wherein the first and second sealing surfaces are respectively constituted by a domed surface on one and by a tapered surface on the other. 17. A threaded connection according to claim 16, wherein the domed surface has a generatrix with a radius of curvature in a range of 30 to 100 mm. 18. A threaded connection according to claim 16, wherein a tangent of a peak half-angle of the tapered surface is in a range of 0.025 to 0.075 mm. 19. A threaded connection according to claim 14, wherein a cooperation zone in interfering contact of the sealing surfaces is located below a taper line of the threaded zone of the male end. 20. A threaded connection according to claim 6, wherein the taper line angle is in a range between 5 degrees and 25 degrees. | A threaded connection has at least one male end threaded zone, and one female end threaded zone. A tooth width of the male threaded zone, CWT p , increases from CWT p min to CWT p max for the tooth closest to, and furthest from the terminal surface of the male end. A tooth width CWT b of the female threaded zone decreases from CWT b max to CWT b min for the tooth furthest from, and closest to, the terminal surface of the female end. At least one portion of the female threaded zone and at least one portion of the male threaded zone cooperate in accordance with self-locking make-up, with
CWT
p
min
CWT
b
max
≥
0.2
,
CWT
b
min
CWT
p
max
≤
CWT
p
min
CWT
b
max
,
CWR
p
max
≤
3
CWR
p
min
,
and
CWR
b
max
≤
3
CWR
b
min
.1: A threaded connection comprising:
a first and a second tubular component, with a respective male and female end, the male end including, on an external peripheral surface, at least one threaded zone and finishing in a terminal surface oriented radially with respect to an axis of the connection, the female end including, on an internal peripheral surface, at least one threaded zone and finishing in a terminal surface oriented radially with respect to the axis of the connection, wherein a width of the teeth of the male threaded zone, CWTp, increases from a value CWTpmin of a width of a tooth closest to the terminal surface of the male end to a value CWTpmax of a width of a tooth furthest from the terminal surface of the male end, and a width of valleys of the male threaded zone, CWRp, increases from a value CWRpmin of a width of a valley furthest from the terminal surface of the male end to a value CWRpmax of a width of a valley closest from said terminal surface, wherein a width of the teeth of the female threaded zone, CWTb, decreases from a value CWTbmax of a width of a tooth furthest from the terminal surface of the female end to a value CWTbmin of a width of a tooth closest to the terminal surface of the female end (8), and a width of valleys of the female threaded zone, CWRb, decreases from a value CWRbmax of a width of a valley closest to the terminal surface of the female end to a value CWRbmin of a width of a valley furthest from the terminal surface, and wherein at least one portion of the at least one threaded zone on the male end, and at least one portion of the at least one threaded zone on the female end cooperate in accordance with self-locking make-up, with
CWT
p
min
CWT
b
max
≥
0.2
,
CWT
b
min
CWT
p
max
≤
CWT
p
min
CWT
b
max
,
CWR
p
max
≤
3
CWR
p
min
,
and
CWR
b
max
≤
3
CWR
b
min
. 2. A threaded connection according to claim 1, wherein the ratio between the width, CWTpmin, of the tooth closest to the terminal surface of the male end and the width, CWTbmax, of the tooth furthest from the terminal surface of the female end is in the range 0.3 to 0.7. 3. A threaded connection according to claim 1, wherein at make-up at least the male threading tooth closest to the terminal surface is located in a run-out groove provided on the female end. 4. A threaded connection according to claim 3, wherein an inner diameter of the run-out groove is greater than an outer diameter of a last engaged tooth diameter, such that a critical cross-section of the connection system is a cross-section of the run-out groove. 5. A threaded connection according to claim 3, wherein a width of the run-out groove is configured to be at least 1.5 greater than a loading flank pitch. 6. A threaded connection according to claim 3, wherein a width of the run-out groove is configured to be at least:
L
F
P
b
+
(
I
C
W
-
(
L
F
P
b
-
S
F
P
b
)
)
+
(
L
F
H
+
L
F
P
b
TT
2
)
tan
15
°
where LFP is a loading flank pitch, ICW is an insert crest width, SFP is a stabbing flank pitch, LFH is a loading flank height, and TT is a taper line angle. 7. A threaded connection according to claim 1, wherein an outside collar diameter is configured based on both tension and torsion criteria at a critical cross-section. 8. A threaded connection according to claim 1, wherein at least a tooth furthest from a terminal surface is a vanishing tooth. 9. A threaded connection according to claim 8, wherein at least a male threading tooth furthest from the terminal surface of the male end is a vanishing tooth. 10. A threaded connection according to claim 1, wherein the male and female threaded zones have a taper generatrix forming an angle with the axis of the connection in a range between 1 degree and 5 degrees. 11. A threaded connection according to claim 1, wherein teeth of the male and female threaded zones have a dovetail profile. 12. A threaded connection according to claim 1, wherein crests of the teeth and roots of the valleys of the male and female threaded zones are parallel to the axis of the threaded connection. 13. A threaded connection according to claim 1, wherein a clearance h is provided between crests of the teeth of the male threaded zone and roots of the valleys of the female threaded zone. 14. A threaded connection according to claim 1, wherein at least one of the male and female ends comprises a first sealing surface to cooperate in interfering contact with a second sealing surface on at least one of the male and female ends when the threaded zones cooperate following self-locking make-up. 15. A threaded connection according to claim 14, wherein at least one sealing surface is axially spaced from the terminal surface of the male end by at least 3 millimeters. 16. A threaded connection according to claim 15, wherein the first and second sealing surfaces are respectively constituted by a domed surface on one and by a tapered surface on the other. 17. A threaded connection according to claim 16, wherein the domed surface has a generatrix with a radius of curvature in a range of 30 to 100 mm. 18. A threaded connection according to claim 16, wherein a tangent of a peak half-angle of the tapered surface is in a range of 0.025 to 0.075 mm. 19. A threaded connection according to claim 14, wherein a cooperation zone in interfering contact of the sealing surfaces is located below a taper line of the threaded zone of the male end. 20. A threaded connection according to claim 6, wherein the taper line angle is in a range between 5 degrees and 25 degrees. | 3,600 |
13,589 | 13,589 | 14,081,193 | 3,687 | In techniques for provisioning rules to manage user entitlements, a database maintains an association of a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups. An entitlement manager is implemented to receive provisioning rules that have been designated by the service groups to designate fulfillable entitlements that are associated with the purchased entitlements. The entitlement manager also utilizes a multi-dimensional vector space technique to generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the fulfillable entitlements for the consumer entity. | 1. A system, comprising:
a database configured to maintain an association of a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups; a processor to implement an entitlement manager that is configured to:
receive provisioning rules that have been designated by the one or more service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and
utilize a multi-dimensional vector space technique to generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 2. A system as recited in claim 1, wherein each of the service groups define the fulfillable entitlements for their respective products or services, and generate the provisioning rules. 3. A system as recited in claim 1, wherein a provisioning function of the multi-dimensional vector space technique is applied to determine the resultant allocations of the one or more fulfillable entitlements for the consumer entity, as designated in the entitlement model. 4. A system as recited in claim 1, wherein each of the purchased entitlements are modeled as a point in the multi-dimensional vector space, and each of the purchased entitlements are definable by a set of the one or more fulfillable entitlements. 5. A system as recited in claim 1, wherein the entitlement manager is configured to merge similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 6. A system as recited in claim 5, wherein said merge the similar ones of the fulfillable entitlements includes the entitlement manager configured to one of add the similar fulfillable entitlements, delete at least one of the similar fulfillable entitlements, or organize the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 7. A system as recited in claim 1, wherein the entitlement manager is configured to:
receive re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generate an update to the entitlement model for the consumer entity based on the re-provisioned rules. 8. A system as recited in claim 1, wherein the entitlement manager is configured to:
receive a granted entitlement that is allocated to the consumer entity, the granted entitlement overriding one or more of the fulfillable entitlements that are associated with a purchased entitlement; and generate an update to the entitlement model for the consumer entity based on the granted entitlement. 9. A system as recited in claim 1, wherein
the entitlement manager is configured to generate notifications for at least one of the consumer entity and one or more of the service groups, the notifications generated based on the resultant allocations of the one or more fulfillable entitlements for the consumer entity. 10. A method, comprising:
associating a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups; receiving provisioning rules that have been designated by the one or more service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and generating an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 11. A method as recited in claim 10, further comprising:
applying a provisioning function of a multi-dimensional vector space technique to determine the resultant allocations of the one or more fulfillable entitlements for the consumer entity, as designated in the entitlement model. 12. A method as recited in claim 10, further comprising:
merging similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 13. A method as recited in claim 12, wherein said merging comprises one of:
adding the similar fulfillable entitlements; deleting at least one of the similar fulfillable entitlements; or organizing the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 14. A method as recited in claim 10, further comprising:
receiving re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the re-provisioned rules. 15. A method as recited in claim 10, further comprising:
receiving a granted entitlement that is allocated to the consumer entity, the granted entitlement overriding one or more of the fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the granted entitlement. 16. A method as recited in claim 10, further comprising:
generating notifications for at least one of the consumer entity and one or more of the service groups, the notifications generated based on the resultant allocations of the one or more fulfillable entitlements for the consumer entity. 17. A computer-readable storage memory comprising an entitlement manager stored as instructions that are executable and, responsive to execution of the instructions by a computing device, the computing device performs operations of the entitlement manager comprising to:
associate a consumer entity with purchased entitlements that correspond to products or services purchased by the consumer entity from service groups; receive provisioning rules that have been designated by the service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 18. The computer-readable storage memory as recited in claim 17, wherein the computing device further performs operations of the entitlement manager comprising to merge similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 19. The computer-readable storage memory as recited in claim 18, wherein the computing device further performs operations of the entitlement manager to said merge the similar ones of the fulfillable entitlements comprising to:
add the similar fulfillable entitlements; delete at least one of the similar fulfillable entitlements; or organize the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 20. The computer-readable storage memory as recited in claim 17, wherein the computing device further performs operations of the entitlement manager comprising to:
receive re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the re-provisioned rules. | In techniques for provisioning rules to manage user entitlements, a database maintains an association of a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups. An entitlement manager is implemented to receive provisioning rules that have been designated by the service groups to designate fulfillable entitlements that are associated with the purchased entitlements. The entitlement manager also utilizes a multi-dimensional vector space technique to generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the fulfillable entitlements for the consumer entity.1. A system, comprising:
a database configured to maintain an association of a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups; a processor to implement an entitlement manager that is configured to:
receive provisioning rules that have been designated by the one or more service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and
utilize a multi-dimensional vector space technique to generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 2. A system as recited in claim 1, wherein each of the service groups define the fulfillable entitlements for their respective products or services, and generate the provisioning rules. 3. A system as recited in claim 1, wherein a provisioning function of the multi-dimensional vector space technique is applied to determine the resultant allocations of the one or more fulfillable entitlements for the consumer entity, as designated in the entitlement model. 4. A system as recited in claim 1, wherein each of the purchased entitlements are modeled as a point in the multi-dimensional vector space, and each of the purchased entitlements are definable by a set of the one or more fulfillable entitlements. 5. A system as recited in claim 1, wherein the entitlement manager is configured to merge similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 6. A system as recited in claim 5, wherein said merge the similar ones of the fulfillable entitlements includes the entitlement manager configured to one of add the similar fulfillable entitlements, delete at least one of the similar fulfillable entitlements, or organize the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 7. A system as recited in claim 1, wherein the entitlement manager is configured to:
receive re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generate an update to the entitlement model for the consumer entity based on the re-provisioned rules. 8. A system as recited in claim 1, wherein the entitlement manager is configured to:
receive a granted entitlement that is allocated to the consumer entity, the granted entitlement overriding one or more of the fulfillable entitlements that are associated with a purchased entitlement; and generate an update to the entitlement model for the consumer entity based on the granted entitlement. 9. A system as recited in claim 1, wherein
the entitlement manager is configured to generate notifications for at least one of the consumer entity and one or more of the service groups, the notifications generated based on the resultant allocations of the one or more fulfillable entitlements for the consumer entity. 10. A method, comprising:
associating a user identifier with one or more purchased entitlements that correspond to products or services purchased by a consumer entity from one or more service groups; receiving provisioning rules that have been designated by the one or more service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and generating an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 11. A method as recited in claim 10, further comprising:
applying a provisioning function of a multi-dimensional vector space technique to determine the resultant allocations of the one or more fulfillable entitlements for the consumer entity, as designated in the entitlement model. 12. A method as recited in claim 10, further comprising:
merging similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 13. A method as recited in claim 12, wherein said merging comprises one of:
adding the similar fulfillable entitlements; deleting at least one of the similar fulfillable entitlements; or organizing the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 14. A method as recited in claim 10, further comprising:
receiving re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the re-provisioned rules. 15. A method as recited in claim 10, further comprising:
receiving a granted entitlement that is allocated to the consumer entity, the granted entitlement overriding one or more of the fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the granted entitlement. 16. A method as recited in claim 10, further comprising:
generating notifications for at least one of the consumer entity and one or more of the service groups, the notifications generated based on the resultant allocations of the one or more fulfillable entitlements for the consumer entity. 17. A computer-readable storage memory comprising an entitlement manager stored as instructions that are executable and, responsive to execution of the instructions by a computing device, the computing device performs operations of the entitlement manager comprising to:
associate a consumer entity with purchased entitlements that correspond to products or services purchased by the consumer entity from service groups; receive provisioning rules that have been designated by the service groups to designate one or more fulfillable entitlements that are associated with the purchased entitlements; and generate an entitlement model that relates the purchased entitlements of the consumer entity, correlates the one or more fulfillable entitlements for the purchased entitlements, and identifies resultant allocations of the one or more fulfillable entitlements for the consumer entity. 18. The computer-readable storage memory as recited in claim 17, wherein the computing device further performs operations of the entitlement manager comprising to merge similar ones of the fulfillable entitlements that correspond to more than one of the purchased entitlements. 19. The computer-readable storage memory as recited in claim 18, wherein the computing device further performs operations of the entitlement manager to said merge the similar ones of the fulfillable entitlements comprising to:
add the similar fulfillable entitlements; delete at least one of the similar fulfillable entitlements; or organize the similar fulfillable entitlements as a single fulfillable entitlement for the consumer entity. 20. The computer-readable storage memory as recited in claim 17, wherein the computing device further performs operations of the entitlement manager comprising to:
receive re-provisioned rules from one of the service groups to alter the one or more fulfillable entitlements that are associated with a purchased entitlement; and generating an update to the entitlement model for the consumer entity based on the re-provisioned rules. | 3,600 |
13,590 | 13,590 | 15,257,234 | 3,631 | An air inflatable mattress and mattress coverlet are provided for the prevention and treatment of decubitus ulcers (i.e., pressure sores or bedsores). The mattress incorporates a user selectable static or alternating air powered support surface for more uniformly redistributing pressure exerted on a patient's skin. The mattress coverlet encompasses a low air loss feature independent of the mattress's user selectable air powered support surface. Such low air loss feature provides a patient contact surface exhibiting a high moisture vapor transfer ratio in conjunction with a forced air flow to aid in reducing the moisture and heat near the patient's body. Both the mattress and mattress coverlet are driven by an external control system which houses the user controls, as well as the necessary pumps, regulators, and valving. | 1-24. (canceled) 25. A method for the treatment and prevention of decubitus ulcers for a patient due to interface of such patient with an associated support surface, such method comprising:
placing adjacent a patient a first layer of vapor-permeable material; providing a second layer of non-crushable, three-dimensional material, adjacent and beneath such first layer of material, and forcing air flow through such second layer, so that moisture vapor and heat travels away from a patient's body through said first layer and via said second layer, to be carried away from the patient by such air flow, so as to reduce moisture and heat near a patient's skin. 26. A method as set forth in claim 25, further including exhausting such air flow from such second layer through at least one exhaust port adjacent an end of such second layer. 27. A method as set forth in claim 25, further comprising providing a third layer of a water-resistant, vapor-impermeable material, adjacent and below such second layer, for providing a protective boundary for an associated support surface therebeneath. 28. A method as set forth in claim 27, further including interconnecting such first and third layers to control billowing; 29. A method as set forth in claim 25, further including enclosing at least such first and second layers in a foam shell. 30. A method as set forth in claim 29, wherein:
such foam shell comprises a multi-piece foam shell comprising foam bolsters, a foam header, and a foam footer, and defining an internal cavity for housing a plurality of air cells for support of a patient; and said third layer further forms a zippered sheath for encasing said foam shell. 31. A method as set forth in claim 25, wherein said non-crushable, three-dimensional middle layer material comprises at least one of knit, cloth, polymeric film, foam, and extruded woven fibers. 32. A method as set forth in claim 25, further including perforations in said first layer to enhance said vapor-permeability thereof. | An air inflatable mattress and mattress coverlet are provided for the prevention and treatment of decubitus ulcers (i.e., pressure sores or bedsores). The mattress incorporates a user selectable static or alternating air powered support surface for more uniformly redistributing pressure exerted on a patient's skin. The mattress coverlet encompasses a low air loss feature independent of the mattress's user selectable air powered support surface. Such low air loss feature provides a patient contact surface exhibiting a high moisture vapor transfer ratio in conjunction with a forced air flow to aid in reducing the moisture and heat near the patient's body. Both the mattress and mattress coverlet are driven by an external control system which houses the user controls, as well as the necessary pumps, regulators, and valving.1-24. (canceled) 25. A method for the treatment and prevention of decubitus ulcers for a patient due to interface of such patient with an associated support surface, such method comprising:
placing adjacent a patient a first layer of vapor-permeable material; providing a second layer of non-crushable, three-dimensional material, adjacent and beneath such first layer of material, and forcing air flow through such second layer, so that moisture vapor and heat travels away from a patient's body through said first layer and via said second layer, to be carried away from the patient by such air flow, so as to reduce moisture and heat near a patient's skin. 26. A method as set forth in claim 25, further including exhausting such air flow from such second layer through at least one exhaust port adjacent an end of such second layer. 27. A method as set forth in claim 25, further comprising providing a third layer of a water-resistant, vapor-impermeable material, adjacent and below such second layer, for providing a protective boundary for an associated support surface therebeneath. 28. A method as set forth in claim 27, further including interconnecting such first and third layers to control billowing; 29. A method as set forth in claim 25, further including enclosing at least such first and second layers in a foam shell. 30. A method as set forth in claim 29, wherein:
such foam shell comprises a multi-piece foam shell comprising foam bolsters, a foam header, and a foam footer, and defining an internal cavity for housing a plurality of air cells for support of a patient; and said third layer further forms a zippered sheath for encasing said foam shell. 31. A method as set forth in claim 25, wherein said non-crushable, three-dimensional middle layer material comprises at least one of knit, cloth, polymeric film, foam, and extruded woven fibers. 32. A method as set forth in claim 25, further including perforations in said first layer to enhance said vapor-permeability thereof. | 3,600 |
13,591 | 13,591 | 10,537,636 | 3,695 | Provided is a technique for evaluating risk associated with underwriting an insurance policy (FIG. 1 ). At least one location to be covered under the insurance policy is received (FIG. 3 , block 320 ). Risk associated with the location is automatically assessed (FIG. 3 , block 338 ). It is determined whether to underwrite the location based on the assessed risk (FIG. 3 , block 340 ). Also provided is a technique for proximity analysis (FIG. 54 ). Selection of a proximity center is received (FIG. 55 ). A function is executed with the proximity center to determine target data items that fall within a proximity area around the proximity center. The target data items are spatially represented. | 1. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 2. The method of claim 1, wherein automatically assessing risk further comprises:
applying at least one business rule. 3. The method of claim 1, further comprising:
enabling selection of at least one of an underwriting analysis and a risk analysis. 4. The method of claim 1, further comprising:
enabling setup of an event that may impact assessment of risk. 5. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; receiving at least one location to be covered under the insurance policy; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating. 6. The method of claim 5, wherein ring details include a number of rings and ring distance between each of the rings. 7. The method of claim 5, wherein damage rate information is associated with each ring. 8. The method of claim 5, wherein the PML rating data includes an association of PML and CAP. 9. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving a name of the landmark, a location of the landmark, a CAP associated with the landmark, and a PML adjustment to the landmark; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 10. The method of claim 1, wherein a location may be selected by at least one of a company search, an address search, or uploading a file. 11. The method of claim 10, wherein selection of a location by company search further comprises:
receiving at least part of a company name; searching for the company name in a business data store; and retrieving at least one address from the searching. 12. The method of claim 11, further comprising:
determining that there are ambiguous addresses for the company name; and enabling selection of at least one of the addresses. 13. The method of claim 10, wherein selection of a location by an address search further comprises.
receiving a street address and at least one of a zip code and a city and state. 14. The method of claim 10, wherein selection of a location by uploading a file further comprises:
associating data in the file with a predefined format. 15. The method of claim 10, further comprising:
attempting to automatically geocode the selected location. 16. The method of claim 15, wherein the location can not be automatically geocoded and further comprising:
enabling use of a spatial interface to manually geocode the location. 17. The method of claim 1, wherein automatically assessing risk further comprises:
performing a proximity analysis. 18. The method of claim 1, wherein the rating results for at least one peril are capable of being displayed on a map. 19. The method of claim 1, further comprising:
enabling drilldown into details of at least a portion of the rating results 20. The method of claim 1, further comprising:
enabling exporting of the rating results. 21. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 22. The method of claim 21, further comprising:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 23. The method of claim 1, wherein assessing risk associated with the location further comprises:
assessing risk based on at least one of unbound policies and bound policies. 24. A computer-implemented method for proximity analysis, further comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 25. The method of claim 24, further comprising:
receiving proximity dimensions and a proximity analysis target data set. 26. The method of claim 25, wherein the target data items are identified from the target data set. 27. The method of claim 24, wherein the function is a user-specific function. 28. The method of claim 24, wherein the function may execute user-specific logic to calculate result data. 29. The method of claim 24, further comprising:
retrieving metadata for the user-specific function. 30. The method of claim 24, further comprising:
rendering the target data items within at least one proximity area associated with the proximity center; and overlaying the at least one proximity area with at least one area boundary. 31. The method of claim 24, wherein there are multiple proximity areas and wherein spatially representing the target data items further comprises:
displaying the target data items within the multiple proximity areas. 32. The method of claim 24, wherein the function is a first function and further comprising:
retrieving metadata for a second function that aggregates data in the target data set based on a proximity area in which the target data item falls. 33. The method of claim 32, further comprising:
executing the second function to obtain aggregated proximity analysis results. 34. The method of claim 33, further comprising:
retrieving metadata for a report that generates custom reports from the aggregated proximity analysis results; and creating the report. 35. The method of claim 34, further comprising:
displaying the report. 36. The method of claim 34, wherein the report comprises at least one of a summary report and a fill report. 37. The method of claim 24, wherein the proximity center is selected by at least one of an address selection, a latitude and longitude selection, and manual creation on a map. 38. The method of claim 24, wherein proximity analysis is performed for an event. 39. The method of claim 24, further comprising:
saving proximity analysis data by saving at least the proximity center, proximity area data, report data, and at least one spatial data layer. 40. The method of claim 39, further comprising:
enabling editing of the proximity analysis data. 41. A computer-implemented method for proximity analysis, further comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that fall within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. 42. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 43. The article of manufacture of claim 42, wherein the operations for automatically assessing risk further comprise:
applying at least one business rule. 44. The article of manufacture of claim 42, wherein the operations further comprise:
enabling selection of at least one of an underwriting analysis and a risk analysis. 45. The article of manufacture of claim 42, wherein the operations further comprise:
enabling setup of an event that may impact assessment of risk. 46. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
displaying a setup events screen to enable displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating. 47. The article of manufacture of claim 46, wherein ring details include a number of rings and ring distance between each of the rings. 48. The article of manufacture of claim 46, wherein damage rate information is associated with each ring. 49. The article of manufacture of claim 46, wherein the PML rating data includes an association of PML and CAP. 50. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving a name of the landmark, a location of the landmark a CAP associated with the landmark, and a PML adjustment to the landmark; receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 51. The article of manufacture of claim 42, wherein a location may be selected by at least one of a company search, an address search, or uploading a file. 52. The article of manufacture of claim 51, wherein the operations for selection of a location by company search further comprise:
receiving at least part of a company name; searching for the company name in a business data store; and retrieving at least one address from the searching. 53. The article of manufacture of claim 52, wherein the operations further comprise:
determining that there are ambiguous addresses for the company name; and enabling selection of at least one of the addresses. 54. The article of manufacture of claim 51, wherein the operations for selection of a location by an address search further comprise:
receiving a street address and at least one of a zip code and a city and state. 55. The article of manufacture of claim 51, wherein the operations for selection of a location by uploading a file further comprise:
associating data in the file with a predefined format. 56. The article of manufacture of claim 51, wherein the operations further comprise:
attempting to automatically geocode the selected location. 57. The article of manufacture of claim 56, wherein the location can not be automatically geocoded and wherein the operations further comprise:
enabling use of a spatial interface to manually geocode the location. 58. The article of manufacture of claim 42, wherein the operations for automatically assessing risk further comprise:
performing a proximity analysis. 59. The article of manufacture of claim 42, wherein the rating results for at least one peril are capable of being displayed on a map. 60. The article of manufacture of claim 59, wherein the operations further comprise.
enabling drilldown into details of at least a portion of the rating results 61. The article of manufacture of claim 59, wherein the operations further comprise:
enabling exporting of the rating results. 62. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 63. The article of manufacture of claim 62, wherein the operations further comprise:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 64. The article of manufacture of claim 42, wherein the operations for assessing risk associated with the location further comprise:
assessing risk based on at least one of unbound policies and bound policies. 65. A article of manufacture including a program for proximity analysis, wherein the program causes operations to be performed, the operations comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 66. The article of manufacture of claim 65, wherein the operations further comprise:
receiving proximity dimensions and a proximity analysis target data set. 67. The article of manufacture of claim 66, wherein the target data items are identified from the target data set. 68. The article of manufacture of claim 65, wherein the function is a user-specific function. 69. The article of manufacture of claim 65, wherein the function may execute user-specific logic to calculate result data. 70. The article of manufacture of claim 65, wherein the operations further comprise:
retrieving metadata for the user-specific function. 71. The article of manufacture of claim 65, wherein the operations further comprise:
rendering the target data items within at least one proximity area associated with the proximity center; and overlaying the at least one proximity area with at least one area boundary. 72. The article of manufacture of claim 65, wherein there are multiple proximity areas and wherein the operations for spatially representing the target data items further comprise:
displaying the target data items within the multiple proximity areas. 73. The article of manufacture of claim 65, wherein the function is a first function and wherein the operations further comprise:
retrieving metadata for a second function that aggregates data in the target data set based on a proximity area in which the target data item falls. 74. The article of manufacture of claim 73, wherein the operations further comprise:
executing the second function to obtain aggregated proximity analysis results. 75. The article of manufacture of claim 74, wherein the operations further comprise:
retrieving metadata for a report that generates custom reports from the aggregated proximity analysis results; and creating the report. 76. The article of manufacture of claim 75, wherein the operations further comprise:
displaying the report. 77. The article of manufacture of claim 75, wherein the report comprises at least one of a summary report and a full report. 78. The article of manufacture of claim 65, wherein the proximity center is selected by at least one of an address selection, a latitude and longitude selection, and manual creation on a map. 79. The article of manufacture of claim 65, wherein proximity analysis is performed for an event. 80. The article of manufacture of claim 65, wherein the operations further comprise:
saving proximity analysis data by saving at least the proximity center, proximity area data, report data, and at least one spatial data layer. 81. The article of manufacture of claim 80, wherein the operations further comprise:
enabling editing of the proximity analysis data. 82. An article of manufacture including a program for proximity analysis, wherein the program causes operations to be performed, the operations comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that full within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. 83. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 84. A computer system having logic for proximity analysis, wherein the logic is executed by the computer system, the logic comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 85. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; receiving at least one location to be covered under the insurance policy; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating data. 86. The article of manufacture of claim 85, wherein ring details include a number of rings and ring distance between each of the rings. 87. The article of manufacture of claim 85, wherein damage rate information is associated with each ring. 88. The article of manufacture of claim 85, wherein the PML rating data includes an association of PML and CAP. 89. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving name of the landmark a location of the landmark a CAP associated with the landmark, and a PML adjustment to the landmark; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 90. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 91. The computer system of claim 87, wherein the logic further comprises:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 92. Previously Presented) A computer system having logic for proximity analysis, wherein the logic is executed by the computer system, the logic comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that fall within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. | Provided is a technique for evaluating risk associated with underwriting an insurance policy (FIG. 1 ). At least one location to be covered under the insurance policy is received (FIG. 3 , block 320 ). Risk associated with the location is automatically assessed (FIG. 3 , block 338 ). It is determined whether to underwrite the location based on the assessed risk (FIG. 3 , block 340 ). Also provided is a technique for proximity analysis (FIG. 54 ). Selection of a proximity center is received (FIG. 55 ). A function is executed with the proximity center to determine target data items that fall within a proximity area around the proximity center. The target data items are spatially represented.1. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 2. The method of claim 1, wherein automatically assessing risk further comprises:
applying at least one business rule. 3. The method of claim 1, further comprising:
enabling selection of at least one of an underwriting analysis and a risk analysis. 4. The method of claim 1, further comprising:
enabling setup of an event that may impact assessment of risk. 5. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; receiving at least one location to be covered under the insurance policy; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating. 6. The method of claim 5, wherein ring details include a number of rings and ring distance between each of the rings. 7. The method of claim 5, wherein damage rate information is associated with each ring. 8. The method of claim 5, wherein the PML rating data includes an association of PML and CAP. 9. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving a name of the landmark, a location of the landmark, a CAP associated with the landmark, and a PML adjustment to the landmark; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 10. The method of claim 1, wherein a location may be selected by at least one of a company search, an address search, or uploading a file. 11. The method of claim 10, wherein selection of a location by company search further comprises:
receiving at least part of a company name; searching for the company name in a business data store; and retrieving at least one address from the searching. 12. The method of claim 11, further comprising:
determining that there are ambiguous addresses for the company name; and enabling selection of at least one of the addresses. 13. The method of claim 10, wherein selection of a location by an address search further comprises.
receiving a street address and at least one of a zip code and a city and state. 14. The method of claim 10, wherein selection of a location by uploading a file further comprises:
associating data in the file with a predefined format. 15. The method of claim 10, further comprising:
attempting to automatically geocode the selected location. 16. The method of claim 15, wherein the location can not be automatically geocoded and further comprising:
enabling use of a spatial interface to manually geocode the location. 17. The method of claim 1, wherein automatically assessing risk further comprises:
performing a proximity analysis. 18. The method of claim 1, wherein the rating results for at least one peril are capable of being displayed on a map. 19. The method of claim 1, further comprising:
enabling drilldown into details of at least a portion of the rating results 20. The method of claim 1, further comprising:
enabling exporting of the rating results. 21. A computer-implemented method for evaluating risk associated with underwriting an insurance policy, comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 22. The method of claim 21, further comprising:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 23. The method of claim 1, wherein assessing risk associated with the location further comprises:
assessing risk based on at least one of unbound policies and bound policies. 24. A computer-implemented method for proximity analysis, further comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 25. The method of claim 24, further comprising:
receiving proximity dimensions and a proximity analysis target data set. 26. The method of claim 25, wherein the target data items are identified from the target data set. 27. The method of claim 24, wherein the function is a user-specific function. 28. The method of claim 24, wherein the function may execute user-specific logic to calculate result data. 29. The method of claim 24, further comprising:
retrieving metadata for the user-specific function. 30. The method of claim 24, further comprising:
rendering the target data items within at least one proximity area associated with the proximity center; and overlaying the at least one proximity area with at least one area boundary. 31. The method of claim 24, wherein there are multiple proximity areas and wherein spatially representing the target data items further comprises:
displaying the target data items within the multiple proximity areas. 32. The method of claim 24, wherein the function is a first function and further comprising:
retrieving metadata for a second function that aggregates data in the target data set based on a proximity area in which the target data item falls. 33. The method of claim 32, further comprising:
executing the second function to obtain aggregated proximity analysis results. 34. The method of claim 33, further comprising:
retrieving metadata for a report that generates custom reports from the aggregated proximity analysis results; and creating the report. 35. The method of claim 34, further comprising:
displaying the report. 36. The method of claim 34, wherein the report comprises at least one of a summary report and a fill report. 37. The method of claim 24, wherein the proximity center is selected by at least one of an address selection, a latitude and longitude selection, and manual creation on a map. 38. The method of claim 24, wherein proximity analysis is performed for an event. 39. The method of claim 24, further comprising:
saving proximity analysis data by saving at least the proximity center, proximity area data, report data, and at least one spatial data layer. 40. The method of claim 39, further comprising:
enabling editing of the proximity analysis data. 41. A computer-implemented method for proximity analysis, further comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that fall within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. 42. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 43. The article of manufacture of claim 42, wherein the operations for automatically assessing risk further comprise:
applying at least one business rule. 44. The article of manufacture of claim 42, wherein the operations further comprise:
enabling selection of at least one of an underwriting analysis and a risk analysis. 45. The article of manufacture of claim 42, wherein the operations further comprise:
enabling setup of an event that may impact assessment of risk. 46. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
displaying a setup events screen to enable displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating. 47. The article of manufacture of claim 46, wherein ring details include a number of rings and ring distance between each of the rings. 48. The article of manufacture of claim 46, wherein damage rate information is associated with each ring. 49. The article of manufacture of claim 46, wherein the PML rating data includes an association of PML and CAP. 50. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving a name of the landmark, a location of the landmark a CAP associated with the landmark, and a PML adjustment to the landmark; receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 51. The article of manufacture of claim 42, wherein a location may be selected by at least one of a company search, an address search, or uploading a file. 52. The article of manufacture of claim 51, wherein the operations for selection of a location by company search further comprise:
receiving at least part of a company name; searching for the company name in a business data store; and retrieving at least one address from the searching. 53. The article of manufacture of claim 52, wherein the operations further comprise:
determining that there are ambiguous addresses for the company name; and enabling selection of at least one of the addresses. 54. The article of manufacture of claim 51, wherein the operations for selection of a location by an address search further comprise:
receiving a street address and at least one of a zip code and a city and state. 55. The article of manufacture of claim 51, wherein the operations for selection of a location by uploading a file further comprise:
associating data in the file with a predefined format. 56. The article of manufacture of claim 51, wherein the operations further comprise:
attempting to automatically geocode the selected location. 57. The article of manufacture of claim 56, wherein the location can not be automatically geocoded and wherein the operations further comprise:
enabling use of a spatial interface to manually geocode the location. 58. The article of manufacture of claim 42, wherein the operations for automatically assessing risk further comprise:
performing a proximity analysis. 59. The article of manufacture of claim 42, wherein the rating results for at least one peril are capable of being displayed on a map. 60. The article of manufacture of claim 59, wherein the operations further comprise.
enabling drilldown into details of at least a portion of the rating results 61. The article of manufacture of claim 59, wherein the operations further comprise:
enabling exporting of the rating results. 62. An article of manufacture including a program for evaluating risk associated with underwriting an insurance policy, wherein the program causes operations to be performed, the operations comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 63. The article of manufacture of claim 62, wherein the operations further comprise:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 64. The article of manufacture of claim 42, wherein the operations for assessing risk associated with the location further comprise:
assessing risk based on at least one of unbound policies and bound policies. 65. A article of manufacture including a program for proximity analysis, wherein the program causes operations to be performed, the operations comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 66. The article of manufacture of claim 65, wherein the operations further comprise:
receiving proximity dimensions and a proximity analysis target data set. 67. The article of manufacture of claim 66, wherein the target data items are identified from the target data set. 68. The article of manufacture of claim 65, wherein the function is a user-specific function. 69. The article of manufacture of claim 65, wherein the function may execute user-specific logic to calculate result data. 70. The article of manufacture of claim 65, wherein the operations further comprise:
retrieving metadata for the user-specific function. 71. The article of manufacture of claim 65, wherein the operations further comprise:
rendering the target data items within at least one proximity area associated with the proximity center; and overlaying the at least one proximity area with at least one area boundary. 72. The article of manufacture of claim 65, wherein there are multiple proximity areas and wherein the operations for spatially representing the target data items further comprise:
displaying the target data items within the multiple proximity areas. 73. The article of manufacture of claim 65, wherein the function is a first function and wherein the operations further comprise:
retrieving metadata for a second function that aggregates data in the target data set based on a proximity area in which the target data item falls. 74. The article of manufacture of claim 73, wherein the operations further comprise:
executing the second function to obtain aggregated proximity analysis results. 75. The article of manufacture of claim 74, wherein the operations further comprise:
retrieving metadata for a report that generates custom reports from the aggregated proximity analysis results; and creating the report. 76. The article of manufacture of claim 75, wherein the operations further comprise:
displaying the report. 77. The article of manufacture of claim 75, wherein the report comprises at least one of a summary report and a full report. 78. The article of manufacture of claim 65, wherein the proximity center is selected by at least one of an address selection, a latitude and longitude selection, and manual creation on a map. 79. The article of manufacture of claim 65, wherein proximity analysis is performed for an event. 80. The article of manufacture of claim 65, wherein the operations further comprise:
saving proximity analysis data by saving at least the proximity center, proximity area data, report data, and at least one spatial data layer. 81. The article of manufacture of claim 80, wherein the operations further comprise:
enabling editing of the proximity analysis data. 82. An article of manufacture including a program for proximity analysis, wherein the program causes operations to be performed, the operations comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that full within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. 83. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
receiving one or more locations to be covered under the insurance policy; and automatically assessing risk associated with the one or more locations, including generating rating results for one or more perils, wherein the rating results indicate whether that peril may occur at each of the one or more locations. 84. A computer system having logic for proximity analysis, wherein the logic is executed by the computer system, the logic comprising:
receiving selection of a proximity center, wherein the proximity center comprises a location; executing a function with the proximity center to determine target data items that fall within one or more proximity areas around the proximity center; and spatially representing the target data items. 85. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
displaying a setup events screen to enable setup of an event that may impact assessment of risk; receiving an event type; receiving at least one of ring details, damage rate information, and PML rating data; receiving at least one location to be covered under the insurance policy; and automatically assessing risk associated with the location based on the event type and the received at least one of ring details, damage rate information, and PML rating data. 86. The article of manufacture of claim 85, wherein ring details include a number of rings and ring distance between each of the rings. 87. The article of manufacture of claim 85, wherein damage rate information is associated with each ring. 88. The article of manufacture of claim 85, wherein the PML rating data includes an association of PML and CAP. 89. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
displaying a setup landmarks screen to enable setup of a landmark; receiving name of the landmark a location of the landmark a CAP associated with the landmark, and a PML adjustment to the landmark; automatically assessing risk associated with the location based on the CAP and PML adjustment; and displaying rating results for the location for one or more perils. 90. A computer system having logic for evaluating risk associated with underwriting an insurance policy, wherein the logic is executed by the computer system, the logic comprising:
receiving at least one location to be covered under the insurance policy; automatically assessing risk associated with the location for at least one peril by performing PML calculations for the peril at the location; and providing rating results for the location and the at least one peril. 91. The computer system of claim 87, wherein the logic further comprises:
receiving insurance policy details; receiving location details for one location associated with the insurance policy details; and generating PML results for the location. 92. Previously Presented) A computer system having logic for proximity analysis, wherein the logic is executed by the computer system, the logic comprising:
receiving selection of a proximity center; executing a function with the proximity center to determine target data items that fall within a proximity area around the proximity center; and spatially representing the target data items; wherein the proximity center comprises a landmark and proximity areas comprise rings encircling the landmark. | 3,600 |
13,592 | 13,592 | 14,866,562 | 3,687 | Innovations for computer-aided data visualizations are presented. A computer-aided data visualization is generated from data representing a plurality of measures. Example computer-aided data visualizations include a first enhanced graphical element. The first enhanced graphical element conveys information regarding a first derived measure, a first intrinsic measure, and a second derived measure or a second intrinsic measure from among the plurality of measures. | 1. One or more computer-readable storage media storing computer-executable instructions for:
receiving data representing a plurality of measures; and generating a data visualization comprising at least a first enhanced graphical element conveying information regarding a first derived measure, a first intrinsic measure, and a second derived measure or a second intrinsic measure among the plurality of measures. 2. The computer-readable storage media of claim 1, wherein conveying information comprises shading, coloring, sizing, or shaping the first enhanced graphical element. 3. The computer-readable storage media of claim 1, wherein the data visualization further comprises at least a second enhanced graphical element, and the placement of the first enhanced graphical element relative to the second enhanced graphical conveys information regarding a measure or dimension of the data. 4. The computer-readable storage media of claim 1, wherein the data visualization conveys an affinity analysis. 5. The computer-readable storage media of claim 4, wherein the first enhanced graphical element represents an association rule and is sized to represent total cost of a plurality of products in the association rule. 6. The computer-readable storage media of claim 4, wherein the first enhanced graphical element comprises a plurality of subsections, each of the plurality of subsections representing a product included in an association rule and sized relative to the other subsections of the plurality of subsections to convey the relative magnitude of individual product cost. 7. The computer-readable storage media of claim 6, wherein the subsections are further visually distinguished from one another though color, shading, patterning, and/or shape. 8. The computer-readable storage media of claim 1, wherein the first enhanced graphical element is positioned on the visualization to convey lift of an association rule. 9. The computer-readable storage media of claim 1, further comprising enlarging a portion of the visualization in response to user input. 10. The computer-readable storage media of claim 1, wherein the visualization conveys loss-of-sales resulting from a stock shortage. 11. The computer-readable storage media of claim 10, wherein the first enhanced graphical element comprises a bar conveying a quantity of actual stock, a quantity of forecasted stock, and a quantity of shortage of stock. 12. The computer-readable storage media of claim 11, further comprising a second enhanced graphical element comprises a bar conveying an amount of actual sales, an amount of possible sales, and an amount of lost sales. 13. The computer-readable storage media of claim 12, further comprising an axis representing product identity, the first and second enhanced graphical elements being positioned proximate one another and the axis such that the visualization conveys sales and stock data for particular products. 14. The computer-readable storage media of claim 12 wherein the first and second enhanced graphical elements are each associated with an axis and both axes convey increasing values relative to a common reference point. 15. The computer-readable storage media of claim 1, further comprising cycling through displaying a series of numerical values associated with the first enhanced graphical element in response to user input. 16. The computer-readable storage media of claim 1, further comprising calculating a derived measure from the data. 17. The computer-readable storage media of claim 1, wherein generating a data visualization is carried out by a visualization engine in communication with a flow control module, the flow control module in communication with a calculation engine, the calculation engine in communication with one or more of metadata storage, an online analytical processing database, and a relational database management system. 18. The computer-readable storage media of claim 17, wherein the flow control module receives queries from the visualization engine, forwards the queries to the calculation engine, and forwards formatted results of the queries to the visualization engine. 19. A computer system comprising a processor and memory that implements an affinity analysis visualization system, the affinity analysis visualization system comprising:
a data repository that stores a plurality of data members, the data members comprising measures associated with the data, including individual product cost of each of a plurality of products; and a visualization engine that generates a visualization display comprising an enhanced graphical element representing an association rule, the enhanced graphical element being sized to represent total cost of a plurality of products in the association rule and comprising a plurality of visually distinguished subsections, each visually distinguished subsection being sized to represent relative value to total association rule value provided by the respective products from the plurality of products in the association rule, the enhanced graphical element being positioned on the visualization display to convey lift of the association rule. 20. A computer-implemented method of visualizing loss-of-sales, the method comprising:
receiving data representing, for each of a plurality of products, an amount of actual sales, an amount of possible sales, an actual stock quantity, and a forecasted stock quantity; and generating a data visualization comprising a first enhanced graphical element conveying information for a product of the plurality of products regarding actual sales, possible sales, and lost sales, and a second enhanced graphical element conveying information for the product regarding actual stock, forecasted stock, and stock shortage. | Innovations for computer-aided data visualizations are presented. A computer-aided data visualization is generated from data representing a plurality of measures. Example computer-aided data visualizations include a first enhanced graphical element. The first enhanced graphical element conveys information regarding a first derived measure, a first intrinsic measure, and a second derived measure or a second intrinsic measure from among the plurality of measures.1. One or more computer-readable storage media storing computer-executable instructions for:
receiving data representing a plurality of measures; and generating a data visualization comprising at least a first enhanced graphical element conveying information regarding a first derived measure, a first intrinsic measure, and a second derived measure or a second intrinsic measure among the plurality of measures. 2. The computer-readable storage media of claim 1, wherein conveying information comprises shading, coloring, sizing, or shaping the first enhanced graphical element. 3. The computer-readable storage media of claim 1, wherein the data visualization further comprises at least a second enhanced graphical element, and the placement of the first enhanced graphical element relative to the second enhanced graphical conveys information regarding a measure or dimension of the data. 4. The computer-readable storage media of claim 1, wherein the data visualization conveys an affinity analysis. 5. The computer-readable storage media of claim 4, wherein the first enhanced graphical element represents an association rule and is sized to represent total cost of a plurality of products in the association rule. 6. The computer-readable storage media of claim 4, wherein the first enhanced graphical element comprises a plurality of subsections, each of the plurality of subsections representing a product included in an association rule and sized relative to the other subsections of the plurality of subsections to convey the relative magnitude of individual product cost. 7. The computer-readable storage media of claim 6, wherein the subsections are further visually distinguished from one another though color, shading, patterning, and/or shape. 8. The computer-readable storage media of claim 1, wherein the first enhanced graphical element is positioned on the visualization to convey lift of an association rule. 9. The computer-readable storage media of claim 1, further comprising enlarging a portion of the visualization in response to user input. 10. The computer-readable storage media of claim 1, wherein the visualization conveys loss-of-sales resulting from a stock shortage. 11. The computer-readable storage media of claim 10, wherein the first enhanced graphical element comprises a bar conveying a quantity of actual stock, a quantity of forecasted stock, and a quantity of shortage of stock. 12. The computer-readable storage media of claim 11, further comprising a second enhanced graphical element comprises a bar conveying an amount of actual sales, an amount of possible sales, and an amount of lost sales. 13. The computer-readable storage media of claim 12, further comprising an axis representing product identity, the first and second enhanced graphical elements being positioned proximate one another and the axis such that the visualization conveys sales and stock data for particular products. 14. The computer-readable storage media of claim 12 wherein the first and second enhanced graphical elements are each associated with an axis and both axes convey increasing values relative to a common reference point. 15. The computer-readable storage media of claim 1, further comprising cycling through displaying a series of numerical values associated with the first enhanced graphical element in response to user input. 16. The computer-readable storage media of claim 1, further comprising calculating a derived measure from the data. 17. The computer-readable storage media of claim 1, wherein generating a data visualization is carried out by a visualization engine in communication with a flow control module, the flow control module in communication with a calculation engine, the calculation engine in communication with one or more of metadata storage, an online analytical processing database, and a relational database management system. 18. The computer-readable storage media of claim 17, wherein the flow control module receives queries from the visualization engine, forwards the queries to the calculation engine, and forwards formatted results of the queries to the visualization engine. 19. A computer system comprising a processor and memory that implements an affinity analysis visualization system, the affinity analysis visualization system comprising:
a data repository that stores a plurality of data members, the data members comprising measures associated with the data, including individual product cost of each of a plurality of products; and a visualization engine that generates a visualization display comprising an enhanced graphical element representing an association rule, the enhanced graphical element being sized to represent total cost of a plurality of products in the association rule and comprising a plurality of visually distinguished subsections, each visually distinguished subsection being sized to represent relative value to total association rule value provided by the respective products from the plurality of products in the association rule, the enhanced graphical element being positioned on the visualization display to convey lift of the association rule. 20. A computer-implemented method of visualizing loss-of-sales, the method comprising:
receiving data representing, for each of a plurality of products, an amount of actual sales, an amount of possible sales, an actual stock quantity, and a forecasted stock quantity; and generating a data visualization comprising a first enhanced graphical element conveying information for a product of the plurality of products regarding actual sales, possible sales, and lost sales, and a second enhanced graphical element conveying information for the product regarding actual stock, forecasted stock, and stock shortage. | 3,600 |
13,593 | 13,593 | 14,795,513 | 3,624 | According to some embodiments, a system and method include an event module operative to receive a schedule and transmit an event; a crew tracking module to receive an output from the event module, the crew tracking module operative to: track and update a status of individual crew members assigned to each event, and transmit a crew status update to the event module; a crew analytics module to receive an output from the crew tracking module, the crew analytics module operative to: predict work disruptions; a memory for storing program instructions; at least one work disruption platform processor, coupled to the memory, and in communication with the event module, the crew tracking module, the crew analytics module, and operative to execute program instructions to: estimate, via the crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyze, via the crew analytics module, the data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a determined derived disruption associated with the event, and a crew rules violation, via the crew analytics module, to determine if one or more predicted work disruptions exist; and generate, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. Numerous other aspects are provided. | 1. A system comprising:
an event module operative to receive a schedule and transmit an event; a crew tracking module to receive an output from the event module, the crew tracking module operative to:
track and update a status of individual crew members assigned to each event, and
transmit a crew status update to the event module;
a crew analytics module to receive an output from the crew tracking module, the crew analytics module operative to:
predict work disruptions;
a memory for storing program instructions; at least one work disruption platform processor, coupled to the memory, and in communication with the event module, the crew tracking module, the crew analytics module, and operative to execute program instructions to:
estimate, via the crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members;
analyze, via the crew analytics module, the data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a determined derived disruption associated with the event, and a crew rules violation, via the crew analytics module, to determine if one or more predicted work disruptions exist; and
generate, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 2. The system of claim 1, wherein the historical event is of a same event type as the transmitted event. 3. The system of claim 1, wherein the crew analytics module determines a derived disruption associated with the event based on a causal analysis. 4. The system of claim 3, wherein the determined derived disruption associated with the event is a result of an earlier disruption. 5. The system of claim 1, further comprising:
a crew rules module to receive an output from the crew tracking module, the crew rules module operative to determine if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 6. The system of claim 5, further comprising:
a crew recovery module to receive an output from at least one of the crew analytics module and the crew rules module, the crew recovery module operative to generate a recovery solution in response to at least one of a predicted work disruption, a fatigue risk and a rules violation. 7. The system of claim 1, wherein the event is at least one of a flight departure, a flight arrival, an aircraft loading, a crew reporting for duty. 8. The system of claim 1, wherein the event module is a simulation module, and the event is a simulated event. 9. A method comprising:
receiving, at an event module, a schedule and transmitting an event; receiving, at a crew tracking module, the schedule and the event, and tracking and updating a status of individual crew members assigned to each event; estimating, via a crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyzing, via the crew analytics module, data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a crew rules violation, and a determined derived disruption associated with the event, to determine if one or more predicted work disruptions exist; and generating, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 10. The method of claim 9, wherein the historical event is of a same event type as the transmitted event. 11. The method of claim 9, further comprising:
determining the derived disruption associated with the event based on causal analysis. 12. The method of claim 9, further comprising:
receiving, at a crew rules module, an output from the crew tracking module; and determining if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 13. The method of claim 12, further comprising:
generating a recovery solution in response to at least one of a predicted work disruption, a fatigue risk and a rules violation. 14. The method of claim 13, further comprising:
selecting one of approving and rejecting the recovery solution. 15. The method of claim 14, further comprising:
providing the approved recovery solution to the event module. 16. The method of claim 13, wherein the recovery solution generation is iterative until one of the generated recovery solution is approved or a user-defined limit is reached. 17. The method of claim 9, wherein the event module is a simulation module, and the event is a simulated event. 18. A non-transitory, computer-readable medium storing instructions that, when executed by a work disruption platform processor cause the work disruption platform processor to perform a method associated with work disruptions, the method comprising:
receiving, at an event module, a schedule and transmitting an event; receiving, at a crew tracking module, the schedule and the event, and tracking and updating a status of individual crew members assigned to each event; estimating, via a crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyzing, via the crew analytics module, data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a crew rules violation, and a determined derived disruption associated with the event, to determine if one or more predicted work disruptions exist; and generating, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 19. The medium of claim 18, wherein the historical event is of a same event type as the transmitted event. 20. The medium of claim 18, wherein determining the derived disruption further comprises:
determining the derived disruption associated with the event based on causal analysis. 21. The medium of claim 20, wherein application of the work disruption platform processor further comprises:
receiving, at a crew rules module, an output from the crew tracking module; and determining if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 22. The medium of claim 18, wherein the event module is a simulation module, and the event is a simulated event. | According to some embodiments, a system and method include an event module operative to receive a schedule and transmit an event; a crew tracking module to receive an output from the event module, the crew tracking module operative to: track and update a status of individual crew members assigned to each event, and transmit a crew status update to the event module; a crew analytics module to receive an output from the crew tracking module, the crew analytics module operative to: predict work disruptions; a memory for storing program instructions; at least one work disruption platform processor, coupled to the memory, and in communication with the event module, the crew tracking module, the crew analytics module, and operative to execute program instructions to: estimate, via the crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyze, via the crew analytics module, the data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a determined derived disruption associated with the event, and a crew rules violation, via the crew analytics module, to determine if one or more predicted work disruptions exist; and generate, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. Numerous other aspects are provided.1. A system comprising:
an event module operative to receive a schedule and transmit an event; a crew tracking module to receive an output from the event module, the crew tracking module operative to:
track and update a status of individual crew members assigned to each event, and
transmit a crew status update to the event module;
a crew analytics module to receive an output from the crew tracking module, the crew analytics module operative to:
predict work disruptions;
a memory for storing program instructions; at least one work disruption platform processor, coupled to the memory, and in communication with the event module, the crew tracking module, the crew analytics module, and operative to execute program instructions to:
estimate, via the crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members;
analyze, via the crew analytics module, the data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a determined derived disruption associated with the event, and a crew rules violation, via the crew analytics module, to determine if one or more predicted work disruptions exist; and
generate, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 2. The system of claim 1, wherein the historical event is of a same event type as the transmitted event. 3. The system of claim 1, wherein the crew analytics module determines a derived disruption associated with the event based on a causal analysis. 4. The system of claim 3, wherein the determined derived disruption associated with the event is a result of an earlier disruption. 5. The system of claim 1, further comprising:
a crew rules module to receive an output from the crew tracking module, the crew rules module operative to determine if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 6. The system of claim 5, further comprising:
a crew recovery module to receive an output from at least one of the crew analytics module and the crew rules module, the crew recovery module operative to generate a recovery solution in response to at least one of a predicted work disruption, a fatigue risk and a rules violation. 7. The system of claim 1, wherein the event is at least one of a flight departure, a flight arrival, an aircraft loading, a crew reporting for duty. 8. The system of claim 1, wherein the event module is a simulation module, and the event is a simulated event. 9. A method comprising:
receiving, at an event module, a schedule and transmitting an event; receiving, at a crew tracking module, the schedule and the event, and tracking and updating a status of individual crew members assigned to each event; estimating, via a crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyzing, via the crew analytics module, data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a crew rules violation, and a determined derived disruption associated with the event, to determine if one or more predicted work disruptions exist; and generating, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 10. The method of claim 9, wherein the historical event is of a same event type as the transmitted event. 11. The method of claim 9, further comprising:
determining the derived disruption associated with the event based on causal analysis. 12. The method of claim 9, further comprising:
receiving, at a crew rules module, an output from the crew tracking module; and determining if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 13. The method of claim 12, further comprising:
generating a recovery solution in response to at least one of a predicted work disruption, a fatigue risk and a rules violation. 14. The method of claim 13, further comprising:
selecting one of approving and rejecting the recovery solution. 15. The method of claim 14, further comprising:
providing the approved recovery solution to the event module. 16. The method of claim 13, wherein the recovery solution generation is iterative until one of the generated recovery solution is approved or a user-defined limit is reached. 17. The method of claim 9, wherein the event module is a simulation module, and the event is a simulated event. 18. A non-transitory, computer-readable medium storing instructions that, when executed by a work disruption platform processor cause the work disruption platform processor to perform a method associated with work disruptions, the method comprising:
receiving, at an event module, a schedule and transmitting an event; receiving, at a crew tracking module, the schedule and the event, and tracking and updating a status of individual crew members assigned to each event; estimating, via a crew analytics module, a fatigue level of at least one of the individual crew members and a group of the individual crew members; analyzing, via the crew analytics module, data associated with at least one of the fatigue level of at least one of the individual crew members, one or more historical events, a crew rules violation, and a determined derived disruption associated with the event, to determine if one or more predicted work disruptions exist; and generating, via the crew analytics module, an indication of one or more predicted work disruptions based on one or more determined predicted work disruptions. 19. The medium of claim 18, wherein the historical event is of a same event type as the transmitted event. 20. The medium of claim 18, wherein determining the derived disruption further comprises:
determining the derived disruption associated with the event based on causal analysis. 21. The medium of claim 20, wherein application of the work disruption platform processor further comprises:
receiving, at a crew rules module, an output from the crew tracking module; and determining if the status of individual crew members poses at least one of a fatigue risk and a rules violation. 22. The medium of claim 18, wherein the event module is a simulation module, and the event is a simulated event. | 3,600 |
13,594 | 13,594 | 14,579,606 | 3,681 | In some example embodiments, for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource is received, with each one of the plurality of advertisements corresponding to a different advertiser. For each one of the plurality of advertisements, a corresponding handicap value is determined independent of the corresponding original bid. For each one of the plurality of advertisements, a corresponding effective bid for the online resource is determined based on the corresponding original bid and the corresponding handicap value. One of the plurality of advertisements is selected based on the effective bids of the plurality of advertisements. The selected one of the plurality of advertisements is assigned, in a database, to the online resource. The selected one of the plurality of advertisements is caused to be displayed on a computing device in response to a user-generated interrupt received from the computing device. | 1. A system comprising:
a processor-implemented bid reception module configured to, for each one of a plurality of advertisements, receive a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; a processor-implemented handicap determination module configured to, for each one of the plurality of advertisements, determine a corresponding handicap value independent of the corresponding original bid; a processor-implemented effective bid module, executable by the at least one processor, configure to, for each one of the plurality of advertisements, determine a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; and a processor-implemented resource assignment module configured to:
select one of the plurality of advertisements based on the effective bids of the plurality of advertisements;
assign, in a database, the selected one of the plurality of advertisements to the online resource; and
cause the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 2. The system of claim 1, wherein the handicap determination module is further configured to:
determine corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; store the handicap values in the database in association with their corresponding categories; and determine the corresponding handicap values for each one of the plurality of advertisements by:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 3. The system of claim 1, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 4. The system of claim 1, wherein the resource assignment module is further configured to:
rank the plurality of advertisements based on their corresponding effective bids; determine a highest ranking advertisement of the plurality of advertisements, and assign the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 5. The system of claim 4, further comprising a payment determination module configured to:
determine a second highest ranking advertisement of the plurality of advertisements; determine a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assign, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 6. The system of claim 5, wherein the payment determination module is configured to determine the payment price by calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. 7. The system of claim 1, wherein each effective bid is determined based on a subtraction of the corresponding handicap value from the corresponding original bid. 8. A computer-implemented method comprising:
for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; for each one of the plurality of advertisements, determining a corresponding handicap value independent of the corresponding original bid; for each one of the plurality of advertisements, determining, by a machine having a memory and at least one processor, a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; selecting one of the plurality of advertisements based on the effective bids of the plurality of advertisements; assigning, in a database, the selected one of the plurality of advertisements to the online resource; and causing the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 9. The method of claim 8, further comprising:
determining corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; and storing the handicap values in the database in association with their corresponding categories, wherein determining the corresponding handicap values for each one of the plurality of advertisements comprises:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 10. The method of claim 8, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 11. The method of claim 8, wherein the assigning comprises:
ranking the plurality of advertisements based on their corresponding effective bids; determining a highest ranking advertisement of the plurality of advertisements, and assigning the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 12. The method of claim 11, further comprising:
determining a second highest ranking advertisement of the plurality of advertisements; determining a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assigning, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 13. The method of claim 12, wherein determining the payment price comprises calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. 14. The method of claim 8, wherein each effective bid is determined based on a subtraction of the corresponding handicap value from the corresponding original bid. 15. A non-transitory machine-readable storage medium storing a set of instructions that, when executed by at least one processor, causes the at least one processor to perform operations comprising:
for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; for each one of the plurality of advertisements, determining a corresponding handicap value independent of the corresponding original bid; for each one of the plurality of advertisements, determining a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; selecting one of the plurality of advertisements based on the effective bids of the plurality of advertisements; assigning, in a database, the selected one of the plurality of advertisements to the online resource; and causing the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 16. The storage medium of claim 15, wherein the operations further comprise:
determining corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; and storing the handicap values in the database in association with their corresponding categories, wherein determining the corresponding handicap values for each one of the plurality of advertisements comprises:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 17. The storage medium of claim 15, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 18. The storage medium of claim 15, wherein the assigning comprises:
ranking the plurality of advertisements based on their corresponding effective bids; determining a highest ranking advertisement of the plurality of advertisements, and assigning the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 19. The storage medium of claim 18, wherein the operations further comprise:
determining a second highest ranking advertisement of the plurality of advertisements; determining a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assigning, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 20. The storage medium of claim 19, wherein determining the payment price comprises calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. | In some example embodiments, for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource is received, with each one of the plurality of advertisements corresponding to a different advertiser. For each one of the plurality of advertisements, a corresponding handicap value is determined independent of the corresponding original bid. For each one of the plurality of advertisements, a corresponding effective bid for the online resource is determined based on the corresponding original bid and the corresponding handicap value. One of the plurality of advertisements is selected based on the effective bids of the plurality of advertisements. The selected one of the plurality of advertisements is assigned, in a database, to the online resource. The selected one of the plurality of advertisements is caused to be displayed on a computing device in response to a user-generated interrupt received from the computing device.1. A system comprising:
a processor-implemented bid reception module configured to, for each one of a plurality of advertisements, receive a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; a processor-implemented handicap determination module configured to, for each one of the plurality of advertisements, determine a corresponding handicap value independent of the corresponding original bid; a processor-implemented effective bid module, executable by the at least one processor, configure to, for each one of the plurality of advertisements, determine a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; and a processor-implemented resource assignment module configured to:
select one of the plurality of advertisements based on the effective bids of the plurality of advertisements;
assign, in a database, the selected one of the plurality of advertisements to the online resource; and
cause the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 2. The system of claim 1, wherein the handicap determination module is further configured to:
determine corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; store the handicap values in the database in association with their corresponding categories; and determine the corresponding handicap values for each one of the plurality of advertisements by:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 3. The system of claim 1, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 4. The system of claim 1, wherein the resource assignment module is further configured to:
rank the plurality of advertisements based on their corresponding effective bids; determine a highest ranking advertisement of the plurality of advertisements, and assign the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 5. The system of claim 4, further comprising a payment determination module configured to:
determine a second highest ranking advertisement of the plurality of advertisements; determine a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assign, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 6. The system of claim 5, wherein the payment determination module is configured to determine the payment price by calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. 7. The system of claim 1, wherein each effective bid is determined based on a subtraction of the corresponding handicap value from the corresponding original bid. 8. A computer-implemented method comprising:
for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; for each one of the plurality of advertisements, determining a corresponding handicap value independent of the corresponding original bid; for each one of the plurality of advertisements, determining, by a machine having a memory and at least one processor, a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; selecting one of the plurality of advertisements based on the effective bids of the plurality of advertisements; assigning, in a database, the selected one of the plurality of advertisements to the online resource; and causing the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 9. The method of claim 8, further comprising:
determining corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; and storing the handicap values in the database in association with their corresponding categories, wherein determining the corresponding handicap values for each one of the plurality of advertisements comprises:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 10. The method of claim 8, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 11. The method of claim 8, wherein the assigning comprises:
ranking the plurality of advertisements based on their corresponding effective bids; determining a highest ranking advertisement of the plurality of advertisements, and assigning the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 12. The method of claim 11, further comprising:
determining a second highest ranking advertisement of the plurality of advertisements; determining a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assigning, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 13. The method of claim 12, wherein determining the payment price comprises calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. 14. The method of claim 8, wherein each effective bid is determined based on a subtraction of the corresponding handicap value from the corresponding original bid. 15. A non-transitory machine-readable storage medium storing a set of instructions that, when executed by at least one processor, causes the at least one processor to perform operations comprising:
for each one of a plurality of advertisements, receiving a corresponding original bid for an online resource, each one of the plurality of advertisements corresponding to a different advertiser; for each one of the plurality of advertisements, determining a corresponding handicap value independent of the corresponding original bid; for each one of the plurality of advertisements, determining a corresponding effective bid for the online resource based on the corresponding original bid and the corresponding handicap value; selecting one of the plurality of advertisements based on the effective bids of the plurality of advertisements; assigning, in a database, the selected one of the plurality of advertisements to the online resource; and causing the selected one of the plurality of advertisements to be displayed on a computing device in response to a user-generated interrupt received from the computing device. 16. The storage medium of claim 15, wherein the operations further comprise:
determining corresponding handicap values for each of a plurality of categories of advertisements, the determining of the corresponding handicap values comprising performing a machine learning process on advertising information and sales information of a website to determine an effect of advertisements of each one of the plurality of categories on sales of items offered for sale on the website; and storing the handicap values in the database in association with their corresponding categories, wherein determining the corresponding handicap values for each one of the plurality of advertisements comprises:
for each one of the plurality of advertisements, determining a corresponding category; and
for each one of the plurality of advertisements, determining the corresponding handicap value based on a match between the determined category and one of the stored categories. 17. The storage medium of claim 15, wherein the online resource comprises a single defined advertisement space on a webpage, and causing the selected one of the plurality of advertisements to be displayed on the computing device comprises causing the selected one of the plurality of advertisements to be displayed in the single advertisement space on the webpage. 18. The storage medium of claim 15, wherein the assigning comprises:
ranking the plurality of advertisements based on their corresponding effective bids; determining a highest ranking advertisement of the plurality of advertisements, and assigning the selected one of the plurality of advertisements to the online resource based on a determination that the selected on is the highest ranking advertisement. 19. The storage medium of claim 18, wherein the operations further comprise:
determining a second highest ranking advertisement of the plurality of advertisements; determining a payment price for the online resource based on the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements; and assigning, in the database, the payment price to the corresponding advertiser of the selected one of the plurality of advertisements. 20. The storage medium of claim 19, wherein determining the payment price comprises calculating the sum of the corresponding effective bid of the second highest ranking advertisement and the corresponding handicap value of the selected one of the plurality of advertisements. | 3,600 |
13,595 | 13,595 | 15,490,284 | 3,651 | An access and storage system including a storage component configured to store items therein or thereon in an associated storage position, wherein the storage component is configured to provide a user direct manual access to the items in the storage positions. The system further includes a sensor system configured to track at least one of the user's removal of an item from the associated storage position or replacement of an item to the associated storage position and an identification system for identifying the user. The system also has an authorization database operatively coupled to the identification system for tracking which of the items a particular identified user is authorized to access. | 1-63. (canceled) 64. An access and storage system comprising:
a manually-carryable storage component positionable on or in a storage area, wherein said storage component is configured to store items therein or thereon in associated storage positions, and wherein said storage component is configured to provide a user with direct manual access to said items in said storage positions; and a sensor system configured to track said user's removal of an item from the associated storage position and replacement of the item to the associated storage position, the sensor system having at least one on/off presence sensor configured to detect the removal and replacement of the item from the associated storage position, wherein the sensor system is operable to track said removal and replacement of the item when the storage component is positioned on or in the storage area and to track said removal and replacement of the item when the storage component is not positioned on or in the storage area. 65. The access and storage system of claim 64, wherein the storage component takes the form of a manually-carryable tray. 66. The access and storage system of claim 65, wherein the manually-carryable tray includes a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein the sensor system is configured to track removal of any items from said dispensers. 67. The access and storage system of claim 64, further comprising a plurality of manually-carryable storage components. 68. The access and storage system of claim 67, wherein each of the plurality of manually-carryable storage components takes the form of a manually-carryable tray with a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein multiple on/off presence sensors are configured to detect the removal and replacement of individual items from each of the dispensers. 69. The access and storage system of claim 64, further comprising a wireless controller operatively coupled to the sensor system to communicate information pertaining to said removal and replacement of a particular item to or from its associated storage position when the storage component is not positioned on or in the storage area. 70. The access and storage system of claim 64, wherein the storage component further includes a controller operatively coupled to the sensor system, and wherein the controller is configured to collect and store dispensing activity information from the sensor system when the storage component is remote from the storage area, and wherein the controller is configured to transmit stored dispensing activity information when the storage component is proximate to the storage area. 71. The access and storage system of claim 64, further comprising the storage area, wherein the storage area includes a sensor configured to track the presence or absence of the storage component at the storage area. 72. The access and storage system of claim 66, wherein each of the plurality of dispensers is configured to dispense a plurality of items of only a single type per dispenser, and wherein said sensor system is configured to track removal of any items from said dispenser. 73. The access and storage system of claim 64, wherein the manually-carryable storage component comprises at least one dispenser. 74. The access and storage system of claim 73, wherein the dispenser is a weight-based dispenser. 75. The access and storage system of claim 73, wherein the dispenser comprises a plurality of on/off presence sensors configured to detect a level of a plurality of items contained within the dispenser. 76. The access and storage system of claim 73, wherein the dispenser comprises a ramp an on/off presence sensor, and an aperture positioned at the base of the ramp, wherein the aperture is configured to hold an item at the base of the ramp and the on/off presence sensor is positioned to trigger when a held item is manually removed from the aperture. 77. The access and storage system of claim 64, further comprising the storage area, wherein the storage area comprises a shelf, and wherein the storage component is sized to generally correspond to the shelf. 78. The access and storage system of claim 64, wherein the sensor system is coupled to the storage component. 79. An access and storage system comprising:
a manually-carryable storage component positionable on or in a storage area, wherein said storage component is configured to store items therein or thereon in individually associated storage positions, and wherein said storage component is configured to provide a user with direct manual access to said items in said storage positions; a sensor system configured to track at least one of said user's removal of an item from the associated storage position or replacement of an item to the associated storage position, wherein the sensor system is operable to track said removal or replacement of the item when the storage component is positioned on or in the storage area and to track said removal or replacement of the item when the storage component is not positioned on or in the storage area, wherein the sensor system utilizes a plurality of on/off presence sensors in at least one individually associated storage position to avoid false-positive presence detections. 80. The access and storage system of claim 79, wherein the storage component takes the form of a manually-carryable tray. 81. The access and storage system of claim 80, wherein the manually-carryable tray includes a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein the sensor system is configured to track removal of any items from said dispensers. 82. The access and storage system of claim 79, further comprising a plurality of manually-carryable storage components. 83. The access and storage system of claim 82, wherein each of the plurality of manually-carryable storage components takes the form of a manually-carryable tray with a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein multiple on/off presence sensors are configured to detect the removal and replacement of individual items from each the dispensers. 84. The access and storage system of claim 79, further comprising a wireless controller operatively coupled to the sensor system to communicate information pertaining to said removal or replacement of a particular item to or from its associated storage position when the storage component is not positioned on or in the storage area. 85. The access and storage system of claim 79, wherein the storage component further includes a controller operatively coupled to the sensor system, and wherein the controller is configured to collect and store dispensing activity information from the sensor system when the storage component is remote from the storage area, and wherein the controller is configured to transmit stored dispensing activity information when the storage component is proximate to the storage area. 86. The access and storage system of claim 79, further comprising the storage area, wherein the storage area includes a sensor configured to track the presence or absence of the storage component at the storage area. 87. The access and storage system of claim 81, wherein each of the plurality of dispensers is configured to dispense a plurality of items of only a single type per dispenser, and wherein said sensor system is configured to track removal of any items from said dispenser. 88. The access and storage system of claim 79, wherein the manually-carryable storage component comprises at least one dispenser. 89. The access and storage system of claim 88, wherein the dispenser is a weight-based dispenser. 90. The access and storage system of claim 88, wherein the dispenser comprises a plurality of on/off presence sensors configured to detect a level of a plurality of items contained within the dispenser. 91. The access and storage system of claim 88, wherein the dispenser comprises a ramp, an on/off presence sensor , and an aperture positioned at the base of the ramp, wherein the aperture is configured to hold an item at the base of the ramp and the on/off presence sensor is positioned to trigger when a held item is manually removed from the aperture. 92. The access and storage system of claim 79, further comprising the storage area, wherein the storage area comprises a shelf, and wherein the storage component is sized to generally correspond to the shelf. 93. The access and storage system of claim 79, wherein the sensor system is coupled to the storage component. 94. An access and storage system comprising:
a plurality of manually-carryable storage components positionable on or in a storage area, wherein each of said storage components is configured to store items therein or thereon in an associated storage positions, wherein each of said storage components is configured to provide an associated user direct manual access to said items in said storage positions, and wherein access to each of the items of each of the plurality of manually-carryable storage components is restricted to the associated user of the respective storage component; a sensor system configured to track said user's removal of an item from the associated storage position and replacement of the item to the associated storage position, wherein the sensor system is operable to track said removal or replacement of the item when the storage component is positioned on or in the storage area and to track said removal or replacement of the item when the storage component is not positioned on or in the storage area; wherein each of the manually-carryable storage components comprises a plurality of on/off presence sensors configured to detect the removal and replacement of the items from the associated storage positions. | An access and storage system including a storage component configured to store items therein or thereon in an associated storage position, wherein the storage component is configured to provide a user direct manual access to the items in the storage positions. The system further includes a sensor system configured to track at least one of the user's removal of an item from the associated storage position or replacement of an item to the associated storage position and an identification system for identifying the user. The system also has an authorization database operatively coupled to the identification system for tracking which of the items a particular identified user is authorized to access.1-63. (canceled) 64. An access and storage system comprising:
a manually-carryable storage component positionable on or in a storage area, wherein said storage component is configured to store items therein or thereon in associated storage positions, and wherein said storage component is configured to provide a user with direct manual access to said items in said storage positions; and a sensor system configured to track said user's removal of an item from the associated storage position and replacement of the item to the associated storage position, the sensor system having at least one on/off presence sensor configured to detect the removal and replacement of the item from the associated storage position, wherein the sensor system is operable to track said removal and replacement of the item when the storage component is positioned on or in the storage area and to track said removal and replacement of the item when the storage component is not positioned on or in the storage area. 65. The access and storage system of claim 64, wherein the storage component takes the form of a manually-carryable tray. 66. The access and storage system of claim 65, wherein the manually-carryable tray includes a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein the sensor system is configured to track removal of any items from said dispensers. 67. The access and storage system of claim 64, further comprising a plurality of manually-carryable storage components. 68. The access and storage system of claim 67, wherein each of the plurality of manually-carryable storage components takes the form of a manually-carryable tray with a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein multiple on/off presence sensors are configured to detect the removal and replacement of individual items from each of the dispensers. 69. The access and storage system of claim 64, further comprising a wireless controller operatively coupled to the sensor system to communicate information pertaining to said removal and replacement of a particular item to or from its associated storage position when the storage component is not positioned on or in the storage area. 70. The access and storage system of claim 64, wherein the storage component further includes a controller operatively coupled to the sensor system, and wherein the controller is configured to collect and store dispensing activity information from the sensor system when the storage component is remote from the storage area, and wherein the controller is configured to transmit stored dispensing activity information when the storage component is proximate to the storage area. 71. The access and storage system of claim 64, further comprising the storage area, wherein the storage area includes a sensor configured to track the presence or absence of the storage component at the storage area. 72. The access and storage system of claim 66, wherein each of the plurality of dispensers is configured to dispense a plurality of items of only a single type per dispenser, and wherein said sensor system is configured to track removal of any items from said dispenser. 73. The access and storage system of claim 64, wherein the manually-carryable storage component comprises at least one dispenser. 74. The access and storage system of claim 73, wherein the dispenser is a weight-based dispenser. 75. The access and storage system of claim 73, wherein the dispenser comprises a plurality of on/off presence sensors configured to detect a level of a plurality of items contained within the dispenser. 76. The access and storage system of claim 73, wherein the dispenser comprises a ramp an on/off presence sensor, and an aperture positioned at the base of the ramp, wherein the aperture is configured to hold an item at the base of the ramp and the on/off presence sensor is positioned to trigger when a held item is manually removed from the aperture. 77. The access and storage system of claim 64, further comprising the storage area, wherein the storage area comprises a shelf, and wherein the storage component is sized to generally correspond to the shelf. 78. The access and storage system of claim 64, wherein the sensor system is coupled to the storage component. 79. An access and storage system comprising:
a manually-carryable storage component positionable on or in a storage area, wherein said storage component is configured to store items therein or thereon in individually associated storage positions, and wherein said storage component is configured to provide a user with direct manual access to said items in said storage positions; a sensor system configured to track at least one of said user's removal of an item from the associated storage position or replacement of an item to the associated storage position, wherein the sensor system is operable to track said removal or replacement of the item when the storage component is positioned on or in the storage area and to track said removal or replacement of the item when the storage component is not positioned on or in the storage area, wherein the sensor system utilizes a plurality of on/off presence sensors in at least one individually associated storage position to avoid false-positive presence detections. 80. The access and storage system of claim 79, wherein the storage component takes the form of a manually-carryable tray. 81. The access and storage system of claim 80, wherein the manually-carryable tray includes a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein the sensor system is configured to track removal of any items from said dispensers. 82. The access and storage system of claim 79, further comprising a plurality of manually-carryable storage components. 83. The access and storage system of claim 82, wherein each of the plurality of manually-carryable storage components takes the form of a manually-carryable tray with a plurality of dispensers thereon, wherein each dispenser is configured to contain and dispense a plurality of items, and wherein multiple on/off presence sensors are configured to detect the removal and replacement of individual items from each the dispensers. 84. The access and storage system of claim 79, further comprising a wireless controller operatively coupled to the sensor system to communicate information pertaining to said removal or replacement of a particular item to or from its associated storage position when the storage component is not positioned on or in the storage area. 85. The access and storage system of claim 79, wherein the storage component further includes a controller operatively coupled to the sensor system, and wherein the controller is configured to collect and store dispensing activity information from the sensor system when the storage component is remote from the storage area, and wherein the controller is configured to transmit stored dispensing activity information when the storage component is proximate to the storage area. 86. The access and storage system of claim 79, further comprising the storage area, wherein the storage area includes a sensor configured to track the presence or absence of the storage component at the storage area. 87. The access and storage system of claim 81, wherein each of the plurality of dispensers is configured to dispense a plurality of items of only a single type per dispenser, and wherein said sensor system is configured to track removal of any items from said dispenser. 88. The access and storage system of claim 79, wherein the manually-carryable storage component comprises at least one dispenser. 89. The access and storage system of claim 88, wherein the dispenser is a weight-based dispenser. 90. The access and storage system of claim 88, wherein the dispenser comprises a plurality of on/off presence sensors configured to detect a level of a plurality of items contained within the dispenser. 91. The access and storage system of claim 88, wherein the dispenser comprises a ramp, an on/off presence sensor , and an aperture positioned at the base of the ramp, wherein the aperture is configured to hold an item at the base of the ramp and the on/off presence sensor is positioned to trigger when a held item is manually removed from the aperture. 92. The access and storage system of claim 79, further comprising the storage area, wherein the storage area comprises a shelf, and wherein the storage component is sized to generally correspond to the shelf. 93. The access and storage system of claim 79, wherein the sensor system is coupled to the storage component. 94. An access and storage system comprising:
a plurality of manually-carryable storage components positionable on or in a storage area, wherein each of said storage components is configured to store items therein or thereon in an associated storage positions, wherein each of said storage components is configured to provide an associated user direct manual access to said items in said storage positions, and wherein access to each of the items of each of the plurality of manually-carryable storage components is restricted to the associated user of the respective storage component; a sensor system configured to track said user's removal of an item from the associated storage position and replacement of the item to the associated storage position, wherein the sensor system is operable to track said removal or replacement of the item when the storage component is positioned on or in the storage area and to track said removal or replacement of the item when the storage component is not positioned on or in the storage area; wherein each of the manually-carryable storage components comprises a plurality of on/off presence sensors configured to detect the removal and replacement of the items from the associated storage positions. | 3,600 |
13,596 | 13,596 | 14,191,936 | 3,624 | A medical system ( 10 ) and method ( 50 ) calculate holistic financial risks to caregiving facilities. Healthcare data for a caregiving facility is received. A first set of one or more key performance indicators (KPIs) is received relating regulatory data to financial risk to the caregiving facility from government regulations. A second set of one or more KPIs is received relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations. The first and second sets of KPIs are simultaneously applied to the healthcare data to determine a net risk from both government regulations and other sources of financial risk. | 1. A medical system (10) to calculate holistic financial risks to caregiving facilities, said medical system (10) comprising:
at least one processor (40) programmed to:
receive healthcare data for a caregiving facility;
receive a first set of one or more key performance indicators (KPIs) relating regulatory data to financial risk to the caregiving facility from government regulations;
receive a second set of one or more KPIs relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations; and
simultaneously apply the first and second sets of KPIs to the healthcare data to determine a net risk from both government regulations and other sources of financial risk. 2. The medical system (10) according to claim 1, wherein the at least one processor (40) is maintained and operated by a second caregiving facility, and wherein the caregiving facility is different than the second caregiving facility. 3. The medical system (10) according to either one of claims 1 and 2, wherein the healthcare data is historical. 4. The medical system (10) according to any one of claims 1-3, wherein the healthcare data includes all, or a subset of, publicly available data covering healthcare market, healthcare operations, claims and demography. 5. The medical system (10) according to any one of claims 1-4, wherein the healthcare data includes all, or a subset of, hospital specific information that is proprietary to the caregiving facility. 6. The medical system (10) according to any one of claims 1-5, wherein the healthcare data includes all, or a subset of, structured and non-structured data collected through interviews, surveys and auditing of the caregiving facility. 7. The medical system (10) according to any one of claims 1-6, wherein the other sources of financial risk include clinical risk. 8. The medical system (10) according to any one of claims 1-7, wherein the other sources of financial risk include operational and enterprise financial risk. 9. The medical system (10) according to any one of claims 1-8, wherein the healthcare data is customized to determine the net risk for a future or fictitious scenario. 10. The medical system (10) according to any one of claims 1-9, wherein the at least one processor (40) is further programmed to:
simultaneously apply the first set of KPIs and the second set of KPIs to the healthcare data to determine a confidence range for the net risk or trend of a value of the net risk. 11. The medical system (10) according to any one of claims 1-10, wherein the KPIs of the first set of KPIs and/or the second set of KPIs include corresponding sets of one or more actions, and wherein actions of the sets alter the corresponding KPIs. 12. The medical system (10) according to claim 11, wherein the at least one processor (40) is further programmed to:
optimize over all the actions of the sets to determine an action which reduces the net risk by the greatest extent; and recommend the action to a user of the medical system (10). 13. A method (50) to calculate holistic financial risks to caregiving facilities, said medical method (50) comprising:
receiving (52) healthcare data for a caregiving facility; receiving (54) a first set of one or more key performance indicators (KPIs) relating regulatory data to financial risk to the caregiving facility from government regulations; receiving (56) a second set of one or more KPIs relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations; and simultaneously applying (58) the first and second sets of KPIs to the healthcare data to determine a net risk from both government regulations and other sources of financial risk. 14. The method (50) according to claim 13, wherein the healthcare data includes at least one of public data, proprietary data and survey data. 15. The method (50) according to either one of claims 13 and 14, wherein the other sources of financial risk include at least one of clinical risk, operational and enterprise financial risk. 16. The method (50) according to any one of claims 13-15, further including:
simultaneously applying the first set of KPIs and the second set of KPIs to the healthcare data to determine a confidence range for the net risk or trend of a value of the net risk. 17. The method (50) according to any one of claims 13-16, wherein the KPIs of the first set of KPIs and/or the second set of KPIs include corresponding sets of one or more actions, wherein actions of the sets alter the corresponding KPIs, and wherein said method further includes:
optimizing over all the actions of the sets to determine an action which reduces the net risk by the greatest extent; and recommending the action to a user of the medical system (50). 18. One or more processors (40) programmed to perform the method (50) according to any one of claims 13-17. 19. A non-transitory computer readable medium (38) carrying software which contains one or more processors (40) to perform the method (50) according to any one of claims 13-17. 20. A medical system (10) to calculate holistic financial risks to caregiving facilities, said medical system (10) comprising:
a source database including available healthcare data for the present time; a historical database including historical instances of the healthcare data of the source database; one or more key performance indicators (KPIs) relating various data from the source database or the historical database to financial outcomes; and a set of actions controlling the one or more KPIs. | A medical system ( 10 ) and method ( 50 ) calculate holistic financial risks to caregiving facilities. Healthcare data for a caregiving facility is received. A first set of one or more key performance indicators (KPIs) is received relating regulatory data to financial risk to the caregiving facility from government regulations. A second set of one or more KPIs is received relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations. The first and second sets of KPIs are simultaneously applied to the healthcare data to determine a net risk from both government regulations and other sources of financial risk.1. A medical system (10) to calculate holistic financial risks to caregiving facilities, said medical system (10) comprising:
at least one processor (40) programmed to:
receive healthcare data for a caregiving facility;
receive a first set of one or more key performance indicators (KPIs) relating regulatory data to financial risk to the caregiving facility from government regulations;
receive a second set of one or more KPIs relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations; and
simultaneously apply the first and second sets of KPIs to the healthcare data to determine a net risk from both government regulations and other sources of financial risk. 2. The medical system (10) according to claim 1, wherein the at least one processor (40) is maintained and operated by a second caregiving facility, and wherein the caregiving facility is different than the second caregiving facility. 3. The medical system (10) according to either one of claims 1 and 2, wherein the healthcare data is historical. 4. The medical system (10) according to any one of claims 1-3, wherein the healthcare data includes all, or a subset of, publicly available data covering healthcare market, healthcare operations, claims and demography. 5. The medical system (10) according to any one of claims 1-4, wherein the healthcare data includes all, or a subset of, hospital specific information that is proprietary to the caregiving facility. 6. The medical system (10) according to any one of claims 1-5, wherein the healthcare data includes all, or a subset of, structured and non-structured data collected through interviews, surveys and auditing of the caregiving facility. 7. The medical system (10) according to any one of claims 1-6, wherein the other sources of financial risk include clinical risk. 8. The medical system (10) according to any one of claims 1-7, wherein the other sources of financial risk include operational and enterprise financial risk. 9. The medical system (10) according to any one of claims 1-8, wherein the healthcare data is customized to determine the net risk for a future or fictitious scenario. 10. The medical system (10) according to any one of claims 1-9, wherein the at least one processor (40) is further programmed to:
simultaneously apply the first set of KPIs and the second set of KPIs to the healthcare data to determine a confidence range for the net risk or trend of a value of the net risk. 11. The medical system (10) according to any one of claims 1-10, wherein the KPIs of the first set of KPIs and/or the second set of KPIs include corresponding sets of one or more actions, and wherein actions of the sets alter the corresponding KPIs. 12. The medical system (10) according to claim 11, wherein the at least one processor (40) is further programmed to:
optimize over all the actions of the sets to determine an action which reduces the net risk by the greatest extent; and recommend the action to a user of the medical system (10). 13. A method (50) to calculate holistic financial risks to caregiving facilities, said medical method (50) comprising:
receiving (52) healthcare data for a caregiving facility; receiving (54) a first set of one or more key performance indicators (KPIs) relating regulatory data to financial risk to the caregiving facility from government regulations; receiving (56) a second set of one or more KPIs relating non-regulatory data to financial risk to the caregiving facility from one or more sources other than government regulations; and simultaneously applying (58) the first and second sets of KPIs to the healthcare data to determine a net risk from both government regulations and other sources of financial risk. 14. The method (50) according to claim 13, wherein the healthcare data includes at least one of public data, proprietary data and survey data. 15. The method (50) according to either one of claims 13 and 14, wherein the other sources of financial risk include at least one of clinical risk, operational and enterprise financial risk. 16. The method (50) according to any one of claims 13-15, further including:
simultaneously applying the first set of KPIs and the second set of KPIs to the healthcare data to determine a confidence range for the net risk or trend of a value of the net risk. 17. The method (50) according to any one of claims 13-16, wherein the KPIs of the first set of KPIs and/or the second set of KPIs include corresponding sets of one or more actions, wherein actions of the sets alter the corresponding KPIs, and wherein said method further includes:
optimizing over all the actions of the sets to determine an action which reduces the net risk by the greatest extent; and recommending the action to a user of the medical system (50). 18. One or more processors (40) programmed to perform the method (50) according to any one of claims 13-17. 19. A non-transitory computer readable medium (38) carrying software which contains one or more processors (40) to perform the method (50) according to any one of claims 13-17. 20. A medical system (10) to calculate holistic financial risks to caregiving facilities, said medical system (10) comprising:
a source database including available healthcare data for the present time; a historical database including historical instances of the healthcare data of the source database; one or more key performance indicators (KPIs) relating various data from the source database or the historical database to financial outcomes; and a set of actions controlling the one or more KPIs. | 3,600 |
13,597 | 13,597 | 13,944,558 | 3,681 | According to an embodiment, a data processing system for facilitating consumer identity resolution comprises: a first logic module adapted to receive at least two collections of consumer records from at least two different sources; a second logic module adapted to compute first trust scores for first data fields of the first collection and second trust scores for second data fields of the second collection; a third logic module adapted to generate a master collection of consumer records comprising at least one master consumer record that is correlated to a record from the first collection and a record from the second collection, the correlation being based on at least on the trust scores; and a fourth logic module adapted to receive a set of contextual transaction data. The data processing system is adapted to identify a consumer based on the contextual transaction data and the master collection of consumer records. | 1. A data processing system for facilitating consumer identity resolution, the system comprising:
a first logic module adapted to receive at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; a second logic module adapted to compute a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; a third logic module adapted to generate a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and a fourth logic module adapted to receive a set of contextual transaction data, wherein the data processing system is adapted to identify a consumer based on the contextual transaction data and the master collection of consumer records. 2. The data processing system of claim 1, wherein the system is adapted to select at least one electronic offer based on the identification of the consumer. 3. The data processing system of claim 2, wherein the electronic offer is selected in response to a request for a receipt. 4. The data processing system of claim 2, wherein the electronic offer is included in a transaction receipt transmitted to a customer data processing system. 5. The data processing system of claim 4, wherein the customer data processing system is at least one of: a desktop computer, laptop computer, netbook, electronic notebook, ultra mobile personal computer (UMPC), electronic tablet, client computing device, client terminal, client console, mobile telephone, smartphone, wearable computer, head-mounted computer, or personal digital assistant. 6. The data processing system of claim 2, wherein the selection of the electronic offer is based on at least one of: an activity associated with a particular master consumer record, or a consumer attribute associated with a particular master consumer record. 7. The data processing system of claim 2, wherein the selection of the electronic offer is based on determining whether an offer has previously been activated in connection with a particular master consumer record. 8. The data processing system of claim 2, wherein the selection of the electronic offer is based on a transaction log. 9. The data processing system of claim 2, wherein the selection of the electronic offer comprises selecting multiple master records and scoring a likelihood that the contextual transaction data relates to a particular record included in the multiple master records. 10. The data processing system of claim 2, wherein the selection of the electronic offer is further based on confidence scores that indicate the frequency with which a particular value occurs in a data field of correlated records. 11. The data processing system of claim 1, wherein the system is further adapted to transmit a list of offers that have been activated for a particular master consumer record, the transmission being in response to a request from a retailer, and wherein the contextual transaction data includes a credential supplied by the consumer during a transaction. 12. The data processing system of claim 1, wherein the contextual transaction data includes information regarding at least one of: a universal product code, a quantity of product purchased, a number of items purchased, a transaction amount, at least a portion of a credit card number used, a payment identifier used, a secure payment hash key, a data processing system or facility, time, date, one or more offers activated or redeemed, customer name, phone number, pin number, password, code, loyalty card number, RFID data, a device identifier, one or more items that were purchased in a previous or concurrent transaction, or a transaction number. 13. The data processing system of claim 1, wherein at least one trust score is modified subsequently based on at least one of: an update from at least one of the two sources, new transaction data, or a confidence score that indicates the frequency with which a particular value occurs in a data field of correlated records. 14. The data processing system of claim 1, wherein the fourth logic module is further adapted to correlate transactions from a plurality of different retail stores with the at least one master consumer record. 15. The data processing system of claim 1, wherein the first logic module is further adapted to receive updates to the at least two collections from the at least two different sources over time, and the third logic module is further adapted to revise the correlations based thereon. 16. The data processing system of claim 1, wherein the third logic module is further adapted to link each value of the at least one master consumer record to a particular collection, of the at least two collections, from which the value originated. 17. The data processing system of claim 1, wherein the first data fields include aggregated transaction data. 18. The data processing system of claim 1, further comprising a fifth logic module adapted to identify one or more values for a particular data field of the at least one master consumer record in response to a query that requests the one or more values for the particular field, by querying a first consumer record of the first collection for a first value pertaining to a first data field, querying a second consumer record of the second collection for a second value pertaining to a second data field, and deciding which one or more values of the first value and the second value to return based at least on different trust scores assigned to the first data field and the second data field. 19. The data processing system of claim 1, wherein the third logic module is configured to determine which one or more values of a first value, pertaining to a first data field of the first collection, and a second value, pertaining to a second data field of the second collection, to store in the at least one master consumer record based at least on the different trust scores. 20. The data processing system of claim 1, wherein the fourth logic module is adapted to receive particular contextual transaction data in a query that selects for a first value in a particular data field of the master collection, and, responsive to the first value being assigned to the particular data field in a plurality of master consumer records, identify one or more master consumer records from which to return information based on trust scores assigned to different data fields of the at least two collections from which the plurality of master consumer records were generated. 21. The data processing system of claim 1, wherein the first source is a first retailer and the second source is a second retailer. 22. A method for facilitating consumer identity resolution, the method comprising:
receiving at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; computing a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; generating a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and receiving a set of contextual transaction data, identifying a consumer based on the contextual transaction data and the master collection of consumer records. 23. The method of claim 22, further comprising selecting at least one electronic offer based on the identification of the consumer. 24. The method of claim 23, further comprising including the at least one electronic offer in a transaction receipt transmitted to a customer data processing system. 25. The method of claim 22, further comprising transmitting a list of offers that have been activated for a particular master consumer record, the transmission being in response to a request from a retailer, and wherein the contextual transaction data includes a credential supplied by the consumer during a transaction. 26. The method of claim 22, further comprising correlating transactions from a plurality of different retail stores with the at least one master consumer record. 27. The method of claim 22, further comprising receiving updates to the at least two collections from the at least two different sources over time, and revising the correlations based thereon. 28. The method of claim 22, further comprising determining which one or more values of a first value, pertaining to a first data field of the first collection, and a second value, pertaining to a second data field of the second collection, to store in the at least one master consumer record based at least on the different trust scores. 29. The method of claim 22, further comprising receiving particular contextual transaction data in a query that selects for a first value in a particular data field of the master collection, and, responsive to the first value being assigned to the particular data field in a plurality of master consumer records, identifying one or more master consumer records from which to return information based on trust scores assigned to different data fields of the at least two collections from which the plurality of master consumer records were generated. 30. One or more computer readable media storing program instructions adapted to facilitate consumer identity resolution, wherein execution of the program instructions by a data processing system causes:
receiving at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; computing a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; generating a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and receiving a set of contextual transaction data, identifying a consumer based on the contextual transaction data and the master collection of consumer records. | According to an embodiment, a data processing system for facilitating consumer identity resolution comprises: a first logic module adapted to receive at least two collections of consumer records from at least two different sources; a second logic module adapted to compute first trust scores for first data fields of the first collection and second trust scores for second data fields of the second collection; a third logic module adapted to generate a master collection of consumer records comprising at least one master consumer record that is correlated to a record from the first collection and a record from the second collection, the correlation being based on at least on the trust scores; and a fourth logic module adapted to receive a set of contextual transaction data. The data processing system is adapted to identify a consumer based on the contextual transaction data and the master collection of consumer records.1. A data processing system for facilitating consumer identity resolution, the system comprising:
a first logic module adapted to receive at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; a second logic module adapted to compute a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; a third logic module adapted to generate a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and a fourth logic module adapted to receive a set of contextual transaction data, wherein the data processing system is adapted to identify a consumer based on the contextual transaction data and the master collection of consumer records. 2. The data processing system of claim 1, wherein the system is adapted to select at least one electronic offer based on the identification of the consumer. 3. The data processing system of claim 2, wherein the electronic offer is selected in response to a request for a receipt. 4. The data processing system of claim 2, wherein the electronic offer is included in a transaction receipt transmitted to a customer data processing system. 5. The data processing system of claim 4, wherein the customer data processing system is at least one of: a desktop computer, laptop computer, netbook, electronic notebook, ultra mobile personal computer (UMPC), electronic tablet, client computing device, client terminal, client console, mobile telephone, smartphone, wearable computer, head-mounted computer, or personal digital assistant. 6. The data processing system of claim 2, wherein the selection of the electronic offer is based on at least one of: an activity associated with a particular master consumer record, or a consumer attribute associated with a particular master consumer record. 7. The data processing system of claim 2, wherein the selection of the electronic offer is based on determining whether an offer has previously been activated in connection with a particular master consumer record. 8. The data processing system of claim 2, wherein the selection of the electronic offer is based on a transaction log. 9. The data processing system of claim 2, wherein the selection of the electronic offer comprises selecting multiple master records and scoring a likelihood that the contextual transaction data relates to a particular record included in the multiple master records. 10. The data processing system of claim 2, wherein the selection of the electronic offer is further based on confidence scores that indicate the frequency with which a particular value occurs in a data field of correlated records. 11. The data processing system of claim 1, wherein the system is further adapted to transmit a list of offers that have been activated for a particular master consumer record, the transmission being in response to a request from a retailer, and wherein the contextual transaction data includes a credential supplied by the consumer during a transaction. 12. The data processing system of claim 1, wherein the contextual transaction data includes information regarding at least one of: a universal product code, a quantity of product purchased, a number of items purchased, a transaction amount, at least a portion of a credit card number used, a payment identifier used, a secure payment hash key, a data processing system or facility, time, date, one or more offers activated or redeemed, customer name, phone number, pin number, password, code, loyalty card number, RFID data, a device identifier, one or more items that were purchased in a previous or concurrent transaction, or a transaction number. 13. The data processing system of claim 1, wherein at least one trust score is modified subsequently based on at least one of: an update from at least one of the two sources, new transaction data, or a confidence score that indicates the frequency with which a particular value occurs in a data field of correlated records. 14. The data processing system of claim 1, wherein the fourth logic module is further adapted to correlate transactions from a plurality of different retail stores with the at least one master consumer record. 15. The data processing system of claim 1, wherein the first logic module is further adapted to receive updates to the at least two collections from the at least two different sources over time, and the third logic module is further adapted to revise the correlations based thereon. 16. The data processing system of claim 1, wherein the third logic module is further adapted to link each value of the at least one master consumer record to a particular collection, of the at least two collections, from which the value originated. 17. The data processing system of claim 1, wherein the first data fields include aggregated transaction data. 18. The data processing system of claim 1, further comprising a fifth logic module adapted to identify one or more values for a particular data field of the at least one master consumer record in response to a query that requests the one or more values for the particular field, by querying a first consumer record of the first collection for a first value pertaining to a first data field, querying a second consumer record of the second collection for a second value pertaining to a second data field, and deciding which one or more values of the first value and the second value to return based at least on different trust scores assigned to the first data field and the second data field. 19. The data processing system of claim 1, wherein the third logic module is configured to determine which one or more values of a first value, pertaining to a first data field of the first collection, and a second value, pertaining to a second data field of the second collection, to store in the at least one master consumer record based at least on the different trust scores. 20. The data processing system of claim 1, wherein the fourth logic module is adapted to receive particular contextual transaction data in a query that selects for a first value in a particular data field of the master collection, and, responsive to the first value being assigned to the particular data field in a plurality of master consumer records, identify one or more master consumer records from which to return information based on trust scores assigned to different data fields of the at least two collections from which the plurality of master consumer records were generated. 21. The data processing system of claim 1, wherein the first source is a first retailer and the second source is a second retailer. 22. A method for facilitating consumer identity resolution, the method comprising:
receiving at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; computing a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; generating a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and receiving a set of contextual transaction data, identifying a consumer based on the contextual transaction data and the master collection of consumer records. 23. The method of claim 22, further comprising selecting at least one electronic offer based on the identification of the consumer. 24. The method of claim 23, further comprising including the at least one electronic offer in a transaction receipt transmitted to a customer data processing system. 25. The method of claim 22, further comprising transmitting a list of offers that have been activated for a particular master consumer record, the transmission being in response to a request from a retailer, and wherein the contextual transaction data includes a credential supplied by the consumer during a transaction. 26. The method of claim 22, further comprising correlating transactions from a plurality of different retail stores with the at least one master consumer record. 27. The method of claim 22, further comprising receiving updates to the at least two collections from the at least two different sources over time, and revising the correlations based thereon. 28. The method of claim 22, further comprising determining which one or more values of a first value, pertaining to a first data field of the first collection, and a second value, pertaining to a second data field of the second collection, to store in the at least one master consumer record based at least on the different trust scores. 29. The method of claim 22, further comprising receiving particular contextual transaction data in a query that selects for a first value in a particular data field of the master collection, and, responsive to the first value being assigned to the particular data field in a plurality of master consumer records, identifying one or more master consumer records from which to return information based on trust scores assigned to different data fields of the at least two collections from which the plurality of master consumer records were generated. 30. One or more computer readable media storing program instructions adapted to facilitate consumer identity resolution, wherein execution of the program instructions by a data processing system causes:
receiving at least two collections of consumer records from at least two different sources, the first collection including a set of first data fields and the second collection including a set of second data fields; computing a set of first trust scores for the first data fields and a set of second trust scores for the second data fields; generating a master collection of consumer records comprising at least one master consumer record that is correlated to at least one record from the first collection and to at least one record from the second collection, the correlation being based on at least one of the first trust scores and at least one of the second trust scores; and receiving a set of contextual transaction data, identifying a consumer based on the contextual transaction data and the master collection of consumer records. | 3,600 |
13,598 | 13,598 | 11,422,281 | 3,685 | To facilitate legal research, companies, such as Thomson West provide subscription-based (pay-for-access) online information-retrieval systems. Seeking to improve these and related systems, the present inventors recognized researchers often need to access open web content that is outside their subscription-based system. Accordingly, the present inventors devised systems, methods, and software that automatically search for and identify open web documents in response to queries within the subscription-based system and/or automatically search for and identify pay-for-access content in response to receiving open web queries. | 1. A method of operating an online pay-for-access legal research system, the method comprising:
in response to a received user query for pay-for-access data, outputting search results that include pay-for-access data and non-pay-for access data. 2. The method of claim 2, wherein outputting search results that include pay-for-access data and non-pay-for-access data includes defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 3. The method of claim 1, wherein outputting search results includes conducting a concept search based on word pairs in the user query. 4. The method of claim 1, wherein the received user query is associated with a user who has an account with the online pay-for-access research system, and the method comprising outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 5. The method of claim 4, wherein a sponsor of the one third-party advertisement pays a click-through fee if the user clicks on the one third-party advertisement, with a portion of the click-through fee to be shared with an entity that owns or controls the online legal research system or advertising rights associated with the online legal research system. 6. The method of claim 4, wherein the one or more of the third-party advertisements concerns a legal-industry product or service. 7. The method of claim 6, wherein the user is associated with a particular legal specialty, and the legal-industry product or service concerns a legal specialty different from the particular legal specialty. 8. The method of claim 1: wherein the search results identify one or more pay-for-access documents, and wherein the method further comprises:
receiving a user request to display one of the pay-for-access documents;
transparently authenticating the user in response to the received user request; and
displaying the one of the pay-for-access documents in response to authentication of the user. 9. A method of operating an online pay-for-access legal research system, the method comprising:
in response to a received user query for non-pay-for-access data, outputting search results that include pay-for-access data and non-pay-for access data. 10. The method of claim 9, wherein outputting search results that include non-pay-for-access data and non-pay-for-access data includes defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 11. The method of claim 9, wherein outputting search results includes conducting a concept search based on word pairs in the user query. 12. The method of claim 9: wherein the search results identify one or more pay-for-access documents, and wherein the method further comprises:
receiving a user request to display one of the pay-for-access documents;
transparently authenticating the user in response to the received user request; and
displaying the one of the pay-for-access documents in response to authentication of the user. 13. A machine-readable medium for use in operating an online pay-for-access legal research system, the medium comprising instructions for:
receiving a user query for one of pay-for-access data and non-pay-for-access data; and responding to the received user query by outputting search results that include pay-for-access data and non-pay-for access data. 14. The machine-readable medium of claim 13, wherein the medium comprises instructions for conducting a concept search based on word pairs in the user query. 15. The machine-readable medium of claim 13: wherein the received user query is associated with a user who has an account with the online pay-for-access research system; and wherein the medium further comprises instructions for outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 16. A server for an online pay-for-access legal research system, the server comprising:
means for receiving a user query for one of pay-for-access data and non-pay-for-access data; and means, responsive to the received user query, for outputting search results that include pay-for-access data and non-pay-for access data. 17. The server of claim 16, wherein the means for outputting search results that include pay-for-access data and non-pay-for-access data includes means for defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 18. The server of claim 16, wherein the search results are determined using a concept search based on word pairs in the user query. 19. The server of claim 16, wherein the received user query is associated with a user who has an account with the online pay-for-access legal research system, and the server further comprises means for outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 20. A graphical user interface for a pay-for-access online legal research system, the interface comprising:
means for receiving a query for pay-for-access legal documents; means for displaying search results in response to the query, with the search results identifying one or more pay-for-access legal documents and one or more non-pay-for-access documents. 21. The graphical user interface of claim 20, further comprising one or more selectable advertising features displayed adjacent one or more of the non-pay-for-access documents. 22. The graphical user interface of claim 20, wherein the search results identifying one or more pay-for-access legal documents are grouped and segregated from the search results identifying one or more non-pay-for-access legal documents. 23. A system comprising:
a server for an online legal-research provider, the server coupled to one or more legal-research databases; a client access device coupled to the server via the Internet and having a display for presenting a graphical user interface including one or more user-interface elements at least partially configured or defined by the server, wherein one or more of the elements allows the user to define and submit queries for content on the internet that is external to or separate from the legal-research databases; means associated with the server for returning search results to the client access device in response to the received query:
wherein the search results include a first listing of free publicly accessible Internet documents external to the legal-research databases and associated with first user-interface elements, and a second listing of pay-for-access documents within one or more of the legal-research databases and associated with second user-interface elements; and
wherein user selection of each first user-interface element causes retrieval and/or display of a corresponding one of the first listed Internet documents and user selection of each second user-interface element causes assessment of a financial charge against an account associated with a user of the client access device and/or execution of a user authentication process. 24. The system of claim 23, further comprising one or more machine-readable medium storing one or more of components of the server, client access device, or graphical user interface, wherein the graphical user interface is a Windows-type interface controlled by a browser application on the client access device. 25. The system of claim 23, wherein the second listing of pay-for-access documents is updated in response to user selection of one of the first user-interface elements, wherein updating comprises generating a query based on content of the corresponding one of the first listed Internet documents. 26. The system of claim 23: wherein the server is coupled to one or more commercial legal-research databases, one or more commercial financial-research databases, one or more commercial scientific-research databases, and one or more commercial academic-or-news-research databases; and wherein the second listing of pay-for-access documents lists one or more documents from the legal-research, one or more documents from the financial-research databases, one or more documents from the scientific-research databases, and one or more documents from the academic-or-news-research database. 27. The system of claim 23: wherein the server is coupled to a third-party database of advertisements and the graphical user interface is displayed on the client access device in response to a user of the client-access device signing on to a website for the online legal research provider and invoking an internet search service; wherein the graphical user interface includes one or more third-party advertisements selected from the database of advertisements based on identity of the user or based on invocation of the internet search service from the website for the online legal research provider; and wherein an administrator or controller of the third-party database of advertisements shares advertising revenue with the online legal research provider. 28. The system of claim 23, wherein the graphical user interface includes one or more elements for defining and initiating a search of the documents identified in the second listing of pay-for-access documents to assist a user in determining whether they want to access one or more of the pay-for-access documents. | To facilitate legal research, companies, such as Thomson West provide subscription-based (pay-for-access) online information-retrieval systems. Seeking to improve these and related systems, the present inventors recognized researchers often need to access open web content that is outside their subscription-based system. Accordingly, the present inventors devised systems, methods, and software that automatically search for and identify open web documents in response to queries within the subscription-based system and/or automatically search for and identify pay-for-access content in response to receiving open web queries.1. A method of operating an online pay-for-access legal research system, the method comprising:
in response to a received user query for pay-for-access data, outputting search results that include pay-for-access data and non-pay-for access data. 2. The method of claim 2, wherein outputting search results that include pay-for-access data and non-pay-for-access data includes defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 3. The method of claim 1, wherein outputting search results includes conducting a concept search based on word pairs in the user query. 4. The method of claim 1, wherein the received user query is associated with a user who has an account with the online pay-for-access research system, and the method comprising outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 5. The method of claim 4, wherein a sponsor of the one third-party advertisement pays a click-through fee if the user clicks on the one third-party advertisement, with a portion of the click-through fee to be shared with an entity that owns or controls the online legal research system or advertising rights associated with the online legal research system. 6. The method of claim 4, wherein the one or more of the third-party advertisements concerns a legal-industry product or service. 7. The method of claim 6, wherein the user is associated with a particular legal specialty, and the legal-industry product or service concerns a legal specialty different from the particular legal specialty. 8. The method of claim 1: wherein the search results identify one or more pay-for-access documents, and wherein the method further comprises:
receiving a user request to display one of the pay-for-access documents;
transparently authenticating the user in response to the received user request; and
displaying the one of the pay-for-access documents in response to authentication of the user. 9. A method of operating an online pay-for-access legal research system, the method comprising:
in response to a received user query for non-pay-for-access data, outputting search results that include pay-for-access data and non-pay-for access data. 10. The method of claim 9, wherein outputting search results that include non-pay-for-access data and non-pay-for-access data includes defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 11. The method of claim 9, wherein outputting search results includes conducting a concept search based on word pairs in the user query. 12. The method of claim 9: wherein the search results identify one or more pay-for-access documents, and wherein the method further comprises:
receiving a user request to display one of the pay-for-access documents;
transparently authenticating the user in response to the received user request; and
displaying the one of the pay-for-access documents in response to authentication of the user. 13. A machine-readable medium for use in operating an online pay-for-access legal research system, the medium comprising instructions for:
receiving a user query for one of pay-for-access data and non-pay-for-access data; and responding to the received user query by outputting search results that include pay-for-access data and non-pay-for access data. 14. The machine-readable medium of claim 13, wherein the medium comprises instructions for conducting a concept search based on word pairs in the user query. 15. The machine-readable medium of claim 13: wherein the received user query is associated with a user who has an account with the online pay-for-access research system; and wherein the medium further comprises instructions for outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 16. A server for an online pay-for-access legal research system, the server comprising:
means for receiving a user query for one of pay-for-access data and non-pay-for-access data; and means, responsive to the received user query, for outputting search results that include pay-for-access data and non-pay-for access data. 17. The server of claim 16, wherein the means for outputting search results that include pay-for-access data and non-pay-for-access data includes means for defining a graphical user interface including the pay-for-access data and the non-pay-for-access data in separate regions of the interface. 18. The server of claim 16, wherein the search results are determined using a concept search based on word pairs in the user query. 19. The server of claim 16, wherein the received user query is associated with a user who has an account with the online pay-for-access legal research system, and the server further comprises means for outputting one or more third-party advertisements in association with the non-pay-for-access data, with one or more of the third-party advertisements selected based on identity of the user. 20. A graphical user interface for a pay-for-access online legal research system, the interface comprising:
means for receiving a query for pay-for-access legal documents; means for displaying search results in response to the query, with the search results identifying one or more pay-for-access legal documents and one or more non-pay-for-access documents. 21. The graphical user interface of claim 20, further comprising one or more selectable advertising features displayed adjacent one or more of the non-pay-for-access documents. 22. The graphical user interface of claim 20, wherein the search results identifying one or more pay-for-access legal documents are grouped and segregated from the search results identifying one or more non-pay-for-access legal documents. 23. A system comprising:
a server for an online legal-research provider, the server coupled to one or more legal-research databases; a client access device coupled to the server via the Internet and having a display for presenting a graphical user interface including one or more user-interface elements at least partially configured or defined by the server, wherein one or more of the elements allows the user to define and submit queries for content on the internet that is external to or separate from the legal-research databases; means associated with the server for returning search results to the client access device in response to the received query:
wherein the search results include a first listing of free publicly accessible Internet documents external to the legal-research databases and associated with first user-interface elements, and a second listing of pay-for-access documents within one or more of the legal-research databases and associated with second user-interface elements; and
wherein user selection of each first user-interface element causes retrieval and/or display of a corresponding one of the first listed Internet documents and user selection of each second user-interface element causes assessment of a financial charge against an account associated with a user of the client access device and/or execution of a user authentication process. 24. The system of claim 23, further comprising one or more machine-readable medium storing one or more of components of the server, client access device, or graphical user interface, wherein the graphical user interface is a Windows-type interface controlled by a browser application on the client access device. 25. The system of claim 23, wherein the second listing of pay-for-access documents is updated in response to user selection of one of the first user-interface elements, wherein updating comprises generating a query based on content of the corresponding one of the first listed Internet documents. 26. The system of claim 23: wherein the server is coupled to one or more commercial legal-research databases, one or more commercial financial-research databases, one or more commercial scientific-research databases, and one or more commercial academic-or-news-research databases; and wherein the second listing of pay-for-access documents lists one or more documents from the legal-research, one or more documents from the financial-research databases, one or more documents from the scientific-research databases, and one or more documents from the academic-or-news-research database. 27. The system of claim 23: wherein the server is coupled to a third-party database of advertisements and the graphical user interface is displayed on the client access device in response to a user of the client-access device signing on to a website for the online legal research provider and invoking an internet search service; wherein the graphical user interface includes one or more third-party advertisements selected from the database of advertisements based on identity of the user or based on invocation of the internet search service from the website for the online legal research provider; and wherein an administrator or controller of the third-party database of advertisements shares advertising revenue with the online legal research provider. 28. The system of claim 23, wherein the graphical user interface includes one or more elements for defining and initiating a search of the documents identified in the second listing of pay-for-access documents to assist a user in determining whether they want to access one or more of the pay-for-access documents. | 3,600 |
13,599 | 13,599 | 12,354,739 | 3,626 | Various embodiments for configuring a medical database by a processor in communication with at least one storage device in a computing environment are provided. Medical data are assigned to a patient. A plurality of data types is organized for the medical data. Portions of each of the plurality of data types are designated as public and private data. A plurality of access levels is organized for the medical data. Each of the plurality of data types includes the plurality of access levels. A first access level of the plurality of access levels corresponds to the patient. The medical data is classified according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data. The medical data is encrypted in a hierarchical structure corresponding to each of the plurality of access levels. | 1. A method for configuring a medical database by a processor in communication with at least one storage device in a computing environment, comprising:
assigning medical data to a patient; organizing a plurality of data types for the medical data; designating a first portion of each of the plurality of data types as public data; designating a second portion of each of the plurality of data types as private data; organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient; classifying the medical data:
according to the plurality of data types,
for each of the plurality of data types, according to the plurality of access levels, and
according to one of the public and the private data; and
encrypting the medical data in a hierarchical structure corresponding to each of the plurality of access levels. 2. The method of claim 1, further including storing the medical data on a remote data storage subsystem accessible by a host computer, the remote data storage subsystem incorporating the at least one storage device. 3. The method of claim 2, wherein storing the data on the remote data storage subsystem accessible by a host computer includes configuring a storage controller unit residing in the remote data storage system to:
accept at least one private encryption key associated with at least one of the plurality of access levels, authenticate the at least one private encryption key, decrypt a segment of the medical data corresponding to the at least one private encryption key, and forward the segment of the data to the host computer. 4. The method of claim 1, wherein organizing a plurality of data types for the medical data includes categorizing the medical data according to at least one of general, diagnostic, medical professional and insurance data types. 5. The method of claim 1, further including designating additional access levels to correspond to a plurality of medical and insurance personnel. 6. The method of claim 1, wherein organizing the plurality of access levels for the medical data includes implementing at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 7. The method of claim 1, wherein encrypting the data in the hierarchical structure corresponding to each of the plurality of access levels is performed pursuant to an asymmetric encryption methodology. 8. The method of claim 1, further including granting access to the first access level pursuant to a two-factor authentication methodology implemented for the patient. 9. A system for implementing a medical database utilizing a processor in communication with a data storage subsystem, comprising:
at least one storage device; a database server in communication with the at least one storage device, wherein the database server is adapted for:
assigning medical data to a patient,
organizing a plurality of data types for the medical data,
designating a first portion of each of the plurality of data types as public data,
designating a second portion of each of the plurality of data types as private data,
organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient,
classifying the medical data according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data, and
encrypting the medical data in a hierarchical structure corresponding to each of the plurality of access levels. 10. The system of claim 9, wherein at least one storage device is adapted for storing the medical data. 11. The system of claim 9, further including a storage controller unit in communication with the at least one storage device, wherein the storage controller unit is adapted for:
accepting at least one private encryption key associated with at least one of the plurality of access levels, authenticating the at least one private encryption key, decrypting a segment of the data corresponding to the at least one private encryption key, and forwarding the segment of the data to the host computer. 12. The system of claim 9, wherein the medical data is organized according to at least one of general, diagnostic, medical professional and insurance data types. 13. The system of claim 9, wherein the database server is further adapted for designating additional access levels to correspond to a plurality of medical and insurance personnel. 14. The system of claim 9, wherein the database server is further adapted for implementing a plurality of controls corresponding to each of the plurality of access levels, wherein the plurality of controls includes at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 15. A computer program product for configuring a medical database by a processor in communication with at least one storage device in a computing environment, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for assigning medical data to a patient; a second executable portion for organizing a plurality of data types for the medical data; a third executable portion for designating a first portion of each of the plurality of data types as public data; a fourth executable portion for designating a second portion of each of the plurality of data types as private data; a fifth executable portion for organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient; a sixth executable portion for classifying the medical data:
according to the plurality of data types,
for each of the plurality of data types, according to the plurality of access levels, and
according to one of the public and the private data; and
a seventh executable portion for encrypting the data in a hierarchical structure corresponding to each of the plurality of access levels. 16. The computer program product of claim 15, further including an eighth executable portion for storing the data on a remote data storage subsystem accessible by a host computer, wherein the remote data storage subsystem incorporates the at least one storage device. 17. The computer program product of claim 16, wherein the eighth executable portion for storing the data on the remote data storage subsystem accessible by a host computer includes a ninth executable portion for configuring a storage controller unit residing in the remote data storage system to:
accept at least one private encryption key associated with at least one of the plurality of access levels, authenticate the at least one private encryption key, decrypt a segment of the data corresponding to the at least one private encryption key, and forward the segment of the data to the host computer. 18. The computer program product of claim 15, wherein the second executable portion for organizing a plurality of data types for the medical data includes an eighth executable portion for categorizing the data according to general, diagnostic, medical professional, and insurance data types. 19. The computer program product of claim 15, further including an eighth executable portion for designating additional access levels to correspond to medical and insurance personnel. 20. The computer program product of claim 15, wherein the fifth executable portion for organizing the plurality of access levels for the medical data includes an eighth executable portion for implementing at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 21. A medical database operational on a database server utilizing a processor in communication with at least one storage device in a computing environment, comprising:
medical data assigned to a patient; a plurality of data types organized for the medical data; a first portion of each of the plurality of data types designated as public data; a second portion of each of the plurality of data types designated as private data; and a plurality of access levels organized for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient, wherein the medical data:
is classified according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data, and
is encrypted in a hierarchical structure corresponding to each of the plurality of access levels. 22. The medical database of claim 21, wherein the medical data is stored on a remote data storage subsystem accessible by a host computer, wherein the remote data storage subsystem incorporates the at least one storage device. 23. The medical database of claim 22, further including:
at least one private encryption key associated with at least one of the plurality of access levels, the at least one private encryption key accepted and authenticated by a storage controller unit in communication with the at least one storage device. 24. The medical database of claim 21, wherein the data types include at least one of general, diagnostic, medical professional and insurance. 25. The medical database of claim 21, wherein each of the plurality of access levels further include a includes at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. | Various embodiments for configuring a medical database by a processor in communication with at least one storage device in a computing environment are provided. Medical data are assigned to a patient. A plurality of data types is organized for the medical data. Portions of each of the plurality of data types are designated as public and private data. A plurality of access levels is organized for the medical data. Each of the plurality of data types includes the plurality of access levels. A first access level of the plurality of access levels corresponds to the patient. The medical data is classified according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data. The medical data is encrypted in a hierarchical structure corresponding to each of the plurality of access levels.1. A method for configuring a medical database by a processor in communication with at least one storage device in a computing environment, comprising:
assigning medical data to a patient; organizing a plurality of data types for the medical data; designating a first portion of each of the plurality of data types as public data; designating a second portion of each of the plurality of data types as private data; organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient; classifying the medical data:
according to the plurality of data types,
for each of the plurality of data types, according to the plurality of access levels, and
according to one of the public and the private data; and
encrypting the medical data in a hierarchical structure corresponding to each of the plurality of access levels. 2. The method of claim 1, further including storing the medical data on a remote data storage subsystem accessible by a host computer, the remote data storage subsystem incorporating the at least one storage device. 3. The method of claim 2, wherein storing the data on the remote data storage subsystem accessible by a host computer includes configuring a storage controller unit residing in the remote data storage system to:
accept at least one private encryption key associated with at least one of the plurality of access levels, authenticate the at least one private encryption key, decrypt a segment of the medical data corresponding to the at least one private encryption key, and forward the segment of the data to the host computer. 4. The method of claim 1, wherein organizing a plurality of data types for the medical data includes categorizing the medical data according to at least one of general, diagnostic, medical professional and insurance data types. 5. The method of claim 1, further including designating additional access levels to correspond to a plurality of medical and insurance personnel. 6. The method of claim 1, wherein organizing the plurality of access levels for the medical data includes implementing at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 7. The method of claim 1, wherein encrypting the data in the hierarchical structure corresponding to each of the plurality of access levels is performed pursuant to an asymmetric encryption methodology. 8. The method of claim 1, further including granting access to the first access level pursuant to a two-factor authentication methodology implemented for the patient. 9. A system for implementing a medical database utilizing a processor in communication with a data storage subsystem, comprising:
at least one storage device; a database server in communication with the at least one storage device, wherein the database server is adapted for:
assigning medical data to a patient,
organizing a plurality of data types for the medical data,
designating a first portion of each of the plurality of data types as public data,
designating a second portion of each of the plurality of data types as private data,
organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient,
classifying the medical data according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data, and
encrypting the medical data in a hierarchical structure corresponding to each of the plurality of access levels. 10. The system of claim 9, wherein at least one storage device is adapted for storing the medical data. 11. The system of claim 9, further including a storage controller unit in communication with the at least one storage device, wherein the storage controller unit is adapted for:
accepting at least one private encryption key associated with at least one of the plurality of access levels, authenticating the at least one private encryption key, decrypting a segment of the data corresponding to the at least one private encryption key, and forwarding the segment of the data to the host computer. 12. The system of claim 9, wherein the medical data is organized according to at least one of general, diagnostic, medical professional and insurance data types. 13. The system of claim 9, wherein the database server is further adapted for designating additional access levels to correspond to a plurality of medical and insurance personnel. 14. The system of claim 9, wherein the database server is further adapted for implementing a plurality of controls corresponding to each of the plurality of access levels, wherein the plurality of controls includes at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 15. A computer program product for configuring a medical database by a processor in communication with at least one storage device in a computing environment, the computer program product comprising a computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:
a first executable portion for assigning medical data to a patient; a second executable portion for organizing a plurality of data types for the medical data; a third executable portion for designating a first portion of each of the plurality of data types as public data; a fourth executable portion for designating a second portion of each of the plurality of data types as private data; a fifth executable portion for organizing a plurality of access levels for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient; a sixth executable portion for classifying the medical data:
according to the plurality of data types,
for each of the plurality of data types, according to the plurality of access levels, and
according to one of the public and the private data; and
a seventh executable portion for encrypting the data in a hierarchical structure corresponding to each of the plurality of access levels. 16. The computer program product of claim 15, further including an eighth executable portion for storing the data on a remote data storage subsystem accessible by a host computer, wherein the remote data storage subsystem incorporates the at least one storage device. 17. The computer program product of claim 16, wherein the eighth executable portion for storing the data on the remote data storage subsystem accessible by a host computer includes a ninth executable portion for configuring a storage controller unit residing in the remote data storage system to:
accept at least one private encryption key associated with at least one of the plurality of access levels, authenticate the at least one private encryption key, decrypt a segment of the data corresponding to the at least one private encryption key, and forward the segment of the data to the host computer. 18. The computer program product of claim 15, wherein the second executable portion for organizing a plurality of data types for the medical data includes an eighth executable portion for categorizing the data according to general, diagnostic, medical professional, and insurance data types. 19. The computer program product of claim 15, further including an eighth executable portion for designating additional access levels to correspond to medical and insurance personnel. 20. The computer program product of claim 15, wherein the fifth executable portion for organizing the plurality of access levels for the medical data includes an eighth executable portion for implementing at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. 21. A medical database operational on a database server utilizing a processor in communication with at least one storage device in a computing environment, comprising:
medical data assigned to a patient; a plurality of data types organized for the medical data; a first portion of each of the plurality of data types designated as public data; a second portion of each of the plurality of data types designated as private data; and a plurality of access levels organized for the medical data, wherein each of the plurality of data types includes the plurality of access levels, a first access level of the plurality of access levels corresponding to the patient, wherein the medical data:
is classified according to the plurality of data types, for each of the plurality of data types, according to the plurality of access levels, and according to one of the public and the private data, and
is encrypted in a hierarchical structure corresponding to each of the plurality of access levels. 22. The medical database of claim 21, wherein the medical data is stored on a remote data storage subsystem accessible by a host computer, wherein the remote data storage subsystem incorporates the at least one storage device. 23. The medical database of claim 22, further including:
at least one private encryption key associated with at least one of the plurality of access levels, the at least one private encryption key accepted and authenticated by a storage controller unit in communication with the at least one storage device. 24. The medical database of claim 21, wherein the data types include at least one of general, diagnostic, medical professional and insurance. 25. The medical database of claim 21, wherein each of the plurality of access levels further include a includes at least one of a read access control, a write access control, a number of allowed accesses, contents allowed to be accessed, and contents required to be restricted. | 3,600 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.