Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
5,200 | 14,365,520 | 2,127 | A hydrocarbon shale reservoir simulation system and method represented by a model having at least four different types of porosity nodes is described. The method includes the computer-implemented steps of characterizing porosity nodes within the model as one of natural fracture pore systems, matrix pore systems, induced fracture pore systems or vug pore systems. Following characterization, transfer terms between nodes are identified. Transfer terms may include transfer terms between vug nodes, matrix nodes, natural fracture nodes and induced fracture nodes. Once transfer terms have been assigned, the linear system for the model can be solved utilizing a linear solver. The method further includes the steps of utilizing the characterized pore nodes to define one or more subgrids that represent a zone within the reservoir, wherein the zone includes at least one node of each porosity type; and wherein the linear solver is applied by subgrid or associated sub-grids. | 1. A method for performing simulation of a shale reservoir represented by a model, the method comprising computer-implemented steps of:
characterizing at least three different porosity types for the modeled reservoir, the at least three different porosity types selected from the group consisting of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; identifying transfer terms between the at least three porosity types; and solving a linear system for the model using a linear solver. 2. The method of claim 1, wherein the formation is characterized with at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems. 3. The method of claim 1, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir. 4. The method of claim 3, wherein each zone includes a plurality of nodes of at least one of the porosity types. 5. The method of claim 3, wherein a subgrid for at least three different porosity types is created for a zone. 6. The method of claim 3, wherein a subgrid for each of the four porosity types is created for a zone. 7. The method of claim 5, wherein each zone includes a plurality of nodes of at least one of the porosity types. 8. The method of claim 7, wherein transfer terms between the same node types within the same subgrid are identified. 9. The method of claim 7, wherein transfer terms between different node types in different subgrids are identified. 10. The method of claim 7, wherein transfer terms between the different node types within the same subgrid are identified. 11. The method of claim 7, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 12. The method of claim 11, wherein the transfer terms include initial pore pressures, fluid distributions and volumes. 13. The method of claim 11, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, and wherein the zone includes at least one node of each porosity type. 14. The method of claim 1, wherein the step of solving the linear system comprises selecting non-linear equations to represent the modeled reservoir; and linearizing the nonlinear equations for subsequent solving using the linear solver. 15. The method of claim 1, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the linear solver is applied by subgrid or associated subgrids. 16. The method of claim 1, wherein the step of solving a linear system is iterated utilizing the resultant magnitudes until a desired degree of convergence is achieved between the linear and non-linear equations. 17. The method of 1, further comprising the step of altering the wellbore pressure of the model to achieve a desired level of mass transfer and fluid flow for the modeled reservoir. 18. A computer program product comprising non-transitory computer-readable medium having stored thereon instructions executable by a computer for causing the computer perform simulation of a reservoir represented by a model having a plurality of porosity nodes, the instructions for causing the computer to:
characterizing at least three different porosity types for the modeled reservoir, the at least three different porosity types selected from the group consisting of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; identifying transfer terms between the nodes of at least three porosity types; and solving a linear system for the model using a linear solver. 19. The computer program product of claim 18, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type. 20. The computer program product of claim 19, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 21. The computer program product of claim 21, wherein the linear solver is applied by subgrid or associated subgrids. 22. A method for drilling one or more wellbores in shale reservoir, which method comprises:
modeling an oil and gas shale reservoir having natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; characterizing at least three different porosity types in the modeled reservoir, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type; assigning transfer terms between the at least three porosity types, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids; and solving a linear system for the model using a linear solver; preparing equipment to construct a portion of said wellbore; based on the modeled reservoir, selecting a characteristic for the wellbore; and drilling a wellbore in accordance with the selected characteristic. 23. The method of claim 22, wherein the selected characteristic is the trajectory of the wellbore. 24. The method of claim 22, wherein the selected characteristic is the pressure of the wellbore. 25. The method of claim 24, further comprising the step of iteratively altering the wellbore pressure of the model to identify a wellbore pressure at which a desired level of mass transfer and fluid flow for the modeled reservoir is achieved; and utilizing the identified wellbore pressure as the selected characteristic. 26. The method of claim 22, further comprising the steps of drilling a first wellbore in the reservoir; recording values associated with mass transfer and fluid flow around the first wellbore; and utilizing the recorded vales as the values associated with a portion of the assigned transfer terms between the at least three porosity types; and drilling a second wellbore in the reservoir, wherein the second wellbore is the wellbore drilled in accordance with the selected characteristic. 27. The method of claim 22, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type. 28. The method of claim 27, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 29. The method of claim 28, wherein the linear solver is applied by subgrid or associated subgrids. | A hydrocarbon shale reservoir simulation system and method represented by a model having at least four different types of porosity nodes is described. The method includes the computer-implemented steps of characterizing porosity nodes within the model as one of natural fracture pore systems, matrix pore systems, induced fracture pore systems or vug pore systems. Following characterization, transfer terms between nodes are identified. Transfer terms may include transfer terms between vug nodes, matrix nodes, natural fracture nodes and induced fracture nodes. Once transfer terms have been assigned, the linear system for the model can be solved utilizing a linear solver. The method further includes the steps of utilizing the characterized pore nodes to define one or more subgrids that represent a zone within the reservoir, wherein the zone includes at least one node of each porosity type; and wherein the linear solver is applied by subgrid or associated sub-grids.1. A method for performing simulation of a shale reservoir represented by a model, the method comprising computer-implemented steps of:
characterizing at least three different porosity types for the modeled reservoir, the at least three different porosity types selected from the group consisting of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; identifying transfer terms between the at least three porosity types; and solving a linear system for the model using a linear solver. 2. The method of claim 1, wherein the formation is characterized with at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems. 3. The method of claim 1, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir. 4. The method of claim 3, wherein each zone includes a plurality of nodes of at least one of the porosity types. 5. The method of claim 3, wherein a subgrid for at least three different porosity types is created for a zone. 6. The method of claim 3, wherein a subgrid for each of the four porosity types is created for a zone. 7. The method of claim 5, wherein each zone includes a plurality of nodes of at least one of the porosity types. 8. The method of claim 7, wherein transfer terms between the same node types within the same subgrid are identified. 9. The method of claim 7, wherein transfer terms between different node types in different subgrids are identified. 10. The method of claim 7, wherein transfer terms between the different node types within the same subgrid are identified. 11. The method of claim 7, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 12. The method of claim 11, wherein the transfer terms include initial pore pressures, fluid distributions and volumes. 13. The method of claim 11, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, and wherein the zone includes at least one node of each porosity type. 14. The method of claim 1, wherein the step of solving the linear system comprises selecting non-linear equations to represent the modeled reservoir; and linearizing the nonlinear equations for subsequent solving using the linear solver. 15. The method of claim 1, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the linear solver is applied by subgrid or associated subgrids. 16. The method of claim 1, wherein the step of solving a linear system is iterated utilizing the resultant magnitudes until a desired degree of convergence is achieved between the linear and non-linear equations. 17. The method of 1, further comprising the step of altering the wellbore pressure of the model to achieve a desired level of mass transfer and fluid flow for the modeled reservoir. 18. A computer program product comprising non-transitory computer-readable medium having stored thereon instructions executable by a computer for causing the computer perform simulation of a reservoir represented by a model having a plurality of porosity nodes, the instructions for causing the computer to:
characterizing at least three different porosity types for the modeled reservoir, the at least three different porosity types selected from the group consisting of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; identifying transfer terms between the nodes of at least three porosity types; and solving a linear system for the model using a linear solver. 19. The computer program product of claim 18, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type. 20. The computer program product of claim 19, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 21. The computer program product of claim 21, wherein the linear solver is applied by subgrid or associated subgrids. 22. A method for drilling one or more wellbores in shale reservoir, which method comprises:
modeling an oil and gas shale reservoir having natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems; characterizing at least three different porosity types in the modeled reservoir, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type; assigning transfer terms between the at least three porosity types, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids; and solving a linear system for the model using a linear solver; preparing equipment to construct a portion of said wellbore; based on the modeled reservoir, selecting a characteristic for the wellbore; and drilling a wellbore in accordance with the selected characteristic. 23. The method of claim 22, wherein the selected characteristic is the trajectory of the wellbore. 24. The method of claim 22, wherein the selected characteristic is the pressure of the wellbore. 25. The method of claim 24, further comprising the step of iteratively altering the wellbore pressure of the model to identify a wellbore pressure at which a desired level of mass transfer and fluid flow for the modeled reservoir is achieved; and utilizing the identified wellbore pressure as the selected characteristic. 26. The method of claim 22, further comprising the steps of drilling a first wellbore in the reservoir; recording values associated with mass transfer and fluid flow around the first wellbore; and utilizing the recorded vales as the values associated with a portion of the assigned transfer terms between the at least three porosity types; and drilling a second wellbore in the reservoir, wherein the second wellbore is the wellbore drilled in accordance with the selected characteristic. 27. The method of claim 22, wherein the characterized pore types include at least one of each of the porosity types of natural fracture pore systems, matrix pore systems, induced fracture pore systems and vug pore systems, wherein the characterized pore types are utilized to create one or more subgrids that represent a zone within the reservoir, and wherein the zone includes at least one node of each porosity type. 28. The method of claim 27, wherein transfer terms between nodes are assigned on a nodal basis to the nodes of the subgrids. 29. The method of claim 28, wherein the linear solver is applied by subgrid or associated subgrids. | 2,100 |
5,201 | 14,177,810 | 2,166 | Various methods and systems for in-place unformatting of disks are provided. The system includes a preparation component configured for creating a backup file on the disk and a preformatting component for using the backup file to occupy a predetermined location that defines a backup zone on the disk. The backup file is a space-holder such that the preformatting component copies primal data and file table data to the backup zone. The system further includes a formatting component for formatting the disk storing the primal data and the file table and an unformatting component that copies the primal data and file table data from the backup zone back to their original locations to unformat the disk to a preformat configuration. A safeguard component may also be implemented to ensure that the preformat component is invoked before the format component if the preparation component was executed on a volume. | 1. A distributed system comprising:
a preparation component configured for:
creating a backup file on a disk;
a preformatting component configured for:
using the backup file to occupy a predetermined location that defines a backup zone on the disk, wherein the backup file is stored in the backup zone;
copying primal data from a primal zone to the backup zone; and
copying file table data to the backup zone;
a formatting component configured for:
formatting the disk having the primal data and the file table data in the backup zone;
an unformatting component configured for:
copying the primal data from the backup zone to the primal zone;
copying the file table data to at least a file table zone; and
unformatting the disk to a preformat configuration. 2. The distributed system of claim 1, further comprising:
a controller component configured for:
enumerating a plurality of disks in the distributed system; and
receiving a request to perform one or more operations on a selected disk, the one or more operations comprising:
a preparation operation;
a preformatting operation;
a formatting operation; and
an unformatting operation; and 3. The distributed system of claim 2, further comprising:
the preparation component configured for:
creating the backup file at a physical hardcoded location on the disk, wherein the physical hardcoded location on the disk is relative to a starting location of the disk not the volume of the disk. 4. The distributed system of claim 3, wherein the backup file is created in a root directory of the volume. 5. The distributed system of claim 3, wherein the physical hardcoded location is located proximate a nominal capacity of a disk configuration in the distributed system. 6. The distributed system of claim 1, wherein the preformatting component is further configured for:
truncating at least a first portion of the backup file; and positioning at least a second portion of the backup file contiguously on the disk in the backup zone. 7. The distributed system of claim 1, wherein the preformatting component is further configured for:
positioning at least a portion of the backup file contiguously on the disk in the backup zone; overwriting a first portion of the backup file with the primal data; and overwriting a second portion of the backup file with the file table data. 8. The distributed system of claim 1, further comprising a safeguard component configured for:
intercepting a request for a destructive disk operation; verifying whether a safeguard condition of the disk operation is satisfied; proceeding with the request when the safeguard condition is satisfied; and redirecting the request when the safeguard condition is not satisfied. 9. One or more computer storage media having computer-executable instructions embodied thereon that, when executed, cause a computing device to perform a method for formatting disks for in-place unformatting, the method comprising:
using a backup file to occupy a predetermined location that defines a backup zone on the disk, wherein the backup file is stored in the backup zone; copying primal data from a primal zone to the backup zone; and copying file table data to the backup zone; and formatting the disk storing the primal data and the file table data; 10. The method of claim 9, wherein the predetermined location is a physical hardcoded location on the disk, wherein the physical hardcoded location is relative to a starting location of the disk not the volume. 11. The method of claim 10, wherein using the backup file to occupy the predetermined location that defines the backup zone further comprises:
positioning at least a portion the backup file contiguously on the disk in the backup zone. 12. The method of claim 10, wherein using the backup file to occupy the predetermined location that defines the backup zone further comprises:
truncating at least a first portion of the backup file; and positioning at least a second portion of the backup file contiguously on the disk in the backup zone. 13. The method of claim 12, wherein truncating at least the first portion of the backup file is based on a determination that not all of the clusters in the backup zone are available. 14. The method of claim 13, wherein the first fragment is at least half the size of the second fragment. 15. The method of claim 10, wherein copying the file table data and the primal data further comprises:
overwriting a first portion of the backup file with the primal data; and overwriting a second portion of the backup file with the file table data. 16. The method of claim 9, wherein the primal zone is located relative to a starting point of a volume of the disk extending adjacent to a file table zone starting point. 17. The method of claim 9, wherein the primal data comprises file table data and non-file table data file. 18. A computer-implemented method for in-place unformatting disks, suitable for use in a distributed computing environment utilizing a processor and a memory, the method comprising:
copying primal data from a backup zone of a disk to a primal zone of the disk, the primal data occupying a first portion of a predetermined location that defines the backup zone on the disk; copying file table data from the backup zone to at least a file table zone, the file table data occupying a second portion of the predetermined location, the predetermined location configured using a backup file; and unformatting the disk to a preformat configuration. 19. The computer-implemented method of claim 18, copying the file table data further comprises using mapping information for the file table data to store the file table to their previous locations on the volume. 20. The computer-implemented method of claim 18, copying the file table data from the backup zone to the file table zone further comprises overwriting at least portion of a post-format file table data in the file table zone. | Various methods and systems for in-place unformatting of disks are provided. The system includes a preparation component configured for creating a backup file on the disk and a preformatting component for using the backup file to occupy a predetermined location that defines a backup zone on the disk. The backup file is a space-holder such that the preformatting component copies primal data and file table data to the backup zone. The system further includes a formatting component for formatting the disk storing the primal data and the file table and an unformatting component that copies the primal data and file table data from the backup zone back to their original locations to unformat the disk to a preformat configuration. A safeguard component may also be implemented to ensure that the preformat component is invoked before the format component if the preparation component was executed on a volume.1. A distributed system comprising:
a preparation component configured for:
creating a backup file on a disk;
a preformatting component configured for:
using the backup file to occupy a predetermined location that defines a backup zone on the disk, wherein the backup file is stored in the backup zone;
copying primal data from a primal zone to the backup zone; and
copying file table data to the backup zone;
a formatting component configured for:
formatting the disk having the primal data and the file table data in the backup zone;
an unformatting component configured for:
copying the primal data from the backup zone to the primal zone;
copying the file table data to at least a file table zone; and
unformatting the disk to a preformat configuration. 2. The distributed system of claim 1, further comprising:
a controller component configured for:
enumerating a plurality of disks in the distributed system; and
receiving a request to perform one or more operations on a selected disk, the one or more operations comprising:
a preparation operation;
a preformatting operation;
a formatting operation; and
an unformatting operation; and 3. The distributed system of claim 2, further comprising:
the preparation component configured for:
creating the backup file at a physical hardcoded location on the disk, wherein the physical hardcoded location on the disk is relative to a starting location of the disk not the volume of the disk. 4. The distributed system of claim 3, wherein the backup file is created in a root directory of the volume. 5. The distributed system of claim 3, wherein the physical hardcoded location is located proximate a nominal capacity of a disk configuration in the distributed system. 6. The distributed system of claim 1, wherein the preformatting component is further configured for:
truncating at least a first portion of the backup file; and positioning at least a second portion of the backup file contiguously on the disk in the backup zone. 7. The distributed system of claim 1, wherein the preformatting component is further configured for:
positioning at least a portion of the backup file contiguously on the disk in the backup zone; overwriting a first portion of the backup file with the primal data; and overwriting a second portion of the backup file with the file table data. 8. The distributed system of claim 1, further comprising a safeguard component configured for:
intercepting a request for a destructive disk operation; verifying whether a safeguard condition of the disk operation is satisfied; proceeding with the request when the safeguard condition is satisfied; and redirecting the request when the safeguard condition is not satisfied. 9. One or more computer storage media having computer-executable instructions embodied thereon that, when executed, cause a computing device to perform a method for formatting disks for in-place unformatting, the method comprising:
using a backup file to occupy a predetermined location that defines a backup zone on the disk, wherein the backup file is stored in the backup zone; copying primal data from a primal zone to the backup zone; and copying file table data to the backup zone; and formatting the disk storing the primal data and the file table data; 10. The method of claim 9, wherein the predetermined location is a physical hardcoded location on the disk, wherein the physical hardcoded location is relative to a starting location of the disk not the volume. 11. The method of claim 10, wherein using the backup file to occupy the predetermined location that defines the backup zone further comprises:
positioning at least a portion the backup file contiguously on the disk in the backup zone. 12. The method of claim 10, wherein using the backup file to occupy the predetermined location that defines the backup zone further comprises:
truncating at least a first portion of the backup file; and positioning at least a second portion of the backup file contiguously on the disk in the backup zone. 13. The method of claim 12, wherein truncating at least the first portion of the backup file is based on a determination that not all of the clusters in the backup zone are available. 14. The method of claim 13, wherein the first fragment is at least half the size of the second fragment. 15. The method of claim 10, wherein copying the file table data and the primal data further comprises:
overwriting a first portion of the backup file with the primal data; and overwriting a second portion of the backup file with the file table data. 16. The method of claim 9, wherein the primal zone is located relative to a starting point of a volume of the disk extending adjacent to a file table zone starting point. 17. The method of claim 9, wherein the primal data comprises file table data and non-file table data file. 18. A computer-implemented method for in-place unformatting disks, suitable for use in a distributed computing environment utilizing a processor and a memory, the method comprising:
copying primal data from a backup zone of a disk to a primal zone of the disk, the primal data occupying a first portion of a predetermined location that defines the backup zone on the disk; copying file table data from the backup zone to at least a file table zone, the file table data occupying a second portion of the predetermined location, the predetermined location configured using a backup file; and unformatting the disk to a preformat configuration. 19. The computer-implemented method of claim 18, copying the file table data further comprises using mapping information for the file table data to store the file table to their previous locations on the volume. 20. The computer-implemented method of claim 18, copying the file table data from the backup zone to the file table zone further comprises overwriting at least portion of a post-format file table data in the file table zone. | 2,100 |
5,202 | 13,914,028 | 2,145 | A client device includes at least one processor that executes an event wizard client application in conjunction with a user interface to display event type menu data, receive event type selection data, receive event size selection data, displaying event budget menu data, receive event budget selection data, display event budget data, displaying event option menu data, receive event option selection data, display event invitee menu data, and receive event invitee selection data. | 1. A client device comprising:
a user interface; a network interface for communicating via a network; a memory that stores an event wizard client application and location data; a processing module, coupled to the memory, the user interface and the network interface, the processing module including at least one processor that executes the event wizard client application by: displaying event type menu data via the user interface that includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data generated via the user interface that includes a plurality of budget options that are based on the event selection data, the event size selection data and the location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options that are generated based on the event selection data and the location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that selects at least one event option based on the event option menu data; displaying event invitee menu data via the user interface that includes contact data corresponding to the user; and receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data. 2. The client device of claim 1 wherein the event option menu displays costs associated with the plurality of event options and the event budget data is updated based on the event option selection data. 3. The event wizard server of claim 1 wherein the content data are retrieved from a social media server having an account associated with the user via the network interface. 4. The event wizard server of claim 1 wherein the content data are retrieved from a messaging application stored in the memory. 5. The event wizard server of claim 1 wherein the event size selection data indicates an estimated number of attendees to the event. 6. The event wizard server of claim 1 wherein the event budget data is updated to generate updated event budget data based on the event invitee selection data. 7. The event wizard server of claim 6 wherein the event invitee menu includes the updated event budget data. 8. The event wizard server of claim 1 wherein the event budget data is updated based on the event invitee selection data and an estimated attendance percentage. 9. The event wizard server of claim 1 wherein the processing module sends the invitee selection data to an invitation server via the network interface. 10. The event wizard server of claim 9 wherein the event budget data is updated based on the event invitee selection data and invitee acceptance data received from the invitation server. 11. A method for use in a client device, the method comprising:
displaying event type menu data via a user interface of the client device, wherein the event type menu data includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data via the user interface, wherein the event budget menu data includes a plurality of budget options that are based on the event selection data, the event size selection data and location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options, wherein the event option menu data are generated based on the based on the event selection data and location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that indicates selection of at least one event option based on the event option menu data; displaying event invitee menu data via the user interface, wherein the event invitee menu data includes contact data corresponding to the user; receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data; and updating the event budget data based on the event option selection data, and the event invitee selection data. 12. The method of claim 11 wherein the event option menu displays costs associated with the plurality of event options. 13. The method of claim 11 wherein the external location includes a social media server having an account associated with the user. 14. The method of claim 11 wherein the external location includes a messaging application of the client device. 15. The method of claim 11 wherein the event size selection data indicates an estimated number of attendees to the event. 16. The method of claim 11 wherein the event invitee menu displays the updated event budget data. 17. The method of claim 11 wherein the updated event budget data is further based on an estimated attendance percentage. 18. The method of claim 11 wherein the processing module sends the invitee selection data to an invitation server via the network interface. 19. The method of claim 18 wherein the updated event budget data is further based on invitee acceptance data received from the invitation server. 20. A client device comprising:
a user interface; a network interface for communicating via a network; a memory that stores an event wizard client application and location data; a processing module, coupled to the memory, the user interface and the network interface, the processing module including at least one processor that executes the event wizard client application by: displaying event type menu data via the user interface that includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data generated via the user interface that includes a plurality of budget options that are based on the event selection data, the event size selection data and the location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options that are generated based on the event selection data and the location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that selects at least one event option based on the event option menu data; displaying event invitee menu data via the user interface that includes contact data corresponding to the user; and receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data. wherein the event option menu displays costs associated with the plurality of event options and the event budget data is updated based on the event option selection data and the event invitee selection data. | A client device includes at least one processor that executes an event wizard client application in conjunction with a user interface to display event type menu data, receive event type selection data, receive event size selection data, displaying event budget menu data, receive event budget selection data, display event budget data, displaying event option menu data, receive event option selection data, display event invitee menu data, and receive event invitee selection data.1. A client device comprising:
a user interface; a network interface for communicating via a network; a memory that stores an event wizard client application and location data; a processing module, coupled to the memory, the user interface and the network interface, the processing module including at least one processor that executes the event wizard client application by: displaying event type menu data via the user interface that includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data generated via the user interface that includes a plurality of budget options that are based on the event selection data, the event size selection data and the location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options that are generated based on the event selection data and the location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that selects at least one event option based on the event option menu data; displaying event invitee menu data via the user interface that includes contact data corresponding to the user; and receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data. 2. The client device of claim 1 wherein the event option menu displays costs associated with the plurality of event options and the event budget data is updated based on the event option selection data. 3. The event wizard server of claim 1 wherein the content data are retrieved from a social media server having an account associated with the user via the network interface. 4. The event wizard server of claim 1 wherein the content data are retrieved from a messaging application stored in the memory. 5. The event wizard server of claim 1 wherein the event size selection data indicates an estimated number of attendees to the event. 6. The event wizard server of claim 1 wherein the event budget data is updated to generate updated event budget data based on the event invitee selection data. 7. The event wizard server of claim 6 wherein the event invitee menu includes the updated event budget data. 8. The event wizard server of claim 1 wherein the event budget data is updated based on the event invitee selection data and an estimated attendance percentage. 9. The event wizard server of claim 1 wherein the processing module sends the invitee selection data to an invitation server via the network interface. 10. The event wizard server of claim 9 wherein the event budget data is updated based on the event invitee selection data and invitee acceptance data received from the invitation server. 11. A method for use in a client device, the method comprising:
displaying event type menu data via a user interface of the client device, wherein the event type menu data includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data via the user interface, wherein the event budget menu data includes a plurality of budget options that are based on the event selection data, the event size selection data and location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options, wherein the event option menu data are generated based on the based on the event selection data and location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that indicates selection of at least one event option based on the event option menu data; displaying event invitee menu data via the user interface, wherein the event invitee menu data includes contact data corresponding to the user; receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data; and updating the event budget data based on the event option selection data, and the event invitee selection data. 12. The method of claim 11 wherein the event option menu displays costs associated with the plurality of event options. 13. The method of claim 11 wherein the external location includes a social media server having an account associated with the user. 14. The method of claim 11 wherein the external location includes a messaging application of the client device. 15. The method of claim 11 wherein the event size selection data indicates an estimated number of attendees to the event. 16. The method of claim 11 wherein the event invitee menu displays the updated event budget data. 17. The method of claim 11 wherein the updated event budget data is further based on an estimated attendance percentage. 18. The method of claim 11 wherein the processing module sends the invitee selection data to an invitation server via the network interface. 19. The method of claim 18 wherein the updated event budget data is further based on invitee acceptance data received from the invitation server. 20. A client device comprising:
a user interface; a network interface for communicating via a network; a memory that stores an event wizard client application and location data; a processing module, coupled to the memory, the user interface and the network interface, the processing module including at least one processor that executes the event wizard client application by: displaying event type menu data via the user interface that includes a plurality of general event types and a plurality of specific events; receiving event type selection data via the user interface that indicates an event type based on the event type menu data; receiving event size selection data via the user interface that indicates an event size; displaying event budget menu data generated via the user interface that includes a plurality of budget options that are based on the event selection data, the event size selection data and the location data; receiving event budget selection data via the user interface that indicates a selected one of the plurality of budget options; displaying event budget data in response to the selected one of the plurality of plurality of budget options; displaying event option menu data via the user interface that includes a plurality of event options that are generated based on the event selection data and the location data, wherein the event options correspond to at least one of: an event venue, an event caterer, an event invitation, event entertainment and event transportation; receiving event option selection data via the user interface that selects at least one event option based on the event option menu data; displaying event invitee menu data via the user interface that includes contact data corresponding to the user; and receiving event invitee selection data via the user interface that indicates a plurality of invitees based on the event invitee menu data. wherein the event option menu displays costs associated with the plurality of event options and the event budget data is updated based on the event option selection data and the event invitee selection data. | 2,100 |
5,203 | 14,388,177 | 2,163 | An association method includes identifying candidate file sets from a plurality of application files. Content indicative of each of the candidate file sets is presented. An application is associated with application files of one of the candidate file sets according to a detected selection of the content indicative of that candidate file set. | 1. An association method, comprising:
identifying candidate file sets from a plurality of application files, each candidate file set including a cluster of related but unrecognized application files; presenting content indicative of each of the candidate file sets; and associating an application with application files of one of the candidate file sets according to a detected selection of the content indicative of the one of the candidate file set. 2. The method of claim 1, wherein the candidate file sets include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set. 3. The method of claim 1, wherein identifying candidate file sets comprises constructing a frequent pattern tree from the found application files and identifying the candidate file sets that are frequent file sets from the frequent pattern tree. 4. The method of claim 1 wherein identifying candidate file sets comprises identifying candidate file sets having a support exceeding a predetermined threshold support. 5. The method of claim 1, wherein identifying candidate file sets comprises identifying candidate file sets of sizes exceeding a predetermined threshold size. 6. The method of claim 1, wherein, for each identified candidate file set, the content presented for that candidate file set is indicative of at least one of a support and a size of the candidate file set. 7. The method of claim 1, wherein the plurality of application files is a first plurality, the method comprising:
generating a rule based on the association between the application and its corresponding candidate file set; and processing the rule to automatically associate unrecognized files of a second plurality of application files with the application. 8. A computer readable medium having instructions stored thereon that when executed by a processing resource implement a system comprising a file set engine, a presentation engine, and an association engine, wherein:
the file set engine is configured to examine a plurality of unrecognized files of two or more computing devices and identify candidate file sets from the plurality, each candidate file set including a cluster of related but unrecognized application files; the presentation engine is configured to present content indicative of each identified candidate file set; and the association engine is configured to detect a selection of content indicative of one of the candidate file sets and associate an application with an application file of that one of the candidate file sets. 9. The medium of claim 8, wherein the file set engine is configured to identify candidate file sets that include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set. 10. The medium of claim 8, wherein the file set engine is configured to construct a data structure representing quantitative information about frequent patterns found within the set of unrecognized files and identify the candidate file sets that are frequent file sets from the data structure. 11. The medium of claim 8 wherein the file set engine is configured to identify candidate file sets having a support exceeding a predetermined threshold. 12. The medium of claim 8, wherein the file set engine is configured to identify candidate file sets of sizes exceeding a predetermined threshold. 13. The medium of claim 8, wherein, for each identified candidate file set, the presentation engine is configured to present content for that candidate file set that is indicative of at least one of a support and a file set size of the candidate file set. 14. The medium of claim 8, wherein:
the plurality of application files is a first plurality, wherein the association engine is configured to generate a rule based on the association between the application its corresponding candidate file set; and the system includes a recognition engine configured to process the rule to automatically associate unrecognized files of a second plurality of application files with the application. 15. A system comprising a processing resource and a non-transitory computer readable medium and instructions stored on the medium, wherein the instructions, when executed, cause the processing resource to implement a method, comprising:
examining a plurality of unrecognized application files of two or more computing devices to identify candidate file sets from the plurality; presenting content indicative of each of the candidate file sets; and associating an application with the application files of a given one of the candidate file sets according to a selection of the content indicative of that candidate file set. 16. The system of claim 15, wherein the identified candidate file sets include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set 17. The system of claim 15, wherein examining comprises constructing a frequent pattern tree representing quantitative information about candidate patterns found within the set of unrecognized files and identifying the candidate file sets that are frequent file sets utilizing the frequent pattern tree. 18. The system of claim 15, identifying the candidate pattern sets comprises identifying candidate pattern sets having a support exceeding a first predetermined threshold and a size exceeding a second predetermined threshold. 19. The system of claim 15, wherein, for each identified candidate pattern file set, the content presented for that candidate pattern set is indicative of at least one of a support and a file set size of the candidate pattern file set. 20. The system of claim 15, wherein the plurality of application files is a first plurality and wherein the method further comprises:
generating a rule based on the association between the application its associated candidate file set; and processing the rule to automatically associate unrecognized files of a second plurality of application files with the application, the unrecognized files corresponding to one or more files of the corresponding candidate file set. | An association method includes identifying candidate file sets from a plurality of application files. Content indicative of each of the candidate file sets is presented. An application is associated with application files of one of the candidate file sets according to a detected selection of the content indicative of that candidate file set.1. An association method, comprising:
identifying candidate file sets from a plurality of application files, each candidate file set including a cluster of related but unrecognized application files; presenting content indicative of each of the candidate file sets; and associating an application with application files of one of the candidate file sets according to a detected selection of the content indicative of the one of the candidate file set. 2. The method of claim 1, wherein the candidate file sets include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set. 3. The method of claim 1, wherein identifying candidate file sets comprises constructing a frequent pattern tree from the found application files and identifying the candidate file sets that are frequent file sets from the frequent pattern tree. 4. The method of claim 1 wherein identifying candidate file sets comprises identifying candidate file sets having a support exceeding a predetermined threshold support. 5. The method of claim 1, wherein identifying candidate file sets comprises identifying candidate file sets of sizes exceeding a predetermined threshold size. 6. The method of claim 1, wherein, for each identified candidate file set, the content presented for that candidate file set is indicative of at least one of a support and a size of the candidate file set. 7. The method of claim 1, wherein the plurality of application files is a first plurality, the method comprising:
generating a rule based on the association between the application and its corresponding candidate file set; and processing the rule to automatically associate unrecognized files of a second plurality of application files with the application. 8. A computer readable medium having instructions stored thereon that when executed by a processing resource implement a system comprising a file set engine, a presentation engine, and an association engine, wherein:
the file set engine is configured to examine a plurality of unrecognized files of two or more computing devices and identify candidate file sets from the plurality, each candidate file set including a cluster of related but unrecognized application files; the presentation engine is configured to present content indicative of each identified candidate file set; and the association engine is configured to detect a selection of content indicative of one of the candidate file sets and associate an application with an application file of that one of the candidate file sets. 9. The medium of claim 8, wherein the file set engine is configured to identify candidate file sets that include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set. 10. The medium of claim 8, wherein the file set engine is configured to construct a data structure representing quantitative information about frequent patterns found within the set of unrecognized files and identify the candidate file sets that are frequent file sets from the data structure. 11. The medium of claim 8 wherein the file set engine is configured to identify candidate file sets having a support exceeding a predetermined threshold. 12. The medium of claim 8, wherein the file set engine is configured to identify candidate file sets of sizes exceeding a predetermined threshold. 13. The medium of claim 8, wherein, for each identified candidate file set, the presentation engine is configured to present content for that candidate file set that is indicative of at least one of a support and a file set size of the candidate file set. 14. The medium of claim 8, wherein:
the plurality of application files is a first plurality, wherein the association engine is configured to generate a rule based on the association between the application its corresponding candidate file set; and the system includes a recognition engine configured to process the rule to automatically associate unrecognized files of a second plurality of application files with the application. 15. A system comprising a processing resource and a non-transitory computer readable medium and instructions stored on the medium, wherein the instructions, when executed, cause the processing resource to implement a method, comprising:
examining a plurality of unrecognized application files of two or more computing devices to identify candidate file sets from the plurality; presenting content indicative of each of the candidate file sets; and associating an application with the application files of a given one of the candidate file sets according to a selection of the content indicative of that candidate file set. 16. The system of claim 15, wherein the identified candidate file sets include at least one of a frequent file set, a common application package file set, a common version file set, and a common directory file set 17. The system of claim 15, wherein examining comprises constructing a frequent pattern tree representing quantitative information about candidate patterns found within the set of unrecognized files and identifying the candidate file sets that are frequent file sets utilizing the frequent pattern tree. 18. The system of claim 15, identifying the candidate pattern sets comprises identifying candidate pattern sets having a support exceeding a first predetermined threshold and a size exceeding a second predetermined threshold. 19. The system of claim 15, wherein, for each identified candidate pattern file set, the content presented for that candidate pattern set is indicative of at least one of a support and a file set size of the candidate pattern file set. 20. The system of claim 15, wherein the plurality of application files is a first plurality and wherein the method further comprises:
generating a rule based on the association between the application its associated candidate file set; and processing the rule to automatically associate unrecognized files of a second plurality of application files with the application, the unrecognized files corresponding to one or more files of the corresponding candidate file set. | 2,100 |
5,204 | 14,429,376 | 2,175 | The invention proposes a client device ( 2 ) having a screen ( 5 ), having a display device ( 6 ) for displaying a first image representation on said screen ( 5 ), wherein said first image representation shows an actual image section ( 9 ) in an actual selected range ( 10 ) from an image coordinate system P x , P y . The client device also has a selection device ( 7 ) which is designed to select a desired selected range ( 11 ) from the image coordinate system P x , P y , and a communications device ( 8 ) which is designed to request and receive a desired image section ( 12 ) of the desired selected range ( 11 ). The display device ( 6 ) is designed to display, in a second image representation, the actual image section ( 9 ) correctly in terms of position and size in the desired selected range ( 11 ) and, in an additional image representation, to display the desired image section ( 12 ) correctly in terms of position and size in the desired selected range ( 11 ), the actual image section ( 9 ) and the desired image section ( 12 ) coming from different images of an image sequence. | 1. A client device comprising:
a screen, a display device for displaying a first image display on the screen, the first image display showing an ACTUAL image section in an ACTUAL selection area from an image coordinate system, a selection device, the selection device being designed to select a DESIRED selection area from the image coordinate system, and a communication device, the communication device being designed to request and receive a DESIRED image section of the DESIRED selection area, the display device being designed to display the ACTUAL image section in a second image display in the correct position and at the correct size in the DESIRED selection area, and to display the DESIRED image section in a further image display in the correct position and at the correct size in the DESIRED selection area, the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. 2. The client device as claimed in claim 1, wherein the display device is designed to display an INTERMEDIATE image section at least partially in the correct position and at the correct size in the DESIRED selection area in the case of at least one intermediate image display upstream of the further image display. 3. The client device as claimed in claim 1, wherein the position-correct and size-correct display of the DESIRED image section is controlled in the DESIRED selection area by means of metadata. 4. The client device as claimed in claim 3, wherein the metadata form image coordinate points of the image coordinate system. 5. The client device as claimed in claim 1, wherein the selection device is designed to reposition the selection of the DESIRED selection area by an interactive shift of a selected pixel of the ACTUAL image section, the ACTUAL image section being shifted in common with the selected pixel in order to display the ACTUAL image section at least partially in the DESIRED selection area. 6. The client device as claimed in claim 1, wherein the selection device is designed to reposition the selection of the DESIRED selection area by an interactive shift of two selected pixels of the ACTUAL image section, the ACTUAL image section being scaled as a function of the position of the two selected pixels in order to display the ACTUAL image section at least partially in the DESIRED image section. 7. The client device as claimed in claim 1, wherein the selection device is designed as a touchscreen. 8. The client device as claimed in claim 1, wherein the display device is one selected from the group consisting of a cell phone and a tablet. 9. A monitoring system comprising:
a client device having
a screen,
a display device for displaying a first image display on the screen, the first image display showing an ACTUAL image section in an ACTUAL selection area from an image coordinate system,
a selection device, the selection device being designed to select a DESIRED selection area from the image coordinate system, and
a communication device, the communication device being designed to request and receive a DESIRED image section of the DESIRED selection area,
the display device being designed to display the ACTUAL image section in a second image display in the correct position and at the correct size in the DESIRED selection area, and to display the DESIRED image section in a further image display in the correct position and at the correct size in the DESIRED selection area,
the ACTUAL image section and the DESIRED image section originate from different images of an image sequence; and
a server having the image sequence and being designed to output the DESIRED image section. 10. The monitoring system as claimed in claim 9, wherein the server is assigned to at least one monitoring camera, the image sequence acquired by the at least one monitoring camera being designed as a live picture. 11. A method for displaying images on a screen of a client device, the method comprising:
displaying an ACTUAL image section in an ACTUAL selection area on the screen in a first image display, selecting a DESIRED selection area displaying the ACTUAL image section at least partially in a second image display, and displaying a DESIRED image section of the DESIRED selection area in the correct position and at the correct size in the DESIRED selection area in a further image display, and in which the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. 12. A computer program having program code, when the program code is executed on a computer, to carry out the following steps:
display an ACTUAL image section in an ACTUAL selection area on the screen in a first image display, select a DESIRED selection area display the ACTUAL image section at least partially in a second image display, and display a DESIRED image section of the DESIRED selection area in the correct position and at the correct size in the DESIRED selection area in a further image display, and in which the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. | The invention proposes a client device ( 2 ) having a screen ( 5 ), having a display device ( 6 ) for displaying a first image representation on said screen ( 5 ), wherein said first image representation shows an actual image section ( 9 ) in an actual selected range ( 10 ) from an image coordinate system P x , P y . The client device also has a selection device ( 7 ) which is designed to select a desired selected range ( 11 ) from the image coordinate system P x , P y , and a communications device ( 8 ) which is designed to request and receive a desired image section ( 12 ) of the desired selected range ( 11 ). The display device ( 6 ) is designed to display, in a second image representation, the actual image section ( 9 ) correctly in terms of position and size in the desired selected range ( 11 ) and, in an additional image representation, to display the desired image section ( 12 ) correctly in terms of position and size in the desired selected range ( 11 ), the actual image section ( 9 ) and the desired image section ( 12 ) coming from different images of an image sequence.1. A client device comprising:
a screen, a display device for displaying a first image display on the screen, the first image display showing an ACTUAL image section in an ACTUAL selection area from an image coordinate system, a selection device, the selection device being designed to select a DESIRED selection area from the image coordinate system, and a communication device, the communication device being designed to request and receive a DESIRED image section of the DESIRED selection area, the display device being designed to display the ACTUAL image section in a second image display in the correct position and at the correct size in the DESIRED selection area, and to display the DESIRED image section in a further image display in the correct position and at the correct size in the DESIRED selection area, the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. 2. The client device as claimed in claim 1, wherein the display device is designed to display an INTERMEDIATE image section at least partially in the correct position and at the correct size in the DESIRED selection area in the case of at least one intermediate image display upstream of the further image display. 3. The client device as claimed in claim 1, wherein the position-correct and size-correct display of the DESIRED image section is controlled in the DESIRED selection area by means of metadata. 4. The client device as claimed in claim 3, wherein the metadata form image coordinate points of the image coordinate system. 5. The client device as claimed in claim 1, wherein the selection device is designed to reposition the selection of the DESIRED selection area by an interactive shift of a selected pixel of the ACTUAL image section, the ACTUAL image section being shifted in common with the selected pixel in order to display the ACTUAL image section at least partially in the DESIRED selection area. 6. The client device as claimed in claim 1, wherein the selection device is designed to reposition the selection of the DESIRED selection area by an interactive shift of two selected pixels of the ACTUAL image section, the ACTUAL image section being scaled as a function of the position of the two selected pixels in order to display the ACTUAL image section at least partially in the DESIRED image section. 7. The client device as claimed in claim 1, wherein the selection device is designed as a touchscreen. 8. The client device as claimed in claim 1, wherein the display device is one selected from the group consisting of a cell phone and a tablet. 9. A monitoring system comprising:
a client device having
a screen,
a display device for displaying a first image display on the screen, the first image display showing an ACTUAL image section in an ACTUAL selection area from an image coordinate system,
a selection device, the selection device being designed to select a DESIRED selection area from the image coordinate system, and
a communication device, the communication device being designed to request and receive a DESIRED image section of the DESIRED selection area,
the display device being designed to display the ACTUAL image section in a second image display in the correct position and at the correct size in the DESIRED selection area, and to display the DESIRED image section in a further image display in the correct position and at the correct size in the DESIRED selection area,
the ACTUAL image section and the DESIRED image section originate from different images of an image sequence; and
a server having the image sequence and being designed to output the DESIRED image section. 10. The monitoring system as claimed in claim 9, wherein the server is assigned to at least one monitoring camera, the image sequence acquired by the at least one monitoring camera being designed as a live picture. 11. A method for displaying images on a screen of a client device, the method comprising:
displaying an ACTUAL image section in an ACTUAL selection area on the screen in a first image display, selecting a DESIRED selection area displaying the ACTUAL image section at least partially in a second image display, and displaying a DESIRED image section of the DESIRED selection area in the correct position and at the correct size in the DESIRED selection area in a further image display, and in which the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. 12. A computer program having program code, when the program code is executed on a computer, to carry out the following steps:
display an ACTUAL image section in an ACTUAL selection area on the screen in a first image display, select a DESIRED selection area display the ACTUAL image section at least partially in a second image display, and display a DESIRED image section of the DESIRED selection area in the correct position and at the correct size in the DESIRED selection area in a further image display, and in which the ACTUAL image section and the DESIRED image section originate from different images of an image sequence. | 2,100 |
5,205 | 12,364,170 | 2,169 | Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. | 1. A computer-implemented system comprising:
logic that receives at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the at least one robustness map to perform regression testing wherein landmarks are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. 2. The system according to claim 1 further comprising:
logic that characterizes severity of individual robustness bugs in terms of amplitude of the degradation, range of condition span for which the robustness bug is present, and frequency with which robustness bug conditions are historically encountered or expected to be encountered. 3. The system according to claim 1 further comprising:
logic that characterizes severity of individual robustness bugs in terms of degree to which the degradation can be remedied, estimation of the resources expended to correct the robustness bug, and assessment of risk associated with an action that corrects the robustness bug. 4. The system according to claim 1 further comprising:
a computer that executes the logic. 5. The system according to claim 1 further comprising:
an article of manufacture comprising:
a controller-usable medium having a computer readable program code embodied in a controller for testing database system performance, the computer readable program code further comprising:
code causing the controller to receive the at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions; and
code causing the controller to test performance based on locations and migrations of landmarks on the at least one robustness map. 6. A computer-implemented system comprising:
logic that receives at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions and tests performance based on locations and migrations of landmarks on the at least one robustness map. 7. The system according to claim 6 further comprising:
logic that evaluates robustness of a specified database system implementation in terms of degree of robustness exhibited when executing a predetermined database benchmark. 8. The system according to claim 6 further comprising:
logic that analyzes measurements and landmarks in the at least one robustness map, and uses the analysis to perform regression tests evaluating robustness of a database engine's operator implementations. 9. The system according to claim 6 further comprising:
logic that evaluates robustness of a specified database system implementation in terms of robustness of operator implementations. 10. The system according to claim 6 further comprising:
logic that tests performance comprising visualizing location and character of performance changes on the at least one robustness map wherein the at least one robustness map is analyzed to detect circumstances under which performance is sensitive to deviations from expected behavior, and identify performance anomalies. 11. The system according to claim 6 further comprising:
logic that detects performance degradation by determining curvature between data points on the at least one robustness map comprising identifying locations on the at least one robustness map wherein performance degrades by a predetermined amount or performance degrades in a manner different from a predetermined expected manner, the logic applying a corrective action according to the detected performance degradation. 12. The system according to claim 6 further comprising:
logic that uses the at least one robustness map to compare performance of an applied query plan and/or operator to a best known query plan and/or operator, the logic applying a corrective action according to the detected performance comparison. 13. The system according to claim 6 further comprising:
logic that uses the at least one robustness map to detect an error condition wherein performance improves as workload increases or operating resources decrease. 14. A computer-implemented method comprising:
testing a database system comprising:
receiving at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions; and
using information from the at least one robustness map to perform regression testing wherein landmarks are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. 15. The method according to claim 14 further comprising:
characterizing severity of individual robustness bugs in terms of amplitude of the degradation, range of condition span for which the robustness bug is present, frequency with which robustness bug conditions are historically encountered or expected to be encountered, degree to which the degradation can be remedied, estimation of the resources expended to correct the robustness bug, and assessment of risk associated with an action that corrects the robustness bug. | Computer-implemented systems and associated operating methods take measurements and landmarks associated with robustness maps and perform tests evaluating the robustness of a database engine's operator implementations and/or query components. The illustrative computer-implemented system comprises logic that receives one or more robustness maps of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the robustness map or maps to perform regression testing wherein landmarks in the robustness maps are operated upon as a robustness bugs describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner.1. A computer-implemented system comprising:
logic that receives at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions and uses information from the at least one robustness map to perform regression testing wherein landmarks are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. 2. The system according to claim 1 further comprising:
logic that characterizes severity of individual robustness bugs in terms of amplitude of the degradation, range of condition span for which the robustness bug is present, and frequency with which robustness bug conditions are historically encountered or expected to be encountered. 3. The system according to claim 1 further comprising:
logic that characterizes severity of individual robustness bugs in terms of degree to which the degradation can be remedied, estimation of the resources expended to correct the robustness bug, and assessment of risk associated with an action that corrects the robustness bug. 4. The system according to claim 1 further comprising:
a computer that executes the logic. 5. The system according to claim 1 further comprising:
an article of manufacture comprising:
a controller-usable medium having a computer readable program code embodied in a controller for testing database system performance, the computer readable program code further comprising:
code causing the controller to receive the at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions; and
code causing the controller to test performance based on locations and migrations of landmarks on the at least one robustness map. 6. A computer-implemented system comprising:
logic that receives at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions and tests performance based on locations and migrations of landmarks on the at least one robustness map. 7. The system according to claim 6 further comprising:
logic that evaluates robustness of a specified database system implementation in terms of degree of robustness exhibited when executing a predetermined database benchmark. 8. The system according to claim 6 further comprising:
logic that analyzes measurements and landmarks in the at least one robustness map, and uses the analysis to perform regression tests evaluating robustness of a database engine's operator implementations. 9. The system according to claim 6 further comprising:
logic that evaluates robustness of a specified database system implementation in terms of robustness of operator implementations. 10. The system according to claim 6 further comprising:
logic that tests performance comprising visualizing location and character of performance changes on the at least one robustness map wherein the at least one robustness map is analyzed to detect circumstances under which performance is sensitive to deviations from expected behavior, and identify performance anomalies. 11. The system according to claim 6 further comprising:
logic that detects performance degradation by determining curvature between data points on the at least one robustness map comprising identifying locations on the at least one robustness map wherein performance degrades by a predetermined amount or performance degrades in a manner different from a predetermined expected manner, the logic applying a corrective action according to the detected performance degradation. 12. The system according to claim 6 further comprising:
logic that uses the at least one robustness map to compare performance of an applied query plan and/or operator to a best known query plan and/or operator, the logic applying a corrective action according to the detected performance comparison. 13. The system according to claim 6 further comprising:
logic that uses the at least one robustness map to detect an error condition wherein performance improves as workload increases or operating resources decrease. 14. A computer-implemented method comprising:
testing a database system comprising:
receiving at least one robustness map of measured database system performance acquired during database execution in a predetermined range of runtime conditions; and
using information from the at least one robustness map to perform regression testing wherein landmarks are operated upon as a robustness bug describing conditions under which a predetermined implementation of a database operator or query component degrades in a manner different from a predetermined expected manner. 15. The method according to claim 14 further comprising:
characterizing severity of individual robustness bugs in terms of amplitude of the degradation, range of condition span for which the robustness bug is present, frequency with which robustness bug conditions are historically encountered or expected to be encountered, degree to which the degradation can be remedied, estimation of the resources expended to correct the robustness bug, and assessment of risk associated with an action that corrects the robustness bug. | 2,100 |
5,206 | 14,361,982 | 2,112 | A mechanism is provided for detecting data loss in transfer data between a first information device and a second information device. The second information device receives transfer data sent by an application of the first information device, the transfer data being segmented into pieces and, for each segmented data piece, there is a write hash value, k hash value is generated for the segmented data piece that has been received, and the generated hash value is stored in the dedicated buffer in the second information device as a read hash value. The write hash value and the read hash value are compared and, when the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match, it is determined that data has been lost from the transfer data at a time of transfer of the segmented data piece. | 1. A method of detecting data loss in transfer data between a first information device and a second information device, the method comprising:
receiving, by a second processor in the second information device, the transfer data sent by an application of the first information device wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; reading, by the second processor in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; comparing, by the second processor in the second information device, the write hash value and the read hash value stored in the dedicated buffer; and determining, by the second processor in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash values-value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 2-5. (canceled) 6. The method of claim 1, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 7. The method of claim 1, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 8. The method of claim 1, further comprising:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, performing, by the second processor in the second information device, restoration processing to recover the data. 9-12. (canceled) 13. The method of claim 1, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 14. The method of claim 13, further comprising:
segmenting, by a first processor in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; reading, by the first processor in the first information device, each segmented data piece of the segmented pieces of data; generating, by the first processor in the first information device, a hash value for the segmented data piece; and storing, by the first processor in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. 15. The method of claim 14, further comprising:
sending, by the first processor in the first information device, the write hash value from the first information device to the second information device by associating the write hash value with the segmented data piece included in the transfer data stored in the first buffer. 16. 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:
receive, in a second information device, transfer data sent by an application of a first information device, wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; read, in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; compare, in the second information device, the write hash value and the read. value stored in the dedicated buffer; and determine, in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 17. The computer program product of claim 16, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 18. The computer program product of claim 16, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 19. The computer program product of claim 16, wherein he computer readable program further causes the computing device to:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, perform, in the second information device, restoration processing to recover the data. 20. The computer program product of claim 16, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 21. The computer program product of claim 20, wherein the computer readable program further causes the computing device to:
segment, in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; read, in the first information device, each segmented data piece of the segmented pieces of data; generate, in the first information device, a hash value for the segmented data piece; and store, in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. 22. The computer program product of claim 21, wherein the computer readable program further causes the computing device to:
send, in the first information device, the write hash value from the first information device to the second information device by associating the write hash value with the segmented data piece included in the transfer data stored in the first buffer. 23. An apparatus comprising:
a second processor in a second information device; and a second memory coupled to the second processor, wherein the second memory comprises instructions which, when executed by the second processor, cause the second processor to: receive, in a second information device, transfer data sent by an application of a first information device, wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; read, in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; compare, in the second information device, the write hash value and the read hash value stored in the dedicated buffer; and determine, in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 24. The apparatus of claim 23, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 25. The apparatus of claim 23, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 26. The apparatus of claim 23, wherein the instructions further cause the processor to:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, perform, in the second information device, restoration processing to recover the data. 27. The apparatus of claim 23, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 28. The apparatus of claim 27, further comprising
a first processor in a first information device; and a first memory coupled to the first processor, wherein the first memory comprises instructions which, when executed by the first processor, cause the first processor to: segment, in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; read, in the first information device, each segmented data piece of the segmented pieces of data; generate, in the first information device, a hash value for the segmented data piece; and store, in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. | A mechanism is provided for detecting data loss in transfer data between a first information device and a second information device. The second information device receives transfer data sent by an application of the first information device, the transfer data being segmented into pieces and, for each segmented data piece, there is a write hash value, k hash value is generated for the segmented data piece that has been received, and the generated hash value is stored in the dedicated buffer in the second information device as a read hash value. The write hash value and the read hash value are compared and, when the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match, it is determined that data has been lost from the transfer data at a time of transfer of the segmented data piece.1. A method of detecting data loss in transfer data between a first information device and a second information device, the method comprising:
receiving, by a second processor in the second information device, the transfer data sent by an application of the first information device wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; reading, by the second processor in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; comparing, by the second processor in the second information device, the write hash value and the read hash value stored in the dedicated buffer; and determining, by the second processor in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash values-value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 2-5. (canceled) 6. The method of claim 1, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 7. The method of claim 1, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 8. The method of claim 1, further comprising:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, performing, by the second processor in the second information device, restoration processing to recover the data. 9-12. (canceled) 13. The method of claim 1, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 14. The method of claim 13, further comprising:
segmenting, by a first processor in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; reading, by the first processor in the first information device, each segmented data piece of the segmented pieces of data; generating, by the first processor in the first information device, a hash value for the segmented data piece; and storing, by the first processor in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. 15. The method of claim 14, further comprising:
sending, by the first processor in the first information device, the write hash value from the first information device to the second information device by associating the write hash value with the segmented data piece included in the transfer data stored in the first buffer. 16. 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:
receive, in a second information device, transfer data sent by an application of a first information device, wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; read, in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; compare, in the second information device, the write hash value and the read. value stored in the dedicated buffer; and determine, in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 17. The computer program product of claim 16, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 18. The computer program product of claim 16, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 19. The computer program product of claim 16, wherein he computer readable program further causes the computing device to:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, perform, in the second information device, restoration processing to recover the data. 20. The computer program product of claim 16, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 21. The computer program product of claim 20, wherein the computer readable program further causes the computing device to:
segment, in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; read, in the first information device, each segmented data piece of the segmented pieces of data; generate, in the first information device, a hash value for the segmented data piece; and store, in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. 22. The computer program product of claim 21, wherein the computer readable program further causes the computing device to:
send, in the first information device, the write hash value from the first information device to the second information device by associating the write hash value with the segmented data piece included in the transfer data stored in the first buffer. 23. An apparatus comprising:
a second processor in a second information device; and a second memory coupled to the second processor, wherein the second memory comprises instructions which, when executed by the second processor, cause the second processor to: receive, in a second information device, transfer data sent by an application of a first information device, wherein the transfer data is segmented into pieces in a temporal transfer direction and wherein for each segmented data piece in the segmented pieces of data there is a write hash value, storing the received transfer data in a second buffer of the second information device, receiving the write hash value, and storing each write hash value for each segmented data piece in a dedicated buffer in the second information device by associating the write hash value with the segmented data piece included in the transfer data; read, in the second information device, the segmented data piece stored in the second buffer, generating a hash value for the segmented data piece, and storing the generated hash value in the dedicated buffer in the second information device as a read hash value; compare, in the second information device, the write hash value and the read hash value stored in the dedicated buffer; and determine, in the second information device, that data has been lost from the transfer data at a time of transfer of the segmented data piece in a case where the write hash value associated with the segmented data piece and the read hash value of the segmented data piece do not match in the comparison. 24. The apparatus of claim 23, wherein each segmented data piece is of a fixed amount of data in the transfer data, and each write hash value is calculated for each segmented data piece of the fixed amount. 25. The apparatus of claim 23, wherein each segmented data piece is of a variable amount of data accumulated in the first buffer by the application during a fixed period of time, and each write hash value is calculated for each segmented data piece of the variable amount. 26. The apparatus of claim 23, wherein the instructions further cause the processor to:
responsive to detecting that data has been lost from the transfer data at a time of transfer of the segmented data piece, perform, in the second information device, restoration processing to recover the data. 27. The apparatus of claim 23, wherein the first information device comprises the application that transfers data via a first buffer and wherein the second information device being connected to the first information device over an external network so as to be able to communicate with the first information device. 28. The apparatus of claim 27, further comprising
a first processor in a first information device; and a first memory coupled to the first processor, wherein the first memory comprises instructions which, when executed by the first processor, cause the first processor to: segment, in the first information device, the transfer data accumulated in the first buffer for the application into segmented pieces of data in a temporal transfer direction; read, in the first information device, each segmented data piece of the segmented pieces of data; generate, in the first information device, a hash value for the segmented data piece; and store, in the first information device, the generated hash value in a dedicated buffer in the first information device as a write hash value. | 2,100 |
5,207 | 14,327,776 | 2,185 | The present disclosure relates to a system and related methods, apparatuses, and computer program products for controlling operation of a device based on a read request. For example, a method for performing an operation in response to a read request may include a first computing device receiving a request to read a value sent to the first computing device by a second computing device via a wireless communication link between the first and second computing devices. The method may further include the first computing device determining an operation corresponding to the value. The method may additionally include the first computing device performing the operation corresponding to the value in response to the request. | 1. A method for performing an operation in response to a read request, the method comprising a first computing device:
receiving a request to read a value, wherein the request is received from a second computing device via a wireless communication link between the first computing device and the second computing device; determining an operation corresponding to the value, wherein each of a plurality of readable values corresponds to a different respective operation; and performing the operation corresponding to the value in response to the request. 2. The method of claim 1, wherein the first computing device is an aerosol delivery device, and wherein the second computing device is a mobile communication device. 3. The method of claim 1, wherein the wireless communication link is implemented via a Bluetooth technology. 4. The method of claim 3, wherein the request comprises a request to read a value referenced by a characteristic, and wherein determining the operation corresponding to the value comprises determining an operation corresponding to the characteristic. 5. The method of claim 1, further comprising the first computing device sending the value to the second computing device via the wireless communication link in response to the request. 6. The method of claim 1, wherein a hook procedure is configured to intercept the request, and wherein determining the operation corresponding to the value comprises the hook procedure invoking the operation corresponding to the value. 7. The method of claim 1, wherein the value is mapped to a memory location storing a reference to the operation corresponding to the value, and wherein determining the operation corresponding to the value comprises reading the reference from the memory location. 8. The method of claim 1, wherein the request comprises a reference to a variable referencing the value. 9. The method of claim 1, wherein the request comprises a reference to a memory location storing the value. 10. The method of claim 1, wherein the operation corresponding to the value comprises altering a power state of the first computing device. 11. The method of claim 1, wherein the operation corresponding to the value comprises modifying a configuration setting of the first computing device. 12. The method of claim 11, wherein the first computing device comprises an aerosol delivery device, and wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. 13. The method of claim 11, wherein the value specifies the configuration setting, and wherein modifying the configuration setting comprises modifying the value. 14. An aerosol delivery device comprising processing circuitry configured to cause the aerosol delivery device to at least:
receive a request to read a value, wherein the request is received from a mobile communication device via a wireless communication link between the aerosol delivery device and the mobile communication device; determine an operation corresponding to the value, wherein each of a plurality of readable values corresponds to a different respective operation; and perform the operation corresponding to the value in response to the request. 15. The aerosol delivery device of claim 14, wherein the wireless communication link is implemented via a Bluetooth technology. 16. The aerosol delivery device of claim 15, wherein the request comprises a request to read a value referenced by a characteristic, and wherein the processing circuitry is configured to cause the aerosol delivery device to determine the operation corresponding to the value at least in part by causing the aerosol delivery device to determine an operation corresponding to the characteristic. 17. The aerosol delivery device of claim 14, wherein the processing circuitry is further configured to cause the aerosol delivery device to send the value to the mobile communication device via the wireless communication link in response to the request. 18. The aerosol delivery device of claim 14, wherein the processing circuitry is further configured to cause the aerosol delivery device to:
implement a hook procedure configured to intercept the request and invoke the operation corresponding to the value in response to the request. 19. The aerosol delivery device of claim 14, wherein the request comprises a reference to a variable referencing the value. 20. The aerosol delivery device of claim 14, further comprising:
a memory; wherein the request comprises a reference to a memory location storing the value within the memory. 21. The aerosol delivery device of claim 14, wherein the operation corresponding to the value comprises altering a power state of the aerosol delivery device. 22. The aerosol delivery device of claim 14, wherein the operation corresponding to the value comprises modifying a configuration setting of the aerosol delivery device. 23. The aerosol delivery device of claim 22, wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. 24. The aerosol delivery device of claim 22, wherein the value specifies the configuration setting, and wherein modifying the configuration setting comprises modifying the value. 25. A method for causing a computing device to perform an operation in response to a read request, the method comprising a first computing device:
determining an operation for performance by a second computing device; determining a value corresponding to the operation, wherein each of a plurality of operations corresponds to a different respective value; formatting a request to read the value corresponding to the operation; and sending the request to the second computing device via a wireless communication link between the first computing device and the second computing device to cause the second computing device to perform the operation. 26. The method of claim 25, wherein the first computing device is a mobile communication device, and wherein the second computing device is an aerosol delivery device. 27. The method of claim 25, wherein the wireless communication link is implemented via a Bluetooth technology. 28. The method of claim 27, wherein the request comprises a request to read a value referenced by a characteristic, and wherein the characteristic corresponds to the operation. 29. The method of claim 25, further comprising the first computing device:
causing display of a graphical user interface providing access to a plurality of selectable commands for controlling the second computing device; and receiving an indication of a selected command; wherein determining the operation comprises determining the operation in accordance with the selected command. 30. The method of claim 25, wherein the request comprises one of a reference to a variable referencing the value or a reference to a memory location storing the value. 31. The method of claim 25, wherein the operation corresponding to the value comprises altering a power state of the second computing device. 32. The method of claim 25, wherein the operation corresponding to the value comprises modifying a configuration setting of the second computing device. 33. The method of claim 32, wherein the second computing device comprises an aerosol delivery device, and wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. | The present disclosure relates to a system and related methods, apparatuses, and computer program products for controlling operation of a device based on a read request. For example, a method for performing an operation in response to a read request may include a first computing device receiving a request to read a value sent to the first computing device by a second computing device via a wireless communication link between the first and second computing devices. The method may further include the first computing device determining an operation corresponding to the value. The method may additionally include the first computing device performing the operation corresponding to the value in response to the request.1. A method for performing an operation in response to a read request, the method comprising a first computing device:
receiving a request to read a value, wherein the request is received from a second computing device via a wireless communication link between the first computing device and the second computing device; determining an operation corresponding to the value, wherein each of a plurality of readable values corresponds to a different respective operation; and performing the operation corresponding to the value in response to the request. 2. The method of claim 1, wherein the first computing device is an aerosol delivery device, and wherein the second computing device is a mobile communication device. 3. The method of claim 1, wherein the wireless communication link is implemented via a Bluetooth technology. 4. The method of claim 3, wherein the request comprises a request to read a value referenced by a characteristic, and wherein determining the operation corresponding to the value comprises determining an operation corresponding to the characteristic. 5. The method of claim 1, further comprising the first computing device sending the value to the second computing device via the wireless communication link in response to the request. 6. The method of claim 1, wherein a hook procedure is configured to intercept the request, and wherein determining the operation corresponding to the value comprises the hook procedure invoking the operation corresponding to the value. 7. The method of claim 1, wherein the value is mapped to a memory location storing a reference to the operation corresponding to the value, and wherein determining the operation corresponding to the value comprises reading the reference from the memory location. 8. The method of claim 1, wherein the request comprises a reference to a variable referencing the value. 9. The method of claim 1, wherein the request comprises a reference to a memory location storing the value. 10. The method of claim 1, wherein the operation corresponding to the value comprises altering a power state of the first computing device. 11. The method of claim 1, wherein the operation corresponding to the value comprises modifying a configuration setting of the first computing device. 12. The method of claim 11, wherein the first computing device comprises an aerosol delivery device, and wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. 13. The method of claim 11, wherein the value specifies the configuration setting, and wherein modifying the configuration setting comprises modifying the value. 14. An aerosol delivery device comprising processing circuitry configured to cause the aerosol delivery device to at least:
receive a request to read a value, wherein the request is received from a mobile communication device via a wireless communication link between the aerosol delivery device and the mobile communication device; determine an operation corresponding to the value, wherein each of a plurality of readable values corresponds to a different respective operation; and perform the operation corresponding to the value in response to the request. 15. The aerosol delivery device of claim 14, wherein the wireless communication link is implemented via a Bluetooth technology. 16. The aerosol delivery device of claim 15, wherein the request comprises a request to read a value referenced by a characteristic, and wherein the processing circuitry is configured to cause the aerosol delivery device to determine the operation corresponding to the value at least in part by causing the aerosol delivery device to determine an operation corresponding to the characteristic. 17. The aerosol delivery device of claim 14, wherein the processing circuitry is further configured to cause the aerosol delivery device to send the value to the mobile communication device via the wireless communication link in response to the request. 18. The aerosol delivery device of claim 14, wherein the processing circuitry is further configured to cause the aerosol delivery device to:
implement a hook procedure configured to intercept the request and invoke the operation corresponding to the value in response to the request. 19. The aerosol delivery device of claim 14, wherein the request comprises a reference to a variable referencing the value. 20. The aerosol delivery device of claim 14, further comprising:
a memory; wherein the request comprises a reference to a memory location storing the value within the memory. 21. The aerosol delivery device of claim 14, wherein the operation corresponding to the value comprises altering a power state of the aerosol delivery device. 22. The aerosol delivery device of claim 14, wherein the operation corresponding to the value comprises modifying a configuration setting of the aerosol delivery device. 23. The aerosol delivery device of claim 22, wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. 24. The aerosol delivery device of claim 22, wherein the value specifies the configuration setting, and wherein modifying the configuration setting comprises modifying the value. 25. A method for causing a computing device to perform an operation in response to a read request, the method comprising a first computing device:
determining an operation for performance by a second computing device; determining a value corresponding to the operation, wherein each of a plurality of operations corresponds to a different respective value; formatting a request to read the value corresponding to the operation; and sending the request to the second computing device via a wireless communication link between the first computing device and the second computing device to cause the second computing device to perform the operation. 26. The method of claim 25, wherein the first computing device is a mobile communication device, and wherein the second computing device is an aerosol delivery device. 27. The method of claim 25, wherein the wireless communication link is implemented via a Bluetooth technology. 28. The method of claim 27, wherein the request comprises a request to read a value referenced by a characteristic, and wherein the characteristic corresponds to the operation. 29. The method of claim 25, further comprising the first computing device:
causing display of a graphical user interface providing access to a plurality of selectable commands for controlling the second computing device; and receiving an indication of a selected command; wherein determining the operation comprises determining the operation in accordance with the selected command. 30. The method of claim 25, wherein the request comprises one of a reference to a variable referencing the value or a reference to a memory location storing the value. 31. The method of claim 25, wherein the operation corresponding to the value comprises altering a power state of the second computing device. 32. The method of claim 25, wherein the operation corresponding to the value comprises modifying a configuration setting of the second computing device. 33. The method of claim 32, wherein the second computing device comprises an aerosol delivery device, and wherein modifying the configuration setting comprises modifying one or more of a configuration setting for a light emitting diode (LED) indicator, a haptic feedback configuration, a heating profile configuration, an aerosol precursor composition vaporization setting, a puff control setting, and a battery management setting. | 2,100 |
5,208 | 14,597,185 | 2,154 | An apparatus for presenting search results includes a content module that gathers user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, a cluster module that identifies a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location, an area module that determines an area containing the cluster of related user-generated content, a search module that receives a search query, the search query related to one or more of the common event and activity of the cluster, and a map display module that presents, on an electronic map, a boundary for the determined area. | 1. An apparatus comprising:
a content module that gathers user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; a cluster module that identifies a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; an area module that determines an area containing the cluster of related user-generated content; a search module that receives a search query, the search query related to one or more of the common event and activity of the cluster; and a map display module that, in response to receiving the search query, presents, on an electronic map, a boundary for the determined area. 2. The apparatus of claim 1, wherein the content module further comprises an object module that identifies one or more objects within each item of user-generated content, the objects relating to one or more of the common event, the common activity, and the location of the user-generated content. 3. The apparatus of claim 2, wherein the object module performs a contextual analysis on the user-generated content to identify the one or more objects. 4. The apparatus of claim 2, further comprising a prediction module that uses the identification of the one or more objects within the user-generated content to identify one or more of an event, an activity, attributes of an event, and attributes of an activity, wherein cluster module uses the event, the activity, attributes of the event, and attributes of the activity of each item of user-generated content to identify the cluster and wherein one or more of the common event, the common activity, attributes of the common event and attributes of the common activity are searchable by the search module. 5. The apparatus of claim 1, further comprising a topic module that identifies a topic of each item of user-generated content, wherein the cluster module identifies user-generated content as belonging to the cluster based on the identified topic. 6. The apparatus of claim 1, wherein the map display module identifies, based on the search query, the cluster of related user-generated content from a plurality of clusters of user-generated content, wherein map display module presents the boundary for the determined area of the identified cluster. 7. The apparatus of claim 1, wherein the cluster module further comprises a threshold module that compares a generation rate at which the related user-generated content is generated to a generation rate threshold, wherein the cluster module identifies the cluster based on whether the generation rate exceeds the generation rate threshold. 8. The apparatus of claim 1, wherein the cluster module further comprises a window module that determines if an item of user-generated content is generated within a moving window of time, wherein the cluster module identifies user-generated content as belonging to the cluster based on whether the user-generated content is within the moving window of time. 9. The apparatus of claim 1, wherein the cluster module further comprises a weighting module that assigns greater weight to newer user-generated content and lesser weight to older user-generated content, wherein the cluster module identifies the cluster based on the weights assigned to the user-generated content. 10. The apparatus of claim 1, further comprising a frequency module that identifies a relative frequency of user-generated content within the area, wherein the map display module indicates the relative frequency on the electronic map. 11. The apparatus of claim 1, further comprising an age module that identifies an age of user-generated content within the area, wherein the map display module indicates the age on the electronic map. 12. The apparatus of claim 1, further comprising an adjustment module that dynamically adjust the area and boundary of the cluster based on the times and locations of the user-generated content. 13. The apparatus of claim 1, wherein the determined area includes the locations related to each item of user-generated content in the cluster. 14. The apparatus of claim 13, wherein the determined area includes a perimeter area in excess of an area that includes the locations related to each item of user-generated content in the cluster. 15. A method comprising:
gathering, by use of a processor, user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; identifying a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; determining an area containing the cluster of related user-generated content; receiving a search query, the search query related to one or more of the common event and activity of the cluster; and displaying, on an electronic map, a boundary for the determined area in response to receiving the search query. 16. The method of claim 15, further comprising identifying one or more objects within each item of user-generated content, the objects relating to one or more of the common event, the common activity, and the location of the user-generated content. 17. The method of claim 15, wherein identifying a cluster of related user-generated content comprises determining if an item of user-generated content is generated within a moving window of time and identifying user-generated content as belonging to the cluster based on whether the user-generated content is within the moving window of time. 18. The method of claim 15, further comprising:
identifying one or more of an age and a relative frequency of user-generated content within the area; and indicating the one or more of age and relative frequency on the electronic map. 19. The method of claim 15, further comprising dynamically adjusting the area and boundary of the cluster based on the times and locations of the user-generated content. 20. A program product comprising a computer readable storage medium that stores code executable by a processor, the executable code comprising code to perform:
gathering user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; identifying a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; determining an area containing the cluster of related user-generated content; receiving a search query, the search query related to one or more of the common event and activity of the cluster; and presenting, on an electronic map, a boundary for the determined area in response to receiving the search query. | An apparatus for presenting search results includes a content module that gathers user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, a cluster module that identifies a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location, an area module that determines an area containing the cluster of related user-generated content, a search module that receives a search query, the search query related to one or more of the common event and activity of the cluster, and a map display module that presents, on an electronic map, a boundary for the determined area.1. An apparatus comprising:
a content module that gathers user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; a cluster module that identifies a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; an area module that determines an area containing the cluster of related user-generated content; a search module that receives a search query, the search query related to one or more of the common event and activity of the cluster; and a map display module that, in response to receiving the search query, presents, on an electronic map, a boundary for the determined area. 2. The apparatus of claim 1, wherein the content module further comprises an object module that identifies one or more objects within each item of user-generated content, the objects relating to one or more of the common event, the common activity, and the location of the user-generated content. 3. The apparatus of claim 2, wherein the object module performs a contextual analysis on the user-generated content to identify the one or more objects. 4. The apparatus of claim 2, further comprising a prediction module that uses the identification of the one or more objects within the user-generated content to identify one or more of an event, an activity, attributes of an event, and attributes of an activity, wherein cluster module uses the event, the activity, attributes of the event, and attributes of the activity of each item of user-generated content to identify the cluster and wherein one or more of the common event, the common activity, attributes of the common event and attributes of the common activity are searchable by the search module. 5. The apparatus of claim 1, further comprising a topic module that identifies a topic of each item of user-generated content, wherein the cluster module identifies user-generated content as belonging to the cluster based on the identified topic. 6. The apparatus of claim 1, wherein the map display module identifies, based on the search query, the cluster of related user-generated content from a plurality of clusters of user-generated content, wherein map display module presents the boundary for the determined area of the identified cluster. 7. The apparatus of claim 1, wherein the cluster module further comprises a threshold module that compares a generation rate at which the related user-generated content is generated to a generation rate threshold, wherein the cluster module identifies the cluster based on whether the generation rate exceeds the generation rate threshold. 8. The apparatus of claim 1, wherein the cluster module further comprises a window module that determines if an item of user-generated content is generated within a moving window of time, wherein the cluster module identifies user-generated content as belonging to the cluster based on whether the user-generated content is within the moving window of time. 9. The apparatus of claim 1, wherein the cluster module further comprises a weighting module that assigns greater weight to newer user-generated content and lesser weight to older user-generated content, wherein the cluster module identifies the cluster based on the weights assigned to the user-generated content. 10. The apparatus of claim 1, further comprising a frequency module that identifies a relative frequency of user-generated content within the area, wherein the map display module indicates the relative frequency on the electronic map. 11. The apparatus of claim 1, further comprising an age module that identifies an age of user-generated content within the area, wherein the map display module indicates the age on the electronic map. 12. The apparatus of claim 1, further comprising an adjustment module that dynamically adjust the area and boundary of the cluster based on the times and locations of the user-generated content. 13. The apparatus of claim 1, wherein the determined area includes the locations related to each item of user-generated content in the cluster. 14. The apparatus of claim 13, wherein the determined area includes a perimeter area in excess of an area that includes the locations related to each item of user-generated content in the cluster. 15. A method comprising:
gathering, by use of a processor, user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; identifying a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; determining an area containing the cluster of related user-generated content; receiving a search query, the search query related to one or more of the common event and activity of the cluster; and displaying, on an electronic map, a boundary for the determined area in response to receiving the search query. 16. The method of claim 15, further comprising identifying one or more objects within each item of user-generated content, the objects relating to one or more of the common event, the common activity, and the location of the user-generated content. 17. The method of claim 15, wherein identifying a cluster of related user-generated content comprises determining if an item of user-generated content is generated within a moving window of time and identifying user-generated content as belonging to the cluster based on whether the user-generated content is within the moving window of time. 18. The method of claim 15, further comprising:
identifying one or more of an age and a relative frequency of user-generated content within the area; and indicating the one or more of age and relative frequency on the electronic map. 19. The method of claim 15, further comprising dynamically adjusting the area and boundary of the cluster based on the times and locations of the user-generated content. 20. A program product comprising a computer readable storage medium that stores code executable by a processor, the executable code comprising code to perform:
gathering user-generated content from a plurality of users of a social networking service, the user-generated content relating to one or more of an event and an activity, each item of user-generated content comprising time and location information; identifying a cluster of related user-generated content from the location information of the gathered user-generated content, the cluster comprising a plurality of items of user-generated content relating to one or more of a common event and an activity that have a geographically similar location; determining an area containing the cluster of related user-generated content; receiving a search query, the search query related to one or more of the common event and activity of the cluster; and presenting, on an electronic map, a boundary for the determined area in response to receiving the search query. | 2,100 |
5,209 | 13,274,126 | 2,163 | An approach is provided for presenting search results in an active user interface element at specific location in a user interface that correspond to the desired information with respect to user interface search element. An element of a user interface receiving a search parameter enables processing of the search parameter to yield location information of the desired information. The location or locations of the desired information are then presented to a user on the user interface. | 1. A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following:
at least one determination of an input specifying at least one point in a user interface; a rendering of a search user interface element at the at least one point; and at least one determination to generate a search query that includes, at least in part, the at least one point as a search parameter. 2. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
a rendering of one or more results of the search query in the user interface based, at least in part, on location information associated with the one or more results; at least one determination of another input for selecting at least one of the one or more results; and a rendering of another search user interface element at another point in the user interface based, at least in part, on the location information associated with the selected at least one of the one or more results. 3. A method of claim 2, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination to generate another search query that includes, at least in part, the another point as another search parameter; and a rendering of one or more other results of the another search query in the user interface based, at in part, on other location information associated with the one or more other results. 4. A method of claim 3, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of another input for selecting at least another one of the one or more other results; and a generation of an itinerary, routing information, or a combination thereof based, at least in part, on the selected at least one result and the selected at least one other result. 5. A method of claim 4, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of a hierarchy of the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 6. A method of claim 5, wherein the hierarchy is based, at least in part, on granularity information associated with the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 7. A method of claim 5, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of one or more rendering characteristics for the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof based, at least in part, on the hierarchy; and a rendering of the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof in the user interface based, at least in part, on the one or more rendering characteristics. 8. A method of claim 7, wherein the user interface is a three-dimensional user interface, and wherein the one or more rendering characteristics include a z-axis displacement. 9. A method of claim 1, wherein the search query includes, at least in part, a location-based query, an information query, a web query, or a combination thereof and wherein the user interface is for, at least in part, a mapping application, a navigation application, an augmented reality application, a virtual reality application, or a combination thereof. 10. A method of claim 1, wherein the user interface includes, at least in part, a selection of one or more category-based search terms. 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, determine an input specifying at least one point in a user interface; cause, at least in part, a rendering of a search user interface element at the at least one point; and determine to generate a search query that includes, at least in part, the at least one point as a search parameter. 12. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, a rendering of one or more results of the search query in the user interface based, at least in part, on location information associated with the one or more results; determine another input for selecting at least one of the one or more results; and cause, at least in part, a rendering of another search user interface element at another point in the user interface based, at least in part, on the location information associated with the selected at least one of the one or more results. 13. An apparatus of claim 12, wherein the apparatus is fluffier caused to:
determine to generate another search query that includes, at least in part, the another point as another search parameter; and cause, at least in part, a rendering of one or more other results of the another search query in the user interface based, at in part, on other location information associated with the one or more other results. 14. An apparatus of claim 13, wherein the apparatus is further caused to:
determine another input for selecting at least another one of the one or more other results; and cause, at least in part, a generation of an itinerary, routing information, or a combination thereof based, at least in part, on the selected at least one result and the selected at least one other result. 15. An apparatus of claim 14, wherein the apparatus is further caused to:
determine a hierarchy of the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 16. An apparatus of claim 15, wherein the hierarchy is based, at least in part, on granularity information associated with the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 17. An apparatus of claim 15, wherein the apparatus is further caused to:
determine one or more rendering characteristics for the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof based, at least in part, on the hierarchy; and cause, at least in part, a rendering of the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof in the user interface based, at least in part, on the one or more rendering characteristics. 18. An apparatus of claim 17, wherein the user interface is a three-dimensional user interface, and wherein the one or more rendering characteristics include a z-axis displacement. 19. An apparatus of claim 11, wherein the search query includes, at least in part, a location-based query, an information query, a web query, or a combination thereof and wherein the user interface is for, at least in part, a mapping application, a navigation application, an augmented reality application, a virtual reality application, or a combination thereof. 20. An apparatus of claim 11, wherein the user interface includes, at least in part, a selection of one or more category-based search terms. 21.-48. (canceled) | An approach is provided for presenting search results in an active user interface element at specific location in a user interface that correspond to the desired information with respect to user interface search element. An element of a user interface receiving a search parameter enables processing of the search parameter to yield location information of the desired information. The location or locations of the desired information are then presented to a user on the user interface.1. A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following:
at least one determination of an input specifying at least one point in a user interface; a rendering of a search user interface element at the at least one point; and at least one determination to generate a search query that includes, at least in part, the at least one point as a search parameter. 2. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
a rendering of one or more results of the search query in the user interface based, at least in part, on location information associated with the one or more results; at least one determination of another input for selecting at least one of the one or more results; and a rendering of another search user interface element at another point in the user interface based, at least in part, on the location information associated with the selected at least one of the one or more results. 3. A method of claim 2, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination to generate another search query that includes, at least in part, the another point as another search parameter; and a rendering of one or more other results of the another search query in the user interface based, at in part, on other location information associated with the one or more other results. 4. A method of claim 3, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of another input for selecting at least another one of the one or more other results; and a generation of an itinerary, routing information, or a combination thereof based, at least in part, on the selected at least one result and the selected at least one other result. 5. A method of claim 4, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of a hierarchy of the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 6. A method of claim 5, wherein the hierarchy is based, at least in part, on granularity information associated with the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 7. A method of claim 5, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:
at least one determination of one or more rendering characteristics for the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof based, at least in part, on the hierarchy; and a rendering of the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof in the user interface based, at least in part, on the one or more rendering characteristics. 8. A method of claim 7, wherein the user interface is a three-dimensional user interface, and wherein the one or more rendering characteristics include a z-axis displacement. 9. A method of claim 1, wherein the search query includes, at least in part, a location-based query, an information query, a web query, or a combination thereof and wherein the user interface is for, at least in part, a mapping application, a navigation application, an augmented reality application, a virtual reality application, or a combination thereof. 10. A method of claim 1, wherein the user interface includes, at least in part, a selection of one or more category-based search terms. 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, determine an input specifying at least one point in a user interface; cause, at least in part, a rendering of a search user interface element at the at least one point; and determine to generate a search query that includes, at least in part, the at least one point as a search parameter. 12. An apparatus of claim 11, wherein the apparatus is further caused to:
cause, at least in part, a rendering of one or more results of the search query in the user interface based, at least in part, on location information associated with the one or more results; determine another input for selecting at least one of the one or more results; and cause, at least in part, a rendering of another search user interface element at another point in the user interface based, at least in part, on the location information associated with the selected at least one of the one or more results. 13. An apparatus of claim 12, wherein the apparatus is fluffier caused to:
determine to generate another search query that includes, at least in part, the another point as another search parameter; and cause, at least in part, a rendering of one or more other results of the another search query in the user interface based, at in part, on other location information associated with the one or more other results. 14. An apparatus of claim 13, wherein the apparatus is further caused to:
determine another input for selecting at least another one of the one or more other results; and cause, at least in part, a generation of an itinerary, routing information, or a combination thereof based, at least in part, on the selected at least one result and the selected at least one other result. 15. An apparatus of claim 14, wherein the apparatus is further caused to:
determine a hierarchy of the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 16. An apparatus of claim 15, wherein the hierarchy is based, at least in part, on granularity information associated with the search query, the one or more results, the selected at least one result, the another search query, the one or more other results, the selected at least one other result, or a combination thereof. 17. An apparatus of claim 15, wherein the apparatus is further caused to:
determine one or more rendering characteristics for the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof based, at least in part, on the hierarchy; and cause, at least in part, a rendering of the one or more results, the selected at least one result, the one or more other results, the selected at least one other result, or a combination thereof in the user interface based, at least in part, on the one or more rendering characteristics. 18. An apparatus of claim 17, wherein the user interface is a three-dimensional user interface, and wherein the one or more rendering characteristics include a z-axis displacement. 19. An apparatus of claim 11, wherein the search query includes, at least in part, a location-based query, an information query, a web query, or a combination thereof and wherein the user interface is for, at least in part, a mapping application, a navigation application, an augmented reality application, a virtual reality application, or a combination thereof. 20. An apparatus of claim 11, wherein the user interface includes, at least in part, a selection of one or more category-based search terms. 21.-48. (canceled) | 2,100 |
5,210 | 13,849,270 | 2,129 | Method for improving convergence in gradient-based iterative inversion of seismic data ( 101 ), especially advantageous for full wavefield inversion. The method comprises decomposing the gradient into two (or more) components ( 103 ), typically the migration component and the tomographic component, then weighting the components to compensate for unequal frequency content in the data ( 104 ), then recombining the weighted components ( 105 ), and using the recombined gradient to update ( 106 ) the physical properties model ( 102 ). | 1. A computer-implemented method for updating a physical properties model of a subsurface region in iterative inversion of seismic data using a gradient of a cost function that compares the seismic data to model-simulated data, said method comprising, in one or more iteration cycles:
decomposing the gradient into at least two components, using a computer; weighting the components unequally; recombining the weighted components to obtain a modified gradient; and using the modified gradient to update the physical properties model. 2. The method of claim 1, wherein the seismic data are full wavefield data. 3. The method of claim 1, wherein the gradient is decomposed into two components, a migration component that updates predominately shorter wavelengths and a tomographic component that updates predominately longer wavelengths. 4. The method of claim 3, wherein if the seismic data are lacking in low temporal frequencies, the weighting enhances the tomographic component relative to the migration component. 5. The method of claim 3, wherein the weighting is determined according to whether the seismic data are reflection dominated or transmission dominated. 6. The method of claim 5, wherein if the seismic data are reflection dominated, the weighting enhances the tomographic component, and if the seismic data are transmission dominated, the weighting enhances the migration component. 7. The method of claim 3, wherein the weighting is determined by how closely the physical properties model, before the updating, is considered to be converged to a true solution, with the migration component being enhanced relative to the tomographic component if the physical properties model is close to the true solution, and the tomographic component is enhanced relative to the migration component if the physical properties model is far from the true solution. 8. The method of claim 3, wherein the migration component and the tomographic component are determined by decomposing source and receiver wavefields in the seismic data into an up-going direction and a down-going direction. 9. The method of claim 3, wherein the migration component and the tomographic component are determined by applying a band-pass filter to the gradient. 10. The method of claim 3, wherein the weights for the tomographic and the migration components are determined adaptively through the application of the Gauss-Newton Hessian operator. 11. The method of claim 1, wherein the gradient is decomposed into more than two components by decomposing wavefields represented in the seismic data into more than two components. 12. The method of claim 11, wherein the decomposing of the wavefields is performed by one of:
using frequency-wavenumber domain separation; using time-wavenumber domain separation; using a Poynting vector; and by local slant stack. 13. The method of claim 11, wherein the weighting is spatially varying. 14. The method of claim 13, wherein the gradient is decomposed into four components by decomposing both source and receiver wavefields in the seismic data into up-going and down-going components and cross-correlating each decomposed component in the source wavefield with each decomposed component in the receiver wavefield. 15. The method of claim 14, wherein the four decomposed components of the gradient are recombined by inverting a 4 by 4 matrix at each subsurface point, wherein each element of the matrix represents one component of a decomposed angle-dependent Hessian operator. 16. The method of claim 15, wherein the decomposed Hessian is computed based on decomposing both source and receiver-side band-limited Green's functions into up-going and down-going directions and cross-correlating and convolving different combinations of the decomposed source and receiver-side Green's functions. 17. The method of claim 15, wherein the seismic data being inverted are a full wavefield, and the angle-dependent Hessian operator is computed by decomposing source and receiver-side band-limited Green's functions into angle-dependent band-limited Green's functions. 18. The method of claim 17, wherein dimensionality of the angle-dependent Hessian operator is reduced by neglecting a spatial blurring effect of said operator. 19. The method of claim 18, wherein the angle-dependent Hessian operator is used to convert an angle-dependent gradient into an angle-dependent update of the physical properties model. 20. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for performing iterative inversion of full wavefield seismic data, using a gradient of a cost function that compares the seismic data to model-simulated data, to infer a physical properties model of a subsurface region, said method comprising in each iteration cycle:
decomposing the gradient into at least two components; weighting the components unequally; recombining the weighted components to obtain a modified gradient; and using the modified gradient to update the physical properties model. | Method for improving convergence in gradient-based iterative inversion of seismic data ( 101 ), especially advantageous for full wavefield inversion. The method comprises decomposing the gradient into two (or more) components ( 103 ), typically the migration component and the tomographic component, then weighting the components to compensate for unequal frequency content in the data ( 104 ), then recombining the weighted components ( 105 ), and using the recombined gradient to update ( 106 ) the physical properties model ( 102 ).1. A computer-implemented method for updating a physical properties model of a subsurface region in iterative inversion of seismic data using a gradient of a cost function that compares the seismic data to model-simulated data, said method comprising, in one or more iteration cycles:
decomposing the gradient into at least two components, using a computer; weighting the components unequally; recombining the weighted components to obtain a modified gradient; and using the modified gradient to update the physical properties model. 2. The method of claim 1, wherein the seismic data are full wavefield data. 3. The method of claim 1, wherein the gradient is decomposed into two components, a migration component that updates predominately shorter wavelengths and a tomographic component that updates predominately longer wavelengths. 4. The method of claim 3, wherein if the seismic data are lacking in low temporal frequencies, the weighting enhances the tomographic component relative to the migration component. 5. The method of claim 3, wherein the weighting is determined according to whether the seismic data are reflection dominated or transmission dominated. 6. The method of claim 5, wherein if the seismic data are reflection dominated, the weighting enhances the tomographic component, and if the seismic data are transmission dominated, the weighting enhances the migration component. 7. The method of claim 3, wherein the weighting is determined by how closely the physical properties model, before the updating, is considered to be converged to a true solution, with the migration component being enhanced relative to the tomographic component if the physical properties model is close to the true solution, and the tomographic component is enhanced relative to the migration component if the physical properties model is far from the true solution. 8. The method of claim 3, wherein the migration component and the tomographic component are determined by decomposing source and receiver wavefields in the seismic data into an up-going direction and a down-going direction. 9. The method of claim 3, wherein the migration component and the tomographic component are determined by applying a band-pass filter to the gradient. 10. The method of claim 3, wherein the weights for the tomographic and the migration components are determined adaptively through the application of the Gauss-Newton Hessian operator. 11. The method of claim 1, wherein the gradient is decomposed into more than two components by decomposing wavefields represented in the seismic data into more than two components. 12. The method of claim 11, wherein the decomposing of the wavefields is performed by one of:
using frequency-wavenumber domain separation; using time-wavenumber domain separation; using a Poynting vector; and by local slant stack. 13. The method of claim 11, wherein the weighting is spatially varying. 14. The method of claim 13, wherein the gradient is decomposed into four components by decomposing both source and receiver wavefields in the seismic data into up-going and down-going components and cross-correlating each decomposed component in the source wavefield with each decomposed component in the receiver wavefield. 15. The method of claim 14, wherein the four decomposed components of the gradient are recombined by inverting a 4 by 4 matrix at each subsurface point, wherein each element of the matrix represents one component of a decomposed angle-dependent Hessian operator. 16. The method of claim 15, wherein the decomposed Hessian is computed based on decomposing both source and receiver-side band-limited Green's functions into up-going and down-going directions and cross-correlating and convolving different combinations of the decomposed source and receiver-side Green's functions. 17. The method of claim 15, wherein the seismic data being inverted are a full wavefield, and the angle-dependent Hessian operator is computed by decomposing source and receiver-side band-limited Green's functions into angle-dependent band-limited Green's functions. 18. The method of claim 17, wherein dimensionality of the angle-dependent Hessian operator is reduced by neglecting a spatial blurring effect of said operator. 19. The method of claim 18, wherein the angle-dependent Hessian operator is used to convert an angle-dependent gradient into an angle-dependent update of the physical properties model. 20. A computer program product, comprising a non-transitory computer usable medium having a computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for performing iterative inversion of full wavefield seismic data, using a gradient of a cost function that compares the seismic data to model-simulated data, to infer a physical properties model of a subsurface region, said method comprising in each iteration cycle:
decomposing the gradient into at least two components; weighting the components unequally; recombining the weighted components to obtain a modified gradient; and using the modified gradient to update the physical properties model. | 2,100 |
5,211 | 14,761,075 | 2,127 | Input simulation is provided ( 36 ) as part of simulating ( 38 ) a programmable logic controller. The simulator program itself includes a graphic user interface for the user to configure a sequence of changes in input values. For example, the value of a variable is to be changed at each of multiple times. The sequence is used to simulate ( 38 ) the PLC reaction to the changing input in real-time. The output is provided ( 40 ) in real-time. | 1. A method for input simulation in simulating a programmable logic controller, the method comprising:
generating (34), on a display, a graphical user interface with sensor and set point input options; receiving (36), with a processor (12), a sequence of set points, sensor readings, or set points and sensor readings from the input options of the graphical user interface, the sequence including timing; simulating (38), with the processor (12), operation of the programmable logic controller as a function of the sequence, the operation simulated in real-time based on the timing; and displaying (40), on the display, an indication of the operation in real-time during the simulating (38). 2. The method of claim 1 wherein the generating (34), receiving (36), simulating (38), and displaying (40) a seamlessly presented to a user as one program. 3. The method of claim 1 wherein the generating (34), receiving (36), simulating (38), and displaying (40) being integrated in the same process comprises performing the generating (34), receiving (36), simulating (38) and displaying (40) as a unique thread of a program. 4. The method of claim 1 wherein generating (34) comprises displaying (40) the input options as multiple locations, the locations labeled as being for a time, and a value for a variable for the time. 5. The method of claim 1 wherein generating (34) comprises generating (34) at least one of the input options as a sensor measurement, and wherein receiving (36) comprises receiving (36) the sensor measurement as one of the sensor readings. 6. The method of claim 1 wherein generating (34) comprises generating (34) at least one of the input options as a set point assignment, and wherein receiving (36) comprises receiving (36) the set point assignment as one of the set points. 7. The method of claim 1 wherein receiving (36) comprises receiving (36) the timing as times for changes in the set points, sensor readings, or set points and sensor readings, the times set by a user. 8. The method of claim 1 wherein simulating (38) comprises simulating (38), with the processor (12) of a computer, firmware specific to a type of the programmable logic controller. 9. The method of claim 1 wherein simulating (38) comprises simulating (38) a reaction of the programmable logic controller to the sequence of the set points, the sensor readings, or the set points and the sensor readings. 10. The method of claim 1 wherein simulating (38) comprises altering the set points, the sensor readings, or the set points and the sensor readings as a function of the timing and determining a value calculated, with the processor (12), simulating (38) the operation of the programmable logic controller. 11. The method of claim 1 wherein receiving (36) comprises storing the set points, the sensor readings, or the set points and the sensor readings in a first section of a memory (14), and wherein simulating (38) comprises simulating (38) reading from wires and reading from a measurement store, the reading from the wires accessing the first section of the memory (14), the first section separate than the simulation of the measurement store. 12. The method of claim 1 wherein receiving (36) comprises buffering the set points, the sensor readings, or the set points and the sensor readings as a job, and wherein simulating (38) comprises simulating (38) from the buffered job. 13. The method of claim 1 wherein receiving (36) comprises receiving (36) the sensor readings as an oscillation at a frequency, and wherein simulating (38) comprises simulating (38) the operation in response to the oscillation. 14. The method of claim 1 wherein displaying (40) comprises displaying (40) different values of a variable responsive to the set points, the sensor readings, or the set points and the sensor readings in real-time. 15. The method of claim 1 further comprising recording (42) the indication over time during the simulating (38) and outputting the indication over time in a summary table after the simulating (38). 16. In a non-transitory computer readable storage medium having stored therein data representing instructions executable by a programmed processor (12) for input simulation in simulating (38) a programmable logic controller, the storage medium comprising instructions for:
activating (30) a simulator of the programmable logic controller; providing (32) simulation inputs as a function of time for the programmable logic controller, the providing of the simulation inputs being part of the simulator; and simulating (38) response of the programmable logic controller over time to the simulation inputs as a function of time. 17. The non-transitory computer readable storage medium of claim 16 wherein providing (32) comprises generating (34) a graphical user interface with locations for input of the inputs by a user, and wherein the providing and the simulating (38) are performed as a same instance of the simulator. 18. The non-transitory computer readable storage medium of claim 19 wherein simulating (38) comprises simulating (38) the response in real-time. 19. The non-transitory computer readable storage medium of claim 19 wherein simulating (38) comprises simulating (38) the programmable logic controller obtaining the simulation inputs from reading wires and from reading an input store. 20. A system for simulating (38) a programmable logic controller, the system comprising:
a memory (14) configured by a simulator to store changes in input values at different times for the programmable logic controller; and a processor (12) configured by the same simulator to simulate in real-time reaction of the programmable logic controller to the changes of the input values. | Input simulation is provided ( 36 ) as part of simulating ( 38 ) a programmable logic controller. The simulator program itself includes a graphic user interface for the user to configure a sequence of changes in input values. For example, the value of a variable is to be changed at each of multiple times. The sequence is used to simulate ( 38 ) the PLC reaction to the changing input in real-time. The output is provided ( 40 ) in real-time.1. A method for input simulation in simulating a programmable logic controller, the method comprising:
generating (34), on a display, a graphical user interface with sensor and set point input options; receiving (36), with a processor (12), a sequence of set points, sensor readings, or set points and sensor readings from the input options of the graphical user interface, the sequence including timing; simulating (38), with the processor (12), operation of the programmable logic controller as a function of the sequence, the operation simulated in real-time based on the timing; and displaying (40), on the display, an indication of the operation in real-time during the simulating (38). 2. The method of claim 1 wherein the generating (34), receiving (36), simulating (38), and displaying (40) a seamlessly presented to a user as one program. 3. The method of claim 1 wherein the generating (34), receiving (36), simulating (38), and displaying (40) being integrated in the same process comprises performing the generating (34), receiving (36), simulating (38) and displaying (40) as a unique thread of a program. 4. The method of claim 1 wherein generating (34) comprises displaying (40) the input options as multiple locations, the locations labeled as being for a time, and a value for a variable for the time. 5. The method of claim 1 wherein generating (34) comprises generating (34) at least one of the input options as a sensor measurement, and wherein receiving (36) comprises receiving (36) the sensor measurement as one of the sensor readings. 6. The method of claim 1 wherein generating (34) comprises generating (34) at least one of the input options as a set point assignment, and wherein receiving (36) comprises receiving (36) the set point assignment as one of the set points. 7. The method of claim 1 wherein receiving (36) comprises receiving (36) the timing as times for changes in the set points, sensor readings, or set points and sensor readings, the times set by a user. 8. The method of claim 1 wherein simulating (38) comprises simulating (38), with the processor (12) of a computer, firmware specific to a type of the programmable logic controller. 9. The method of claim 1 wherein simulating (38) comprises simulating (38) a reaction of the programmable logic controller to the sequence of the set points, the sensor readings, or the set points and the sensor readings. 10. The method of claim 1 wherein simulating (38) comprises altering the set points, the sensor readings, or the set points and the sensor readings as a function of the timing and determining a value calculated, with the processor (12), simulating (38) the operation of the programmable logic controller. 11. The method of claim 1 wherein receiving (36) comprises storing the set points, the sensor readings, or the set points and the sensor readings in a first section of a memory (14), and wherein simulating (38) comprises simulating (38) reading from wires and reading from a measurement store, the reading from the wires accessing the first section of the memory (14), the first section separate than the simulation of the measurement store. 12. The method of claim 1 wherein receiving (36) comprises buffering the set points, the sensor readings, or the set points and the sensor readings as a job, and wherein simulating (38) comprises simulating (38) from the buffered job. 13. The method of claim 1 wherein receiving (36) comprises receiving (36) the sensor readings as an oscillation at a frequency, and wherein simulating (38) comprises simulating (38) the operation in response to the oscillation. 14. The method of claim 1 wherein displaying (40) comprises displaying (40) different values of a variable responsive to the set points, the sensor readings, or the set points and the sensor readings in real-time. 15. The method of claim 1 further comprising recording (42) the indication over time during the simulating (38) and outputting the indication over time in a summary table after the simulating (38). 16. In a non-transitory computer readable storage medium having stored therein data representing instructions executable by a programmed processor (12) for input simulation in simulating (38) a programmable logic controller, the storage medium comprising instructions for:
activating (30) a simulator of the programmable logic controller; providing (32) simulation inputs as a function of time for the programmable logic controller, the providing of the simulation inputs being part of the simulator; and simulating (38) response of the programmable logic controller over time to the simulation inputs as a function of time. 17. The non-transitory computer readable storage medium of claim 16 wherein providing (32) comprises generating (34) a graphical user interface with locations for input of the inputs by a user, and wherein the providing and the simulating (38) are performed as a same instance of the simulator. 18. The non-transitory computer readable storage medium of claim 19 wherein simulating (38) comprises simulating (38) the response in real-time. 19. The non-transitory computer readable storage medium of claim 19 wherein simulating (38) comprises simulating (38) the programmable logic controller obtaining the simulation inputs from reading wires and from reading an input store. 20. A system for simulating (38) a programmable logic controller, the system comprising:
a memory (14) configured by a simulator to store changes in input values at different times for the programmable logic controller; and a processor (12) configured by the same simulator to simulate in real-time reaction of the programmable logic controller to the changes of the input values. | 2,100 |
5,212 | 13,827,129 | 2,169 | A content management system that enables a member of a service to search for other members whose group profiles satisfy one or more search criteria is disclosed. The system further enables the member to select one or more of the members whose profile satisfies the search criteria, and facilitates communication between the member and the selected members. Thus, the member may send a communication to all members whose profiles satisfy the search criteria, or to a subset of those members whose profiles satisfy the search criteria. The communication may be an e-mail, an invitation, a chat message, a private positing on a public message board, a text message, or any other suitable type of communication. | 1. A computer-implemented method of performing a search of a data set, the method comprising:
receiving a search term from a user; searching, by at least one processor, at least one data set for at least one suggested search term that contains the received search term and that is associated with one or more system-designated facets; displaying, to the user, the at least one suggested search term and the associated one or more system-designated facets as suggested search term-facet combinations; allowing the user to select the suggested search term-facet combination; in response to the user selecting the suggested search term-facet combination, initiating a search of a second data set based on the selected search term-facet combination. 2. The computer-implemented method of claim 1, wherein:
searching the at least one data set further comprises searching the data set for a plurality of suggested search terms that contain the received search term and that are associated with the one or more system-designated facets; and displaying further comprises displaying, to the user, each of the plurality of suggested search terms and its associated one or more system-designated facets as suggested search term-facet combinations. 3. The computer-implemented method of claim 2, further comprising ranking the suggested search term-facet combinations based on the number of times each suggested search term-facet combination appears in the data set. 4. The computer-implemented method of claim 3, wherein the step of displaying further comprises displaying the four highest ranked search term-facet combinations to the user. 5. The computer-implemented method of claim 1, further comprising receiving, from the user, a selection of one of the displayed search term-facet combinations. 6. The computer-implemented method of claim 1, wherein
the second data set is a database that contains member profiles for a social networking site; each entry of the member profile database contains a plurality of information for a member of the social networking site; and each one of the plurality of information for the member is associated with one of the one or more system-designated facets. 7. The computer-implemented method of claim 6, further comprising displaying a list of members whose member profile contains the selected suggested search term-facet combination. 8. The computer-implemented method of claim 1, wherein the at least one data set is the second data set. 9. The computer-implemented method of claim 1, wherein the second data set is a data set associated with a synched content management system. 10. A computer system for performing a search of a data set comprising:
at least one processor; memory operatively coupled to the at least one processor; and a second data set stored in the memory,
wherein the at least one processor is configured to:
receive a search term from a user;
search one or more data sets that are operatively coupled to the at least one processor for suggested search terms that contain the received search term and that are associated with at least one of a plurality of system-designated facets;
rank the suggested search terms;
display, to the user, the ranked suggested search terms and their associated system-designated facet as suggested search term-facet combinations;
receive, from the user, a selection of one of the displayed search term-facet combinations; and
initiate a search of the second data set based on the selected search term-facet combination. 11. The computer system of claim 10, wherein the second data set is a member profile database for a social networking site. 12. The computer implemented system of claim 10, wherein the second data set is data associated with a synched content management system. 13. The computer system of claim 12, wherein the at least one processor is further configured to display all members whose member profile contains the selected search term-facet combination. 14. The computer system of claim 11, wherein the at least one processor is further configured to use the number of times the suggested search terms appear in the one or more data sets to rank the suggested search term-facet combinations. 15. A system of performing a search, the system comprising:
at least one processor; and a display operatively coupled to the at least one processor,
wherein the at least one processor is configured to:
receive a search term from a user;
search one or more data sets operatively coupled to the at least one processor for entries that contain the received search term and that are associated with one of a plurality of system-designated facets;
form a suggested search term-facet combination by pairing each entry that contains the received search term with the system-designated facet that is associated with the entry;
display, to the user, the suggested search term-facet combinations; and
initiate a search of a second data set that is operatively coupled to the at least one processor based on a selected one of the displayed search term-facet combinations. 16. The system of claim 15, wherein
the one or more data sets is one or more databases; the second data set is a member profile database that contains a plurality of entries, each entry corresponding to a member profile; each of the plurality of entries comprises a plurality data points; and each one of plurality of data points is associated with a respective system-designated facet. 17. The system of claim 16, wherein the at least one processor is further configured to display, to the user, each member profile that contains the selected search term-facet combination. 18. The system of claim 15, wherein the at least one processor is further configured to rank each suggested search term-facet combination based on the number of times each one of the suggested search terms appears in the one or more data sets. 19. The system of claim 18, wherein displaying the suggested search term-facet combinations further comprises displaying the four highest ranked search term-facet combinations. 20. A system of performing a search, the system comprising:
a means for receiving a search term; a means for determining a plurality of search term-facet combinations based on the received search term and a plurality of system-designated facets; a means for searching a data set based on a selected one of the search term-facet combination; and a means for selecting and displaying data from a data set based on one of the search term-facet combinations. 21. The system of claim 20, wherein the data set is a database that comprises profile information for members of a social networking site. 22. The system of claim 20, the means for determining a plurality of search term-facet combinations further comprises:
a means for searching one or more data sets for data that is based on the received search term; and a means for associating the data with one of the plurality of system-designated facets. | A content management system that enables a member of a service to search for other members whose group profiles satisfy one or more search criteria is disclosed. The system further enables the member to select one or more of the members whose profile satisfies the search criteria, and facilitates communication between the member and the selected members. Thus, the member may send a communication to all members whose profiles satisfy the search criteria, or to a subset of those members whose profiles satisfy the search criteria. The communication may be an e-mail, an invitation, a chat message, a private positing on a public message board, a text message, or any other suitable type of communication.1. A computer-implemented method of performing a search of a data set, the method comprising:
receiving a search term from a user; searching, by at least one processor, at least one data set for at least one suggested search term that contains the received search term and that is associated with one or more system-designated facets; displaying, to the user, the at least one suggested search term and the associated one or more system-designated facets as suggested search term-facet combinations; allowing the user to select the suggested search term-facet combination; in response to the user selecting the suggested search term-facet combination, initiating a search of a second data set based on the selected search term-facet combination. 2. The computer-implemented method of claim 1, wherein:
searching the at least one data set further comprises searching the data set for a plurality of suggested search terms that contain the received search term and that are associated with the one or more system-designated facets; and displaying further comprises displaying, to the user, each of the plurality of suggested search terms and its associated one or more system-designated facets as suggested search term-facet combinations. 3. The computer-implemented method of claim 2, further comprising ranking the suggested search term-facet combinations based on the number of times each suggested search term-facet combination appears in the data set. 4. The computer-implemented method of claim 3, wherein the step of displaying further comprises displaying the four highest ranked search term-facet combinations to the user. 5. The computer-implemented method of claim 1, further comprising receiving, from the user, a selection of one of the displayed search term-facet combinations. 6. The computer-implemented method of claim 1, wherein
the second data set is a database that contains member profiles for a social networking site; each entry of the member profile database contains a plurality of information for a member of the social networking site; and each one of the plurality of information for the member is associated with one of the one or more system-designated facets. 7. The computer-implemented method of claim 6, further comprising displaying a list of members whose member profile contains the selected suggested search term-facet combination. 8. The computer-implemented method of claim 1, wherein the at least one data set is the second data set. 9. The computer-implemented method of claim 1, wherein the second data set is a data set associated with a synched content management system. 10. A computer system for performing a search of a data set comprising:
at least one processor; memory operatively coupled to the at least one processor; and a second data set stored in the memory,
wherein the at least one processor is configured to:
receive a search term from a user;
search one or more data sets that are operatively coupled to the at least one processor for suggested search terms that contain the received search term and that are associated with at least one of a plurality of system-designated facets;
rank the suggested search terms;
display, to the user, the ranked suggested search terms and their associated system-designated facet as suggested search term-facet combinations;
receive, from the user, a selection of one of the displayed search term-facet combinations; and
initiate a search of the second data set based on the selected search term-facet combination. 11. The computer system of claim 10, wherein the second data set is a member profile database for a social networking site. 12. The computer implemented system of claim 10, wherein the second data set is data associated with a synched content management system. 13. The computer system of claim 12, wherein the at least one processor is further configured to display all members whose member profile contains the selected search term-facet combination. 14. The computer system of claim 11, wherein the at least one processor is further configured to use the number of times the suggested search terms appear in the one or more data sets to rank the suggested search term-facet combinations. 15. A system of performing a search, the system comprising:
at least one processor; and a display operatively coupled to the at least one processor,
wherein the at least one processor is configured to:
receive a search term from a user;
search one or more data sets operatively coupled to the at least one processor for entries that contain the received search term and that are associated with one of a plurality of system-designated facets;
form a suggested search term-facet combination by pairing each entry that contains the received search term with the system-designated facet that is associated with the entry;
display, to the user, the suggested search term-facet combinations; and
initiate a search of a second data set that is operatively coupled to the at least one processor based on a selected one of the displayed search term-facet combinations. 16. The system of claim 15, wherein
the one or more data sets is one or more databases; the second data set is a member profile database that contains a plurality of entries, each entry corresponding to a member profile; each of the plurality of entries comprises a plurality data points; and each one of plurality of data points is associated with a respective system-designated facet. 17. The system of claim 16, wherein the at least one processor is further configured to display, to the user, each member profile that contains the selected search term-facet combination. 18. The system of claim 15, wherein the at least one processor is further configured to rank each suggested search term-facet combination based on the number of times each one of the suggested search terms appears in the one or more data sets. 19. The system of claim 18, wherein displaying the suggested search term-facet combinations further comprises displaying the four highest ranked search term-facet combinations. 20. A system of performing a search, the system comprising:
a means for receiving a search term; a means for determining a plurality of search term-facet combinations based on the received search term and a plurality of system-designated facets; a means for searching a data set based on a selected one of the search term-facet combination; and a means for selecting and displaying data from a data set based on one of the search term-facet combinations. 21. The system of claim 20, wherein the data set is a database that comprises profile information for members of a social networking site. 22. The system of claim 20, the means for determining a plurality of search term-facet combinations further comprises:
a means for searching one or more data sets for data that is based on the received search term; and a means for associating the data with one of the plurality of system-designated facets. | 2,100 |
5,213 | 13,362,942 | 2,129 | A method for real-time server management may include determining a server architecture model based on performance characteristics of a component of a server. The method may further include determining a real-time model of the server from the server architecture model based on real-time server operation data, and adapting a performance controller for the server to operational characteristics of the server based on the real-time model. | 1. A method for real-time server management, the method comprising:
determining a server architecture model based on performance characteristics of a component of a server; determining, by a processor, a real-time model of the server from the server architecture model based on real-time server operation data; and adapting a performance controller for the server to operational characteristics of the server based on the real-time model. 2. The method of claim 1, further comprising automatically adapting the performance controller for the server to changes in operational characteristics of the server based on the real-time model. 3. The method of claim 1, wherein the server architecture model is based on a physical or data-based analysis of the server component offline or in real-time. 4. The method of claim 1, wherein the server architecture model includes one of a linear, a polynomial, and an exponential function. 5. The method of claim 1, further comprising determining parameter values of the server architecture model based on the real-time server operation data. 6. The method of claim 1, further comprising determining parameter values of the server architecture model through use of adaptive filters. 7. The method of claim 6, wherein the adaptive filters are based on recursive least square (RLS) regression. 8. The method of claim 1, wherein the performance controller includes one of a power capping controller, and a fan controller. 9. The method of claim 1, wherein the performance controller includes a power capping controller, and wherein the server architecture model for the power capping controller is based on power loss of a power supply as a function of output power. 10. The method of claim 1, wherein the performance controller includes a fan controller, and wherein the server architecture model for the fan controller accounts for leaked power, system power and fan power. 11. The method of claim 1, wherein the real-time operation data represents one of power supply AC inputs, power supply DC outputs, central processing unit (CPU) utilization, server temperature, fan speed, and server power. 12. A real-time server management apparatus comprising:
a memory storing a module comprising machine readable instructions to:
determine a real-time model of a server from a server architecture model, wherein the real-time model is based on real-time server operation data and the server architecture model is based on performance characteristics of a component of the server; and
adapt a performance controller for the server to operational characteristics of the server based on the real-time model; and
a processor to implement the module. 13. The apparatus of claim 12, wherein the server architecture model is based on a physical or data-based analysis of the server component offline or in real-time. 14. The apparatus of claim 12, wherein the real-time operation data represents one of power supply AC inputs, power supply DC outputs, central processing unit (CPU) utilization, server temperature, fan speed, and server power. 15. A non-transitory computer readable medium having stored thereon a computer executable program for real-time server management, the computer executable program when executed causes a computer system to:
determine a real-time model of a server from a server architecture model, wherein the real-time model is based on real-time server operation data and the server architecture model is based on performance characteristics of a component of the server; and adapt a performance controller for the server to operational characteristics of the server based on the real-time model. | A method for real-time server management may include determining a server architecture model based on performance characteristics of a component of a server. The method may further include determining a real-time model of the server from the server architecture model based on real-time server operation data, and adapting a performance controller for the server to operational characteristics of the server based on the real-time model.1. A method for real-time server management, the method comprising:
determining a server architecture model based on performance characteristics of a component of a server; determining, by a processor, a real-time model of the server from the server architecture model based on real-time server operation data; and adapting a performance controller for the server to operational characteristics of the server based on the real-time model. 2. The method of claim 1, further comprising automatically adapting the performance controller for the server to changes in operational characteristics of the server based on the real-time model. 3. The method of claim 1, wherein the server architecture model is based on a physical or data-based analysis of the server component offline or in real-time. 4. The method of claim 1, wherein the server architecture model includes one of a linear, a polynomial, and an exponential function. 5. The method of claim 1, further comprising determining parameter values of the server architecture model based on the real-time server operation data. 6. The method of claim 1, further comprising determining parameter values of the server architecture model through use of adaptive filters. 7. The method of claim 6, wherein the adaptive filters are based on recursive least square (RLS) regression. 8. The method of claim 1, wherein the performance controller includes one of a power capping controller, and a fan controller. 9. The method of claim 1, wherein the performance controller includes a power capping controller, and wherein the server architecture model for the power capping controller is based on power loss of a power supply as a function of output power. 10. The method of claim 1, wherein the performance controller includes a fan controller, and wherein the server architecture model for the fan controller accounts for leaked power, system power and fan power. 11. The method of claim 1, wherein the real-time operation data represents one of power supply AC inputs, power supply DC outputs, central processing unit (CPU) utilization, server temperature, fan speed, and server power. 12. A real-time server management apparatus comprising:
a memory storing a module comprising machine readable instructions to:
determine a real-time model of a server from a server architecture model, wherein the real-time model is based on real-time server operation data and the server architecture model is based on performance characteristics of a component of the server; and
adapt a performance controller for the server to operational characteristics of the server based on the real-time model; and
a processor to implement the module. 13. The apparatus of claim 12, wherein the server architecture model is based on a physical or data-based analysis of the server component offline or in real-time. 14. The apparatus of claim 12, wherein the real-time operation data represents one of power supply AC inputs, power supply DC outputs, central processing unit (CPU) utilization, server temperature, fan speed, and server power. 15. A non-transitory computer readable medium having stored thereon a computer executable program for real-time server management, the computer executable program when executed causes a computer system to:
determine a real-time model of a server from a server architecture model, wherein the real-time model is based on real-time server operation data and the server architecture model is based on performance characteristics of a component of the server; and adapt a performance controller for the server to operational characteristics of the server based on the real-time model. | 2,100 |
5,214 | 14,546,248 | 2,193 | A computer implemented method, system and computing device for identifying a test option associated with an application for a user is described. The method comprises selecting a predefined test indicated by a test identifier associated with the requested application, the test having more than one test option associated therewith, generating a hash of the test identifier and a user identifier associated with the user, processing the hash to generate an index, comparing said index with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and selecting a test option associated with the range into which the index falls. The applications may be computer gaming applications. | 1. A computer system for testing different options for modifying a computer executable application delivered to a population of users, the system comprising an application server, and a user device associated with a user of the population and configured to communicate with an application server and to access applications from the application server, the server having storage for storing applications for access and at least one test identifier identifying a test for the application, each test having multiple test options for modifying the application, the server having a processor configured to, in response to a received request from a user device for the application: select a test associated with the requested application, generate a hash of a user identifier associated with a user at the user device and the test identifier associated with the selected test, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, select a test option associated with the range into which the index value falls, and transmit to the user device the application modified by the selected test option. 2. A computer system according to claim 1, comprising an event database which holds a data structure comprising at least one user identifier, application data defining the application and associated event data for that user when executing the application modified by the selected test option. 3. A computer system according to claim 1, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 4. A computer system according to claim 3, wherein the processing of the hash to generate an index value comprises performing a modulus operation on said integer. 5. A computer system according to claim 4, wherein the modulus operation is a modulus(100) operation to provide an index value falling within said distribution of numbers. 6. A computer system according to claim 1, further comprising an analytics server in communication with the event database and configured to analyse the event data associated with the test options. 7. A computer system according to claim 1, wherein the stored applications comprise computer games. 8. A computer system according to claim 7, wherein test options associated with the computer games modify the user interface of said computer games. 9. A computer system according to claim 1, wherein the test options comprise an AB test. 10. A computer system according to claim 9, wherein the AB test returns an indication of the preferred test option. 11. A computer device for analysing event data associated with an application under test, the device comprising at least one processor and a database storing: a data structure storing at least one user identifier associated with a user, application data and event data for the user when executing the application modified by one of multiple test options, where in response to an analysis query comprising a user identifier, the at least one processor is configured to: request a test identifier and associated application event data associated with that user, generate a hash of the user identifier and the test identifier, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges to determine within which range the index value falls, select the test option associated with the range into which the index value falls, and associate the selected test option with the associated event data for analysis. 12. A computer implemented method for identifying a test option associated with an application executable at a user device of a user, the method comprising executing a program by a computer processor which performs the steps of: accessing from a data structure stored in electronic memory a predefined test indicated by a test identifier associated with the application, the test having more than one test option associated therewith, generating a hash of a user identifier associated with the user and the test identifier associated with the selected test, processing the hash to generate an index value, comparing said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and selecting a test option associated with the range into which the index value falls. 13. A computer implemented method according to claim 12, further comprising modifying the application using the selected test option and delivering said modified application to said user. 14. A computer implemented method according to claim 13, in which event data generated from executing the modified application at a user device is associated with the selected test option. 15. A computer implemented method according to claim 14, which when executed by an analytics server requests said associated event data with the selected test option for analysis. 16. A computer implemented method according to claim 12, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 17. A computer implemented method according to claim 12, wherein the processing of the hash to generate an index value comprises performing a modulus operation on said integer. 18. A computer implemented method according to claim 17, wherein the modulus operation is a modulus(100) operation to provide an index value falling within said distribution of numbers. 19. A computing device for testing different options for modifying a computer executable application delivered to a population of users from a store for storing applications for access and at least one test identifier identifying a test for the application, each test having multiple test options for modifying the application, the computing device having a processor configured to, in response to a received request from a user device for the application: select a test associated with the requested application, generate a hash of a user identifier associated with a user at the user device and the test identifier, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, select a test option associated with the range into which the index value falls, and transmit to the user device the application modified by the selected test option to the user device. 20. A computer program on a non-transitory computer-readable medium, which when executed by a processor of a computing device, causes said processor to access from a data structure stored in electronic memory a predefined test indicated by a test identifier associated with an application executable at a user device of a user, the test having more than one test option associated therewith, generate a hash of the test identifier and a user identifier associated with the user, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and select a test option associated with the range into which the index value falls. 21. A module for determining an index value indicating a test option in response to a user identifier and a test identifier provided by a computing device in communication therewith, the module being configured to generate a hash of the provided user identifier and test identifier, to process the hash to provide an index value, and to return said index value to said computing device. 22. A module according to claim 21, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 23. A module according to claim 22, wherein the module is further configured to perform a modulo operation on said integer to provide the index value. 24. A computing device configured to communicate with the module of claim 21. | A computer implemented method, system and computing device for identifying a test option associated with an application for a user is described. The method comprises selecting a predefined test indicated by a test identifier associated with the requested application, the test having more than one test option associated therewith, generating a hash of the test identifier and a user identifier associated with the user, processing the hash to generate an index, comparing said index with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and selecting a test option associated with the range into which the index falls. The applications may be computer gaming applications.1. A computer system for testing different options for modifying a computer executable application delivered to a population of users, the system comprising an application server, and a user device associated with a user of the population and configured to communicate with an application server and to access applications from the application server, the server having storage for storing applications for access and at least one test identifier identifying a test for the application, each test having multiple test options for modifying the application, the server having a processor configured to, in response to a received request from a user device for the application: select a test associated with the requested application, generate a hash of a user identifier associated with a user at the user device and the test identifier associated with the selected test, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, select a test option associated with the range into which the index value falls, and transmit to the user device the application modified by the selected test option. 2. A computer system according to claim 1, comprising an event database which holds a data structure comprising at least one user identifier, application data defining the application and associated event data for that user when executing the application modified by the selected test option. 3. A computer system according to claim 1, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 4. A computer system according to claim 3, wherein the processing of the hash to generate an index value comprises performing a modulus operation on said integer. 5. A computer system according to claim 4, wherein the modulus operation is a modulus(100) operation to provide an index value falling within said distribution of numbers. 6. A computer system according to claim 1, further comprising an analytics server in communication with the event database and configured to analyse the event data associated with the test options. 7. A computer system according to claim 1, wherein the stored applications comprise computer games. 8. A computer system according to claim 7, wherein test options associated with the computer games modify the user interface of said computer games. 9. A computer system according to claim 1, wherein the test options comprise an AB test. 10. A computer system according to claim 9, wherein the AB test returns an indication of the preferred test option. 11. A computer device for analysing event data associated with an application under test, the device comprising at least one processor and a database storing: a data structure storing at least one user identifier associated with a user, application data and event data for the user when executing the application modified by one of multiple test options, where in response to an analysis query comprising a user identifier, the at least one processor is configured to: request a test identifier and associated application event data associated with that user, generate a hash of the user identifier and the test identifier, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges to determine within which range the index value falls, select the test option associated with the range into which the index value falls, and associate the selected test option with the associated event data for analysis. 12. A computer implemented method for identifying a test option associated with an application executable at a user device of a user, the method comprising executing a program by a computer processor which performs the steps of: accessing from a data structure stored in electronic memory a predefined test indicated by a test identifier associated with the application, the test having more than one test option associated therewith, generating a hash of a user identifier associated with the user and the test identifier associated with the selected test, processing the hash to generate an index value, comparing said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and selecting a test option associated with the range into which the index value falls. 13. A computer implemented method according to claim 12, further comprising modifying the application using the selected test option and delivering said modified application to said user. 14. A computer implemented method according to claim 13, in which event data generated from executing the modified application at a user device is associated with the selected test option. 15. A computer implemented method according to claim 14, which when executed by an analytics server requests said associated event data with the selected test option for analysis. 16. A computer implemented method according to claim 12, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 17. A computer implemented method according to claim 12, wherein the processing of the hash to generate an index value comprises performing a modulus operation on said integer. 18. A computer implemented method according to claim 17, wherein the modulus operation is a modulus(100) operation to provide an index value falling within said distribution of numbers. 19. A computing device for testing different options for modifying a computer executable application delivered to a population of users from a store for storing applications for access and at least one test identifier identifying a test for the application, each test having multiple test options for modifying the application, the computing device having a processor configured to, in response to a received request from a user device for the application: select a test associated with the requested application, generate a hash of a user identifier associated with a user at the user device and the test identifier, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, select a test option associated with the range into which the index value falls, and transmit to the user device the application modified by the selected test option to the user device. 20. A computer program on a non-transitory computer-readable medium, which when executed by a processor of a computing device, causes said processor to access from a data structure stored in electronic memory a predefined test indicated by a test identifier associated with an application executable at a user device of a user, the test having more than one test option associated therewith, generate a hash of the test identifier and a user identifier associated with the user, process the hash to generate an index value, compare said index value with a distribution of numbers divided into multiple ranges, each range being associated with a test option, and select a test option associated with the range into which the index value falls. 21. A module for determining an index value indicating a test option in response to a user identifier and a test identifier provided by a computing device in communication therewith, the module being configured to generate a hash of the provided user identifier and test identifier, to process the hash to provide an index value, and to return said index value to said computing device. 22. A module according to claim 21, wherein the generation of the hash comprises performing an MD5 hashing operation to provide an integer. 23. A module according to claim 22, wherein the module is further configured to perform a modulo operation on said integer to provide the index value. 24. A computing device configured to communicate with the module of claim 21. | 2,100 |
5,215 | 13,427,299 | 2,179 | Stacks that associate different electronic content are created using tags that are associated with electronic content. Stacks may be personal, organizational and/or shared. A tag may be associated with different types of electronic content (e.g. documents, people, contacts, meetings, emails, . . . ) that may be stored in different locations. The tag acts as an identifier that travels with the content as the electronic content is used. Content may be automatically/manually tagged. As the tagged content is used, the different applications that interact with the content (e.g. a messaging application, a content application) can use the tag to perform different actions. Changes to content with a tag may be aggregated such that users looking at the “consolidated” view can see all changes made to content or activity related to that content. | 1. A method for organizing electronic content, comprising:
displaying a stack user interface element that represents a stack that relates electronic content that comprise messages and documents across different applications; receiving an interaction with the stack UI element that requests a view of the stack to be displayed; accessing the stack that associates the electronic content using tags; and displaying a summary of the electronic content that is associated with the stack. 2. The method of claim 1, wherein the electronic content comprises people, calendar events, documents, and electronic messages that is tagged to be associated with at least the stack. 3. The method of claim 2, wherein displaying the electronic content that is associated with the stack comprises displaying a single view of the electronic content across different systems. 4. The method of claim 3, wherein the different systems comprise an electronic messaging system and a content system. 5. The method of claim 1, wherein the stack comprises a personal stack and a system stack. 6. The method of claim 5, wherein the personal stack and the system stack are automatically created. 7. The method of claim 1, further comprising automatically synchronizing the stacks. 8. The method of claim 1, further comprising receiving a selection to create a stack that indicates electronic content to associate with the stack. 9. The method of claim 1, wherein displaying the stack comprises displaying new activities since a last view of the stack, a total number of activities, meeting events and a to-do list. 10. A computer-readable medium having computer-executable instructions for organizing electronic content, comprising:
determining when to create a stack that relates electronic content that comprise messages and documents across different applications; tagging electronic content with a tag to associate with the stack; receiving a request to interact with the stack; accessing the stack that associates the electronic content using the tag; and displaying a view of the stack that includes at least a portion of the electronic content that is associated with the stack. 11. The computer-readable medium of claim 10, wherein the electronic content comprises events, documents, and electronic messages. 12. The computer-readable medium of claim 10, wherein displaying the view of the stack comprises displaying a summary view of the electronic content within the stack. 13. The computer-readable medium of claim 10, wherein the different applications comprise an electronic messaging system and a content system. 14. The computer-readable medium of claim 10, further comprising synchronizing stacks across different applications. 15. The computer-readable medium of claim 10, further comprising receiving a selection of content that is used to determine initial electronic content for the stack. 16. The computer-readable medium of claim 10, wherein displaying the stack comprises displaying activities related to the stack, and current interactions with the stack. 17. A system for organizing electronic content, comprising:
a network connection that is coupled to tenants of the multi-tenant service; a processor and a computer-readable medium; an operating environment stored on the computer-readable medium and executing on the processor; and a stack manager operating under the control of the operating environment and operative to actions comprising: determining when to create a stack that relates electronic content that comprise messages and documents across different applications comprising a messaging system and a content system; tagging electronic content with a tag to associate with the stack; receiving a request to interact with the stack; accessing the stack that associates the electronic content using the tag; and displaying a view of the stack that includes at least a portion of the electronic content that is associated with the stack. 18. The system of claim 17, wherein displaying the view of the stack comprises displaying a summary view of the electronic content within the stack. 19. The system of claim 17, further comprising receiving a selection of content that is used to determine initial electronic content for the stack. 20. The system of claim 17, wherein displaying the stack comprises displaying activities related to the stack, and current interactions with the stack. | Stacks that associate different electronic content are created using tags that are associated with electronic content. Stacks may be personal, organizational and/or shared. A tag may be associated with different types of electronic content (e.g. documents, people, contacts, meetings, emails, . . . ) that may be stored in different locations. The tag acts as an identifier that travels with the content as the electronic content is used. Content may be automatically/manually tagged. As the tagged content is used, the different applications that interact with the content (e.g. a messaging application, a content application) can use the tag to perform different actions. Changes to content with a tag may be aggregated such that users looking at the “consolidated” view can see all changes made to content or activity related to that content.1. A method for organizing electronic content, comprising:
displaying a stack user interface element that represents a stack that relates electronic content that comprise messages and documents across different applications; receiving an interaction with the stack UI element that requests a view of the stack to be displayed; accessing the stack that associates the electronic content using tags; and displaying a summary of the electronic content that is associated with the stack. 2. The method of claim 1, wherein the electronic content comprises people, calendar events, documents, and electronic messages that is tagged to be associated with at least the stack. 3. The method of claim 2, wherein displaying the electronic content that is associated with the stack comprises displaying a single view of the electronic content across different systems. 4. The method of claim 3, wherein the different systems comprise an electronic messaging system and a content system. 5. The method of claim 1, wherein the stack comprises a personal stack and a system stack. 6. The method of claim 5, wherein the personal stack and the system stack are automatically created. 7. The method of claim 1, further comprising automatically synchronizing the stacks. 8. The method of claim 1, further comprising receiving a selection to create a stack that indicates electronic content to associate with the stack. 9. The method of claim 1, wherein displaying the stack comprises displaying new activities since a last view of the stack, a total number of activities, meeting events and a to-do list. 10. A computer-readable medium having computer-executable instructions for organizing electronic content, comprising:
determining when to create a stack that relates electronic content that comprise messages and documents across different applications; tagging electronic content with a tag to associate with the stack; receiving a request to interact with the stack; accessing the stack that associates the electronic content using the tag; and displaying a view of the stack that includes at least a portion of the electronic content that is associated with the stack. 11. The computer-readable medium of claim 10, wherein the electronic content comprises events, documents, and electronic messages. 12. The computer-readable medium of claim 10, wherein displaying the view of the stack comprises displaying a summary view of the electronic content within the stack. 13. The computer-readable medium of claim 10, wherein the different applications comprise an electronic messaging system and a content system. 14. The computer-readable medium of claim 10, further comprising synchronizing stacks across different applications. 15. The computer-readable medium of claim 10, further comprising receiving a selection of content that is used to determine initial electronic content for the stack. 16. The computer-readable medium of claim 10, wherein displaying the stack comprises displaying activities related to the stack, and current interactions with the stack. 17. A system for organizing electronic content, comprising:
a network connection that is coupled to tenants of the multi-tenant service; a processor and a computer-readable medium; an operating environment stored on the computer-readable medium and executing on the processor; and a stack manager operating under the control of the operating environment and operative to actions comprising: determining when to create a stack that relates electronic content that comprise messages and documents across different applications comprising a messaging system and a content system; tagging electronic content with a tag to associate with the stack; receiving a request to interact with the stack; accessing the stack that associates the electronic content using the tag; and displaying a view of the stack that includes at least a portion of the electronic content that is associated with the stack. 18. The system of claim 17, wherein displaying the view of the stack comprises displaying a summary view of the electronic content within the stack. 19. The system of claim 17, further comprising receiving a selection of content that is used to determine initial electronic content for the stack. 20. The system of claim 17, wherein displaying the stack comprises displaying activities related to the stack, and current interactions with the stack. | 2,100 |
5,216 | 14,432,543 | 2,128 | A method is disclosed for the generation and application of anisotropic elastic parameters associated with a horizontal transverse isotropic (HTI) medium. Azimuthal anisotropic elastic parameters are generated such that, for selected seismic wave and anisotropy types, an approximation to the anisotropic modeling of seismic amplitudes is obtained by the equivalent isotropic modeling with the anisotropic elastic parameters. In seismic modeling, wave-let estimation, seismic interpretation, inversion and the interpretation and analysis of inversion results anisotropy are handled with isotropic methods. Earth elastic parameters utilized in these methods are replaced by the anisotropic elastic parameters. | 1. A method for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the method comprising:
obtaining earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics; obtaining earth anisotropy parameter data from the area of interest; and transforming the earth elastic parameter data based on the obtained earth anisotropy parameter data to obtain anisotropic elastic parameter data by applying transform functions that convert the earth elastic parameter data and the earth anisotropy parameter data into the anisotropic elastic parameter data. 2. The method of claim 1, further comprising: applying the anisotropic elastic parameter data in at least one seismic processing method selected from the group including: i) an isotropic seismic modeling method, ii) an isotropic seismic analysis and interpretation method, iii) an isotropic seismic wavelet estimation method, iv) an isotropic seismic inversion method, and v) an isotropic method for analysis and interpretation of inversion results to produce processed anisotropic elastic parameter data. 3. The method of claim 2, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in the isotropic method for analysis and interpretation of inversion results. 4. The method of claim 1, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. 5. (canceled) 6. The method of claim 1, wherein the transform functions are E′=εr xδr yγr zE, wherein εr, δr and γr are anisotropy relative contrast parameters, E′ is an anisotropic elastic parameter, E is the corresponding elastic parameter and x, y and z are constants. 7. The method of claim 1, wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 8. The method of claim 1, wherein the anisotropy parameter data are transformed to anisotropy relative contrast parameters such that relative contrasts of the transformed anisotropy parameters approximate the contrasts in the anisotropy parameter data. 9. The method of claim 1, further comprising:
applying isotropic seismic modeling on the transformed anisotropic elastic parameter data to produce anisotropic seismic data, the produced anisotropic seismic data being an approximation of seismic data obtained by anisotropic seismic modeling. 10. The method of claim 9, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in isotropic seismic modeling to produce the anisotropic seismic data. 11. A system for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the system comprising:
at least one processor configured to obtain earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics, to obtain earth anisotropy parameter data from the area of interest, and to transform the earth elastic parameter data based on input earth anisotropy parameter data to obtain anisotropic elastic parameter data; wherein the at least one processor is further configured to apply transform functions that convert the earth elastic parameter data and the earth anisotropy parameter data into the anisotropic elastic parameter data. 12. The system of claim 1, wherein the at least one processor is further configured to apply the anisotropic elastic parameter data in at least one seismic processing method selected from the group including: i) an isotropic seismic modeling method, ii) an isotropic seismic analysis and interpretation method, iii) an isotropic seismic wavelet estimation method, iv) an isotropic seismic inversion method, and v) an isotropic method for analysis and interpretation of inversion results to produce processed anisotropic elastic parameter data. 13. The system of claim 12, wherein the at least one processor is further configured to substituting the anisotropic elastic parameter data for isotropic elastic parameter data in the isotropic method for analysis and interpretation of inversion results. 14. The system of claim 11, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. 15. (canceled) 16. The system of claim 11, wherein the transform functions are E′=εr xδr yγr zE, wherein εr, δr and γr are anisotropy relative contrast parameters, E′ is an anisotropic elastic parameter, E is the corresponding elastic parameter and x,y and z are constants. 17. The system of claim 11, wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 18. The system of claim 11, wherein the anisotropy parameter data are transformed to anisotropy relative contrast parameters such that relative contrasts of the transformed anisotropy parameters approximate the contrasts in the anisotropy parameter data. 19. The system of claim 11, wherein the at least one processor is further configured to apply isotropic seismic modeling on the transformed anisotropic elastic parameter data to produce anisotropic seismic data, the produced anisotropic seismic data being an approximation of seismic data obtained by anisotropic seismic modeling. 20. The system of claim 19, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in isotropic seismic modeling to produce the anisotropic seismic data. 21. A method for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the method comprising:
obtaining earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics; obtaining earth anisotropy parameter data from the area of interest; and transforming the earth elastic parameter data based on the obtained earth anisotropy parameter data to obtain anisotropic elastic parameter data; wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 22. The method of claim 21, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. | A method is disclosed for the generation and application of anisotropic elastic parameters associated with a horizontal transverse isotropic (HTI) medium. Azimuthal anisotropic elastic parameters are generated such that, for selected seismic wave and anisotropy types, an approximation to the anisotropic modeling of seismic amplitudes is obtained by the equivalent isotropic modeling with the anisotropic elastic parameters. In seismic modeling, wave-let estimation, seismic interpretation, inversion and the interpretation and analysis of inversion results anisotropy are handled with isotropic methods. Earth elastic parameters utilized in these methods are replaced by the anisotropic elastic parameters.1. A method for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the method comprising:
obtaining earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics; obtaining earth anisotropy parameter data from the area of interest; and transforming the earth elastic parameter data based on the obtained earth anisotropy parameter data to obtain anisotropic elastic parameter data by applying transform functions that convert the earth elastic parameter data and the earth anisotropy parameter data into the anisotropic elastic parameter data. 2. The method of claim 1, further comprising: applying the anisotropic elastic parameter data in at least one seismic processing method selected from the group including: i) an isotropic seismic modeling method, ii) an isotropic seismic analysis and interpretation method, iii) an isotropic seismic wavelet estimation method, iv) an isotropic seismic inversion method, and v) an isotropic method for analysis and interpretation of inversion results to produce processed anisotropic elastic parameter data. 3. The method of claim 2, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in the isotropic method for analysis and interpretation of inversion results. 4. The method of claim 1, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. 5. (canceled) 6. The method of claim 1, wherein the transform functions are E′=εr xδr yγr zE, wherein εr, δr and γr are anisotropy relative contrast parameters, E′ is an anisotropic elastic parameter, E is the corresponding elastic parameter and x, y and z are constants. 7. The method of claim 1, wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 8. The method of claim 1, wherein the anisotropy parameter data are transformed to anisotropy relative contrast parameters such that relative contrasts of the transformed anisotropy parameters approximate the contrasts in the anisotropy parameter data. 9. The method of claim 1, further comprising:
applying isotropic seismic modeling on the transformed anisotropic elastic parameter data to produce anisotropic seismic data, the produced anisotropic seismic data being an approximation of seismic data obtained by anisotropic seismic modeling. 10. The method of claim 9, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in isotropic seismic modeling to produce the anisotropic seismic data. 11. A system for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the system comprising:
at least one processor configured to obtain earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics, to obtain earth anisotropy parameter data from the area of interest, and to transform the earth elastic parameter data based on input earth anisotropy parameter data to obtain anisotropic elastic parameter data; wherein the at least one processor is further configured to apply transform functions that convert the earth elastic parameter data and the earth anisotropy parameter data into the anisotropic elastic parameter data. 12. The system of claim 1, wherein the at least one processor is further configured to apply the anisotropic elastic parameter data in at least one seismic processing method selected from the group including: i) an isotropic seismic modeling method, ii) an isotropic seismic analysis and interpretation method, iii) an isotropic seismic wavelet estimation method, iv) an isotropic seismic inversion method, and v) an isotropic method for analysis and interpretation of inversion results to produce processed anisotropic elastic parameter data. 13. The system of claim 12, wherein the at least one processor is further configured to substituting the anisotropic elastic parameter data for isotropic elastic parameter data in the isotropic method for analysis and interpretation of inversion results. 14. The system of claim 11, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. 15. (canceled) 16. The system of claim 11, wherein the transform functions are E′=εr xδr yγr zE, wherein εr, δr and γr are anisotropy relative contrast parameters, E′ is an anisotropic elastic parameter, E is the corresponding elastic parameter and x,y and z are constants. 17. The system of claim 11, wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 18. The system of claim 11, wherein the anisotropy parameter data are transformed to anisotropy relative contrast parameters such that relative contrasts of the transformed anisotropy parameters approximate the contrasts in the anisotropy parameter data. 19. The system of claim 11, wherein the at least one processor is further configured to apply isotropic seismic modeling on the transformed anisotropic elastic parameter data to produce anisotropic seismic data, the produced anisotropic seismic data being an approximation of seismic data obtained by anisotropic seismic modeling. 20. The system of claim 19, further comprising substituting the anisotropic elastic parameter data for isotropic elastic parameter data in isotropic seismic modeling to produce the anisotropic seismic data. 21. A method for anisotropic processing of earth elastic parameter data associated with a horizontal transverse isotropy (HTI) anisotropic medium, the method comprising:
obtaining earth elastic parameter data associated with an area of interest, wherein the area of interest includes a layer of an HTI anisotropic medium having azimuthal anisotropic characteristics; obtaining earth anisotropy parameter data from the area of interest; and transforming the earth elastic parameter data based on the obtained earth anisotropy parameter data to obtain anisotropic elastic parameter data; wherein transforming elastic parameter data to anisotropic elastic parameter data is obtained by integration of anisotropic elastic parameter contrasts. 22. The method of claim 21, wherein the area of interest is imaged using a wide azimuth seismic acquisition technique to obtain said elastic parameter data and said anisotropic parameter data. | 2,100 |
5,217 | 13,750,536 | 2,143 | A method of operating a first data processing system having a screen for responding to a vector gesture performed on that screen is disclosed. The method includes estimating a direction and assuming an identity for the vector gesture prior to the vector gesture being completed. A command that depends on the estimated direction and assumed identity is executed, the command being a command that would be required to update a current state of the first data processing system if the assumed identity of the vector gesture is correct. The command is executed prior to the vector gesture being completed. The current state of the first data processing system is then updated based on the data generated by the command. After the vector gesture has been determined to have been completed, the first data processing system is updated to a state indicated by the completed vector gesture. | 1. A method of operating a first data processing system having a screen for responding to a vector gesture performed on that screen, said method comprising:
estimating a direction and assuming an identity for said vector gesture prior to said vector gesture being completed; executing a command that depends on said estimated direction and assumed identity, said command being required to update a current state of said first data processing system if said assumed identity of said vector gesture is correct, said command being executed prior to said vector gesture being completed; and updating said current state of said first data processing system based on a result generated by said command. 2. The method of claim 1 wherein said screen comprises a touch-enabled screen. 3. The method of claim 1 further comprising:
determining if said vector gesture has been completed; and
updating said first data processing system to a state indicated by said completed vector gesture if said vector gesture was completed. 4. The method of claim 1 wherein said command causes a second data processing system to provide data to said first data processing system. 5. The method of claim 1 wherein updating said current state of said first data processing system comprising updating a display on said first data processing system with data obtained from executing said command. 6. The method of claim 1 wherein said current state comprises a first scene on said screen and wherein said assumed identity comprising a scrolling gesture that indicates that said first scene is to be scrolled in said estimated direction. 7. The method of claim 6 wherein said current state comprises displaying a partially scrolled scene on said screen, said update to said current state comprises a partially scrolled version of said first scene. 8. The method of claim 3 wherein updating said first data processing system to a state indicated by said completed vector gesture comprises displaying a first scene on said screen followed by a second scene having a higher resolution than said first scene. 9. The method of claim 3 wherein estimating a direction and assuming an identity for said vector gesture is repeated if said vector gesture was not completed. 10. The method of claim 1 wherein said first data processor determines an end point for a display to be provided on said screen in response to a fling gesture, and wherein said first data processing system displays intermediate displays that are not part of a final display that would be provided if said fling gesture is not terminated prematurely in a low bandwidth form to allow said fling to be terminated prematurely. 11. A computer readable medium that includes instructions that cause a data processing system to execute a method for responding to a vector gesture performed on a screen on that data processing system, said method comprising:
estimating a direction and assuming an identity for said vector gesture prior to said vector gesture being completed; executing a command that depends on said estimated direction and assumed identity, said command being required to update a current state of said first data processing system if said assumed identity of said vector gesture is correct, said command being executed prior to said vector gesture being completed; and updating said current state of said first data processing system based on a result generated by said command. 12. The computer readable medium of claim 11 wherein said screen comprises a touch-enabled screen. 13. The computer readable medium of claim 11 further comprising:
determining if said vector gesture has been completed; and
updating said first data processing system to a state indicated by said completed vector gesture if said vector gesture was completed. 14. The computer readable medium of claim 11 wherein said command causes a second data processing system to provide data to said first data processing system. 15. The computer readable medium of claim 11 wherein updating said current state of said first data processing system comprises updating a display on said first data processing system with data obtained from executing said command. 16. The computer readable medium of claim 11 wherein said current state comprises a first scene on said screen and wherein said assumed identity comprising a scrolling gesture that indicates that said first scene is to be scrolled in said estimated direction. 17. The computer readable medium of claim 16 wherein said current state comprises displaying a partially scrolled scene on said screen, said update to said current state comprises a partially scrolled version of said first scene. 18. The computer readable medium of claim 13 wherein updating said first data processing system to a state indicated by said completed vector gesture comprises displaying a first scene on said screen followed by a second scene having a higher resolution than said first scene. 19. The computer readable medium of claim 13 wherein estimating a direction and assuming an identity for said vector gesture is repeated if said vector gesture was not completed. 20. The computer readable medium of claim 11 wherein said first data processing system determines an end point for a display to be provided on said screen in response to a fling gesture, and wherein said first data processor displays intermediate displays that are not part of a final display that would be provided if said fling gesture is not terminated prematurely in a low bandwidth form to allow said fling to be terminated prematurely. | A method of operating a first data processing system having a screen for responding to a vector gesture performed on that screen is disclosed. The method includes estimating a direction and assuming an identity for the vector gesture prior to the vector gesture being completed. A command that depends on the estimated direction and assumed identity is executed, the command being a command that would be required to update a current state of the first data processing system if the assumed identity of the vector gesture is correct. The command is executed prior to the vector gesture being completed. The current state of the first data processing system is then updated based on the data generated by the command. After the vector gesture has been determined to have been completed, the first data processing system is updated to a state indicated by the completed vector gesture.1. A method of operating a first data processing system having a screen for responding to a vector gesture performed on that screen, said method comprising:
estimating a direction and assuming an identity for said vector gesture prior to said vector gesture being completed; executing a command that depends on said estimated direction and assumed identity, said command being required to update a current state of said first data processing system if said assumed identity of said vector gesture is correct, said command being executed prior to said vector gesture being completed; and updating said current state of said first data processing system based on a result generated by said command. 2. The method of claim 1 wherein said screen comprises a touch-enabled screen. 3. The method of claim 1 further comprising:
determining if said vector gesture has been completed; and
updating said first data processing system to a state indicated by said completed vector gesture if said vector gesture was completed. 4. The method of claim 1 wherein said command causes a second data processing system to provide data to said first data processing system. 5. The method of claim 1 wherein updating said current state of said first data processing system comprising updating a display on said first data processing system with data obtained from executing said command. 6. The method of claim 1 wherein said current state comprises a first scene on said screen and wherein said assumed identity comprising a scrolling gesture that indicates that said first scene is to be scrolled in said estimated direction. 7. The method of claim 6 wherein said current state comprises displaying a partially scrolled scene on said screen, said update to said current state comprises a partially scrolled version of said first scene. 8. The method of claim 3 wherein updating said first data processing system to a state indicated by said completed vector gesture comprises displaying a first scene on said screen followed by a second scene having a higher resolution than said first scene. 9. The method of claim 3 wherein estimating a direction and assuming an identity for said vector gesture is repeated if said vector gesture was not completed. 10. The method of claim 1 wherein said first data processor determines an end point for a display to be provided on said screen in response to a fling gesture, and wherein said first data processing system displays intermediate displays that are not part of a final display that would be provided if said fling gesture is not terminated prematurely in a low bandwidth form to allow said fling to be terminated prematurely. 11. A computer readable medium that includes instructions that cause a data processing system to execute a method for responding to a vector gesture performed on a screen on that data processing system, said method comprising:
estimating a direction and assuming an identity for said vector gesture prior to said vector gesture being completed; executing a command that depends on said estimated direction and assumed identity, said command being required to update a current state of said first data processing system if said assumed identity of said vector gesture is correct, said command being executed prior to said vector gesture being completed; and updating said current state of said first data processing system based on a result generated by said command. 12. The computer readable medium of claim 11 wherein said screen comprises a touch-enabled screen. 13. The computer readable medium of claim 11 further comprising:
determining if said vector gesture has been completed; and
updating said first data processing system to a state indicated by said completed vector gesture if said vector gesture was completed. 14. The computer readable medium of claim 11 wherein said command causes a second data processing system to provide data to said first data processing system. 15. The computer readable medium of claim 11 wherein updating said current state of said first data processing system comprises updating a display on said first data processing system with data obtained from executing said command. 16. The computer readable medium of claim 11 wherein said current state comprises a first scene on said screen and wherein said assumed identity comprising a scrolling gesture that indicates that said first scene is to be scrolled in said estimated direction. 17. The computer readable medium of claim 16 wherein said current state comprises displaying a partially scrolled scene on said screen, said update to said current state comprises a partially scrolled version of said first scene. 18. The computer readable medium of claim 13 wherein updating said first data processing system to a state indicated by said completed vector gesture comprises displaying a first scene on said screen followed by a second scene having a higher resolution than said first scene. 19. The computer readable medium of claim 13 wherein estimating a direction and assuming an identity for said vector gesture is repeated if said vector gesture was not completed. 20. The computer readable medium of claim 11 wherein said first data processing system determines an end point for a display to be provided on said screen in response to a fling gesture, and wherein said first data processor displays intermediate displays that are not part of a final display that would be provided if said fling gesture is not terminated prematurely in a low bandwidth form to allow said fling to be terminated prematurely. | 2,100 |
5,218 | 14,591,963 | 2,199 | A method for identifying and managing a plurality of virtual machines is provided. The method may include creating a virtual machine within the plurality of virtual machines. The method may include creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines. The method may also include assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, whereby the assigned globally unique ID is assigned to only one virtual machine. The method may include recording each globally unique ID into at least one database. The method may include associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. | 1. A method for identifying and managing a plurality of virtual machines, the method comprising:
creating a virtual machine within the plurality of virtual machines; creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; recording each globally unique ID into at least one database; and associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 2. The method of claim 1, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, the unused resource is not reflective of the globally unique ID and wherein the existing resource is optionally an unused fibre channel port, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. 3. The method of claim 2, wherein the globally unique ID can be assigned and queried in a legacy virtual machine environment not designed to support the assigning of the globally unique ID. 4. The method of claim 1, further comprising:
managing each of the virtual machines assigned each of the globally unique IDs, wherein the managing of the virtual machines further comprises: specifying a management command and the assigned globally unique ID; obtaining a management domain and a domain ID from the at least one database; and issuing a command to a control node for a returned domain, wherein the command comprises receiving a domain ID uniquely identifying at least one managed virtual machine within the obtained management domain. 5. The method of claim 1, further comprising:
migrating at least one virtual machine associated with at least one of the assigned globally unique IDs to a second management domain, wherein the migrating further comprises: receiving a target domain to which to relocate the at least one virtual machine corresponding to the globally unique ID; obtaining a unique management ID in the target domain, wherein the obtained unique management ID is a domain-specific VM ID; obtaining a first management domain and a first domain ID from the at least one database; issuing a relocation command specifying a from-domain and a to-domain, and a VM ID in the from-domain and a VM ID in the to-domain; and updating the at least one database to associate the assigned globally unique ID corresponding to the at least one migrated virtual machine with the second management domain and the domain-specific VM ID. 6. The method of claim 1, further comprising:
hibernating a uniquely identified virtual machine; determining a domain associated with the hibernated uniquely identified virtual machine and a domain specific virtual machine ID associated with the hibernated uniquely identified virtual machine; issuing a plurality of commands to stop at least one virtual machine and store an image associated with the at least one stopped virtual machine to an image file location; and storing a hibernation indication and the image file location in at least one database. 7. The method of claim 6, wherein the hibernation is indicated using a domain reflective of hibernation and a hibernation-domain ID corresponding to the image file location and wherein the hibernation further comprises:
including an optional indication that the hibernated partition as a partition has moved to the hibernation domain. 8. The method of claim 1, further comprising:
performing a domain load balancing for a plurality of domains; identifying an aggregate load level for at least one domain within the plurality of domains; determining a target load level for each domain within the plurality of domains; determining a contribution factor for each partition within a plurality of partitions associated with the at least one database based on a domain utilization; determining to move at least one virtual machine between at least two domains within the plurality of domains to reach a target load level, wherein the determination comprises optionally selecting service level agreements (SLAs) to determine the at least one virtual machine to be moved; migrating the plurality of virtual machines from a first current domain to a second domain; and updating the at least one database with the unique ID corresponding to each of the migrated virtual machines within the at least one moved virtual machines, a name associated with the second domain, and the domain ID corresponding to the determined second domain. 9. The method of claim 1 further comprising:
maintaining at least one second database within a plurality of second databases, wherein the second database maps at least one domain ID to at least one physical server within a plurality of servers;
responsive to obtaining a domain ID from a global ID to domain ID database, performing a lookup of the obtained domain ID in the maintained at least one second database, wherein the lookup is performed optionally after the obtained domain id has been sent to at least one second server within the plurality of servers; and
performing a further lookup of the obtained domain id in the at least one maintained second database within the plurality of maintained second databases, wherein the further look up is performed optionally after the obtained domain ID has been sent to at least one second server within the plurality of servers. 10. The method of claim 9, further comprising:
performing at least one action on the at least one maintained physical server within the plurality of servers after the performed action has been issued to a globally unique ID, wherein the globally unique ID has been mapped to the at least one domain ID, wherein the domain ID has been mapped to the at least one physical server within the plurality of servers. 11. A computer system for identifying and managing a plurality of virtual machines, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: creating a virtual machine within the plurality of virtual machines; creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; recording each globally unique ID into at least one database; and associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 12. The computer system of claim 11, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, wherein the existing resource is an unused fibre channel port and the unused resource is not reflective of the globally unique ID, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. 13. The computer system of claim 12, wherein the globally unique ID can be assigned and queried in a legacy virtual machine environment not designed to support the assigning of the globally unique ID. 14. The computer system of claim 11, further comprising:
managing each of the virtual machines assigned each of the globally unique IDs, wherein the managing of the virtual machines further comprises: specifying a management command and the assigned globally unique ID; obtaining a management domain and a domain ID from the at least one database; and issuing a command to a control node for a returned domain, wherein the command comprises receiving a domain ID uniquely identifying at least one managed virtual machine within the obtained management domain. 15. The computer system of claim 11, further comprising:
migrating at least one virtual machine associated with at least one of the assigned globally unique IDs to a second management domain, wherein the migrating further comprises: receiving a target domain to which to relocate the at least one virtual machine corresponding to the globally unique ID; obtaining a unique management ID in the target domain, wherein the obtained unique management ID is a domain-specific VM ID; obtaining a first management domain and a first domain ID from the at least one database; issuing a relocation command specifying a from-domain and a to-domain, and a VM ID in the from-domain and a VM ID in the to-domain; and updating the at least one database to associate the assigned globally unique ID corresponding to the at least one migrated virtual machine with the second management domain and the domain-specific VM ID. 16. The computer system of claim 11, further comprising:
hibernating a uniquely identified virtual machine; determining a domain associated with the hibernated uniquely identified virtual machine and a domain specific virtual machine ID associated with the hibernated uniquely identified virtual machine; issuing a plurality of commands to stop at least one virtual machine and store an image associated with the at least one stopped virtual machine to an image file location; and storing a hibernation indication and the image file location in at least one database. 17. The computer system of claim 16, wherein the hibernation is indicated using a domain reflective of hibernation and a hibernation-domain ID corresponding to the image file location and wherein the hibernation further comprises:
including an optional indication that the hibernation as a partition has moved to the hibernation domain. 18. The computer system of claim 11, further comprising:
performing a domain load balancing for a plurality of domains; identifying an aggregate load level for at least one domain within the plurality of domains; determining a target load level for each domain within the plurality of domains; determining a contribution factor for each partition within a plurality of partitions associated with the at least one database based on a domain utilization; determining to move at least one virtual machine between at least two domains within the plurality of domains to reach a target load level, wherein the determination comprises optionally selecting service level agreements (SLAs) to determine the at least one virtual machine to be moved; migrating the plurality of virtual machines from a first current domain to a second domain; and updating the at least one database with the unique ID corresponding to each of the migrated virtual machines within the at least one moved virtual machines, a name associated with the second domain, and the domain ID corresponding to the determined second domain. 19. A computer program product for identifying and managing a plurality of virtual machines, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more tangible storage devices, the program instructions executable by a processor, the program instructions comprising: program instructions to create a virtual machine within the plurality of virtual machines; program instructions to create a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; program instructions to assign each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; program instructions to record each globally unique ID into at least one database; and program instructions to associate the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 20. The computer program product of claim 19, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, wherein the existing resource is an unused fibre channel port and the unused resource is not reflective of the globally unique ID, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. | A method for identifying and managing a plurality of virtual machines is provided. The method may include creating a virtual machine within the plurality of virtual machines. The method may include creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines. The method may also include assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, whereby the assigned globally unique ID is assigned to only one virtual machine. The method may include recording each globally unique ID into at least one database. The method may include associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine.1. A method for identifying and managing a plurality of virtual machines, the method comprising:
creating a virtual machine within the plurality of virtual machines; creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; recording each globally unique ID into at least one database; and associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 2. The method of claim 1, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, the unused resource is not reflective of the globally unique ID and wherein the existing resource is optionally an unused fibre channel port, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. 3. The method of claim 2, wherein the globally unique ID can be assigned and queried in a legacy virtual machine environment not designed to support the assigning of the globally unique ID. 4. The method of claim 1, further comprising:
managing each of the virtual machines assigned each of the globally unique IDs, wherein the managing of the virtual machines further comprises: specifying a management command and the assigned globally unique ID; obtaining a management domain and a domain ID from the at least one database; and issuing a command to a control node for a returned domain, wherein the command comprises receiving a domain ID uniquely identifying at least one managed virtual machine within the obtained management domain. 5. The method of claim 1, further comprising:
migrating at least one virtual machine associated with at least one of the assigned globally unique IDs to a second management domain, wherein the migrating further comprises: receiving a target domain to which to relocate the at least one virtual machine corresponding to the globally unique ID; obtaining a unique management ID in the target domain, wherein the obtained unique management ID is a domain-specific VM ID; obtaining a first management domain and a first domain ID from the at least one database; issuing a relocation command specifying a from-domain and a to-domain, and a VM ID in the from-domain and a VM ID in the to-domain; and updating the at least one database to associate the assigned globally unique ID corresponding to the at least one migrated virtual machine with the second management domain and the domain-specific VM ID. 6. The method of claim 1, further comprising:
hibernating a uniquely identified virtual machine; determining a domain associated with the hibernated uniquely identified virtual machine and a domain specific virtual machine ID associated with the hibernated uniquely identified virtual machine; issuing a plurality of commands to stop at least one virtual machine and store an image associated with the at least one stopped virtual machine to an image file location; and storing a hibernation indication and the image file location in at least one database. 7. The method of claim 6, wherein the hibernation is indicated using a domain reflective of hibernation and a hibernation-domain ID corresponding to the image file location and wherein the hibernation further comprises:
including an optional indication that the hibernated partition as a partition has moved to the hibernation domain. 8. The method of claim 1, further comprising:
performing a domain load balancing for a plurality of domains; identifying an aggregate load level for at least one domain within the plurality of domains; determining a target load level for each domain within the plurality of domains; determining a contribution factor for each partition within a plurality of partitions associated with the at least one database based on a domain utilization; determining to move at least one virtual machine between at least two domains within the plurality of domains to reach a target load level, wherein the determination comprises optionally selecting service level agreements (SLAs) to determine the at least one virtual machine to be moved; migrating the plurality of virtual machines from a first current domain to a second domain; and updating the at least one database with the unique ID corresponding to each of the migrated virtual machines within the at least one moved virtual machines, a name associated with the second domain, and the domain ID corresponding to the determined second domain. 9. The method of claim 1 further comprising:
maintaining at least one second database within a plurality of second databases, wherein the second database maps at least one domain ID to at least one physical server within a plurality of servers;
responsive to obtaining a domain ID from a global ID to domain ID database, performing a lookup of the obtained domain ID in the maintained at least one second database, wherein the lookup is performed optionally after the obtained domain id has been sent to at least one second server within the plurality of servers; and
performing a further lookup of the obtained domain id in the at least one maintained second database within the plurality of maintained second databases, wherein the further look up is performed optionally after the obtained domain ID has been sent to at least one second server within the plurality of servers. 10. The method of claim 9, further comprising:
performing at least one action on the at least one maintained physical server within the plurality of servers after the performed action has been issued to a globally unique ID, wherein the globally unique ID has been mapped to the at least one domain ID, wherein the domain ID has been mapped to the at least one physical server within the plurality of servers. 11. A computer system for identifying and managing a plurality of virtual machines, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, wherein the computer system is capable of performing a method comprising: creating a virtual machine within the plurality of virtual machines; creating a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; assigning each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; recording each globally unique ID into at least one database; and associating the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 12. The computer system of claim 11, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, wherein the existing resource is an unused fibre channel port and the unused resource is not reflective of the globally unique ID, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. 13. The computer system of claim 12, wherein the globally unique ID can be assigned and queried in a legacy virtual machine environment not designed to support the assigning of the globally unique ID. 14. The computer system of claim 11, further comprising:
managing each of the virtual machines assigned each of the globally unique IDs, wherein the managing of the virtual machines further comprises: specifying a management command and the assigned globally unique ID; obtaining a management domain and a domain ID from the at least one database; and issuing a command to a control node for a returned domain, wherein the command comprises receiving a domain ID uniquely identifying at least one managed virtual machine within the obtained management domain. 15. The computer system of claim 11, further comprising:
migrating at least one virtual machine associated with at least one of the assigned globally unique IDs to a second management domain, wherein the migrating further comprises: receiving a target domain to which to relocate the at least one virtual machine corresponding to the globally unique ID; obtaining a unique management ID in the target domain, wherein the obtained unique management ID is a domain-specific VM ID; obtaining a first management domain and a first domain ID from the at least one database; issuing a relocation command specifying a from-domain and a to-domain, and a VM ID in the from-domain and a VM ID in the to-domain; and updating the at least one database to associate the assigned globally unique ID corresponding to the at least one migrated virtual machine with the second management domain and the domain-specific VM ID. 16. The computer system of claim 11, further comprising:
hibernating a uniquely identified virtual machine; determining a domain associated with the hibernated uniquely identified virtual machine and a domain specific virtual machine ID associated with the hibernated uniquely identified virtual machine; issuing a plurality of commands to stop at least one virtual machine and store an image associated with the at least one stopped virtual machine to an image file location; and storing a hibernation indication and the image file location in at least one database. 17. The computer system of claim 16, wherein the hibernation is indicated using a domain reflective of hibernation and a hibernation-domain ID corresponding to the image file location and wherein the hibernation further comprises:
including an optional indication that the hibernation as a partition has moved to the hibernation domain. 18. The computer system of claim 11, further comprising:
performing a domain load balancing for a plurality of domains; identifying an aggregate load level for at least one domain within the plurality of domains; determining a target load level for each domain within the plurality of domains; determining a contribution factor for each partition within a plurality of partitions associated with the at least one database based on a domain utilization; determining to move at least one virtual machine between at least two domains within the plurality of domains to reach a target load level, wherein the determination comprises optionally selecting service level agreements (SLAs) to determine the at least one virtual machine to be moved; migrating the plurality of virtual machines from a first current domain to a second domain; and updating the at least one database with the unique ID corresponding to each of the migrated virtual machines within the at least one moved virtual machines, a name associated with the second domain, and the domain ID corresponding to the determined second domain. 19. A computer program product for identifying and managing a plurality of virtual machines, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more tangible storage devices, the program instructions executable by a processor, the program instructions comprising: program instructions to create a virtual machine within the plurality of virtual machines; program instructions to create a plurality of globally unique IDs for each virtual machine within the plurality of virtual machines, wherein the plurality of globally unique IDs is created by being randomly generated, by combining a plurality of server IDs, or by using a hostname, and wherein the plurality of globally unique IDs is independent of a data center, a cluster, and a server; program instructions to assign each of the globally unique IDs within the plurality of globally unique IDs to each of the virtual machines within the plurality of virtual machines, wherein the assigned globally unique ID is assigned to only one virtual machine; program instructions to record each globally unique ID into at least one database; and program instructions to associate the recorded globally unique ID with a management domain corresponding to the virtual machine assigned the globally unique ID, and a domain ID corresponding to the virtual machine. 20. The computer program product of claim 19, further comprising:
binding the globally unique ID to an existing resource associated with the virtual machine assigned the globally unique ID, wherein the existing resource is an unused fibre channel port and the unused resource is not reflective of the globally unique ID, and optionally further comprising providing a means to determine a globally unique ID of a virtual machine by querying a resource associated with the virtual machine assigned the globally unique ID. | 2,100 |
5,219 | 13,620,779 | 2,196 | A Virtual Machine (VM) is created utilizing a virtual Operating System (OS) disk and virtual application disks, each of which may be from disparate third party suppliers. One or more files in the virtual application disk are then linked to a specific file system location (node) in the virtual OS disk. | 1-20. (canceled) 21. A method of creating a virtual machine (VM), comprising:
receiving an application logical disk; receiving an operating system (O/S) logical disk; and generating a VM profile using the application logical disk and the O/S logical disk, wherein the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 22. The method of claim 21, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 23. The method of claim 21, further comprising
assembling the virtual machine using the O/S logical disk and the application logical disk. 24. The method of claim 21, wherein
the application logical disk is separately maintainable. 25. The method of claim 21, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 26. The method of claim 25, wherein
the another logical disk includes a second application logical disk. 27. A computer hardware system configured to create a virtual machine (VM), comprising:
at least one processor, wherein the at least one processor is configured to initiate and/or perform:
receiving an application logical disk;
receiving an operating system (O/S) logical disk; and
generating a VM profile using the application logical disk and the O/S logical disk, wherein
the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 28. The computer hardware system of claim 27, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 29. The computer hardware system of claim 27, wherein the at least one processor is further configured to initiate and/or perform
assembling the virtual machine using the O/S logical disk and the application logical disk. 30. The computer hardware system of claim 27, wherein
the application logical disk is separately maintainable. 31. The computer hardware system of claim 27, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 32. The computer hardware system of claim 31, wherein
the another logical disk includes a second application logical disk. 33. A computer program product, comprising:
a computer usable storage medium having stored therein computer usable program code for creating a virtual machine (VM), the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
receiving an application logical disk;
receiving an operating system (O/S) logical disk; and
generating a VM profile using the application logical disk and the O/S logical disk, wherein
the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 34. The computer program product of claim 33, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 35. The computer program product of claim 33, wherein the computer usable product code further causes the computer hardware system to perform
assembling the virtual machine using the O/S logical disk and the application logical disk. 36. The computer program product of claim 33, wherein
the application logical disk is separately maintainable. 37. The computer program product of claim 33, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 38. The computer program product of claim 37, wherein
the another logical disk includes a second application logical disk. | A Virtual Machine (VM) is created utilizing a virtual Operating System (OS) disk and virtual application disks, each of which may be from disparate third party suppliers. One or more files in the virtual application disk are then linked to a specific file system location (node) in the virtual OS disk.1-20. (canceled) 21. A method of creating a virtual machine (VM), comprising:
receiving an application logical disk; receiving an operating system (O/S) logical disk; and generating a VM profile using the application logical disk and the O/S logical disk, wherein the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 22. The method of claim 21, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 23. The method of claim 21, further comprising
assembling the virtual machine using the O/S logical disk and the application logical disk. 24. The method of claim 21, wherein
the application logical disk is separately maintainable. 25. The method of claim 21, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 26. The method of claim 25, wherein
the another logical disk includes a second application logical disk. 27. A computer hardware system configured to create a virtual machine (VM), comprising:
at least one processor, wherein the at least one processor is configured to initiate and/or perform:
receiving an application logical disk;
receiving an operating system (O/S) logical disk; and
generating a VM profile using the application logical disk and the O/S logical disk, wherein
the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 28. The computer hardware system of claim 27, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 29. The computer hardware system of claim 27, wherein the at least one processor is further configured to initiate and/or perform
assembling the virtual machine using the O/S logical disk and the application logical disk. 30. The computer hardware system of claim 27, wherein
the application logical disk is separately maintainable. 31. The computer hardware system of claim 27, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 32. The computer hardware system of claim 31, wherein
the another logical disk includes a second application logical disk. 33. A computer program product, comprising:
a computer usable storage medium having stored therein computer usable program code for creating a virtual machine (VM), the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
receiving an application logical disk;
receiving an operating system (O/S) logical disk; and
generating a VM profile using the application logical disk and the O/S logical disk, wherein
the application logical disk is separate from the O/S logical disk, and the VM profile includes a mapping of nodes within the application logical disk to nodes within the O/S logical disk. 34. The computer program product of claim 33, wherein
the O/S logical disk is received from a first supplier; and the application logical disk is received from a second supplier different than the first supplier. 35. The computer program product of claim 33, wherein the computer usable product code further causes the computer hardware system to perform
assembling the virtual machine using the O/S logical disk and the application logical disk. 36. The computer program product of claim 33, wherein
the application logical disk is separately maintainable. 37. The computer program product of claim 33, wherein
the application logical disk includes an agent, and the agent is configured to create links between the application logical disk and another logical disk. 38. The computer program product of claim 37, wherein
the another logical disk includes a second application logical disk. | 2,100 |
5,220 | 15,098,910 | 2,132 | Mechanisms for reducing memory inconsistencies between two synchronized computing devices are provided. A first hypervisor module of a first computing device iteratively determines that content of a memory page of a plurality of memory pages has been modified. The content of the memory page is sent to a second hypervisor module on a second computing device. At least one other memory page of the plurality of memory pages is identified, and a verification value based on the content of the at least one other memory page is generated. The verification value and a memory page identifier that identifies the at least one other memory page is sent to the second hypervisor module on the second computing device. | 1. A first computing device comprising:
a memory comprising a plurality of memory pages; a processor device coupled to the memory; and a first hypervisor module that interfaces with the processor device and is to iteratively:
determine that content of a memory page of the plurality of memory pages has been modified;
send the content of the memory page to a second hypervisor module on a second computing device;
identify at least one other memory page of the plurality of memory pages;
generate a verification value based on content of the at least one other memory page; and
send the verification value and a memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device. 2. The first computing device of claim 1, wherein to identify the at least one other memory page, the first hypervisor module is further to randomly identify the at least one other memory page from the plurality of memory pages. 3. The first computing device of claim 2, wherein to identify the at least one other memory page, the first hypervisor module is further to determine that the content of the at least one other memory page is unmodified. 4. The first computing device of claim 3, wherein to determine that the content of the at least one other memory page is unmodified, the first hypervisor module is further to determine that a modified memory page bit associated with the at least one other memory page indicates that the content of the at least one other memory page is unmodified. 5. The first computing device of claim 1, wherein the at least one other memory page comprises a group of memory pages, and the first hypervisor module is further to:
generate a plurality of verification values, each verification value associated with a respective different memory page in the group of memory pages and generated based on content contained in the respective different memory page in the group of memory pages; and send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the plurality of verification values to the second hypervisor module. 6. The first computing device of claim 1, wherein:
the at least one other memory page comprises a group of memory pages; to generate the verification value based on the content of the at least one other memory page, the first hypervisor module is further to generate the verification value based on the content of each memory page in the group of memory pages; and to send the verification value and the memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device, the first hypervisor module is further to send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the verification value to the second hypervisor module. 7. The first computing device of claim 1, wherein the first hypervisor module is further to mark the content of the memory page as being unmodified. 8. The first computing device of claim 1, wherein the verification value is a MD5 hash value. 9. The first computing device of claim 1, wherein to identify the at least one other memory page, the first hypervisor module is to further:
identify the memory page from a set of memory pages identified on a page list of memory pages; and remove the memory page from the page list. 10. The first computing device of claim 1, wherein the memory page identifier is a memory page address. 11. The first computing device of claim 1, wherein the first hypervisor module is to further:
receive a request from the second computing device for the content of the at least one other memory page; and send the content of at least one other memory page to the second computing device in response to the request. 12. A method comprising:
iteratively, by a first hypervisor module executing on a first computing device comprising a processor device:
determining that content of a memory page of a plurality of memory pages has been modified;
sending the content of the memory page to a second hypervisor module on a second computing device;
identifying at least one other memory page of the plurality of memory pages;
generating a first verification value based on content of the at least one other memory page; and
sending the first verification value and a memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device. 13. The method of claim 12 wherein identifying the at least one other memory page further comprises randomly identifying the at least one other memory page from the plurality of memory pages. 14. The method of claim 12 wherein the at least one other memory page comprises a group of memory pages, and further comprising:
generating a plurality of first verification values, each first verification value associated with a respective different memory page in the group of memory pages and generated based on content contained in the respective different memory page in the group of memory pages; and
sending a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the plurality of first verification values to the second hypervisor module. 15. The method of claim 12, wherein the at least one other memory page comprises a group of memory pages and wherein:
generating the first verification value based on the content of the at least one other memory page comprises generating the first verification value based on the content of each memory page in the group of memory pages; and sending the first verification value and the memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device comprises sending a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the first verification value to the second hypervisor module. 16. The method of claim 12 further comprising:
receiving a request from the second computing device for the content of the at least one other memory page; and
sending the content of the at least one other memory page to the second computing device in response to the request. 17. The method of claim 12 further comprising:
receiving, by the second hypervisor module, the memory page identifier and the first verification value;
accessing the at least one other memory page identified by the memory page identifier on the second computing device;
generating a second verification value based on content of the at least one other memory page on the second computing device; and
determining that the first verification value matches the second verification value. 18. A first computing device comprising:
a memory comprising a plurality of memory pages; a processor device coupled to the memory; and a first hypervisor module that interfaces with the processor device and is to iteratively:
determine that content of each memory page of a first set of memory pages of the plurality of memory pages has been modified;
send the content of each memory page in the first set of memory pages to a second hypervisor module on a second computing device;
randomly identify a second set of memory pages from the plurality of memory pages;
generate a verification value based on the content of each memory page in the second set of memory pages; and
send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the second set of memory pages, and the verification value to the second hypervisor module. 19. The first computing device of claim 18, wherein to identify the second set of memory pages the first hypervisor module is further to determine that the content of each page of the second set of memory pages is unmodified. 20. The first computing device of claim 18, wherein the verification value is a MD5 hash value. 21. The first computing device of claim 18, wherein the first hypervisor module is to further:
receive a request from the second computing device for the content of each page in the second set of memory pages; and send the content of each page in second set of memory pages to the second computing device in response to the request. | Mechanisms for reducing memory inconsistencies between two synchronized computing devices are provided. A first hypervisor module of a first computing device iteratively determines that content of a memory page of a plurality of memory pages has been modified. The content of the memory page is sent to a second hypervisor module on a second computing device. At least one other memory page of the plurality of memory pages is identified, and a verification value based on the content of the at least one other memory page is generated. The verification value and a memory page identifier that identifies the at least one other memory page is sent to the second hypervisor module on the second computing device.1. A first computing device comprising:
a memory comprising a plurality of memory pages; a processor device coupled to the memory; and a first hypervisor module that interfaces with the processor device and is to iteratively:
determine that content of a memory page of the plurality of memory pages has been modified;
send the content of the memory page to a second hypervisor module on a second computing device;
identify at least one other memory page of the plurality of memory pages;
generate a verification value based on content of the at least one other memory page; and
send the verification value and a memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device. 2. The first computing device of claim 1, wherein to identify the at least one other memory page, the first hypervisor module is further to randomly identify the at least one other memory page from the plurality of memory pages. 3. The first computing device of claim 2, wherein to identify the at least one other memory page, the first hypervisor module is further to determine that the content of the at least one other memory page is unmodified. 4. The first computing device of claim 3, wherein to determine that the content of the at least one other memory page is unmodified, the first hypervisor module is further to determine that a modified memory page bit associated with the at least one other memory page indicates that the content of the at least one other memory page is unmodified. 5. The first computing device of claim 1, wherein the at least one other memory page comprises a group of memory pages, and the first hypervisor module is further to:
generate a plurality of verification values, each verification value associated with a respective different memory page in the group of memory pages and generated based on content contained in the respective different memory page in the group of memory pages; and send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the plurality of verification values to the second hypervisor module. 6. The first computing device of claim 1, wherein:
the at least one other memory page comprises a group of memory pages; to generate the verification value based on the content of the at least one other memory page, the first hypervisor module is further to generate the verification value based on the content of each memory page in the group of memory pages; and to send the verification value and the memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device, the first hypervisor module is further to send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the verification value to the second hypervisor module. 7. The first computing device of claim 1, wherein the first hypervisor module is further to mark the content of the memory page as being unmodified. 8. The first computing device of claim 1, wherein the verification value is a MD5 hash value. 9. The first computing device of claim 1, wherein to identify the at least one other memory page, the first hypervisor module is to further:
identify the memory page from a set of memory pages identified on a page list of memory pages; and remove the memory page from the page list. 10. The first computing device of claim 1, wherein the memory page identifier is a memory page address. 11. The first computing device of claim 1, wherein the first hypervisor module is to further:
receive a request from the second computing device for the content of the at least one other memory page; and send the content of at least one other memory page to the second computing device in response to the request. 12. A method comprising:
iteratively, by a first hypervisor module executing on a first computing device comprising a processor device:
determining that content of a memory page of a plurality of memory pages has been modified;
sending the content of the memory page to a second hypervisor module on a second computing device;
identifying at least one other memory page of the plurality of memory pages;
generating a first verification value based on content of the at least one other memory page; and
sending the first verification value and a memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device. 13. The method of claim 12 wherein identifying the at least one other memory page further comprises randomly identifying the at least one other memory page from the plurality of memory pages. 14. The method of claim 12 wherein the at least one other memory page comprises a group of memory pages, and further comprising:
generating a plurality of first verification values, each first verification value associated with a respective different memory page in the group of memory pages and generated based on content contained in the respective different memory page in the group of memory pages; and
sending a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the plurality of first verification values to the second hypervisor module. 15. The method of claim 12, wherein the at least one other memory page comprises a group of memory pages and wherein:
generating the first verification value based on the content of the at least one other memory page comprises generating the first verification value based on the content of each memory page in the group of memory pages; and sending the first verification value and the memory page identifier that identifies the at least one other memory page to the second hypervisor module on the second computing device comprises sending a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the group of memory pages, and the first verification value to the second hypervisor module. 16. The method of claim 12 further comprising:
receiving a request from the second computing device for the content of the at least one other memory page; and
sending the content of the at least one other memory page to the second computing device in response to the request. 17. The method of claim 12 further comprising:
receiving, by the second hypervisor module, the memory page identifier and the first verification value;
accessing the at least one other memory page identified by the memory page identifier on the second computing device;
generating a second verification value based on content of the at least one other memory page on the second computing device; and
determining that the first verification value matches the second verification value. 18. A first computing device comprising:
a memory comprising a plurality of memory pages; a processor device coupled to the memory; and a first hypervisor module that interfaces with the processor device and is to iteratively:
determine that content of each memory page of a first set of memory pages of the plurality of memory pages has been modified;
send the content of each memory page in the first set of memory pages to a second hypervisor module on a second computing device;
randomly identify a second set of memory pages from the plurality of memory pages;
generate a verification value based on the content of each memory page in the second set of memory pages; and
send a group of memory page identifiers, each memory page identifier identifying a corresponding one of the memory pages in the second set of memory pages, and the verification value to the second hypervisor module. 19. The first computing device of claim 18, wherein to identify the second set of memory pages the first hypervisor module is further to determine that the content of each page of the second set of memory pages is unmodified. 20. The first computing device of claim 18, wherein the verification value is a MD5 hash value. 21. The first computing device of claim 18, wherein the first hypervisor module is to further:
receive a request from the second computing device for the content of each page in the second set of memory pages; and send the content of each page in second set of memory pages to the second computing device in response to the request. | 2,100 |
5,221 | 13,802,483 | 2,141 | Within a network system, a wireless device sends a message to a network element over a first wireless access network, the message including a first device credential and being configured to obtain information to assist in presenting an on-device user service plan selection choice through a user interface of the wireless device. After sending the message, the wireless device determines that it lacks authorization to connect to the network element over the first wireless network and, in response, attempts to connect to the network element over a second data access network. | 1. A method performed by a wireless device, the method comprising:
sending a message to a network element over a first wireless access network, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice through a user interface of the wireless device; determining that the wireless device is not authorized to connect to the network element over the first wireless network; and in response to determining that the wireless device is not authorized to connect to the network element over the first wireless access network, attempting to connect to the network element over a second data access network. 2. The method recited in claim 1, further comprising:
connecting to the network element over the second data access network; receiving a second device credential from the network element; obtaining the on-device user service plan selection choice; and presenting the on-device user service plan selection choice through the user interface. 3. The method recited in claim 1, further comprising determining that attempting to connect to the network element over the second wireless access network has failed and, in response, prompting a user to obtain a valid device credential through another process. 4. The method recited in claim 3, wherein prompting the user comprises presenting a notification through the user interface instructing a user of the wireless device to contact customer care. 5. The method recited in claim 3, wherein prompting the user comprises presenting a notification through the user interface directing a user of the wireless device to a web site. 6. The method recited in claim 1, further comprising:
presenting a notification through the user interface, and configuring a setting to enable said attempting to connect to the network element over the second data access network. 7. The method recited in claim 1, wherein the first device credential is provisioned on the network element. 8. The method recited in claim 1, further comprising obtaining a second device credential to assist the wireless device in connecting to the first wireless access network. 9. The method recited in claim 8, wherein obtaining the second device credential comprises receiving the second device credential over the air. 10. The method recited in claim 9, wherein obtaining the second device credential comprises obtaining the second device credential through the user interface. 11. The method recited in claim 8, wherein the second device credential is provisioned on the network element. 12. The method recited in claim 1, wherein the first wireless access network is a cellular network and the second data access network is a WiFi network. 13. The method recited in claim 1, wherein the first wireless access network is a cellular network and the second data access network is a local area network (LAN). 14. The method recited in claim 1, further comprising assisting in authenticating the wireless device. 15. The method recited in claim 1, wherein the network element comprises one or more of a home location register (HLR), a home subscriber server (HSS), a serving GPRS support node (SGSN), a gateway GPRS support node (GGSN), a packet data serving node (PDSN), a home agent, a foreign agent, or an authentication, authorization, and accounting (AAA) server. 16. The method recited in claim 1, wherein the first device credential comprises one or more of an international mobile subscriber identity (IMSI), a mobile station international subscriber directory number (MSISDN), a mobile directory number (MDN), a mobile identification number (MIN), an electronic serial number (ESN), a mobile equipment identifier (MEID), an international mobile equipment identity (IMEI), a media access control (MAC) address, an IP address, a shared secret, a username, a password, or a network access identifier (NAI). 17. The method recited in claim 1, further comprising presenting the on-device user service plan selection choice through the user interface. 18. The method recited in claim 17, wherein a least a portion of the on-device user service plan selection choice is stored on the wireless device. 19. The method recited in claim 17, wherein a least a portion of the on-device user service plan selection choice is stored on the network element. 20. The method recited in claim 17, further comprising:
obtaining, through the user interface, a user selection in response to the on-device user service plan selection choice; and sending the user selection to the network element. 21. The method recited in claim 17, further comprising:
obtaining, through the user interface, user payment information in response to the on-device user service plan selection choice; and sending the user payment information to the network element. 22. A method performed by a network system, the method comprising:
receiving, over a wireless access network, an authorization request from a wireless device, the authorization request comprising a first device credential associated with the wireless device; obtaining a second device credential from a database, the second device credential associated with the wireless device; determining, based on the first device credential and the second device credential, whether to authorize the wireless device; and sending a message to the wireless device, the message indicating whether the wireless device is authorized to communicate over the wireless access network. 23. The method of claim 22, wherein the message indicates that the wireless device is authorized to communicate over the wireless access network, the method further comprising:
receiving, from the wireless device, a user selection indicating a user service plan selection choice; and provisioning one or more network elements in accordance with the user service plan selection choice. 24. The method of claim 22, wherein receiving, over a wireless access network, the authorization request from the wireless device comprises receiving the authorization request over a secure link, the secure link secured by an encryption protocol and configured to support control-plane communications between the network system and the wireless device. 25. The method of claim 22, further comprising sending one or more user service plan selection options to the wireless device, and wherein the user selection corresponds to one of the one or more user service plan selection options. 26. A wireless device comprising:
one or more modems enabling the wireless device to connect to at least a first wireless access network and a second data access network; a user interface; and computing circuitry, including one or more processors and memory to store program code which, when executed by the one or more processors, causes the one or more processors to:
send a message to a network element over the first wireless access network using the first modem, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice via the user interface;
determine that the wireless device is not authorized to communicate with the network element over the first wireless network; and
in response to determining that the wireless device is not authorized to communicate with the network element over the first wireless access network, attempt to connect to the network element over the second data access network. 27. A non-transitory computer-readable storage medium to store program code that, when executed by one or more processors, causes the one or more processors to:
send a message to a network element over a first wireless access network, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice via the user interface; determine that the wireless device is not authorized to connect to the network element over the first wireless network; and in response to determining that the wireless device is not authorized to connect to the network element over the first wireless access network, attempt to connect to the network element over a second data access network. | Within a network system, a wireless device sends a message to a network element over a first wireless access network, the message including a first device credential and being configured to obtain information to assist in presenting an on-device user service plan selection choice through a user interface of the wireless device. After sending the message, the wireless device determines that it lacks authorization to connect to the network element over the first wireless network and, in response, attempts to connect to the network element over a second data access network.1. A method performed by a wireless device, the method comprising:
sending a message to a network element over a first wireless access network, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice through a user interface of the wireless device; determining that the wireless device is not authorized to connect to the network element over the first wireless network; and in response to determining that the wireless device is not authorized to connect to the network element over the first wireless access network, attempting to connect to the network element over a second data access network. 2. The method recited in claim 1, further comprising:
connecting to the network element over the second data access network; receiving a second device credential from the network element; obtaining the on-device user service plan selection choice; and presenting the on-device user service plan selection choice through the user interface. 3. The method recited in claim 1, further comprising determining that attempting to connect to the network element over the second wireless access network has failed and, in response, prompting a user to obtain a valid device credential through another process. 4. The method recited in claim 3, wherein prompting the user comprises presenting a notification through the user interface instructing a user of the wireless device to contact customer care. 5. The method recited in claim 3, wherein prompting the user comprises presenting a notification through the user interface directing a user of the wireless device to a web site. 6. The method recited in claim 1, further comprising:
presenting a notification through the user interface, and configuring a setting to enable said attempting to connect to the network element over the second data access network. 7. The method recited in claim 1, wherein the first device credential is provisioned on the network element. 8. The method recited in claim 1, further comprising obtaining a second device credential to assist the wireless device in connecting to the first wireless access network. 9. The method recited in claim 8, wherein obtaining the second device credential comprises receiving the second device credential over the air. 10. The method recited in claim 9, wherein obtaining the second device credential comprises obtaining the second device credential through the user interface. 11. The method recited in claim 8, wherein the second device credential is provisioned on the network element. 12. The method recited in claim 1, wherein the first wireless access network is a cellular network and the second data access network is a WiFi network. 13. The method recited in claim 1, wherein the first wireless access network is a cellular network and the second data access network is a local area network (LAN). 14. The method recited in claim 1, further comprising assisting in authenticating the wireless device. 15. The method recited in claim 1, wherein the network element comprises one or more of a home location register (HLR), a home subscriber server (HSS), a serving GPRS support node (SGSN), a gateway GPRS support node (GGSN), a packet data serving node (PDSN), a home agent, a foreign agent, or an authentication, authorization, and accounting (AAA) server. 16. The method recited in claim 1, wherein the first device credential comprises one or more of an international mobile subscriber identity (IMSI), a mobile station international subscriber directory number (MSISDN), a mobile directory number (MDN), a mobile identification number (MIN), an electronic serial number (ESN), a mobile equipment identifier (MEID), an international mobile equipment identity (IMEI), a media access control (MAC) address, an IP address, a shared secret, a username, a password, or a network access identifier (NAI). 17. The method recited in claim 1, further comprising presenting the on-device user service plan selection choice through the user interface. 18. The method recited in claim 17, wherein a least a portion of the on-device user service plan selection choice is stored on the wireless device. 19. The method recited in claim 17, wherein a least a portion of the on-device user service plan selection choice is stored on the network element. 20. The method recited in claim 17, further comprising:
obtaining, through the user interface, a user selection in response to the on-device user service plan selection choice; and sending the user selection to the network element. 21. The method recited in claim 17, further comprising:
obtaining, through the user interface, user payment information in response to the on-device user service plan selection choice; and sending the user payment information to the network element. 22. A method performed by a network system, the method comprising:
receiving, over a wireless access network, an authorization request from a wireless device, the authorization request comprising a first device credential associated with the wireless device; obtaining a second device credential from a database, the second device credential associated with the wireless device; determining, based on the first device credential and the second device credential, whether to authorize the wireless device; and sending a message to the wireless device, the message indicating whether the wireless device is authorized to communicate over the wireless access network. 23. The method of claim 22, wherein the message indicates that the wireless device is authorized to communicate over the wireless access network, the method further comprising:
receiving, from the wireless device, a user selection indicating a user service plan selection choice; and provisioning one or more network elements in accordance with the user service plan selection choice. 24. The method of claim 22, wherein receiving, over a wireless access network, the authorization request from the wireless device comprises receiving the authorization request over a secure link, the secure link secured by an encryption protocol and configured to support control-plane communications between the network system and the wireless device. 25. The method of claim 22, further comprising sending one or more user service plan selection options to the wireless device, and wherein the user selection corresponds to one of the one or more user service plan selection options. 26. A wireless device comprising:
one or more modems enabling the wireless device to connect to at least a first wireless access network and a second data access network; a user interface; and computing circuitry, including one or more processors and memory to store program code which, when executed by the one or more processors, causes the one or more processors to:
send a message to a network element over the first wireless access network using the first modem, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice via the user interface;
determine that the wireless device is not authorized to communicate with the network element over the first wireless network; and
in response to determining that the wireless device is not authorized to communicate with the network element over the first wireless access network, attempt to connect to the network element over the second data access network. 27. A non-transitory computer-readable storage medium to store program code that, when executed by one or more processors, causes the one or more processors to:
send a message to a network element over a first wireless access network, the message including a first device credential, the message configured to obtain information to assist in presenting an on-device user service plan selection choice via the user interface; determine that the wireless device is not authorized to connect to the network element over the first wireless network; and in response to determining that the wireless device is not authorized to connect to the network element over the first wireless access network, attempt to connect to the network element over a second data access network. | 2,100 |
5,222 | 14,756,054 | 2,181 | Apparatus, methods and system relating to a vehicular telemetry environment for an intelligent Bluetooth beacon I/O expansion of the vehicular telemetry hardware system. The intelligent Bluetooth beacon I/O expansion provides a capability to receive beacon data, log beacon data, communicate beacon data and operate on beacon data to determine and further communicate a range of operational conditions, such as damage, hazardous and missing objects in the form of text messages, audio messages or compliance and management reports. | 1. A telemetry wireless beacon apparatus comprising:
a wireless beacon communication device, and a vehicle device, said vehicle device further comprising a processor, firmware, communications processor, telematic sensors and an interface to communicate with a vehicle network communications bus, wherein said processor and firmware capable to monitor and receive data in real time from said interface, said telematics sensors and said wireless beacon communication device thereby capable to log said data for subsequent communication to a remote device. 2. A telemetry wireless beacon apparatus as in claim 1 wherein said telematics sensors include at least one of an accelerometer device or GPS device. 3. A telemetry wireless beacon apparatus as in claim 1 wherein said wireless beacon communication device is a Bluetooth wireless beacon communication device capable of communicating with a beacon device. 4. A telemetry wireless beacon apparatus as in claim 1 further comprising an I/O expander. 5. A telemetry wireless beacon apparatus as in claim 1 wherein said wireless beacon communication device is integral with said vehicle device. 6. A telemetry wireless beacon apparatus as in claim 4 wherein said wireless beacon communication device is integral with said I/O expander. 7. A telemetry wireless beacon apparatus as in claim 4 wherein said wireless beacon communication device is a device connectable to said I/O expander. 8. A telemetry wireless beacon apparatus as in claim 1 further comprising at least one beacon device disposed with at least one object. 9. A telemetry wireless beacon apparatus as in claim 8 wherein said at least one object is selected from the group of package, equipment, vehicle or people. 10. A telemetry wireless beacon apparatus as in claim 1 wherein said data is selected from the group of GPS data, engine data, vehicle data, speed data, position data, direction data or vehicle acceleration data. 11. A telemetry wireless beacon apparatus as in claim 10 wherein said data is further selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 12. A telemetry wireless beacon apparatus as in claim 1 wherein said data is selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 13. A telemetry wireless beacon apparatus as in claim 8 wherein said at least one beacon device further comprises a beacon processor beacon firmware, beacon radio module and at least one of a beacon accelerometer and beacon sensors. 14. A telemetry wireless beacon apparatus as in claim 13 wherein said beacon sensors are selected from the group of a temperature sensor, an illumination sensor, a pressure sensor, a battery sensor or a user defined sensor. 15. A telemetry wireless beacon apparatus as in claim 14 wherein said data is selected from the group of a beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, bacon battery data or user defined data. 16. A telemetry wireless beacon data monitoring and logging method comprising:
monitoring and receiving data from at least one of an interface to vehicle engine data or telematics sensors, receiving beacon data provided by a wireless beacon communication device, and logging data and beacon data as telemetry data for subsequent communication to a remote device. 17. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said telematics sensors includes an accelerometer and said data includes accelerometer data. 18. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said telematics sensors includes a GPS device and said data includes location data. 19. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said data includes engine data and vehicle speed data. 20. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device includes beacon data from a beacon device. 21. A telemetry wireless beacon data monitoring and logging method as in claim 20 wherein said beacon data includes unique identifier data for each beacon device. 22. A telemetry wireless beacon data monitoring and logging method as in claim 21 wherein said beacon data further includes data selected from the group of beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 23. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device is received directly by a telemetry wireless beacon apparatus. 24. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device is received indirectly through and I/O expander. 25. A telemetry wireless beacon data preprocessing method comprising:
accessing a log of telemetry data, said telemetry data including data and beacon data, translating said data into at least one of engine codes, G forces, map locations, for each unique identifier in said beacon data, translating said beacon data into at least one of a beacon temperature, beacon pressure, beacon light, beacon acceleration, beacon battery level or beacon user defined sensor reading, and storing a preprocessing telemetry log of said telemetry data for further fleet management condition processing. 26. A telemetry wireless beacon data preprocessing method as in claim 25 further including preprocessing said data into at least one of a minimum value, maximum value or range of values. 27. A telemetry wireless beacon data preprocessing method as in claim 25 further including preprocessing each of said beacon data associated with a unique identifier into at least one of a minimum value, maximum value or range of values. 28. A telemetry wireless beacon data preprocessing method as in claim 25 further comprising associating at least one of engine codes, G forces, vehicle speed and map location with each unique identifier and at least one of a beacon temperature, beacon pressure, beacon light, beacon acceleration, beacon battery level or beacon user defined sensor reading. 29. A telemetry wireless beacon system comprising:
a wireless beacon communication device, at least one beacon device, at least one remote device, and at least one vehicle device, said at least one vehicle device further comprising a processor, firmware, communications processor, telematics sensors and an interface to communicate with a vehicle network communications bus, said at least one beacon device capable to communicate beacon data with said wireless beacon communication device, said at least one vehicle device capable to communicate with said at least one remote device, wherein said processor and firmware capable to monitor and receive data from said interface, said telematics sensors and said wireless beacon communication device thereby capable to log said data for subsequent communication to said at least one remote device. 30. A telemetry wireless beacon system as in claim 29 wherein said telematics sensors include at least one of an accelerometer or GPS device. 31. A telemetry wireless beacon system as in claim 29 wherein said wireless beacon communication device is a Bluetooth wireless beacon communication device. 32. A telemetry wireless beacon system as in claim 29 further comprising an I/O expander. 33. A telemetry wireless beacon system as in claim 29 wherein said wireless beacon communication device is integral with said vehicle device. 34. A telemetry wireless beacon system as in claim 32 wherein said wireless beacon communication device is integral with said I/O expander. 35. A telemetry wireless beacon system as in claim 32 wherein said wireless beacon communication device is a device connectable to said I/O expander. 36. A telemetry wireless beacon system as in claim 29 wherein said at least one beacon device is disposed with at least one object. 37. A telemetry wireless beacon system as in claim 36 wherein said at least one object is selected from the group of package, equipment, vehicle or people. 38. A telemetry wireless beacon system as in claim 29 wherein said data is selected from the group of GPS data, engine data, vehicle data, vehicle speed data, position data, direction data or vehicle acceleration data. 39. A telemetry wireless beacon system as in claim 38 wherein said data is further selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 40. A telemetry wireless beacon system as in claim 29 wherein said at least one beacon device further comprises a beacon processor, beacon firmware, beacon radio module and at least one of a beacon accelerometer or beacon sensors. 41. A telemetry wireless beacon system as in claim 40 wherein said beacon sensors are selected from the group of a temperature sensor, an illumination sensor, a pressure sensor, an acceleration sensor, a battery sensor or a user defined sensor. 42. A telemetry wireless beacon system as in claim 41 wherein said data is selected from the group of a beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 43. A telemetry wireless beacon data fleet management condition determination method comprising:
providing at least access to first data that identifies and associates beacon unique identifiers with objects, providing at least access to second data of threshold values and limits associated with beacon data, providing access to a preprocessing telemetry log of telemetry data, determining each object located with a vehicle, said determine each object located with a vehicle comprising:
identifying each beacon unique identifier disposed with an initial vehicle location,
identifying each beacon unique identifier disposed with a second vehicle location, said second vehicle location determined by one of a speed, distance, location or geofence,
wherein said identifying each beacon unique identifier disposed with a second vehicle location determines an accurate number of objects disposed with a vehicle. 44. A telemetry wireless beacon data fleet management condition determination method as in claim 43 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, comparing said beacon data with said second data, when said beacon data is beyond a damage threshold or damage limit value of said second data, communicate an object damage condition. 45. A telemetry wireless beacon data fleet management condition determination method as in claim 44 wherein said damage threshold or damage limit value is selected from the group of a G force, temperature, a pressure, or a user defined sensor value. 46. A telemetry wireless beacon data fleet management condition determination method as in claim 44 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, comparing said beacon data with said second data, when said beacon data is beyond a hazardous threshold or hazardous limit value of said second data, communicate a hazardous object condition. 47. A telemetry wireless beacon data fleet management condition determination method as in claim 46 wherein said hazardous threshold or hazardous limit value is selected from the group of a G force, temperature, a pressure, or a user defined sensor value. 48. A telemetry wireless beacon data fleet management condition determination method as in claim 44 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, for a said beacon unique identifier, comparing said beacon unique identifier with said second vehicle location to the presence or absence of said beacon unique identifier at a third vehicle location, and communicate a missing object condition if said beacon unique identifier is absence at said third vehicle location. 49. A telemetry wireless beacon data fleet management condition determination method as in claim 44 wherein determination and communication of a condition is one of a message to an I/O expander where the message is converted from text to speech as an audio alarm, a message on a computer, a compliance report or a fleet management report. | Apparatus, methods and system relating to a vehicular telemetry environment for an intelligent Bluetooth beacon I/O expansion of the vehicular telemetry hardware system. The intelligent Bluetooth beacon I/O expansion provides a capability to receive beacon data, log beacon data, communicate beacon data and operate on beacon data to determine and further communicate a range of operational conditions, such as damage, hazardous and missing objects in the form of text messages, audio messages or compliance and management reports.1. A telemetry wireless beacon apparatus comprising:
a wireless beacon communication device, and a vehicle device, said vehicle device further comprising a processor, firmware, communications processor, telematic sensors and an interface to communicate with a vehicle network communications bus, wherein said processor and firmware capable to monitor and receive data in real time from said interface, said telematics sensors and said wireless beacon communication device thereby capable to log said data for subsequent communication to a remote device. 2. A telemetry wireless beacon apparatus as in claim 1 wherein said telematics sensors include at least one of an accelerometer device or GPS device. 3. A telemetry wireless beacon apparatus as in claim 1 wherein said wireless beacon communication device is a Bluetooth wireless beacon communication device capable of communicating with a beacon device. 4. A telemetry wireless beacon apparatus as in claim 1 further comprising an I/O expander. 5. A telemetry wireless beacon apparatus as in claim 1 wherein said wireless beacon communication device is integral with said vehicle device. 6. A telemetry wireless beacon apparatus as in claim 4 wherein said wireless beacon communication device is integral with said I/O expander. 7. A telemetry wireless beacon apparatus as in claim 4 wherein said wireless beacon communication device is a device connectable to said I/O expander. 8. A telemetry wireless beacon apparatus as in claim 1 further comprising at least one beacon device disposed with at least one object. 9. A telemetry wireless beacon apparatus as in claim 8 wherein said at least one object is selected from the group of package, equipment, vehicle or people. 10. A telemetry wireless beacon apparatus as in claim 1 wherein said data is selected from the group of GPS data, engine data, vehicle data, speed data, position data, direction data or vehicle acceleration data. 11. A telemetry wireless beacon apparatus as in claim 10 wherein said data is further selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 12. A telemetry wireless beacon apparatus as in claim 1 wherein said data is selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 13. A telemetry wireless beacon apparatus as in claim 8 wherein said at least one beacon device further comprises a beacon processor beacon firmware, beacon radio module and at least one of a beacon accelerometer and beacon sensors. 14. A telemetry wireless beacon apparatus as in claim 13 wherein said beacon sensors are selected from the group of a temperature sensor, an illumination sensor, a pressure sensor, a battery sensor or a user defined sensor. 15. A telemetry wireless beacon apparatus as in claim 14 wherein said data is selected from the group of a beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, bacon battery data or user defined data. 16. A telemetry wireless beacon data monitoring and logging method comprising:
monitoring and receiving data from at least one of an interface to vehicle engine data or telematics sensors, receiving beacon data provided by a wireless beacon communication device, and logging data and beacon data as telemetry data for subsequent communication to a remote device. 17. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said telematics sensors includes an accelerometer and said data includes accelerometer data. 18. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said telematics sensors includes a GPS device and said data includes location data. 19. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said data includes engine data and vehicle speed data. 20. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device includes beacon data from a beacon device. 21. A telemetry wireless beacon data monitoring and logging method as in claim 20 wherein said beacon data includes unique identifier data for each beacon device. 22. A telemetry wireless beacon data monitoring and logging method as in claim 21 wherein said beacon data further includes data selected from the group of beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 23. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device is received directly by a telemetry wireless beacon apparatus. 24. A telemetry wireless beacon data monitoring and logging method as in claim 16 wherein said receiving beacon data provided by a wireless beacon communication device is received indirectly through and I/O expander. 25. A telemetry wireless beacon data preprocessing method comprising:
accessing a log of telemetry data, said telemetry data including data and beacon data, translating said data into at least one of engine codes, G forces, map locations, for each unique identifier in said beacon data, translating said beacon data into at least one of a beacon temperature, beacon pressure, beacon light, beacon acceleration, beacon battery level or beacon user defined sensor reading, and storing a preprocessing telemetry log of said telemetry data for further fleet management condition processing. 26. A telemetry wireless beacon data preprocessing method as in claim 25 further including preprocessing said data into at least one of a minimum value, maximum value or range of values. 27. A telemetry wireless beacon data preprocessing method as in claim 25 further including preprocessing each of said beacon data associated with a unique identifier into at least one of a minimum value, maximum value or range of values. 28. A telemetry wireless beacon data preprocessing method as in claim 25 further comprising associating at least one of engine codes, G forces, vehicle speed and map location with each unique identifier and at least one of a beacon temperature, beacon pressure, beacon light, beacon acceleration, beacon battery level or beacon user defined sensor reading. 29. A telemetry wireless beacon system comprising:
a wireless beacon communication device, at least one beacon device, at least one remote device, and at least one vehicle device, said at least one vehicle device further comprising a processor, firmware, communications processor, telematics sensors and an interface to communicate with a vehicle network communications bus, said at least one beacon device capable to communicate beacon data with said wireless beacon communication device, said at least one vehicle device capable to communicate with said at least one remote device, wherein said processor and firmware capable to monitor and receive data from said interface, said telematics sensors and said wireless beacon communication device thereby capable to log said data for subsequent communication to said at least one remote device. 30. A telemetry wireless beacon system as in claim 29 wherein said telematics sensors include at least one of an accelerometer or GPS device. 31. A telemetry wireless beacon system as in claim 29 wherein said wireless beacon communication device is a Bluetooth wireless beacon communication device. 32. A telemetry wireless beacon system as in claim 29 further comprising an I/O expander. 33. A telemetry wireless beacon system as in claim 29 wherein said wireless beacon communication device is integral with said vehicle device. 34. A telemetry wireless beacon system as in claim 32 wherein said wireless beacon communication device is integral with said I/O expander. 35. A telemetry wireless beacon system as in claim 32 wherein said wireless beacon communication device is a device connectable to said I/O expander. 36. A telemetry wireless beacon system as in claim 29 wherein said at least one beacon device is disposed with at least one object. 37. A telemetry wireless beacon system as in claim 36 wherein said at least one object is selected from the group of package, equipment, vehicle or people. 38. A telemetry wireless beacon system as in claim 29 wherein said data is selected from the group of GPS data, engine data, vehicle data, vehicle speed data, position data, direction data or vehicle acceleration data. 39. A telemetry wireless beacon system as in claim 38 wherein said data is further selected from the group of beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 40. A telemetry wireless beacon system as in claim 29 wherein said at least one beacon device further comprises a beacon processor, beacon firmware, beacon radio module and at least one of a beacon accelerometer or beacon sensors. 41. A telemetry wireless beacon system as in claim 40 wherein said beacon sensors are selected from the group of a temperature sensor, an illumination sensor, a pressure sensor, an acceleration sensor, a battery sensor or a user defined sensor. 42. A telemetry wireless beacon system as in claim 41 wherein said data is selected from the group of a beacon unique identifier data, beacon temperature data, beacon light data, beacon pressure data, beacon acceleration data, beacon battery data or beacon user defined data. 43. A telemetry wireless beacon data fleet management condition determination method comprising:
providing at least access to first data that identifies and associates beacon unique identifiers with objects, providing at least access to second data of threshold values and limits associated with beacon data, providing access to a preprocessing telemetry log of telemetry data, determining each object located with a vehicle, said determine each object located with a vehicle comprising:
identifying each beacon unique identifier disposed with an initial vehicle location,
identifying each beacon unique identifier disposed with a second vehicle location, said second vehicle location determined by one of a speed, distance, location or geofence,
wherein said identifying each beacon unique identifier disposed with a second vehicle location determines an accurate number of objects disposed with a vehicle. 44. A telemetry wireless beacon data fleet management condition determination method as in claim 43 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, comparing said beacon data with said second data, when said beacon data is beyond a damage threshold or damage limit value of said second data, communicate an object damage condition. 45. A telemetry wireless beacon data fleet management condition determination method as in claim 44 wherein said damage threshold or damage limit value is selected from the group of a G force, temperature, a pressure, or a user defined sensor value. 46. A telemetry wireless beacon data fleet management condition determination method as in claim 44 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, comparing said beacon data with said second data, when said beacon data is beyond a hazardous threshold or hazardous limit value of said second data, communicate a hazardous object condition. 47. A telemetry wireless beacon data fleet management condition determination method as in claim 46 wherein said hazardous threshold or hazardous limit value is selected from the group of a G force, temperature, a pressure, or a user defined sensor value. 48. A telemetry wireless beacon data fleet management condition determination method as in claim 44 further comprising:
accessing said preprocessing telemetry log of telemetry data,
identifying said beacon unique identifier and beacon data, for a said beacon unique identifier, comparing said beacon unique identifier with said second vehicle location to the presence or absence of said beacon unique identifier at a third vehicle location, and communicate a missing object condition if said beacon unique identifier is absence at said third vehicle location. 49. A telemetry wireless beacon data fleet management condition determination method as in claim 44 wherein determination and communication of a condition is one of a message to an I/O expander where the message is converted from text to speech as an audio alarm, a message on a computer, a compliance report or a fleet management report. | 2,100 |
5,223 | 15,059,826 | 2,161 | A system and method for creating a user profile and for using the user profile to order search results returned by a search engine. The user profile is based on search queries submitted by a user, the user's specific interaction with the documents identified by the search engine and personal information provided by the user. Terms for the user profile may be selected from the documents accessed by the user by performing paragraph sampling or context analysis. Generic scores associated with the search results are modulated by the user profile to measure their relevance to a user's preference and interest. The search results are re-ordered accordingly so that the most relevant results appear on the top of the list. User profiles can be created and/or stored on the client side or server side of a client-server network environment. | 1. A method of personalizing search results of a search engine, the method comprising:
accessing a user profile for a user based on information about the user, the user information including information derived from a set of documents, the set of documents comprising a plurality of documents selected from the set consisting of documents identified by search results from the search engine, documents accessed by the user, documents linked to the documents identified by search results from the search engine, and documents linked to the documents accessed by the user; receiving a search query from the user; identifying a set of search result documents that match the search query; assigning a generic score to each of at least a plurality of the search result documents; assigning a personalized score to each document of the plurality of search result documents in accordance with the generic score assigned to the document and the user profile; and ranking the set of search result documents according to their personalized scores. | A system and method for creating a user profile and for using the user profile to order search results returned by a search engine. The user profile is based on search queries submitted by a user, the user's specific interaction with the documents identified by the search engine and personal information provided by the user. Terms for the user profile may be selected from the documents accessed by the user by performing paragraph sampling or context analysis. Generic scores associated with the search results are modulated by the user profile to measure their relevance to a user's preference and interest. The search results are re-ordered accordingly so that the most relevant results appear on the top of the list. User profiles can be created and/or stored on the client side or server side of a client-server network environment.1. A method of personalizing search results of a search engine, the method comprising:
accessing a user profile for a user based on information about the user, the user information including information derived from a set of documents, the set of documents comprising a plurality of documents selected from the set consisting of documents identified by search results from the search engine, documents accessed by the user, documents linked to the documents identified by search results from the search engine, and documents linked to the documents accessed by the user; receiving a search query from the user; identifying a set of search result documents that match the search query; assigning a generic score to each of at least a plurality of the search result documents; assigning a personalized score to each document of the plurality of search result documents in accordance with the generic score assigned to the document and the user profile; and ranking the set of search result documents according to their personalized scores. | 2,100 |
5,224 | 15,087,445 | 2,113 | A method for storing data. The method includes receiving data to write to persistent storage, calculating parity values for a grid using the data, where each of the parity values is associated with one selected from of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group. The method further includes writing the data to a data grid in the persistent storage, where the data grid is part of the grid, and writing the parity values for the grid to a portion of the grid, where the portion of the grid comprises physical locations associated with a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein the portion of the grid is distinct from the data grid. | 1.-29. (canceled) 30. A non-transitory computer readable medium comprising instructions, which when executed perform a method for storing data, the method comprising:
receiving the data to write to persistent storage; calculating parity values for a grid using the data, wherein the grid comprises a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein each of the parity values is associated with one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, and wherein the parity values associated with the Intersection Parity Group are calculated using the parity values from at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, and the Column P Parity Group; writing the data to a data grid in the persistent storage, wherein the data grid is part of the grid; and writing the parity values for the grid to a portion of the grid, wherein the portion of the grid comprises physical locations associated with the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, wherein the portion of the grid is distinct from the data grid. 31. The non-transitory computer readable medium of claim 30, wherein at least one physical location in the portion of the grid is associated with a first independent fault domain and a second independent fault domain. 32. The non-transitory computer readable medium of claim 30, wherein the persistent storage comprises a plurality of storage modules, wherein each of the plurality of storage modules comprises solid state memory, and wherein the first independent fault domain is the plurality of storage modules and the second independent fault domain is a plurality of channels in each of the plurality of storage modules. 33. The non-transitory computer readable medium of claim 30, wherein a parity value in the Row P Parity Group is a P parity value. 34. The non-transitory computer readable medium of claim 30, wherein a parity value in the Row Q Parity Group is a Q parity value. 35. The non-transitory computer readable medium of claim 30, wherein the persistent storage comprises solid state memory. 36. The non-transitory computer readable medium of claim 35, wherein the solid state memory comprises NAND flash. 37. The non-transitory computer readable medium of claim 30, parity values associated with the Intersection Parity Group are not calculated using any of the data. 38. The non-transitory computer readable medium of claim 30, wherein the grid comprises a plurality of rows, wherein a location of a parity value from the Row P Parity Group in a first row of the plurality of rows is in a different relative location as compared to a location of a parity value from the Row P Parity Group in a second row of the plurality of rows. 39. A system, comprising:
a controller; a non-transitory computer medium operatively connected to the controller; persistent storage operatively connected to the controller and comprising a plurality of storage modules; wherein the non-transitory computer readable medium comprises instructions which when executed by the controller performs a method, the method comprising: receiving data to write to persistent storage; calculating parity values for a grid using the data, wherein the grid comprises a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein each of the parity values is associated with one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, and wherein the parity values associated with the Intersection Parity Group are calculated using the parity values from at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, and the Column P Parity Group; writing the data to a data grid in the persistent storage, wherein the data grid is part of the grid; and writing the parity values for the grid to a portion of the grid, wherein the portion of the grid comprises physical locations associated with the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, wherein the portion of the grid is distinct from the data grid. 40. The system of claim 39, further comprising:
a field programmable gate array (FPGA) operatively connected to the controller, wherein calculating at least one of the parity values using the data comprises using the FPGA to calculate at least one of the parity values. 41. The system of claim 39, wherein the controller stores a grid geometry for the grid. 42. The system of claim 41, wherein the grid geometry comprises a size of the grid and specifies independent fault domains associated with each dimension of the grid. 43. The system of claim 41, wherein the controller tracks locations of parity values in the grid. 44. The system of claim 39, wherein the plurality of storage modules each comprises a plurality of NAND dies. 45. The system of claim 43, wherein the controller is configured to reconstruct a corrupted datum in the persistent storage using the parity values in at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group. 46. The system of claim 39, wherein at least one physical location in the portion of the grid is associated with a first independent fault domain and a second independent fault domain. 47. The system of claim 39, wherein each of the plurality of storage modules comprises solid state memory, and wherein the first independent fault domain is the plurality of storage modules and the second independent fault domain is a plurality of channels in each of the plurality of storage modules. 48. The system of claim 39, wherein a parity value in the Row P Parity Group is a P parity value. 49. The system of claim 39, wherein a parity value in the Row Q Parity Group is a Q parity value. | A method for storing data. The method includes receiving data to write to persistent storage, calculating parity values for a grid using the data, where each of the parity values is associated with one selected from of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group. The method further includes writing the data to a data grid in the persistent storage, where the data grid is part of the grid, and writing the parity values for the grid to a portion of the grid, where the portion of the grid comprises physical locations associated with a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein the portion of the grid is distinct from the data grid.1.-29. (canceled) 30. A non-transitory computer readable medium comprising instructions, which when executed perform a method for storing data, the method comprising:
receiving the data to write to persistent storage; calculating parity values for a grid using the data, wherein the grid comprises a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein each of the parity values is associated with one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, and wherein the parity values associated with the Intersection Parity Group are calculated using the parity values from at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, and the Column P Parity Group; writing the data to a data grid in the persistent storage, wherein the data grid is part of the grid; and writing the parity values for the grid to a portion of the grid, wherein the portion of the grid comprises physical locations associated with the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, wherein the portion of the grid is distinct from the data grid. 31. The non-transitory computer readable medium of claim 30, wherein at least one physical location in the portion of the grid is associated with a first independent fault domain and a second independent fault domain. 32. The non-transitory computer readable medium of claim 30, wherein the persistent storage comprises a plurality of storage modules, wherein each of the plurality of storage modules comprises solid state memory, and wherein the first independent fault domain is the plurality of storage modules and the second independent fault domain is a plurality of channels in each of the plurality of storage modules. 33. The non-transitory computer readable medium of claim 30, wherein a parity value in the Row P Parity Group is a P parity value. 34. The non-transitory computer readable medium of claim 30, wherein a parity value in the Row Q Parity Group is a Q parity value. 35. The non-transitory computer readable medium of claim 30, wherein the persistent storage comprises solid state memory. 36. The non-transitory computer readable medium of claim 35, wherein the solid state memory comprises NAND flash. 37. The non-transitory computer readable medium of claim 30, parity values associated with the Intersection Parity Group are not calculated using any of the data. 38. The non-transitory computer readable medium of claim 30, wherein the grid comprises a plurality of rows, wherein a location of a parity value from the Row P Parity Group in a first row of the plurality of rows is in a different relative location as compared to a location of a parity value from the Row P Parity Group in a second row of the plurality of rows. 39. A system, comprising:
a controller; a non-transitory computer medium operatively connected to the controller; persistent storage operatively connected to the controller and comprising a plurality of storage modules; wherein the non-transitory computer readable medium comprises instructions which when executed by the controller performs a method, the method comprising: receiving data to write to persistent storage; calculating parity values for a grid using the data, wherein the grid comprises a Row Q Parity Group, a Row P Parity Group, a Column Q Parity Group, a Column P Parity Group, and an Intersection Parity Group, wherein each of the parity values is associated with one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, and wherein the parity values associated with the Intersection Parity Group are calculated using the parity values from at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, and the Column P Parity Group; writing the data to a data grid in the persistent storage, wherein the data grid is part of the grid; and writing the parity values for the grid to a portion of the grid, wherein the portion of the grid comprises physical locations associated with the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group, wherein the portion of the grid is distinct from the data grid. 40. The system of claim 39, further comprising:
a field programmable gate array (FPGA) operatively connected to the controller, wherein calculating at least one of the parity values using the data comprises using the FPGA to calculate at least one of the parity values. 41. The system of claim 39, wherein the controller stores a grid geometry for the grid. 42. The system of claim 41, wherein the grid geometry comprises a size of the grid and specifies independent fault domains associated with each dimension of the grid. 43. The system of claim 41, wherein the controller tracks locations of parity values in the grid. 44. The system of claim 39, wherein the plurality of storage modules each comprises a plurality of NAND dies. 45. The system of claim 43, wherein the controller is configured to reconstruct a corrupted datum in the persistent storage using the parity values in at least one selected from a group consisting of the Row Q Parity Group, the Row P Parity Group, the Column Q Parity Group, the Column P Parity Group, and the Intersection Parity Group. 46. The system of claim 39, wherein at least one physical location in the portion of the grid is associated with a first independent fault domain and a second independent fault domain. 47. The system of claim 39, wherein each of the plurality of storage modules comprises solid state memory, and wherein the first independent fault domain is the plurality of storage modules and the second independent fault domain is a plurality of channels in each of the plurality of storage modules. 48. The system of claim 39, wherein a parity value in the Row P Parity Group is a P parity value. 49. The system of claim 39, wherein a parity value in the Row Q Parity Group is a Q parity value. | 2,100 |
5,225 | 14,043,281 | 2,167 | A system, a method, and a computer program product for providing transparent access to multi-temperature data are disclosed. A query for accessing data is received. The query includes at least one selection parameter for retrieval of data. The data is stored in a plurality of partitions of a database system. Each partition has a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the partition. A determination is made whether at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column. The queried data is retrieved from the partition using the predetermined date associated with the data contained in the partition. | 1. A computer-implemented method, comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data; determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions; wherein the at least one of the receiving, the determining, and the retrieving is performed on at least one processor of at least one computing system. 2. The method according to claim 1, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 3. The method according to claim 2, wherein the business object includes at least one of the following: an open business object and a closed business object. 4. The method according to claim 3, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 5. The method according to claim 4, further comprising
moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 6. The method according to claim 4, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. 7. The method according to claim 1, further comprising
determining whether the queried data is stored in at least two partitions of data; joining, based on the determining, the at least two partitions of data; and retrieving the joined data. 8. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data; determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions. 9. The computer program product according to claim 8, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 10. The computer program product according to claim 9, wherein the business object includes at least one of the following: an open business object and a closed business object. 11. The computer program product according to claim 10, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 12. The computer program product according to claim 11, wherein the operations further comprise
moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 13. The computer program product according to claim 11, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. 14. The computer program product according to claim 8, wherein the operations further comprise
determining whether the queried data is stored in at least two partitions of data; joining, based on the determining, the at least two partitions of data; and retrieving the joined data. 15. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data;
determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and
retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions. 16. The system according to claim 15, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 17. The system according to claim 16, wherein the business object includes at least one of the following: an open business object and a closed business object. 18. The system according to claim 17, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 19. The system according to claim 18, wherein the operations further comprise moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 20. The system according to claim 18, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. | A system, a method, and a computer program product for providing transparent access to multi-temperature data are disclosed. A query for accessing data is received. The query includes at least one selection parameter for retrieval of data. The data is stored in a plurality of partitions of a database system. Each partition has a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the partition. A determination is made whether at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column. The queried data is retrieved from the partition using the predetermined date associated with the data contained in the partition.1. A computer-implemented method, comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data; determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions; wherein the at least one of the receiving, the determining, and the retrieving is performed on at least one processor of at least one computing system. 2. The method according to claim 1, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 3. The method according to claim 2, wherein the business object includes at least one of the following: an open business object and a closed business object. 4. The method according to claim 3, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 5. The method according to claim 4, further comprising
moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 6. The method according to claim 4, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. 7. The method according to claim 1, further comprising
determining whether the queried data is stored in at least two partitions of data; joining, based on the determining, the at least two partitions of data; and retrieving the joined data. 8. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data; determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions. 9. The computer program product according to claim 8, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 10. The computer program product according to claim 9, wherein the business object includes at least one of the following: an open business object and a closed business object. 11. The computer program product according to claim 10, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 12. The computer program product according to claim 11, wherein the operations further comprise
moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 13. The computer program product according to claim 11, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. 14. The computer program product according to claim 8, wherein the operations further comprise
determining whether the queried data is stored in at least two partitions of data; joining, based on the determining, the at least two partitions of data; and retrieving the joined data. 15. A system comprising:
at least one programmable processor; and a machine-readable medium storing instructions that, when executed by the at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
receiving a query for access of data, the query containing at least one selection parameter for retrieval of data, wherein the data is stored in a plurality of partitions of a database system, each partition in the plurality of partitions having a maximum data value per column, a minimum data value per column, and a predetermined date associated with the data contained in the at least one partition of data;
determining whether the at least one selection parameter is greater than the minimum data value per column and less than the maximum data value per column; and
retrieving, based on the determining, the queried data from at least one partition in the plurality of partitions using the predetermined date associated with the data contained in the at least one partition of data in the plurality of partitions. 16. The system according to claim 15, wherein the predetermined date is determined based on a creation date of data associated with a business object being queried by the received query. 17. The system according to claim 16, wherein the business object includes at least one of the following: an open business object and a closed business object. 18. The system according to claim 17, wherein data associated with an open business object is stored in a hot data partition and data associated with a closed business object is stored in a cold data partition, wherein the hot data partition contains data having a date that is more recent than the predetermined date and the cold data partition contains data having a date that is older than the predetermined date. 19. The system according to claim 18, wherein the operations further comprise moving the data stored in the hot data partition to the cold partition based on at least one of the following: when the date of the data stored in the hot data partition becomes older than the predetermined date and upon receiving an indicator indicating that the data stored in the hot data partition should be moved to the cold data partition. 20. The system according to claim 18, wherein the cold data partition includes a predetermined cold data partition date, whereby data stored in the cold data partition and having a date that is older than the predetermined cold data partition date is moved to another cold data partition, wherein the another cold data partition stores data having a date that is older than the predetermined cold data partition date. | 2,100 |
5,226 | 13,915,273 | 2,173 | A method and system for disabling traffic from a specific device or devices on a WiFi network via a remote script or other action. In one embodiment, the method is implemented as an application that executes on a device such as a smart phone (e.g., IOS iPhone, Android operating system device) or tablet (e.g., iPad). | 1. A method of controlling internet access, the method comprising:
displaying on a user interface a list of devices connected to the internet via a controlled device; receiving input from a user via the user interface regarding the permission of one or more devices to access the internet via the controlled device; and sending permission information to the controlled device to update the permission of one or more devices to access the internet via the controlled device. 2. The method of claim 1, wherein the user interface includes a toggle switch indicating the current permission setting for each of the listed devices. 3. The method of claim 2, wherein receiving input from a user includes recording a change in the position of at least one toggle switch. 4. The method of claim 1, wherein the user interface is part of a mobile device. 5. The method of claim 4, wherein the mobile device communicates wirelessly with the controlled device. 6. The method of claim 1, wherein the controlled device is a network router. 7. The method of claim 1, wherein the user interface is part of a laptop or desktop computer. 8. The method of claim 7, wherein the laptop or desktop computer communicates with the controlled device through a wired connection. 9. The method of claim 1, further comprising prior to the displaying step:
receiving data from the controlled device regarding at least one of access permission and connected devices; sending the data to a web service api; and receiving parsed data from the web service api. 10. The method of claim 1, further comprising:
receiving login information from the user relative to the controlled device; and verifying the login information before displaying the list of devices connected to the internet via the controlled device. 11. A non-transitory computer readable storage medium with an executable program thereon, the program instructing a device to:
display on a user interface a list of devices connected to a controlled device; receive input from a user via the user interface regarding the permission of one or more devices to access the internet via the controlled device; and send permission information to the controlled device to update the permission of one or more devices to access the Internet via the controlled device. 12. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to display a toggle switch indicating the current permission setting for each of the listed devices. 13. The non-transitory computer readable storage medium of claim 12, the program further instructing the device to record any changes in the position of the toggle switches and to send the updated position of any changed toggle switch to the controlled device upon the occurrence of the change. 14. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to:
receive data from the controlled device regarding at least one of access permission and connected devices; send the data to a web service api; and receive parsed data from the web service api. 15. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to:
receive login information from the user relative to the controlled device; and verify the login information before instructing the device to display the list of devices connected to the internet via the controlled device. | A method and system for disabling traffic from a specific device or devices on a WiFi network via a remote script or other action. In one embodiment, the method is implemented as an application that executes on a device such as a smart phone (e.g., IOS iPhone, Android operating system device) or tablet (e.g., iPad).1. A method of controlling internet access, the method comprising:
displaying on a user interface a list of devices connected to the internet via a controlled device; receiving input from a user via the user interface regarding the permission of one or more devices to access the internet via the controlled device; and sending permission information to the controlled device to update the permission of one or more devices to access the internet via the controlled device. 2. The method of claim 1, wherein the user interface includes a toggle switch indicating the current permission setting for each of the listed devices. 3. The method of claim 2, wherein receiving input from a user includes recording a change in the position of at least one toggle switch. 4. The method of claim 1, wherein the user interface is part of a mobile device. 5. The method of claim 4, wherein the mobile device communicates wirelessly with the controlled device. 6. The method of claim 1, wherein the controlled device is a network router. 7. The method of claim 1, wherein the user interface is part of a laptop or desktop computer. 8. The method of claim 7, wherein the laptop or desktop computer communicates with the controlled device through a wired connection. 9. The method of claim 1, further comprising prior to the displaying step:
receiving data from the controlled device regarding at least one of access permission and connected devices; sending the data to a web service api; and receiving parsed data from the web service api. 10. The method of claim 1, further comprising:
receiving login information from the user relative to the controlled device; and verifying the login information before displaying the list of devices connected to the internet via the controlled device. 11. A non-transitory computer readable storage medium with an executable program thereon, the program instructing a device to:
display on a user interface a list of devices connected to a controlled device; receive input from a user via the user interface regarding the permission of one or more devices to access the internet via the controlled device; and send permission information to the controlled device to update the permission of one or more devices to access the Internet via the controlled device. 12. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to display a toggle switch indicating the current permission setting for each of the listed devices. 13. The non-transitory computer readable storage medium of claim 12, the program further instructing the device to record any changes in the position of the toggle switches and to send the updated position of any changed toggle switch to the controlled device upon the occurrence of the change. 14. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to:
receive data from the controlled device regarding at least one of access permission and connected devices; send the data to a web service api; and receive parsed data from the web service api. 15. The non-transitory computer readable storage medium of claim 11, the program further instructing the device to:
receive login information from the user relative to the controlled device; and verify the login information before instructing the device to display the list of devices connected to the internet via the controlled device. | 2,100 |
5,227 | 14,508,503 | 2,199 | Methods, systems, and computer-readable storage media for development and deployment of a product to a multi-server landscape. In some implementations, actions include receiving first user input defining a product and indicating two or more components that the product includes, receiving second user input including a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective IDEs used to develop the two or more components, and receiving third user input, and in response to the third user input, automatically: providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components, receiving the two or more components respectively developed using the two or more IDEs, and generating a product package including the metadata and the two or more components. | 1. A computer-implemented method for development and deployment of a product to a multi-server landscape, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, first user input defining a product and indicating two or more components that the product comprises; receiving, by the one or more processors, second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and receiving, by the one or more processors, third user input, and in response to the third user input, automatically, by the one or more processors:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 2. The method of claim 1, further comprising providing a deployment service for execution by a run-time system. 3. The method of claim 2, further comprising transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 4. The method of claim 1, further comprising providing a package builder service that is executed by the one or more processors to perform the operations. 5. The method of claim 1, wherein in response to the third user input, automatically, by the one or more processors:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 6. The method of claim 1, further comprising providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. 7. The method of claim 6, wherein the integrated IDE provides perspectives to respective run-time environments, to which the two or more components are to be deployed. 8. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for development and deployment of a product to a multi-server landscape, the operations comprising:
receiving first user input defining a product and indicating two or more components that the product comprises; receiving second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and receiving third user input, and in response to the third user input, automatically:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 9. The computer-readable storage medium of claim 8, wherein operations further comprise providing a deployment service for execution by a run-time system. 10. The computer-readable storage medium of claim 9, wherein operations further comprise transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 11. The computer-readable storage medium of claim 8, wherein operations further comprise providing a package builder service that is executed by the one or more processors to perform the operations. 12. The computer-readable storage medium of claim 8, wherein in response to the third user input, automatically:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 13. The computer-readable storage medium of claim 8, wherein operations further comprise providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. 14. The computer-readable storage medium of claim 13, wherein the integrated IDE provides perspectives to respective run-time environments, to which the two or more components are to be deployed. 15. A system, comprising:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored thereon which, when executed by the computing device, cause the computing device to perform operations for development and deployment of a product to a multi-server landscape, the operations comprising:
receiving first user input defining a product and indicating two or more components that the product comprises;
receiving second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and
receiving third user input, and in response to the third user input, automatically:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 16. The system of claim 15, wherein operations further comprise providing a deployment service for execution by a run-time system. 17. The system of claim 16, wherein operations further comprise transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 18. The system of claim 15, wherein operations further comprise providing a package builder service that is executed by the one or more processors to perform the operations. 19. The system of claim 15, wherein in response to the third user input, automatically:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 20. The system of claim 15, wherein operations further comprise providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. | Methods, systems, and computer-readable storage media for development and deployment of a product to a multi-server landscape. In some implementations, actions include receiving first user input defining a product and indicating two or more components that the product includes, receiving second user input including a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective IDEs used to develop the two or more components, and receiving third user input, and in response to the third user input, automatically: providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components, receiving the two or more components respectively developed using the two or more IDEs, and generating a product package including the metadata and the two or more components.1. A computer-implemented method for development and deployment of a product to a multi-server landscape, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, first user input defining a product and indicating two or more components that the product comprises; receiving, by the one or more processors, second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and receiving, by the one or more processors, third user input, and in response to the third user input, automatically, by the one or more processors:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 2. The method of claim 1, further comprising providing a deployment service for execution by a run-time system. 3. The method of claim 2, further comprising transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 4. The method of claim 1, further comprising providing a package builder service that is executed by the one or more processors to perform the operations. 5. The method of claim 1, wherein in response to the third user input, automatically, by the one or more processors:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 6. The method of claim 1, further comprising providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. 7. The method of claim 6, wherein the integrated IDE provides perspectives to respective run-time environments, to which the two or more components are to be deployed. 8. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for development and deployment of a product to a multi-server landscape, the operations comprising:
receiving first user input defining a product and indicating two or more components that the product comprises; receiving second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and receiving third user input, and in response to the third user input, automatically:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 9. The computer-readable storage medium of claim 8, wherein operations further comprise providing a deployment service for execution by a run-time system. 10. The computer-readable storage medium of claim 9, wherein operations further comprise transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 11. The computer-readable storage medium of claim 8, wherein operations further comprise providing a package builder service that is executed by the one or more processors to perform the operations. 12. The computer-readable storage medium of claim 8, wherein in response to the third user input, automatically:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 13. The computer-readable storage medium of claim 8, wherein operations further comprise providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. 14. The computer-readable storage medium of claim 13, wherein the integrated IDE provides perspectives to respective run-time environments, to which the two or more components are to be deployed. 15. A system, comprising:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored thereon which, when executed by the computing device, cause the computing device to perform operations for development and deployment of a product to a multi-server landscape, the operations comprising:
receiving first user input defining a product and indicating two or more components that the product comprises;
receiving second user input comprising a project definition of a project, the project being associated with development and deployment of the product to a multi-server landscape, the second user input indicating respective integrated development environments (IDEs) used to develop the two or more components; and
receiving third user input, and in response to the third user input, automatically:
providing metadata indicating the project, constituent components of the product, and one or more run-time environments for deployment of constituent components,
receiving the two or more components respectively developed using the two or more IDEs, and
generating a product package comprising the metadata and the two or more components. 16. The system of claim 15, wherein operations further comprise providing a deployment service for execution by a run-time system. 17. The system of claim 16, wherein operations further comprise transmitting the product package to the run-time system, the run-time system executing the deployment service to access the product package and perform operations comprising:
processing the metadata to determine one or more run-time environments, to which the two or more components are to be deployed; and instructing each of the one or more run-time environments to retrieve and deploy at least one component. 18. The system of claim 15, wherein operations further comprise providing a package builder service that is executed by the one or more processors to perform the operations. 19. The system of claim 15, wherein in response to the third user input, automatically:
identifying the two or more components as components that are to be included in the product package based on the project definition; and requesting the two or more components from the two or more IDEs, respectively. 20. The system of claim 15, wherein operations further comprise providing an integrated IDE that enables development of artifacts for respective run-time environments based on the project definition. | 2,100 |
5,228 | 14,766,695 | 2,191 | A graphical screen element which is displayable on at least one screen of at least one computer device; with the aid of the screen element useful data for different application programs being manageable in a program-spanning manner; with the aid of the screen element the application programs being able to be linked together. | 1.-14. (canceled) 15. A graphical screen element, wherein the graphical screen element:
is displayable on at least one screen of at least one computer device; allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, and wherein a transmission of the useful data to all application programs takes place with the aid of the screen element. 16. The graphical screen element as recited in claim 15, wherein the screen element is displayable on at least one screen of multiple computer devices on which the application programs are run. 17. The graphical screen element as recited in claim 15, wherein the useful data are at least one of pieces of information and functions of the application programs. 18. The graphical screen element as recited in claim 15, wherein the screen element is small in relation to a size of the screen. 19. The graphical screen element as recited in claim 15, wherein the screen element is a bar. 20. The graphical screen element as recited in claim 15, wherein the at least one operating element includes at least one of at least one multiple information panel and at least one dialog element. 21. The graphical screen element as recited in claim 15, wherein the graphical screen element is usable for at least two mutually independent application programs. 22. The graphical screen element as recited in claim 15, wherein the application programs are diagnostic applications in a motor vehicle sector. 23. The graphical screen element as recited in claim 15, wherein the screen element is displayable essentially constantly during operation of the computer device. 24. A computer device, comprising:
at least one screen provided with a graphical screen element, wherein the graphical screen element: is displayable on at least one screen of at least one computer device; allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, and wherein a transmission of the useful data to all application programs takes place with the aid of the screen element. 25. The computer device as recited in claim 24, wherein at least two mutually independent application programs can be run on the computer device, and wherein useful data of a first application program are transmittable to a second application program essentially in real time with the aid of the screen element. 26. A computer system, comprising:
multiple computer devices, each computer device, comprising:
at least one screen provided with a graphical screen element, wherein the graphical screen element:
is displayable on at least one screen of at least one computer device;
allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and
allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, wherein a transmission of the useful data to all application programs takes place with the aid of the screen element, wherein the graphical screen element is displayable on the screen assigned to the respective computer device, and wherein different useful data (D) managed by the screen element is displayable on each computer device with the aid of the screen element, depending on the application program. 27. A method for managing useful data of application programs, comprising:
providing a superordinate graphical screen element for all application programs; and managing the useful data in a program-spanning manner with the aid of the screen element, wherein the useful data usable for all application programs are transmitted to all application programs in a superordinate manner with the aid of the screen element, wherein the useful data are input with the aid of at least one operating element of the screen element, and wherein the useful data is transmitted to all application programs via the screen element. 28. A computer program product including program code for carrying out, when the program code runs on an electronic computer or is stored on a computer-readable data carrier, a method for managing useful data of application programs, the method comprising:
providing a superordinate graphical screen element for all application programs; and managing the useful data in a program-spanning manner with the aid of the screen element, wherein the useful data usable for all application programs are transmitted to all application programs in a superordinate manner with the aid of the screen element, wherein the useful data are input with the aid of at least one operating element of the screen element, and wherein the useful data is transmitted to all application programs via the screen element. | A graphical screen element which is displayable on at least one screen of at least one computer device; with the aid of the screen element useful data for different application programs being manageable in a program-spanning manner; with the aid of the screen element the application programs being able to be linked together.1.-14. (canceled) 15. A graphical screen element, wherein the graphical screen element:
is displayable on at least one screen of at least one computer device; allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, and wherein a transmission of the useful data to all application programs takes place with the aid of the screen element. 16. The graphical screen element as recited in claim 15, wherein the screen element is displayable on at least one screen of multiple computer devices on which the application programs are run. 17. The graphical screen element as recited in claim 15, wherein the useful data are at least one of pieces of information and functions of the application programs. 18. The graphical screen element as recited in claim 15, wherein the screen element is small in relation to a size of the screen. 19. The graphical screen element as recited in claim 15, wherein the screen element is a bar. 20. The graphical screen element as recited in claim 15, wherein the at least one operating element includes at least one of at least one multiple information panel and at least one dialog element. 21. The graphical screen element as recited in claim 15, wherein the graphical screen element is usable for at least two mutually independent application programs. 22. The graphical screen element as recited in claim 15, wherein the application programs are diagnostic applications in a motor vehicle sector. 23. The graphical screen element as recited in claim 15, wherein the screen element is displayable essentially constantly during operation of the computer device. 24. A computer device, comprising:
at least one screen provided with a graphical screen element, wherein the graphical screen element: is displayable on at least one screen of at least one computer device; allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, and wherein a transmission of the useful data to all application programs takes place with the aid of the screen element. 25. The computer device as recited in claim 24, wherein at least two mutually independent application programs can be run on the computer device, and wherein useful data of a first application program are transmittable to a second application program essentially in real time with the aid of the screen element. 26. A computer system, comprising:
multiple computer devices, each computer device, comprising:
at least one screen provided with a graphical screen element, wherein the graphical screen element:
is displayable on at least one screen of at least one computer device;
allows useful data for different application programs to be managed in a program-spanning manner with the aid of the screen element; and
allows the application programs to be linked to one another with the aid of the screen element, wherein an input of the useful data takes place via at least one operating element of the screen element, wherein a transmission of the useful data to all application programs takes place with the aid of the screen element, wherein the graphical screen element is displayable on the screen assigned to the respective computer device, and wherein different useful data (D) managed by the screen element is displayable on each computer device with the aid of the screen element, depending on the application program. 27. A method for managing useful data of application programs, comprising:
providing a superordinate graphical screen element for all application programs; and managing the useful data in a program-spanning manner with the aid of the screen element, wherein the useful data usable for all application programs are transmitted to all application programs in a superordinate manner with the aid of the screen element, wherein the useful data are input with the aid of at least one operating element of the screen element, and wherein the useful data is transmitted to all application programs via the screen element. 28. A computer program product including program code for carrying out, when the program code runs on an electronic computer or is stored on a computer-readable data carrier, a method for managing useful data of application programs, the method comprising:
providing a superordinate graphical screen element for all application programs; and managing the useful data in a program-spanning manner with the aid of the screen element, wherein the useful data usable for all application programs are transmitted to all application programs in a superordinate manner with the aid of the screen element, wherein the useful data are input with the aid of at least one operating element of the screen element, and wherein the useful data is transmitted to all application programs via the screen element. | 2,100 |
5,229 | 13,286,079 | 2,128 | Process variation-based model optimization for metrology is described. For example, a method includes determining a first model of a structure. The first model is based on a first set of parameters. A set of process variations data is determined for the structure. The first model of the structure is modified to provide a second model of the structure based on the set of process variations data. The second model of the structure is based on a second set of parameters different from the first set of parameters. A simulated spectrum derived from the second model of the structure is then provided. | 1. A method of optimizing parametric models for structural analysis using metrology of repeating structures on a semiconductor substrate or wafer, the method comprising:
determining a first model of a structure, the first model based on a first set of parameters; determining a set of process variations data for the structure; modifying, based on the set of process variations data, the first model of the structure to provide a second model of the structure, the second model of the structure based on a second set of parameters different from the first set of parameters; and providing a simulated spectrum derived from the second model of the structure. 2. The method of claim 1, the method further comprising:
comparing the simulated spectrum to a sample spectrum derived from the structure. 3. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reducing the degrees of freedom (DoF) of the first set of parameters to provide the second set of parameters. 4. The method of claim 3, wherein reducing the DoF of the first set of parameters comprises:
analyzing design of experiment (DoE) data; selecting an appropriate parameterization; and fixing parameters having a smallest variation or error. 5. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing geometric parameters or material parameters, or both, to provide the second set of parameters. 6. The method of claim 5, wherein reparameterizing geometric parameters comprises using bottom critical dimension (CD) and top CD of the structure in the first set of parameters and using, in their place, middle CD and sidewall angle of the structure in the second set of parameters. 7. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing non-geometric and non-material parameters to provide the second set of parameters, the non-geometric and non-material parameters selected from the group consisting of function+delta parameters, principal component analysis (PCA) parameters, and non-linear principal component analysis (NLPCA). 8. The method of claim 7, wherein the reparameterizing comprises using function+delta parameters in linear or non-linear parameter correlations. 9. The method of claim 8, wherein the reparameterizing comprises reducing a library size of the second set of parameters relative to the first set of parameters. 10. The method of claim 1, wherein modifying based on the set of process variations data comprises sampling a space defined by set of process variations data. 11. The method of claim 10, wherein providing the second model of the structure comprises performing a regression only in the space defined by set of process variations data. 12. The method of claim 10, wherein providing the second model of the structure comprises performing analysis of one or more of auto wavelength selection, auto truncation order (TO), or auto truncation order pattern selection (TOPS) only in the space defined by set of process variations data. 13. The method of claim 1, wherein determining the set of process variations data for the structure comprises obtaining actual process data or synthetic process data based on a process analysis, or both. 14. The method of claim 1, wherein modifying the first model of the structure based on the set of process variations data comprises estimating a geometric parameter error of fixing a parameter in the second set of parameters. 15. A machine-accessible storage medium having instructions stored thereon which cause a data processing system to perform a method of optimizing parametric models for structural analysis using metrology of repeating structures on a semiconductor substrate or wafer, the method comprising:
determining a first model of a structure, the first model based on a first set of parameters; determining a set of process variations data for the structure; modifying, based on the set of process variations data, the first model of the structure to provide a second model of the structure, the second model of the structure based on a second set of parameters different from the first set of parameters; and providing a simulated spectrum derived from the second model of the structure. 16. The storage medium as in claim 15, the method further comprising:
comparing the simulated spectrum to a sample spectrum derived from the structure. 17. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reducing the degrees of freedom (DoF) of the first set of parameters to provide the second set of parameters. 18. The storage medium as in claim 17, wherein reducing the DoF of the first set of parameters comprises:
analyzing design of experiment (DoE) data; selecting an appropriate parameterization; and fixing parameters having a smallest variation or error. 19. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing geometric parameters or material parameters, or both, to provide the second set of parameters. 20. The storage medium as in claim 19, wherein reparameterizing geometric parameters comprises using bottom critical dimension (CD) and top CD of the structure in the first set of parameters and using, in their place, middle CD and sidewall angle of the structure in the second set of parameters. 21. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing non-geometric and non-material parameters to provide the second set of parameters, the non-geometric and non-material parameters selected from the group consisting of function+delta parameters, principal component analysis (PCA) parameters, and non-linear principal component analysis (NLPCA). 22. The storage medium as in claim 21, wherein the reparameterizing comprises using function+delta parameters in linear or non-linear parameter correlations. 23. The storage medium as in claim 22, wherein the reparameterizing comprises reducing a library size of the second set of parameters relative to the first set of parameters. 24. The storage medium as in claim 15, wherein modifying based on the set of process variations data comprises sampling a space defined by set of process variations data. 25. The storage medium as in claim 24, wherein providing the second model of the structure comprises performing a regression only in the space defined by set of process variations data. 26. The storage medium as in claim 24, wherein providing the second model of the structure comprises performing analysis of one or more of auto wavelength selection, auto truncation order (TO), or auto truncation order pattern selection (TOPS) only in the space defined by set of process variations data. 27. The storage medium as in claim 15, wherein determining the set of process variations data for the structure comprises obtaining actual process data or synthetic process data based on a process analysis, or both. 28. The storage medium as in claim 15, wherein modifying the first model of the structure based on the set of process variations data comprises estimating a geometric parameter error of fixing a parameter in the second set of parameters. 29. A system to generate a simulated diffraction signal to determine process parameters of a wafer application to fabricate a structure on a wafer using optical metrology, the system comprising:
a fabrication cluster configured to perform a wafer application to fabricate a structure on a wafer, wherein one or more process parameters characterize behavior of structure shape or layer thickness when the structure undergoes processing operations in the wafer application performed using the fabrication cluster; and an optical metrology system configured to determine the one or more process parameters of the wafer application, the optical metrology system comprising:
a beam source and detector configured to measure a diffraction signal of the structure; and
a processor configured to determine a first model of a structure, the first model based on a first set of parameters, configured to determine a set of process variations data for the structure, configured to modify the first model of the structure to provide a second model of the structure based on the set of process variations data, the second model of the structure based on a second set of parameters different from the first set of parameters, and configured to provide a simulated spectrum derived from the second model of the structure. 30. The system of claim 29, further comprising:
a library of simulated diffraction signals and values of one or more process parameters associated with the simulated diffraction signals, wherein the simulated diffraction signals were generated using values of one or more shape or film thickness parameters, and wherein the values of the one or more shape or film thickness parameters used to generate the simulated diffraction signals were derived from the values of the one or more process parameters associated with the simulated diffraction signals. | Process variation-based model optimization for metrology is described. For example, a method includes determining a first model of a structure. The first model is based on a first set of parameters. A set of process variations data is determined for the structure. The first model of the structure is modified to provide a second model of the structure based on the set of process variations data. The second model of the structure is based on a second set of parameters different from the first set of parameters. A simulated spectrum derived from the second model of the structure is then provided.1. A method of optimizing parametric models for structural analysis using metrology of repeating structures on a semiconductor substrate or wafer, the method comprising:
determining a first model of a structure, the first model based on a first set of parameters; determining a set of process variations data for the structure; modifying, based on the set of process variations data, the first model of the structure to provide a second model of the structure, the second model of the structure based on a second set of parameters different from the first set of parameters; and providing a simulated spectrum derived from the second model of the structure. 2. The method of claim 1, the method further comprising:
comparing the simulated spectrum to a sample spectrum derived from the structure. 3. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reducing the degrees of freedom (DoF) of the first set of parameters to provide the second set of parameters. 4. The method of claim 3, wherein reducing the DoF of the first set of parameters comprises:
analyzing design of experiment (DoE) data; selecting an appropriate parameterization; and fixing parameters having a smallest variation or error. 5. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing geometric parameters or material parameters, or both, to provide the second set of parameters. 6. The method of claim 5, wherein reparameterizing geometric parameters comprises using bottom critical dimension (CD) and top CD of the structure in the first set of parameters and using, in their place, middle CD and sidewall angle of the structure in the second set of parameters. 7. The method of claim 1, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing non-geometric and non-material parameters to provide the second set of parameters, the non-geometric and non-material parameters selected from the group consisting of function+delta parameters, principal component analysis (PCA) parameters, and non-linear principal component analysis (NLPCA). 8. The method of claim 7, wherein the reparameterizing comprises using function+delta parameters in linear or non-linear parameter correlations. 9. The method of claim 8, wherein the reparameterizing comprises reducing a library size of the second set of parameters relative to the first set of parameters. 10. The method of claim 1, wherein modifying based on the set of process variations data comprises sampling a space defined by set of process variations data. 11. The method of claim 10, wherein providing the second model of the structure comprises performing a regression only in the space defined by set of process variations data. 12. The method of claim 10, wherein providing the second model of the structure comprises performing analysis of one or more of auto wavelength selection, auto truncation order (TO), or auto truncation order pattern selection (TOPS) only in the space defined by set of process variations data. 13. The method of claim 1, wherein determining the set of process variations data for the structure comprises obtaining actual process data or synthetic process data based on a process analysis, or both. 14. The method of claim 1, wherein modifying the first model of the structure based on the set of process variations data comprises estimating a geometric parameter error of fixing a parameter in the second set of parameters. 15. A machine-accessible storage medium having instructions stored thereon which cause a data processing system to perform a method of optimizing parametric models for structural analysis using metrology of repeating structures on a semiconductor substrate or wafer, the method comprising:
determining a first model of a structure, the first model based on a first set of parameters; determining a set of process variations data for the structure; modifying, based on the set of process variations data, the first model of the structure to provide a second model of the structure, the second model of the structure based on a second set of parameters different from the first set of parameters; and providing a simulated spectrum derived from the second model of the structure. 16. The storage medium as in claim 15, the method further comprising:
comparing the simulated spectrum to a sample spectrum derived from the structure. 17. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reducing the degrees of freedom (DoF) of the first set of parameters to provide the second set of parameters. 18. The storage medium as in claim 17, wherein reducing the DoF of the first set of parameters comprises:
analyzing design of experiment (DoE) data; selecting an appropriate parameterization; and fixing parameters having a smallest variation or error. 19. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing geometric parameters or material parameters, or both, to provide the second set of parameters. 20. The storage medium as in claim 19, wherein reparameterizing geometric parameters comprises using bottom critical dimension (CD) and top CD of the structure in the first set of parameters and using, in their place, middle CD and sidewall angle of the structure in the second set of parameters. 21. The storage medium as in claim 15, wherein modifying the first model of the structure to provide the second model of the structure comprises reparameterizing non-geometric and non-material parameters to provide the second set of parameters, the non-geometric and non-material parameters selected from the group consisting of function+delta parameters, principal component analysis (PCA) parameters, and non-linear principal component analysis (NLPCA). 22. The storage medium as in claim 21, wherein the reparameterizing comprises using function+delta parameters in linear or non-linear parameter correlations. 23. The storage medium as in claim 22, wherein the reparameterizing comprises reducing a library size of the second set of parameters relative to the first set of parameters. 24. The storage medium as in claim 15, wherein modifying based on the set of process variations data comprises sampling a space defined by set of process variations data. 25. The storage medium as in claim 24, wherein providing the second model of the structure comprises performing a regression only in the space defined by set of process variations data. 26. The storage medium as in claim 24, wherein providing the second model of the structure comprises performing analysis of one or more of auto wavelength selection, auto truncation order (TO), or auto truncation order pattern selection (TOPS) only in the space defined by set of process variations data. 27. The storage medium as in claim 15, wherein determining the set of process variations data for the structure comprises obtaining actual process data or synthetic process data based on a process analysis, or both. 28. The storage medium as in claim 15, wherein modifying the first model of the structure based on the set of process variations data comprises estimating a geometric parameter error of fixing a parameter in the second set of parameters. 29. A system to generate a simulated diffraction signal to determine process parameters of a wafer application to fabricate a structure on a wafer using optical metrology, the system comprising:
a fabrication cluster configured to perform a wafer application to fabricate a structure on a wafer, wherein one or more process parameters characterize behavior of structure shape or layer thickness when the structure undergoes processing operations in the wafer application performed using the fabrication cluster; and an optical metrology system configured to determine the one or more process parameters of the wafer application, the optical metrology system comprising:
a beam source and detector configured to measure a diffraction signal of the structure; and
a processor configured to determine a first model of a structure, the first model based on a first set of parameters, configured to determine a set of process variations data for the structure, configured to modify the first model of the structure to provide a second model of the structure based on the set of process variations data, the second model of the structure based on a second set of parameters different from the first set of parameters, and configured to provide a simulated spectrum derived from the second model of the structure. 30. The system of claim 29, further comprising:
a library of simulated diffraction signals and values of one or more process parameters associated with the simulated diffraction signals, wherein the simulated diffraction signals were generated using values of one or more shape or film thickness parameters, and wherein the values of the one or more shape or film thickness parameters used to generate the simulated diffraction signals were derived from the values of the one or more process parameters associated with the simulated diffraction signals. | 2,100 |
5,230 | 14,948,679 | 2,124 | A computer implemented method, computer program product and system for generating a Bayesian network. A dataset comprising multiple instances of multiple variables is received. A target variable from the received dataset is selected. Multiple parent sets of variables for the target variable are determined, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables. For multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining multiple parent sets of variables for the new target variable is repeated. A Bayesian network (includes a directed acyclic graph of nodes and edges) is then generated for the variables such that one or more of the determined parent sets of variables for the target variables are inserted into the graph and edges from the graph are removed to ensure that the graph is acyclic. | 1. A computer implemented method for generating a Bayesian network, the method comprising:
receiving a dataset comprising multiple instances of multiple variables; selecting a target variable from the received dataset; determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables; repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and generating, by a processor, the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 2. The method as recited in claim 1, wherein the repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 3. The method as recited in claim 1, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises representing the parent set of variables as a path within a tree. 4. The method as recited in claim 3, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 5. The method as recited in claim 4, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. 6. A computer program product for generating a Bayesian network, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:
receiving a dataset comprising multiple instances of multiple variables; selecting a target variable from the received dataset; determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables; repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and generating the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 7. The computer program product as recited in claim 6, wherein the programming instructions for repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises programming instructions for repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 8. The computer program product as recited in claim 6, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises programming instructions for representing the parent set of variables as a path within a tree. 9. The computer program product as recited in claim 8, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises programming instructions for defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 10. The computer program product as recited in claim 9, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises programming instructions for minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. 11. A system, comprising:
a memory unit for storing a computer program for generating a Bayesian network; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising:
receiving a dataset comprising multiple instances of multiple variables;
selecting a target variable from the received dataset;
determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables;
repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and
generating the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 12. The system as recited in claim 11, wherein the program instructions for repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises program instructions for repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 13. The system as recited in claim 11, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises program instructions for representing the parent set of variables as a path within a tree. 14. The system as recited in claim 13, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises program instructions for defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 15. The system as recited in claim 14, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises program instructions for minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. | A computer implemented method, computer program product and system for generating a Bayesian network. A dataset comprising multiple instances of multiple variables is received. A target variable from the received dataset is selected. Multiple parent sets of variables for the target variable are determined, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables. For multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining multiple parent sets of variables for the new target variable is repeated. A Bayesian network (includes a directed acyclic graph of nodes and edges) is then generated for the variables such that one or more of the determined parent sets of variables for the target variables are inserted into the graph and edges from the graph are removed to ensure that the graph is acyclic.1. A computer implemented method for generating a Bayesian network, the method comprising:
receiving a dataset comprising multiple instances of multiple variables; selecting a target variable from the received dataset; determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables; repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and generating, by a processor, the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 2. The method as recited in claim 1, wherein the repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 3. The method as recited in claim 1, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises representing the parent set of variables as a path within a tree. 4. The method as recited in claim 3, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 5. The method as recited in claim 4, wherein the determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. 6. A computer program product for generating a Bayesian network, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:
receiving a dataset comprising multiple instances of multiple variables; selecting a target variable from the received dataset; determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables; repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and generating the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 7. The computer program product as recited in claim 6, wherein the programming instructions for repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises programming instructions for repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 8. The computer program product as recited in claim 6, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises programming instructions for representing the parent set of variables as a path within a tree. 9. The computer program product as recited in claim 8, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises programming instructions for defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 10. The computer program product as recited in claim 9, wherein the programming instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises programming instructions for minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. 11. A system, comprising:
a memory unit for storing a computer program for generating a Bayesian network; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising:
receiving a dataset comprising multiple instances of multiple variables;
selecting a target variable from the received dataset;
determining multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables;
repeating, for multiple variables of the received dataset, the selecting of a new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, and
generating the Bayesian network for the variables, the Bayesian network comprising a directed acyclic graph of nodes and edges, the generating including inserting one or more of the determined parent sets of variables for the target variables into the graph and removing edges from the graph to ensure that the graph is acyclic. 12. The system as recited in claim 11, wherein the program instructions for repeating, for multiple variables of the received dataset, the selecting of the new target variable from the received dataset and determining of multiple parent sets of variables for the new target variable, such that, for each parent set of variables, the new target variable is functionally dependent on the respective parent set of variables, comprises program instructions for repeating the selecting of the new target variable and determining of multiple parent sets of variables for the new target variable for all variables within the dataset for which such parent sets of variables can be generated. 13. The system as recited in claim 11, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, comprises program instructions for representing the parent set of variables as a path within a tree. 14. The system as recited in claim 13, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises program instructions for defining a starting path for the parent set of variables, transforming the starting path into a candidate path via a random modification of the path and checking the candidate path for a functional dependency between the parent set of variables defined by the candidate path and the target variable. 15. The system as recited in claim 14, wherein the program instructions for determining of multiple parent sets of variables for the target variable, such that, for each parent set of variables, the target variable is functionally dependent on the respective parent set of variables, further comprises program instructions for minimizing the candidate path by removing any parent variables that are not required for the functional dependency between the parent set of variables defined by the candidate path and the target variable. | 2,100 |
5,231 | 14,204,442 | 2,114 | A device receives, from a user device, a request to perform a test of software on a test device. The test device includes a device that simulates a device provided in a cloud computing environment, and the software includes software to be implemented in the cloud computing environment. The device determines whether the test device includes available resources to perform the test, and causes the request and the software to be provided to the test device when the test device includes the available resources to perform the test. The available resources are utilized to perform the test of the software and to generate results based on performance of the test. The device receives, from the test device, the results that include information indicating whether the software passed or failed the test. The device provides the results to the user device. | 1. A method, comprising:
receiving, by a device and from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determining, by the device, whether the test device includes one or more available resources to perform the test of the software; causing, by the device, the request and the software to be provided to the test device when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receiving, by the device and the from the test device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test; and
providing, by the device, the results to the user device. 2. The method of claim 1, further comprising:
providing the request in a queue of other requests to test other software on the test device, and where causing the request and the software to be provided to the test device comprises:
retrieving the request from the queue, and
causing the request, retrieved from the queue, and the software to be provided to the test device. 3. The method of claim 2, further comprising:
arranging the request and the other requests in the queue based on when the request and the other requests are received by the device. 4. The method of claim 1, further comprising:
preventing the one or more available resources of the test device, that are being utilized to perform the test of the software, from being utilized for other tests while the one or more available resources perform the test of the software. 5. The method of claim 4, further comprising:
enabling the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 6. The method of claim 1, where the software includes at least one of:
a virtual machine (VM) to be implemented in the cloud computing environment, an application to be implemented in the cloud computing environment, virtualized storage to be implemented in the cloud computing environment, or a hypervisor to be implemented in the cloud computing environment. 7. The method of claim 1, further comprising:
waiting a particular amount of time when the test device does not include the one or more available resources to perform the test of the software; and determining whether the test device includes the one or more available resources to perform the test of the software after the particular amount of time has elapsed. 8. A device, comprising:
a memory; and one or more processors to:
receive, from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determine whether the test device includes one or more available resources to perform the test of the software;
cause the request and the software to be provided to the test device, via a server device, when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receive, from the test device and via the server device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test;
store the results in the memory of the device; and
provide the results to the user device. 9. The device of claim 8, where the one or more processors are further to:
provide the request in a queue of other requests to test other software on the test device; and where, when causing the request and the software to be provided to the test device, the one or more processors are further to:
retrieve the request from the queue, and
cause the request, retrieved from the queue, and the software to be provided to the test device. 10. The device of claim 9, where the one or more processors are further to:
arrange the request and the other requests in the queue based on priorities associated with the request and the other requests. 11. The device of claim 8, where the one or more processors are further to:
prevent the one or more available resources of the test device from being utilized for other tests while the one or more available resources perform the test of the software. 12. The device of claim 11, where the one or more processors are further to:
enable the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 13. The device of claim 8, where the one or more processors are further to:
wait a particular amount of time when the test device does not include the one or more available resources to perform the test of the software; and determine whether the test device includes the one or more available resources to perform the test of the software after the particular amount of time has elapsed. 14. The device of claim 8, where, when providing the results, the one or more processors are further to:
provide the results on a web page,
the user device accessing the web page in order to display the results. 15. A computer-readable medium for storing instructions, the instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the one or more processors to:
receive, from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determine whether the test device includes one or more available resources to perform the test of the software;
cause the request and the software to be provided to the test device when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receive, from the test device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test; and
provide the results to the user device. 16. The computer-readable medium of claim 15, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the request in a queue of other requests to test other software on the test device;
retrieve the request from the queue; and
cause the request, retrieved from the queue, and the software to be provided to the test device. 17. The computer-readable medium of claim 16, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
arrange the request and the other requests in the queue based on priorities associated with the request and the other requests and in order based on when the request and the other requests are received. 18. The computer-readable medium of claim 15, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
prevent the one or more available resources of the test device from being utilized for other tests while the one or more available resources perform the test of the software; and
enable the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 19. The computer-readable medium of claim 15, where the software includes at least one of:
a virtual machine (VM) to be implemented in the cloud computing environment, an application to be implemented in the cloud computing environment, virtualized storage to be implemented in the cloud computing environment, or a hypervisor to be implemented in the cloud computing environment. 20. The computer-readable medium of claim 15, where the instructions that cause the one or more processors to provide the results further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the results on a web page,
the user device accessing the web page in order to display the results. | A device receives, from a user device, a request to perform a test of software on a test device. The test device includes a device that simulates a device provided in a cloud computing environment, and the software includes software to be implemented in the cloud computing environment. The device determines whether the test device includes available resources to perform the test, and causes the request and the software to be provided to the test device when the test device includes the available resources to perform the test. The available resources are utilized to perform the test of the software and to generate results based on performance of the test. The device receives, from the test device, the results that include information indicating whether the software passed or failed the test. The device provides the results to the user device.1. A method, comprising:
receiving, by a device and from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determining, by the device, whether the test device includes one or more available resources to perform the test of the software; causing, by the device, the request and the software to be provided to the test device when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receiving, by the device and the from the test device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test; and
providing, by the device, the results to the user device. 2. The method of claim 1, further comprising:
providing the request in a queue of other requests to test other software on the test device, and where causing the request and the software to be provided to the test device comprises:
retrieving the request from the queue, and
causing the request, retrieved from the queue, and the software to be provided to the test device. 3. The method of claim 2, further comprising:
arranging the request and the other requests in the queue based on when the request and the other requests are received by the device. 4. The method of claim 1, further comprising:
preventing the one or more available resources of the test device, that are being utilized to perform the test of the software, from being utilized for other tests while the one or more available resources perform the test of the software. 5. The method of claim 4, further comprising:
enabling the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 6. The method of claim 1, where the software includes at least one of:
a virtual machine (VM) to be implemented in the cloud computing environment, an application to be implemented in the cloud computing environment, virtualized storage to be implemented in the cloud computing environment, or a hypervisor to be implemented in the cloud computing environment. 7. The method of claim 1, further comprising:
waiting a particular amount of time when the test device does not include the one or more available resources to perform the test of the software; and determining whether the test device includes the one or more available resources to perform the test of the software after the particular amount of time has elapsed. 8. A device, comprising:
a memory; and one or more processors to:
receive, from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determine whether the test device includes one or more available resources to perform the test of the software;
cause the request and the software to be provided to the test device, via a server device, when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receive, from the test device and via the server device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test;
store the results in the memory of the device; and
provide the results to the user device. 9. The device of claim 8, where the one or more processors are further to:
provide the request in a queue of other requests to test other software on the test device; and where, when causing the request and the software to be provided to the test device, the one or more processors are further to:
retrieve the request from the queue, and
cause the request, retrieved from the queue, and the software to be provided to the test device. 10. The device of claim 9, where the one or more processors are further to:
arrange the request and the other requests in the queue based on priorities associated with the request and the other requests. 11. The device of claim 8, where the one or more processors are further to:
prevent the one or more available resources of the test device from being utilized for other tests while the one or more available resources perform the test of the software. 12. The device of claim 11, where the one or more processors are further to:
enable the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 13. The device of claim 8, where the one or more processors are further to:
wait a particular amount of time when the test device does not include the one or more available resources to perform the test of the software; and determine whether the test device includes the one or more available resources to perform the test of the software after the particular amount of time has elapsed. 14. The device of claim 8, where, when providing the results, the one or more processors are further to:
provide the results on a web page,
the user device accessing the web page in order to display the results. 15. A computer-readable medium for storing instructions, the instructions comprising:
one or more instructions that, when executed by one or more processors of a device, cause the one or more processors to:
receive, from a user device, a request to perform a test of software on a test device,
the test device including a device that simulates a device provided in a cloud computing environment, and
the software including software to be implemented in the cloud computing environment;
determine whether the test device includes one or more available resources to perform the test of the software;
cause the request and the software to be provided to the test device when the test device includes the one or more available resources to perform the test of the software,
the one or more available resources being utilized to perform the test of the software and to generate results based on the performance of the test of the software;
receive, from the test device, the results based on the performance of the test of the software,
the results including information indicating whether the software passed or failed the test; and
provide the results to the user device. 16. The computer-readable medium of claim 15, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the request in a queue of other requests to test other software on the test device;
retrieve the request from the queue; and
cause the request, retrieved from the queue, and the software to be provided to the test device. 17. The computer-readable medium of claim 16, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
arrange the request and the other requests in the queue based on priorities associated with the request and the other requests and in order based on when the request and the other requests are received. 18. The computer-readable medium of claim 15, where the instructions further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
prevent the one or more available resources of the test device from being utilized for other tests while the one or more available resources perform the test of the software; and
enable the one or more available resources of the test device to be utilized for other tests after the one or more available resources complete the test of the software. 19. The computer-readable medium of claim 15, where the software includes at least one of:
a virtual machine (VM) to be implemented in the cloud computing environment, an application to be implemented in the cloud computing environment, virtualized storage to be implemented in the cloud computing environment, or a hypervisor to be implemented in the cloud computing environment. 20. The computer-readable medium of claim 15, where the instructions that cause the one or more processors to provide the results further comprise:
one or more instructions that, when executed by the one or more processors, cause the one or more processors to:
provide the results on a web page,
the user device accessing the web page in order to display the results. | 2,100 |
5,232 | 14,731,141 | 2,159 | Disclosed herein are system, method, and computer program product embodiments for establishing communication channels related to assets. An embodiment enables users of home assets such as appliances to share content related to that asset through a centralized clearinghouse of asset content. Aggregated content reduces redundant searches across sources by many users looking for the same content. New data pathways from user to users, manufacturers, and various third parties are established through the connections created in relation to assets. | 1. A system, comprising:
an asset content database containing asset content related to an asset; an asset inventory database containing a first instance and a second instance of the asset, the first instance associated with a first account associated with a first property and the second instance associated with a second account, the first instance containing first asset content; and an asset server that provides a subset of first asset content to the second account based on the association of the first and second account to the asset. 2. The asset management system of claim 1, further comprising a registration module that registers the asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 3. The asset management system of claim 1, further comprising:
a re-registration module; wherein when the first account transfers the first asset instance to a third account, the re-registration module re-registers the asset with the manufacturer of the asset to the third account. 4. The asset management system of claim 1, further comprising an asset cataloging module that instantiates asset instances in the asset inventory database based on identifying information received from accounts. 5. The asset management system of claim 1, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based on the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 6. The asset management system of claim 1, further comprising a manufacturer business intelligence module that provides business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. 7. A method of delivering content from a first account associated with a first property to a second account, the method comprising:
instantiating first and second asset instances in an asset inventory database based on an asset in an asset content database, the first instance associated with the first asset account and the second instance associated with the second asset account; storing first asset content from the first asset account in the first asset instance; providing the first asset content to the second asset account by an asset server based on the association of the first and second account to the asset. 8. The method of claim 7, further comprising registering asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 9. The method of claim 7, further comprising re-registering assets when the first account transfers the first asset instance to a third account by re-registering the asset with the manufacturer of the asset to the third account. 10. The method of claim 7, further comprising instantiating asset instances in the asset inventory database based on identifying information received from accounts. 11. The method of claim 7, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based On the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 12. The method of claim 7, further comprising providing business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. 13. A computer readable storage medium having instructions encoded thereon, execution of which, by a processor, cause the processor to perform operations comprising:
instantiating first and second asset instances in an asset inventory database based on an asset in an asset content database, the first instance associated with the first asset account and the second instance associated with the second asset account; storing first asset content from the first asset account in the first asset instance; providing the first asset content to the second asset account by an asset server. 14. The computer readable storage medium of claim 13, further comprising registering asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 15. The computer readable storage medium of claim 13, further comprising re-registering assets when the first account transfers the first asset instance to a third account by re-registering the asset with the manufacturer of the asset to the third account, 16. The computer readable storage medium of claim 13, further comprising instantiating asset instances in the asset inventory database based on identifying information received from accounts. 17. The computer readable storage medium of claim 13, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based on the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 18. The computer readable storage medium of claim 13, further comprising providing business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. | Disclosed herein are system, method, and computer program product embodiments for establishing communication channels related to assets. An embodiment enables users of home assets such as appliances to share content related to that asset through a centralized clearinghouse of asset content. Aggregated content reduces redundant searches across sources by many users looking for the same content. New data pathways from user to users, manufacturers, and various third parties are established through the connections created in relation to assets.1. A system, comprising:
an asset content database containing asset content related to an asset; an asset inventory database containing a first instance and a second instance of the asset, the first instance associated with a first account associated with a first property and the second instance associated with a second account, the first instance containing first asset content; and an asset server that provides a subset of first asset content to the second account based on the association of the first and second account to the asset. 2. The asset management system of claim 1, further comprising a registration module that registers the asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 3. The asset management system of claim 1, further comprising:
a re-registration module; wherein when the first account transfers the first asset instance to a third account, the re-registration module re-registers the asset with the manufacturer of the asset to the third account. 4. The asset management system of claim 1, further comprising an asset cataloging module that instantiates asset instances in the asset inventory database based on identifying information received from accounts. 5. The asset management system of claim 1, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based on the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 6. The asset management system of claim 1, further comprising a manufacturer business intelligence module that provides business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. 7. A method of delivering content from a first account associated with a first property to a second account, the method comprising:
instantiating first and second asset instances in an asset inventory database based on an asset in an asset content database, the first instance associated with the first asset account and the second instance associated with the second asset account; storing first asset content from the first asset account in the first asset instance; providing the first asset content to the second asset account by an asset server based on the association of the first and second account to the asset. 8. The method of claim 7, further comprising registering asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 9. The method of claim 7, further comprising re-registering assets when the first account transfers the first asset instance to a third account by re-registering the asset with the manufacturer of the asset to the third account. 10. The method of claim 7, further comprising instantiating asset instances in the asset inventory database based on identifying information received from accounts. 11. The method of claim 7, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based On the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 12. The method of claim 7, further comprising providing business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. 13. A computer readable storage medium having instructions encoded thereon, execution of which, by a processor, cause the processor to perform operations comprising:
instantiating first and second asset instances in an asset inventory database based on an asset in an asset content database, the first instance associated with the first asset account and the second instance associated with the second asset account; storing first asset content from the first asset account in the first asset instance; providing the first asset content to the second asset account by an asset server. 14. The computer readable storage medium of claim 13, further comprising registering asset with the manufacturer of the asset to the first account when the first asset instance is instantiated in the asset inventory database 15. The computer readable storage medium of claim 13, further comprising re-registering assets when the first account transfers the first asset instance to a third account by re-registering the asset with the manufacturer of the asset to the third account, 16. The computer readable storage medium of claim 13, further comprising instantiating asset instances in the asset inventory database based on identifying information received from accounts. 17. The computer readable storage medium of claim 13, wherein the asset content database contains asset maintenance templates for each asset, and instance maintenance schedules are generated in asset instances based on the corresponding maintenance template in the asset inventory database upon instantiation, the instance maintenance schedules being editable by accounts. 18. The computer readable storage medium of claim 13, further comprising providing business intelligence data to asset manufacturers based on data gathered from the asset inventory database and the asset content database. | 2,100 |
5,233 | 12,500,756 | 2,168 | A contact center interface is provided by co-operation between a search engine and a contact center. A search query entered by a user into the search engine is passed to the contact center and the contact center determines from the search terms an appropriate skillset to deal with that user query, returning to the search engine a link enabling the user to initiate a direct communications session to a live agent or queue having that skillset expertise, thereby bypassing interactive voice response sessions which are normally required to ascertain the nature of a query. By providing multiple search options to the user, the user is empowered to select the best skillset, and the accuracy of future searches can be improved. | 1. A computer-implemented method of providing a user with access to a resource of a contact center, comprising the steps of:
(a) providing a search engine interface to a user's computer system for searching documents on one or more websites; (b) receiving a search query from the user's computer system via said interface; (c) sending a request based on said search query to a computerized system of a contact center; (d) receiving, in response to said request, data enabling a contact center link to be provided to said user, wherein said contact center link, when activated, initiates an interactive communications session between the user and a resource of the contact center; and (e) returning said contact center link to said user as part of a response to said search query. 2. A computer-implemented method as claimed in claim 1, further comprising the steps of conducting a search within said documents on one or more websites in response to said search query, and returning at least one document link to one of said documents as part of said response to said search query. 3. A computer-implemented method as claimed in claim 2, further comprising the step of formatting said response to said search query to display a first result set including said document link and a second result set including said contact center link. 4. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) enable a plurality of contact center links to be provided to said user. 5. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) comprise said contact center link. 6. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) comprise an identifier of a link cached by the search engine. 7. A computer-implemented method as claimed in claim 1, wherein said contact center link is generated uniquely for said user, whereby activation of the link initiates an interactive communications session recognisable by the contact center as relating to said request from said search engine. 8. A computer-implemented method as claimed in claim 1, wherein said request sent to said contact center includes an identifier of said user, whereby a subsequent interactive communications session between the user and a resource of the contact center arising from initiation of said contact center link enables the contact center to associate said interactive communications session with said request from the search engine. 9. A computer-implemented method as claimed in claim 8, wherein said identifier of said user is a network address of said user. 10. A computer-implemented method as claimed in claim 1, wherein said contact center link when activated, initiates an interactive communications session between the user and a predetermined agent of the contact center selected in response to said request. 11. A computer-implemented method as claimed in claim 1,wherein said contact center link when activated, initiates an interactive communications session between the user and a predetermined queue of agents of the contact center selected in response to said request. 12. A computer-implemented method as claimed in claim 1, wherein said link is configured to initiate a communications session from a compatible communications application, if such application is available on said user's computer. 13. A computer-implemented method as claimed in claim 12, wherein said communications application is a voice or video telephony application. 14. A computer-implemented method as claimed in claim 12, wherein said communications application is an instant messaging (IM) application. 15. A computer-implemented method as claimed in claim 12, wherein said communications application is integrated with a browser employed by the user to access the search engine interface. 17. A computer-implemented method as claimed in claim 1, wherein said contact center link contains parameters representing customer requirements which are passed to said contact center within an interactive communications session initiated on activation of said contact center link. 18. A computer-implemented method as claimed in claim 1, wherein said parameters are indicative of one or more skillset parameters employed by a management system of said contact center, whereby said communications session may be directly assigned to a skillset based on the parameters. 19. A computer program product comprising a program carrier encoding instructions which, when executed by a search engine computer system, are effective to cause said search engine computer system to:
(a) provide a search engine interface to a user's computer system for searching documents on one or more websites; (b) receive a search query from the user's computer system via said interface; (c) send a request based on said search query to a computerized system of a contact center; (d) receive, in response to said request, data enabling a contact center link to be provided to said user, wherein said contact center link, when activated, initiates an interactive communications session between the user and a resource of the contact center; and (e) return said contact center link to said user as part of a response to said search query. 20. A computer-implemented search engine system providing a user with access to a resource of a contact center, comprising:
(a) a server for providing a search engine interface to a user's computer system for searching documents on one or more websites and receiving a search query from the user's computer system via said interface; (b) an interface for providing communication with a computerized system of a contact center; (c) a request generator for formulating a request based on said search query for sending to said computerized system of a contact center; (d) a results generator for providing to said user a contact center link based on data received in response to said request, said contact center link being configured such that, when activated, it enables an interactive communications session between the user and a resource of the contact center. 21. A computer-implemented method of providing a user with access to a resource of a contact center, comprising the steps of:
(a) receiving from a search engine a request based on a search query submitted to the search engine by a user's computer system; (b) determining, from said request, the identity of at least one selected resource of the contact center based on stored rules; (c) sending to the search engine, in response to said request, data enabling a contact center link to be provided to said user, whereby said contact center link, when activated, will initiate an interactive communications session between the user and said selected resource of the contact center; (d) receiving, from said user, a communications session initiation from which said selected resource may be identified; and (e) directing said communications session to said selected resource. 22. A computer-implemented method as claimed in claim 21, wherein said data comprise an address of said selected resource, whereby activation of the link enables the user to initiate a communications session directly with said resource. 23. A computer-implemented method as claimed in claim 21, wherein said data comprises an identification, for inclusion in a contact center link to be returned to the user, of one or more skillset parameters employed by a management system of said contact center, whereby said communications session may be directly assigned to a skillset based on the parameters. 24. A computer-implemented method as claimed in claim 21, wherein said data comprises a unique identifier, for inclusion in a contact center link to be returned to the user, said unique identifier being assigned to said request received from said search engine, whereby a later communications session may be associated with said request based on said unique identifier being communicated within said communications session. 25. A computer-implemented method as claimed in claim 21, further comprising the step, carried out after having received a communications session initiation from the user, of amending the stored rules. 26. A computer-implemented method as claimed in claim 25, wherein the amendment of the stored rules confirms an association between the request received from the search engine and the resource identified in a contact center link activated by the user. 27. A computer-implemented method as claimed in claim 25, wherein the amendment of the stored rules confirms an association between the request received from the search engine and a resource of the contact center which is different from that specified in a contact center link activated by the user but to which the user's communications session is ultimately directed. 28. A computer program product comprising a program carrier encoding instructions which, when executed by a computer system of a contact center, are effective to cause the computer system to:
(a) receive from a search engine a request based on a search query submitted to the search engine by a user's computer system; (b) determine, from the request, the identity of at least one selected resource of the contact center based on stored rules; (c) send to the search engine, in response to the request, data enabling a contact center link to be provided to the user, whereby the contact center link, when activated, will initiate an interactive communications session between the user and the selected resource of the contact center; (d) receive, from the user, a communications session initiation from which the selected resource may be identified; and (e) direct the communications session to the selected resource. 29. A computer-implemented contact center system for providing users with access to a resource of a contact center system, comprising
(a) an interface for receiving from a search engine a request based on a search query submitted to the search engine by a user's computer system and for returning data to the search engine in response to the request; (b) a storage area storing rules for determining, from the request, the identity of at least one selected resource of the contact center based on stored rules; and (c) processing means programmed to determine the identity of at least one selected resource of the contact center based on the stored rules and to generate data enabling a contact center link to be provided to the user, whereby the contact center link, when activated, will initiate an interactive communications session between the user and the selected resource of the contact center;
wherein the processor is operably connected to the interface to receive the request therefrom and to provide the data thereto. | A contact center interface is provided by co-operation between a search engine and a contact center. A search query entered by a user into the search engine is passed to the contact center and the contact center determines from the search terms an appropriate skillset to deal with that user query, returning to the search engine a link enabling the user to initiate a direct communications session to a live agent or queue having that skillset expertise, thereby bypassing interactive voice response sessions which are normally required to ascertain the nature of a query. By providing multiple search options to the user, the user is empowered to select the best skillset, and the accuracy of future searches can be improved.1. A computer-implemented method of providing a user with access to a resource of a contact center, comprising the steps of:
(a) providing a search engine interface to a user's computer system for searching documents on one or more websites; (b) receiving a search query from the user's computer system via said interface; (c) sending a request based on said search query to a computerized system of a contact center; (d) receiving, in response to said request, data enabling a contact center link to be provided to said user, wherein said contact center link, when activated, initiates an interactive communications session between the user and a resource of the contact center; and (e) returning said contact center link to said user as part of a response to said search query. 2. A computer-implemented method as claimed in claim 1, further comprising the steps of conducting a search within said documents on one or more websites in response to said search query, and returning at least one document link to one of said documents as part of said response to said search query. 3. A computer-implemented method as claimed in claim 2, further comprising the step of formatting said response to said search query to display a first result set including said document link and a second result set including said contact center link. 4. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) enable a plurality of contact center links to be provided to said user. 5. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) comprise said contact center link. 6. A computer-implemented method as claimed in claim 1, wherein said data received in step (d) comprise an identifier of a link cached by the search engine. 7. A computer-implemented method as claimed in claim 1, wherein said contact center link is generated uniquely for said user, whereby activation of the link initiates an interactive communications session recognisable by the contact center as relating to said request from said search engine. 8. A computer-implemented method as claimed in claim 1, wherein said request sent to said contact center includes an identifier of said user, whereby a subsequent interactive communications session between the user and a resource of the contact center arising from initiation of said contact center link enables the contact center to associate said interactive communications session with said request from the search engine. 9. A computer-implemented method as claimed in claim 8, wherein said identifier of said user is a network address of said user. 10. A computer-implemented method as claimed in claim 1, wherein said contact center link when activated, initiates an interactive communications session between the user and a predetermined agent of the contact center selected in response to said request. 11. A computer-implemented method as claimed in claim 1,wherein said contact center link when activated, initiates an interactive communications session between the user and a predetermined queue of agents of the contact center selected in response to said request. 12. A computer-implemented method as claimed in claim 1, wherein said link is configured to initiate a communications session from a compatible communications application, if such application is available on said user's computer. 13. A computer-implemented method as claimed in claim 12, wherein said communications application is a voice or video telephony application. 14. A computer-implemented method as claimed in claim 12, wherein said communications application is an instant messaging (IM) application. 15. A computer-implemented method as claimed in claim 12, wherein said communications application is integrated with a browser employed by the user to access the search engine interface. 17. A computer-implemented method as claimed in claim 1, wherein said contact center link contains parameters representing customer requirements which are passed to said contact center within an interactive communications session initiated on activation of said contact center link. 18. A computer-implemented method as claimed in claim 1, wherein said parameters are indicative of one or more skillset parameters employed by a management system of said contact center, whereby said communications session may be directly assigned to a skillset based on the parameters. 19. A computer program product comprising a program carrier encoding instructions which, when executed by a search engine computer system, are effective to cause said search engine computer system to:
(a) provide a search engine interface to a user's computer system for searching documents on one or more websites; (b) receive a search query from the user's computer system via said interface; (c) send a request based on said search query to a computerized system of a contact center; (d) receive, in response to said request, data enabling a contact center link to be provided to said user, wherein said contact center link, when activated, initiates an interactive communications session between the user and a resource of the contact center; and (e) return said contact center link to said user as part of a response to said search query. 20. A computer-implemented search engine system providing a user with access to a resource of a contact center, comprising:
(a) a server for providing a search engine interface to a user's computer system for searching documents on one or more websites and receiving a search query from the user's computer system via said interface; (b) an interface for providing communication with a computerized system of a contact center; (c) a request generator for formulating a request based on said search query for sending to said computerized system of a contact center; (d) a results generator for providing to said user a contact center link based on data received in response to said request, said contact center link being configured such that, when activated, it enables an interactive communications session between the user and a resource of the contact center. 21. A computer-implemented method of providing a user with access to a resource of a contact center, comprising the steps of:
(a) receiving from a search engine a request based on a search query submitted to the search engine by a user's computer system; (b) determining, from said request, the identity of at least one selected resource of the contact center based on stored rules; (c) sending to the search engine, in response to said request, data enabling a contact center link to be provided to said user, whereby said contact center link, when activated, will initiate an interactive communications session between the user and said selected resource of the contact center; (d) receiving, from said user, a communications session initiation from which said selected resource may be identified; and (e) directing said communications session to said selected resource. 22. A computer-implemented method as claimed in claim 21, wherein said data comprise an address of said selected resource, whereby activation of the link enables the user to initiate a communications session directly with said resource. 23. A computer-implemented method as claimed in claim 21, wherein said data comprises an identification, for inclusion in a contact center link to be returned to the user, of one or more skillset parameters employed by a management system of said contact center, whereby said communications session may be directly assigned to a skillset based on the parameters. 24. A computer-implemented method as claimed in claim 21, wherein said data comprises a unique identifier, for inclusion in a contact center link to be returned to the user, said unique identifier being assigned to said request received from said search engine, whereby a later communications session may be associated with said request based on said unique identifier being communicated within said communications session. 25. A computer-implemented method as claimed in claim 21, further comprising the step, carried out after having received a communications session initiation from the user, of amending the stored rules. 26. A computer-implemented method as claimed in claim 25, wherein the amendment of the stored rules confirms an association between the request received from the search engine and the resource identified in a contact center link activated by the user. 27. A computer-implemented method as claimed in claim 25, wherein the amendment of the stored rules confirms an association between the request received from the search engine and a resource of the contact center which is different from that specified in a contact center link activated by the user but to which the user's communications session is ultimately directed. 28. A computer program product comprising a program carrier encoding instructions which, when executed by a computer system of a contact center, are effective to cause the computer system to:
(a) receive from a search engine a request based on a search query submitted to the search engine by a user's computer system; (b) determine, from the request, the identity of at least one selected resource of the contact center based on stored rules; (c) send to the search engine, in response to the request, data enabling a contact center link to be provided to the user, whereby the contact center link, when activated, will initiate an interactive communications session between the user and the selected resource of the contact center; (d) receive, from the user, a communications session initiation from which the selected resource may be identified; and (e) direct the communications session to the selected resource. 29. A computer-implemented contact center system for providing users with access to a resource of a contact center system, comprising
(a) an interface for receiving from a search engine a request based on a search query submitted to the search engine by a user's computer system and for returning data to the search engine in response to the request; (b) a storage area storing rules for determining, from the request, the identity of at least one selected resource of the contact center based on stored rules; and (c) processing means programmed to determine the identity of at least one selected resource of the contact center based on the stored rules and to generate data enabling a contact center link to be provided to the user, whereby the contact center link, when activated, will initiate an interactive communications session between the user and the selected resource of the contact center;
wherein the processor is operably connected to the interface to receive the request therefrom and to provide the data thereto. | 2,100 |
5,234 | 15,088,466 | 2,196 | Embodiments include methods, systems and computer programs for deployment and execution of tasks in a network of computing devices. Aspects include creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements and transmitting the task representation to at least one member of the network of computing devices. Aspects also include selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation and deploying each of the set of computing and sensing programs of the task to the selected computing devices. | 1. A computer implemented method for deployment and execution of tasks in a network of computing devices, the computer implemented method comprises:
creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmitting the task representation to at least one member of the network of computing devices; selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploying each of the set of computing and sensing programs of the task to the selected computing devices. 2. The computer implemented method of claim 1, wherein selecting a plurality of computing devices includes identifying one or more candidate computing devices in the network based on one or more characteristics of the one or more candidate computing devices and the computing requirements, the data requirements, and the context requirements of the task. 3. The computer implemented method of claim 1, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. 4. The computer implemented method of claim 2, wherein at least one of the computing programs is transmitted to two or more candidate computing devices in the computing network. 5. The computer implemented method of claim 2, wherein the one or more characteristics of the one or more candidate computing devices comprises at least one of a processing capacity, a storage capacity, a communication bandwidth capacity, an available power level, one or more available sensors, and a location. 6. The computer implemented method of claim 2, further comprising monitoring a presence of an identified candidate computing device in the network. 7. The computer implemented method of claim 6, further comprising re-transmitting a computing program to another candidate computing device based on a determination that the identified candidate computing device has left the network. 8. The computer implemented method of claim 1, wherein transmitting the task representation to at least one member of the network for execution comprises transmitting a network location of the set of computing programs. 9. The computer implemented method of claim 1, wherein selecting the plurality of computing devices in the computing network that match one of the computing requirement includes negotiating an incentive for execution of the task between the requester device and the matched computing devices. 10. A computer program product for deployment and execution of tasks in a network of computing devices, the computer program product comprising:
a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmitting the task representation to at least one member of the network of computing devices; selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploying each of the set of computing and sensing programs of the task to the selected computing devices. 11. The computer program product of claim 10, wherein selecting a plurality of computing devices includes identifying one or more candidate computing devices in the network based on one or more characteristics of the one or more candidate computing devices and the computing requirements, the data requirements, and the context requirements of the task. 12. The computer program product of claim 10, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. 13. The computer program product of claim 11, wherein at least one of the computing programs is transmitted to two or more candidate computing devices in the computing network. 14. The computer program product of claim 11, wherein the one or more characteristics of the one or more candidate computing devices comprises at least one of a processing capacity, a storage capacity, a communication bandwidth capacity, an available power level, one or more available sensors, and a location. 15. The computer program product of claim 11, wherein the method further comprises monitoring a presence of an identified candidate computing device in the network. 16. The computer program product of claim 15, wherein the method further comprises re-transmitting a computing program to another candidate computing device based on a determination that the identified candidate computing device has left the network. 17. The computer program product of claim 10, wherein transmitting the task representation to at least one member of the network for execution comprises transmitting a network location of the set of computing programs. 18. The computer program product of claim 12, wherein selecting the plurality of computing devices in the computing network that match one of the computing requirement includes negotiating an incentive for execution of the task between the requester device and the matched computing devices. 19. A network of computing devices for deployment and execution of tasks includes a computing device having processor in communication with one or more types of memory, the processor configured to:
create a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmit the task representation to at least one member of the network of computing devices; select a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploy each of the set of computing and sensing programs of the task to the selected computing devices. 20. The network of claim 19, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. | Embodiments include methods, systems and computer programs for deployment and execution of tasks in a network of computing devices. Aspects include creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements and transmitting the task representation to at least one member of the network of computing devices. Aspects also include selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation and deploying each of the set of computing and sensing programs of the task to the selected computing devices.1. A computer implemented method for deployment and execution of tasks in a network of computing devices, the computer implemented method comprises:
creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmitting the task representation to at least one member of the network of computing devices; selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploying each of the set of computing and sensing programs of the task to the selected computing devices. 2. The computer implemented method of claim 1, wherein selecting a plurality of computing devices includes identifying one or more candidate computing devices in the network based on one or more characteristics of the one or more candidate computing devices and the computing requirements, the data requirements, and the context requirements of the task. 3. The computer implemented method of claim 1, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. 4. The computer implemented method of claim 2, wherein at least one of the computing programs is transmitted to two or more candidate computing devices in the computing network. 5. The computer implemented method of claim 2, wherein the one or more characteristics of the one or more candidate computing devices comprises at least one of a processing capacity, a storage capacity, a communication bandwidth capacity, an available power level, one or more available sensors, and a location. 6. The computer implemented method of claim 2, further comprising monitoring a presence of an identified candidate computing device in the network. 7. The computer implemented method of claim 6, further comprising re-transmitting a computing program to another candidate computing device based on a determination that the identified candidate computing device has left the network. 8. The computer implemented method of claim 1, wherein transmitting the task representation to at least one member of the network for execution comprises transmitting a network location of the set of computing programs. 9. The computer implemented method of claim 1, wherein selecting the plurality of computing devices in the computing network that match one of the computing requirement includes negotiating an incentive for execution of the task between the requester device and the matched computing devices. 10. A computer program product for deployment and execution of tasks in a network of computing devices, the computer program product comprising:
a non-transitory storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: creating by a requester device of a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmitting the task representation to at least one member of the network of computing devices; selecting a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploying each of the set of computing and sensing programs of the task to the selected computing devices. 11. The computer program product of claim 10, wherein selecting a plurality of computing devices includes identifying one or more candidate computing devices in the network based on one or more characteristics of the one or more candidate computing devices and the computing requirements, the data requirements, and the context requirements of the task. 12. The computer program product of claim 10, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. 13. The computer program product of claim 11, wherein at least one of the computing programs is transmitted to two or more candidate computing devices in the computing network. 14. The computer program product of claim 11, wherein the one or more characteristics of the one or more candidate computing devices comprises at least one of a processing capacity, a storage capacity, a communication bandwidth capacity, an available power level, one or more available sensors, and a location. 15. The computer program product of claim 11, wherein the method further comprises monitoring a presence of an identified candidate computing device in the network. 16. The computer program product of claim 15, wherein the method further comprises re-transmitting a computing program to another candidate computing device based on a determination that the identified candidate computing device has left the network. 17. The computer program product of claim 10, wherein transmitting the task representation to at least one member of the network for execution comprises transmitting a network location of the set of computing programs. 18. The computer program product of claim 12, wherein selecting the plurality of computing devices in the computing network that match one of the computing requirement includes negotiating an incentive for execution of the task between the requester device and the matched computing devices. 19. A network of computing devices for deployment and execution of tasks includes a computing device having processor in communication with one or more types of memory, the processor configured to:
create a task for deployment and execution in the network wherein the task is composed of a set of computing and sensing programs and a task representation that includes at least one of computing requirements, data requirements, and context requirements; transmit the task representation to at least one member of the network of computing devices; select a plurality of computing devices in the network that match at least one of the computing requirements, the data requirements, and the context requirements in the task representation; and deploy each of the set of computing and sensing programs of the task to the selected computing devices. 20. The network of claim 19, wherein the task representation includes a plurality of sub-tasks wherein each of the plurality of sub-tasks includes at least one of the set of computing and sensing programs and at least one of the computing requirements, data requirements, and the context requirements. | 2,100 |
5,235 | 13,338,374 | 2,128 | A method of generating a multi-dimensional surface model of a geometric structure is provided. The method comprises acquiring a set of location data points comprising a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure. The method further comprises defining a bounding box containing each location data point of the set of location data points, and constructing a voxel grid based on the bounding box, wherein the voxel grid comprises a plurality of voxels. The method still further comprises extracting a multi-faceted surface model from certain of the plurality of voxels of the voxel grid using, for example, an alpha-hull approximation technique. The method may further comprise one or more of decimating and smoothing the surface of the multi-faceted surface model. A system comprising a processing apparatus for performing the aforedescribed method is also provided. | 1. A system for generating a multi-dimensional surface model of a geometric structure, comprising
a processing apparatus configured to:
acquire a set of location data points comprising a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure;
define a bounding box containing each location data point of said set of location data points;
construct a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and
extract a multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 2. The system of claim 1, wherein said multi-faceted surface model comprises an alpha-hull approximation of said certain voxels of said plurality of voxels. 3. The system of claim 1, wherein said processing apparatus is configured to at least one of:
decimate the surface of said multi-faceted surface model to remove excess facets therefrom; and smooth said surface of said multi-faceted surface model. 4. The system of claim 3, wherein said processing apparatus is configured to decimate the surface of said multi-faceted surface model, said processing apparatus further configured to:
create a decimation queue containing each vertex of said multi-faceted surface model that meets at least one predetermined decimation criterion; prioritize said vertices in said decimation queue; select the highest priority vertex in said decimation queue; determine a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapse said highest priority edge by deleting said highest priority vertex from said multi-faceted surface model, and moving all edges of said multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 5. A computer-implemented method of generating a multi-faceted surface model of a geometric structure, said method comprising:
acquiring a set of location data points comprised of a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure; defining a bounding box containing each location data point of said set of location data points; constructing a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and extracting a multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 6. The method of claim 5, wherein said extracting step comprises extracting an alpha-hull approximation of said certain voxels of said plurality of voxels. 7. The method of claim 5 further comprising at least one of
decimating the surface of said multi-faceted surface model to remove excess facets therefrom; and
smoothing said surface of said multi-faceted surface model. 8. The method of claim 7, wherein said method comprises decimating the surface of said multi-faceted surface model, said decimating step comprising:
creating a decimation queue containing each vertex of said multi-faceted surface model that meets at least one predetermined decimation criterion; prioritizing said vertices in said decimation queue; selecting the highest priority vertex in said decimation queue; determining a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapsing said highest priority edge by deleting said highest priority vertex from said multi-faceted surface model, and moving all edges of said multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 9. A system for generating a composite surface model of a geometric structure from a plurality of multi-faceted surfaces, comprising
a processing apparatus configured to:
define a bounding box containing each vertex of the plurality of multi-faceted surfaces;
construct a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and
extract a composite multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 10. The system of claim 9, wherein said processing apparatus is configured to generate said plurality of multi-faceted surfaces. 11. The system of claim 9, wherein said processing apparatus is further configured to extract said composite surface model using a Marching Cubes algorithm. 12. The system of claim 9, wherein said processing apparatus is further configured to at least one of:
decimate the surface of said composite multi-faceted surface model to remove excess facets therefrom; and smooth said surface of said composite multi-faceted surface model. 13. The system of claim 12, wherein said processing apparatus is configured to decimate the surface of said composite multi-faceted surface model, said processing apparatus further configured to:
create a decimation queue containing each vertex of said composite multi-faceted surface model that meets at least one predetermined decimation criterion; prioritize said vertices in said decimation queue; select the highest priority vertex in said decimation queue; determine a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapse said highest priority edge by deleting said highest priority vertex from said composite multi-faceted surface model, and moving all edges of said composite multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 14. A method of generating a composite surface model of a geometric structure from a plurality of multi-faceted surfaces, comprising the steps of:
defining a bounding box containing each vertex of the plurality of multi-faceted surfaces; constructing a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and extracting a composite multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 15. The method of claim 14 further comprising generating said plurality of multi-faceted surfaces. 16. The method of claim 14, wherein said extracting step comprises extracting said composite surface model using a Marching Cubes algorithm. 17. The method of claim 14 further comprising the steps of:
decimating the surface of said composite multi-faceted surface model to remove excess facets therefrom; and
smoothing said surface of said composite multi-faceted surface model. 18. The method of claim 17, wherein said method comprises decimating the surface of said composite surface model, said decimating step comprising:
creating a decimation queue containing each vertex of said composite multi-faceted surface model that meets at least one predetermined decimation criterion; prioritizing said vertices in said decimation queue; selecting the highest priority vertex in said decimation queue; determining a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapsing said highest priority edge by deleting said highest priority vertex from said composite multi-faceted surface model, and moving all edges of said composite multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 19. A computer-implemented method for generating a multi-dimensional surface model of a geometric structure, comprising the steps of
acquiring first and second sets of location data points, said first set comprising a plurality of location data points corresponding to respective locations on the surface of a first region of said geometric structure, and said second set comprising a plurality of location data points corresponding to respective locations on the surface of a second region of said geometric structure; constructing first and second voxel grids corresponding to said first and second sets of location data points, respectively, wherein each voxel grid comprises a plurality of voxels; generating a first multi-dimensional surface model for said first region from certain of said plurality of voxels of said first voxel grid, and a second multi-dimensional surface model for said second region from certain of said plurality of voxels of said second voxel grid; and joining said first and second surface models together to form a composite multi-dimensional surface model. 20. The method of claim 19, wherein said acquiring step comprises the substep of collecting, by a sensor, said first and second sets of said location data points from the surfaces of said first and second regions of said geometric structure. 21. The method of claim 19, wherein said joining step comprises the substeps of:
constructing a third voxel grid corresponding to and containing said first and second surface models, wherein said third voxel grid comprises a plurality of voxels; and generating said composite surface model from certain of said plurality of voxels of said third voxel grid. 22. The method of claim 21, wherein said composite surface model comprises a multi-faceted surface, and said method further comprises at least one of:
decimating said multi-faceted surface to remove excess facets therefrom; and smoothing said multi-faceted surface. 23. The method of claim 19, wherein each of said first and second multi-dimensional surface models comprises a multi-faceted surface, said method further comprising at least one of:
decimating said multi-faceted surfaces of said first and second surface models to remove excess facets therefrom; and smoothing said multi-faceted surfaces of said first and second surface models. 24. The method of claim 19, wherein said step of generating said first and second multi-dimensional surface models comprises calculating the alpha-hull approximations from said certain of said plurality of voxels of said first voxel grid and said certain of said plurality of voxels of said second voxel grid, respectively. 25. The method of claim 19, wherein said step of joining said first and second surface models together to form a composite surface model comprises computing a Boolean Union approximation of said first and second surface models. | A method of generating a multi-dimensional surface model of a geometric structure is provided. The method comprises acquiring a set of location data points comprising a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure. The method further comprises defining a bounding box containing each location data point of the set of location data points, and constructing a voxel grid based on the bounding box, wherein the voxel grid comprises a plurality of voxels. The method still further comprises extracting a multi-faceted surface model from certain of the plurality of voxels of the voxel grid using, for example, an alpha-hull approximation technique. The method may further comprise one or more of decimating and smoothing the surface of the multi-faceted surface model. A system comprising a processing apparatus for performing the aforedescribed method is also provided.1. A system for generating a multi-dimensional surface model of a geometric structure, comprising
a processing apparatus configured to:
acquire a set of location data points comprising a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure;
define a bounding box containing each location data point of said set of location data points;
construct a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and
extract a multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 2. The system of claim 1, wherein said multi-faceted surface model comprises an alpha-hull approximation of said certain voxels of said plurality of voxels. 3. The system of claim 1, wherein said processing apparatus is configured to at least one of:
decimate the surface of said multi-faceted surface model to remove excess facets therefrom; and smooth said surface of said multi-faceted surface model. 4. The system of claim 3, wherein said processing apparatus is configured to decimate the surface of said multi-faceted surface model, said processing apparatus further configured to:
create a decimation queue containing each vertex of said multi-faceted surface model that meets at least one predetermined decimation criterion; prioritize said vertices in said decimation queue; select the highest priority vertex in said decimation queue; determine a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapse said highest priority edge by deleting said highest priority vertex from said multi-faceted surface model, and moving all edges of said multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 5. A computer-implemented method of generating a multi-faceted surface model of a geometric structure, said method comprising:
acquiring a set of location data points comprised of a plurality of location data points corresponding to respective locations on the surface of a region of the geometric structure; defining a bounding box containing each location data point of said set of location data points; constructing a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and extracting a multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 6. The method of claim 5, wherein said extracting step comprises extracting an alpha-hull approximation of said certain voxels of said plurality of voxels. 7. The method of claim 5 further comprising at least one of
decimating the surface of said multi-faceted surface model to remove excess facets therefrom; and
smoothing said surface of said multi-faceted surface model. 8. The method of claim 7, wherein said method comprises decimating the surface of said multi-faceted surface model, said decimating step comprising:
creating a decimation queue containing each vertex of said multi-faceted surface model that meets at least one predetermined decimation criterion; prioritizing said vertices in said decimation queue; selecting the highest priority vertex in said decimation queue; determining a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapsing said highest priority edge by deleting said highest priority vertex from said multi-faceted surface model, and moving all edges of said multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 9. A system for generating a composite surface model of a geometric structure from a plurality of multi-faceted surfaces, comprising
a processing apparatus configured to:
define a bounding box containing each vertex of the plurality of multi-faceted surfaces;
construct a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and
extract a composite multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 10. The system of claim 9, wherein said processing apparatus is configured to generate said plurality of multi-faceted surfaces. 11. The system of claim 9, wherein said processing apparatus is further configured to extract said composite surface model using a Marching Cubes algorithm. 12. The system of claim 9, wherein said processing apparatus is further configured to at least one of:
decimate the surface of said composite multi-faceted surface model to remove excess facets therefrom; and smooth said surface of said composite multi-faceted surface model. 13. The system of claim 12, wherein said processing apparatus is configured to decimate the surface of said composite multi-faceted surface model, said processing apparatus further configured to:
create a decimation queue containing each vertex of said composite multi-faceted surface model that meets at least one predetermined decimation criterion; prioritize said vertices in said decimation queue; select the highest priority vertex in said decimation queue; determine a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapse said highest priority edge by deleting said highest priority vertex from said composite multi-faceted surface model, and moving all edges of said composite multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 14. A method of generating a composite surface model of a geometric structure from a plurality of multi-faceted surfaces, comprising the steps of:
defining a bounding box containing each vertex of the plurality of multi-faceted surfaces; constructing a voxel grid corresponding to said bounding box, wherein said voxel grid comprises a plurality of voxels; and extracting a composite multi-faceted surface model from certain of said plurality of voxels of said voxel grid. 15. The method of claim 14 further comprising generating said plurality of multi-faceted surfaces. 16. The method of claim 14, wherein said extracting step comprises extracting said composite surface model using a Marching Cubes algorithm. 17. The method of claim 14 further comprising the steps of:
decimating the surface of said composite multi-faceted surface model to remove excess facets therefrom; and
smoothing said surface of said composite multi-faceted surface model. 18. The method of claim 17, wherein said method comprises decimating the surface of said composite surface model, said decimating step comprising:
creating a decimation queue containing each vertex of said composite multi-faceted surface model that meets at least one predetermined decimation criterion; prioritizing said vertices in said decimation queue; selecting the highest priority vertex in said decimation queue; determining a highest priority edge containing said highest priority vertex, said highest prior edge containing said highest priority vertex and a neighboring vertex; and collapsing said highest priority edge by deleting said highest priority vertex from said composite multi-faceted surface model, and moving all edges of said composite multi-faceted surface model incident to said highest priority vertex to said neighboring vertex. 19. A computer-implemented method for generating a multi-dimensional surface model of a geometric structure, comprising the steps of
acquiring first and second sets of location data points, said first set comprising a plurality of location data points corresponding to respective locations on the surface of a first region of said geometric structure, and said second set comprising a plurality of location data points corresponding to respective locations on the surface of a second region of said geometric structure; constructing first and second voxel grids corresponding to said first and second sets of location data points, respectively, wherein each voxel grid comprises a plurality of voxels; generating a first multi-dimensional surface model for said first region from certain of said plurality of voxels of said first voxel grid, and a second multi-dimensional surface model for said second region from certain of said plurality of voxels of said second voxel grid; and joining said first and second surface models together to form a composite multi-dimensional surface model. 20. The method of claim 19, wherein said acquiring step comprises the substep of collecting, by a sensor, said first and second sets of said location data points from the surfaces of said first and second regions of said geometric structure. 21. The method of claim 19, wherein said joining step comprises the substeps of:
constructing a third voxel grid corresponding to and containing said first and second surface models, wherein said third voxel grid comprises a plurality of voxels; and generating said composite surface model from certain of said plurality of voxels of said third voxel grid. 22. The method of claim 21, wherein said composite surface model comprises a multi-faceted surface, and said method further comprises at least one of:
decimating said multi-faceted surface to remove excess facets therefrom; and smoothing said multi-faceted surface. 23. The method of claim 19, wherein each of said first and second multi-dimensional surface models comprises a multi-faceted surface, said method further comprising at least one of:
decimating said multi-faceted surfaces of said first and second surface models to remove excess facets therefrom; and smoothing said multi-faceted surfaces of said first and second surface models. 24. The method of claim 19, wherein said step of generating said first and second multi-dimensional surface models comprises calculating the alpha-hull approximations from said certain of said plurality of voxels of said first voxel grid and said certain of said plurality of voxels of said second voxel grid, respectively. 25. The method of claim 19, wherein said step of joining said first and second surface models together to form a composite surface model comprises computing a Boolean Union approximation of said first and second surface models. | 2,100 |
5,236 | 14,162,571 | 2,126 | Apparatuses, systems, methods, and computer program products are disclosed for a machine learning generated action plan. A machine learning module is configured to process different instances of data using machine learning to produce one or more results. The different instances of data may comprise different values for one or more actionable features. A recommended action module is configured to select one or more recommended actions for achieving a goal associated with the machine learning. The recommended action module may select the one or more recommended actions based on the one or more results. An action plan interface module is configured to provide an action plan associated with the one or more recommended actions. | 1. A method for an action plan, the method comprising:
processing different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more actionable features; selecting one or more recommended actions based on the one or more results; and providing an action plan associated with the one or more recommended actions. 2. The method of claim 1, wherein the one or more recommended actions are selected for achieving a goal associated with the machine learning. 3. The method of claim 1, wherein the one or more recommended actions are selected based on one or more of a confidence metric associated with the one or more results and a predicted outcome associated with the one or more recommended actions. 4. The method of claim 1, further comprising varying values of one or more non-actionable features for the different instances of data. 5. The method of claim 4, wherein the one or more recommended actions include a recommendation for data collection associated with the one or more non-actionable features. 6. The method of claim 1, further comprising storing the one or more results in a results data structure indexed by one or more of the one or more actionable features and the different instances of data. 7. The method of claim 6, further comprising dynamically updating the provided action plan based on the stored one or more results in response to user input changing one or more machine learning parameters associated with the action plan. 8. The method of claim 7, wherein the one or more machine learning parameters comprise one or more of: a value for an actionable feature; a recommended action; a target for a recommended action; a count for a recommended action; an action time for a recommended action; a cost for a recommended action; and a predicted outcome for a recommended action. 9. The method of claim 1, wherein the action plan comprises one or more lists of target subjects for the one or more recommended actions, the target subjects in the one or more lists ordered by confidence metrics generated by the machine learning for the target subjects. 10. The method of claim 1, wherein processing the different instances comprises predetermining, using the machine learning, permutations of the one or more results at predefined increments between one or more minimum values for the one or more actionable features and one or more maximum values for the one or more actionable features. 11. The method of claim 1, further comprising increasing one or more of a range of and a frequency of the different values for the one or more actionable features until the one or more results satisfy a predefined threshold. 12. The method of claim 11, wherein the one or more results satisfy the predefined threshold in response to determining a predictable relationship between at least one set of adjacent results. 13. The method of claim 1, further comprising generating the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. 14. The method of claim 13, wherein the machine learning comprises a different predictive program for each different recommended action, the different instances of data processed based on one or more dependent relationships between the different predictive programs. 15. The method of claim 1, further comprising fitting the one or more recommended actions to an action function, the action plan comprising the action function. 16. The method of claim 15, wherein the action function interpolates recommended actions between the one or more recommended actions. 17. An apparatus for an action plan, the apparatus comprising:
a machine learning module configured to process different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more features, the one or more results comprising at least one of a confidence metric and a predicted outcome; a recommended action module configured to select one or more recommended actions for achieving a goal associated with the machine learning, the recommended action module selecting the one or more recommended actions based on the one or more results; and an action plan interface module configured to provide an action plan associated with the one or more recommended actions. 18. The apparatus of claim 17, further comprising a pre-compute module configured to store the one or more results in a results data structure indexed by the one or more features and the different instances of data. 19. The apparatus of claim 18, further comprising an update module configured to dynamically update the provided action plan based on the stored one or more results in response to user input changing one or more machine learning parameters associated with the action plan. 20. The apparatus of claim 17, further comprising a predictive compiler module configured to generate the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. 21. An apparatus for an action plan, the apparatus comprising:
means for processing different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more features; means for selecting one or more recommended actions based on the one or more results; and means for providing an action plan comprising the one or more recommended actions and one or more target subjects for the one or more recommended actions. 22. The apparatus of claim 21, further comprising means for generating the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. | Apparatuses, systems, methods, and computer program products are disclosed for a machine learning generated action plan. A machine learning module is configured to process different instances of data using machine learning to produce one or more results. The different instances of data may comprise different values for one or more actionable features. A recommended action module is configured to select one or more recommended actions for achieving a goal associated with the machine learning. The recommended action module may select the one or more recommended actions based on the one or more results. An action plan interface module is configured to provide an action plan associated with the one or more recommended actions.1. A method for an action plan, the method comprising:
processing different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more actionable features; selecting one or more recommended actions based on the one or more results; and providing an action plan associated with the one or more recommended actions. 2. The method of claim 1, wherein the one or more recommended actions are selected for achieving a goal associated with the machine learning. 3. The method of claim 1, wherein the one or more recommended actions are selected based on one or more of a confidence metric associated with the one or more results and a predicted outcome associated with the one or more recommended actions. 4. The method of claim 1, further comprising varying values of one or more non-actionable features for the different instances of data. 5. The method of claim 4, wherein the one or more recommended actions include a recommendation for data collection associated with the one or more non-actionable features. 6. The method of claim 1, further comprising storing the one or more results in a results data structure indexed by one or more of the one or more actionable features and the different instances of data. 7. The method of claim 6, further comprising dynamically updating the provided action plan based on the stored one or more results in response to user input changing one or more machine learning parameters associated with the action plan. 8. The method of claim 7, wherein the one or more machine learning parameters comprise one or more of: a value for an actionable feature; a recommended action; a target for a recommended action; a count for a recommended action; an action time for a recommended action; a cost for a recommended action; and a predicted outcome for a recommended action. 9. The method of claim 1, wherein the action plan comprises one or more lists of target subjects for the one or more recommended actions, the target subjects in the one or more lists ordered by confidence metrics generated by the machine learning for the target subjects. 10. The method of claim 1, wherein processing the different instances comprises predetermining, using the machine learning, permutations of the one or more results at predefined increments between one or more minimum values for the one or more actionable features and one or more maximum values for the one or more actionable features. 11. The method of claim 1, further comprising increasing one or more of a range of and a frequency of the different values for the one or more actionable features until the one or more results satisfy a predefined threshold. 12. The method of claim 11, wherein the one or more results satisfy the predefined threshold in response to determining a predictable relationship between at least one set of adjacent results. 13. The method of claim 1, further comprising generating the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. 14. The method of claim 13, wherein the machine learning comprises a different predictive program for each different recommended action, the different instances of data processed based on one or more dependent relationships between the different predictive programs. 15. The method of claim 1, further comprising fitting the one or more recommended actions to an action function, the action plan comprising the action function. 16. The method of claim 15, wherein the action function interpolates recommended actions between the one or more recommended actions. 17. An apparatus for an action plan, the apparatus comprising:
a machine learning module configured to process different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more features, the one or more results comprising at least one of a confidence metric and a predicted outcome; a recommended action module configured to select one or more recommended actions for achieving a goal associated with the machine learning, the recommended action module selecting the one or more recommended actions based on the one or more results; and an action plan interface module configured to provide an action plan associated with the one or more recommended actions. 18. The apparatus of claim 17, further comprising a pre-compute module configured to store the one or more results in a results data structure indexed by the one or more features and the different instances of data. 19. The apparatus of claim 18, further comprising an update module configured to dynamically update the provided action plan based on the stored one or more results in response to user input changing one or more machine learning parameters associated with the action plan. 20. The apparatus of claim 17, further comprising a predictive compiler module configured to generate the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. 21. An apparatus for an action plan, the apparatus comprising:
means for processing different instances of data using machine learning to produce one or more results, the different instances of data comprising different values for one or more features; means for selecting one or more recommended actions based on the one or more results; and means for providing an action plan comprising the one or more recommended actions and one or more target subjects for the one or more recommended actions. 22. The apparatus of claim 21, further comprising means for generating the machine learning, the machine learning comprising program code for a plurality of learned functions from multiple machine learning classes, the program code generated to predict the one or more results based on the different instances of data. | 2,100 |
5,237 | 13,596,540 | 2,127 | A method can include assigning one or more constraints to an upper surface, assigning one or more constraints to a lower surface, defining a pad configuration, generating pad locations locatable on the upper surface that conform to the defined pad configuration and the assigned constraints for the upper surface and the lower surface, and outputting specifications at least one of the generated pad locations. Various other apparatuses, systems, methods, etc., are also disclosed. | 1. A method comprising:
assigning one or more constraints to an upper surface; assigning one or more constraints to a lower surface; defining a pad configuration; generating pad locations locatable on the upper surface that conform to the defined pad configuration and the assigned constraints for the upper surface and the lower surface; and outputting specifications at least one of the generated pad locations. 2. The method of claim 1 wherein the assigning one or more constraints to an upper surface or to a lower surface comprises assigning a cost constraint. 3. The method of claim 1 wherein the assigning one or more constraints to an upper surface or to a lower surface comprises assigning a physical, environmental constraint. 4. The method of claim 1 further comprising adjusting at least one of a constraint value, a pad configuration definition value, or a constraint value and a pad configuration definition value; and generating pad locations to determine sensitivity of specifications for the generated pad locations to the adjusting of the at least one value. 5. The method of claim 1 further comprising providing a function that depends on at least one of a constraint value, a pad configuration definition value, or a constraint value and a pad configuration definition value; and optimizing output of the function by generating pad locations responsive to adjusting at least one of the at least one value of the function. 6. The method of claim 1 wherein the lower surface comprises a two- dimensional representation of a reservoir. 7. The method of claim 1 wherein the generating uses, at least in part, parameter values determined by applying a probe to locations on the upper surface. 8. The method of claim 7 wherein the probe comprises a two-dimensional probe or a three-dimensional probe. 9. The method of claim 1 further comprising defining a probe based at least in part on the defined pad configuration and applying the probe to locations on the upper surface to determine parameter values. 10. The method of claim 9 wherein the generating pad locations locatable on the upper surface comprises ranking locations on the upper surface based at least in part on the determined parameter values. 11. One or more computer-readable storage media comprising processor-executable instructions to instruct a computing system to:
receive constraint information for a multilayer model of an environment; receive configuration information for a drilling pad; generate a ranking of drilling pad locations based on the constraint information, the configuration information and the multilayer model of the environment; present, via a graphical user interface, at least some of the ranked drilling pad locations; and output specifications for at least one of the drilling pad locations based on input received via the graphical user interface. 12. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output a blueprint of a building site for building a drilling pad at one of the drilling pad locations. 13. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output a building costs for building a drilling pad at one of the drilling pad locations. 14. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output operational specifications for operation of equipment that may be placed via the drilling pad location. 15. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to receive configuration information for a drilling pad comprise instructions to receive configuration information for an offshore drilling pad. 16. One or more computer-readable storage media comprising processor-executable instructions to instruct a computing system to:
generate a graphical user interface for selection of regional geometry constraints for an environment; generate a graphical user interface for selection of pad and well specifications for the environment; generate a graphical user interface for selection of pad placement options for placement of pads in the environment; and generate a graphical user interface for selection of presenting a cost surface or presenting pad locations. 17. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for selection of presenting a cost surface and presenting pad locations. 18. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for selection of a plug-in to perform a pad placement process. 19. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system comprise a plug-in to a framework. 20. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for designing a well pad. | A method can include assigning one or more constraints to an upper surface, assigning one or more constraints to a lower surface, defining a pad configuration, generating pad locations locatable on the upper surface that conform to the defined pad configuration and the assigned constraints for the upper surface and the lower surface, and outputting specifications at least one of the generated pad locations. Various other apparatuses, systems, methods, etc., are also disclosed.1. A method comprising:
assigning one or more constraints to an upper surface; assigning one or more constraints to a lower surface; defining a pad configuration; generating pad locations locatable on the upper surface that conform to the defined pad configuration and the assigned constraints for the upper surface and the lower surface; and outputting specifications at least one of the generated pad locations. 2. The method of claim 1 wherein the assigning one or more constraints to an upper surface or to a lower surface comprises assigning a cost constraint. 3. The method of claim 1 wherein the assigning one or more constraints to an upper surface or to a lower surface comprises assigning a physical, environmental constraint. 4. The method of claim 1 further comprising adjusting at least one of a constraint value, a pad configuration definition value, or a constraint value and a pad configuration definition value; and generating pad locations to determine sensitivity of specifications for the generated pad locations to the adjusting of the at least one value. 5. The method of claim 1 further comprising providing a function that depends on at least one of a constraint value, a pad configuration definition value, or a constraint value and a pad configuration definition value; and optimizing output of the function by generating pad locations responsive to adjusting at least one of the at least one value of the function. 6. The method of claim 1 wherein the lower surface comprises a two- dimensional representation of a reservoir. 7. The method of claim 1 wherein the generating uses, at least in part, parameter values determined by applying a probe to locations on the upper surface. 8. The method of claim 7 wherein the probe comprises a two-dimensional probe or a three-dimensional probe. 9. The method of claim 1 further comprising defining a probe based at least in part on the defined pad configuration and applying the probe to locations on the upper surface to determine parameter values. 10. The method of claim 9 wherein the generating pad locations locatable on the upper surface comprises ranking locations on the upper surface based at least in part on the determined parameter values. 11. One or more computer-readable storage media comprising processor-executable instructions to instruct a computing system to:
receive constraint information for a multilayer model of an environment; receive configuration information for a drilling pad; generate a ranking of drilling pad locations based on the constraint information, the configuration information and the multilayer model of the environment; present, via a graphical user interface, at least some of the ranked drilling pad locations; and output specifications for at least one of the drilling pad locations based on input received via the graphical user interface. 12. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output a blueprint of a building site for building a drilling pad at one of the drilling pad locations. 13. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output a building costs for building a drilling pad at one of the drilling pad locations. 14. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to output specifications comprise instructions to output operational specifications for operation of equipment that may be placed via the drilling pad location. 15. The one or more computer-readable storage media of claim 11 wherein the instructions to instruct a computing system to receive configuration information for a drilling pad comprise instructions to receive configuration information for an offshore drilling pad. 16. One or more computer-readable storage media comprising processor-executable instructions to instruct a computing system to:
generate a graphical user interface for selection of regional geometry constraints for an environment; generate a graphical user interface for selection of pad and well specifications for the environment; generate a graphical user interface for selection of pad placement options for placement of pads in the environment; and generate a graphical user interface for selection of presenting a cost surface or presenting pad locations. 17. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for selection of presenting a cost surface and presenting pad locations. 18. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for selection of a plug-in to perform a pad placement process. 19. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system comprise a plug-in to a framework. 20. The one or more computer-readable storage media of claim 16 wherein the instructions to instruct a computing system to generate a graphical user interface for designing a well pad. | 2,100 |
5,238 | 12,942,118 | 2,173 | On a client computer a request is sent to a server computer to open a first portion of a document. The document is stored at the server computer. The first portion of the document is smaller than the entire document. The request includes information used by the server computer to determine a size of the first portion of the document. The first portion of the document is received from the server computer. A second portion of the document is rendered on a display screen on the client computer. The second portion of the document is a subset of the first portion of the document. When the client computer determines that the user has scrolled a third portion of the document and that more of the document is available at the server computer, a second request is sent to the server computer to open an additional portion of the document. | 1. A method for accessing a document at a client computer, the method comprising:
at the client computer, sending a first request to a server computer to open a first portion of the document, the document being stored at the server computer, the first portion of the document being smaller than the entire document, the request including information that is used by the server computer to determine a size of the first portion of the document; at the client computer, receiving the first portion of the document from the server computer; at the client computer, after the first portion of the document is received from the server computer, rendering a second portion of the document on a display screen on the client computer, the second portion of the document being a subset of the first portion of the document; at the client computer, determining that more of the document is available at the server computer; at the client computer, determining that a user has scrolled a third portion of the document on a display screen at the client computer; and when the client computer determines that the user has scrolled the third portion of the document and when the client computer determines that more of the document is available at the server computer, sending a second request to the server computer to open an additional portion of the document. 2. The method of claim 1, wherein the additional portion of the document is similar in size to the scrolled third portion of the document. 3. The method of claim 1, wherein determining at the client computer that at least one more additional portion of the document is available at the server computer further comprises receiving a message from the server computer indicating that more of the document is available. 4. The method of claim 1, wherein determining that the user has scrolled a third portion of the document on the display screen further comprises determining that the user has scrolled a predetermined number of objects on the display screen. 5. The method of claim 4, wherein each object in the predetermined number of objects is a top-level object, each of the top-level objects being one of a paragraph, a table, a list or a picture. 6. The method of claim 1, wherein when the client computer requests the additional portion of the document from the server computer, the client computer unloads a similar sized portion of the document from the client computer. 7. The method of claim 1, further comprising receiving the additional portion of the document from the server computer, and when the additional portion of the document is received from the server computer unloading a portion of the document from the client computer. 8. The method of claim 1, wherein the information included in the first request includes one or more of a size of the display screen on the client computer, a size of a font used on the display screen and a pixel resolution of the display screen. 9. The method of claim 1, wherein the information included in the first request includes a hint as to the number of objects to be included in the first portion of the document. 10. The method of claim 1, wherein the first portion of the document includes a plurality of objects, one or more of the plurality of objects being top-level objects, each top-level object comprising one or more of the plurality of objects, each of the top-level objects being one of a paragraph, a table, a list or a picture. 11. The method of claim 1, further comprising:
editing the first portion of the document; and sending a request to the server computer to save the edited first portion of the document, the edited first portion of the document being saved while the document is partially open. 12. A method implemented on a server computer for partially opening a document stored on the server computer, the method comprising:
on the server computer, receiving a first message from a client computer, the first message being a request to open a first portion of the document, the first portion of the document comprising one or more objects, the request including information for determining a size of the first portion of the document; on the server computer, determining the size of the first portion of the document, the determination of the size of the first portion of the document comprising determining an object threshold for the first portion of the document, the object threshold corresponding to a minimum number of objects to be included in the first portion of the document; and on the server computer, sending to the client computer one or more objects from the document, the one or more objects comprising objects starting from a beginning of the document up until a number of objects being sent to the client computer is equal to the object threshold. 13. The method of claim 12, further comprising:
on the server computer, determining whether the object that corresponds to the object threshold is a top-level object; and when it is determined that the object that corresponds to the object threshold is not a top-level object:
identifying a top-level object that includes the object that corresponds to the object threshold; and
sending one or more additional objects from the identified top-level object to the client computer until an end of the identified top-level object is reached. 14. The method of claim 12, further comprising:
determining whether the size of the first portion of the document is smaller than a size of the entire document, and when it is determined that the size of the first portion of the document is smaller than the size of the entire document, sending a message to the client computer, the message informing the client computer that more of the document is available to be sent to the client computer. 15. The method of claim 12, further comprising receiving a second message from the client computer, the second message including a second portion of the document, the second portion of the document including one or more edited objects from the first portion of the document or one or more objects not included in the first portion of the document. 16. The method of claim 15, further including saving the second portion of the document in memory on the server computer, the second portion of the document being saved while the first portion of the document is partially opened at the server computer. 17. The method of claim 12, wherein determining the size of the object threshold further comprises determining a number of objects that will fit in the size of a display screen on the client computer. 18. The method of claim 17, wherein determining the size of the object threshold further comprises multiplying the number of objects that will fit in the size of the display screen on the client computer by a multiplying factor and designating a result of the multiplication as the object threshold. 19. The method of claim 12, wherein the information for determining the size of the first portion of the document includes a hint as to the number of objects to be included in the first portion of the document. 20. A computer-readable storage medium comprising instructions that, when executed by a computing device, cause the computing device to:
send a first request to a server computer to open a first portion of the document, the document being stored at the server computer, the first portion of the document being smaller than the entire document, the request including information that is used by the server computer to determine a size of the first portion of the document; receive the first portion of the document from the server computer; after the first portion of the document is received from the server computer, rendering a second portion of the document on a display screen on the client computer, the second portion of the document being a subset of the first portion of the document; determine that more of the document is available at the server computer; determine that a user has scrolled a third portion of the document on a display screen at the client computer, the third portion of the document comprising a predetermined number of objects, each of the objects being one of a paragraph, a table, a list or a picture; and when a determination is made that the user has scrolled the third portion of the document and when a determination is made that more of the document is available at the server computer, sending a second request to the server computer to open an additional portion of the document, the additional portion of the document being similar in size to the scrolled third portion of the document. | On a client computer a request is sent to a server computer to open a first portion of a document. The document is stored at the server computer. The first portion of the document is smaller than the entire document. The request includes information used by the server computer to determine a size of the first portion of the document. The first portion of the document is received from the server computer. A second portion of the document is rendered on a display screen on the client computer. The second portion of the document is a subset of the first portion of the document. When the client computer determines that the user has scrolled a third portion of the document and that more of the document is available at the server computer, a second request is sent to the server computer to open an additional portion of the document.1. A method for accessing a document at a client computer, the method comprising:
at the client computer, sending a first request to a server computer to open a first portion of the document, the document being stored at the server computer, the first portion of the document being smaller than the entire document, the request including information that is used by the server computer to determine a size of the first portion of the document; at the client computer, receiving the first portion of the document from the server computer; at the client computer, after the first portion of the document is received from the server computer, rendering a second portion of the document on a display screen on the client computer, the second portion of the document being a subset of the first portion of the document; at the client computer, determining that more of the document is available at the server computer; at the client computer, determining that a user has scrolled a third portion of the document on a display screen at the client computer; and when the client computer determines that the user has scrolled the third portion of the document and when the client computer determines that more of the document is available at the server computer, sending a second request to the server computer to open an additional portion of the document. 2. The method of claim 1, wherein the additional portion of the document is similar in size to the scrolled third portion of the document. 3. The method of claim 1, wherein determining at the client computer that at least one more additional portion of the document is available at the server computer further comprises receiving a message from the server computer indicating that more of the document is available. 4. The method of claim 1, wherein determining that the user has scrolled a third portion of the document on the display screen further comprises determining that the user has scrolled a predetermined number of objects on the display screen. 5. The method of claim 4, wherein each object in the predetermined number of objects is a top-level object, each of the top-level objects being one of a paragraph, a table, a list or a picture. 6. The method of claim 1, wherein when the client computer requests the additional portion of the document from the server computer, the client computer unloads a similar sized portion of the document from the client computer. 7. The method of claim 1, further comprising receiving the additional portion of the document from the server computer, and when the additional portion of the document is received from the server computer unloading a portion of the document from the client computer. 8. The method of claim 1, wherein the information included in the first request includes one or more of a size of the display screen on the client computer, a size of a font used on the display screen and a pixel resolution of the display screen. 9. The method of claim 1, wherein the information included in the first request includes a hint as to the number of objects to be included in the first portion of the document. 10. The method of claim 1, wherein the first portion of the document includes a plurality of objects, one or more of the plurality of objects being top-level objects, each top-level object comprising one or more of the plurality of objects, each of the top-level objects being one of a paragraph, a table, a list or a picture. 11. The method of claim 1, further comprising:
editing the first portion of the document; and sending a request to the server computer to save the edited first portion of the document, the edited first portion of the document being saved while the document is partially open. 12. A method implemented on a server computer for partially opening a document stored on the server computer, the method comprising:
on the server computer, receiving a first message from a client computer, the first message being a request to open a first portion of the document, the first portion of the document comprising one or more objects, the request including information for determining a size of the first portion of the document; on the server computer, determining the size of the first portion of the document, the determination of the size of the first portion of the document comprising determining an object threshold for the first portion of the document, the object threshold corresponding to a minimum number of objects to be included in the first portion of the document; and on the server computer, sending to the client computer one or more objects from the document, the one or more objects comprising objects starting from a beginning of the document up until a number of objects being sent to the client computer is equal to the object threshold. 13. The method of claim 12, further comprising:
on the server computer, determining whether the object that corresponds to the object threshold is a top-level object; and when it is determined that the object that corresponds to the object threshold is not a top-level object:
identifying a top-level object that includes the object that corresponds to the object threshold; and
sending one or more additional objects from the identified top-level object to the client computer until an end of the identified top-level object is reached. 14. The method of claim 12, further comprising:
determining whether the size of the first portion of the document is smaller than a size of the entire document, and when it is determined that the size of the first portion of the document is smaller than the size of the entire document, sending a message to the client computer, the message informing the client computer that more of the document is available to be sent to the client computer. 15. The method of claim 12, further comprising receiving a second message from the client computer, the second message including a second portion of the document, the second portion of the document including one or more edited objects from the first portion of the document or one or more objects not included in the first portion of the document. 16. The method of claim 15, further including saving the second portion of the document in memory on the server computer, the second portion of the document being saved while the first portion of the document is partially opened at the server computer. 17. The method of claim 12, wherein determining the size of the object threshold further comprises determining a number of objects that will fit in the size of a display screen on the client computer. 18. The method of claim 17, wherein determining the size of the object threshold further comprises multiplying the number of objects that will fit in the size of the display screen on the client computer by a multiplying factor and designating a result of the multiplication as the object threshold. 19. The method of claim 12, wherein the information for determining the size of the first portion of the document includes a hint as to the number of objects to be included in the first portion of the document. 20. A computer-readable storage medium comprising instructions that, when executed by a computing device, cause the computing device to:
send a first request to a server computer to open a first portion of the document, the document being stored at the server computer, the first portion of the document being smaller than the entire document, the request including information that is used by the server computer to determine a size of the first portion of the document; receive the first portion of the document from the server computer; after the first portion of the document is received from the server computer, rendering a second portion of the document on a display screen on the client computer, the second portion of the document being a subset of the first portion of the document; determine that more of the document is available at the server computer; determine that a user has scrolled a third portion of the document on a display screen at the client computer, the third portion of the document comprising a predetermined number of objects, each of the objects being one of a paragraph, a table, a list or a picture; and when a determination is made that the user has scrolled the third portion of the document and when a determination is made that more of the document is available at the server computer, sending a second request to the server computer to open an additional portion of the document, the additional portion of the document being similar in size to the scrolled third portion of the document. | 2,100 |
5,239 | 14,430,908 | 2,112 | A method of processing data according to a first predetermined function, the method comprising: receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second redetermined function corresponds to the first redetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. | 1. A method of processing data according to a first predetermined function, the method comprising:
receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 2. The method of claim 1, comprising:
using the error control code to detect whether there is an error in the received encoded amount of data or whether there is an error in the output and, if an error is detected, performing one or more of: (a) setting the output to be substantially unrelated to the received encoded amount of data; (b) setting the output to be a random value; (c) performing an error correction decoding operation of the error control code on the received encoded amount of data or on the output; (d) ceasing further processing operations. 3. A method of enabling a data processor to process data according to a first predetermined function, the method comprising:
generating a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. 4. The method of claim 3, wherein it is not possible to determine a generator polynomial of the predetermined error control code from the second function. 5. A method of providing data to a first entity from a second entity, the first entity being arranged to process the data according to a first predetermined function by carrying out a method according to claim 1, the method comprising:
the second entity encoding the data using an error control code to thereby generate an encoded amount of data; and the second entity providing the encoded amount of data to the first entity. 6. The method of claim 5, comprising the second entity adding a correctable error to the encoded amount of data before providing the encoded amount of data to the first entity. 7. The method of claim 6, wherein the error is dependent on the data. 8. The method of claim 6, wherein the error is randomly generated. 9. The method of claim 6, wherein the second entity is arranged to add a first error to the encoded amount of data at a first time of providing the encoded amount of data to the first entity and is arranged to add a second error to the encoded amount of data at a second time of providing the encoded amount of data to the first entity, wherein the second error is different from the first error. 10. The method of claim 5, wherein the error correction code used by the first entity and the second entity is dependent, at least in part, on the data. 11. A system for processing data according to a first predetermined function, the system comprising one or more processors arranged to:
receive an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and process the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 12. A system arranged to enable a first data processor to process data according to a first predetermined function, the system comprising one or more processors arranged to:
generate a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the first data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. 13. A non-transitory computer readable medium storing a computer program which, when executed by one or more processors, causes the one or more processors to process data according to a first predetermined function by:
receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 14. A non-transitory computer readable medium storing a computer program which, when executed by one or more processors, causes the one or more processors to enable a first data processor to process data according to a first predetermined function by:
generating a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the first data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. | A method of processing data according to a first predetermined function, the method comprising: receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second redetermined function corresponds to the first redetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function.1. A method of processing data according to a first predetermined function, the method comprising:
receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 2. The method of claim 1, comprising:
using the error control code to detect whether there is an error in the received encoded amount of data or whether there is an error in the output and, if an error is detected, performing one or more of: (a) setting the output to be substantially unrelated to the received encoded amount of data; (b) setting the output to be a random value; (c) performing an error correction decoding operation of the error control code on the received encoded amount of data or on the output; (d) ceasing further processing operations. 3. A method of enabling a data processor to process data according to a first predetermined function, the method comprising:
generating a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. 4. The method of claim 3, wherein it is not possible to determine a generator polynomial of the predetermined error control code from the second function. 5. A method of providing data to a first entity from a second entity, the first entity being arranged to process the data according to a first predetermined function by carrying out a method according to claim 1, the method comprising:
the second entity encoding the data using an error control code to thereby generate an encoded amount of data; and the second entity providing the encoded amount of data to the first entity. 6. The method of claim 5, comprising the second entity adding a correctable error to the encoded amount of data before providing the encoded amount of data to the first entity. 7. The method of claim 6, wherein the error is dependent on the data. 8. The method of claim 6, wherein the error is randomly generated. 9. The method of claim 6, wherein the second entity is arranged to add a first error to the encoded amount of data at a first time of providing the encoded amount of data to the first entity and is arranged to add a second error to the encoded amount of data at a second time of providing the encoded amount of data to the first entity, wherein the second error is different from the first error. 10. The method of claim 5, wherein the error correction code used by the first entity and the second entity is dependent, at least in part, on the data. 11. A system for processing data according to a first predetermined function, the system comprising one or more processors arranged to:
receive an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and process the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 12. A system arranged to enable a first data processor to process data according to a first predetermined function, the system comprising one or more processors arranged to:
generate a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the first data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. 13. A non-transitory computer readable medium storing a computer program which, when executed by one or more processors, causes the one or more processors to process data according to a first predetermined function by:
receiving an encoded amount of data, wherein the encoded amount of data is an amount of data that has been encoded using an error control code; and processing the encoded amount of data using a second predetermined function to generate an output; wherein the second predetermined function corresponds to the first predetermined function in that the result of processing, with the second predetermined function, a quantity of data encoded using the error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function. 14. A non-transitory computer readable medium storing a computer program which, when executed by one or more processors, causes the one or more processors to enable a first data processor to process data according to a first predetermined function by:
generating a second function that corresponds to the first predetermined function in that the result of processing, with the second function, a quantity of data encoded using a predetermined error control code equals the result of encoding with the error control code the result of processing the quantity of data with the first predetermined function; and configuring the first data processor to use the second function to process encoded data, wherein the encoded data is data encoded according to the error control code. | 2,100 |
5,240 | 14,558,680 | 2,145 | A server sends, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes. The server then receives, from the electronic device of the first user, a first message, wherein the first message from the electronic device of the first user is selected from a set of predefined first-reply messages. Each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. | 1. A method comprising:
at a server system with a processor and memory storing instructions for execution by the processor: sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes; receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. 2. The method of claim 1, wherein:
the set of predefined first-reply messages is based on a plurality of first-reply factors, wherein the first-reply factors include content from one or more messages between the first user and the server. 3. The method of claim 2, wherein the first-reply factors further include relationship characteristics between the first user and the server system. 4. The method of claim 2, wherein the first-reply factors further include information provided by the user to a social network. 5. The method of claim 4, wherein information provided by the user to the social network includes content from one or more messages published by the first user on the social network. 6. The method of claim 2, wherein the first-reply factors further include profile characteristics of the first user. 7. The method of claim 2, wherein the first-reply factors further include environmental characteristics of the first user. 8. The method of claim 2, wherein the first-reply factors further include technical characteristics of the electronic device of the first user. 9. The method of claim 2, including:
after receiving, from the electronic device of the first user, the first message:
sending, to the electronic device of the first user for display on the electronic device, a set of predefined second-reply messages, wherein the set of predefined second-reply messages is based on a plurality of second-reply factors for the first user; and
sending, to the electronic device of the first user for display on the electronic device, one or more alternative communication options. 10. The method of claim 2, including:
updating a user response profile of the first user in accordance with the first message, wherein:
the set of predefined first-reply messages is based at least in part on the user response profile of the first user;
the user response profile of the first user includes response statistics for the first user. 11. The method of claim 2, including:
updating a generic response profile in accordance with the first message, wherein:
the set of predefined first-reply messages is based at least in part on the generic response profile;
the generic response profile includes response statistics for a group of users, the group of users including the first user. 12. The method of claim 1, sending, to the electronic device of the first user, instructions for displaying the set of predefined first-reply messages, wherein the first-reply messages in the set of predefined first-reply messages are presented in an order based on a user response profile of the first user and/or a generic response profile. 13. The method of claim 1, including:
prior to sending, to the electronic device of the first user, the data structure that includes the hierarchical interaction tree: receiving, from the electronic device of the first user, a service initiation message, wherein sending the data structure is in response to receiving the service initiation message. 14. The method of claim 1, wherein the data structure is sent to a messaging application stored in the electronic device of the first user, and the first message is received from the messaging application, the method including:
in accordance with a determination that application-launch criteria are satisfied by content in the first message, sending instructions for activating and displaying an application, distinct from the messaging application, to the electronic device of the first user. 15. An electronic device, comprising:
one or more processors; and memory, the memory storing one or more programs that are configured to be executed by the one or more processors, the one or more programs including instructions for:
sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes;
receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. 16. A non-transitory computer readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device, the one or more programs including instructions for:
sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes; receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. | A server sends, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes. The server then receives, from the electronic device of the first user, a first message, wherein the first message from the electronic device of the first user is selected from a set of predefined first-reply messages. Each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree.1. A method comprising:
at a server system with a processor and memory storing instructions for execution by the processor: sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes; receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. 2. The method of claim 1, wherein:
the set of predefined first-reply messages is based on a plurality of first-reply factors, wherein the first-reply factors include content from one or more messages between the first user and the server. 3. The method of claim 2, wherein the first-reply factors further include relationship characteristics between the first user and the server system. 4. The method of claim 2, wherein the first-reply factors further include information provided by the user to a social network. 5. The method of claim 4, wherein information provided by the user to the social network includes content from one or more messages published by the first user on the social network. 6. The method of claim 2, wherein the first-reply factors further include profile characteristics of the first user. 7. The method of claim 2, wherein the first-reply factors further include environmental characteristics of the first user. 8. The method of claim 2, wherein the first-reply factors further include technical characteristics of the electronic device of the first user. 9. The method of claim 2, including:
after receiving, from the electronic device of the first user, the first message:
sending, to the electronic device of the first user for display on the electronic device, a set of predefined second-reply messages, wherein the set of predefined second-reply messages is based on a plurality of second-reply factors for the first user; and
sending, to the electronic device of the first user for display on the electronic device, one or more alternative communication options. 10. The method of claim 2, including:
updating a user response profile of the first user in accordance with the first message, wherein:
the set of predefined first-reply messages is based at least in part on the user response profile of the first user;
the user response profile of the first user includes response statistics for the first user. 11. The method of claim 2, including:
updating a generic response profile in accordance with the first message, wherein:
the set of predefined first-reply messages is based at least in part on the generic response profile;
the generic response profile includes response statistics for a group of users, the group of users including the first user. 12. The method of claim 1, sending, to the electronic device of the first user, instructions for displaying the set of predefined first-reply messages, wherein the first-reply messages in the set of predefined first-reply messages are presented in an order based on a user response profile of the first user and/or a generic response profile. 13. The method of claim 1, including:
prior to sending, to the electronic device of the first user, the data structure that includes the hierarchical interaction tree: receiving, from the electronic device of the first user, a service initiation message, wherein sending the data structure is in response to receiving the service initiation message. 14. The method of claim 1, wherein the data structure is sent to a messaging application stored in the electronic device of the first user, and the first message is received from the messaging application, the method including:
in accordance with a determination that application-launch criteria are satisfied by content in the first message, sending instructions for activating and displaying an application, distinct from the messaging application, to the electronic device of the first user. 15. An electronic device, comprising:
one or more processors; and memory, the memory storing one or more programs that are configured to be executed by the one or more processors, the one or more programs including instructions for:
sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes;
receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. 16. A non-transitory computer readable storage medium storing one or more programs configured to be executed by one or more processors of an electronic device, the one or more programs including instructions for:
sending, to an electronic device of a first user, a data structure that includes a hierarchical interaction tree having a plurality of interaction nodes; receiving, from the electronic device of the first user, a first message, wherein:
the first message from the electronic device of the first user is selected from a set of predefined first-reply messages; and
each first-reply message of the set of predefined first-reply messages corresponds to a distinct interaction node of the hierarchical interaction tree. | 2,100 |
5,241 | 13,132,945 | 2,153 | A method is provided. The method comprises accessing ( 110 ) a target database ( 107 ) comprising at least one table associated with a first concept or property of a reference ontology ( 101 ), defining ( 120 ) a data source ontology ( 104 ) for a data source ( 102 ) comprising a dataset, said data source ontology ( 104 ) comprising a second concept or property, wherein said second concept or property is different from said first concept or property, and creating ( 140 ) a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related. | 1. A method comprising:
accessing (110) a target database (107) comprising at least one table associated with a first concept or property of a reference ontology (101); defining (120) a data source ontology (104) for a data source (102) comprising a dataset, said data source ontology (104) comprising a second concept or property, wherein said second concept or property is different from said first concept or property; and creating (140) a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related. 2. The method according to claim 1, further comprising storing (160) said data by utilizing said link into the corresponding table of said target database (107). 3. The method according to claim 1, further comprising storing (150) said link into a data integration module (280). 4. The method according to claim 1, wherein creating (140) said link further comprises assembling a query addressing said first concept or property and said link to said second concept or property. 5. The method according to claim 1, wherein the target database (107) is a relational database. 6. The method according to claim 1, wherein defining (120) the data source ontology further comprises providing a user interface (230) for converting a relational schema representation of the data source (102) to an ontology (104). 7. The method according to claim 1, further comprising linking (132) the ontological representation (101) of the target database with the relational representation (107) of the target database, and linking (132) the ontological representation (104) of the data source with the relational representation (102) of the data source. 8. The method according to claim 7, wherein linking the ontological representations (101, 104) with the relational representations (107, 102) further comprises recording a relationship by means of meta representations. 9. The method according to claim 1, wherein the data source (102) comprises medical data of a clinical trial. 10. A computer program product stored on a computer-readable medium comprising software code adapted to perform the steps of the method according to claim 1 when executed on a data-processing apparatus. 11. A module (40) comprising:
a first unit (41) for accessing a target database (107) comprising at least one table associated with a first concept or property of a reference ontology (101); a second unit (42) for defining a data source ontology for a data source (102) comprising a dataset, said data source ontology (104) comprising a second concept or property, wherein said second concept or property is different from said first concept or property; and a third unit (43) for creating a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related. 12. The module according to claim 11, further comprising:
a fourth unit (45) for storing said data by utilizing said link into the corresponding table of said target database (107). 13. The module according to claim 11, further comprising:
a fifth module (44) for storing said link into a data integration module (280). 14. The module according to claim 11, wherein the third unit (43) for creating a link is connected to a user interface (230) for manually linking said second concept or property of the data source ontology (104) to said first concept or property of the reference ontology (101). | A method is provided. The method comprises accessing ( 110 ) a target database ( 107 ) comprising at least one table associated with a first concept or property of a reference ontology ( 101 ), defining ( 120 ) a data source ontology ( 104 ) for a data source ( 102 ) comprising a dataset, said data source ontology ( 104 ) comprising a second concept or property, wherein said second concept or property is different from said first concept or property, and creating ( 140 ) a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related.1. A method comprising:
accessing (110) a target database (107) comprising at least one table associated with a first concept or property of a reference ontology (101); defining (120) a data source ontology (104) for a data source (102) comprising a dataset, said data source ontology (104) comprising a second concept or property, wherein said second concept or property is different from said first concept or property; and creating (140) a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related. 2. The method according to claim 1, further comprising storing (160) said data by utilizing said link into the corresponding table of said target database (107). 3. The method according to claim 1, further comprising storing (150) said link into a data integration module (280). 4. The method according to claim 1, wherein creating (140) said link further comprises assembling a query addressing said first concept or property and said link to said second concept or property. 5. The method according to claim 1, wherein the target database (107) is a relational database. 6. The method according to claim 1, wherein defining (120) the data source ontology further comprises providing a user interface (230) for converting a relational schema representation of the data source (102) to an ontology (104). 7. The method according to claim 1, further comprising linking (132) the ontological representation (101) of the target database with the relational representation (107) of the target database, and linking (132) the ontological representation (104) of the data source with the relational representation (102) of the data source. 8. The method according to claim 7, wherein linking the ontological representations (101, 104) with the relational representations (107, 102) further comprises recording a relationship by means of meta representations. 9. The method according to claim 1, wherein the data source (102) comprises medical data of a clinical trial. 10. A computer program product stored on a computer-readable medium comprising software code adapted to perform the steps of the method according to claim 1 when executed on a data-processing apparatus. 11. A module (40) comprising:
a first unit (41) for accessing a target database (107) comprising at least one table associated with a first concept or property of a reference ontology (101); a second unit (42) for defining a data source ontology for a data source (102) comprising a dataset, said data source ontology (104) comprising a second concept or property, wherein said second concept or property is different from said first concept or property; and a third unit (43) for creating a link between said second concept or property and said first concept or property, said link defining to which table of said target database data of said dataset, associated with said second concept or property, is related. 12. The module according to claim 11, further comprising:
a fourth unit (45) for storing said data by utilizing said link into the corresponding table of said target database (107). 13. The module according to claim 11, further comprising:
a fifth module (44) for storing said link into a data integration module (280). 14. The module according to claim 11, wherein the third unit (43) for creating a link is connected to a user interface (230) for manually linking said second concept or property of the data source ontology (104) to said first concept or property of the reference ontology (101). | 2,100 |
5,242 | 12,129,972 | 2,152 | In one example embodiment, a system and method is shown that includes receiving a collaborative list, the receiving including receiving a share structure that includes one or more members. Further, the system and method includes identifying at least one member of the share structure having access to structured data. Additionally, the system and method includes identifying privilege data associated with the at least one member indicating an access privilege to the collaborative list, the collaborative list including the structured data. Moreover, the system and method includes selectively receiving the structured data based on the access privilege associated with the at least one member. The system and method also includes displaying the structured data in a first display area of the GUI. In addition, the system and method also includes displaying the share structure in a second display area of the GUI. | 1. A computer implemented method comprising:
receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; displaying the selected data from the structured data in a first display area of a Graphical User Interface (GUI); and displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 2. The computer implemented method of claim 1, further comprising aggregating template data from a plurality of source templates to generate a template, the structured data displayed using the template. 3. The computer implemented method of claim 1, further comprising:
identifying an additional member, and additional privilege data associated with the additional member; determining that, based upon the additional privilege data, the additional member is to be denied access to the collaborative list; selectively receiving a portion of the collaborative list based on the determination, the portion of the collaborative list including a reduced amount of the structured data relative to the structured data as a whole; and displaying the reduced amount of the structured data in the first display area of the GUI. 4. The computer implemented method of claim 1, wherein the structured data is structured as at least one of a list or a table. 5. The computer implemented method of claim 1, wherein the share structure is a tree. 6. The computer implemented method of claim 5, wherein the tree reflects the organization of a legal entity. 7. The computer implemented method of claim 1, further comprising:
retrieving at least one privilege associated with an additional member of the share structure; and receiving selection input, through an input device, to set the at least one privilege associated with the additional member of the share structure. 8. The computer implemented method of claim 1, further comprising:
receiving selection input through an input device identifying an additional member of the share structure to access the collaborative list; and enabling access by the additional member to the collaborative list based, in part, upon the existence of an additional access privilege associated with the additional member of the share structure. 9. The computer implemented method of claim 1, wherein the access privilege includes at least one of a distribute privilege, an edit privilege, or a read privilege. 10. The computer implemented method of claim 1, further comprising receiving selection input identifying the at least one member of the share structure, the identifying including the use of a graphical pointer. 11-13. (canceled) 14. A computer system comprising:
a receiver to receive, utilizing at least one processor, a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; a selection receiver to select data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; a display to display the selected data from the structured data in a first display area of a Graphical User Interface (GUI); and an additional display to display a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 15. The computer system of claim 14, further comprising an aggregation engine to aggregate template data from a plurality of source templates to generate a template, the structured data displayed using the template. 16. The computer system of claim 14, further comprising:
the privilege identification engine to identify an additional member, and additional privilege data associated with the additional member; a share engine to determine that, based upon the additional privilege data, the additional member is to be denied access to the collaborative list; the selection receiver to selectively receive a portion of the collaborative list based on the determination, the portion of the collaborative list including a reduced amount of the structured data relative to the structured data as a whole; and the display to display the reduced amount of the structured data in the first display area of the GUI. 17. The computer system of claim 14, wherein the structured data is structured as at least one of a list or a table. 18. The computer system of claim 14, wherein the share structure is a tree. 19. The computer system of claim 18, wherein the tree reflects the organization of a legal entity. 20. The computer system of claim 14, further comprising:
a privilege retriever to retrieve at least one privilege associated with an additional member of the share structure; and an input receiver to receive selection input, through an input device, to set the at least one privilege associated with the additional member of the share structure. 21. The computer system of claim 14, further comprising:
an input receiver to receive selection input through an input device identifying an additional member of the share structure to access the collaborative list; and an enablement engine to enable access by the additional member to the collaborative list based, in part, upon the existence of an additional access privilege associated with the additional member of the share structure. 22. The computer system of claim 14, wherein the access privilege includes at least one of a distribute privilege, an edit privilege, or a read privilege. 23. The computer system of claim 14, further comprising an input receiver to receive selection input identifying the at least one member of the share structure, the identifying including the use of a graphical pointer. 24-26. (canceled) 27. An apparatus comprising:
means for receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; means for selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; means for displaying the selected data from the structured data in a first display area of the GUI; and means for displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 28. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform the following operations:
receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; displaying the selected data from the structured data in a first display area of the GUI; and displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. | In one example embodiment, a system and method is shown that includes receiving a collaborative list, the receiving including receiving a share structure that includes one or more members. Further, the system and method includes identifying at least one member of the share structure having access to structured data. Additionally, the system and method includes identifying privilege data associated with the at least one member indicating an access privilege to the collaborative list, the collaborative list including the structured data. Moreover, the system and method includes selectively receiving the structured data based on the access privilege associated with the at least one member. The system and method also includes displaying the structured data in a first display area of the GUI. In addition, the system and method also includes displaying the share structure in a second display area of the GUI.1. A computer implemented method comprising:
receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; displaying the selected data from the structured data in a first display area of a Graphical User Interface (GUI); and displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 2. The computer implemented method of claim 1, further comprising aggregating template data from a plurality of source templates to generate a template, the structured data displayed using the template. 3. The computer implemented method of claim 1, further comprising:
identifying an additional member, and additional privilege data associated with the additional member; determining that, based upon the additional privilege data, the additional member is to be denied access to the collaborative list; selectively receiving a portion of the collaborative list based on the determination, the portion of the collaborative list including a reduced amount of the structured data relative to the structured data as a whole; and displaying the reduced amount of the structured data in the first display area of the GUI. 4. The computer implemented method of claim 1, wherein the structured data is structured as at least one of a list or a table. 5. The computer implemented method of claim 1, wherein the share structure is a tree. 6. The computer implemented method of claim 5, wherein the tree reflects the organization of a legal entity. 7. The computer implemented method of claim 1, further comprising:
retrieving at least one privilege associated with an additional member of the share structure; and receiving selection input, through an input device, to set the at least one privilege associated with the additional member of the share structure. 8. The computer implemented method of claim 1, further comprising:
receiving selection input through an input device identifying an additional member of the share structure to access the collaborative list; and enabling access by the additional member to the collaborative list based, in part, upon the existence of an additional access privilege associated with the additional member of the share structure. 9. The computer implemented method of claim 1, wherein the access privilege includes at least one of a distribute privilege, an edit privilege, or a read privilege. 10. The computer implemented method of claim 1, further comprising receiving selection input identifying the at least one member of the share structure, the identifying including the use of a graphical pointer. 11-13. (canceled) 14. A computer system comprising:
a receiver to receive, utilizing at least one processor, a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; a selection receiver to select data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; a display to display the selected data from the structured data in a first display area of a Graphical User Interface (GUI); and an additional display to display a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 15. The computer system of claim 14, further comprising an aggregation engine to aggregate template data from a plurality of source templates to generate a template, the structured data displayed using the template. 16. The computer system of claim 14, further comprising:
the privilege identification engine to identify an additional member, and additional privilege data associated with the additional member; a share engine to determine that, based upon the additional privilege data, the additional member is to be denied access to the collaborative list; the selection receiver to selectively receive a portion of the collaborative list based on the determination, the portion of the collaborative list including a reduced amount of the structured data relative to the structured data as a whole; and the display to display the reduced amount of the structured data in the first display area of the GUI. 17. The computer system of claim 14, wherein the structured data is structured as at least one of a list or a table. 18. The computer system of claim 14, wherein the share structure is a tree. 19. The computer system of claim 18, wherein the tree reflects the organization of a legal entity. 20. The computer system of claim 14, further comprising:
a privilege retriever to retrieve at least one privilege associated with an additional member of the share structure; and an input receiver to receive selection input, through an input device, to set the at least one privilege associated with the additional member of the share structure. 21. The computer system of claim 14, further comprising:
an input receiver to receive selection input through an input device identifying an additional member of the share structure to access the collaborative list; and an enablement engine to enable access by the additional member to the collaborative list based, in part, upon the existence of an additional access privilege associated with the additional member of the share structure. 22. The computer system of claim 14, wherein the access privilege includes at least one of a distribute privilege, an edit privilege, or a read privilege. 23. The computer system of claim 14, further comprising an input receiver to receive selection input identifying the at least one member of the share structure, the identifying including the use of a graphical pointer. 24-26. (canceled) 27. An apparatus comprising:
means for receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; means for selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; means for displaying the selected data from the structured data in a first display area of the GUI; and means for displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. 28. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform the following operations:
receiving a collaborative list, the collaborative list including structured data and access privilege data, the access privilege data associated with a share structure, the share structure referencing one or more members; selecting data from the structured data based on the access privilege data for a member from the one or more members referenced in the share structure; displaying the selected data from the structured data in a first display area of the GUI; and displaying a representation of the share structure in a second display area of the GUI contemporaneously with the displaying of the selected data from the structured data. | 2,100 |
5,243 | 14,586,513 | 2,122 | The present disclosure includes techniques pertaining to computer automated learning management systems and methods. In one embodiment, a system is disclosed where information is represented in a learning graph. In one embodiment, a framework may be used to access different algorithms for identifying customized learning content for a user. In another embodiment, the present disclosure includes techniques for analyzing content and incorporating content into an organizational glossary. | 1. A method comprising:
retrieving a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determining whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; excluding other nodes from execution of the strategy based on the determination; and executing strategies on the person node and the included other nodes. 2. The method of claim 1 wherein the user request includes a free key term request and at least one strategy includes searching for learning items based on the free key term. 3. The method of claim 2 wherein at least one strategy includes searching for learning items based on terms related to the free key term. 4. The method of claim 2 wherein at least one strategy includes searching for learning items based on at least one predetermined rule set, the free key term, and terms related to the free key term. 5. The method of claim 1 wherein at least one strategy includes searching content nodes based on a specified term identifier. 6. The method of claim 1 wherein the user request includes an interest of the user and at least one strategy includes searching content nodes for learning content based on the interest of the user. 7. The method of claim 1 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group, and wherein at least one strategy includes finding content nodes based on interests of the user being similar to interests of persons in the group. 8. The method of claim 1 wherein at least one strategy includes searching content nodes having a relationship with an interest indication in the user request. 9. The method of claim 1 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group of the user, and wherein at least one strategy includes finding content nodes based on persons in the group. 10. The method of claim 1 wherein the learning graph includes person nodes that are associated based on associations in an external social network between individuals associated with the person nodes, and wherein at least one strategy includes finding content nodes based on the associated person nodes. 11. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on similar interests;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 12. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on topics of access learning content;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 13. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on similar learning preferences or similar prior learnings;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 14. A computer system comprising:
a processor; and a non-transitory computer readable medium having stored thereon one or more programs, which when executed by the processor, causes the processor to: retrieve a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; map parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determine whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; exclude other nodes from execution of the strategy based on the determination; and execute strategies on the person node and the included other nodes. 15. The computer system of claim 14 wherein the user request includes a free key term request and at least one strategy includes searching for learning items based on the free key terms. 16. The computer system of claim 15 wherein at least one strategy includes searching for learning items based on at least one predetermined rule set, the free key term and terms related to the free key term. 17. The computer system of claim 14 wherein the user request includes an interest of the user and at least one strategy includes searching content nodes for learning content based on the interest of the user. 18. The computer system of claim 14 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group, and wherein at least one strategy includes finding content nodes based on interests of the user being similar to interests of persons in the group. 19. The computer system of claim 14 wherein at least one strategy includes searching content nodes having a relationship with an interest indication in the user request. 20. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions for:
retrieving a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determining whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; excluding other nodes from execution of the strategy based on the determination; and executing strategies on the person node and the included other nodes. | The present disclosure includes techniques pertaining to computer automated learning management systems and methods. In one embodiment, a system is disclosed where information is represented in a learning graph. In one embodiment, a framework may be used to access different algorithms for identifying customized learning content for a user. In another embodiment, the present disclosure includes techniques for analyzing content and incorporating content into an organizational glossary.1. A method comprising:
retrieving a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determining whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; excluding other nodes from execution of the strategy based on the determination; and executing strategies on the person node and the included other nodes. 2. The method of claim 1 wherein the user request includes a free key term request and at least one strategy includes searching for learning items based on the free key term. 3. The method of claim 2 wherein at least one strategy includes searching for learning items based on terms related to the free key term. 4. The method of claim 2 wherein at least one strategy includes searching for learning items based on at least one predetermined rule set, the free key term, and terms related to the free key term. 5. The method of claim 1 wherein at least one strategy includes searching content nodes based on a specified term identifier. 6. The method of claim 1 wherein the user request includes an interest of the user and at least one strategy includes searching content nodes for learning content based on the interest of the user. 7. The method of claim 1 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group, and wherein at least one strategy includes finding content nodes based on interests of the user being similar to interests of persons in the group. 8. The method of claim 1 wherein at least one strategy includes searching content nodes having a relationship with an interest indication in the user request. 9. The method of claim 1 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group of the user, and wherein at least one strategy includes finding content nodes based on persons in the group. 10. The method of claim 1 wherein the learning graph includes person nodes that are associated based on associations in an external social network between individuals associated with the person nodes, and wherein at least one strategy includes finding content nodes based on the associated person nodes. 11. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on similar interests;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 12. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on topics of access learning content;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 13. The method of claim 1 further comprising:
determining person nodes similar to the person node of the user to determine a community of individuals based on similar learning preferences or similar prior learnings;
determining numbers of times of access to learning content of individuals in the community; and
determining most accessed learning content of the community. 14. A computer system comprising:
a processor; and a non-transitory computer readable medium having stored thereon one or more programs, which when executed by the processor, causes the processor to: retrieve a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; map parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determine whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; exclude other nodes from execution of the strategy based on the determination; and execute strategies on the person node and the included other nodes. 15. The computer system of claim 14 wherein the user request includes a free key term request and at least one strategy includes searching for learning items based on the free key terms. 16. The computer system of claim 15 wherein at least one strategy includes searching for learning items based on at least one predetermined rule set, the free key term and terms related to the free key term. 17. The computer system of claim 14 wherein the user request includes an interest of the user and at least one strategy includes searching content nodes for learning content based on the interest of the user. 18. The computer system of claim 14 wherein mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request includes mapping associations between person nodes of persons in a group, and wherein at least one strategy includes finding content nodes based on interests of the user being similar to interests of persons in the group. 19. The computer system of claim 14 wherein at least one strategy includes searching content nodes having a relationship with an interest indication in the user request. 20. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions for:
retrieving a plurality of strategy algorithms from a learning graph in response to a user request, the learning graph comprising nodes, wherein a plurality of content nodes represent learning content, a plurality of strategy nodes represent predefined content identification strategy algorithms, and a plurality of person nodes represent individuals; mapping parameters about the user to person nodes to determine associations between the user and other nodes in response to the user request; determining whether the other nodes are to be included in the execution of strategies based on parameters of the strategy and the person nodes; excluding other nodes from execution of the strategy based on the determination; and executing strategies on the person node and the included other nodes. | 2,100 |
5,244 | 14,294,908 | 2,159 | The present invention discloses a method of managing a complex object in a cloud environment and a system thereof. In the method, an object model of the complex object is obtained, the object model comprises at least information describing a constraint, an attribute and a method of the complex objects. Then, the object model is analyzed to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object. Then, at least one data storage and at least one data service for the complex object are generated in the cloud environment based on the desired at least one data storage and at least one data service. | 1. A method for managing a complex object in a cloud environment, the method comprising:
obtaining, by one or more processors, an object model of the complex object, the object model comprising information describing a constraint, an attribute and a method of the complex object; analyzing, by one or more processors, the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and generating, by one or more processors, at least one data storage and at least one data service for the complex object in the cloud environment, based on the desired at least one data storage and at least one data service. 2. The method according to claim 1, wherein the constraint comprises at least one of:
being search-able of the attribute, being follow-able of the complex object, being tag-able of the complex object, being comment-able of the complex object, and being locatable of the complex object. 3. The method according to claim 1, wherein the object model further comprises information describing at least one of a relationship and a conditions-action of the complex object. 4. The method according to claim 1, wherein the analyzing of the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object comprises:
extracting, by one or more processors, metadata from the object model; establishing, by one or more processors, a mapping from the attribute to the corresponding data storage based on the extracted metadata; and determining, by one or more processors, at least one object service interface based on the information. 5. The method according to claim 4, wherein the establishing of a mapping from the attribute to the corresponding data storage based on the extracted metadata comprises:
determining, by one or more processors, that the attribute is any one of structural data, semi-structural data, non-structural data, spatial data and text data to be retrieved based on the extracted metadata; mapping, by one or more processors, the attribute to a relational database in response to determining that the attribute is the structural data; mapping, by one or more processors, the attribute to a non-relational database in response to determining that the attribute is the semi-structural data; mapping, by one or more processors, the attribute to an object storage system in response to determining that the attribute is the non-structure data; mapping, by one or more processors, the attribute to a spatial database in response to determining that the attribute is the spatial data; and mapping, by one or more processors, the attribute to an index database system in response to determining that the attribute is the text data to be retrieved. 6. The method according to claim 4, wherein the determining of at least one object service interface based on the information comprises:
determining, by one or more processors and in response to the information describing the attribute of the complex object, an interface for adding, deleting, modifying and querying the attribute; determining, by one or more processors and in response to the information describing the method of the complex object, an interface for exposing a public method; and determining, by one or more processors and in response to the information describing the constraint of the complex object, an interface for adding, obtaining and deleting the constraint. 7. The method according to claim 1, wherein the generating of at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service comprises:
selecting, by one or more processors, the available data storage corresponding to the desired at least one data storage in the cloud environment; generating, by one or more processors, a storage structure for the selected available data storage; and creating, by one or more processors, the corresponding object service interface based on the desired at least one data service. 8. The method according to claim 7, wherein the generating of at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service further comprises:
performing, by one or more processors, optimization of high availability on at least one of the selected available data storage. 9. The method according to claim 1, further comprising:
monitoring, by one or more processors, whether the object model changes; and updating, by one or more processors, the at least one data storage and the at least one data service for the complex object in response to the change of the object model. 10. The method according to claim 9, wherein monitoring whether the object model changes comprises:
monitoring, by one or more processors, whether new information has been added to the object model, or at least one piece of the information has been deleted from the object model, or at least one piece of the information has been modified in the object model. 11. The method according to claim 9, wherein the updating of the at least one data storage and the at least one data service for the complex object in response to the change of the object model comprises:
analyzing, by one or more processors, the changed object model to determine the desired data storage mapped with the change and at least one new data service; generating, by one or more processors, the new data storage based on the desired data storage; migrating, by one or more processors, the data in the data storage with the same type as the new data storage in the at least one data storage into the new data storage; modifying, by one or more processors, the at least one data service as the at least one new data service; and removing, by one or more processors, the data storage in which the stored data has been migrated and the at least one data service. 12. A system for managing a complex object in a cloud environment, comprising:
an obtaining hardware apparatus configured to obtain an object model of the complex object, the object model comprising at least information describing a constraint, an attribute and a method of the complex object; an analyzing hardware apparatus configured to analyze the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and a generating hardware apparatus configured to generate at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service. 13. The system according to claim 12, wherein the constraint comprises at least one of:
being search-able of the attribute, being follow-able of the complex object, being tag-able of the complex object, being comment-able of the complex object, and being locatable of the complex object. 14. The system according to claim 12, wherein the object model further comprises information describing at least one of a relationship and a conditions-action of the complex object. 15. The system according to claim 12, wherein the analyzing hardware apparatus comprises:
an extracting module configured to extract metadata from the object model; a mapping establishing module configured to establish a mapping from the attribute to the corresponding data storage based on the extracted metadata; and a determining module configured to determine at least one object service interface based on the information. 16. The system according to claim 15, wherein the mapping establishing module comprises:
a determining hardware unit configured to determine that the attribute is any one of structural data, semi-structural data, non-structural data, spatial data and text data to be retrieved based on the extracted metadata; a mapping hardware unit configured to map the attribute to a relational database in response to determining that the attribute is the structural data, to map the attribute to a non-relational database in response to determining that the attribute is the semi-structural data, to map the attribute to an object storage system in response to determining that the attribute is the non-structural data, to map the attribute to a spatial database in response to determining that the attribute is the spatial data, and to map the attribute to an index database system in response to determining that the attribute is the text data to be retrieved. 17. The system according to claim 15, wherein the determining module is configured to determine, in response to the information describing the attribute of the complex object, an interface for adding, deleting, modifying and querying the attribute, to determine, in response to the information describing the method of the complex object, an interface for exposing a public method, and to determine, in response to the information describing the constraint of the complex object, an interface for adding, obtaining and deleting the constraint. 18. The system according to claim 12, wherein the generating hardware apparatus comprises:
a selecting module configured to select the available data storage corresponding to the desired at least one data storage in the cloud environment; a generating module configured to generate the storage structures for the selected available data storage; and a creating module configured to create the corresponding object service interface based on the desired at least one data service. 19. The system according to claim 18, wherein the generating hardware apparatus further comprises:
an optimizing module configured to perform optimization of high availability on at least one of the selected available data storage. 20. A computer program product for managing a complex object in a cloud environment, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising:
obtaining an object model of the complex object, the object model comprising information describing a constraint, an attribute and a method of the complex object; analyzing the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and generating at least one data storage and at least one data service for the complex object in the cloud environment, based on the desired at least one data storage and at least one data service. | The present invention discloses a method of managing a complex object in a cloud environment and a system thereof. In the method, an object model of the complex object is obtained, the object model comprises at least information describing a constraint, an attribute and a method of the complex objects. Then, the object model is analyzed to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object. Then, at least one data storage and at least one data service for the complex object are generated in the cloud environment based on the desired at least one data storage and at least one data service.1. A method for managing a complex object in a cloud environment, the method comprising:
obtaining, by one or more processors, an object model of the complex object, the object model comprising information describing a constraint, an attribute and a method of the complex object; analyzing, by one or more processors, the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and generating, by one or more processors, at least one data storage and at least one data service for the complex object in the cloud environment, based on the desired at least one data storage and at least one data service. 2. The method according to claim 1, wherein the constraint comprises at least one of:
being search-able of the attribute, being follow-able of the complex object, being tag-able of the complex object, being comment-able of the complex object, and being locatable of the complex object. 3. The method according to claim 1, wherein the object model further comprises information describing at least one of a relationship and a conditions-action of the complex object. 4. The method according to claim 1, wherein the analyzing of the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object comprises:
extracting, by one or more processors, metadata from the object model; establishing, by one or more processors, a mapping from the attribute to the corresponding data storage based on the extracted metadata; and determining, by one or more processors, at least one object service interface based on the information. 5. The method according to claim 4, wherein the establishing of a mapping from the attribute to the corresponding data storage based on the extracted metadata comprises:
determining, by one or more processors, that the attribute is any one of structural data, semi-structural data, non-structural data, spatial data and text data to be retrieved based on the extracted metadata; mapping, by one or more processors, the attribute to a relational database in response to determining that the attribute is the structural data; mapping, by one or more processors, the attribute to a non-relational database in response to determining that the attribute is the semi-structural data; mapping, by one or more processors, the attribute to an object storage system in response to determining that the attribute is the non-structure data; mapping, by one or more processors, the attribute to a spatial database in response to determining that the attribute is the spatial data; and mapping, by one or more processors, the attribute to an index database system in response to determining that the attribute is the text data to be retrieved. 6. The method according to claim 4, wherein the determining of at least one object service interface based on the information comprises:
determining, by one or more processors and in response to the information describing the attribute of the complex object, an interface for adding, deleting, modifying and querying the attribute; determining, by one or more processors and in response to the information describing the method of the complex object, an interface for exposing a public method; and determining, by one or more processors and in response to the information describing the constraint of the complex object, an interface for adding, obtaining and deleting the constraint. 7. The method according to claim 1, wherein the generating of at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service comprises:
selecting, by one or more processors, the available data storage corresponding to the desired at least one data storage in the cloud environment; generating, by one or more processors, a storage structure for the selected available data storage; and creating, by one or more processors, the corresponding object service interface based on the desired at least one data service. 8. The method according to claim 7, wherein the generating of at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service further comprises:
performing, by one or more processors, optimization of high availability on at least one of the selected available data storage. 9. The method according to claim 1, further comprising:
monitoring, by one or more processors, whether the object model changes; and updating, by one or more processors, the at least one data storage and the at least one data service for the complex object in response to the change of the object model. 10. The method according to claim 9, wherein monitoring whether the object model changes comprises:
monitoring, by one or more processors, whether new information has been added to the object model, or at least one piece of the information has been deleted from the object model, or at least one piece of the information has been modified in the object model. 11. The method according to claim 9, wherein the updating of the at least one data storage and the at least one data service for the complex object in response to the change of the object model comprises:
analyzing, by one or more processors, the changed object model to determine the desired data storage mapped with the change and at least one new data service; generating, by one or more processors, the new data storage based on the desired data storage; migrating, by one or more processors, the data in the data storage with the same type as the new data storage in the at least one data storage into the new data storage; modifying, by one or more processors, the at least one data service as the at least one new data service; and removing, by one or more processors, the data storage in which the stored data has been migrated and the at least one data service. 12. A system for managing a complex object in a cloud environment, comprising:
an obtaining hardware apparatus configured to obtain an object model of the complex object, the object model comprising at least information describing a constraint, an attribute and a method of the complex object; an analyzing hardware apparatus configured to analyze the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and a generating hardware apparatus configured to generate at least one data storage and at least one data service for the complex object in the cloud environment based on the desired at least one data storage and at least one data service. 13. The system according to claim 12, wherein the constraint comprises at least one of:
being search-able of the attribute, being follow-able of the complex object, being tag-able of the complex object, being comment-able of the complex object, and being locatable of the complex object. 14. The system according to claim 12, wherein the object model further comprises information describing at least one of a relationship and a conditions-action of the complex object. 15. The system according to claim 12, wherein the analyzing hardware apparatus comprises:
an extracting module configured to extract metadata from the object model; a mapping establishing module configured to establish a mapping from the attribute to the corresponding data storage based on the extracted metadata; and a determining module configured to determine at least one object service interface based on the information. 16. The system according to claim 15, wherein the mapping establishing module comprises:
a determining hardware unit configured to determine that the attribute is any one of structural data, semi-structural data, non-structural data, spatial data and text data to be retrieved based on the extracted metadata; a mapping hardware unit configured to map the attribute to a relational database in response to determining that the attribute is the structural data, to map the attribute to a non-relational database in response to determining that the attribute is the semi-structural data, to map the attribute to an object storage system in response to determining that the attribute is the non-structural data, to map the attribute to a spatial database in response to determining that the attribute is the spatial data, and to map the attribute to an index database system in response to determining that the attribute is the text data to be retrieved. 17. The system according to claim 15, wherein the determining module is configured to determine, in response to the information describing the attribute of the complex object, an interface for adding, deleting, modifying and querying the attribute, to determine, in response to the information describing the method of the complex object, an interface for exposing a public method, and to determine, in response to the information describing the constraint of the complex object, an interface for adding, obtaining and deleting the constraint. 18. The system according to claim 12, wherein the generating hardware apparatus comprises:
a selecting module configured to select the available data storage corresponding to the desired at least one data storage in the cloud environment; a generating module configured to generate the storage structures for the selected available data storage; and a creating module configured to create the corresponding object service interface based on the desired at least one data service. 19. The system according to claim 18, wherein the generating hardware apparatus further comprises:
an optimizing module configured to perform optimization of high availability on at least one of the selected available data storage. 20. A computer program product for managing a complex object in a cloud environment, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising:
obtaining an object model of the complex object, the object model comprising information describing a constraint, an attribute and a method of the complex object; analyzing the object model to determine at least one desired data storage mapped with the object model and at least one desired data service representing an object service interface for accessing the complex object; and generating at least one data storage and at least one data service for the complex object in the cloud environment, based on the desired at least one data storage and at least one data service. | 2,100 |
5,245 | 13,408,890 | 2,128 | Methods and apparatus for improving printability of a three-dimensional model are disclosed. For a computer-based three-dimensional model to be generated by a three-dimensional printing system, a three-dimensional printability analysis of the model is performed. The three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model. The three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model. For each point of the one or more points, one or more corrections to the model designed to decrease the stresses associated with a respective test case are calculated. For each test case, the corrections are evaluated. The evaluating includes selecting a preferred correction based on one or more criteria. | 1. A computer-implemented method, the method comprising:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, performing a three-dimensional printability analysis of the model, wherein
the three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model;
the three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculating one or more corrections to the model designed to decrease the stresses associated with a respective test case; and for each test case, evaluating the corrections, wherein the evaluating comprises selecting a preferred correction based on one or more criteria. 2. The computer implemented method of claim 1, wherein
the one or more corrections comprise adding a supporting member to a component of the model. 3. The computer implemented method of claim 1, wherein
the one or more corrections comprise adjusting a thickness of a component of the model. 4. The computer implemented method of claim 1, wherein
the one or more corrections comprise inserting a void into the model. 5. The computer implemented method of claim 1, wherein
the evaluating the corrections further comprises analyzing a change in material cost reflecting the corrections. 6. The computer implemented method of claim 1, wherein
the evaluating the corrections further comprises analyzing visibility of design changes resulting from the corrections. 7. The computer implemented method of claim 1, further comprising
presenting one or more revised models to a user, wherein the one or more revised models reflect at least one of the one or more corrections. 8. A non-transitory computer-readable storage medium storing program instructions, wherein the program instructions are computer-executable to implement:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, performing a three-dimensional printability analysis of the model, wherein
the program instructions computer-executable to implement the three-dimensional printability analysis further comprise program instructions computer-executable to implement applying one or more test cases representing forces that may be applied to the model;
the program instructions computer-executable to implement the three-dimensional printability analysis further comprise program instructions computer-executable to implement generating one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculating one or more corrections to the model designed to decrease the stresses associated with a respective test case; and for each test case, evaluating the corrections, wherein the program instructions computer-executable to implement the evaluating comprise program instructions computer-executable to implement selecting a preferred correction based on one or more criteria. 9. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations using respective weights assigned to
changes in material cost resulting from respective ones of the one or more corrections, and
visibility of design changes resulting from the one or more corrections. 10. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations using respective user-adjustable weights assigned to
changes in material cost resulting from respective ones of the one or more corrections, and
visibility of design changes resulting from the one or more corrections. 11. The non-transitory computer-readable storage medium of claim 8, wherein
the one or more corrections comprise changing the material proposed for fabrication of the model. 12. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on user indicated preferences for particular types of corrections. 13. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations of a scoring model comprising weights reflecting user indicated preferences for particular types of corrections. 14. A system, comprising:
at least one processor; and a memory comprising program instructions, wherein the program instructions are executable by the at least one processor to:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, perform a three-dimensional printability analysis of the model, wherein
the three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model;
the three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculate one or more corrections to the model designed to decrease the stresses associated with a respective test case; and
for each test case, evaluate the corrections, wherein the program instructions executable by the at least one processor to evaluating comprises program instructions executable by the at least one processor to select a preferred correction based on one or more criteria. 15. The system of claim 14, further comprising
program instructions executable by the at least one processor to determine the set of test cases for the model of the solid object to be generated by the automated manufacturing system, wherein
each test case of the set of test cases represents an orientation of the solid object relative to a support; 16. The system of claim 15, wherein
program instructions executable by the at least one processor to determine the set of test cases for the model of the solid object to be generated by the automated manufacturing system comprises program instructions executable by the at least one processor to detect surfaces by which the solid object may receive force. 17. The computer implemented method of claim 16, wherein
program instructions executable by the at least one processor to evaluate the corrections comprise program instructions executable by the at least one processor to iterate the structural analysis of the model with the corrections to the model. 18. The system of claim 14, wherein
program instructions executable by the at least one processor to evaluate the corrections further comprise program instructions executable by the at least one processor to analyze a net change of external model dimensions resulting from the corrections. 19. The system of claim 14, wherein
the one or more corrections comprise adjusting a thickness of a component of the model. 20. The system of claim 14, wherein
the one or more corrections comprise inserting a void into the model. | Methods and apparatus for improving printability of a three-dimensional model are disclosed. For a computer-based three-dimensional model to be generated by a three-dimensional printing system, a three-dimensional printability analysis of the model is performed. The three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model. The three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model. For each point of the one or more points, one or more corrections to the model designed to decrease the stresses associated with a respective test case are calculated. For each test case, the corrections are evaluated. The evaluating includes selecting a preferred correction based on one or more criteria.1. A computer-implemented method, the method comprising:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, performing a three-dimensional printability analysis of the model, wherein
the three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model;
the three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculating one or more corrections to the model designed to decrease the stresses associated with a respective test case; and for each test case, evaluating the corrections, wherein the evaluating comprises selecting a preferred correction based on one or more criteria. 2. The computer implemented method of claim 1, wherein
the one or more corrections comprise adding a supporting member to a component of the model. 3. The computer implemented method of claim 1, wherein
the one or more corrections comprise adjusting a thickness of a component of the model. 4. The computer implemented method of claim 1, wherein
the one or more corrections comprise inserting a void into the model. 5. The computer implemented method of claim 1, wherein
the evaluating the corrections further comprises analyzing a change in material cost reflecting the corrections. 6. The computer implemented method of claim 1, wherein
the evaluating the corrections further comprises analyzing visibility of design changes resulting from the corrections. 7. The computer implemented method of claim 1, further comprising
presenting one or more revised models to a user, wherein the one or more revised models reflect at least one of the one or more corrections. 8. A non-transitory computer-readable storage medium storing program instructions, wherein the program instructions are computer-executable to implement:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, performing a three-dimensional printability analysis of the model, wherein
the program instructions computer-executable to implement the three-dimensional printability analysis further comprise program instructions computer-executable to implement applying one or more test cases representing forces that may be applied to the model;
the program instructions computer-executable to implement the three-dimensional printability analysis further comprise program instructions computer-executable to implement generating one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculating one or more corrections to the model designed to decrease the stresses associated with a respective test case; and for each test case, evaluating the corrections, wherein the program instructions computer-executable to implement the evaluating comprise program instructions computer-executable to implement selecting a preferred correction based on one or more criteria. 9. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations using respective weights assigned to
changes in material cost resulting from respective ones of the one or more corrections, and
visibility of design changes resulting from the one or more corrections. 10. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations using respective user-adjustable weights assigned to
changes in material cost resulting from respective ones of the one or more corrections, and
visibility of design changes resulting from the one or more corrections. 11. The non-transitory computer-readable storage medium of claim 8, wherein
the one or more corrections comprise changing the material proposed for fabrication of the model. 12. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on user indicated preferences for particular types of corrections. 13. The non-transitory computer-readable storage medium of claim 8, wherein
the program instructions computer-executable to implement the calculating the one or more corrections to the model designed to decrease the stresses associated with the test case further comprise program instructions computer-executable to implement
selecting the one or more corrections based on calculations of a scoring model comprising weights reflecting user indicated preferences for particular types of corrections. 14. A system, comprising:
at least one processor; and a memory comprising program instructions, wherein the program instructions are executable by the at least one processor to:
for a computer-based three-dimensional model to be generated by a three-dimensional printing system, perform a three-dimensional printability analysis of the model, wherein
the three-dimensional printability analysis applies one or more test cases representing forces that may be applied to the model;
the three-dimensional printability analysis generates one or more points at which stresses associated with the test case exceed the structural tolerances of a material to be used by the three-dimensional printing system for a fabrication of the model;
for each point of the one or more points, calculate one or more corrections to the model designed to decrease the stresses associated with a respective test case; and
for each test case, evaluate the corrections, wherein the program instructions executable by the at least one processor to evaluating comprises program instructions executable by the at least one processor to select a preferred correction based on one or more criteria. 15. The system of claim 14, further comprising
program instructions executable by the at least one processor to determine the set of test cases for the model of the solid object to be generated by the automated manufacturing system, wherein
each test case of the set of test cases represents an orientation of the solid object relative to a support; 16. The system of claim 15, wherein
program instructions executable by the at least one processor to determine the set of test cases for the model of the solid object to be generated by the automated manufacturing system comprises program instructions executable by the at least one processor to detect surfaces by which the solid object may receive force. 17. The computer implemented method of claim 16, wherein
program instructions executable by the at least one processor to evaluate the corrections comprise program instructions executable by the at least one processor to iterate the structural analysis of the model with the corrections to the model. 18. The system of claim 14, wherein
program instructions executable by the at least one processor to evaluate the corrections further comprise program instructions executable by the at least one processor to analyze a net change of external model dimensions resulting from the corrections. 19. The system of claim 14, wherein
the one or more corrections comprise adjusting a thickness of a component of the model. 20. The system of claim 14, wherein
the one or more corrections comprise inserting a void into the model. | 2,100 |
5,246 | 14,748,798 | 2,133 | Methods and apparatus for effecting a processor- and platform-assisted NVDIMM solution using standard DRAM and consolidated storage. The methods and apparatus enable selected data in DRAM devices, such as DIMMs to be automatically copied to a persistent storage device such as an SSD in response to detection of a power unavailable event or an operating system error or failure without any operating system intervention. In one aspect, a platform includes a power supply and a temporary power source, such as a capacitor-based energy storage device, a small battery, or a combination of the two, either integrated in the power supply or separate. When power becomes unavailable, the temporary power source is use to continue to provide power to selected components in one or more power protected domains. The energy stored in the temporary power source is sufficient to temporarily power the components to enable DRAM data to be written to the persistent storage device. Upon system restart, the previously-stored DRAM data is restored to one or more DRAM devices from which the data was originally copied. | 1. A method for saving data in dynamic random access memory (DRAM) in a computer platform to a persistent storage device, wherein the computer platform includes a primary power source used to provide power to components in the computer platform during normal operation, the computer platform including the persistent storage device and running an operating system during normal operation, the method comprising:
detecting a power unavailable condition under which power is no longer being supplied by the primary power source to the computer platform; and, in response to detection of the power unavailable condition, automatically copying data in the DRAM to the persistent storage device without operating system intervention. 2. The method of claim 1, wherein the computer platform includes a processor including a plurality of caches, the method further comprising flushing data in the caches to DRAM prior to copying the data in the DRAM to the persistent storage device. 3. The method of claim 1, further comprising:
defining at least one region of the DRAM address space to comprise persistent DRAM; configuring a persistent storage area on the persistent storage device in which the data in the persistent DRAM is to be stored; and storing the data copied from the persistent DRAM to the persistent storage area. 4. The method of claim 1, wherein the computer platform includes a power protected direct memory access (DMA) engine, the method further comprising programming the power protected DMA engine to copy data in the DRAM to the persistent storage device. 5. The method of claim 1, wherein the computer platform further comprises:
a processor including,
at least one memory controller including a first memory controller; and
an input-output (IO) interface including a Direct Memory Access (DMA) engine;
at least one DRAM device in which data to be saved is stored prior to the power unavailable condition, operatively coupled to the first memory controller via a first memory controller-to-DRAM device link; and an IO link coupling the persistent storage device to the IO interface, wherein the method further comprises providing temporary power to a plurality of power protected components in the computer platform in response to detection of the power unavailable condition, wherein the plurality of power protected components include the first memory controller, the DMA engine, the at least one DRAM device, the first memory controller-to-DRAM device link, the IO link coupling the persistent storage device to the IO interface, and the persistent storage device. 6. The method of claim 5, wherein the temporary power is provided via a capacitor-based power circuit. 7. The method of claim 1, further comprising:
determining, during a platform initialization operation, whether the persistent storage device is storing any DRAM data that was previously copied from DRAM to the persistent storage device in response to a power unavailable condition; and restoring the DRAM data to one or more DRAM devices from which the DRAM data was copied. 8. The method of claim 7, wherein the DRAM data is stored in a scrambled format before being copied to the persistent storage device, and the DRAM data is restored using a non-scrambled format. 9. The method of claim 1, wherein automatically copying data in the DRAM to the persistent storage device without operating system intervention is implemented through the use of a System Management Interrupt (SMI) and one or more System Management Mode (SMM) handlers, wherein in response to detection of the power unavailable condition an SMI is invoked that dispatches the one or more SMM handlers to service the SMI by copying the DRAM data to the persistent storage device. 10. A computing platform having a primary power source, comprising:
a processor including,
at least one memory controller including a first memory controller; and
an input-output (IO) interface including a Direct Memory Access (DMA) engine;
at least one dynamic random access memory (DRAM) device including a first DRAM device, operatively coupled to the first memory controller via a first memory controller-to-DRAM device link; a persistent storage device, operatively coupled to the IO interface via an IO link; and a temporary power source, operatively coupled to each of the first memory controller, the persistent storage device, the IO link, the first DRAM device, and the first memory controller-to-DRAM device link, wherein the temporary power source is configured to supply power to each of the first memory controller, the persistent storage device, the IO link, the first DRAM device, and the first memory controller-to-DRAM device link for a finite period of time in the event of a condition under which the primary power source no longer supplies power to the computer platform; wherein the computer platform is configured to detect a condition under which the primary power source no longer supplies power to the computer platform and wherein in response to detection of the condition the IO interface is configured to copy data stored in the first DRAM to the persistent storage device via the DMA engine. 11. The computer platform of claim 10, wherein the compute platform is further configured to restore data that has previously been copied from the first DRAM device to the persistent storage device during a platform initialization operation performed by copying data from the persistent storage device to the first DRAM device via the DMA engine. 12. The compute platform of claim 10, wherein the compute platform includes a plurality of DRAM devices comprising DRAM dual in-line memory modules (DIMMs), each coupled to a memory controller via a memory controller-to-DRAM DIMM link, wherein the temporary power source is configured to supply power to each of the plurality of DRAM DIMMs, each memory controller, and each memory controller-to-DRAM DIMM link in the event of a condition under which the primary power source no longer supplies power to the computer platform; and wherein in response to detection of the condition under which the primary power source no longer supplies power to the computer platform the IO interface is configured to copy data stored on each of the plurality of DRAM DIMMs to the persistent storage device via the DMA engine. 13. The compute platform of claim 12, wherein the processor includes at least two memory controllers, each memory controller coupled to at least two DRAM DIMMs. 14. The computer platform of claim 12, wherein the compute platform is further configured to restore data that has previously been copied from each of the plurality of DRAM DIMMS to the persistent storage device during a platform initialization operation performed by copying the previously copied data from the persistent storage device to each of the DRAM DIMMs via the DMA engine, wherein, upon restoration of the data each DRAM DIMM stores the same data that it was storing prior to the occurrence of the condition under which the primary power source no longer was supplying power to the computer platform. 15. The computer platform of claim 10, wherein the IO link comprises a Peripheral Control Interconnect Express (PCIe) link. 16. The computer platform of claim 10, wherein the persistent storage device comprises a solid-state drive (SSD). 17. The computer platform of claim 10, wherein the processor includes at least one processor cache, and manages a write-pending queue, and wherein in response to detection of the unavailable power condition, data in the at least one processor cache and the write-pending queue is flushed to the first DRAM device prior to copying the data from the first DRAM device to the persistent storage device. 18. The computer platform of claim 10, wherein the processor includes a central processor unit (CPU) with a plurality of cores, and the IO interface is coupled to a plurality of IO links, and wherein in response to detect of the unavailable power condition the processor enters a power down state where all of the IO links except the power protected links have their power reduced, and the cores are operated in a reduced power state. 19. The computer platform of claim 10, wherein upon completion of copying the data from the DRAM device to the persistent storage device, meta-data stored in the persistent storage device is updated to indicate the data has been successfully saved to the persistent storage device. 20. A processor, configured to be installed in a computer platform including a power supply having a primary power input source, one or more dynamic random access memory (DRAM) devices, and a persistent storage device, the processor comprising:
a plurality of processor cores, operatively coupled to an interconnect; at least one memory controller including a first memory controller and memory controller interface, operatively coupled to the interconnect and configured to interface with a first memory controller to DRAM device link coupled at an opposing end to a first DRAM device when the processor is installed in the computer platform; an input-output (IO) interface, operatively coupled to the interconnect and including a link interface for an IO link to which the persistent storage device is coupled; a Direct Memory Access (DMA) engine; and logic, configured upon operation of the processor to,
detect a power unavailable condition under which the primary power input source no longer supplies power to the power supply; and in response to detection of the condition,
copy DRAM data stored in the first DRAM device to the persistent storage device. 21. The processor of claim 20, further comprising a Direct Memory Access (DMA) engine, and wherein the DRAM data stored in the first DRAM device is copied to the persistent storage device via the DMA engine. 22. The processor of claim 20, wherein the processor is configured to implement a System Management Interrupt (SMI) and to operate in a System Management Mode (SMM), and further wherein the processor is configured, upon operation and in response to the power unavailable condition, to invoke an SMI and dispatch one or more SMM handlers to service the SMI by copying the DRAM data stored in the first DRAM device to the persistent storage device. 23. The processor of claim 20, wherein the processor further comprises at least one of a APIC (Advance Programmable Interrupt Controller) logic block and a power control unit (PCU), and in response to the detection of the condition at least one of the APIC logic block and the PCU is configured to provide power to selected components in the processor to enable the DRAM data to be copied to the persistent storage device, while reducing power to other components on the processor that are not employed to facilitate transfer of data to the persistent storage device via the DRAM data copy. 24. The processor of claim 20, wherein the compute platform comprises a multi-socket platform having a plurality of sockets and including a first socket comprising a local socket and a second socket comprising a remote socket and a socket-to-socket interconnect between the first and second sockets, wherein the processor is configured to have respective instances of the processor installed in respective local and remote sockets, and wherein the processor further comprises a socket-to-socket interconnect interface configured to couple to the socket-to-socket interconnect, and further wherein the processor includes logic configured, in response to detection of the power unavailable condition and when the processor is installed in a local socket, to:
copy data from one or more DRAM devices accessed via one or more memory controllers on the processor to the persistent storage device; and interface with the processor in the remote socket to copy data from one or more DRAM devices accessed via one or more memory controllers on the processor installed in the remote socket to the persistent storage device. 25. The processor of claim 20, wherein upon completion of copying the data from the first DRAM device to the persistent storage device, the processor is configured to send data over the IO link to update meta-data stored in the persistent storage device to indicate the data has been successfully saved to the persistent storage device. | Methods and apparatus for effecting a processor- and platform-assisted NVDIMM solution using standard DRAM and consolidated storage. The methods and apparatus enable selected data in DRAM devices, such as DIMMs to be automatically copied to a persistent storage device such as an SSD in response to detection of a power unavailable event or an operating system error or failure without any operating system intervention. In one aspect, a platform includes a power supply and a temporary power source, such as a capacitor-based energy storage device, a small battery, or a combination of the two, either integrated in the power supply or separate. When power becomes unavailable, the temporary power source is use to continue to provide power to selected components in one or more power protected domains. The energy stored in the temporary power source is sufficient to temporarily power the components to enable DRAM data to be written to the persistent storage device. Upon system restart, the previously-stored DRAM data is restored to one or more DRAM devices from which the data was originally copied.1. A method for saving data in dynamic random access memory (DRAM) in a computer platform to a persistent storage device, wherein the computer platform includes a primary power source used to provide power to components in the computer platform during normal operation, the computer platform including the persistent storage device and running an operating system during normal operation, the method comprising:
detecting a power unavailable condition under which power is no longer being supplied by the primary power source to the computer platform; and, in response to detection of the power unavailable condition, automatically copying data in the DRAM to the persistent storage device without operating system intervention. 2. The method of claim 1, wherein the computer platform includes a processor including a plurality of caches, the method further comprising flushing data in the caches to DRAM prior to copying the data in the DRAM to the persistent storage device. 3. The method of claim 1, further comprising:
defining at least one region of the DRAM address space to comprise persistent DRAM; configuring a persistent storage area on the persistent storage device in which the data in the persistent DRAM is to be stored; and storing the data copied from the persistent DRAM to the persistent storage area. 4. The method of claim 1, wherein the computer platform includes a power protected direct memory access (DMA) engine, the method further comprising programming the power protected DMA engine to copy data in the DRAM to the persistent storage device. 5. The method of claim 1, wherein the computer platform further comprises:
a processor including,
at least one memory controller including a first memory controller; and
an input-output (IO) interface including a Direct Memory Access (DMA) engine;
at least one DRAM device in which data to be saved is stored prior to the power unavailable condition, operatively coupled to the first memory controller via a first memory controller-to-DRAM device link; and an IO link coupling the persistent storage device to the IO interface, wherein the method further comprises providing temporary power to a plurality of power protected components in the computer platform in response to detection of the power unavailable condition, wherein the plurality of power protected components include the first memory controller, the DMA engine, the at least one DRAM device, the first memory controller-to-DRAM device link, the IO link coupling the persistent storage device to the IO interface, and the persistent storage device. 6. The method of claim 5, wherein the temporary power is provided via a capacitor-based power circuit. 7. The method of claim 1, further comprising:
determining, during a platform initialization operation, whether the persistent storage device is storing any DRAM data that was previously copied from DRAM to the persistent storage device in response to a power unavailable condition; and restoring the DRAM data to one or more DRAM devices from which the DRAM data was copied. 8. The method of claim 7, wherein the DRAM data is stored in a scrambled format before being copied to the persistent storage device, and the DRAM data is restored using a non-scrambled format. 9. The method of claim 1, wherein automatically copying data in the DRAM to the persistent storage device without operating system intervention is implemented through the use of a System Management Interrupt (SMI) and one or more System Management Mode (SMM) handlers, wherein in response to detection of the power unavailable condition an SMI is invoked that dispatches the one or more SMM handlers to service the SMI by copying the DRAM data to the persistent storage device. 10. A computing platform having a primary power source, comprising:
a processor including,
at least one memory controller including a first memory controller; and
an input-output (IO) interface including a Direct Memory Access (DMA) engine;
at least one dynamic random access memory (DRAM) device including a first DRAM device, operatively coupled to the first memory controller via a first memory controller-to-DRAM device link; a persistent storage device, operatively coupled to the IO interface via an IO link; and a temporary power source, operatively coupled to each of the first memory controller, the persistent storage device, the IO link, the first DRAM device, and the first memory controller-to-DRAM device link, wherein the temporary power source is configured to supply power to each of the first memory controller, the persistent storage device, the IO link, the first DRAM device, and the first memory controller-to-DRAM device link for a finite period of time in the event of a condition under which the primary power source no longer supplies power to the computer platform; wherein the computer platform is configured to detect a condition under which the primary power source no longer supplies power to the computer platform and wherein in response to detection of the condition the IO interface is configured to copy data stored in the first DRAM to the persistent storage device via the DMA engine. 11. The computer platform of claim 10, wherein the compute platform is further configured to restore data that has previously been copied from the first DRAM device to the persistent storage device during a platform initialization operation performed by copying data from the persistent storage device to the first DRAM device via the DMA engine. 12. The compute platform of claim 10, wherein the compute platform includes a plurality of DRAM devices comprising DRAM dual in-line memory modules (DIMMs), each coupled to a memory controller via a memory controller-to-DRAM DIMM link, wherein the temporary power source is configured to supply power to each of the plurality of DRAM DIMMs, each memory controller, and each memory controller-to-DRAM DIMM link in the event of a condition under which the primary power source no longer supplies power to the computer platform; and wherein in response to detection of the condition under which the primary power source no longer supplies power to the computer platform the IO interface is configured to copy data stored on each of the plurality of DRAM DIMMs to the persistent storage device via the DMA engine. 13. The compute platform of claim 12, wherein the processor includes at least two memory controllers, each memory controller coupled to at least two DRAM DIMMs. 14. The computer platform of claim 12, wherein the compute platform is further configured to restore data that has previously been copied from each of the plurality of DRAM DIMMS to the persistent storage device during a platform initialization operation performed by copying the previously copied data from the persistent storage device to each of the DRAM DIMMs via the DMA engine, wherein, upon restoration of the data each DRAM DIMM stores the same data that it was storing prior to the occurrence of the condition under which the primary power source no longer was supplying power to the computer platform. 15. The computer platform of claim 10, wherein the IO link comprises a Peripheral Control Interconnect Express (PCIe) link. 16. The computer platform of claim 10, wherein the persistent storage device comprises a solid-state drive (SSD). 17. The computer platform of claim 10, wherein the processor includes at least one processor cache, and manages a write-pending queue, and wherein in response to detection of the unavailable power condition, data in the at least one processor cache and the write-pending queue is flushed to the first DRAM device prior to copying the data from the first DRAM device to the persistent storage device. 18. The computer platform of claim 10, wherein the processor includes a central processor unit (CPU) with a plurality of cores, and the IO interface is coupled to a plurality of IO links, and wherein in response to detect of the unavailable power condition the processor enters a power down state where all of the IO links except the power protected links have their power reduced, and the cores are operated in a reduced power state. 19. The computer platform of claim 10, wherein upon completion of copying the data from the DRAM device to the persistent storage device, meta-data stored in the persistent storage device is updated to indicate the data has been successfully saved to the persistent storage device. 20. A processor, configured to be installed in a computer platform including a power supply having a primary power input source, one or more dynamic random access memory (DRAM) devices, and a persistent storage device, the processor comprising:
a plurality of processor cores, operatively coupled to an interconnect; at least one memory controller including a first memory controller and memory controller interface, operatively coupled to the interconnect and configured to interface with a first memory controller to DRAM device link coupled at an opposing end to a first DRAM device when the processor is installed in the computer platform; an input-output (IO) interface, operatively coupled to the interconnect and including a link interface for an IO link to which the persistent storage device is coupled; a Direct Memory Access (DMA) engine; and logic, configured upon operation of the processor to,
detect a power unavailable condition under which the primary power input source no longer supplies power to the power supply; and in response to detection of the condition,
copy DRAM data stored in the first DRAM device to the persistent storage device. 21. The processor of claim 20, further comprising a Direct Memory Access (DMA) engine, and wherein the DRAM data stored in the first DRAM device is copied to the persistent storage device via the DMA engine. 22. The processor of claim 20, wherein the processor is configured to implement a System Management Interrupt (SMI) and to operate in a System Management Mode (SMM), and further wherein the processor is configured, upon operation and in response to the power unavailable condition, to invoke an SMI and dispatch one or more SMM handlers to service the SMI by copying the DRAM data stored in the first DRAM device to the persistent storage device. 23. The processor of claim 20, wherein the processor further comprises at least one of a APIC (Advance Programmable Interrupt Controller) logic block and a power control unit (PCU), and in response to the detection of the condition at least one of the APIC logic block and the PCU is configured to provide power to selected components in the processor to enable the DRAM data to be copied to the persistent storage device, while reducing power to other components on the processor that are not employed to facilitate transfer of data to the persistent storage device via the DRAM data copy. 24. The processor of claim 20, wherein the compute platform comprises a multi-socket platform having a plurality of sockets and including a first socket comprising a local socket and a second socket comprising a remote socket and a socket-to-socket interconnect between the first and second sockets, wherein the processor is configured to have respective instances of the processor installed in respective local and remote sockets, and wherein the processor further comprises a socket-to-socket interconnect interface configured to couple to the socket-to-socket interconnect, and further wherein the processor includes logic configured, in response to detection of the power unavailable condition and when the processor is installed in a local socket, to:
copy data from one or more DRAM devices accessed via one or more memory controllers on the processor to the persistent storage device; and interface with the processor in the remote socket to copy data from one or more DRAM devices accessed via one or more memory controllers on the processor installed in the remote socket to the persistent storage device. 25. The processor of claim 20, wherein upon completion of copying the data from the first DRAM device to the persistent storage device, the processor is configured to send data over the IO link to update meta-data stored in the persistent storage device to indicate the data has been successfully saved to the persistent storage device. | 2,100 |
5,247 | 14,454,537 | 2,112 | A method for adjustable error correction in a storage cluster is provided. The method includes determining health of a non-volatile memory of a non-volatile solid-state storage unit of each of a plurality of storage nodes in a storage cluster on a basis of per flash package, per flash die, per flash plane, per flash block, or per flash page. The determining is performed by the storage cluster. The plurality of storage nodes is housed within a chassis that couples the storage nodes as the storage cluster. The method includes adjusting erasure coding across the plurality of storage nodes based on the health of the non-volatile memory and distributing user data throughout the plurality of storage nodes through the erasure coding. The user data is accessible via the erasure coding from a remainder of the plurality of storage nodes if any of the plurality of storage nodes are unreachable. | 1. A method for adjustable error correction, comprising:
determining health of a plurality of storage nodes in a storage cluster, wherein each of the plurality of storage nodes is configured to have at least one authority that controls erasure coding of a range of user data of which the at least one authority is an owner; and adjusting erasure coding based on the health of at least one of the plurality of storage nodes. 2. The method of claim 1, further comprising:
ranking portions of non-volatile memory of at least one of the plurality of storage nodes based on the health of the at least one of the plurality of storage nodes, wherein adjusting the erasure coding includes assigning differing numbers of bits for error correction code (ECC) to differing portions of the non-volatile memory of the at least one of the plurality of storage nodes according to the ranking. 3. The method of claim 1, wherein adjusting the erasure coding comprises:
adjusting a stripe width and a type of error correction code (ECC). 4. The method of claim 1, wherein the at least one authority selects an erasure coding scheme for distributing the range of user data across the plurality of storage nodes and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. 5. The method of claim 1, wherein adjusting the erasure coding is controlled by the at least one authority. 6. The method of claim 1, wherein determining the health of each of the plurality of storage nodes includes producing diagnostic information on a basis of per package, per die, per plane, per block, or per page. 7. The method of claim 1, further comprising:
grading a plurality of portions of non-volatile memory of at least one of the plurality of storage nodes per the health of the at least one of the plurality of storage nodes, wherein adjusting the erasure coding includes assigning a plurality of levels of data stripes or error correction code to the plurality of portions of the non-volatile memory according to the grading. 8. The method of claim 1, further comprising:
assigning a plurality of grades to non-volatile memory of at least one of the plurality of storage nodes according to the health of the at least one of the plurality of storage nodes; and determining a type of user data for a portion of the user data, wherein distributing the user data includes writing the portion of the user data to a portion of the non-volatile memory having a one of the plurality of grades, according to the type of user data. 9. A plurality of storage nodes in a chassis, comprising:
the plurality of storage nodes configured to communicate together as a storage cluster, each of the plurality of storage nodes having non-volatile memory for user data storage, the plurality of storage nodes configured to determine health of the non-volatile memory; each storage node of the plurality of storage nodes having at least one authority configured to control erasure coding of a range of user data; and the plurality of storage nodes configured to adjust erasure coding, responsive to determining the health of the non-volatile memory. 10. The plurality of storage nodes in a chassis of claim 9, wherein the at least one authority owns the range of user data and selects an erasure coding scheme for distributing the range of user data across the plurality of storage nodes and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. 11. The plurality of storage nodes in a chassis of claim 9, further comprising:
the plurality of storage nodes configured to perform a greater number of read retries or a longer read cycle for a first portion of the non-volatile memory of at least one of the plurality of storage nodes that has undergone a greater number of write and erase cycles than for a second portion of the non-volatile memory of the at least one of the plurality of storage nodes that has undergone a lesser number of write and erase cycles. 12. The plurality of storage nodes in a chassis of claim 9, wherein the at least one authority is configured to be transferred from a storage node based on the health of the non-volatile memory of one of the plurality of storage nodes. 13. The plurality of storage nodes in a chassis of claim 9, wherein the plurality of storage nodes is configured to adjust the erasure coding at the level of a package, a die, a plane, a block, or a page, and wherein each storage node of the plurality of storage nodes includes a controller. 14. The plurality of storage nodes in a chassis of claim 9, further comprising:
the plurality of storage nodes configured to grade blocks according to the health of the non-volatile memory of at least one of the plurality of storage nodes; and the plurality of storage nodes configured to perform error correction of differing portions of user data via differing erasure coding in blocks with differing grades. 15. A storage cluster, comprising:
a plurality of storage nodes within a chassis, each of the plurality of storage nodes having non-volatile memory for storage of user data, the plurality of storage nodes configured to generate diagnostic information regarding health of the non-volatile memory of each of the plurality of storage nodes; each storage node of the plurality of storage nodes including at least one authority that has ownership of a range of data and controls erasure coding of the range of user data; and the plurality of storage nodes configured to set erasure coding throughout the plurality of storage nodes according to a plurality of erasure coding schemes, based on the health of the non-volatile memory of at least one of the plurality of storage nodes. 16. The storage cluster of claim 15, further comprising:
an error correction block configured to track errors or error corrections in reads of the non-volatile memory of at the least one of the plurality of storage nodes, wherein the diagnostic information regarding the health is based at least in part on the errors or error corrections. 17. The storage cluster of claim 15, further comprising:
a counter configured to count how many times the non-volatile memory of the at least one of the plurality of storage nodes is written to on a per package basis, a per die basis, a per plane basis, a per block basis, or a per page basis, wherein the diagnostic information regarding the health is based at least in part on a result from the counter. 18. The storage cluster of claim 15, further comprising:
the plurality of storage nodes configured to rank blocks of the non-volatile memory of the at least one of the plurality of storage nodes according to the health of the non-volatile memory of the at least one of the plurality of storage nodes; and the plurality of storage nodes configured to write user data of a first type to a block having a first rank with a first type of erasure coding and to write user data of a second type to a block having a second rank with a second type of erasure coding. 19. The storage cluster of claim 15, wherein the at least one authority is configured to set the erasure coding responsive to detecting a change in the health of the non-volatile memory, and wherein each storage node of the plurality of storage nodes includes a controller. 20. The storage cluster of claim 15, wherein the at least one authority is configured to select an erasure coding scheme for distributing user data within the range of user data and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. | A method for adjustable error correction in a storage cluster is provided. The method includes determining health of a non-volatile memory of a non-volatile solid-state storage unit of each of a plurality of storage nodes in a storage cluster on a basis of per flash package, per flash die, per flash plane, per flash block, or per flash page. The determining is performed by the storage cluster. The plurality of storage nodes is housed within a chassis that couples the storage nodes as the storage cluster. The method includes adjusting erasure coding across the plurality of storage nodes based on the health of the non-volatile memory and distributing user data throughout the plurality of storage nodes through the erasure coding. The user data is accessible via the erasure coding from a remainder of the plurality of storage nodes if any of the plurality of storage nodes are unreachable.1. A method for adjustable error correction, comprising:
determining health of a plurality of storage nodes in a storage cluster, wherein each of the plurality of storage nodes is configured to have at least one authority that controls erasure coding of a range of user data of which the at least one authority is an owner; and adjusting erasure coding based on the health of at least one of the plurality of storage nodes. 2. The method of claim 1, further comprising:
ranking portions of non-volatile memory of at least one of the plurality of storage nodes based on the health of the at least one of the plurality of storage nodes, wherein adjusting the erasure coding includes assigning differing numbers of bits for error correction code (ECC) to differing portions of the non-volatile memory of the at least one of the plurality of storage nodes according to the ranking. 3. The method of claim 1, wherein adjusting the erasure coding comprises:
adjusting a stripe width and a type of error correction code (ECC). 4. The method of claim 1, wherein the at least one authority selects an erasure coding scheme for distributing the range of user data across the plurality of storage nodes and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. 5. The method of claim 1, wherein adjusting the erasure coding is controlled by the at least one authority. 6. The method of claim 1, wherein determining the health of each of the plurality of storage nodes includes producing diagnostic information on a basis of per package, per die, per plane, per block, or per page. 7. The method of claim 1, further comprising:
grading a plurality of portions of non-volatile memory of at least one of the plurality of storage nodes per the health of the at least one of the plurality of storage nodes, wherein adjusting the erasure coding includes assigning a plurality of levels of data stripes or error correction code to the plurality of portions of the non-volatile memory according to the grading. 8. The method of claim 1, further comprising:
assigning a plurality of grades to non-volatile memory of at least one of the plurality of storage nodes according to the health of the at least one of the plurality of storage nodes; and determining a type of user data for a portion of the user data, wherein distributing the user data includes writing the portion of the user data to a portion of the non-volatile memory having a one of the plurality of grades, according to the type of user data. 9. A plurality of storage nodes in a chassis, comprising:
the plurality of storage nodes configured to communicate together as a storage cluster, each of the plurality of storage nodes having non-volatile memory for user data storage, the plurality of storage nodes configured to determine health of the non-volatile memory; each storage node of the plurality of storage nodes having at least one authority configured to control erasure coding of a range of user data; and the plurality of storage nodes configured to adjust erasure coding, responsive to determining the health of the non-volatile memory. 10. The plurality of storage nodes in a chassis of claim 9, wherein the at least one authority owns the range of user data and selects an erasure coding scheme for distributing the range of user data across the plurality of storage nodes and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. 11. The plurality of storage nodes in a chassis of claim 9, further comprising:
the plurality of storage nodes configured to perform a greater number of read retries or a longer read cycle for a first portion of the non-volatile memory of at least one of the plurality of storage nodes that has undergone a greater number of write and erase cycles than for a second portion of the non-volatile memory of the at least one of the plurality of storage nodes that has undergone a lesser number of write and erase cycles. 12. The plurality of storage nodes in a chassis of claim 9, wherein the at least one authority is configured to be transferred from a storage node based on the health of the non-volatile memory of one of the plurality of storage nodes. 13. The plurality of storage nodes in a chassis of claim 9, wherein the plurality of storage nodes is configured to adjust the erasure coding at the level of a package, a die, a plane, a block, or a page, and wherein each storage node of the plurality of storage nodes includes a controller. 14. The plurality of storage nodes in a chassis of claim 9, further comprising:
the plurality of storage nodes configured to grade blocks according to the health of the non-volatile memory of at least one of the plurality of storage nodes; and the plurality of storage nodes configured to perform error correction of differing portions of user data via differing erasure coding in blocks with differing grades. 15. A storage cluster, comprising:
a plurality of storage nodes within a chassis, each of the plurality of storage nodes having non-volatile memory for storage of user data, the plurality of storage nodes configured to generate diagnostic information regarding health of the non-volatile memory of each of the plurality of storage nodes; each storage node of the plurality of storage nodes including at least one authority that has ownership of a range of data and controls erasure coding of the range of user data; and the plurality of storage nodes configured to set erasure coding throughout the plurality of storage nodes according to a plurality of erasure coding schemes, based on the health of the non-volatile memory of at least one of the plurality of storage nodes. 16. The storage cluster of claim 15, further comprising:
an error correction block configured to track errors or error corrections in reads of the non-volatile memory of at the least one of the plurality of storage nodes, wherein the diagnostic information regarding the health is based at least in part on the errors or error corrections. 17. The storage cluster of claim 15, further comprising:
a counter configured to count how many times the non-volatile memory of the at least one of the plurality of storage nodes is written to on a per package basis, a per die basis, a per plane basis, a per block basis, or a per page basis, wherein the diagnostic information regarding the health is based at least in part on a result from the counter. 18. The storage cluster of claim 15, further comprising:
the plurality of storage nodes configured to rank blocks of the non-volatile memory of the at least one of the plurality of storage nodes according to the health of the non-volatile memory of the at least one of the plurality of storage nodes; and the plurality of storage nodes configured to write user data of a first type to a block having a first rank with a first type of erasure coding and to write user data of a second type to a block having a second rank with a second type of erasure coding. 19. The storage cluster of claim 15, wherein the at least one authority is configured to set the erasure coding responsive to detecting a change in the health of the non-volatile memory, and wherein each storage node of the plurality of storage nodes includes a controller. 20. The storage cluster of claim 15, wherein the at least one authority is configured to select an erasure coding scheme for distributing user data within the range of user data and wherein the at least one authority resides on a storage node that is different than a storage node storing at least a portion of the range of user data. | 2,100 |
5,248 | 14,564,903 | 2,159 | Disclosed are methods, systems, and computer-readable media for obtaining, at a server, a post from a source on a social networking platform, the posting comprising content, a content type, and a time stamp, determining, for the post, an engagement metric during each of a predetermined set of time periods, generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period, obtaining, at the server, a selected post from the source on the social networking platform, and transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. | 1. A computer-implemented method of identifying trending content on a social networking platform comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp; determining, for the post, an engagement metric during each of a predetermined set of time periods; generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period; obtaining, at the server, a selected post from the source on the social networking platform; transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 2. The method of claim 1, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. 3. The method of claim 1, wherein obtaining the post from the source on the social networking platform comprises obtaining a plurality of posts from the source on the social networking platform, each of the posts comprising content, a content type, and a time stamp,
wherein determining, for the post, an engagement metric during each of a predetermined set of time periods comprises determining, for each post, an engagement metric during each of a predetermined set of time periods, and wherein generating the representative engagement metric for the particular time period selected from the predetermined set of time periods comprises generating the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period. 4. The method of claim 3, wherein determining, for each post, an engagement metric during each of the predetermined set of time periods comprises determining, for each post, one or more of a number of likes, a number of shares, and a number of comments during each of a predetermined set of time periods. 5. The method of claim 3, wherein the representative engagement metric comprises an average engagement metric. 6. The method of claim 3, wherein the representative engagement metric comprises a weighted average engagement metric. 7. The method of claim 6, further comprising receiving, at the server, a set of weights for one or more of likes, shares, and comments; and
wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the post during the particular time period comprises generating, at the server, a weighted average representative engagement metric for the particular time period selected from the predetermined set of time periods, the weighted average representative engagement metric being based on the engagement metrics of the post during the particular time period and the set of weights for one or more of likes, shares, and comments. 8. The method of claim 1, wherein the source comprises a page on the social networking platform. 9. The method of claim 1, further comprising:
determining that the score corresponding to the relative performance of the selected post compared to the representative engagement metric satisfies a predetermined threshold; and transmitting, from the server, an alert identifying the selected post. 10. The method of claim 1, wherein obtaining, at the server, a selected post from the source on the social networking platform comprises receiving, at the server, a new post from the source on the social networking platform. 11. The method of claim 3, wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period comprises generating, at the server, a representative engagement metric for a particular content type and a particular time period selected from the predetermined set of time periods, the representative engagement metric for the particular content type and the particular time period being based on the engagement metrics of the plurality of posts during the particular time period. 12. The method of claim 3, wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period comprises generating, at the server, a representative engagement metric for each time period from the predetermined set of time periods, the representative engagement metrics being based on the engagement metrics of the plurality of posts during each respective time period. 13. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp; determining, for the post, an engagement metric during each of a predetermined set of time periods; generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period; obtaining, at the server, a selected post from the source on the social networking platform; transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 14. The non-transitory computer-readable medium of claim 13, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. 15. The non-transitory computer-readable medium of claim 13, wherein obtaining the post from the source on the social networking platform comprises obtaining a plurality of posts from the source on the social networking platform, each of the posts comprising content, a content type, and a time stamp,
wherein determining, for the post, an engagement metric during each of a predetermined set of time periods comprises determining, for each post, an engagement metric during each of a predetermined set of time periods, and wherein generating the representative engagement metric for the particular time period selected from the predetermined set of time periods comprises generating the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period. 16. The non-transitory computer-readable medium of claim 15, wherein determining, for each post, an engagement metric during each of the predetermined set of time periods comprises determining, for each post, one or more of a number of likes, a number of shares, and a number of comments during each of a predetermined set of time periods. 17. The non-transitory computer-readable medium of claim 15, wherein the representative engagement metric comprises a weighted average engagement metric. 18. The non-transitory computer-readable medium of claim 13, further comprising:
determining that the score corresponding to the relative performance of the selected post compared to the representative engagement metric satisfies a predetermined threshold; and transmitting, from the server, an alert identifying the selected post. 19. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp;
determining, for the post, an engagement metric during each of a predetermined set of time periods;
generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period;
obtaining, at the server, a selected post from the source on the social networking platform;
transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 20. The system of claim 19, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. | Disclosed are methods, systems, and computer-readable media for obtaining, at a server, a post from a source on a social networking platform, the posting comprising content, a content type, and a time stamp, determining, for the post, an engagement metric during each of a predetermined set of time periods, generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period, obtaining, at the server, a selected post from the source on the social networking platform, and transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric.1. A computer-implemented method of identifying trending content on a social networking platform comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp; determining, for the post, an engagement metric during each of a predetermined set of time periods; generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period; obtaining, at the server, a selected post from the source on the social networking platform; transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 2. The method of claim 1, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. 3. The method of claim 1, wherein obtaining the post from the source on the social networking platform comprises obtaining a plurality of posts from the source on the social networking platform, each of the posts comprising content, a content type, and a time stamp,
wherein determining, for the post, an engagement metric during each of a predetermined set of time periods comprises determining, for each post, an engagement metric during each of a predetermined set of time periods, and wherein generating the representative engagement metric for the particular time period selected from the predetermined set of time periods comprises generating the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period. 4. The method of claim 3, wherein determining, for each post, an engagement metric during each of the predetermined set of time periods comprises determining, for each post, one or more of a number of likes, a number of shares, and a number of comments during each of a predetermined set of time periods. 5. The method of claim 3, wherein the representative engagement metric comprises an average engagement metric. 6. The method of claim 3, wherein the representative engagement metric comprises a weighted average engagement metric. 7. The method of claim 6, further comprising receiving, at the server, a set of weights for one or more of likes, shares, and comments; and
wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the post during the particular time period comprises generating, at the server, a weighted average representative engagement metric for the particular time period selected from the predetermined set of time periods, the weighted average representative engagement metric being based on the engagement metrics of the post during the particular time period and the set of weights for one or more of likes, shares, and comments. 8. The method of claim 1, wherein the source comprises a page on the social networking platform. 9. The method of claim 1, further comprising:
determining that the score corresponding to the relative performance of the selected post compared to the representative engagement metric satisfies a predetermined threshold; and transmitting, from the server, an alert identifying the selected post. 10. The method of claim 1, wherein obtaining, at the server, a selected post from the source on the social networking platform comprises receiving, at the server, a new post from the source on the social networking platform. 11. The method of claim 3, wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period comprises generating, at the server, a representative engagement metric for a particular content type and a particular time period selected from the predetermined set of time periods, the representative engagement metric for the particular content type and the particular time period being based on the engagement metrics of the plurality of posts during the particular time period. 12. The method of claim 3, wherein generating, at the server, the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period comprises generating, at the server, a representative engagement metric for each time period from the predetermined set of time periods, the representative engagement metrics being based on the engagement metrics of the plurality of posts during each respective time period. 13. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp; determining, for the post, an engagement metric during each of a predetermined set of time periods; generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period; obtaining, at the server, a selected post from the source on the social networking platform; transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 14. The non-transitory computer-readable medium of claim 13, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. 15. The non-transitory computer-readable medium of claim 13, wherein obtaining the post from the source on the social networking platform comprises obtaining a plurality of posts from the source on the social networking platform, each of the posts comprising content, a content type, and a time stamp,
wherein determining, for the post, an engagement metric during each of a predetermined set of time periods comprises determining, for each post, an engagement metric during each of a predetermined set of time periods, and wherein generating the representative engagement metric for the particular time period selected from the predetermined set of time periods comprises generating the representative engagement metric for the particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metrics of the plurality of posts during the particular time period. 16. The non-transitory computer-readable medium of claim 15, wherein determining, for each post, an engagement metric during each of the predetermined set of time periods comprises determining, for each post, one or more of a number of likes, a number of shares, and a number of comments during each of a predetermined set of time periods. 17. The non-transitory computer-readable medium of claim 15, wherein the representative engagement metric comprises a weighted average engagement metric. 18. The non-transitory computer-readable medium of claim 13, further comprising:
determining that the score corresponding to the relative performance of the selected post compared to the representative engagement metric satisfies a predetermined threshold; and transmitting, from the server, an alert identifying the selected post. 19. A system comprising:
one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
obtaining, at a server, a post from a source on a social networking platform, the post comprising content, a content type, and a time stamp;
determining, for the post, an engagement metric during each of a predetermined set of time periods;
generating, at the server, a representative engagement metric for a particular time period selected from the predetermined set of time periods, the representative engagement metric being based on the engagement metric of the post during the particular time period;
obtaining, at the server, a selected post from the source on the social networking platform;
transmitting, from the server, a score corresponding to a relative performance of the selected post compared to the representative engagement metric. 20. The system of claim 19, wherein the content type comprises one selected from the group consisting of images, hyperlinks, messages, videos. | 2,100 |
5,249 | 13,736,034 | 2,176 | Systems and methods are disclosed herein for an operational transformation proxy for a thin client. The systems and methods may be used for collaboratively editing an electronic object such as an electronic document from a thin client. A first request is received at an OT proxy from the thin client to make a first change to a first version of the electronic object. A first mutation, including the first change to the first version of the electronic document, is created. A second mutation is received at the OT proxy from the server. At the OT proxy, the second mutation of the electronic object is converted into a third mutation of the electronic object based on the first mutation. | 1. A method for modifying an electronic document between a server and a thin client, comprising:
receiving at an operational transformations proxy (“OT proxy”) a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client: creating at the OT proxy a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client; receiving at the OT proxy a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server; transforming at the OT proxy the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation; transmitting from the OT proxy to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and transmitting from the OT proxy to the server a second response, the second response comprising the first mutation. 2. The method of claim 1, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 3. The method of claim 2, further comprising:
determining at the OT proxy whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to determining that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, processing at the OT proxy the first request; and in response to determining that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, storing at the OT proxy the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 4. The method of claim 1, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 5. The method of claim 4, further comprising:
in response to transmitting the first response to the thin client, determining at the OT proxy whether a message confirming receipt of the transmitted first response is received from the thin client; in response to determining that the message confirming receipt of the transmitted first response is received from the thin client, updating at the OT proxy the last acknowledged sequence number for the thin client; and in response to determining that the message confirming receipt of the transmitted first response is not received from the thin client, transmitting from the OT proxy an updated first response to the thin client. 6. The method of claim 5, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 7. The method of claim 1, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 8. The method of claim 1, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 9. The method of claim 1, further comprising:
updating, at the thin client, the first version of the electronic document with the first change; storing the updated first version of the electronic document in a storage local to the thin client; and updating, at the thin client, a local view of the electronic document with the updated first version of the electronic document. 10. A system for modifying an electronic document between a server and a thin client, comprising processor circuitry configured to instantiate an OT proxy, wherein the OT proxy is configured to:
receive a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client; create a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client; receive a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server; transform the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation; transmit to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and transmit to the server a second response, the second response comprising the first mutation of the electronic document. 11. The system of claim 10, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 12. The system of claim 11, wherein the OT proxy is further configured to:
determine whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to the determination that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, process the first request; and in response to the determination that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, store the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 13. The system of claim 10, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the electronic document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 14. The system of claim 13, wherein the OT proxy is further configured to:
in response to the transmission of the first response to the thin client, determine whether a message confirming receipt of the transmitted first response is received from the thin client; in response to the determination that the message confirming receipt of the transmitted first response is received from the thin client, update the last acknowledged sequence number for the thin client; and in response to the determination that the message confirming receipt of the transmitted first response is not received from the thin client, transmit an updated first response to the thin client. 15. The system of claim 14, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 16. The system of claim 10, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 17. The system of claim 10, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 18. The system of claim 10, wherein the thin client is configured to:
update the first version of the electronic document with the first change; store the updated first version of the electronic document in a storage local to the thin client; and update a local view of the electronic document with the updated first version of the electronic document. 19. A non-transitory computer readable medium storing computer executable instructions, which, when executed by a processor circuitry, causes the circuitry to instantiate an operational transformations proxy (“OT proxy”) to carry out a method for modifying an electronic document between a server and a thin client, the method comprising:
receiving a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client;
creating a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client;
receiving a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server;
transforming the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation;
transmitting to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and
transmitting to the server a second response, the second response comprising the first mutation. 20. The non transitory computer readable medium of claim 19, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 21. The non transitory computer readable medium of claim 20, wherein the method further comprises:
determining whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to determining that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, processing the first request; and in response to determining that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, storing the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 22. The non transitory computer readable medium of claim 19, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 23. The non transitory computer readable medium of claim 22, wherein the method further comprises:
in response to transmitting the first response to the thin client, determining whether a message confirming receipt of the transmitted first response is received from the thin client; in response to determining that the message confirming receipt of the transmitted first response is received from the thin client, updating the last acknowledged sequence number for the thin client; and in response to determining that the message confirming receipt of the transmitted first response is not received from the thin client, transmitting an updated first response to the thin client. 24. The non transitory computer readable medium of claim 23, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 25. The non transitory computer readable medium of claim 19, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 26. The non transitory computer readable medium of claim 19, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 27. The non transitory computer readable medium of claim 19, wherein the thin client is configured to:
update the first version of the electronic document with the first change; store the updated first version of the electronic document in a storage local to the thin client; and update a local view of the electronic document with the updated first version of the electronic document. | Systems and methods are disclosed herein for an operational transformation proxy for a thin client. The systems and methods may be used for collaboratively editing an electronic object such as an electronic document from a thin client. A first request is received at an OT proxy from the thin client to make a first change to a first version of the electronic object. A first mutation, including the first change to the first version of the electronic document, is created. A second mutation is received at the OT proxy from the server. At the OT proxy, the second mutation of the electronic object is converted into a third mutation of the electronic object based on the first mutation.1. A method for modifying an electronic document between a server and a thin client, comprising:
receiving at an operational transformations proxy (“OT proxy”) a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client: creating at the OT proxy a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client; receiving at the OT proxy a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server; transforming at the OT proxy the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation; transmitting from the OT proxy to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and transmitting from the OT proxy to the server a second response, the second response comprising the first mutation. 2. The method of claim 1, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 3. The method of claim 2, further comprising:
determining at the OT proxy whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to determining that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, processing at the OT proxy the first request; and in response to determining that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, storing at the OT proxy the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 4. The method of claim 1, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 5. The method of claim 4, further comprising:
in response to transmitting the first response to the thin client, determining at the OT proxy whether a message confirming receipt of the transmitted first response is received from the thin client; in response to determining that the message confirming receipt of the transmitted first response is received from the thin client, updating at the OT proxy the last acknowledged sequence number for the thin client; and in response to determining that the message confirming receipt of the transmitted first response is not received from the thin client, transmitting from the OT proxy an updated first response to the thin client. 6. The method of claim 5, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 7. The method of claim 1, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 8. The method of claim 1, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 9. The method of claim 1, further comprising:
updating, at the thin client, the first version of the electronic document with the first change; storing the updated first version of the electronic document in a storage local to the thin client; and updating, at the thin client, a local view of the electronic document with the updated first version of the electronic document. 10. A system for modifying an electronic document between a server and a thin client, comprising processor circuitry configured to instantiate an OT proxy, wherein the OT proxy is configured to:
receive a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client; create a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client; receive a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server; transform the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation; transmit to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and transmit to the server a second response, the second response comprising the first mutation of the electronic document. 11. The system of claim 10, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 12. The system of claim 11, wherein the OT proxy is further configured to:
determine whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to the determination that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, process the first request; and in response to the determination that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, store the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 13. The system of claim 10, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the electronic document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 14. The system of claim 13, wherein the OT proxy is further configured to:
in response to the transmission of the first response to the thin client, determine whether a message confirming receipt of the transmitted first response is received from the thin client; in response to the determination that the message confirming receipt of the transmitted first response is received from the thin client, update the last acknowledged sequence number for the thin client; and in response to the determination that the message confirming receipt of the transmitted first response is not received from the thin client, transmit an updated first response to the thin client. 15. The system of claim 14, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 16. The system of claim 10, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 17. The system of claim 10, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 18. The system of claim 10, wherein the thin client is configured to:
update the first version of the electronic document with the first change; store the updated first version of the electronic document in a storage local to the thin client; and update a local view of the electronic document with the updated first version of the electronic document. 19. A non-transitory computer readable medium storing computer executable instructions, which, when executed by a processor circuitry, causes the circuitry to instantiate an operational transformations proxy (“OT proxy”) to carry out a method for modifying an electronic document between a server and a thin client, the method comprising:
receiving a first request from the thin client to make a first change to a first version of the electronic document, wherein the first version comprises a copy of the electronic document on the thin client;
creating a first mutation comprising the first change to the first version of the electronic document, the first mutation corresponding to the first request received from the thin client;
receiving a second mutation from the server, the second mutation comprising a second change to a second version of the electronic document, wherein the second version comprises another copy of the electronic document on the server;
transforming the second mutation of the electronic document into a third mutation of the electronic document based on the first mutation;
transmitting to the thin client a first response, the first response corresponding to the third mutation of the electronic document; and
transmitting to the server a second response, the second response comprising the first mutation. 20. The non transitory computer readable medium of claim 19, wherein the first request comprises:
a first sequence number, wherein the first sequence number corresponds to a unique number for identifying the first request received from the thin client; and a first revision number corresponding to the first version of the electronic document on the thin client. 21. The non transitory computer readable medium of claim 20, wherein the method further comprises:
determining whether the first sequence number of the first request received from the thin client is consecutive to a third sequence number of a last processed request received from the thin client; in response to determining that the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request received from the thin client, processing the first request; and in response to determining that the first sequence number of the first request received from the thin client is not consecutive to the third sequence number of the last processed request, storing the first request until the first sequence number of the first request received from the thin client is consecutive to the third sequence number of the last processed request. 22. The non transitory computer readable medium of claim 19, wherein the first response comprises:
a third change corresponding to the third mutation of the electronic document; a second revision number corresponding to the second version of the document on the server; and a second sequence number corresponding to a last acknowledged sequence number for the thin client. 23. The non transitory computer readable medium of claim 22, wherein the method further comprises:
in response to transmitting the first response to the thin client, determining whether a message confirming receipt of the transmitted first response is received from the thin client; in response to determining that the message confirming receipt of the transmitted first response is received from the thin client, updating the last acknowledged sequence number for the thin client; and in response to determining that the message confirming receipt of the transmitted first response is not received from the thin client, transmitting an updated first response to the thin client. 24. The non transitory computer readable medium of claim 23, wherein the first response transmitted to the thin client comprises only one sequence number pending receipt at the OT proxy of the message confirming receipt of the first response from the thin client. 25. The non transitory computer readable medium of claim 19, wherein the thin client comprises one of the group of: a mobile web browser, a single threaded browser application, and a limited functionality web browser application. 26. The non transitory computer readable medium of claim 19, wherein the OT proxy comprises one of the group of: a thread of a multi-threaded server application, a server application, and a distributed application. 27. The non transitory computer readable medium of claim 19, wherein the thin client is configured to:
update the first version of the electronic document with the first change; store the updated first version of the electronic document in a storage local to the thin client; and update a local view of the electronic document with the updated first version of the electronic document. | 2,100 |
5,250 | 14,975,299 | 2,177 | In some embodiments, an option to lock one or more associated cells is provided with respect to each different group of cells in a single sheet of a spreadsheet application. One or more locked cells of a group of cells do not scroll out of view at least while a portion of the group of cells is viewable in a given display view. | 1. A non-transitory computer readable storage medium and comprising computer instructions for:
receiving an input configured to lock one or more cells of a first group of cells of a plurality of groups of cells in a single sheet of a spreadsheet application, wherein the one or more cells of the first group of cells are configured to be locked independently of cells of other groups of cells of the plurality of groups of cells; and locking the one or more cells of the first group of cells when the one or more cells of the first group of cells are scrolled out of view of a display and when at least a portion of the first group of cells is in view of the display, wherein locking the one or more cells of the first group of cells comprises casting a shadow visual effect from the one or more cells of the first group of cells onto one or more unlocked cells of the first group of cells when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display. 2. The non-transitory computer readable storage medium of claim 1, wherein each of the plurality of groups of cells comprises a table of cells. 3. The non-transitory computer readable storage medium of claim 1, wherein the one or more cells comprises one or more rows of cells, one or more columns of cells, or both. 4. The non-transitory computer readable storage medium of claim 1, further comprising computer instructions for rendering the locked cells of the first group of cells without any visual indication that indicates that the one or more cells of the first group of cells are locked while the one or more cells of the first group of cells are viewable in their actual relative positions with respect to the first group of cells. 5. The non-transitory computer readable storage medium of claim 1, further comprising computer instructions for rendering the one or more cells of the first group of cells as floating cells when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display. 6. The non-transitory computer readable storage medium of claim 5, wherein the floating cells are rendered with a distinct visual representation. 7. The non-transitory computer readable storage medium of claim 5, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 8. The non-transitory computer readable storage medium of claim 7, further comprising computer instructions for:
receiving an indication that a scroll bar provided with a user interface of the spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and scrolling the workspace such that partial views of a first set of cells of the first group of cells directly adjacent to the one or more cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar. 9. The non-transitory computer readable storage medium of claim 8, wherein scrolling the workspace such that partial views of the at least a portion of the first set of cells that have not been locked is always viewable gives at least a visual impression of continuous or nearly continuous scrolling. 10. A system, comprising:
a processor, configured to:
receive an input configured to lock one or more cells of a first group of cells of a plurality of groups of cells in a single sheet of a spreadsheet application, wherein the one or more cells of the first group of cells are configured to be locked independently of cells of other groups of cells of the plurality of group of cells; and
lock the one or more cells of the first group of cells when the one or more cells of the first group of cells are scrolled out of view of a display and when at least a portion of the first group of cells is in view of the display, wherein the one or more cells of the first group of cells cast a shadow visual effect when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display; and
a memory coupled to the processor and configured to provide the processor with instructions. 11. The system recited in claim 10, wherein the processor is further configured to render the one or more cells of the first group of cells as floating cells if actual relative positions of the one or more cells of the first group of cells are scrolled out of view of the display. 12. The system recited in claim 11, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 13. The system recited in claim 10, wherein the processor is further configured to:
receive an indication that a scroll bar provided with a user interface of the spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and scroll the workspace such that partial views of a first set of cells of the first group of cells directly adjacent to the one or more cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar. 14. A system, comprising:
a processor configured to:
receive an indication that a scroll bar provided with a user interface of a spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and
scroll the workspace such that partial views of a first set of cells of a first group of cells directly adjacent to one or more locked cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar; and
a memory coupled to the processor and configured to provide the processor with instructions. 15. The system recited in claim 14, wherein scrolling the workspace such that partial views of the portion of the first set of cells that have not been locked is always viewable gives at least a visual impression of continuous or nearly continuous scrolling. 16. The system of claim 14, wherein the processor is configured to depict the one or more locked cells as being offset from an original position in the first group of cells when actual relative positions of the one or more locked cells of the first group of cells have scrolled out of view of the display. 17. The system of claim 14, wherein the processor is configured to render the one or more locked cells of the first group of cells as floating cells when actual relative positions of the locked cells of the first group of cells have scrolled out of view of the display. 18. The system of claim 17, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 19. The system of claim 17, wherein the floating cells cast a shadow visual effect on other unlocked cells that would otherwise be viewable in the display. 20. The system of claim 17, wherein the floating cells are offset from an original position in the first group of cells. | In some embodiments, an option to lock one or more associated cells is provided with respect to each different group of cells in a single sheet of a spreadsheet application. One or more locked cells of a group of cells do not scroll out of view at least while a portion of the group of cells is viewable in a given display view.1. A non-transitory computer readable storage medium and comprising computer instructions for:
receiving an input configured to lock one or more cells of a first group of cells of a plurality of groups of cells in a single sheet of a spreadsheet application, wherein the one or more cells of the first group of cells are configured to be locked independently of cells of other groups of cells of the plurality of groups of cells; and locking the one or more cells of the first group of cells when the one or more cells of the first group of cells are scrolled out of view of a display and when at least a portion of the first group of cells is in view of the display, wherein locking the one or more cells of the first group of cells comprises casting a shadow visual effect from the one or more cells of the first group of cells onto one or more unlocked cells of the first group of cells when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display. 2. The non-transitory computer readable storage medium of claim 1, wherein each of the plurality of groups of cells comprises a table of cells. 3. The non-transitory computer readable storage medium of claim 1, wherein the one or more cells comprises one or more rows of cells, one or more columns of cells, or both. 4. The non-transitory computer readable storage medium of claim 1, further comprising computer instructions for rendering the locked cells of the first group of cells without any visual indication that indicates that the one or more cells of the first group of cells are locked while the one or more cells of the first group of cells are viewable in their actual relative positions with respect to the first group of cells. 5. The non-transitory computer readable storage medium of claim 1, further comprising computer instructions for rendering the one or more cells of the first group of cells as floating cells when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display. 6. The non-transitory computer readable storage medium of claim 5, wherein the floating cells are rendered with a distinct visual representation. 7. The non-transitory computer readable storage medium of claim 5, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 8. The non-transitory computer readable storage medium of claim 7, further comprising computer instructions for:
receiving an indication that a scroll bar provided with a user interface of the spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and scrolling the workspace such that partial views of a first set of cells of the first group of cells directly adjacent to the one or more cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar. 9. The non-transitory computer readable storage medium of claim 8, wherein scrolling the workspace such that partial views of the at least a portion of the first set of cells that have not been locked is always viewable gives at least a visual impression of continuous or nearly continuous scrolling. 10. A system, comprising:
a processor, configured to:
receive an input configured to lock one or more cells of a first group of cells of a plurality of groups of cells in a single sheet of a spreadsheet application, wherein the one or more cells of the first group of cells are configured to be locked independently of cells of other groups of cells of the plurality of group of cells; and
lock the one or more cells of the first group of cells when the one or more cells of the first group of cells are scrolled out of view of a display and when at least a portion of the first group of cells is in view of the display, wherein the one or more cells of the first group of cells cast a shadow visual effect when actual relative positions of the one or more cells of the first group of cells have scrolled out of view of the display; and
a memory coupled to the processor and configured to provide the processor with instructions. 11. The system recited in claim 10, wherein the processor is further configured to render the one or more cells of the first group of cells as floating cells if actual relative positions of the one or more cells of the first group of cells are scrolled out of view of the display. 12. The system recited in claim 11, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 13. The system recited in claim 10, wherein the processor is further configured to:
receive an indication that a scroll bar provided with a user interface of the spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and scroll the workspace such that partial views of a first set of cells of the first group of cells directly adjacent to the one or more cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar. 14. A system, comprising:
a processor configured to:
receive an indication that a scroll bar provided with a user interface of a spreadsheet application is being exercised with respect to a workspace of the spreadsheet application; and
scroll the workspace such that partial views of a first set of cells of a first group of cells directly adjacent to one or more locked cells of the first group of cells is always viewable as the first set of cells are scrolled in or out of view using the scroll bar; and
a memory coupled to the processor and configured to provide the processor with instructions. 15. The system recited in claim 14, wherein scrolling the workspace such that partial views of the portion of the first set of cells that have not been locked is always viewable gives at least a visual impression of continuous or nearly continuous scrolling. 16. The system of claim 14, wherein the processor is configured to depict the one or more locked cells as being offset from an original position in the first group of cells when actual relative positions of the one or more locked cells of the first group of cells have scrolled out of view of the display. 17. The system of claim 14, wherein the processor is configured to render the one or more locked cells of the first group of cells as floating cells when actual relative positions of the locked cells of the first group of cells have scrolled out of view of the display. 18. The system of claim 17, wherein the floating cells are overlaid on other unlocked cells that would otherwise be viewable in the display. 19. The system of claim 17, wherein the floating cells cast a shadow visual effect on other unlocked cells that would otherwise be viewable in the display. 20. The system of claim 17, wherein the floating cells are offset from an original position in the first group of cells. | 2,100 |
5,251 | 14,373,843 | 2,143 | In one implementation, an image-based application automation system detects an input event relative to a graphical user interface and associates a plurality of images with the input event. Each image from the plurality of images includes at least a portion of the graphical user interface at which the input event occurred. | 1. A processor-readable medium storing code representing instructions that when executed at a processor cause the processor to:
detect an input event relative to a graphical user interface; and associate with the input event a plurality of images, each image from the plurality of images including at least a portion of the graphical user interface at which the input event occurred. 2. The processor-readable medium of claim 1, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
designate an image from the plurality of images as a target for the input event; and define an automation action identifying the input event and the target. 3. The processor-readable medium of claim 1, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
select an image from the plurality of images in response to user input; and designate the image from the plurality of images as a target for the input event. 4. An image-based application automation system, comprising:
an event detection module to detect input events relative to a graphical user interface; an image generation module to generate images, each image from the images including at least a portion of the graphical user interface; and an association module to associate a plurality of images from the images with an input event from the input events. 5. The system of claim 4, further comprising:
an image repository, the association module storing the plurality of images at the image repository. 6. The system of claim 4, further comprising:
a selection module to select an image from the plurality of images in response to user input, the association module configured to designate the image from the plurality of images as a target for the input event. 7. The system of claim 4, wherein:
the input event is relative to a graphical user interface element of the graphical user interface; and the plurality of images includes a first image including at least a portion of the graphical user interface element in a first state and a second image including at least a portion of the graphical user interface element in a second state. 8. The system of claim 4, wherein the association module is operable to designate an image from the plurality of images as a target for the input event and define an automation action identifying the input event and the target. 9. A processor-readable medium storing code representing instructions that when executed at a processor cause the processor to:
detect an input event relative to a graphical user interface element; and associate a plurality of images including at least a portion of the graphical user interface element with the input event. 10. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
capture the plurality of images, the plurality of images including at least one image captured before the input event, at least one image captured in response to the input event, and at least one image captured after the input event. 11. The processor-readable medium of claim 9, further comprising code representing instructions that when executed at the processor cause the processor to:
designate an image from the plurality of images as a target for the input event. 12. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
designate a first image from the plurality of images as a target for the input event; select a second image from the plurality of images in response to user input; and designate the second image from the plurality of images as the target for the input event. 13. The processor-readable medium of claim 9, wherein a first image from the plurality of images includes the at least a portion of the graphical user interface element in a first state and a second image from the plurality of images includes the at least a portion of the graphical user interface element in a second state,
the processor-readable medium the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to: designate the first image from the plurality of images as a target for the input event; select the second image from the plurality of images in response to user input; and designate the second image from the plurality of images as the target for the input event. 14. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
output a selection interface including the plurality of images to a display. 15. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
output a selection interface including the plurality of images to a display; select an image from the plurality of images in response to user input; and designate the image from the plurality of images as a target for the input event. | In one implementation, an image-based application automation system detects an input event relative to a graphical user interface and associates a plurality of images with the input event. Each image from the plurality of images includes at least a portion of the graphical user interface at which the input event occurred.1. A processor-readable medium storing code representing instructions that when executed at a processor cause the processor to:
detect an input event relative to a graphical user interface; and associate with the input event a plurality of images, each image from the plurality of images including at least a portion of the graphical user interface at which the input event occurred. 2. The processor-readable medium of claim 1, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
designate an image from the plurality of images as a target for the input event; and define an automation action identifying the input event and the target. 3. The processor-readable medium of claim 1, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
select an image from the plurality of images in response to user input; and designate the image from the plurality of images as a target for the input event. 4. An image-based application automation system, comprising:
an event detection module to detect input events relative to a graphical user interface; an image generation module to generate images, each image from the images including at least a portion of the graphical user interface; and an association module to associate a plurality of images from the images with an input event from the input events. 5. The system of claim 4, further comprising:
an image repository, the association module storing the plurality of images at the image repository. 6. The system of claim 4, further comprising:
a selection module to select an image from the plurality of images in response to user input, the association module configured to designate the image from the plurality of images as a target for the input event. 7. The system of claim 4, wherein:
the input event is relative to a graphical user interface element of the graphical user interface; and the plurality of images includes a first image including at least a portion of the graphical user interface element in a first state and a second image including at least a portion of the graphical user interface element in a second state. 8. The system of claim 4, wherein the association module is operable to designate an image from the plurality of images as a target for the input event and define an automation action identifying the input event and the target. 9. A processor-readable medium storing code representing instructions that when executed at a processor cause the processor to:
detect an input event relative to a graphical user interface element; and associate a plurality of images including at least a portion of the graphical user interface element with the input event. 10. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
capture the plurality of images, the plurality of images including at least one image captured before the input event, at least one image captured in response to the input event, and at least one image captured after the input event. 11. The processor-readable medium of claim 9, further comprising code representing instructions that when executed at the processor cause the processor to:
designate an image from the plurality of images as a target for the input event. 12. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
designate a first image from the plurality of images as a target for the input event; select a second image from the plurality of images in response to user input; and designate the second image from the plurality of images as the target for the input event. 13. The processor-readable medium of claim 9, wherein a first image from the plurality of images includes the at least a portion of the graphical user interface element in a first state and a second image from the plurality of images includes the at least a portion of the graphical user interface element in a second state,
the processor-readable medium the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to: designate the first image from the plurality of images as a target for the input event; select the second image from the plurality of images in response to user input; and designate the second image from the plurality of images as the target for the input event. 14. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
output a selection interface including the plurality of images to a display. 15. The processor-readable medium of claim 9, the processor-readable medium further comprising code representing instructions that when executed at the processor cause the processor to:
output a selection interface including the plurality of images to a display; select an image from the plurality of images in response to user input; and designate the image from the plurality of images as a target for the input event. | 2,100 |
5,252 | 15,807,891 | 2,165 | A method that includes responsive to a request to access a file stored in a memory of a computing device, identifying a context in which the access to the file is being requested; identifying one or more computer files that at least partially match the context; generating, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and generating, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context. | 1. A method, comprising:
responsive to a request to access a file stored in a memory of a computing device, identifying, by a processor, a context in which the access to the file is being requested; identifying, by the processor, one or more computer files that at least partially match the context; generating, by the processor, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and generating, by the processor, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context, wherein each of the user contacts in the list of user contacts includes a link to the identified one or more computer files at least partially matching the context that are included in communications between a respective user contact and the user. 2. The method of claim 1, wherein the context comprises information that includes at least one of a file name, a file owner, a file type, a file size, a file creation date, a file modification date, a file access date, a status of a file as being shared, a file location or a file content. 3. The method of claim 1 wherein the context includes at least one of a computing device with which the request is made, a time of the request, a date of the request, a physical location of the request or an identity of the user. 4. The method of claim 1 wherein the context comprises information regarding a software program including at least one of operating system software, web access software, word processing software, picture archiving software, e-mail software, calendar software or social media software. 5. The method of claim 1 wherein identifying the one or more computer files comprises comparing information associated with the one or more computer files with information included in the context. 6. The method of claim 5 wherein the information associated with the one or more computer files includes context information stored before a time of making the request. 7. The method of claim 1, further comprising forming a search string using the context; and wherein identifying the one or more computer files comprises searching the memory accessible to the user for the one or more computer files using the search string. 8. The method of claim 1, further comprising displaying a default file open dialog if the list does not include a desired file. 9. The method of claim 1, further comprising forming the context as a search string using heuristics. 10. The method of claim 1 wherein the list includes a computer file shared with the user by another user having content that at least partially matches the context. 11. A computing device, comprising:
a memory; and a processor to execute instructions stored in the memory to:
responsive to a request to access a file stored in a memory of a computing device, identify a context in which the access to the file is being requested;
identify one or more computer files that at least partially match the context;
generate, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and
generate, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context,
wherein each of the user contacts in the list of user contacts includes a link to the identified one or more computer files at least partially matching the context that are included in communications between a respective user contact and the user. 12. The computing device of claim 11, wherein the context comprises information that includes at least one of a file name, a file owner, a file type, a file size, a file creation date, a file modification date, a file access date, a status of a file as being shared, a file location or a file content. 13. The computing device of claim 11, wherein the context includes at least one of a computing device with which the request is made, a time of the request, a date of the request, a physical location of the request or an identity of the user. 14. The computing device of claim 11, wherein the context comprises information regarding a software program including at least one of operating system software, web access software, word processing software, picture archiving software, e-mail software, calendar software or social media software. 15. The computing device of claim 11, further comprising the processor executing instructions stored in the memory to identify the one or more computer files by comparing information associated with the one or more computer files with information included in the context. 16. The computing device of claim 15, wherein the information associated with the one or more computer files includes context information stored before a time of making the request. 17. The computing device of claim 11, further comprising the processor executing instructions stored in the memory to form a search string using the context and identify the one or more computer files by searching the memory accessible to the user for the one or more computer files using the search string. 18. The computing device of claim 11, further comprising the processor executing instructions stored on the memory to display a default file open dialog if the list does not include a desired file. 19. The computing device of claim 11, further comprising the processor executing instructions stored on the memory to form the context as a search string using heuristics. 20. The computing device of claim 11, wherein the list includes a computer file shared with the user by another user having content that at least partially matches the context. | A method that includes responsive to a request to access a file stored in a memory of a computing device, identifying a context in which the access to the file is being requested; identifying one or more computer files that at least partially match the context; generating, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and generating, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context.1. A method, comprising:
responsive to a request to access a file stored in a memory of a computing device, identifying, by a processor, a context in which the access to the file is being requested; identifying, by the processor, one or more computer files that at least partially match the context; generating, by the processor, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and generating, by the processor, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context, wherein each of the user contacts in the list of user contacts includes a link to the identified one or more computer files at least partially matching the context that are included in communications between a respective user contact and the user. 2. The method of claim 1, wherein the context comprises information that includes at least one of a file name, a file owner, a file type, a file size, a file creation date, a file modification date, a file access date, a status of a file as being shared, a file location or a file content. 3. The method of claim 1 wherein the context includes at least one of a computing device with which the request is made, a time of the request, a date of the request, a physical location of the request or an identity of the user. 4. The method of claim 1 wherein the context comprises information regarding a software program including at least one of operating system software, web access software, word processing software, picture archiving software, e-mail software, calendar software or social media software. 5. The method of claim 1 wherein identifying the one or more computer files comprises comparing information associated with the one or more computer files with information included in the context. 6. The method of claim 5 wherein the information associated with the one or more computer files includes context information stored before a time of making the request. 7. The method of claim 1, further comprising forming a search string using the context; and wherein identifying the one or more computer files comprises searching the memory accessible to the user for the one or more computer files using the search string. 8. The method of claim 1, further comprising displaying a default file open dialog if the list does not include a desired file. 9. The method of claim 1, further comprising forming the context as a search string using heuristics. 10. The method of claim 1 wherein the list includes a computer file shared with the user by another user having content that at least partially matches the context. 11. A computing device, comprising:
a memory; and a processor to execute instructions stored in the memory to:
responsive to a request to access a file stored in a memory of a computing device, identify a context in which the access to the file is being requested;
identify one or more computer files that at least partially match the context;
generate, for a display, a list of stored files selectable by a user, the list of stored files including the identified one or more computer files at least partially matching the context; and
generate, for the display, a list of user contacts selectable by the user, the list of user contacts including one or more user contacts identified as having communicated the user that include the identified one or more computer files at least partially matching the context,
wherein each of the user contacts in the list of user contacts includes a link to the identified one or more computer files at least partially matching the context that are included in communications between a respective user contact and the user. 12. The computing device of claim 11, wherein the context comprises information that includes at least one of a file name, a file owner, a file type, a file size, a file creation date, a file modification date, a file access date, a status of a file as being shared, a file location or a file content. 13. The computing device of claim 11, wherein the context includes at least one of a computing device with which the request is made, a time of the request, a date of the request, a physical location of the request or an identity of the user. 14. The computing device of claim 11, wherein the context comprises information regarding a software program including at least one of operating system software, web access software, word processing software, picture archiving software, e-mail software, calendar software or social media software. 15. The computing device of claim 11, further comprising the processor executing instructions stored in the memory to identify the one or more computer files by comparing information associated with the one or more computer files with information included in the context. 16. The computing device of claim 15, wherein the information associated with the one or more computer files includes context information stored before a time of making the request. 17. The computing device of claim 11, further comprising the processor executing instructions stored in the memory to form a search string using the context and identify the one or more computer files by searching the memory accessible to the user for the one or more computer files using the search string. 18. The computing device of claim 11, further comprising the processor executing instructions stored on the memory to display a default file open dialog if the list does not include a desired file. 19. The computing device of claim 11, further comprising the processor executing instructions stored on the memory to form the context as a search string using heuristics. 20. The computing device of claim 11, wherein the list includes a computer file shared with the user by another user having content that at least partially matches the context. | 2,100 |
5,253 | 14,706,015 | 2,198 | The topology and operation of virtual entities and sub-entities of a data center may be monitored and correlated to services and customers supported by the data center. | 1. A data center element comprising:
a computing platform comprising a specially programmed processor operable to execute instructions stored in an associated memory to configure the platform as one or more virtual entities, each entity comprising a configured agent operable to complete one or more integrated processes comprising,
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and
sending the collected information to a controller. 2. The data center element as in claim 1 wherein the information comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 3. The data center element as in claim 1 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 4. The data center element as in claim 1 wherein the one or more virtual entities comprise one or more virtual switches or one or more virtual machines. 5. The data center element as in claim 1 wherein the element comprises a router or server. 6. A system for monitoring a data center comprising:
a controller comprising a specially programmed processor operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising,
receiving information from one or more configured agents associated with one or more configured virtual entities of a data center, and
parsing the received information to generate a topology of the data center and to correlate the generated topology with one or more services supported by the data center. 7. The system as in claim 6 wherein the information received from the one or more agents comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 8. The system as in claim 6 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 9. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
receiving information from one or more non-virtual elements of the data center; and
parsing the received information from the one or more non-virtual elements to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 10. The system as in claim 9 wherein one or more of the non-virtual elements comprise a router, ports of a router or a controller. 11. The system as in claim 9 wherein the information received from the one or more non-virtual elements comprises connection or status information. 12. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
receiving information from one or more hypervisors or control entities of the data center; and
parsing the received information from the one or more hypervisors or control entities to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 13. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that are known to be affected by the failure in the data center; and
correlating the identified entities, elements and pathways with one or more services supported by the data center that are known to be affected by the failure. 14. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that may be potentially affected by the failure in the data center; and
correlating the potentially identified entities, elements and pathways with one or more services supported by the data center that may be potentially affected. 15. The system as in claim 14 wherein the failure is selected from the group consisting of a pathway failure, tunnel failure, virtual entity failure, non-virtual element failure, and a sub-virtual entity failure. 16. The system as in claim 6 further comprising a graphical user interface operable to control the display of one or more virtual nodes of the data center. 17. The system as in claim 16 wherein a virtual node comprises one or more virtual entities of the data center. 18. The system as in claim 17 wherein the one or more virtual entities comprise one or more virtual switches. 19. The system as in claim 6 further comprising a data center element, the element comprising:
a computing platform comprising a specially programmed processor operable to execute instructions stored in an associated memory to configure the platform one or more virtual entities, the entity comprising a configured agent operable to complete one or more integrated processes comprising,
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and
sending the collected information to a controller. 20. The system as in claim 19 wherein data center element comprises a router or server. 21. A method for monitoring a data center comprising:
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and sending the collected information to a controller. 22. The method as in claim 21 wherein the information comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 23. The method as in claim 21 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 24. The method as in claim 21 wherein one or more of the virtual entities comprise one or more a virtual switches or one or more virtual machines. 25. A method for monitoring a data center comprising:
receiving information from one or more configured agents associated with one or more configured virtual entities of a data center, and parsing the received information to generate a topology of the data center and to correlate the generated topology with one or more services supported by the data center. 26. The method as in claim 25 wherein the information received from the one or more agents comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 27. The method as in claim 25 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 28. The method as in claim 25 further comprising:
receiving information from one or more non-virtual elements of the data center; and
parsing the received information from the one or more non-virtual elements to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 29. The method as in claim 28 wherein one or more of the non-virtual elements comprise a router, ports of a router or a controller. 30. The method as in claim 28 wherein the information received from the one or more non-virtual elements comprises connection or status information. 31. The method as in claim 25 further comprising:
receiving information from one or more hypervisors or control entities of the data center; and
parsing the received information from the one or more hypervisors or control entities to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 32. The method as in claim 25 further comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that are known to be affected by the failure in the data center; and
correlating the identified entities, elements and pathways with one or more services supported by the data center that are known to be affected by the failure. 33. The method as in claim 25 further comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that may be potentially affected by the failure in the data center; and
correlating the potentially identified entities, elements and pathways with one or more services supported by the data center that may be potentially affected. 34. The method as in claim 33 wherein the failure is selected from the group consisting of a pathway failure, tunnel failure, virtual entity failure, non-virtual element failure, and a sub-virtual entity failure. 35. The method as in claim 25 further comprising controlling the display of one or more virtual nodes of the data center. | The topology and operation of virtual entities and sub-entities of a data center may be monitored and correlated to services and customers supported by the data center.1. A data center element comprising:
a computing platform comprising a specially programmed processor operable to execute instructions stored in an associated memory to configure the platform as one or more virtual entities, each entity comprising a configured agent operable to complete one or more integrated processes comprising,
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and
sending the collected information to a controller. 2. The data center element as in claim 1 wherein the information comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 3. The data center element as in claim 1 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 4. The data center element as in claim 1 wherein the one or more virtual entities comprise one or more virtual switches or one or more virtual machines. 5. The data center element as in claim 1 wherein the element comprises a router or server. 6. A system for monitoring a data center comprising:
a controller comprising a specially programmed processor operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising,
receiving information from one or more configured agents associated with one or more configured virtual entities of a data center, and
parsing the received information to generate a topology of the data center and to correlate the generated topology with one or more services supported by the data center. 7. The system as in claim 6 wherein the information received from the one or more agents comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 8. The system as in claim 6 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 9. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
receiving information from one or more non-virtual elements of the data center; and
parsing the received information from the one or more non-virtual elements to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 10. The system as in claim 9 wherein one or more of the non-virtual elements comprise a router, ports of a router or a controller. 11. The system as in claim 9 wherein the information received from the one or more non-virtual elements comprises connection or status information. 12. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
receiving information from one or more hypervisors or control entities of the data center; and
parsing the received information from the one or more hypervisors or control entities to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 13. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that are known to be affected by the failure in the data center; and
correlating the identified entities, elements and pathways with one or more services supported by the data center that are known to be affected by the failure. 14. The system as in claim 6 wherein the controller is further operable to execute instructions stored in an associated memory to complete one or more integrated processes comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that may be potentially affected by the failure in the data center; and
correlating the potentially identified entities, elements and pathways with one or more services supported by the data center that may be potentially affected. 15. The system as in claim 14 wherein the failure is selected from the group consisting of a pathway failure, tunnel failure, virtual entity failure, non-virtual element failure, and a sub-virtual entity failure. 16. The system as in claim 6 further comprising a graphical user interface operable to control the display of one or more virtual nodes of the data center. 17. The system as in claim 16 wherein a virtual node comprises one or more virtual entities of the data center. 18. The system as in claim 17 wherein the one or more virtual entities comprise one or more virtual switches. 19. The system as in claim 6 further comprising a data center element, the element comprising:
a computing platform comprising a specially programmed processor operable to execute instructions stored in an associated memory to configure the platform one or more virtual entities, the entity comprising a configured agent operable to complete one or more integrated processes comprising,
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and
sending the collected information to a controller. 20. The system as in claim 19 wherein data center element comprises a router or server. 21. A method for monitoring a data center comprising:
collecting information associated with one or more configured virtual entities and sub-entities of the virtual entities; and sending the collected information to a controller. 22. The method as in claim 21 wherein the information comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 23. The method as in claim 21 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 24. The method as in claim 21 wherein one or more of the virtual entities comprise one or more a virtual switches or one or more virtual machines. 25. A method for monitoring a data center comprising:
receiving information from one or more configured agents associated with one or more configured virtual entities of a data center, and parsing the received information to generate a topology of the data center and to correlate the generated topology with one or more services supported by the data center. 26. The method as in claim 25 wherein the information received from the one or more agents comprises initial connection information, initial status information, or initial tunneling information or some combination of the initial connection, status and tunneling information. 27. The method as in claim 25 wherein the information comprises revised connection information, revised status information, or revised tunneling information or some combination of the revised connection, status and tunneling information. 28. The method as in claim 25 further comprising:
receiving information from one or more non-virtual elements of the data center; and
parsing the received information from the one or more non-virtual elements to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 29. The method as in claim 28 wherein one or more of the non-virtual elements comprise a router, ports of a router or a controller. 30. The method as in claim 28 wherein the information received from the one or more non-virtual elements comprises connection or status information. 31. The method as in claim 25 further comprising:
receiving information from one or more hypervisors or control entities of the data center; and
parsing the received information from the one or more hypervisors or control entities to generate the topology, and to correlate the generated topology with the one or more services supported by the data center. 32. The method as in claim 25 further comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that are known to be affected by the failure in the data center; and
correlating the identified entities, elements and pathways with one or more services supported by the data center that are known to be affected by the failure. 33. The method as in claim 25 further comprising:
parsing the received information to identify entities, elements and pathways of the generated topology that may be potentially affected by the failure in the data center; and
correlating the potentially identified entities, elements and pathways with one or more services supported by the data center that may be potentially affected. 34. The method as in claim 33 wherein the failure is selected from the group consisting of a pathway failure, tunnel failure, virtual entity failure, non-virtual element failure, and a sub-virtual entity failure. 35. The method as in claim 25 further comprising controlling the display of one or more virtual nodes of the data center. | 2,100 |
5,254 | 15,143,299 | 2,111 | A method and apparatus for evaluating and optimizing a signaling system is described. A pattern of test information is generated in a transmit circuit of the system and is transmitted to a receive circuit. A similar pattern of information is generated in the receive circuit and used as a reference. The receive circuit compares the patterns. Any differences between the patterns are observable. In one embodiment, a linear feedback shift register (LFSR) is implemented to produce patterns. An embodiment of the present disclosure may be practiced with various types of signaling systems, including those with single-ended signals and those with differential signals. An embodiment of the present disclosure may be applied to systems communicating a single bit of information on a single conductor at a given time and to systems communicating multiple bits of information on a single conductor simultaneously. | 1. An integrated circuit to connect to an electrical conductor coupling the integrated circuit with a transmitter, the integrated circuit comprising:
circuitry to generate a repeating pattern signal during a test mode; a receiver to serially receive a signal via the electrical conductor from the transmitter, the signal comprising a data signal during a normal mode and a repeating test pattern during the test mode; circuitry to change during the test mode at least one parameter affecting reception of the signal from the transmitter, such that the repeating test pattern from the transmitter is received using alternate values of the at least one parameter; and circuitry to compare the repeating pattern signal generated by the circuitry to generate with the repeating test pattern serially received by the receiver during the test mode, to generate a comparison output. | A method and apparatus for evaluating and optimizing a signaling system is described. A pattern of test information is generated in a transmit circuit of the system and is transmitted to a receive circuit. A similar pattern of information is generated in the receive circuit and used as a reference. The receive circuit compares the patterns. Any differences between the patterns are observable. In one embodiment, a linear feedback shift register (LFSR) is implemented to produce patterns. An embodiment of the present disclosure may be practiced with various types of signaling systems, including those with single-ended signals and those with differential signals. An embodiment of the present disclosure may be applied to systems communicating a single bit of information on a single conductor at a given time and to systems communicating multiple bits of information on a single conductor simultaneously.1. An integrated circuit to connect to an electrical conductor coupling the integrated circuit with a transmitter, the integrated circuit comprising:
circuitry to generate a repeating pattern signal during a test mode; a receiver to serially receive a signal via the electrical conductor from the transmitter, the signal comprising a data signal during a normal mode and a repeating test pattern during the test mode; circuitry to change during the test mode at least one parameter affecting reception of the signal from the transmitter, such that the repeating test pattern from the transmitter is received using alternate values of the at least one parameter; and circuitry to compare the repeating pattern signal generated by the circuitry to generate with the repeating test pattern serially received by the receiver during the test mode, to generate a comparison output. | 2,100 |
5,255 | 14,500,023 | 2,124 | Methods, systems, and computer program products for category oversampling for imbalanced machine learning are provided herein. A method includes identifying an anchor data point in a given class of data points underrepresented among multiple classes in a data set of multiple data points, wherein each data point represent a vector; determining a number of data points in the given class that neighbor the anchor data point, wherein the number comprises two or more; applying a weight to (i) each of the number of data points to create a number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all weights is equal to one; performing a vector summation by summing the number of weighted neighboring data points and the weighted anchor data point; and generating a synthetic data point based on said vector summation. | 1. A method comprising the following steps:
identifying an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector; determining a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more; applying a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one; performing a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and generating a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation; wherein at least one of the steps is carried out by a computing device. 2. The method of claim 1, comprising:
repeating all of said steps for a given number of iterations. 3. The method of claim 2, wherein the given number of iterations is identified by a user. 4. The method of claim 2, wherein the given number of iterations comprises the number of iterations required to establish a representation balance among the multiple classes in the data set. 5. The method of claim 1, wherein the given class of data points comprises a set of data points represented as n-dimensional feature vectors in an n-dimensional feature space. 6. The method of claim 5, wherein the generated synthetic data point subsists within the n-dimensional feature space. 7. The method of claim 1, wherein said determining comprises implementation of a k-nearest neighbors algorithm. 8. The method of claim 1, wherein said identifying the anchor data point comprises randomly selecting the anchor data point. 9. The method of claim 1, wherein said weight applied to each of the neighboring data points is based on proximity to the anchor point. 10. The method of claim 1, wherein said weight applied to each of the neighboring data points is randomly selected. 11. The method of claim 1, wherein said weight applied to the anchor data point is equal to the number of data points in the given class that neighbor the anchor data point. 12. The method of claim 11, wherein said weight applied to the anchor data point is equal to the k-nearest neighbors of the anchor data point. 13. The method of claim 1, wherein said identifying the anchor data point is executed by an anchor data point determination engine of a synthetic data point generation computing device. 14. The method of claim 1, wherein said determining the given number of data points in the given class that neighbor the anchor data point is executed by a neighboring data points determination engine of a synthetic data point generation computing device. 15. The method of claim 1, wherein said applying a weight to each of the given number of data points in the given class that neighbor the anchor data point is executed by a weight application engine of a synthetic data point generation computing device. 16. The method of claim 1, wherein said applying a weight to the anchor data point is executed by a weight application engine of a synthetic data point generation computing device. 17. The method of claim 1, wherein said performing the vector summation is executed by a synthetic data point generator engine of a synthetic data point generation computing device. 18. The method of claim 1, wherein said generating the synthetic data point is executed by a synthetic data point generator engine of a synthetic data point generation computing device. 19. A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computing device to cause the computing device to:
identify an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector; determine a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more; apply a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one; perform a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and generate a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation. 20. A system comprising:
a memory; and at least one processor coupled to the memory and configured for:
identifying an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector;
determining a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more;
applying a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one;
performing a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and
generating a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation. | Methods, systems, and computer program products for category oversampling for imbalanced machine learning are provided herein. A method includes identifying an anchor data point in a given class of data points underrepresented among multiple classes in a data set of multiple data points, wherein each data point represent a vector; determining a number of data points in the given class that neighbor the anchor data point, wherein the number comprises two or more; applying a weight to (i) each of the number of data points to create a number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all weights is equal to one; performing a vector summation by summing the number of weighted neighboring data points and the weighted anchor data point; and generating a synthetic data point based on said vector summation.1. A method comprising the following steps:
identifying an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector; determining a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more; applying a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one; performing a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and generating a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation; wherein at least one of the steps is carried out by a computing device. 2. The method of claim 1, comprising:
repeating all of said steps for a given number of iterations. 3. The method of claim 2, wherein the given number of iterations is identified by a user. 4. The method of claim 2, wherein the given number of iterations comprises the number of iterations required to establish a representation balance among the multiple classes in the data set. 5. The method of claim 1, wherein the given class of data points comprises a set of data points represented as n-dimensional feature vectors in an n-dimensional feature space. 6. The method of claim 5, wherein the generated synthetic data point subsists within the n-dimensional feature space. 7. The method of claim 1, wherein said determining comprises implementation of a k-nearest neighbors algorithm. 8. The method of claim 1, wherein said identifying the anchor data point comprises randomly selecting the anchor data point. 9. The method of claim 1, wherein said weight applied to each of the neighboring data points is based on proximity to the anchor point. 10. The method of claim 1, wherein said weight applied to each of the neighboring data points is randomly selected. 11. The method of claim 1, wherein said weight applied to the anchor data point is equal to the number of data points in the given class that neighbor the anchor data point. 12. The method of claim 11, wherein said weight applied to the anchor data point is equal to the k-nearest neighbors of the anchor data point. 13. The method of claim 1, wherein said identifying the anchor data point is executed by an anchor data point determination engine of a synthetic data point generation computing device. 14. The method of claim 1, wherein said determining the given number of data points in the given class that neighbor the anchor data point is executed by a neighboring data points determination engine of a synthetic data point generation computing device. 15. The method of claim 1, wherein said applying a weight to each of the given number of data points in the given class that neighbor the anchor data point is executed by a weight application engine of a synthetic data point generation computing device. 16. The method of claim 1, wherein said applying a weight to the anchor data point is executed by a weight application engine of a synthetic data point generation computing device. 17. The method of claim 1, wherein said performing the vector summation is executed by a synthetic data point generator engine of a synthetic data point generation computing device. 18. The method of claim 1, wherein said generating the synthetic data point is executed by a synthetic data point generator engine of a synthetic data point generation computing device. 19. A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computing device to cause the computing device to:
identify an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector; determine a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more; apply a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one; perform a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and generate a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation. 20. A system comprising:
a memory; and at least one processor coupled to the memory and configured for:
identifying an anchor data point in a given class of data points, wherein the given class of data points is underrepresented among multiple classes in a data set of multiple data points, wherein each of the multiple data points represents a vector;
determining a given number of data points in the given class that neighbor the anchor data point, wherein the given number comprises two or more;
applying a weight to (i) each of the given number of data points in the given class that neighbor the anchor data point to create a given number of weighted neighboring data points, and (ii) the anchor data point to create a weighted anchor data point, wherein the sum of all applied weights is equal to one;
performing a vector summation by summing the given number of weighted neighboring data points and the weighted anchor data point; and
generating a synthetic data point to be associated with the given class of data points, wherein the synthetic data point represents the result of said vector summation. | 2,100 |
5,256 | 13,854,236 | 2,143 | In some embodiments, facial recognition can be used to aid in the association of human gestural commands with particular users and particular computing devices associated with those users. This can be used for example to control television viewing in one embodiment and to enable the users to provide gestural commands to have information about the television program from the television sent to their associated computing devices. In addition, the facial recognition may assist in distinguishing commands from one user from those of another user, avoiding the need to require that the users remain within fixed positions associated with each user. | 1. A method comprising:
associating a hand gestural command from one person of a plurality of persons by associating a hand with a face using computer video analysis of the one person's hand, arm and face. 2. The method of claim 1 including capturing an image of a first and second person; and
using computer video analysis to determine whether a hand gesture was made by the first or the second person. 3. The method of claim 2 including identifying an arm, body and face connected to the hand making a recognizable gesture. 4. The method of claim 3 including using facial recognition to identify the one person. 5. The method of claim 1 including capturing an image of said user in a first computer. 6. The method of claim 5 including capturing an image of the user using a first computer to associate the hand gestural command with the user. 7. The method of claim 6 including receiving an image of the user from a second computer. 8. The method of claim 7 including comparing said images from different computers. 9. The method of claim 8 including associating at least one of said images with said first person and said second computer. 10. The method of claim 9 including sending a message to said second computer. 11. The method of claim 1 including displaying television. 12. The method claim 11 including enabling said television to be controlled by gestural commands. 13. The method of claim 12 including enabling a television signal to be sent from said television to a device associated with said one person, in response to a gestural command. 14. A method comprising:
enabling a mobile device to link to a computer; enabling the computer to capture an image of a user; and enabling the computer to link a mobile device and the image. 15. The method of claim 14 including enabling a computer that is a television receiver to capture a user's image. 16. The method of claim 15 including enabling the television to recognize a human gestural command and to send information to said mobile device in response to detection of the image and the gestural command. 17. The method of claim 16 including enabling said television to distinguish gestural commands from different users using facial recognition. 18. The method of claim 16 including enabling the television to compare an image of a user from the mobile device to an image of the user captured by the television. 19. The method of claim 15 including enabling said television to communicate over a network with said mobile device. 20. The method claim 17 including enabling said television to analyze an image of two persons and to determine which person is connected to a hand making a gestural command. 21. The method of claim 14 including using an image received from said mobile device to link the mobile device to said television. 22. The method of claim 19 including capturing an image of a user and comparing said image to an image received from said mobile device. 23. The method of claim 20 including using said images to identify a user making a gestural command. 24. The method of claim 14 including enabling recognition of a hand gestural command. 25. At least one computer readable medium storing instructions that in response to being executed on a computing device cause the computing device to carry out a method according to claim 24. 26. An apparatus to perform the method of claim 24. 27. The apparatus of claim 26 wherein said apparatus includes a television. | In some embodiments, facial recognition can be used to aid in the association of human gestural commands with particular users and particular computing devices associated with those users. This can be used for example to control television viewing in one embodiment and to enable the users to provide gestural commands to have information about the television program from the television sent to their associated computing devices. In addition, the facial recognition may assist in distinguishing commands from one user from those of another user, avoiding the need to require that the users remain within fixed positions associated with each user.1. A method comprising:
associating a hand gestural command from one person of a plurality of persons by associating a hand with a face using computer video analysis of the one person's hand, arm and face. 2. The method of claim 1 including capturing an image of a first and second person; and
using computer video analysis to determine whether a hand gesture was made by the first or the second person. 3. The method of claim 2 including identifying an arm, body and face connected to the hand making a recognizable gesture. 4. The method of claim 3 including using facial recognition to identify the one person. 5. The method of claim 1 including capturing an image of said user in a first computer. 6. The method of claim 5 including capturing an image of the user using a first computer to associate the hand gestural command with the user. 7. The method of claim 6 including receiving an image of the user from a second computer. 8. The method of claim 7 including comparing said images from different computers. 9. The method of claim 8 including associating at least one of said images with said first person and said second computer. 10. The method of claim 9 including sending a message to said second computer. 11. The method of claim 1 including displaying television. 12. The method claim 11 including enabling said television to be controlled by gestural commands. 13. The method of claim 12 including enabling a television signal to be sent from said television to a device associated with said one person, in response to a gestural command. 14. A method comprising:
enabling a mobile device to link to a computer; enabling the computer to capture an image of a user; and enabling the computer to link a mobile device and the image. 15. The method of claim 14 including enabling a computer that is a television receiver to capture a user's image. 16. The method of claim 15 including enabling the television to recognize a human gestural command and to send information to said mobile device in response to detection of the image and the gestural command. 17. The method of claim 16 including enabling said television to distinguish gestural commands from different users using facial recognition. 18. The method of claim 16 including enabling the television to compare an image of a user from the mobile device to an image of the user captured by the television. 19. The method of claim 15 including enabling said television to communicate over a network with said mobile device. 20. The method claim 17 including enabling said television to analyze an image of two persons and to determine which person is connected to a hand making a gestural command. 21. The method of claim 14 including using an image received from said mobile device to link the mobile device to said television. 22. The method of claim 19 including capturing an image of a user and comparing said image to an image received from said mobile device. 23. The method of claim 20 including using said images to identify a user making a gestural command. 24. The method of claim 14 including enabling recognition of a hand gestural command. 25. At least one computer readable medium storing instructions that in response to being executed on a computing device cause the computing device to carry out a method according to claim 24. 26. An apparatus to perform the method of claim 24. 27. The apparatus of claim 26 wherein said apparatus includes a television. | 2,100 |
5,257 | 14,514,674 | 2,132 | The subject disclosure relates to analyzing memory allocations for one or more computer-implemented processes. In particular, in conjunction with employing tags for tracking memory allocation commands, currently allocated memory can be examined for various characteristics of inefficient memory use. For example, as memory is initially allocated, a predetermined bit pattern can be written to the newly allocated memory. Thus, detection of the predetermined bit pattern can be indicative of wasted memory use. Moreover, additional features can be provided to both analyze data and present views associated with that analysis relating to identification of memory fragmentation, over-allocation, sparse memory use, duplication of allocations, multiple module loads, and so forth. | 1. A method performed by a computing system having a processor and memory, the method comprising:
detecting a memory allocation instruction to allocate a portion of the memory, the memory allocation instruction being issued by a process executed by the processor; in response to the detected memory allocation instruction for allocating a portion of the memory,
allocating a portion of the memory;
creating a tag corresponding to the allocated portion of the memory, the tag including information of a call stack associated with the monitored memory allocation instruction; and
storing the created tag in a private heap of the memory;
subsequently, detecting a memory release instruction to release the allocated portion of the memory; and in response to the detected memory release instruction, deleting the stored tag corresponding to the allocated portion of the memory from the private heap of the memory. 2. The method of claim 1 wherein the created tag includes information relating to at least one of a type of allocation, an entity issuing the monitored allocation instruction, or an amount of the portion of memory allocated. 3. The method of claim 1 wherein the process is a first process and detecting the memory allocation instruction includes detecting the memory allocation instruction from the first process, and wherein detecting the memory release instruction includes detecting the memory release instruction from a second process different than the first process. 4. The method of claim 1 wherein the process includes native code and detecting the memory allocation instruction includes detecting the memory allocation instruction from the native code, and wherein detecting the memory release instruction includes detecting the memory release instruction from managed code. 5. The method of claim 1 wherein detecting the memory release instruction includes detecting the memory release instruction from a garbage collection process. 6. The method of claim 1, further comprising tracking the allocated portion of the memory during a garbage collection process and associating the created tag with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. 7. The method of claim 1, further comprising tracking the allocated portion of the memory during a garbage collection process and tagging an objection associated with the allocated portion of the memory with a number of times the object has survived or moved during garbage collection processes. 8. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; analyzing memory allocation based on one or more tags currently stored in the private heap; and detecting duplication in memory allocation based on the information associated with the call stack associated with each tag. 9. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; sorting the allocated portions of the memory corresponding to the tags currently stored in the private heap; counting a number of gaps between successive sorted portions of the memory; and determining whether the memory is fragmented based on the counted number of gaps greater than a threshold. 10. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; sorting the allocated portions of the memory corresponding to the tags currently stored in the private heap; counting a number of gaps between successive sorted portions of the memory, the gaps being greater than a threshold; and determining whether the memory is fragmented based on a total number of counted gaps and a total amount of allocated memory. 11. The method of claim 1, further comprising determining a total amount of memory allocated within a heap of the memory. 12. A computing system, comprising:
a processor and a memory coupled to the processor, the memory containing instruction that when executed by the processor cause the processor to perform a process that includes:
monitoring for memory allocation instructions and memory release instructions from one or more processes executed by the processor, the one or more processes including a garbage collection process;
upon detection of a memory allocation instruction for allocating a portion of the memory,
creating a tag corresponding to an allocated portion of the memory in response to the memory allocation instruction, the tag including information of a call stack associated with the monitored memory allocation instruction; and
storing the created tag in a private heap of the memory; and
upon detection of a monitored release instruction to release the allocated portion of the memory, deleting the tag from the private heap of the memory. 13. The computing system of claim 12 wherein monitoring for memory allocation instructions and memory release instructions includes monitoring for the memory allocation instruction from a first process and monitoring for the memory release instruction from a second process different than the first process. 14. The computing system of claim 12 wherein monitoring for memory allocation instructions and memory release instructions includes monitoring for the memory allocation instruction from native code and monitoring for the memory release instruction from managed code. 15. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process. 16. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process and associating the created tag with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. 17. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process and tagging an objection associated with the allocated portion of the memory with a number of times the object has survived or moved during garbage collection processes. 18. The computing system of claim 12 wherein the process performed by the processor further includes repeating the creating and storing operations upon detection of memory allocation instructions to generate a plurality of tags in the private heap; analyzing memory allocations corresponding to the tags currently stored in the private heap; and detecting duplication in memory allocation based on the information of the call stack associated with each tag. 19. A method performed by a computing system having a processor and memory, the method comprising:
monitoring for memory allocation instructions and memory release instructions from one or more processes executed by the processor, the one or more processes including a garbage collection process; upon detection of monitored memory allocation instructions individually for allocating a portion of the memory,
allocating portions of the memory corresponding to the individual memory allocation instructions;
creating tags corresponding to the individual allocated portions of the memory, the tags each including information associated with a call stack corresponding to the individual memory allocation instructions; and
storing the created tags in a private heap of the memory;
upon detection of a monitored release instruction to release one of the allocated portions of the memory, deleting a tag from the private heap of the memory, the deleted tag corresponding to the allocated portion of the memory; and detecting at least one of duplication in memory allocation or fragmentation based on the information of the call stack associated with each of the tags currently stored in the private heap. 20. The method of claim 19, further comprising tracking the allocated portions of the memory during a garbage collection process and associating one of the created tags with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. | The subject disclosure relates to analyzing memory allocations for one or more computer-implemented processes. In particular, in conjunction with employing tags for tracking memory allocation commands, currently allocated memory can be examined for various characteristics of inefficient memory use. For example, as memory is initially allocated, a predetermined bit pattern can be written to the newly allocated memory. Thus, detection of the predetermined bit pattern can be indicative of wasted memory use. Moreover, additional features can be provided to both analyze data and present views associated with that analysis relating to identification of memory fragmentation, over-allocation, sparse memory use, duplication of allocations, multiple module loads, and so forth.1. A method performed by a computing system having a processor and memory, the method comprising:
detecting a memory allocation instruction to allocate a portion of the memory, the memory allocation instruction being issued by a process executed by the processor; in response to the detected memory allocation instruction for allocating a portion of the memory,
allocating a portion of the memory;
creating a tag corresponding to the allocated portion of the memory, the tag including information of a call stack associated with the monitored memory allocation instruction; and
storing the created tag in a private heap of the memory;
subsequently, detecting a memory release instruction to release the allocated portion of the memory; and in response to the detected memory release instruction, deleting the stored tag corresponding to the allocated portion of the memory from the private heap of the memory. 2. The method of claim 1 wherein the created tag includes information relating to at least one of a type of allocation, an entity issuing the monitored allocation instruction, or an amount of the portion of memory allocated. 3. The method of claim 1 wherein the process is a first process and detecting the memory allocation instruction includes detecting the memory allocation instruction from the first process, and wherein detecting the memory release instruction includes detecting the memory release instruction from a second process different than the first process. 4. The method of claim 1 wherein the process includes native code and detecting the memory allocation instruction includes detecting the memory allocation instruction from the native code, and wherein detecting the memory release instruction includes detecting the memory release instruction from managed code. 5. The method of claim 1 wherein detecting the memory release instruction includes detecting the memory release instruction from a garbage collection process. 6. The method of claim 1, further comprising tracking the allocated portion of the memory during a garbage collection process and associating the created tag with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. 7. The method of claim 1, further comprising tracking the allocated portion of the memory during a garbage collection process and tagging an objection associated with the allocated portion of the memory with a number of times the object has survived or moved during garbage collection processes. 8. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; analyzing memory allocation based on one or more tags currently stored in the private heap; and detecting duplication in memory allocation based on the information associated with the call stack associated with each tag. 9. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; sorting the allocated portions of the memory corresponding to the tags currently stored in the private heap; counting a number of gaps between successive sorted portions of the memory; and determining whether the memory is fragmented based on the counted number of gaps greater than a threshold. 10. The method of claim 1, further comprising:
repeating the detecting a memory allocation instruction, allocating, creating, and storing operations; sorting the allocated portions of the memory corresponding to the tags currently stored in the private heap; counting a number of gaps between successive sorted portions of the memory, the gaps being greater than a threshold; and determining whether the memory is fragmented based on a total number of counted gaps and a total amount of allocated memory. 11. The method of claim 1, further comprising determining a total amount of memory allocated within a heap of the memory. 12. A computing system, comprising:
a processor and a memory coupled to the processor, the memory containing instruction that when executed by the processor cause the processor to perform a process that includes:
monitoring for memory allocation instructions and memory release instructions from one or more processes executed by the processor, the one or more processes including a garbage collection process;
upon detection of a memory allocation instruction for allocating a portion of the memory,
creating a tag corresponding to an allocated portion of the memory in response to the memory allocation instruction, the tag including information of a call stack associated with the monitored memory allocation instruction; and
storing the created tag in a private heap of the memory; and
upon detection of a monitored release instruction to release the allocated portion of the memory, deleting the tag from the private heap of the memory. 13. The computing system of claim 12 wherein monitoring for memory allocation instructions and memory release instructions includes monitoring for the memory allocation instruction from a first process and monitoring for the memory release instruction from a second process different than the first process. 14. The computing system of claim 12 wherein monitoring for memory allocation instructions and memory release instructions includes monitoring for the memory allocation instruction from native code and monitoring for the memory release instruction from managed code. 15. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process. 16. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process and associating the created tag with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. 17. The computing system of claim 12 wherein the process performed by the processor further includes tracking the allocated portion of the memory during the garbage collection process and tagging an objection associated with the allocated portion of the memory with a number of times the object has survived or moved during garbage collection processes. 18. The computing system of claim 12 wherein the process performed by the processor further includes repeating the creating and storing operations upon detection of memory allocation instructions to generate a plurality of tags in the private heap; analyzing memory allocations corresponding to the tags currently stored in the private heap; and detecting duplication in memory allocation based on the information of the call stack associated with each tag. 19. A method performed by a computing system having a processor and memory, the method comprising:
monitoring for memory allocation instructions and memory release instructions from one or more processes executed by the processor, the one or more processes including a garbage collection process; upon detection of monitored memory allocation instructions individually for allocating a portion of the memory,
allocating portions of the memory corresponding to the individual memory allocation instructions;
creating tags corresponding to the individual allocated portions of the memory, the tags each including information associated with a call stack corresponding to the individual memory allocation instructions; and
storing the created tags in a private heap of the memory;
upon detection of a monitored release instruction to release one of the allocated portions of the memory, deleting a tag from the private heap of the memory, the deleted tag corresponding to the allocated portion of the memory; and detecting at least one of duplication in memory allocation or fragmentation based on the information of the call stack associated with each of the tags currently stored in the private heap. 20. The method of claim 19, further comprising tracking the allocated portions of the memory during a garbage collection process and associating one of the created tags with another portion of the memory when the allocated portion of the memory is moved to the another portion of the memory during the garbage collection process. | 2,100 |
5,258 | 15,576,162 | 2,144 | A user interface for a motor vehicle is displayed on a touchscreen which detects at least one wiping movement. The user interface is generated by a control device controlling a vehicle device as a function of the at least one wiping movement. The user interface includes an operator control panel for setting a value of an operating parameter of the vehicle device. The control device activates the operator control panel as a function of a predetermined activation condition and sets the value in the operator control panel as a function of the at least one wiping movement when the operator control panel is activated. The control device assigns a part of the at least one wiping movement, detected outside the operator control panel, to the operator control panel and sets the value as a function of the part detected outside the operator control panel. | 1-10. (canceled) 11. A control device for a motor vehicle, comprising:
a touchscreen configured to display a graphical user interface and to capture at least one swiping movement; and a controller configured to generate the graphical user interface and to control a vehicle device in dependence on the at least one swiping movement, the graphical user interface having an operating field for setting a value of an operating parameter of the vehicle device, the controller further configured to activate the operating field in dependence on a predetermined activation condition and, once the operating field is activated, to set the value in the operating field in dependence on the at least one swiping movement, including to assign, when the operating field is activated, a portion of the at least one swiping movement captured outside the operating field to the operating field, and to set the value in dependence on the portion that is captured outside the operating field. 12. The control device as claimed in claim 11, wherein the controller is further configured to define in the operating field the value in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field and to ascertain the linear component by projecting the swiping movement onto the adjusting axis. 13. The control device as claimed in claim 11, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies within the operating field. 14. The control device as claimed in claim 11, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies outside the operating field and a starting direction of the swiping movement is one of aligned along a predetermined direction axis and in a predetermined direction. 15. The control device as claimed in claim 11, wherein the controller is further configured to set, during at least one swiping movement in the operating field, the value in dependence on an amount of movement of the swiping movement. 16. The control device as claimed in claim 11, wherein the controller is further configured to set, during at least one swiping movement in the operating field, the value in dependence on a current point of touch of an input element that performs the swiping movement. 17. The control device as claimed in claim 11, wherein the controller is further configured to deactivate, after the activation of the operating field, the activated operating field after a predetermined time period has elapsed since a last captured swiping movement. 18. The control device as claimed in claim 11, wherein the operating field is one of a slider, a bar graph and a rotary adjuster. 19. A motor vehicle, comprising:
a vehicle device; a touchscreen configured to display a graphical user interface and to capture at least one swiping movement, the graphical user interface having an operating field for setting a value of an operating parameter of the vehicle device; and a controller, coupled to the vehicle device, configured to generate the graphical user interface, to control the vehicle device in dependence on the at least one swiping movement, to activate the operating field in dependence on a predetermined activation condition and, once the operating field is activated, to set the value in the operating field in dependence on the at least one swiping movement, including to assign, when the operating field is activated, a portion of the at least one swiping movement captured outside the operating field to the operating field, and to set the value in dependence on the portion that is captured outside the operating field. 20. The motor vehicle as claimed in claim 19, wherein the controller is further configured to define in the operating field the value in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field and to ascertain the linear component by projecting the swiping movement onto the adjusting axis. 21. The motor vehicle as claimed in claim 19, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies within the operating field. 22. The motor vehicle as claimed in claim 19, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies outside the operating field and a starting direction of the swiping movement is one of aligned along a predetermined direction axis and in a predetermined direction. 23. A method for operating a control device for a motor vehicle, comprising:
generating, by a controller, a graphical user interface on a touchscreen, the graphical user interface having an operating field for setting a value of an operating parameter of a vehicle device; activating, by the controller, the operating field in dependence on a predetermined activation condition; capturing, by the touchscreen, at least one swiping movement; setting, by the controller when the operating field is activated, the value in the operating field in dependence on the at least one swiping movement; assigning, by the controller, when the operating field is activated, a portion of the at least one swiping movement that is captured outside the operating field to the operating field; setting, by the controller, the value in dependence on the portion that is captured outside the operating field; and controlling the vehicle device in dependence on the at least one swiping movement captured by the touchscreen. 24. The method as claimed in claim 23, further comprising:
defining, by the controller, the value in the operating field in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field; and ascertaining, by the controller, the linear component by projecting the swiping movement onto the adjusting axis. 25. The method as claimed in claim 23, wherein the activation condition is the at least one swiping movement having a starting point within the operating field. 26. The method as claimed in claim 23, wherein the activation condition is the at least one swiping movement having a starting point outside the operating field and a starting direction one of in a predetermined direction and aligned along a predetermined direction axis. 27. The method as claimed in claim 23, further comprising setting, by the controller during at least one swiping movement in the operating field, the value in dependence on an amount of movement of the swiping movement. 28. The method as claimed in claim 23, further comprising setting, by the controller during at least one swiping movement in the operating field, the value in dependence on a point of touch of an input element that performs the swiping movement. 29. The method as claimed in claim 23, further comprising deactivating, by the controller, the activated operating field after a predetermined time period has elapsed since a last captured swiping movement. 30. The method as claimed in claim 23, wherein the operating field is one of a slider, a bar graph and a rotary adjuster. | A user interface for a motor vehicle is displayed on a touchscreen which detects at least one wiping movement. The user interface is generated by a control device controlling a vehicle device as a function of the at least one wiping movement. The user interface includes an operator control panel for setting a value of an operating parameter of the vehicle device. The control device activates the operator control panel as a function of a predetermined activation condition and sets the value in the operator control panel as a function of the at least one wiping movement when the operator control panel is activated. The control device assigns a part of the at least one wiping movement, detected outside the operator control panel, to the operator control panel and sets the value as a function of the part detected outside the operator control panel.1-10. (canceled) 11. A control device for a motor vehicle, comprising:
a touchscreen configured to display a graphical user interface and to capture at least one swiping movement; and a controller configured to generate the graphical user interface and to control a vehicle device in dependence on the at least one swiping movement, the graphical user interface having an operating field for setting a value of an operating parameter of the vehicle device, the controller further configured to activate the operating field in dependence on a predetermined activation condition and, once the operating field is activated, to set the value in the operating field in dependence on the at least one swiping movement, including to assign, when the operating field is activated, a portion of the at least one swiping movement captured outside the operating field to the operating field, and to set the value in dependence on the portion that is captured outside the operating field. 12. The control device as claimed in claim 11, wherein the controller is further configured to define in the operating field the value in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field and to ascertain the linear component by projecting the swiping movement onto the adjusting axis. 13. The control device as claimed in claim 11, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies within the operating field. 14. The control device as claimed in claim 11, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies outside the operating field and a starting direction of the swiping movement is one of aligned along a predetermined direction axis and in a predetermined direction. 15. The control device as claimed in claim 11, wherein the controller is further configured to set, during at least one swiping movement in the operating field, the value in dependence on an amount of movement of the swiping movement. 16. The control device as claimed in claim 11, wherein the controller is further configured to set, during at least one swiping movement in the operating field, the value in dependence on a current point of touch of an input element that performs the swiping movement. 17. The control device as claimed in claim 11, wherein the controller is further configured to deactivate, after the activation of the operating field, the activated operating field after a predetermined time period has elapsed since a last captured swiping movement. 18. The control device as claimed in claim 11, wherein the operating field is one of a slider, a bar graph and a rotary adjuster. 19. A motor vehicle, comprising:
a vehicle device; a touchscreen configured to display a graphical user interface and to capture at least one swiping movement, the graphical user interface having an operating field for setting a value of an operating parameter of the vehicle device; and a controller, coupled to the vehicle device, configured to generate the graphical user interface, to control the vehicle device in dependence on the at least one swiping movement, to activate the operating field in dependence on a predetermined activation condition and, once the operating field is activated, to set the value in the operating field in dependence on the at least one swiping movement, including to assign, when the operating field is activated, a portion of the at least one swiping movement captured outside the operating field to the operating field, and to set the value in dependence on the portion that is captured outside the operating field. 20. The motor vehicle as claimed in claim 19, wherein the controller is further configured to define in the operating field the value in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field and to ascertain the linear component by projecting the swiping movement onto the adjusting axis. 21. The motor vehicle as claimed in claim 19, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies within the operating field. 22. The motor vehicle as claimed in claim 19, wherein the controller is further configured to activate the operating field upon the at least one swiping movement when, as the activation condition, a starting point of the swiping movement lies outside the operating field and a starting direction of the swiping movement is one of aligned along a predetermined direction axis and in a predetermined direction. 23. A method for operating a control device for a motor vehicle, comprising:
generating, by a controller, a graphical user interface on a touchscreen, the graphical user interface having an operating field for setting a value of an operating parameter of a vehicle device; activating, by the controller, the operating field in dependence on a predetermined activation condition; capturing, by the touchscreen, at least one swiping movement; setting, by the controller when the operating field is activated, the value in the operating field in dependence on the at least one swiping movement; assigning, by the controller, when the operating field is activated, a portion of the at least one swiping movement that is captured outside the operating field to the operating field; setting, by the controller, the value in dependence on the portion that is captured outside the operating field; and controlling the vehicle device in dependence on the at least one swiping movement captured by the touchscreen. 24. The method as claimed in claim 23, further comprising:
defining, by the controller, the value in the operating field in dependence on a linear component of the swiping movement along a predetermined adjusting axis of the operating field; and ascertaining, by the controller, the linear component by projecting the swiping movement onto the adjusting axis. 25. The method as claimed in claim 23, wherein the activation condition is the at least one swiping movement having a starting point within the operating field. 26. The method as claimed in claim 23, wherein the activation condition is the at least one swiping movement having a starting point outside the operating field and a starting direction one of in a predetermined direction and aligned along a predetermined direction axis. 27. The method as claimed in claim 23, further comprising setting, by the controller during at least one swiping movement in the operating field, the value in dependence on an amount of movement of the swiping movement. 28. The method as claimed in claim 23, further comprising setting, by the controller during at least one swiping movement in the operating field, the value in dependence on a point of touch of an input element that performs the swiping movement. 29. The method as claimed in claim 23, further comprising deactivating, by the controller, the activated operating field after a predetermined time period has elapsed since a last captured swiping movement. 30. The method as claimed in claim 23, wherein the operating field is one of a slider, a bar graph and a rotary adjuster. | 2,100 |
5,259 | 14,612,485 | 2,113 | A system for simulating an event includes a memory system, a parity generator/validator, and a fault injector. The fault injector is configured to inject bits at an address in the memory system when the parity generator/validator is in an disabled state. A method of injecting a fault is also disclosed. | 1. A system for simulating an event, comprising:
a memory system; a parity generator/validator; and a fault injector, the fault injector configured to inject bits at an address in the memory system when the parity generator/validator is in an disabled state. 2. The system of claim 1, wherein the fault injector includes a random bit generator configured to generate the bits. 3. The system of claim 1, wherein the fault injector includes a random address generator configured to generate the address. 4. The system of claim 1, wherein the fault injector includes a random event generator, which is configured to perform as a timekeeper. 5. The system of claim 1, wherein the bits are injected into the memory system via a memory bus. 6. The system of claim 1, wherein the memory system includes a plurality of subsystems, and the bit is injected into one of the plurality of subsystems. 7. The system of claim 1, wherein the memory system is on an electronic device on one of an aircraft and a spacecraft. 8. A method of injecting a fault, comprising:
determining an address; disabling a parity generator/validator; determining a bit; and writing the bit to the address. 9. The method of claim 8, further comprising enabling a parity generator/validator subsequent to the writing step. 10. The method of claim 9, wherein the disabling, writing, and enabling steps comprise an atomic operation. 11. The method of claim 10, wherein the atomic operation further includes toggling a bit at the address. 12. The method of claim 8, further comprising determining whether time indicates a fault injection prior to the determining step. 13. The method of claim 12, wherein the address is determined if time indicates fault injection and is not determined if fault does not indicate fault injection. 14. The method of claim 12, wherein the step of determining whether time indicates a fault injection corresponds to an operation condition of an electronic device. 15. The method of claim 8, further comprising determining a time for a next fault injection. | A system for simulating an event includes a memory system, a parity generator/validator, and a fault injector. The fault injector is configured to inject bits at an address in the memory system when the parity generator/validator is in an disabled state. A method of injecting a fault is also disclosed.1. A system for simulating an event, comprising:
a memory system; a parity generator/validator; and a fault injector, the fault injector configured to inject bits at an address in the memory system when the parity generator/validator is in an disabled state. 2. The system of claim 1, wherein the fault injector includes a random bit generator configured to generate the bits. 3. The system of claim 1, wherein the fault injector includes a random address generator configured to generate the address. 4. The system of claim 1, wherein the fault injector includes a random event generator, which is configured to perform as a timekeeper. 5. The system of claim 1, wherein the bits are injected into the memory system via a memory bus. 6. The system of claim 1, wherein the memory system includes a plurality of subsystems, and the bit is injected into one of the plurality of subsystems. 7. The system of claim 1, wherein the memory system is on an electronic device on one of an aircraft and a spacecraft. 8. A method of injecting a fault, comprising:
determining an address; disabling a parity generator/validator; determining a bit; and writing the bit to the address. 9. The method of claim 8, further comprising enabling a parity generator/validator subsequent to the writing step. 10. The method of claim 9, wherein the disabling, writing, and enabling steps comprise an atomic operation. 11. The method of claim 10, wherein the atomic operation further includes toggling a bit at the address. 12. The method of claim 8, further comprising determining whether time indicates a fault injection prior to the determining step. 13. The method of claim 12, wherein the address is determined if time indicates fault injection and is not determined if fault does not indicate fault injection. 14. The method of claim 12, wherein the step of determining whether time indicates a fault injection corresponds to an operation condition of an electronic device. 15. The method of claim 8, further comprising determining a time for a next fault injection. | 2,100 |
5,260 | 15,385,401 | 2,168 | A web browser displays a set of search results from a web search, each search result indicating a link to a web page. Responsive to selection of a first of the set of search results for exclusion from display, a subset of one or more of the set of search results that indicate related links is identified. The related links comprise links have a same domain name as the link of the first search result. The first search result and the subset of the set of search results are excluded. The search results are displayed without the excluded ones of the set of search results. | 1. A method for administration of search results, the method comprising:
displaying a set of search results from a search; responsive to selection of a first search result of the set of search results,
identifying a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result;
excluding all of the set of search results except the first search result and the subset of the set of search results; and
displaying the first search result and the subset of the set of search results. 2. The method of claim 1, further comprising:
determining that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 3. The method of claim 2, wherein said determining that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway comprises determining that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 4. The method of claim 1, wherein said excluding all of the set of search results except the first search result and the subset of the set of search results comprises modifying a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 5. The method of claim 4, wherein said modifying the web page comprises modifying a copy of the web page in a cache of a web browser. 6. The method of claim 4, wherein said displaying the first search result and the subset of the set of search results comprises refreshing display of the web page after said modifying. 7. An apparatus comprising:
a computer processor; and a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions configured to:
display a set of search results from a search,
responsive to selection of a first search result of the set of search results,
identify a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result,
exclude all of the set of search results except the first search result and the subset of the set of search results, and
display the first search result and the subset of the set of search results. 8. The apparatus of claim 7, wherein the computer program instructions are further configured to:
determine that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 9. The apparatus of claim 8, wherein the computer program instructions configured to determine that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway include computer program instructions configured to determine that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 10. The apparatus of claim 7, wherein the computer program instructions configured to exclude all of the set of search results except the first search result and the subset of the set of search results include computer program instructions configured to modify a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 11. The apparatus of claim 10, wherein the web page comprises a copy of a web page in a cache of a web browser. 12. The apparatus of claim 10, wherein the computer program instructions configured to display the first search result and the subset of the set of search results comprise wherein the computer program instructions configured to refresh display of the web page after said modification. 13. A computer program product for administration of search results, the computer program product comprising a non-transitory recording medium having computer program instructions stored therein, the computer program instructions configured to:
display a set of search results from a search; responsive to selection of a first search result of the set of search results,
identify a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result,
exclude all of the set of search results except the first search result and the subset of the set of search results; and
display the first search result and the subset of the set of search results. 14. The computer program product of claim 13, wherein the computer program instructions are further configured to: determine that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 15. The computer program product of claim 14, wherein the computer program instructions configured to determine that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway include computer program instructions configured to determine that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 16. The computer program product of claim 13, wherein the computer program instructions configured to exclude all of the set of search results except the first search result and the subset of the set of search results include computer program instructions configured to modify a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 17. The computer program product of claim 16, wherein the web page comprises a copy of a web page in a cache of a web browser. 18. The computer program product of claim 16, wherein the computer program instructions configured to display the first search result and the subset of the set of search results comprise wherein the computer program instructions configured to refresh display of the web page after said modification. | A web browser displays a set of search results from a web search, each search result indicating a link to a web page. Responsive to selection of a first of the set of search results for exclusion from display, a subset of one or more of the set of search results that indicate related links is identified. The related links comprise links have a same domain name as the link of the first search result. The first search result and the subset of the set of search results are excluded. The search results are displayed without the excluded ones of the set of search results.1. A method for administration of search results, the method comprising:
displaying a set of search results from a search; responsive to selection of a first search result of the set of search results,
identifying a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result;
excluding all of the set of search results except the first search result and the subset of the set of search results; and
displaying the first search result and the subset of the set of search results. 2. The method of claim 1, further comprising:
determining that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 3. The method of claim 2, wherein said determining that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway comprises determining that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 4. The method of claim 1, wherein said excluding all of the set of search results except the first search result and the subset of the set of search results comprises modifying a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 5. The method of claim 4, wherein said modifying the web page comprises modifying a copy of the web page in a cache of a web browser. 6. The method of claim 4, wherein said displaying the first search result and the subset of the set of search results comprises refreshing display of the web page after said modifying. 7. An apparatus comprising:
a computer processor; and a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions configured to:
display a set of search results from a search,
responsive to selection of a first search result of the set of search results,
identify a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result,
exclude all of the set of search results except the first search result and the subset of the set of search results, and
display the first search result and the subset of the set of search results. 8. The apparatus of claim 7, wherein the computer program instructions are further configured to:
determine that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 9. The apparatus of claim 8, wherein the computer program instructions configured to determine that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway include computer program instructions configured to determine that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 10. The apparatus of claim 7, wherein the computer program instructions configured to exclude all of the set of search results except the first search result and the subset of the set of search results include computer program instructions configured to modify a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 11. The apparatus of claim 10, wherein the web page comprises a copy of a web page in a cache of a web browser. 12. The apparatus of claim 10, wherein the computer program instructions configured to display the first search result and the subset of the set of search results comprise wherein the computer program instructions configured to refresh display of the web page after said modification. 13. A computer program product for administration of search results, the computer program product comprising a non-transitory recording medium having computer program instructions stored therein, the computer program instructions configured to:
display a set of search results from a search; responsive to selection of a first search result of the set of search results,
identify a subset of one or more of the set of search results that indicate related links, wherein the related links comprise links having a same domain name as the link of the first search result,
exclude all of the set of search results except the first search result and the subset of the set of search results; and
display the first search result and the subset of the set of search results. 14. The computer program product of claim 13, wherein the computer program instructions are further configured to: determine that the related links of the subset of the set of search results match the link of the first search result up to a specified depth in a uniform resource locator (URL) pathway. 15. The computer program product of claim 14, wherein the computer program instructions configured to determine that the related links of the subset of the set of search results match the link of the first search result up to the specified depth in the URL pathway include computer program instructions configured to determine that URLs of the links of the subset of the search results match a URL of the link of the first search result up to a number of pathway delimiters in accordance with a number that represents the specified depth. 16. The computer program product of claim 13, wherein the computer program instructions configured to exclude all of the set of search results except the first search result and the subset of the set of search results include computer program instructions configured to modify a web page to exclude all of the set of search results except the first search result and the subset of the set of search results. 17. The computer program product of claim 16, wherein the web page comprises a copy of a web page in a cache of a web browser. 18. The computer program product of claim 16, wherein the computer program instructions configured to display the first search result and the subset of the set of search results comprise wherein the computer program instructions configured to refresh display of the web page after said modification. | 2,100 |
5,261 | 14,572,814 | 2,142 | Restructuring a view of messages based on configurable persistence is provided. An application such as a communication application displays summaries of messages within a summary pane of a messaging user interface (UI). The messages include emails. An action is detected to reorder one of the summaries on a top location of a date section of the summary pane. Reorder options are displayed to identify a reorder time of the summary. A selection of one of the reorder options is detected as the reorder time. The summary is relocated to the top location of the date section of the summary pane to display the first summary at the top location of the date section during the reorder time. | 1. A method executed on a computing device to restructure a view of messages based on configurable persistence, the method comprising:
displaying summaries of the messages within a summary pane of a messaging user interface (UI); detecting a first action to reorder a first summary from the summaries to a particular location of a date section of the summary pane; displaying one or more reorder options to identify a reorder time of the first summary; detecting a selection of one of the reorder options as the reorder time; and displaying the first summary at the particular location of the date section of the summary pane until an expiration of the selected duration for the reorder time. 2. The method of claim 1, further comprising:
upon detecting the expiration of the selected duration for the reorder time, displaying the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 3. The method of claim 1, further comprising:
detecting the first action as a horizontal swipe action on the first summary. 4. The method of claim 1, further comprising:
displaying the one or more reorder options at one from a set of: below the first summary and overlaid on the first summary, wherein the one or more reorder options include one or more default tie periods and a user configurable time period. 5. The method of claim 1, further comprising:
reducing a horizontal length of the first summary to display a reduced first summary that provides reduced information of a corresponding message, wherein the particular section is a top location of the date section of the summary pane. 6. The method of claim 1, further comprising:
displaying one or more of a sender identification, a receiver identification, a message subject, a single line summary of a message content, and a timestamp for each of the summaries on the summary pane. 7. The method of claim 6, further comprising:
replacing the timestamp of a corresponding message with the reorder time on the first summary. 8. The method of claim 1, further comprising:
placing new summaries for incoming messages below the first summary. 9. The method of claim 1, further comprising:
in response to the expiration of the selected duration for the reorder time,
displaying a current time as a timestamp on the first summary, and
allowing new summaries of incoming messages to be placed above the first summary. 10. The method of claim 1, further comprising:
displaying a reorder control on the first summary that includes an option to deactivate a reordered status of the first summary; detecting a second action deactivating the reorder control; displaying a current time as a timestamp on the first summary; and allowing new summaries of incoming messages to be placed above the first summary. 11. The method of claim 1, further comprising:
displaying a reorder control on an unordered summary of the summaries, that includes an option to activate a reordered status of the unordered summary; detecting a second action activating the reorder control; placing the unordered summary adjacent to the first summary during a default reorder time; and replacing a timestamp of a corresponding message on the unordered summary with the reorder time. 12. A computing device to restructure a view of messages based on configurable persistence, the computing device comprising:
a display device; a memory; a processor coupled to the memory and the display device, the processor executing a communication application in conjunction with instructions stored in the memory, wherein the communication application is configured to:
display, on the display device, summaries of the messages within a summary pane of a messaging user interface (UI), on the display device, wherein the messages include one of an email, a task, a note, or a scheduling of an item;
detect a first action to reorder a first summary from the summaries of the summary pane;
display, on the display device, one or more reorder options to identify a reorder time of the first summary, wherein the one or more reorder options include one or more default tie periods and a user configurable time period;
detect a selection of one of the reorder options as the reorder time;
display, on the display device, the first summary at a top location of a date section of the summary pane until an expiration of the selected duration for the reorder time; and
upon detecting the expiration of the selected duration for the reorder time, display, on the display device, the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 13. The computing device of claim 12, wherein the communication application is further configured to:
detect a second action to scroll through the summary pane to display future items above the first summary; and display the future items above the first summary on the summary pane during a reorder time associated with the future items. 14. The computing device of claim 13, wherein the communication application is further configured to:
display a deferred message as one of the future items above the first summary. 15. The computing device of claim 12, wherein the communication application is further configured to:
provide one or more configuration controls to allow an authorized user to configure the first action to include one or more of a swipe action, a touch action, a mouse click event, a hover event, and a keyboard action. 16. The computing device of claim 12, wherein the communication application is further configured to:
provide one or more configuration controls to allow an authorized user to configure a default reorder time, a highlight color, a background color, and an archive folder associated with operations to reorder the first summary. 17. The computing device of claim 12, wherein the communication application is further configured to:
place a future item in a top location of a date section associated with the future item above the first summary. 18. A computer-readable memory device with instructions stored thereon to restructure view of messages based on configurable persistence, the instructions comprising:
displaying summaries of the messages within a summary pane of a messaging user interface (UI), wherein the messages include one or more of an email, a text based message, an audio message, and a video message; detecting an action to reorder a first summary from the summaries to a top location of a date section of the summary pane; displaying one or more reorder options to identify a reorder time of the first summary; detecting a selection of one of the reorder options as the reorder time; displaying the first summary at the top location of the date section of the summary pane until an expiration of the selected duration for the reorder time; and upon detecting the expiration of the selected duration for the reorder time, displaying the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 19. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting the first action as a horizontal swipe action on the first summary; displaying the one or more reorder options within a menu that includes one or more of a today option, a tomorrow option, a next week option, at work option, at keyboard option, and a custom option; and displaying the menu at one from a set of: below the first summary and overlaid on the first summary. 20. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting a second action to scroll through the summary pane to display future items above the first summary; displaying future items above the first summary on the summary pane during a reorder time associated with the future items; and displaying one or more of an appointment, and a deferred message as the future items. | Restructuring a view of messages based on configurable persistence is provided. An application such as a communication application displays summaries of messages within a summary pane of a messaging user interface (UI). The messages include emails. An action is detected to reorder one of the summaries on a top location of a date section of the summary pane. Reorder options are displayed to identify a reorder time of the summary. A selection of one of the reorder options is detected as the reorder time. The summary is relocated to the top location of the date section of the summary pane to display the first summary at the top location of the date section during the reorder time.1. A method executed on a computing device to restructure a view of messages based on configurable persistence, the method comprising:
displaying summaries of the messages within a summary pane of a messaging user interface (UI); detecting a first action to reorder a first summary from the summaries to a particular location of a date section of the summary pane; displaying one or more reorder options to identify a reorder time of the first summary; detecting a selection of one of the reorder options as the reorder time; and displaying the first summary at the particular location of the date section of the summary pane until an expiration of the selected duration for the reorder time. 2. The method of claim 1, further comprising:
upon detecting the expiration of the selected duration for the reorder time, displaying the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 3. The method of claim 1, further comprising:
detecting the first action as a horizontal swipe action on the first summary. 4. The method of claim 1, further comprising:
displaying the one or more reorder options at one from a set of: below the first summary and overlaid on the first summary, wherein the one or more reorder options include one or more default tie periods and a user configurable time period. 5. The method of claim 1, further comprising:
reducing a horizontal length of the first summary to display a reduced first summary that provides reduced information of a corresponding message, wherein the particular section is a top location of the date section of the summary pane. 6. The method of claim 1, further comprising:
displaying one or more of a sender identification, a receiver identification, a message subject, a single line summary of a message content, and a timestamp for each of the summaries on the summary pane. 7. The method of claim 6, further comprising:
replacing the timestamp of a corresponding message with the reorder time on the first summary. 8. The method of claim 1, further comprising:
placing new summaries for incoming messages below the first summary. 9. The method of claim 1, further comprising:
in response to the expiration of the selected duration for the reorder time,
displaying a current time as a timestamp on the first summary, and
allowing new summaries of incoming messages to be placed above the first summary. 10. The method of claim 1, further comprising:
displaying a reorder control on the first summary that includes an option to deactivate a reordered status of the first summary; detecting a second action deactivating the reorder control; displaying a current time as a timestamp on the first summary; and allowing new summaries of incoming messages to be placed above the first summary. 11. The method of claim 1, further comprising:
displaying a reorder control on an unordered summary of the summaries, that includes an option to activate a reordered status of the unordered summary; detecting a second action activating the reorder control; placing the unordered summary adjacent to the first summary during a default reorder time; and replacing a timestamp of a corresponding message on the unordered summary with the reorder time. 12. A computing device to restructure a view of messages based on configurable persistence, the computing device comprising:
a display device; a memory; a processor coupled to the memory and the display device, the processor executing a communication application in conjunction with instructions stored in the memory, wherein the communication application is configured to:
display, on the display device, summaries of the messages within a summary pane of a messaging user interface (UI), on the display device, wherein the messages include one of an email, a task, a note, or a scheduling of an item;
detect a first action to reorder a first summary from the summaries of the summary pane;
display, on the display device, one or more reorder options to identify a reorder time of the first summary, wherein the one or more reorder options include one or more default tie periods and a user configurable time period;
detect a selection of one of the reorder options as the reorder time;
display, on the display device, the first summary at a top location of a date section of the summary pane until an expiration of the selected duration for the reorder time; and
upon detecting the expiration of the selected duration for the reorder time, display, on the display device, the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 13. The computing device of claim 12, wherein the communication application is further configured to:
detect a second action to scroll through the summary pane to display future items above the first summary; and display the future items above the first summary on the summary pane during a reorder time associated with the future items. 14. The computing device of claim 13, wherein the communication application is further configured to:
display a deferred message as one of the future items above the first summary. 15. The computing device of claim 12, wherein the communication application is further configured to:
provide one or more configuration controls to allow an authorized user to configure the first action to include one or more of a swipe action, a touch action, a mouse click event, a hover event, and a keyboard action. 16. The computing device of claim 12, wherein the communication application is further configured to:
provide one or more configuration controls to allow an authorized user to configure a default reorder time, a highlight color, a background color, and an archive folder associated with operations to reorder the first summary. 17. The computing device of claim 12, wherein the communication application is further configured to:
place a future item in a top location of a date section associated with the future item above the first summary. 18. A computer-readable memory device with instructions stored thereon to restructure view of messages based on configurable persistence, the instructions comprising:
displaying summaries of the messages within a summary pane of a messaging user interface (UI), wherein the messages include one or more of an email, a text based message, an audio message, and a video message; detecting an action to reorder a first summary from the summaries to a top location of a date section of the summary pane; displaying one or more reorder options to identify a reorder time of the first summary; detecting a selection of one of the reorder options as the reorder time; displaying the first summary at the top location of the date section of the summary pane until an expiration of the selected duration for the reorder time; and upon detecting the expiration of the selected duration for the reorder time, displaying the first summary at an expiration location on the summary pane that corresponds to timestamp at an expiration of the reorder time. 19. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting the first action as a horizontal swipe action on the first summary; displaying the one or more reorder options within a menu that includes one or more of a today option, a tomorrow option, a next week option, at work option, at keyboard option, and a custom option; and displaying the menu at one from a set of: below the first summary and overlaid on the first summary. 20. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting a second action to scroll through the summary pane to display future items above the first summary; displaying future items above the first summary on the summary pane during a reorder time associated with the future items; and displaying one or more of an appointment, and a deferred message as the future items. | 2,100 |
5,262 | 15,417,362 | 2,159 | A system functions to recommend equipment expansions, additions and/or substitutions; interconnections; supplemental capabilities; features; etc. based upon a knowledge of a consumer's existing audio and/or visual system configuration. | 1. A system for checking appliance compatibility, comprising:
a smart device having a product recommendation application and a universal remote control application resident thereon; and a server device having an associated data repository in which is maintained for each of a plurality of appliances an appliance record comprising one or more features for the corresponding appliance; wherein the product recommendation application resident on the smart device includes programming for causing the smart device to provide to the server device a first information, wherein the first information functions to identify a first appliance being considered for integration into a system which includes a second appliance that is currently controllable via use of the remote control application resident on the smart device, for obtaining from the universal remote control application resident on the smart device second information wherein the second information functions to identify the second appliance, and for causing the smart device to provide to the server device the second information; and wherein the server device includes programming for causing the first information to be used to extract from the data repository one or more features for an appliance corresponding to the first information, for causing the second information to be used to extract from the data repository one or more features for an appliance corresponding to the second information, for determining if the one or more features for the appliance corresponding to the first information as extracted from the data repository and the one or more features of the appliance corresponding to the second information as extracted from the data repository indicate that the appliance corresponding to the first information is compatible for integration into the system which includes the appliance corresponding to the second information, and for providing to the product recommendation application a result of the determination for presentation to a user via use of the smart device. 2. The system as recited in claim 1, wherein the programming of the server functions to determine compatibility by at least verifying that a sufficient number of suitable connections and input/output ports are available to allow integration of the appliance corresponding to the first information into the system which includes the appliance corresponding to the second information. 3. The system as recited in claim 1, wherein the result of the determination includes a summary of one or more features considered by the programming of the server when determining compatibility. 4. The system as recited in claim 1, wherein the result of the determination includes an option for the display of additional information screens containing recommended interconnection schemes for integrating the first appliance into the system. 5. The system as recited in claim 1, wherein the result of the determination includes an option for posting to a social networking site information representative of the first appliance for receiving feedback from others. 6. The system as recited in claim 1, wherein the result of the determination obtained via use of the compatibility check algorithm includes an option to locate a merchant offering the appliance corresponding to the first information. | A system functions to recommend equipment expansions, additions and/or substitutions; interconnections; supplemental capabilities; features; etc. based upon a knowledge of a consumer's existing audio and/or visual system configuration.1. A system for checking appliance compatibility, comprising:
a smart device having a product recommendation application and a universal remote control application resident thereon; and a server device having an associated data repository in which is maintained for each of a plurality of appliances an appliance record comprising one or more features for the corresponding appliance; wherein the product recommendation application resident on the smart device includes programming for causing the smart device to provide to the server device a first information, wherein the first information functions to identify a first appliance being considered for integration into a system which includes a second appliance that is currently controllable via use of the remote control application resident on the smart device, for obtaining from the universal remote control application resident on the smart device second information wherein the second information functions to identify the second appliance, and for causing the smart device to provide to the server device the second information; and wherein the server device includes programming for causing the first information to be used to extract from the data repository one or more features for an appliance corresponding to the first information, for causing the second information to be used to extract from the data repository one or more features for an appliance corresponding to the second information, for determining if the one or more features for the appliance corresponding to the first information as extracted from the data repository and the one or more features of the appliance corresponding to the second information as extracted from the data repository indicate that the appliance corresponding to the first information is compatible for integration into the system which includes the appliance corresponding to the second information, and for providing to the product recommendation application a result of the determination for presentation to a user via use of the smart device. 2. The system as recited in claim 1, wherein the programming of the server functions to determine compatibility by at least verifying that a sufficient number of suitable connections and input/output ports are available to allow integration of the appliance corresponding to the first information into the system which includes the appliance corresponding to the second information. 3. The system as recited in claim 1, wherein the result of the determination includes a summary of one or more features considered by the programming of the server when determining compatibility. 4. The system as recited in claim 1, wherein the result of the determination includes an option for the display of additional information screens containing recommended interconnection schemes for integrating the first appliance into the system. 5. The system as recited in claim 1, wherein the result of the determination includes an option for posting to a social networking site information representative of the first appliance for receiving feedback from others. 6. The system as recited in claim 1, wherein the result of the determination obtained via use of the compatibility check algorithm includes an option to locate a merchant offering the appliance corresponding to the first information. | 2,100 |
5,263 | 13,962,725 | 2,158 | A query of spatial data is received by a database comprising a columnar data store storing data in a column-oriented structure. Thereafter, a spatial data set is mapped to physical storage in the database using a space-filling curve. The spatial data set is then compacted and such compacted data can be used to retrieve data from the database that is responsive to the query. Related apparatus, systems, techniques and articles are also described. | 1. A method comprising:
receiving, by a database comprising a columnar data store storing data in a column-oriented structure, a query of spatial data; mapping, by at least one data processor, a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve; compacting, by at least one data processor, the spatial data set; and retrieving, by at least one data processor, data from the database responsive to the query using the compacted spatial data set. 2. A method as in claim 1, wherein the space-filling curve comprises a Hilbert curve. 3. A method as in claim 2, wherein the mapping comprises:
transforming, by at least one data processor, points in the spatial data set into a positive coordinate space; and defining, by at least one data processor, a quadrant based on boundaries of the transformed points. 4. A method as in claim 3, wherein the mapping further comprises:
determining, by at least one data processor, a Hilbert order for the quadrant. 5. A method as in claim 4, wherein the determined Hilbert order provides that each point in the spatial data set has a different Hilbert distance based on spatial proximity. 6. A method as in claim 5, wherein the mapping further comprises:
sorting, by at least one data processor, the points in the spatial data set according to their Hilbert distance. 7. A method as in claim 6, wherein the mapping further comprises:
generating, by at least one data processor, a data dictionary and a corresponding bit compressed vector for each axis of the spatial data set. 8. A method as in claim 2, wherein the spatial data set is compressed so that no two points in the spatial data set have a same Hilbert distance. 9. A method as in claim 8, wherein the spatial data set is compressed so that there are no gaps between distances of points in the spatial data set. 10. A method as in claim 1, wherein the space-filling curve comprises a Z-curve or a Moore curve. 11. A non-transitory computer program product storing instructions which, when executed by at data processor of at least one computing system, result in operations comprising:
receiving, by a database comprising a columnar data store storing data in a column-oriented structure, a query of spatial data; mapping a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve; compacting the spatial data set; and retrieving data from the database responsive to the query using the compacted spatial data set. 12. A computer program product as in claim 11, wherein the space-filling curve comprises a Hilbert curve. 13. A computer program product as in claim 12, wherein the mapping comprises:
transforming points in the spatial data set into a positive coordinate space; and defining a quadrant based on boundaries of the transformed points. 14. A computer program product as in claim 13, wherein the mapping further comprises:
determining a Hilbert order for the quadrant. 15. A computer program product as in claim 14, wherein the determined Hilbert order provides that each point in the spatial data set has a different Hilbert distance based on spatial proximity. 16. A computer program product as in claim 15, wherein the mapping further comprises:
sorting the points in the spatial data set according to their Hilbert distance. 17. A computer program product as in claim 16, wherein the mapping further comprises:
generating a data dictionary and a corresponding bit compressed vector for each axis of the spatial data set. 18. A computer program product as in claim 12, wherein the spatial data set is compressed so that no two points in the spatial data set have a same Hilbert distance; and wherein the spatial data set is compressed so that there are no gaps between distances of points in the spatial data set. 19. A computer program product as in claim 11, wherein the space-filling curve comprises a Z-curve or a Moore curve. 20. A system comprising:
at least one data processor; and a database comprising a columnar data store storing data in a column-oriented structure; wherein the database:
receives a query of spatial data;
maps a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve;
compacts the spatial data set; and
retrieves data from the database responsive to the query using the compacted spatial data set. | A query of spatial data is received by a database comprising a columnar data store storing data in a column-oriented structure. Thereafter, a spatial data set is mapped to physical storage in the database using a space-filling curve. The spatial data set is then compacted and such compacted data can be used to retrieve data from the database that is responsive to the query. Related apparatus, systems, techniques and articles are also described.1. A method comprising:
receiving, by a database comprising a columnar data store storing data in a column-oriented structure, a query of spatial data; mapping, by at least one data processor, a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve; compacting, by at least one data processor, the spatial data set; and retrieving, by at least one data processor, data from the database responsive to the query using the compacted spatial data set. 2. A method as in claim 1, wherein the space-filling curve comprises a Hilbert curve. 3. A method as in claim 2, wherein the mapping comprises:
transforming, by at least one data processor, points in the spatial data set into a positive coordinate space; and defining, by at least one data processor, a quadrant based on boundaries of the transformed points. 4. A method as in claim 3, wherein the mapping further comprises:
determining, by at least one data processor, a Hilbert order for the quadrant. 5. A method as in claim 4, wherein the determined Hilbert order provides that each point in the spatial data set has a different Hilbert distance based on spatial proximity. 6. A method as in claim 5, wherein the mapping further comprises:
sorting, by at least one data processor, the points in the spatial data set according to their Hilbert distance. 7. A method as in claim 6, wherein the mapping further comprises:
generating, by at least one data processor, a data dictionary and a corresponding bit compressed vector for each axis of the spatial data set. 8. A method as in claim 2, wherein the spatial data set is compressed so that no two points in the spatial data set have a same Hilbert distance. 9. A method as in claim 8, wherein the spatial data set is compressed so that there are no gaps between distances of points in the spatial data set. 10. A method as in claim 1, wherein the space-filling curve comprises a Z-curve or a Moore curve. 11. A non-transitory computer program product storing instructions which, when executed by at data processor of at least one computing system, result in operations comprising:
receiving, by a database comprising a columnar data store storing data in a column-oriented structure, a query of spatial data; mapping a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve; compacting the spatial data set; and retrieving data from the database responsive to the query using the compacted spatial data set. 12. A computer program product as in claim 11, wherein the space-filling curve comprises a Hilbert curve. 13. A computer program product as in claim 12, wherein the mapping comprises:
transforming points in the spatial data set into a positive coordinate space; and defining a quadrant based on boundaries of the transformed points. 14. A computer program product as in claim 13, wherein the mapping further comprises:
determining a Hilbert order for the quadrant. 15. A computer program product as in claim 14, wherein the determined Hilbert order provides that each point in the spatial data set has a different Hilbert distance based on spatial proximity. 16. A computer program product as in claim 15, wherein the mapping further comprises:
sorting the points in the spatial data set according to their Hilbert distance. 17. A computer program product as in claim 16, wherein the mapping further comprises:
generating a data dictionary and a corresponding bit compressed vector for each axis of the spatial data set. 18. A computer program product as in claim 12, wherein the spatial data set is compressed so that no two points in the spatial data set have a same Hilbert distance; and wherein the spatial data set is compressed so that there are no gaps between distances of points in the spatial data set. 19. A computer program product as in claim 11, wherein the space-filling curve comprises a Z-curve or a Moore curve. 20. A system comprising:
at least one data processor; and a database comprising a columnar data store storing data in a column-oriented structure; wherein the database:
receives a query of spatial data;
maps a spatial data set corresponding to the received query to physical storage in the database using a space-filling curve;
compacts the spatial data set; and
retrieves data from the database responsive to the query using the compacted spatial data set. | 2,100 |
5,264 | 14,266,531 | 2,152 | In one implementation, a system for data reconstruction includes a data model engine to generate a data model and receive a plurality of different data types to include within the data model. In addition, the system includes a shortcut engine to define shortcut types. In addition, the system includes a categorization engine to identify a shortcut within the data model and categorize the identified shortcut into the defined shortcut types. In addition, the system includes an intermediary engine to determine unknown intermediaries of the identified shortcut based on the received plurality of different data types. | 1. A system for data reconstruction, comprising:
a data model engine to generate a data model and receive a plurality of different data types to include within the data model; a shortcut engine to define shortcut types; a categorization engine to identify a shortcut within the data model and categorize the identified shortcut into the defined shortcut types; and an intermediary engine to determine unknown intermediaries of the identified shortcut based on the received plurality of different data types. 2. The system of claim 1, wherein the data model includes a canonical model that is capable of storing the plurality of different data types. 3. The system of claim 2, wherein at least one of the plurality of different data types includes information relating to the shortcut. 4. The system of claim 1, wherein the shortcut engine is configured to define the shortcut types by defining shortcut types within a configuration file of the system. 5. The system of claim 1, wherein the shortcut includes a shortcut that utilizes a plurality of applications. 6. The system of claim 5, wherein the intermediary engine is configured to determine the plurality of applications and generate canonical model that includes the plurality of applications. 7. The system of claim 1, wherein the intermediary engine is configured to calculate a compliment for the shortcut based on the received plurality of different data types. 8. A non-transitory computer readable medium storing instructions executable by a processing resource to cause a controller to:
replace a canonical model with a data model that includes a plurality of different data types; identify data that is non-canonical model data types from the plurality of different data types; identify a shortcut within the data model and categorize the identified shortcut into defined shortcut types; and determine unknown intermediaries of the identified shortcut based on the non-canonical model data. 9. The medium of claim 8, wherein the unknown intermediaries include unknown applications that are executed via a corresponding shortcut. 10. The medium of claim 8, comprising instructions to add information relating to the determined unknown intermediaries to the data model. 11. The medium of claim 10, wherein the added information is added in a canonical model data type. 12. A method for data reconstruction, comprising:
replacing a canonical model with a data model that includes a plurality of canonical model data types and a plurality of non-canonical model data types; assigning an identification mark to the plurality of non-canonical model data types; identifying a shortcut within the data model; categorizing the identified shortcut into a defined shortcut type; and determining unknown intermediaries of the identified shortcut based on the non-canonical model data. 13. The method of claim 12, wherein the identification mark distinguishes the plurality of canonical model data types from the non-canonical model data types. 14. The method of claim 12, wherein the plurality of canonical model data types are organized via a canonical model. 15. The method of claim 14, wherein the determined unknown intermediaries are utilized to generate canonical model data types that include information that relates to the determined unknown intermediaries. | In one implementation, a system for data reconstruction includes a data model engine to generate a data model and receive a plurality of different data types to include within the data model. In addition, the system includes a shortcut engine to define shortcut types. In addition, the system includes a categorization engine to identify a shortcut within the data model and categorize the identified shortcut into the defined shortcut types. In addition, the system includes an intermediary engine to determine unknown intermediaries of the identified shortcut based on the received plurality of different data types.1. A system for data reconstruction, comprising:
a data model engine to generate a data model and receive a plurality of different data types to include within the data model; a shortcut engine to define shortcut types; a categorization engine to identify a shortcut within the data model and categorize the identified shortcut into the defined shortcut types; and an intermediary engine to determine unknown intermediaries of the identified shortcut based on the received plurality of different data types. 2. The system of claim 1, wherein the data model includes a canonical model that is capable of storing the plurality of different data types. 3. The system of claim 2, wherein at least one of the plurality of different data types includes information relating to the shortcut. 4. The system of claim 1, wherein the shortcut engine is configured to define the shortcut types by defining shortcut types within a configuration file of the system. 5. The system of claim 1, wherein the shortcut includes a shortcut that utilizes a plurality of applications. 6. The system of claim 5, wherein the intermediary engine is configured to determine the plurality of applications and generate canonical model that includes the plurality of applications. 7. The system of claim 1, wherein the intermediary engine is configured to calculate a compliment for the shortcut based on the received plurality of different data types. 8. A non-transitory computer readable medium storing instructions executable by a processing resource to cause a controller to:
replace a canonical model with a data model that includes a plurality of different data types; identify data that is non-canonical model data types from the plurality of different data types; identify a shortcut within the data model and categorize the identified shortcut into defined shortcut types; and determine unknown intermediaries of the identified shortcut based on the non-canonical model data. 9. The medium of claim 8, wherein the unknown intermediaries include unknown applications that are executed via a corresponding shortcut. 10. The medium of claim 8, comprising instructions to add information relating to the determined unknown intermediaries to the data model. 11. The medium of claim 10, wherein the added information is added in a canonical model data type. 12. A method for data reconstruction, comprising:
replacing a canonical model with a data model that includes a plurality of canonical model data types and a plurality of non-canonical model data types; assigning an identification mark to the plurality of non-canonical model data types; identifying a shortcut within the data model; categorizing the identified shortcut into a defined shortcut type; and determining unknown intermediaries of the identified shortcut based on the non-canonical model data. 13. The method of claim 12, wherein the identification mark distinguishes the plurality of canonical model data types from the non-canonical model data types. 14. The method of claim 12, wherein the plurality of canonical model data types are organized via a canonical model. 15. The method of claim 14, wherein the determined unknown intermediaries are utilized to generate canonical model data types that include information that relates to the determined unknown intermediaries. | 2,100 |
5,265 | 14,826,972 | 2,128 | A non-transitory computer-readable file is disclosed. In some embodiments, the file may include a digital representation of an electronic device, the digital representation having an ornamental design as shown in solid lines in FIGS. 1 - 9. | 1. A non-transitory computer-readable file that when executed produces a digital representation of an article as shown in solid lines in at least one of FIGS. 1-9. 2. The non-transitory computer-readable file of claim 1, wherein when executed the computer-readable file produces a digital representation of an article as shown in solid lines in all of FIGS. 1-9. 3. The non-transitory computer-readable file of claim 1, wherein when executed the computer-readable file produces a three-dimensional digital representation of an article as shown in solid lines in FIGS. 1-9. 4. A non-transitory computer-readable file comprising a digital representation of an electronic device, the digital representation having an ornamental design as shown in solid lines in FIGS. 1-9. 5. A non-transitory computer-readable medium comprising the non-transitory computer-readable file of claim 4. 6. The non-transitory computer-readable file of claim 4, wherein the digital representation has a substantially similar overall appearance to the ornamental design as shown in solid lines in FIGS. 1-9. 7. The non-transitory computer-readable file of claim 4, wherein the digital representation is a three-dimensional representation. 8. The non-transitory computer-readable file of claim 4, wherein the digital representation is a three-dimensional digital reproduction having a substantially similar overall appearance to the ornamental design as shown in solid lines in FIGS. 1-9. | A non-transitory computer-readable file is disclosed. In some embodiments, the file may include a digital representation of an electronic device, the digital representation having an ornamental design as shown in solid lines in FIGS. 1 - 9.1. A non-transitory computer-readable file that when executed produces a digital representation of an article as shown in solid lines in at least one of FIGS. 1-9. 2. The non-transitory computer-readable file of claim 1, wherein when executed the computer-readable file produces a digital representation of an article as shown in solid lines in all of FIGS. 1-9. 3. The non-transitory computer-readable file of claim 1, wherein when executed the computer-readable file produces a three-dimensional digital representation of an article as shown in solid lines in FIGS. 1-9. 4. A non-transitory computer-readable file comprising a digital representation of an electronic device, the digital representation having an ornamental design as shown in solid lines in FIGS. 1-9. 5. A non-transitory computer-readable medium comprising the non-transitory computer-readable file of claim 4. 6. The non-transitory computer-readable file of claim 4, wherein the digital representation has a substantially similar overall appearance to the ornamental design as shown in solid lines in FIGS. 1-9. 7. The non-transitory computer-readable file of claim 4, wherein the digital representation is a three-dimensional representation. 8. The non-transitory computer-readable file of claim 4, wherein the digital representation is a three-dimensional digital reproduction having a substantially similar overall appearance to the ornamental design as shown in solid lines in FIGS. 1-9. | 2,100 |
5,266 | 12,854,082 | 2,175 | A cross-pollination subsystem is provided within a Social-Topical Adaptive Networking (STAN) system. The cross-pollination subsystem cooperatively interacts with external platforms to bring fresh cross-pollination data to topic nodes or on-topic Notes Exchange rings (TCONE's) of the STAN system. Users are provided with an interface that allows them to browse through the cross-pollinated topic space to thereby connect with online content sources that are likely to correspond to topics of interest currently on the minds of the STAN system users. | 1. A cross-pollination urging method for use with a Social-Topical Adaptive Networking (STAN) system and with external platform systems, where the STAN system maintains a topic space populated by unique topic nodes each having topic defining data logically linked thereto, the method comprising:
instantiating a software agent (e.g., BOT) that is structured to convey potentially new or different, and thus potentially cross-pollinating data signals to the STAN system; causing the instantiated software agent to begin collecting from the one or more external platform systems, potentially new or different, and thus potentially cross-pollinating data; and causing the instantiated software agent to begin conveying collected potentially new or different, and thus potentially cross-pollinating data as corresponding data signals to the STAN system. 2. A machine-implemented, user interface structured to provide a corresponding user with content source recommendations corresponding to topics of interest that are probably currently on the user's mind, said interface comprising:
(a) a content source recommendation presenting mechanism that can present one or more recommendation-representing objects to the user that are user-activatable and which, when activated by the user will connect the user virtually to corresponding on-topic content, where the recommendation-representing objects indicate at least one of:
(a.1) the topic of the content source that is being recommended by the object,
(a.2) the platform from which the on-topic content of the object is being obtained;
(a.3) a topic center to which the on-topic content of the object is logically linked;
(a.4) one or more persons to which the on-topic content of the object is logically linked;
(a.5) one or more membership groups to which the on-topic content of the object is logically linked;
(a.6) a current temperature of an attribute of the object;
(a.7) a Notes Exchange type that the on-topic content of the object has; and
(a.8) a launchable search BOT that can be launched from a topic node to which the on-topic content of the object is logically linked. 3. The machine-implemented, user interface of claim 2 wherein the launchable search BOT launches from a node in a cross-pollinated topic space of a Social-Topical Adaptive Networking (STAN) system with which said user interface interfaces. 4. The machine-implemented, user interface of claim 2 wherein the topic center indicating object is user activatable and when activated provides the user with a browsing view of a corresponding neighborhood of a corresponding topic center in a cross-pollinated topic space of a Social-Topical Adaptive Networking (STAN) system with which said user interface interfaces. 5. A machine-assisted process of obtaining one or more answers to questions of potentially esoteric nature, the method comprising:
(a) submitting a question to a STAN—2 system question processing program; (b) interacting with the question processing program so as to converge on one or more topic centers in STAN—2 topic space whose respective topic or topics are well connected with a topic intended by the posed question; (c) receiving from the system question processing program a list of Tipping Point Mavens or other consensus-wise elected experts who are logically linked to the converged upon one or more topic centers and whose works of expertise match one or more of keywords, tags and/or URLs associated with the posed question; (d) picking a subset of the listed experts; and (e) automatically forwarding the posed question to the selected subset of experts. | A cross-pollination subsystem is provided within a Social-Topical Adaptive Networking (STAN) system. The cross-pollination subsystem cooperatively interacts with external platforms to bring fresh cross-pollination data to topic nodes or on-topic Notes Exchange rings (TCONE's) of the STAN system. Users are provided with an interface that allows them to browse through the cross-pollinated topic space to thereby connect with online content sources that are likely to correspond to topics of interest currently on the minds of the STAN system users.1. A cross-pollination urging method for use with a Social-Topical Adaptive Networking (STAN) system and with external platform systems, where the STAN system maintains a topic space populated by unique topic nodes each having topic defining data logically linked thereto, the method comprising:
instantiating a software agent (e.g., BOT) that is structured to convey potentially new or different, and thus potentially cross-pollinating data signals to the STAN system; causing the instantiated software agent to begin collecting from the one or more external platform systems, potentially new or different, and thus potentially cross-pollinating data; and causing the instantiated software agent to begin conveying collected potentially new or different, and thus potentially cross-pollinating data as corresponding data signals to the STAN system. 2. A machine-implemented, user interface structured to provide a corresponding user with content source recommendations corresponding to topics of interest that are probably currently on the user's mind, said interface comprising:
(a) a content source recommendation presenting mechanism that can present one or more recommendation-representing objects to the user that are user-activatable and which, when activated by the user will connect the user virtually to corresponding on-topic content, where the recommendation-representing objects indicate at least one of:
(a.1) the topic of the content source that is being recommended by the object,
(a.2) the platform from which the on-topic content of the object is being obtained;
(a.3) a topic center to which the on-topic content of the object is logically linked;
(a.4) one or more persons to which the on-topic content of the object is logically linked;
(a.5) one or more membership groups to which the on-topic content of the object is logically linked;
(a.6) a current temperature of an attribute of the object;
(a.7) a Notes Exchange type that the on-topic content of the object has; and
(a.8) a launchable search BOT that can be launched from a topic node to which the on-topic content of the object is logically linked. 3. The machine-implemented, user interface of claim 2 wherein the launchable search BOT launches from a node in a cross-pollinated topic space of a Social-Topical Adaptive Networking (STAN) system with which said user interface interfaces. 4. The machine-implemented, user interface of claim 2 wherein the topic center indicating object is user activatable and when activated provides the user with a browsing view of a corresponding neighborhood of a corresponding topic center in a cross-pollinated topic space of a Social-Topical Adaptive Networking (STAN) system with which said user interface interfaces. 5. A machine-assisted process of obtaining one or more answers to questions of potentially esoteric nature, the method comprising:
(a) submitting a question to a STAN—2 system question processing program; (b) interacting with the question processing program so as to converge on one or more topic centers in STAN—2 topic space whose respective topic or topics are well connected with a topic intended by the posed question; (c) receiving from the system question processing program a list of Tipping Point Mavens or other consensus-wise elected experts who are logically linked to the converged upon one or more topic centers and whose works of expertise match one or more of keywords, tags and/or URLs associated with the posed question; (d) picking a subset of the listed experts; and (e) automatically forwarding the posed question to the selected subset of experts. | 2,100 |
5,267 | 15,252,615 | 2,199 | A method may include performing stack trace sampling to obtain a compiled list of transactions performed by a software application during a preconfigured timeframe, filtering the compiled list of transactions according to a set of filtering parameters to obtain a set of transactions instances that complies with the set of filtering parameters, and finding a set of non-instrumented methods within the set of transactions instances that complies with the set of filtering parameters. The set of non-instrumented methods may exceed a percentage threshold of a total transaction time of transactions that the set of non-instrumented methods are a part of and the percentage threshold may be user-configurable. The method may further include adding a set of instrumentation points into a points file, the set of instrumentation points associated with the set of non-instrumented methods. | 1. A method performed by a computing device, the method comprising:
performing stack trace sampling to obtain a compiled list of transactions performed by a software application during a preconfigured timeframe; filtering the compiled list of transactions according to a set of filtering parameters to obtain a set of transaction instances that complies with the set of filtering parameters; finding a set of non-instrumented methods within the obtained set of transaction instances that exceeds a percentage threshold of a total transaction time of the transactions within which the set of non-instrumented methods are found, wherein the percentage threshold is user-configurable; and adding a set of instrumentation points associated with the found set of non-instrumented methods into a points file to instrument the found set of non-instrumented methods. 2. The method of claim 1, wherein the set of filtering parameters are configurable by a user or a computing program. 3. The method of claim 1, wherein filtering the compiled list of transactions comprises obtaining a set of transaction instances that exceeds a latency threshold. 4. The method of claim 3, wherein filtering the compiled list of transactions further comprises selecting a plurality of maximum latency transaction instances from the set of transaction instances that exceeds the latency threshold. 5. The method of claim 1, wherein filtering the compiled list of transactions comprises obtaining a set of transaction instances that exceeds a predetermined user-configurable static threshold. 6. The method of claim 1, wherein the set of non-instrumented methods that exceeds the percentage threshold of the total transaction time is comprised within 100% of the transaction instances that comply with the set of filtering parameters. 7. The method of claim 1, wherein finding a set of non-instrumented methods within the set of transaction instances comprises crossing-reference stack trace sampling method lists associated with each of the transaction instances from the set. 8. The method of claim 1, wherein the preconfigured timeframe is configurable by the user or a computing program within the system. 9. A computing device comprising:
a physical processor that executes machine readable instructions that cause the computing device to:
obtain a compiled list of transactions running in a software application during a timeframe by performing stack trace sampling;
filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a latency threshold within the timeframe, the filtered compiled list including non-instrumented methods of the transactions;
determine a set of non-instrumented methods from the filtered compiled list that exceeds a percentage threshold of the total transaction time of the transactions from which the non-instrumented methods are determined, wherein the percentage threshold is user-configurable; and
add a set of instrumentation points associated with the determined set of non-instrumented methods into a points file to instrument the determined set of non-instrumented methods. 10. The computing device of claim 9, wherein the physical processor executes machine readable instructions that cause the computing device to:
filter the compiled list of transactions by selecting a plurality of maximum latency transaction instances from the set of transaction instances that exceeds the latency threshold. 11. The computing device of claim 9, the physical processor executes machine readable instructions that cause the computing device to:
filter the compiled list of transactions by selecting all transactions that exceeded a predetermined static threshold, wherein the predetermined static threshold is more restrictive than the latency threshold. 12. The computing device of claim 11, wherein the predetermined static threshold and the preconfigured timeframe are determined by the user or a computing program running in the computing device. 13. The computing device of claim 9, wherein the set of non-instrumented methods that exceeds the percentage threshold of the total transaction time is comprised within 50% of the transaction instances from the filtered compiled list. 14. The computing device of claim 9, wherein the machine readable instructions that cause the computing device to determine a set of non-instrumented methods from the filtered compiled list further comprises machine readable instructions that cause the computing device to:
cross-reference stack trace sampling method lists associated with each of the transaction instances from the set. 15. A non-transitory machine-readable storage medium, encoded with machine-readable instructions executable by a physical processor that cause a computing device to:
perform stack trace sampling to select a compiled list of transactions running in a software application during a preconfigured timeframe; filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a predetermined static threshold preconfigured by a user, the filtered compiled list including non-instrumented methods; determine a set of non-instrumented methods from the filtered compiled list that exceeds a percentage threshold of the total transaction time of the transactions from which the non-instrumented methods are found, wherein the percentage threshold is user-configurable; and add a set of instrumentation points associated with the determined set of non-instrumented methods into a points file to instrument the determined set of non-instrumented methods. 16. The non-transitory machine-readable storage medium of claim 15, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a latency threshold within the timeframe, wherein the filtered compiled list using the latency threshold is in addition to the filtered compiled list using the predetermined static threshold. 17. The non-transitory machine-readable storage medium of claim 16, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
filter the compiled list of transactions by selecting a plurality of maximum latency transaction instances from the set of transactions that exceeds the latency threshold. 18. The non-transitory machine-readable storage medium of claim 17, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
determine the set of non-instrumented methods from the plurality of maximum latency transaction instances filtered from the set of transactions that exceeds the latency threshold. 19. The non-transitory machine-readable storage medium of claim 15, wherein the predetermined static threshold and the preconfigured timeframe are determined by a computing program running in the system. 20. The non-transitory machine-readable storage medium of claim 15, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
determine the set of non-instrumented methods from the filtered compiled list by crossing-reference stack trace sampling method lists associated with each of the transaction instances from the set of transaction instances. | A method may include performing stack trace sampling to obtain a compiled list of transactions performed by a software application during a preconfigured timeframe, filtering the compiled list of transactions according to a set of filtering parameters to obtain a set of transactions instances that complies with the set of filtering parameters, and finding a set of non-instrumented methods within the set of transactions instances that complies with the set of filtering parameters. The set of non-instrumented methods may exceed a percentage threshold of a total transaction time of transactions that the set of non-instrumented methods are a part of and the percentage threshold may be user-configurable. The method may further include adding a set of instrumentation points into a points file, the set of instrumentation points associated with the set of non-instrumented methods.1. A method performed by a computing device, the method comprising:
performing stack trace sampling to obtain a compiled list of transactions performed by a software application during a preconfigured timeframe; filtering the compiled list of transactions according to a set of filtering parameters to obtain a set of transaction instances that complies with the set of filtering parameters; finding a set of non-instrumented methods within the obtained set of transaction instances that exceeds a percentage threshold of a total transaction time of the transactions within which the set of non-instrumented methods are found, wherein the percentage threshold is user-configurable; and adding a set of instrumentation points associated with the found set of non-instrumented methods into a points file to instrument the found set of non-instrumented methods. 2. The method of claim 1, wherein the set of filtering parameters are configurable by a user or a computing program. 3. The method of claim 1, wherein filtering the compiled list of transactions comprises obtaining a set of transaction instances that exceeds a latency threshold. 4. The method of claim 3, wherein filtering the compiled list of transactions further comprises selecting a plurality of maximum latency transaction instances from the set of transaction instances that exceeds the latency threshold. 5. The method of claim 1, wherein filtering the compiled list of transactions comprises obtaining a set of transaction instances that exceeds a predetermined user-configurable static threshold. 6. The method of claim 1, wherein the set of non-instrumented methods that exceeds the percentage threshold of the total transaction time is comprised within 100% of the transaction instances that comply with the set of filtering parameters. 7. The method of claim 1, wherein finding a set of non-instrumented methods within the set of transaction instances comprises crossing-reference stack trace sampling method lists associated with each of the transaction instances from the set. 8. The method of claim 1, wherein the preconfigured timeframe is configurable by the user or a computing program within the system. 9. A computing device comprising:
a physical processor that executes machine readable instructions that cause the computing device to:
obtain a compiled list of transactions running in a software application during a timeframe by performing stack trace sampling;
filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a latency threshold within the timeframe, the filtered compiled list including non-instrumented methods of the transactions;
determine a set of non-instrumented methods from the filtered compiled list that exceeds a percentage threshold of the total transaction time of the transactions from which the non-instrumented methods are determined, wherein the percentage threshold is user-configurable; and
add a set of instrumentation points associated with the determined set of non-instrumented methods into a points file to instrument the determined set of non-instrumented methods. 10. The computing device of claim 9, wherein the physical processor executes machine readable instructions that cause the computing device to:
filter the compiled list of transactions by selecting a plurality of maximum latency transaction instances from the set of transaction instances that exceeds the latency threshold. 11. The computing device of claim 9, the physical processor executes machine readable instructions that cause the computing device to:
filter the compiled list of transactions by selecting all transactions that exceeded a predetermined static threshold, wherein the predetermined static threshold is more restrictive than the latency threshold. 12. The computing device of claim 11, wherein the predetermined static threshold and the preconfigured timeframe are determined by the user or a computing program running in the computing device. 13. The computing device of claim 9, wherein the set of non-instrumented methods that exceeds the percentage threshold of the total transaction time is comprised within 50% of the transaction instances from the filtered compiled list. 14. The computing device of claim 9, wherein the machine readable instructions that cause the computing device to determine a set of non-instrumented methods from the filtered compiled list further comprises machine readable instructions that cause the computing device to:
cross-reference stack trace sampling method lists associated with each of the transaction instances from the set. 15. A non-transitory machine-readable storage medium, encoded with machine-readable instructions executable by a physical processor that cause a computing device to:
perform stack trace sampling to select a compiled list of transactions running in a software application during a preconfigured timeframe; filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a predetermined static threshold preconfigured by a user, the filtered compiled list including non-instrumented methods; determine a set of non-instrumented methods from the filtered compiled list that exceeds a percentage threshold of the total transaction time of the transactions from which the non-instrumented methods are found, wherein the percentage threshold is user-configurable; and add a set of instrumentation points associated with the determined set of non-instrumented methods into a points file to instrument the determined set of non-instrumented methods. 16. The non-transitory machine-readable storage medium of claim 15, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
filter the compiled list of transactions by obtaining a set of transaction instances that exceeds a latency threshold within the timeframe, wherein the filtered compiled list using the latency threshold is in addition to the filtered compiled list using the predetermined static threshold. 17. The non-transitory machine-readable storage medium of claim 16, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
filter the compiled list of transactions by selecting a plurality of maximum latency transaction instances from the set of transactions that exceeds the latency threshold. 18. The non-transitory machine-readable storage medium of claim 17, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
determine the set of non-instrumented methods from the plurality of maximum latency transaction instances filtered from the set of transactions that exceeds the latency threshold. 19. The non-transitory machine-readable storage medium of claim 15, wherein the predetermined static threshold and the preconfigured timeframe are determined by a computing program running in the system. 20. The non-transitory machine-readable storage medium of claim 15, wherein the physical processor further executes machine-readable instructions that cause the physical processor to:
determine the set of non-instrumented methods from the filtered compiled list by crossing-reference stack trace sampling method lists associated with each of the transaction instances from the set of transaction instances. | 2,100 |
5,268 | 14,817,020 | 2,156 | One aspect of the invention includes a computer device. The computer device includes a network interface component configured to download media from an external source through a secure network connection. The computer device also includes a memory configured to store the downloaded content. The computer device further includes a media profiling engine configured to query the memory for the downloaded content based on the connection of the network interface component to the external source through the secure network connection and to generate a media profile log comprising information relevant to the downloaded content. | 1. A computer device comprising:
a network interface component configured to download content via a secure network connection; memory configured to store the downloaded content; and a media profiling engine configured to query the memory for the downloaded content based on the secure network connection and to generate a media profile log comprising information relevant to the downloaded content. 2. The device of claim 1, wherein the media profiling engine is configured to detect one of creation or storage of a content file corresponding to the downloaded content while the network interface component is retrieving the downloaded content from an external source via the secure network connection. 3. The device of claim 2, further comprising a file creation monitor configured to provide a trigger to the media profiling engine responsive to the one of creation or storage of the content file, the media profiling engine being further configured to ascertain that the content file corresponds to the downloaded content in response to the trigger during the connection of the network interface component to the external source via the secure network connection. 4. The device of claim 1, wherein the media profiling engine further comprises a file query engine configured to search the memory for the downloaded content according to at least one search condition pertaining to the secure network connection used to access the downloaded content. 5. The device of claim 4, wherein the at least one search condition comprises a file creation time stamp indicative of a time when the downloaded content was retrieved, the file query engine being further configured to search the memory for files having a file creation time that approximates the file creation time stamp. 6. The device of claim 5, wherein the media profiling engine further comprises a secured connection monitor configured to detect a start time and an end time of the connection of the network interface component to an external source via the secure network connection. 7. The device of claim 1, wherein the network interface component is configured to provide secure connection data indicative of a time of the connection of the network interface component to an external source via the secure network connection, the secure connection data being generated at at least one of an OS abstraction layer and a network driver of the network interface component. 8. The device of claim 1, wherein the media profiling engine is configured as one of a media profiling daemon resident on the computer device and at least a portion of a local proxy server. 9. The device of claim 1, wherein the media profile log comprises information identifying at least one of a file name, a file extension, a file size, a location of an external source from which the downloaded content is retrieved, and a file creation time stamp for the downloaded content. 10. The device of claim 1, wherein the media profiling engine is further configured to periodically scan the downloaded media for access times associated with the downloaded media and to update access times associated with the downloaded media in the media profile log. 11. A portable electronic device comprising the computer device of claim 1, the network interface component employing a wireless network connection for retrieving the downloaded content. 12. A portable electronic device comprising:
a transceiver configured to transmit and receive wireless signals via an antenna; a network interface component configured to wirelessly communicate data to and from an external source through a secure network connection via the transceiver; memory configured to store a content file corresponding to the downloaded content; and a media profiling engine configured to query the memory for the content file based on a file creation time of the content file stored in the memory relative to a time of a connection of the network interface component to the external source via the secure network connection, the media profiling engine updating a media profile log with information relating to the content file stored in the memory. 13. The portable electronic device of claim 12, further comprising a file creation engine configured to provide a trigger to the media profiling engine responsive to creation of the content file, the media profiling engine being further configured to associate the content file as corresponding to the downloaded content based on receiving the trigger during the connection of the network interface component to the external source through the secure network connection. 14. The portable electronic device of claim 12, wherein the media profiling engine comprises a file query engine that is configured to search the memory for a content file having a file creation time stamp of the content file that approximates a time that the network interface component is connected to the external source via the secure network connection. 15. The portable electronic device of claim 12, wherein the network interface component is configured to provide secured connection data that identifies a time when the network interface component is connected to the external source via the secure network connection, the secured connection data being provided by at least one of an OS abstraction layer and a network driver of the network interface component. 16. A method for generating a media profile on a computer device, the method comprising:
establishing a secure network connection between the computer device and an external source associated with at least one of a purchase and retrieval of media content; downloading the media content purchased from the external source and storing the media content as a media file in local memory of the computer device; querying the memory for the media file based on at least one condition associated with the secure network connection of the computer device and the external source; and updating a media profile log in the computer device with information relevant to the media content purchased from the external source. 17. The method of claim 16, wherein querying the memory comprises detecting creation of the media file in response to a trigger signal during the connection of the computer device with the external source through the secure network connection. 18. The method of claim 16, wherein querying the memory comprises querying the memory for a file creation time of the media file relative to a time of the connection of the computer device with the external source via the secure network connection. 19. The method of claim 18, further comprising generating secured connection data comprising the time of the secure network connection associated with the purchase of the media content from at least one of a TCP/IP layer, an OS abstraction layer, and a network driver. 20. The method of claim 18, wherein updating the media profile log further comprises appending at least two of a file name, a file extension, a file size, an IP address of the external source, and a file creation time stamp of the media file to the media profile log. | One aspect of the invention includes a computer device. The computer device includes a network interface component configured to download media from an external source through a secure network connection. The computer device also includes a memory configured to store the downloaded content. The computer device further includes a media profiling engine configured to query the memory for the downloaded content based on the connection of the network interface component to the external source through the secure network connection and to generate a media profile log comprising information relevant to the downloaded content.1. A computer device comprising:
a network interface component configured to download content via a secure network connection; memory configured to store the downloaded content; and a media profiling engine configured to query the memory for the downloaded content based on the secure network connection and to generate a media profile log comprising information relevant to the downloaded content. 2. The device of claim 1, wherein the media profiling engine is configured to detect one of creation or storage of a content file corresponding to the downloaded content while the network interface component is retrieving the downloaded content from an external source via the secure network connection. 3. The device of claim 2, further comprising a file creation monitor configured to provide a trigger to the media profiling engine responsive to the one of creation or storage of the content file, the media profiling engine being further configured to ascertain that the content file corresponds to the downloaded content in response to the trigger during the connection of the network interface component to the external source via the secure network connection. 4. The device of claim 1, wherein the media profiling engine further comprises a file query engine configured to search the memory for the downloaded content according to at least one search condition pertaining to the secure network connection used to access the downloaded content. 5. The device of claim 4, wherein the at least one search condition comprises a file creation time stamp indicative of a time when the downloaded content was retrieved, the file query engine being further configured to search the memory for files having a file creation time that approximates the file creation time stamp. 6. The device of claim 5, wherein the media profiling engine further comprises a secured connection monitor configured to detect a start time and an end time of the connection of the network interface component to an external source via the secure network connection. 7. The device of claim 1, wherein the network interface component is configured to provide secure connection data indicative of a time of the connection of the network interface component to an external source via the secure network connection, the secure connection data being generated at at least one of an OS abstraction layer and a network driver of the network interface component. 8. The device of claim 1, wherein the media profiling engine is configured as one of a media profiling daemon resident on the computer device and at least a portion of a local proxy server. 9. The device of claim 1, wherein the media profile log comprises information identifying at least one of a file name, a file extension, a file size, a location of an external source from which the downloaded content is retrieved, and a file creation time stamp for the downloaded content. 10. The device of claim 1, wherein the media profiling engine is further configured to periodically scan the downloaded media for access times associated with the downloaded media and to update access times associated with the downloaded media in the media profile log. 11. A portable electronic device comprising the computer device of claim 1, the network interface component employing a wireless network connection for retrieving the downloaded content. 12. A portable electronic device comprising:
a transceiver configured to transmit and receive wireless signals via an antenna; a network interface component configured to wirelessly communicate data to and from an external source through a secure network connection via the transceiver; memory configured to store a content file corresponding to the downloaded content; and a media profiling engine configured to query the memory for the content file based on a file creation time of the content file stored in the memory relative to a time of a connection of the network interface component to the external source via the secure network connection, the media profiling engine updating a media profile log with information relating to the content file stored in the memory. 13. The portable electronic device of claim 12, further comprising a file creation engine configured to provide a trigger to the media profiling engine responsive to creation of the content file, the media profiling engine being further configured to associate the content file as corresponding to the downloaded content based on receiving the trigger during the connection of the network interface component to the external source through the secure network connection. 14. The portable electronic device of claim 12, wherein the media profiling engine comprises a file query engine that is configured to search the memory for a content file having a file creation time stamp of the content file that approximates a time that the network interface component is connected to the external source via the secure network connection. 15. The portable electronic device of claim 12, wherein the network interface component is configured to provide secured connection data that identifies a time when the network interface component is connected to the external source via the secure network connection, the secured connection data being provided by at least one of an OS abstraction layer and a network driver of the network interface component. 16. A method for generating a media profile on a computer device, the method comprising:
establishing a secure network connection between the computer device and an external source associated with at least one of a purchase and retrieval of media content; downloading the media content purchased from the external source and storing the media content as a media file in local memory of the computer device; querying the memory for the media file based on at least one condition associated with the secure network connection of the computer device and the external source; and updating a media profile log in the computer device with information relevant to the media content purchased from the external source. 17. The method of claim 16, wherein querying the memory comprises detecting creation of the media file in response to a trigger signal during the connection of the computer device with the external source through the secure network connection. 18. The method of claim 16, wherein querying the memory comprises querying the memory for a file creation time of the media file relative to a time of the connection of the computer device with the external source via the secure network connection. 19. The method of claim 18, further comprising generating secured connection data comprising the time of the secure network connection associated with the purchase of the media content from at least one of a TCP/IP layer, an OS abstraction layer, and a network driver. 20. The method of claim 18, wherein updating the media profile log further comprises appending at least two of a file name, a file extension, a file size, an IP address of the external source, and a file creation time stamp of the media file to the media profile log. | 2,100 |
5,269 | 14,324,746 | 2,158 | Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results. | 1. A method comprising:
providing to a user a web page in conjunction with a first search result, the first search result being associated with a first search query comprising one or more terms; providing, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the one or more terms of the first search query; detecting, using at least one processor, a user selection of the selectable option corresponding to the candidate search term; generating a second search query, the second search query comprising at least one of the one or more terms of the first search query and the candidate search term corresponding to the user selection; and providing a second search result corresponding to the second search query. 2. The method of claim 1, wherein providing the selectable option corresponding to the candidate search term comprises providing a plurality of selectable options corresponding to one or more additional candidate search terms. 3. The method of claim 1, wherein providing the selectable option corresponding to the candidate search term comprises providing the selectable option within the web page. 4. The method of claim 1, wherein providing the second search result comprises providing an additional web page in conjunction with the second search result. 5. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option corresponding to another candidate search term; detecting a user selection of the second selectable option corresponding to the another candidate search term; generating a third search query comprising one or more terms of the second search query and the another candidate search term; and obtaining a third search result associated with the third search query. 6. The method of claim 5, further comprising enabling the user to modify the third search query by removing or adding one or more terms of the third search query. 7. The method of claim 6, wherein enabling the user to modify the third search query comprises presenting another selectable option to modify the third search query. 8. The method of claim 1, further comprising providing additional selectable options corresponding to additional candidate search terms. 9. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option associated with a subset of the terms of the second search query; detecting a user selection of the second selectable option associated with a subset of the terms of the second search query; generating a third search query comprising the subset of the terms of the second search query; and obtaining a third search result associated with the third search query. 10. The method of claim 9, further comprising providing a plurality of selectable options associated with a corresponding plurality of subsets of the terms of the second search query. 11. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option associated with a subset of the terms of the first search query; detecting a user selection of the second selectable option associated with a subset of the terms of the first search query; generating a third search query comprising the subset of the terms of the first search query; and obtaining a third search result associated with the third search query. 12. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option corresponding to a modification of one or more terms of the second search query; detecting a user selection of the second selectable option corresponding to the modification of the one or more terms of the second search query; generating a third search query comprising a modified second search query; and obtaining a third search result associated with the third search query. 13. The method of claim 1, further comprising visually distinguishing the one or more terms of the first search query and the candidate search term within the additional web page provided in conjunction with the second search result. 14. The method of claim 13, wherein visually distinguishing the one or more terms of the first search query and the candidate search term comprises highlighting the one or more terms of the first search query and candidate search term within a displayed portion of the additional web page. 15. The method of claim 13, wherein visually distinguishing the one or more terms of the first search query and the candidate search term comprises underlining the one or more terms of the first search query and candidate search term within a displayed portion of the additional coffeweb page. 16. The method of claim 1, further comprising:
identifying contextual information associated with the first search query based on content within the web page; identifying contextual information associated with the second search query; and determining whether the second search result is contextually relevant to the first search query. 17. A method comprising:
receiving, from a user, a first search query comprising at least one term; providing a first search result associated with the first search query; providing, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the at least one term of the first search query; detecting, using at least one processor, a user selection of the selectable option corresponding to the candidate search term; generating a second search query, wherein the second search query comprises the candidate search term corresponding to the user selection; and providing a second search result corresponding to the second search query. 18. The method of claim 17, wherein the first search result is provided to the user in a web page. 19. The method of claim 18, wherein the candidate search term is a modified version of the at least one term of the first search query. 20. A system comprising:
at least one processor; and at least one non-transitory computer readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to:
provide to a user a web page in conjunction with a first search result, the first search result being associated with a first search query comprising one or more terms;
provide, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the one or more terms of the first search query;
detect, using the at least one processor, a user selection of the selectable option corresponding to the candidate search term;
generate a second search query, the second search query comprising at least one of the one or more terms of the first search query and the candidate search term corresponding to the user selection; and
provide a second search result corresponding to the second search query. | Information may be presented to a user by receiving a selection of one or more terms passively displayed in a document, loading the terms to a search configuration, generating first results responsive to a user's predicted interest as expressed in the search configuration, and enabling display of the first results.1. A method comprising:
providing to a user a web page in conjunction with a first search result, the first search result being associated with a first search query comprising one or more terms; providing, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the one or more terms of the first search query; detecting, using at least one processor, a user selection of the selectable option corresponding to the candidate search term; generating a second search query, the second search query comprising at least one of the one or more terms of the first search query and the candidate search term corresponding to the user selection; and providing a second search result corresponding to the second search query. 2. The method of claim 1, wherein providing the selectable option corresponding to the candidate search term comprises providing a plurality of selectable options corresponding to one or more additional candidate search terms. 3. The method of claim 1, wherein providing the selectable option corresponding to the candidate search term comprises providing the selectable option within the web page. 4. The method of claim 1, wherein providing the second search result comprises providing an additional web page in conjunction with the second search result. 5. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option corresponding to another candidate search term; detecting a user selection of the second selectable option corresponding to the another candidate search term; generating a third search query comprising one or more terms of the second search query and the another candidate search term; and obtaining a third search result associated with the third search query. 6. The method of claim 5, further comprising enabling the user to modify the third search query by removing or adding one or more terms of the third search query. 7. The method of claim 6, wherein enabling the user to modify the third search query comprises presenting another selectable option to modify the third search query. 8. The method of claim 1, further comprising providing additional selectable options corresponding to additional candidate search terms. 9. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option associated with a subset of the terms of the second search query; detecting a user selection of the second selectable option associated with a subset of the terms of the second search query; generating a third search query comprising the subset of the terms of the second search query; and obtaining a third search result associated with the third search query. 10. The method of claim 9, further comprising providing a plurality of selectable options associated with a corresponding plurality of subsets of the terms of the second search query. 11. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option associated with a subset of the terms of the first search query; detecting a user selection of the second selectable option associated with a subset of the terms of the first search query; generating a third search query comprising the subset of the terms of the first search query; and obtaining a third search result associated with the third search query. 12. The method of claim 1, further comprising:
upon providing the second search result, further providing, to the user, a second selectable option corresponding to a modification of one or more terms of the second search query; detecting a user selection of the second selectable option corresponding to the modification of the one or more terms of the second search query; generating a third search query comprising a modified second search query; and obtaining a third search result associated with the third search query. 13. The method of claim 1, further comprising visually distinguishing the one or more terms of the first search query and the candidate search term within the additional web page provided in conjunction with the second search result. 14. The method of claim 13, wherein visually distinguishing the one or more terms of the first search query and the candidate search term comprises highlighting the one or more terms of the first search query and candidate search term within a displayed portion of the additional web page. 15. The method of claim 13, wherein visually distinguishing the one or more terms of the first search query and the candidate search term comprises underlining the one or more terms of the first search query and candidate search term within a displayed portion of the additional coffeweb page. 16. The method of claim 1, further comprising:
identifying contextual information associated with the first search query based on content within the web page; identifying contextual information associated with the second search query; and determining whether the second search result is contextually relevant to the first search query. 17. A method comprising:
receiving, from a user, a first search query comprising at least one term; providing a first search result associated with the first search query; providing, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the at least one term of the first search query; detecting, using at least one processor, a user selection of the selectable option corresponding to the candidate search term; generating a second search query, wherein the second search query comprises the candidate search term corresponding to the user selection; and providing a second search result corresponding to the second search query. 18. The method of claim 17, wherein the first search result is provided to the user in a web page. 19. The method of claim 18, wherein the candidate search term is a modified version of the at least one term of the first search query. 20. A system comprising:
at least one processor; and at least one non-transitory computer readable storage medium storing instructions thereon that, when executed by the at least one processor, cause the system to:
provide to a user a web page in conjunction with a first search result, the first search result being associated with a first search query comprising one or more terms;
provide, to the user, a selectable option corresponding to a candidate search term, wherein the candidate search term is different than the one or more terms of the first search query;
detect, using the at least one processor, a user selection of the selectable option corresponding to the candidate search term;
generate a second search query, the second search query comprising at least one of the one or more terms of the first search query and the candidate search term corresponding to the user selection; and
provide a second search result corresponding to the second search query. | 2,100 |
5,270 | 13,953,886 | 2,175 | Mechanisms for implementing a multi-monitor full screen mode in an application module are disclosed. An application module determines a number (N) of monitors that are coupled to a plurality of video ports of a device. The application module directs a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of respective maximum display areas of the N monitors. A primary monitor of the N monitors is determined, and a full screen display area associated with the primary monitor is determined. A main application window of the application module is sized to have dimensions that are at least coextensive with dimensions of the full screen display area, and the WMM is directed to display the main application window on the at least on primary monitor. | 1. A computer-implemented method for implementing a multi-monitor full screen mode in an application module executing on a device comprising a processor, the method comprising computer-implemented operations for:
determining, by the application module, that the multi-monitor full screen mode is requested; determining a number (N) of monitors that are coupled to a plurality of video ports of the device, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen; directing, by the application module, a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors; determining at least one primary monitor of the N monitors; determining a full screen display area associated with the at least one primary monitor; sizing a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and directing the WMM to display the main application window on the at least one primary monitor. 2. The method of claim 1, further comprising receiving a user-initiated request to enter the multi-monitor full screen mode. 3. The method of claim 1, wherein the WMM is configured to manage a plurality of windows associated with a plurality of different application modules. 4. The method of claim 1, wherein the full screen display area is coextensive with the maximum display area of the at least one primary monitor. 5. The method of claim 1, wherein the full screen display area is smaller than the maximum display area of the at least one primary monitor. 6. The method of claim 1, further comprising:
determining a second primary monitor of the N monitors; and wherein the full screen display area is associated with the at least one primary monitor and the second primary monitor. 7. The method of claim 6, wherein determining the full screen display area associated with the with the at least one primary monitor comprises:
accessing a configuration file; and obtaining the full screen display area from the configuration file. 8. The method of claim 1, further comprising:
setting attributes of the main application window such that the main application window is borderless, non-resizable, and lacks a minimize button and a maximize button. 9. The method of claim 1, further comprising:
prior to sizing the main application window, determining a plurality of attribute values of attributes of the main application window, the attribute values identifying visual characteristics of the main application window includes a size of the main application window and a location of the main application window; and storing the plurality of attribute values in a memory. 10. The method of claim 9, further comprising:
receiving a request to exit the multi-monitor full screen mode; accessing the memory to obtain the plurality of attribute values; altering the attributes of the main application window to have the plurality of attribute values; and directing the WMM to display the main application window. 11. The method of claim 1, further comprising:
determining a child application window associated with the application module, the child application window being displayed on a particular monitor of the N monitors prior to determining that the multi-monitor full screen mode is requested; after determining that the multi-monitor full screen mode is requested:
setting attributes of the child application window such that the child application window is borderless, cannot be minimized and cannot be maximized; and
directing the WMM to display the child application window on top of any other window displayed on the particular monitor. 12. The method of claim 11, further comprising:
determining that a user has selected, with an input device, a border region of the child application window; based on the determination, altering an icon of a pointer device to indicate a resize operation; determining that the user has dragged the icon to a new location on the particular monitor; and directing the WMM to display the child application window with a size based on the new location. 13. The method of claim 1, wherein directing the WMM that is independent of the application module to display the at least one cover window comprises:
directing the WMM that is independent of the application module to display a plurality of cover windows, the each cover window being displayed on a different one of the N monitors, and being coextensive with the respective maximum display area of the different one of the N monitors. 14. The method of claim 1, wherein determining the at least one primary monitor comprises:
determining a particular monitor of the N monitors on which the main application window is located, and designating the particular monitor as the at least one primary monitor. 15. The method of claim 1, wherein determining the at least one primary monitor comprises:
determining that the main application window spans multiple monitors of the N monitors; determining that a majority of an area of the main application window is displayed on a particular monitor of the multiple monitors; and designating the particular monitor as the at least one primary monitor. 16. A device, comprising:
a plurality of video ports configured to communicate with a plurality of monitors; a memory; a processor coupled to the plurality of video ports and the memory; an application module in the memory and operative to provide instructions to the processor, the processor responsive to the instructions of the application module, the application module operative to:
determine that a multi-monitor full screen mode is requested;
determining a number (N) of the plurality of monitors coupled to the plurality of video ports, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen;
direct a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors;
determine at least one primary monitor of the N monitors;
determine a full screen display area associated with the at least one primary monitor;
size a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and
direct the WMM to display the main application window on the at least one primary monitor. 17. The device of claim 16, wherein the WMM is configured to manage a plurality of windows associated with a plurality of different application modules. 18. The device of claim 16, wherein the application module is further configured to:
determine a second primary monitor of the N monitors; and wherein the full screen display area is associated with the at least one primary monitor and the second primary monitor. 19. A computer program product for implementing a multi-monitor full screen mode in an application module, the computer program product stored on a non-transitory computer-readable storage medium and including instructions configured to cause a processor to carry out the steps of:
determining that the multi-monitor full screen mode is requested; determining a number (N) of monitors that are coupled to a plurality of video ports of a device, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen; directing a WMM that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors; determining at least one primary monitor of the N monitors; determining a full screen display area associated with the at least one primary monitor; sizing a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and directing the WMM to display the main application window on the at least one primary monitor. | Mechanisms for implementing a multi-monitor full screen mode in an application module are disclosed. An application module determines a number (N) of monitors that are coupled to a plurality of video ports of a device. The application module directs a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of respective maximum display areas of the N monitors. A primary monitor of the N monitors is determined, and a full screen display area associated with the primary monitor is determined. A main application window of the application module is sized to have dimensions that are at least coextensive with dimensions of the full screen display area, and the WMM is directed to display the main application window on the at least on primary monitor.1. A computer-implemented method for implementing a multi-monitor full screen mode in an application module executing on a device comprising a processor, the method comprising computer-implemented operations for:
determining, by the application module, that the multi-monitor full screen mode is requested; determining a number (N) of monitors that are coupled to a plurality of video ports of the device, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen; directing, by the application module, a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors; determining at least one primary monitor of the N monitors; determining a full screen display area associated with the at least one primary monitor; sizing a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and directing the WMM to display the main application window on the at least one primary monitor. 2. The method of claim 1, further comprising receiving a user-initiated request to enter the multi-monitor full screen mode. 3. The method of claim 1, wherein the WMM is configured to manage a plurality of windows associated with a plurality of different application modules. 4. The method of claim 1, wherein the full screen display area is coextensive with the maximum display area of the at least one primary monitor. 5. The method of claim 1, wherein the full screen display area is smaller than the maximum display area of the at least one primary monitor. 6. The method of claim 1, further comprising:
determining a second primary monitor of the N monitors; and wherein the full screen display area is associated with the at least one primary monitor and the second primary monitor. 7. The method of claim 6, wherein determining the full screen display area associated with the with the at least one primary monitor comprises:
accessing a configuration file; and obtaining the full screen display area from the configuration file. 8. The method of claim 1, further comprising:
setting attributes of the main application window such that the main application window is borderless, non-resizable, and lacks a minimize button and a maximize button. 9. The method of claim 1, further comprising:
prior to sizing the main application window, determining a plurality of attribute values of attributes of the main application window, the attribute values identifying visual characteristics of the main application window includes a size of the main application window and a location of the main application window; and storing the plurality of attribute values in a memory. 10. The method of claim 9, further comprising:
receiving a request to exit the multi-monitor full screen mode; accessing the memory to obtain the plurality of attribute values; altering the attributes of the main application window to have the plurality of attribute values; and directing the WMM to display the main application window. 11. The method of claim 1, further comprising:
determining a child application window associated with the application module, the child application window being displayed on a particular monitor of the N monitors prior to determining that the multi-monitor full screen mode is requested; after determining that the multi-monitor full screen mode is requested:
setting attributes of the child application window such that the child application window is borderless, cannot be minimized and cannot be maximized; and
directing the WMM to display the child application window on top of any other window displayed on the particular monitor. 12. The method of claim 11, further comprising:
determining that a user has selected, with an input device, a border region of the child application window; based on the determination, altering an icon of a pointer device to indicate a resize operation; determining that the user has dragged the icon to a new location on the particular monitor; and directing the WMM to display the child application window with a size based on the new location. 13. The method of claim 1, wherein directing the WMM that is independent of the application module to display the at least one cover window comprises:
directing the WMM that is independent of the application module to display a plurality of cover windows, the each cover window being displayed on a different one of the N monitors, and being coextensive with the respective maximum display area of the different one of the N monitors. 14. The method of claim 1, wherein determining the at least one primary monitor comprises:
determining a particular monitor of the N monitors on which the main application window is located, and designating the particular monitor as the at least one primary monitor. 15. The method of claim 1, wherein determining the at least one primary monitor comprises:
determining that the main application window spans multiple monitors of the N monitors; determining that a majority of an area of the main application window is displayed on a particular monitor of the multiple monitors; and designating the particular monitor as the at least one primary monitor. 16. A device, comprising:
a plurality of video ports configured to communicate with a plurality of monitors; a memory; a processor coupled to the plurality of video ports and the memory; an application module in the memory and operative to provide instructions to the processor, the processor responsive to the instructions of the application module, the application module operative to:
determine that a multi-monitor full screen mode is requested;
determining a number (N) of the plurality of monitors coupled to the plurality of video ports, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen;
direct a window management module (WMM) that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors;
determine at least one primary monitor of the N monitors;
determine a full screen display area associated with the at least one primary monitor;
size a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and
direct the WMM to display the main application window on the at least one primary monitor. 17. The device of claim 16, wherein the WMM is configured to manage a plurality of windows associated with a plurality of different application modules. 18. The device of claim 16, wherein the application module is further configured to:
determine a second primary monitor of the N monitors; and wherein the full screen display area is associated with the at least one primary monitor and the second primary monitor. 19. A computer program product for implementing a multi-monitor full screen mode in an application module, the computer program product stored on a non-transitory computer-readable storage medium and including instructions configured to cause a processor to carry out the steps of:
determining that the multi-monitor full screen mode is requested; determining a number (N) of monitors that are coupled to a plurality of video ports of a device, wherein N is greater than one, the N monitors each having a respective maximum display area based on a corresponding monitor screen; directing a WMM that is independent of the application module to display at least one cover window that has dimensions coextensive with dimensions of the respective maximum display areas of the N monitors; determining at least one primary monitor of the N monitors; determining a full screen display area associated with the at least one primary monitor; sizing a main application window of the application module to have dimensions that are at least coextensive with dimensions of the full screen display area; and directing the WMM to display the main application window on the at least one primary monitor. | 2,100 |
5,271 | 14,573,743 | 2,178 | One embodiment provides a method, including: detecting, using a sensor, one or more user characteristics; identifying, using the one or more user characteristics, a user currently handling a remote control device; associating, using a processor, a media device setting with the user currently handling the remote control device; and implementing, using a processor, the media device setting. Other aspects are described and claimed. | 1. A method, comprising:
detecting, using a sensor, one or more user characteristics; identifying, using the one or more user characteristics, a user currently handling a remote control device; associating, using a processor, a media device setting with the user currently handling the remote control device; and implementing, using a processor, the media device setting. 2. The method of claim 1, wherein the detecting comprises using a sensor of the remote control device to detect data indicating hand placement of the user. 3. The method of claim 1, wherein the one or more user characteristics comprises biometrics. 4. The method of claim 1, wherein the identifying comprises comparing the one or more user characteristics received to at least one stored user profile. 5. The method of claim 1, wherein the detecting comprises receiving the one or more user characteristics for a predetermined length of time. 6. The method of claim 1, further comprising providing an indication that the user has been identified. 7. The method of claim 1, wherein the media device setting includes a setting selected from the group consisting of: a personalized channel listing, a personalized recorded video listing, personalized media bookmarks, and personalized content access. 8. The method of claim 1, wherein the associating is performed at a location selected from the group consisting of: the remote control device, the media device, and a network connected device operatively coupled to the media device. 9. The method of claim 1, wherein the detecting comprises detecting a short range wireless identification signal. 10. A remote control device, comprising:
a processor; at least one sensor operatively coupled to the processor, wherein the at least one sensor detects one or more user characteristics; and a communication device operatively coupled to the processor; wherein the processor identifies, using the one or more user characteristics, a user currently handling the remote control device. 11. The remote control device of claim 10, wherein the communication device communicates an indication of the user currently handling the remote control device to a media device. 12. The remote control of claim 10, wherein the sensor detects hand placement of the user. 13. The remote control of claim 10, wherein
the processor associates a media device setting with the user currently handling the remote control device; and the communication device communicates the media device setting to the media device. 14. The remote control device of claim 10, where the processor uses the one or more user characteristics to customize the remote control device for the user currently handling the remote control device. 15. A system, comprising:
one or more processors; at least one sensor operatively coupled to the one or more processors; and one or more memory devices that store instructions executable by the one or more processors to: detect one or more user characteristics; identify, using the one or more user characteristics, a user currently handling a remote control device; associate a media device setting with the user currently handling the remote control device; and implement the media device setting. 16. The system of claim 15, wherein the at least one sensor comprises a short range wireless device, and wherein the one or more user characteristics comprise a short range wireless identification. 17. The system of claim 15, wherein the system comprises a remote control device; and
wherein the at least one sensor is disposed in the remote control device. 18. The system of claim 15, wherein the system comprises a media device; and
wherein a processor of the media device implements the media device setting. 19. The system of claim 15, wherein the system comprises a media device; and
wherein the at least one sensor is operatively coupled to the media device. 20. The system of claim 19, wherein the at least one sensor is a camera operatively coupled to the media device. 21. The system of claim 15, wherein the media device setting includes a setting selected from the group consisting of: a personalized channel listing, a personalized recorded video listing, personalized media bookmarks, and personalized content access. 22. The system of claim 15, further comprising a television and a media device, wherein the television is operatively coupled to the media device;
the television displaying media content from the media device according to the media device setting. 23. The system of claim 15, further comprising:
a media device; a remote control device; and a network connected device; wherein associating the media device setting with the user currently handling the remote control device is performed at a location selected from the group consisting of: the remote control device, the media device, and the network connected device. 24. The system of claim 15, wherein the one or more user characteristics comprises data indicating the hand placement of the user. 25. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that detects, using a sensor, one or more user characteristics; code that identifies, using the one or more user characteristics, a user currently handling a remote control device; code that associates a media device setting with the user currently handling the remote control device; and code that implements the media device setting. | One embodiment provides a method, including: detecting, using a sensor, one or more user characteristics; identifying, using the one or more user characteristics, a user currently handling a remote control device; associating, using a processor, a media device setting with the user currently handling the remote control device; and implementing, using a processor, the media device setting. Other aspects are described and claimed.1. A method, comprising:
detecting, using a sensor, one or more user characteristics; identifying, using the one or more user characteristics, a user currently handling a remote control device; associating, using a processor, a media device setting with the user currently handling the remote control device; and implementing, using a processor, the media device setting. 2. The method of claim 1, wherein the detecting comprises using a sensor of the remote control device to detect data indicating hand placement of the user. 3. The method of claim 1, wherein the one or more user characteristics comprises biometrics. 4. The method of claim 1, wherein the identifying comprises comparing the one or more user characteristics received to at least one stored user profile. 5. The method of claim 1, wherein the detecting comprises receiving the one or more user characteristics for a predetermined length of time. 6. The method of claim 1, further comprising providing an indication that the user has been identified. 7. The method of claim 1, wherein the media device setting includes a setting selected from the group consisting of: a personalized channel listing, a personalized recorded video listing, personalized media bookmarks, and personalized content access. 8. The method of claim 1, wherein the associating is performed at a location selected from the group consisting of: the remote control device, the media device, and a network connected device operatively coupled to the media device. 9. The method of claim 1, wherein the detecting comprises detecting a short range wireless identification signal. 10. A remote control device, comprising:
a processor; at least one sensor operatively coupled to the processor, wherein the at least one sensor detects one or more user characteristics; and a communication device operatively coupled to the processor; wherein the processor identifies, using the one or more user characteristics, a user currently handling the remote control device. 11. The remote control device of claim 10, wherein the communication device communicates an indication of the user currently handling the remote control device to a media device. 12. The remote control of claim 10, wherein the sensor detects hand placement of the user. 13. The remote control of claim 10, wherein
the processor associates a media device setting with the user currently handling the remote control device; and the communication device communicates the media device setting to the media device. 14. The remote control device of claim 10, where the processor uses the one or more user characteristics to customize the remote control device for the user currently handling the remote control device. 15. A system, comprising:
one or more processors; at least one sensor operatively coupled to the one or more processors; and one or more memory devices that store instructions executable by the one or more processors to: detect one or more user characteristics; identify, using the one or more user characteristics, a user currently handling a remote control device; associate a media device setting with the user currently handling the remote control device; and implement the media device setting. 16. The system of claim 15, wherein the at least one sensor comprises a short range wireless device, and wherein the one or more user characteristics comprise a short range wireless identification. 17. The system of claim 15, wherein the system comprises a remote control device; and
wherein the at least one sensor is disposed in the remote control device. 18. The system of claim 15, wherein the system comprises a media device; and
wherein a processor of the media device implements the media device setting. 19. The system of claim 15, wherein the system comprises a media device; and
wherein the at least one sensor is operatively coupled to the media device. 20. The system of claim 19, wherein the at least one sensor is a camera operatively coupled to the media device. 21. The system of claim 15, wherein the media device setting includes a setting selected from the group consisting of: a personalized channel listing, a personalized recorded video listing, personalized media bookmarks, and personalized content access. 22. The system of claim 15, further comprising a television and a media device, wherein the television is operatively coupled to the media device;
the television displaying media content from the media device according to the media device setting. 23. The system of claim 15, further comprising:
a media device; a remote control device; and a network connected device; wherein associating the media device setting with the user currently handling the remote control device is performed at a location selected from the group consisting of: the remote control device, the media device, and the network connected device. 24. The system of claim 15, wherein the one or more user characteristics comprises data indicating the hand placement of the user. 25. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that detects, using a sensor, one or more user characteristics; code that identifies, using the one or more user characteristics, a user currently handling a remote control device; code that associates a media device setting with the user currently handling the remote control device; and code that implements the media device setting. | 2,100 |
5,272 | 14,396,131 | 2,163 | A system and method for supporting multi-tenancy in a federated data management system are provided herein. The method includes receiving a query from a client at a data management server, wherein the query includes a tenant property condition corresponding to the client. The method also includes identifying an external data store including data specified by the query and determining whether the external data store is multi-tenant enabled. The method further includes removing the tenant property condition and executing the query to retrieve the specified data if the external data store is not multi-tenant enabled. | 1. A method for supporting multi-tenancy in a federated data management system, comprising:
receiving a query from a client at a data management server, wherein the query comprises a tenant property condition corresponding to the client; identifying an external data store comprising data specified by the query; determining whether the external data store is multi-tenant enabled; if the external data store is not multi-tenant enabled, removing the tenant property condition and executing the query to retrieve the specified data. 2. The method of claim 1, comprising providing the specified data retrieved from the external data store to the client. 3. The method of claim 1, comprising, if the external data store is multi-tenant enabled, providing the query to the external data store with the corresponding tenant property condition, wherein the external data store is configured to execute the query and return only data corresponding to the tenant property condition to the data management server. 4. The method of claim 1, comprising:
determining whether a default tenant defined for the external data store matches the tenant property condition specified by the query; if the default tenant defined for the external data store matches the tenant property condition specified by the query, removing the tenant property condition and executing the query to retrieve the specified data; and if the default tenant defined for the external data store does not match the tenant property condition specified by the query, returning an empty result for the query to the client. 5. The method of claim 4, wherein executing the query to retrieve the specified data comprises:
providing the query to the external data store, wherein the external data store is configured to execute the query and return the data specified by the query to the data management server; and adding information relating to the default tenant to the specified data retrieved from the external data store. 6. The method of claim 1, comprising:
determining a plurality of external data stores, wherein each external data store comprises a portion of the data specified by the query, and wherein each external data store is configured to execute the query to retrieve the portion of the data; combining the portions of the data retrieved from the plurality of external data stores to obtain a result for the query; and providing the result to the client. 7. The method of claim 1, comprising:
retrieving a portion of the data specified by the query from a data management database that is communicatively coupled to the data management server; and providing the portion of the data retrieved from the data management database to the client. 8. A computing system for supporting multi-tenancy, comprising:
a federation engine configured to:
determine an external data store comprising data specified by a topology query language (TQL) query received from a client, wherein the TQL query comprises a specified tenant property condition; and
determine whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store; and
a TQL engine configured to direct retrieval of the specified data from the external data store based on the tenant property condition specified by the TQL query and whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store, wherein the specified data is retrieved from the external data store by executing the TQL query on the external data store. 9. The computing system of claim 8, wherein the computing system comprises a configuration management database (CMDB) server within a federated configuration data management system, and wherein the data specified by the query comprises configuration data. 10. The computing system of claim 8, wherein, if the external data store comprises a multi-tenant enabled external data store, directing retrieval of the specified data from the multi-tenant enabled external data store comprises providing the TQL query to the multi-tenant enabled external data store with the specified tenant property condition, and wherein the multi-tenant enabled external data store is configured to execute the query and return only data corresponding to the tenant property condition to the computing system. 11. The computing system of claim 8, wherein, if the external data store comprises a multi-tenant enabled external data store, directing retrieval of the specified data from the multi-tenant enabled external data store comprises:
determining whether a default tenant defined for the non-multi-tenant enabled external data store comprises the tenant property condition specified by the TQL query; if the default tenant defined for the non-multi-tenant enabled external data store does not comprise the tenant property condition specified by the TQL query, returning an empty result for the TQL query to the client; and if the default tenant defined for the non-multi-tenant enabled external data store comprises the tenant property condition specified by the query, retrieving the specified data from the non-multi-tenant enabled external data store. 12. The computing system of claim 11, wherein retrieving the specified data from the non-multi-tenant enabled external data store comprises:
removing the specified tenant property condition from the TQL query; providing the TQL query to the non-multi-tenant enabled external data store, wherein the non-multi-tenant external data store is configured to execute the query and return the data specified by the query to the computing device; and adding information relating to the default tenant to the specified data retrieved from the non-multi-tenant external data store. 13. A tangible, non-transitory, computer-readable medium comprising code configured to direct a processor to:
receive a query from a client, wherein the query comprises a tenant property condition; determine an external data store comprising data specified by the query; determining whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store; if the external data store comprises a multi-tenant enabled external data store, retrieving only data corresponding to the tenant property condition from the multi-tenant enabled external data store; if the external data store comprises a non-multi-tenant enabled external data store:
determining whether a default tenant defined for the non-multi-tenant enabled external data store matches the tenant property condition specified by the query; and
if it is determined that the default tenant matches the tenant property condition, retrieving the specified data from the non-multi-tenant enabled external data store; and
providing the specified data retrieved from the external data store to the client. 14. The tangible, non-transitory, computer-readable medium of claim 13, comprising code configured to direct the processor to, if it is determined the default tenant defined for the non-multi-tenant enabled external data store does not match the tenant property condition specified by the query, return an empty result for the query to the client. 15. The tangible, non-transitory, computer-readable medium of claim 13, wherein retrieving the specified data from the non-multi-tenant enabled external data store comprises:
removing the tenant property condition from the query; providing the query to the non-multi-tenant enabled external data store, wherein the non-multi-tenant external data store is configured to execute the query and return the data specified by the query to the data management server; and adding information relating to the default tenant to the specified data retrieved from the non-multi-tenant external data store. | A system and method for supporting multi-tenancy in a federated data management system are provided herein. The method includes receiving a query from a client at a data management server, wherein the query includes a tenant property condition corresponding to the client. The method also includes identifying an external data store including data specified by the query and determining whether the external data store is multi-tenant enabled. The method further includes removing the tenant property condition and executing the query to retrieve the specified data if the external data store is not multi-tenant enabled.1. A method for supporting multi-tenancy in a federated data management system, comprising:
receiving a query from a client at a data management server, wherein the query comprises a tenant property condition corresponding to the client; identifying an external data store comprising data specified by the query; determining whether the external data store is multi-tenant enabled; if the external data store is not multi-tenant enabled, removing the tenant property condition and executing the query to retrieve the specified data. 2. The method of claim 1, comprising providing the specified data retrieved from the external data store to the client. 3. The method of claim 1, comprising, if the external data store is multi-tenant enabled, providing the query to the external data store with the corresponding tenant property condition, wherein the external data store is configured to execute the query and return only data corresponding to the tenant property condition to the data management server. 4. The method of claim 1, comprising:
determining whether a default tenant defined for the external data store matches the tenant property condition specified by the query; if the default tenant defined for the external data store matches the tenant property condition specified by the query, removing the tenant property condition and executing the query to retrieve the specified data; and if the default tenant defined for the external data store does not match the tenant property condition specified by the query, returning an empty result for the query to the client. 5. The method of claim 4, wherein executing the query to retrieve the specified data comprises:
providing the query to the external data store, wherein the external data store is configured to execute the query and return the data specified by the query to the data management server; and adding information relating to the default tenant to the specified data retrieved from the external data store. 6. The method of claim 1, comprising:
determining a plurality of external data stores, wherein each external data store comprises a portion of the data specified by the query, and wherein each external data store is configured to execute the query to retrieve the portion of the data; combining the portions of the data retrieved from the plurality of external data stores to obtain a result for the query; and providing the result to the client. 7. The method of claim 1, comprising:
retrieving a portion of the data specified by the query from a data management database that is communicatively coupled to the data management server; and providing the portion of the data retrieved from the data management database to the client. 8. A computing system for supporting multi-tenancy, comprising:
a federation engine configured to:
determine an external data store comprising data specified by a topology query language (TQL) query received from a client, wherein the TQL query comprises a specified tenant property condition; and
determine whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store; and
a TQL engine configured to direct retrieval of the specified data from the external data store based on the tenant property condition specified by the TQL query and whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store, wherein the specified data is retrieved from the external data store by executing the TQL query on the external data store. 9. The computing system of claim 8, wherein the computing system comprises a configuration management database (CMDB) server within a federated configuration data management system, and wherein the data specified by the query comprises configuration data. 10. The computing system of claim 8, wherein, if the external data store comprises a multi-tenant enabled external data store, directing retrieval of the specified data from the multi-tenant enabled external data store comprises providing the TQL query to the multi-tenant enabled external data store with the specified tenant property condition, and wherein the multi-tenant enabled external data store is configured to execute the query and return only data corresponding to the tenant property condition to the computing system. 11. The computing system of claim 8, wherein, if the external data store comprises a multi-tenant enabled external data store, directing retrieval of the specified data from the multi-tenant enabled external data store comprises:
determining whether a default tenant defined for the non-multi-tenant enabled external data store comprises the tenant property condition specified by the TQL query; if the default tenant defined for the non-multi-tenant enabled external data store does not comprise the tenant property condition specified by the TQL query, returning an empty result for the TQL query to the client; and if the default tenant defined for the non-multi-tenant enabled external data store comprises the tenant property condition specified by the query, retrieving the specified data from the non-multi-tenant enabled external data store. 12. The computing system of claim 11, wherein retrieving the specified data from the non-multi-tenant enabled external data store comprises:
removing the specified tenant property condition from the TQL query; providing the TQL query to the non-multi-tenant enabled external data store, wherein the non-multi-tenant external data store is configured to execute the query and return the data specified by the query to the computing device; and adding information relating to the default tenant to the specified data retrieved from the non-multi-tenant external data store. 13. A tangible, non-transitory, computer-readable medium comprising code configured to direct a processor to:
receive a query from a client, wherein the query comprises a tenant property condition; determine an external data store comprising data specified by the query; determining whether the external data store comprises a multi-tenant enabled external data store or a non-multi-tenant enabled external data store; if the external data store comprises a multi-tenant enabled external data store, retrieving only data corresponding to the tenant property condition from the multi-tenant enabled external data store; if the external data store comprises a non-multi-tenant enabled external data store:
determining whether a default tenant defined for the non-multi-tenant enabled external data store matches the tenant property condition specified by the query; and
if it is determined that the default tenant matches the tenant property condition, retrieving the specified data from the non-multi-tenant enabled external data store; and
providing the specified data retrieved from the external data store to the client. 14. The tangible, non-transitory, computer-readable medium of claim 13, comprising code configured to direct the processor to, if it is determined the default tenant defined for the non-multi-tenant enabled external data store does not match the tenant property condition specified by the query, return an empty result for the query to the client. 15. The tangible, non-transitory, computer-readable medium of claim 13, wherein retrieving the specified data from the non-multi-tenant enabled external data store comprises:
removing the tenant property condition from the query; providing the query to the non-multi-tenant enabled external data store, wherein the non-multi-tenant external data store is configured to execute the query and return the data specified by the query to the data management server; and adding information relating to the default tenant to the specified data retrieved from the non-multi-tenant external data store. | 2,100 |
5,273 | 14,643,505 | 2,141 | In one aspect, an apparatus includes a processor, a sensor accessible to the processor, a display accessible to the processor, and memory accessible to the processor. The memory bears instructions executable by the processor to receive first input from the sensor, and based on the first input, identify a location on the display at which a user is looking. The instructions are also executable to receive second input from an input device in communication with the apparatus and, responsive to receipt of the second input and based on the location on the display, execute a function at the apparatus regardless of a location of the input device when the second input was received. | 1. An apparatus, comprising:
a processor; a sensor accessible to the processor; a display accessible to the processor; and memory accessible to the processor and bearing instructions executable by the processor to: receive first input from the sensor; based on the first input, identify a location on the display at which a user is looking; receive second input from an input device in communication with the apparatus; and responsive to receipt of the second input and based on the location on the display, execute a function at the apparatus regardless of a location of the input device when the second input was received. 2. The apparatus of claim 1, wherein the input device is a stylus, and wherein the second input is from at least one of a motion sensor on the stylus and a contact sensor on the stylus. 3. The apparatus of claim 1, wherein the input device is selected from the group consisting of: a wearable device, a computer comprising a display, an input pad disposable on a surface. 4. The apparatus of claim 1, wherein the function is executed at the apparatus regardless of a location of a cursor presented on the display. 5. The apparatus of claim 1, wherein the input device is a device which is not mechanically coupled to the apparatus. 6. The apparatus of claim 1, wherein the function is replacement of a first word presented on the display with a second word different firom the first word. 7. The apparatus of claim 1, wherein an element is presented at the location on the display, and wherein the function is associated with selection of the element. 8. The apparatus of claim 1, wherein the function is presentation of a menu on the display. 9. The apparatus of claim 8, wherein the second input is received at an area of the display not comprising the location on the display. 10. The apparatus of claim 1, wherein the function is to highlight text presented on the display. 11. The apparatus of claim 10, wherein the function is executed at least in part based on detection of a gesture of at least one at least partially curved stroke one or more of: in free space, and against a surface other than the display. 12. The apparatus of claim 1, wherein the function is to remove from presentation on the display at least one word. 13. The apparatus of claim 12, wherein the function is executed based at least in part on detection of a gesture of at least two strokes in different directions one or more of: in free space, and against a surface other than the display. 14. The apparatus of claim 1, wherein the function is presentation of a representation of at least one character detected as gestured one or more of: in free space, and against a surface other than the display. 15. A method, comprising:
receiving first input from a camera; based on the first input, identifying a location of a display at which a person is looking; receiving second input from an input device, wherein the second input is input received other than based on physical contact of the input device with the display; and based at least in part on the location and responsive to receiving the second input, performing an operation at a device. 16. The method of claim 15, comprising:
identifying the second input as input from a contact sensor on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the contact sensor. 17. The method of claim 15, comprising:
identifying the second input as input from an electronic button on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the electronic button. 18. The method of claim 15, comprising:
identifying the second input as input from an accelerometer on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the accelerometer. 19. Apparatus comprising:
a first processor; a network adapter; storage bearing instructions executable by a second processor for: performing a task using the second processor responsive to identification of a user looking at an area of a display and responsive to receipt of input generated based on manipulation of an input device other than against the display; wherein the first processor transfers the instructions over a network via the network adapter. 20. The apparatus of claim 19, wherein the input device is a mouse, and wherein the task is performed responsive to receipt of input generated based on manipulation of a button on the mouse regardless of a current position of a cursor presented on the display. | In one aspect, an apparatus includes a processor, a sensor accessible to the processor, a display accessible to the processor, and memory accessible to the processor. The memory bears instructions executable by the processor to receive first input from the sensor, and based on the first input, identify a location on the display at which a user is looking. The instructions are also executable to receive second input from an input device in communication with the apparatus and, responsive to receipt of the second input and based on the location on the display, execute a function at the apparatus regardless of a location of the input device when the second input was received.1. An apparatus, comprising:
a processor; a sensor accessible to the processor; a display accessible to the processor; and memory accessible to the processor and bearing instructions executable by the processor to: receive first input from the sensor; based on the first input, identify a location on the display at which a user is looking; receive second input from an input device in communication with the apparatus; and responsive to receipt of the second input and based on the location on the display, execute a function at the apparatus regardless of a location of the input device when the second input was received. 2. The apparatus of claim 1, wherein the input device is a stylus, and wherein the second input is from at least one of a motion sensor on the stylus and a contact sensor on the stylus. 3. The apparatus of claim 1, wherein the input device is selected from the group consisting of: a wearable device, a computer comprising a display, an input pad disposable on a surface. 4. The apparatus of claim 1, wherein the function is executed at the apparatus regardless of a location of a cursor presented on the display. 5. The apparatus of claim 1, wherein the input device is a device which is not mechanically coupled to the apparatus. 6. The apparatus of claim 1, wherein the function is replacement of a first word presented on the display with a second word different firom the first word. 7. The apparatus of claim 1, wherein an element is presented at the location on the display, and wherein the function is associated with selection of the element. 8. The apparatus of claim 1, wherein the function is presentation of a menu on the display. 9. The apparatus of claim 8, wherein the second input is received at an area of the display not comprising the location on the display. 10. The apparatus of claim 1, wherein the function is to highlight text presented on the display. 11. The apparatus of claim 10, wherein the function is executed at least in part based on detection of a gesture of at least one at least partially curved stroke one or more of: in free space, and against a surface other than the display. 12. The apparatus of claim 1, wherein the function is to remove from presentation on the display at least one word. 13. The apparatus of claim 12, wherein the function is executed based at least in part on detection of a gesture of at least two strokes in different directions one or more of: in free space, and against a surface other than the display. 14. The apparatus of claim 1, wherein the function is presentation of a representation of at least one character detected as gestured one or more of: in free space, and against a surface other than the display. 15. A method, comprising:
receiving first input from a camera; based on the first input, identifying a location of a display at which a person is looking; receiving second input from an input device, wherein the second input is input received other than based on physical contact of the input device with the display; and based at least in part on the location and responsive to receiving the second input, performing an operation at a device. 16. The method of claim 15, comprising:
identifying the second input as input from a contact sensor on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the contact sensor. 17. The method of claim 15, comprising:
identifying the second input as input from an electronic button on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the electronic button. 18. The method of claim 15, comprising:
identifying the second input as input from an accelerometer on the input device, wherein the operation is performed based at least in part on the identifying of the second input as input from the accelerometer. 19. Apparatus comprising:
a first processor; a network adapter; storage bearing instructions executable by a second processor for: performing a task using the second processor responsive to identification of a user looking at an area of a display and responsive to receipt of input generated based on manipulation of an input device other than against the display; wherein the first processor transfers the instructions over a network via the network adapter. 20. The apparatus of claim 19, wherein the input device is a mouse, and wherein the task is performed responsive to receipt of input generated based on manipulation of a button on the mouse regardless of a current position of a cursor presented on the display. | 2,100 |
5,274 | 14,845,238 | 2,111 | Methods, apparatuses, and system for performing at least one of error correction or error detection are described. In one embodiment, a radio frequency identification (RFID) tag receives a signal activating or interrogating the tag. The tag includes memory that stores data associated with the tag. The tag performs at least one of error detection or error correction on the stored data. The error detection includes detecting, by the tag, that one or more bits of the stored data are inflicted with an error. The error correction includes correcting the erroneous bit if the error affects less than a predetermined number of the bits of the stored data. The tag transmits the stored data to a reader in response to the detection or correction. The reader can analyze the stored data for additional information about the error or provide the stored data to another computing system that performs the analysis. | 1. An error correction method for use with a radio frequency identification (RFID) tag comprised of an antenna and an integrated circuit (IC), the method comprising:
receiving, via the antenna, a signal for at least one of activating the tag or interrogating the tag, wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on at least some of the stored data; detecting, by the IC, that one or more bits of the stored data has an error, wherein the detection is performed after the tag is activated; and transmitting the manufacturing data in response to the detection of the error. 2. The error correction method of claim 1, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 3. The error correction method of claim 1, further comprising:
correcting, by the IC, the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted after the correction is performed. 4. The error correction method of claim 3, wherein the predetermined number is less than or equal to three and is small relative to a total number of the bits of the stored data. 5. The error correction method of claim 4, wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 6. The error correction method of claim 1, wherein the IC of the tag further comprises an error counter configured to count each error that occurs with the bits of the stored data, wherein a count having the total number of occurred errors is stored in the memory, wherein the count is continually updated, and wherein a signal including the count is transmitted via the antenna each time an error is detected and the count is updated. 7. The error detection method of claim 1, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 8. The error detection method of claim 1, wherein the manufacturing data is transmitted to at least one of an RFID reader or an entity that designed or manufactured the tag. 9. An error correction method for use with a radio frequency identification (RFID) reader, the method comprising:
transmitting, by the reader, a signal for at least one of activating a tag or interrogating the tag, wherein the tag comprises an antenna and an integrated circuit (IC), wherein the IC comprises non-volatile memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on at least some of the stored data; receiving, by the reader, a signal comprising information about at least one error that was detected or corrected by the IC of the tag, wherein the detected error affects one or more bits of the stored data; transmitting, by the reader, a signal comprising the manufacturing data to an entity that designed or manufactured the tag. 10. The error correction method of claim 9, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer; and wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error; and wherein the predetermined number is less than three and is small relative to a total number of the bits of the stored data. 11. The error correction method of claim 10, wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 12. A radio frequency identification (RFID) system, the system comprising:
an RFID tag comprised of an antenna and an integrated circuit (IC), the IC comprising memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and the IC being configured to perform at least one of error detection or error correction on at least some of the stored data, and an RFID reader, wherein:
the reader is configured to transmit a first signal activating the tag;
the tag is configured to receive the first signal and become activated;
the tag is further configured to detect, after activation, that one or more bits of the stored data have an error;
the tag is further configured to transmit a second signal in response to the detection of the error, the second signal comprising the manufacturing data; and
the reader is further configured to receive the second signal transmitted by the tag. 13. The system of claim 12, wherein the tag is further configured to correct the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted as part of the second signal after the correction is performed. 14. The system of claim 13, wherein the predetermined number is less than three and is small relative to a total number of the bits of the stored data and wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 15. The system of claim 12, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 16. The system of claim 12, wherein the IC of the tag further comprises an error counter configured to count each error that occurs with the bits of the stored data, wherein a count having the total number of occurred errors is stored in the memory, wherein the count is continually updated, and wherein the second signal includes the count. 17. The system of claim 12, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 18. The system of claim 12, wherein the reader is further configured to transmit the manufacturing data to an entity that designed or manufactured the tag. 19. A radio frequency identification (RFID) tag comprised of an antenna and an integrated circuit (IC), the tag comprising:
a receiver configured to receive, via the antenna, a signal for at least one of activating the tag or interrogating the tag, wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on the stored data; processing logic configured to detect that at least one of the bits of the stored data has an error, wherein the detection is performed after the tag is activated and wherein the processing logic is coupled to the receiver; and a transmitter configured to transmit the manufacturing data in response to the detection of the error, wherein the transmitter is coupled to the processing logic. 20. The tag of claim 19, wherein the processing logic is further configured to correct the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted after the correction is performed. 21. The tag of claim 19, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 22. The tag of claim 19, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 23. A radio frequency identification (RFID) reader, the reader comprising:
a transmitter configured to transmit a signal activating a tag, wherein the tag comprises an antenna and an integrated circuit (IC), wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on the stored data; a receiver configured to receive a signal comprising information about at least one error that was detected or corrected by the IC of the tag, wherein the at least one error affects one or more bits of the stored data and wherein the signal includes the manufacturing data; a processing system coupled to the transmitter and to the receiver; a network interface configured to transmit a signal comprising the manufacturing data to an entity that designed or manufactured the tag, wherein the network interface is coupled to the processing system. 24. The reader of claim 23, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 25. The reader of claim 23, wherein the network interface comprises at least one of:
a Wi-Fi transceiver, an Ethernet transceiver, a cellular telephone transceiver, or a wireless personal area transceiver. 26. The reader of claim 22, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 27. The reader of claim 22, wherein the processing system is configured to analyze the manufacturing data to determine whether the at least one error is due to a manufacturing defect. 28. The reader of claim 27, wherein the processing system is further configured to determine, when the at least one error is due the manufacturing defect, a source or a location of the manufacturing defect. 29. The reader of claim 28, wherein the signal transmitted by the network interface further includes the source or the location of the manufacturing defect. | Methods, apparatuses, and system for performing at least one of error correction or error detection are described. In one embodiment, a radio frequency identification (RFID) tag receives a signal activating or interrogating the tag. The tag includes memory that stores data associated with the tag. The tag performs at least one of error detection or error correction on the stored data. The error detection includes detecting, by the tag, that one or more bits of the stored data are inflicted with an error. The error correction includes correcting the erroneous bit if the error affects less than a predetermined number of the bits of the stored data. The tag transmits the stored data to a reader in response to the detection or correction. The reader can analyze the stored data for additional information about the error or provide the stored data to another computing system that performs the analysis.1. An error correction method for use with a radio frequency identification (RFID) tag comprised of an antenna and an integrated circuit (IC), the method comprising:
receiving, via the antenna, a signal for at least one of activating the tag or interrogating the tag, wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on at least some of the stored data; detecting, by the IC, that one or more bits of the stored data has an error, wherein the detection is performed after the tag is activated; and transmitting the manufacturing data in response to the detection of the error. 2. The error correction method of claim 1, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 3. The error correction method of claim 1, further comprising:
correcting, by the IC, the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted after the correction is performed. 4. The error correction method of claim 3, wherein the predetermined number is less than or equal to three and is small relative to a total number of the bits of the stored data. 5. The error correction method of claim 4, wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 6. The error correction method of claim 1, wherein the IC of the tag further comprises an error counter configured to count each error that occurs with the bits of the stored data, wherein a count having the total number of occurred errors is stored in the memory, wherein the count is continually updated, and wherein a signal including the count is transmitted via the antenna each time an error is detected and the count is updated. 7. The error detection method of claim 1, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 8. The error detection method of claim 1, wherein the manufacturing data is transmitted to at least one of an RFID reader or an entity that designed or manufactured the tag. 9. An error correction method for use with a radio frequency identification (RFID) reader, the method comprising:
transmitting, by the reader, a signal for at least one of activating a tag or interrogating the tag, wherein the tag comprises an antenna and an integrated circuit (IC), wherein the IC comprises non-volatile memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on at least some of the stored data; receiving, by the reader, a signal comprising information about at least one error that was detected or corrected by the IC of the tag, wherein the detected error affects one or more bits of the stored data; transmitting, by the reader, a signal comprising the manufacturing data to an entity that designed or manufactured the tag. 10. The error correction method of claim 9, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer; and wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error; and wherein the predetermined number is less than three and is small relative to a total number of the bits of the stored data. 11. The error correction method of claim 10, wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 12. A radio frequency identification (RFID) system, the system comprising:
an RFID tag comprised of an antenna and an integrated circuit (IC), the IC comprising memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and the IC being configured to perform at least one of error detection or error correction on at least some of the stored data, and an RFID reader, wherein:
the reader is configured to transmit a first signal activating the tag;
the tag is configured to receive the first signal and become activated;
the tag is further configured to detect, after activation, that one or more bits of the stored data have an error;
the tag is further configured to transmit a second signal in response to the detection of the error, the second signal comprising the manufacturing data; and
the reader is further configured to receive the second signal transmitted by the tag. 13. The system of claim 12, wherein the tag is further configured to correct the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted as part of the second signal after the correction is performed. 14. The system of claim 13, wherein the predetermined number is less than three and is small relative to a total number of the bits of the stored data and wherein the ratio of the predetermined number to total number of the bits is 1:16 or 2:16. 15. The system of claim 12, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 16. The system of claim 12, wherein the IC of the tag further comprises an error counter configured to count each error that occurs with the bits of the stored data, wherein a count having the total number of occurred errors is stored in the memory, wherein the count is continually updated, and wherein the second signal includes the count. 17. The system of claim 12, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 18. The system of claim 12, wherein the reader is further configured to transmit the manufacturing data to an entity that designed or manufactured the tag. 19. A radio frequency identification (RFID) tag comprised of an antenna and an integrated circuit (IC), the tag comprising:
a receiver configured to receive, via the antenna, a signal for at least one of activating the tag or interrogating the tag, wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on the stored data; processing logic configured to detect that at least one of the bits of the stored data has an error, wherein the detection is performed after the tag is activated and wherein the processing logic is coupled to the receiver; and a transmitter configured to transmit the manufacturing data in response to the detection of the error, wherein the transmitter is coupled to the processing logic. 20. The tag of claim 19, wherein the processing logic is further configured to correct the detected error, wherein the error is corrected only when less than a predetermined number of the bits of the stored data have the error and wherein the manufacturing data is transmitted after the correction is performed. 21. The tag of claim 19, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 22. The tag of claim 19, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 23. A radio frequency identification (RFID) reader, the reader comprising:
a transmitter configured to transmit a signal activating a tag, wherein the tag comprises an antenna and an integrated circuit (IC), wherein the IC comprises memory storing data associated with the tag, wherein the stored data includes manufacturing data of the tag, and wherein the IC is configured to perform at least one of error detection or error correction on the stored data; a receiver configured to receive a signal comprising information about at least one error that was detected or corrected by the IC of the tag, wherein the at least one error affects one or more bits of the stored data and wherein the signal includes the manufacturing data; a processing system coupled to the transmitter and to the receiver; a network interface configured to transmit a signal comprising the manufacturing data to an entity that designed or manufactured the tag, wherein the network interface is coupled to the processing system. 24. The reader of claim 23, wherein the manufacturing data comprises at least one of:
a wafer number, a manufacturer of the tag, a wafer lot number, a manufacturing process of a wafer comprising a die of the IC, or a location of the die on the wafer. 25. The reader of claim 23, wherein the network interface comprises at least one of:
a Wi-Fi transceiver, an Ethernet transceiver, a cellular telephone transceiver, or a wireless personal area transceiver. 26. The reader of claim 22, wherein the memory is a non-volatile memory and wherein the stored data includes user data that is programmed into the non-volatile memory. 27. The reader of claim 22, wherein the processing system is configured to analyze the manufacturing data to determine whether the at least one error is due to a manufacturing defect. 28. The reader of claim 27, wherein the processing system is further configured to determine, when the at least one error is due the manufacturing defect, a source or a location of the manufacturing defect. 29. The reader of claim 28, wherein the signal transmitted by the network interface further includes the source or the location of the manufacturing defect. | 2,100 |
5,275 | 11,207,606 | 2,166 | Facilitating a search of backup data is disclosed. Data associated with at least a portion of the backup data is received. A searchable index of the backup data is generated based at least in part on the received data. The searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. | 1. A method of facilitating a search of backup data, comprising:
receiving data associated with at least a portion of the backup data; and generating, based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. 2. A method as recited in claim 1, wherein receiving data associated with at least a portion of the backup data includes receiving for each of one or more objects comprising the backup data a content data associated with the object and a location data indicating a location of the object within the backup data. 3. A method as recited in claim 2, wherein the searchable index is generated based at least in part on the content data and the location data. 4. A method as recited in claim 1, further comprising receiving a search request comprising query data associated with the object and using the query data and the searchable index to determine the location of the object within the backup data. 5. A method as recited in claim 4, further comprising presenting a search result associated with the object and receiving in response a request to restore the object using the backup data. 6. A method as recited in claim 5, further comprising restoring the object using the backup data. 7. A method as recited in claim 1, further comprising generating, based at least in part on the backup data, said data associated with at least a portion of the backup data. 8. A method as recited in claim 1, wherein receiving data associated with at least a portion of the backup data comprises receiving substantially contemporaneously with its generation by a backup operation a content data portion of the backup data. 9. A method as recited in claim 1, further comprising using the searchable index to determine the location of the object within the backup data without accessing the backup data. 10. A method as recited in claim 1, further comprising using the searchable index to determine the location of the object within the backup data without first using the backup data to restore a set of production data with which the backup data is associated. 11. A method as recited in claim 1, wherein the object comprises a file, directory, or other file system object. 12. A method as recited in claim 1, wherein the object may exist in one or more locations within the backup data. 13. A method as recited in claim 1, wherein the object and one or more variants thereof may exist in different respective locations within the backup data. 14. A method as recited in claim 1, wherein the object is one of a set of one or more objects comprising the backup data. 15. A method as recited in claim 1, wherein the object is one of a set of one or more objects comprising the backup data and the searchable index includes for each of said one or more objects an index data indicating a location of that object within the backup data. 16. A method as recited in claim 1, wherein the backup data comprises data generated in connection with two or more backup operations performed at different times. 17. A method as recited in claim 1, wherein generating a searchable index includes one or more of the following: decompressing backup data, converting backup data, translating backup data, transferring backup data, indexing backup data, generating keywords associated with backup data, and any processing required for data search and retrieval, on a prescribed basis, periodically, or substantially concurrent with addition, modification, and deletion of the backup data. 18. A method as recited in claim 1, wherein the backup data includes one or more of the following: backup-to-disk data, backup-to-tape data, compressed data, snapshot data, generational backup data, and backup stream data. 19. A method as recited in claim 1, wherein the searchable index is stored in one or more of the following: hard drives, NAS (Network Attached Storage), SAN (Storage Area Network), backup streams, any optical and magnetic storage medium, and any fixed or networked storages. 20. A method as recited in claim 1, wherein the searchable index is stored together with the backup data. 21. A method as recited in claim 1, wherein the location comprises a file path identifier. 22. A method as recited in claim 1, wherein the location is indicated by an identifier that is independent of any physical or logical data location and independent of type of backup data. 23. A method as recited in claim 1, wherein the object may be relocated, converted, translated, or compressed without altering the index data. 24. A method as recited in claim 1, wherein the backup data and a destination to which the object is requested to be restored exist inside a same physical storage unit. 25. A method as recited in claim 1, wherein the backup data and a destination to which the object is requested to be restored are connected together through any public or private or a combination thereof, including an Ethernet, serial/parallel bus, intranet, Internet, NAS, SAN, LAN, WAN, and other forms of connecting multiple systems and or groups of systems together. 26. A method as recited in claim 1, further including using the searchable index to generate a search result including by compiling multiple intermediate search results together. 27. A method as recited in claim 1, further comprising restoring the object to a destination storage including by one or more of the following: translating the index data to one or more locations within the backup data, locating data associated the index data, decompressing data, modifying data, converting data, translating data, and merging data. 28. A system for facilitating a search of a backup data, comprising:
a communication interface configured to receive data associated with at least a portion of the backup data; and a processor configured to generate based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. 29. A system as recited in claim 28, wherein the received data includes a content data associated with one or more objects comprising the at least a portion of the backup data and a location data indicating a location of the one or more objects within the backup data. 30. A system as recited in claim 28, wherein the processor is further configured to generate, based at least in part on the backup data, said data associated with at least a portion of the backup data. 31. A system as recited in claim 28, wherein the communication interface received data associated with at least a portion of the backup data substantially contemporaneously with the data generation by a backup operation a content data portion of the backup data. 32. A system as recited in claim 28, wherein the searchable index is used to determine the location of the object within the backup data without accessing the backup data. 33. A system as recited in claim 28, wherein the searchable index is used to determine the location of the object within the backup data without first using the backup data to restore a set of production data with which the backup data is associated. 34. A computer program product for facilitating a search of backup data, the computer program product being embodied in a computer readable medium and comprising computer instructions for:
receiving data associated with at least a portion of the backup data; and generating, based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. | Facilitating a search of backup data is disclosed. Data associated with at least a portion of the backup data is received. A searchable index of the backup data is generated based at least in part on the received data. The searchable index includes an index data indicating a location within the backup data of an object comprising the backup data.1. A method of facilitating a search of backup data, comprising:
receiving data associated with at least a portion of the backup data; and generating, based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. 2. A method as recited in claim 1, wherein receiving data associated with at least a portion of the backup data includes receiving for each of one or more objects comprising the backup data a content data associated with the object and a location data indicating a location of the object within the backup data. 3. A method as recited in claim 2, wherein the searchable index is generated based at least in part on the content data and the location data. 4. A method as recited in claim 1, further comprising receiving a search request comprising query data associated with the object and using the query data and the searchable index to determine the location of the object within the backup data. 5. A method as recited in claim 4, further comprising presenting a search result associated with the object and receiving in response a request to restore the object using the backup data. 6. A method as recited in claim 5, further comprising restoring the object using the backup data. 7. A method as recited in claim 1, further comprising generating, based at least in part on the backup data, said data associated with at least a portion of the backup data. 8. A method as recited in claim 1, wherein receiving data associated with at least a portion of the backup data comprises receiving substantially contemporaneously with its generation by a backup operation a content data portion of the backup data. 9. A method as recited in claim 1, further comprising using the searchable index to determine the location of the object within the backup data without accessing the backup data. 10. A method as recited in claim 1, further comprising using the searchable index to determine the location of the object within the backup data without first using the backup data to restore a set of production data with which the backup data is associated. 11. A method as recited in claim 1, wherein the object comprises a file, directory, or other file system object. 12. A method as recited in claim 1, wherein the object may exist in one or more locations within the backup data. 13. A method as recited in claim 1, wherein the object and one or more variants thereof may exist in different respective locations within the backup data. 14. A method as recited in claim 1, wherein the object is one of a set of one or more objects comprising the backup data. 15. A method as recited in claim 1, wherein the object is one of a set of one or more objects comprising the backup data and the searchable index includes for each of said one or more objects an index data indicating a location of that object within the backup data. 16. A method as recited in claim 1, wherein the backup data comprises data generated in connection with two or more backup operations performed at different times. 17. A method as recited in claim 1, wherein generating a searchable index includes one or more of the following: decompressing backup data, converting backup data, translating backup data, transferring backup data, indexing backup data, generating keywords associated with backup data, and any processing required for data search and retrieval, on a prescribed basis, periodically, or substantially concurrent with addition, modification, and deletion of the backup data. 18. A method as recited in claim 1, wherein the backup data includes one or more of the following: backup-to-disk data, backup-to-tape data, compressed data, snapshot data, generational backup data, and backup stream data. 19. A method as recited in claim 1, wherein the searchable index is stored in one or more of the following: hard drives, NAS (Network Attached Storage), SAN (Storage Area Network), backup streams, any optical and magnetic storage medium, and any fixed or networked storages. 20. A method as recited in claim 1, wherein the searchable index is stored together with the backup data. 21. A method as recited in claim 1, wherein the location comprises a file path identifier. 22. A method as recited in claim 1, wherein the location is indicated by an identifier that is independent of any physical or logical data location and independent of type of backup data. 23. A method as recited in claim 1, wherein the object may be relocated, converted, translated, or compressed without altering the index data. 24. A method as recited in claim 1, wherein the backup data and a destination to which the object is requested to be restored exist inside a same physical storage unit. 25. A method as recited in claim 1, wherein the backup data and a destination to which the object is requested to be restored are connected together through any public or private or a combination thereof, including an Ethernet, serial/parallel bus, intranet, Internet, NAS, SAN, LAN, WAN, and other forms of connecting multiple systems and or groups of systems together. 26. A method as recited in claim 1, further including using the searchable index to generate a search result including by compiling multiple intermediate search results together. 27. A method as recited in claim 1, further comprising restoring the object to a destination storage including by one or more of the following: translating the index data to one or more locations within the backup data, locating data associated the index data, decompressing data, modifying data, converting data, translating data, and merging data. 28. A system for facilitating a search of a backup data, comprising:
a communication interface configured to receive data associated with at least a portion of the backup data; and a processor configured to generate based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. 29. A system as recited in claim 28, wherein the received data includes a content data associated with one or more objects comprising the at least a portion of the backup data and a location data indicating a location of the one or more objects within the backup data. 30. A system as recited in claim 28, wherein the processor is further configured to generate, based at least in part on the backup data, said data associated with at least a portion of the backup data. 31. A system as recited in claim 28, wherein the communication interface received data associated with at least a portion of the backup data substantially contemporaneously with the data generation by a backup operation a content data portion of the backup data. 32. A system as recited in claim 28, wherein the searchable index is used to determine the location of the object within the backup data without accessing the backup data. 33. A system as recited in claim 28, wherein the searchable index is used to determine the location of the object within the backup data without first using the backup data to restore a set of production data with which the backup data is associated. 34. A computer program product for facilitating a search of backup data, the computer program product being embodied in a computer readable medium and comprising computer instructions for:
receiving data associated with at least a portion of the backup data; and generating, based at least in part on the received data, a searchable index of the backup data; wherein the searchable index includes an index data indicating a location within the backup data of an object comprising the backup data. | 2,100 |
5,276 | 14,285,999 | 2,174 | Embodiments of the present invention provide a method for switching and presenting a terminal operation mode and a terminal, including: acquiring information about a space status change of a terminal; determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, where the operation mode includes a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in the operation interface of the terminal with the right hand; and presenting the operable element in an operation interface of the terminal according to the determined operation mode. Therefore, a user may conveniently switch an operation mode of the terminal to operate the terminal with a single hand. | 1. A method for switching and presenting a terminal operation mode, the method comprising:
acquiring information about a space status change of a terminal; determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, wherein the operation mode comprises a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand; and presenting the operable element in the operation interface of the terminal according to the determined operation mode. 2. The method according to claim 1, wherein determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range. 3. The method according to claim 2, wherein:
acquiring information about a space status change of a terminal comprises:
acquiring a direction of a space status movement change and an amplitude of the space status movement change of the terminal, wherein the direction of the space status movement change of the terminal comprises a leftward movement change or a rightward movement change, the leftward movement change indicates that the terminal moves towards the left hand side of a user of the terminal when the screen of the terminal faces the user of the terminal, and the rightward movement change indicates the terminal moves towards the right hand side of the user of the terminal when the screen of the terminal faces the user of the terminal; and the amplitude of the space status movement change comprises a leftward movement amplitude or a rightward movement amplitude of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
when the amplitude of the space status movement change falls within a preset amplitude change range, determining that the extent of the space status change of the terminal falls within the preset range; and
determining the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the leftward movement change, and
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the rightward movement change. 4. The method according to claim 2, wherein:
acquiring information about a space status change of a terminal comprises:
determining a direction of a space status rotation change and an angle of the space status rotation change of the terminal, wherein the direction of the space status rotation change of the terminal comprises a clockwise rotation direction or a counterclockwise rotation direction, the clockwise rotation direction indicates that the terminal rotates clockwise when the screen of the terminal faces a user of the terminal, the counterclockwise rotation direction indicates that the terminal rotates counterclockwise when the screen of the terminal faces the user of the terminal, and the clockwise rotation and the counterclockwise rotation do not include clockwise rotation and counterclockwise rotation on a plane of the screen of the terminal; and the angle of the space status rotation change comprises a clockwise rotation angle or a counterclockwise rotation angle;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the angle of the space status rotation change falls within a preset angle change range; and
determining an operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the clockwise rotation direction, and
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the counterclockwise rotation direction. 5. The method according to claim 1, wherein determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range. 6. The method according to claim 5, wherein:
acquiring information about a space status change of a terminal comprises:
determining a shake frequency of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; and
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
acquiring a current operation mode of the terminal, wherein the current operation mode comprising a first operation mode or a second operation mode; determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the first operation mode; and determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the second operation mode. 7. The method according to claim 5, wherein:
acquiring information about a space status change of a terminal comprises:
determining a shake frequency of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range;
prior to determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, the method further comprises:
acquiring holding position information, wherein the holding position information comprises left-hand holding or right-hand holding; and
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the holding information is the right-hand holding; and
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the holding information is the left-hand holding. 8. The method according to claim 1, wherein that the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand comprises:
the operable element in the operation interface is closer to a left edge of the display interface in the first operation mode than in the second operation mode; and the operable element in the operation interface is closer to a right edge of the display interface in the second operation mode than in the first operation mode. 9. The method according to claim 1, wherein that the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand comprises:
the operable element on the operation interface is adjacent to a left edge of the display interface of the terminal in the first operation mode; and the operable element on the operation interface is adjacent to a right edge of the display interface of the terminal in the second operation mode. 10. The method according to claim 1, wherein the operable element in the operation interface comprises a virtual keyboard, one or a plurality of keys on the virtual keyboard, a menu, or a dialog box. 11. A terminal, comprising:
a motion sensing unit, configured to acquire a space status parameter of the terminal; a processing unit, configured to acquire information about a space status change of the terminal according to the space status parameter acquired by the motion sensing unit; a judging unit, configured to determine whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; a mode determining unit, configured to determine an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, wherein the operation mode comprises a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand; and a display unit, configured to display the operable element in the operation interface of the terminal according to the determined operation mode. 12. The terminal according to claim 11, wherein:
the mode determining unit is configured to determine the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change. 13. The terminal according to claim 12, wherein:
the processing unit is configured to acquire a direction of a space status movement change and an amplitude of a space status movement change of the terminal, wherein: the direction of the space status movement change of the terminal comprises a leftward movement change or a rightward movement change, the leftward movement change indicates that the terminal moves towards the left hand side of a user of the terminal when the screen of the terminal faces the user of the terminal, and the rightward movement change indicates that the terminal moves towards the right hand side of the user when the screen of the terminal faces the user of the terminal; and the amplitude of the space status movement change comprises a leftward movement amplitude or a rightward movement amplitude of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the amplitude of the space status change of the terminal falls within a preset amplitude change range; and the mode determining unit is configured to determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the leftward movement change; and determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the rightward movement change. 14. The terminal according to claim 12, wherein:
the processing unit is configured to determine a direction of a space status rotation change and an angle of the space status rotation change of the terminal, wherein the direction of the space status rotation change of the terminal comprises a clockwise rotation direction or a counterclockwise rotation direction, the clockwise rotation direction indicates that the terminal rotates clockwise when the screen of the terminal faces a user of the terminal, the counterclockwise rotation direction indicates that the terminal rotates counterclockwise when the screen of the terminal faces the user of the terminal, and the clockwise rotation and the counterclockwise rotation do not include clockwise rotation and counter-clockwise rotation on a plane of the screen of the terminal; and the angle of the space status rotation change comprises a clockwise rotation angle or a counterclockwise rotation angle; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the angle of the space status rotation change falls within a preset angle change range; and the mode determining unit is configured to determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the clockwise rotation direction, and determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the counterclockwise rotation direction. 15. The terminal according to claim 11, wherein:
the mode determining unit is configured to determine the operation mode by acquiring current information on a left-hand operation or a right-hand operation on the terminal. 16. The terminal according to claim 15, wherein:
the processing unit is configured to determine a shake frequency of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; and the mode determining unit is configured to: acquire a current operation mode of the terminal, wherein the current operation mode comprises a first operation mode or a second operation mode; determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the first operation mode; and determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the second operation mode. 17. The terminal according to claim 15, wherein:
the processing unit is configured to determine a shake frequency of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; the processing unit is further configured to acquire holding position information, wherein the holding position information comprises left-hand holding or right-hand holding; and the mode determining unit is configured to determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the holding position information is the right-hand holding, and determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the holding position information is the left-hand holding. 18. The terminal according to claim 11, wherein:
the display unit is configured to display the operable element in an operation interface closer to a left edge of the display interface of the terminal in the first operation mode than in the second operation mode; and the display unit is configured to display the operable element in an operation interface closer to a right edge of the display interface of the terminal in the second operation mode than in the first operation mode. 19. The terminal according to claim 11, wherein:
the display unit is specifically configured to display the operable element in an operation interface adjacent to a left edge of the display interface of the terminal in the first operation mode; and the display unit is configured to display the operable element on an operation interface adjacent to a right edge of the display interface of the terminal in the second operation mode. | Embodiments of the present invention provide a method for switching and presenting a terminal operation mode and a terminal, including: acquiring information about a space status change of a terminal; determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, where the operation mode includes a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in the operation interface of the terminal with the right hand; and presenting the operable element in an operation interface of the terminal according to the determined operation mode. Therefore, a user may conveniently switch an operation mode of the terminal to operate the terminal with a single hand.1. A method for switching and presenting a terminal operation mode, the method comprising:
acquiring information about a space status change of a terminal; determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, wherein the operation mode comprises a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand; and presenting the operable element in the operation interface of the terminal according to the determined operation mode. 2. The method according to claim 1, wherein determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range. 3. The method according to claim 2, wherein:
acquiring information about a space status change of a terminal comprises:
acquiring a direction of a space status movement change and an amplitude of the space status movement change of the terminal, wherein the direction of the space status movement change of the terminal comprises a leftward movement change or a rightward movement change, the leftward movement change indicates that the terminal moves towards the left hand side of a user of the terminal when the screen of the terminal faces the user of the terminal, and the rightward movement change indicates the terminal moves towards the right hand side of the user of the terminal when the screen of the terminal faces the user of the terminal; and the amplitude of the space status movement change comprises a leftward movement amplitude or a rightward movement amplitude of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
when the amplitude of the space status movement change falls within a preset amplitude change range, determining that the extent of the space status change of the terminal falls within the preset range; and
determining the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the leftward movement change, and
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the rightward movement change. 4. The method according to claim 2, wherein:
acquiring information about a space status change of a terminal comprises:
determining a direction of a space status rotation change and an angle of the space status rotation change of the terminal, wherein the direction of the space status rotation change of the terminal comprises a clockwise rotation direction or a counterclockwise rotation direction, the clockwise rotation direction indicates that the terminal rotates clockwise when the screen of the terminal faces a user of the terminal, the counterclockwise rotation direction indicates that the terminal rotates counterclockwise when the screen of the terminal faces the user of the terminal, and the clockwise rotation and the counterclockwise rotation do not include clockwise rotation and counterclockwise rotation on a plane of the screen of the terminal; and the angle of the space status rotation change comprises a clockwise rotation angle or a counterclockwise rotation angle;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the angle of the space status rotation change falls within a preset angle change range; and
determining an operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the clockwise rotation direction, and
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the counterclockwise rotation direction. 5. The method according to claim 1, wherein determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range. 6. The method according to claim 5, wherein:
acquiring information about a space status change of a terminal comprises:
determining a shake frequency of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; and
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
acquiring a current operation mode of the terminal, wherein the current operation mode comprising a first operation mode or a second operation mode; determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the first operation mode; and determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the second operation mode. 7. The method according to claim 5, wherein:
acquiring information about a space status change of a terminal comprises:
determining a shake frequency of the terminal;
determining whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change comprises:
determining that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range;
prior to determining an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, the method further comprises:
acquiring holding position information, wherein the holding position information comprises left-hand holding or right-hand holding; and
determining the operation mode by acquiring current information about a left-hand operation or a right-hand operation on the terminal when the extent of the space status change of the terminal falls within the preset range comprises:
determining that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the holding information is the right-hand holding; and
determining that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the holding information is the left-hand holding. 8. The method according to claim 1, wherein that the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand comprises:
the operable element in the operation interface is closer to a left edge of the display interface in the first operation mode than in the second operation mode; and the operable element in the operation interface is closer to a right edge of the display interface in the second operation mode than in the first operation mode. 9. The method according to claim 1, wherein that the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand comprises:
the operable element on the operation interface is adjacent to a left edge of the display interface of the terminal in the first operation mode; and the operable element on the operation interface is adjacent to a right edge of the display interface of the terminal in the second operation mode. 10. The method according to claim 1, wherein the operable element in the operation interface comprises a virtual keyboard, one or a plurality of keys on the virtual keyboard, a menu, or a dialog box. 11. A terminal, comprising:
a motion sensing unit, configured to acquire a space status parameter of the terminal; a processing unit, configured to acquire information about a space status change of the terminal according to the space status parameter acquired by the motion sensing unit; a judging unit, configured to determine whether an extent of the space status change of the terminal falls within a preset range according to the information about the space status change; a mode determining unit, configured to determine an operation mode of the terminal when the extent of the space status change of the terminal falls within the preset range, wherein the operation mode comprises a first operation mode or a second operation mode, the first operation mode facilitates an operation on an operable element in an operation interface of the terminal with the left hand, and the second operation mode facilitates an operation on an operable element in an operation interface of the terminal with the right hand; and a display unit, configured to display the operable element in the operation interface of the terminal according to the determined operation mode. 12. The terminal according to claim 11, wherein:
the mode determining unit is configured to determine the operation mode by using a direction of the space status change of the terminal acquired according to the information about the space status change. 13. The terminal according to claim 12, wherein:
the processing unit is configured to acquire a direction of a space status movement change and an amplitude of a space status movement change of the terminal, wherein: the direction of the space status movement change of the terminal comprises a leftward movement change or a rightward movement change, the leftward movement change indicates that the terminal moves towards the left hand side of a user of the terminal when the screen of the terminal faces the user of the terminal, and the rightward movement change indicates that the terminal moves towards the right hand side of the user when the screen of the terminal faces the user of the terminal; and the amplitude of the space status movement change comprises a leftward movement amplitude or a rightward movement amplitude of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the amplitude of the space status change of the terminal falls within a preset amplitude change range; and the mode determining unit is configured to determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the leftward movement change; and determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status movement change of the terminal is the rightward movement change. 14. The terminal according to claim 12, wherein:
the processing unit is configured to determine a direction of a space status rotation change and an angle of the space status rotation change of the terminal, wherein the direction of the space status rotation change of the terminal comprises a clockwise rotation direction or a counterclockwise rotation direction, the clockwise rotation direction indicates that the terminal rotates clockwise when the screen of the terminal faces a user of the terminal, the counterclockwise rotation direction indicates that the terminal rotates counterclockwise when the screen of the terminal faces the user of the terminal, and the clockwise rotation and the counterclockwise rotation do not include clockwise rotation and counter-clockwise rotation on a plane of the screen of the terminal; and the angle of the space status rotation change comprises a clockwise rotation angle or a counterclockwise rotation angle; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the angle of the space status rotation change falls within a preset angle change range; and the mode determining unit is configured to determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the clockwise rotation direction, and determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the direction of the space status rotation change of the terminal is the counterclockwise rotation direction. 15. The terminal according to claim 11, wherein:
the mode determining unit is configured to determine the operation mode by acquiring current information on a left-hand operation or a right-hand operation on the terminal. 16. The terminal according to claim 15, wherein:
the processing unit is configured to determine a shake frequency of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; and the mode determining unit is configured to: acquire a current operation mode of the terminal, wherein the current operation mode comprises a first operation mode or a second operation mode; determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the first operation mode; and determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the acquired current operation mode is the second operation mode. 17. The terminal according to claim 15, wherein:
the processing unit is configured to determine a shake frequency of the terminal; the judging unit is configured to determine that the extent of the space status change of the terminal falls within the preset range when the shake frequency of the terminal falls within a preset frequency change range; the processing unit is further configured to acquire holding position information, wherein the holding position information comprises left-hand holding or right-hand holding; and the mode determining unit is configured to determine that the operation mode is the second operation mode when the extent of the space status change of the terminal falls within the preset range and the holding position information is the right-hand holding, and determine that the operation mode is the first operation mode when the extent of the space status change of the terminal falls within the preset range and the holding position information is the left-hand holding. 18. The terminal according to claim 11, wherein:
the display unit is configured to display the operable element in an operation interface closer to a left edge of the display interface of the terminal in the first operation mode than in the second operation mode; and the display unit is configured to display the operable element in an operation interface closer to a right edge of the display interface of the terminal in the second operation mode than in the first operation mode. 19. The terminal according to claim 11, wherein:
the display unit is specifically configured to display the operable element in an operation interface adjacent to a left edge of the display interface of the terminal in the first operation mode; and the display unit is configured to display the operable element on an operation interface adjacent to a right edge of the display interface of the terminal in the second operation mode. | 2,100 |
5,277 | 14,178,344 | 2,195 | A retrofit water boiler monitoring and forecast system, method and computer program product, for a water boiler system which includes a water boiler, a cold-water pipe, a hot-water pipe, including: an intake temperature sensor, configured to measure a water temperature in the cold-water intake pipe; a flow meter, configured to measure a flow rate of water running through the water boiler system; an outlet temperature sensor, configured to measure a water temperature in the hot-water outlet pipe; a processing unit, adapted to receive sensor data from the intake temperature sensor, flow meter, and outlet temperature sensor, and configured to calculate an amount of available hot water in the water boiler based on the sensor data; and a display panel coupled to the processing unit configured to display at least one estimated Real-Time Usage Value, calculated by the processing unit based on the amount of available hot water. | 1. A retrofit water boiler monitoring and forecast system, for a water boiler system which includes a water boiler, a cold-water intake pipe, a hot-water outlet pipe, the retrofit system comprising:
(a) an intake temperature sensor, configured to measure a water temperature in the cold-water intake pipe; (b) a flow meter, configured to measure a flow rate of water running through the water boiler system; (c) an outlet temperature sensor, configured to measure a water temperature in the hot-water outlet pipe; (d) a processing unit, adapted to receive sensor data from said intake temperature sensor, said flow meter, and said outlet temperature sensor, and configured to calculate an amount of available hot water in the water boiler, based on said sensor data; and (e) a display panel operationally coupled to said processing unit, said display panel configured to display at least one estimated Real-Time Usage Value (RTUV), calculated by said processing unit based on said amount of available hot water. 2. The retrofit system of claim 1, further comprising:
(f) a control panel operationally coupled to said processing unit, including a user interface adapted to receive instructions for programming and controlling said processing unit. 3. The retrofit system of claim 2, wherein said control panel is operationally coupled to an activation switch of the water boiler. 4. The retrofit system of claim 1, wherein said processing unit includes: a non-transient memory adapted to retrievably store usage data, said usage data including said sensor data recorded over time. 5. The retrofit system of claim 1, wherein said display panel is adapted to be mounted in a bathing area. 6. The retrofit system of claim 1, wherein said at least one estimated RTUV is an estimated amount of time remaining during which said hot water will be available, based on said flow rate. 7. The retrofit system of claim 1, wherein said at least one estimated RTUV includes a number of distinct hot-water activities that can be completed with said amount of available hot water. 8. The retrofit system of claim 7, wherein another estimated RTUV displayed on said display panel includes a measure of time remaining for completing one of said distinct hot water activities, based on said flow rate. 9. The retrofit system of claim 1, wherein said at least one Real-Time Usage Value includes a measure of time remaining before a requisite amount of hot water is available. 10. The retrofit system of claim 4, wherein said at least one Real-Time Usage Value includes an indication of a working condition of a heating element of the water boiler system. 11. The retrofit system of claim 10, wherein said working condition of said heating element is calculated based on said sensor data compared to said usage data. 12. The retrofit system of claim 4, wherein said processing unit includes logic for calculating said amount of available hot water, said logic including an adaptive learning algorithm configured to learn characteristics of the water boiler system based on said usage data stored in said non-transient memory. 13. The retrofit system of claim 12, wherein said amount of available hot water is calculated based on said learned characteristics of the water boiler system. 14. The retrofit system of claim 13, wherein said amount of available hot water is further calculated based on learned usage characteristics of the water boiler. 15. The retrofit system of claim 12, wherein said processor calculates a relative level of efficiency of a heating element of the water boiler system, based on said learned characteristics of the water boiler system. 16. The retrofit system of claim 4, wherein said processing unit includes logic for calculating said amount of available hot water, said logic including an adaptive learning algorithm configured to learn usage characteristics of the water boiler based on said usage data. 17. The retrofit system of claim 16, wherein said amount of available hot water is further calculated based on learned characteristics of the water boiler. 18. The retrofit system of claim 1, wherein said processing unit includes logic configured to detect a leak in the water boiler system, based on said sensor data. 19. The retrofit system of claim 1, wherein said processing unit is configured to distinguish between sources of hot-water usage. 20. The retrofit system of claim 1, further adapted for use with a water boiler system including a solar collector, the retrofit system further comprising at least one of:
(i) a second flow meter adapted to measure water flow through said solar collector operationally coupled to the water boiler; (ii) a solar collector outlet sensor adapted to measure temperature of water flowing from said solar collector to the water boiler; and (iii) a solar collector intake sensor adapted to measure temperature of water flowing from the water boiler to said solar collector. 21. The retrofit system of claim 20, further comprising a photo voltaic (PV) cell, said PV cell being adapted to provide solar-related data. 22. The retrofit system of claim 21, wherein said PV cell further produces usable energy. 23. A method for providing a real-time estimate of available hot water in a hot water boiler, the method comprising the steps of:
(a) receiving flow data; (b) receiving an outlet temperature measurement of water in a boiler outlet pipe; and (c) receiving an intake temperature measurement of water in a boiler intake pipe; (d) calculating an estimated amount of hot water in the boiler based on said flow data, outlet temperature measurement and intake temperature measurement. 24. The method of claim 23, further comprising the step of:
(e) receiving a thermostat value, prior to step (d). 25. The method of claim 23, wherein said flow data includes at least one of: a flow rate value and a flow duration value. 26. A method for calculating an estimated amount of hot water in a water boiler, the method comprising the steps of:
(a) receiving sensor data over a predetermined time interval, said sensor data including at least: flow data, an outlet temperature measurement of water in a boiler outlet pipe and an intake temperature measurement of water in a boiler intake pipe; (b) comparing said received sensor data with stored sensor data; and (c) calculating, based on said comparison, an approximate amount of available hot water in the water boiler. 27. The method of claim 26, further comprising the step of:
(d) storing said received sensor data on a non-transient storage medium. 28. The method of claim 27, wherein said stored sensor data includes aggregated sensor data. 29. The method of claim 27, further comprising the step of:
(d) analyzing said flow sensor data so as to extrapolate usage data. 30. The method of claim 29, wherein said usage data includes:
(i) distinct usage activities, (ii) usage patterns for said distinct usage activities. 31. The method of claim 30, further comprising the steps of:
(e) calculating, based on said estimated amount of available hot water and said usage patterns, an amount of said distinct usage activities that can be effected; and (f) displaying said amount of distinct usage activities that can be effected. 32. The method of claim 30, further comprising the steps of:
(e) forecasting, based on said estimated amount of available hot water and said flow sensor data, an amount of time delta for which hot water will be available from the water boiler; and (f) displaying said time delta. 33. The method of claim 26, further comprising the step of:
(d) analyzing said sensor data to extrapolate water boiler characteristics. 34. The method of claim 33, wherein said water boiler characteristics include at least one of:
(i) boiler efficiency, (ii) heating time, (iii) water leakage, and (iv) environmental affect on said heating time. 36. A computer program product embodied on a non-transitory storage medium and executed via a processor for effecting the steps of claim 31. 37. The retrofit system of claim 22, wherein said usable energy is adapted to power at least the retrofit system. | A retrofit water boiler monitoring and forecast system, method and computer program product, for a water boiler system which includes a water boiler, a cold-water pipe, a hot-water pipe, including: an intake temperature sensor, configured to measure a water temperature in the cold-water intake pipe; a flow meter, configured to measure a flow rate of water running through the water boiler system; an outlet temperature sensor, configured to measure a water temperature in the hot-water outlet pipe; a processing unit, adapted to receive sensor data from the intake temperature sensor, flow meter, and outlet temperature sensor, and configured to calculate an amount of available hot water in the water boiler based on the sensor data; and a display panel coupled to the processing unit configured to display at least one estimated Real-Time Usage Value, calculated by the processing unit based on the amount of available hot water.1. A retrofit water boiler monitoring and forecast system, for a water boiler system which includes a water boiler, a cold-water intake pipe, a hot-water outlet pipe, the retrofit system comprising:
(a) an intake temperature sensor, configured to measure a water temperature in the cold-water intake pipe; (b) a flow meter, configured to measure a flow rate of water running through the water boiler system; (c) an outlet temperature sensor, configured to measure a water temperature in the hot-water outlet pipe; (d) a processing unit, adapted to receive sensor data from said intake temperature sensor, said flow meter, and said outlet temperature sensor, and configured to calculate an amount of available hot water in the water boiler, based on said sensor data; and (e) a display panel operationally coupled to said processing unit, said display panel configured to display at least one estimated Real-Time Usage Value (RTUV), calculated by said processing unit based on said amount of available hot water. 2. The retrofit system of claim 1, further comprising:
(f) a control panel operationally coupled to said processing unit, including a user interface adapted to receive instructions for programming and controlling said processing unit. 3. The retrofit system of claim 2, wherein said control panel is operationally coupled to an activation switch of the water boiler. 4. The retrofit system of claim 1, wherein said processing unit includes: a non-transient memory adapted to retrievably store usage data, said usage data including said sensor data recorded over time. 5. The retrofit system of claim 1, wherein said display panel is adapted to be mounted in a bathing area. 6. The retrofit system of claim 1, wherein said at least one estimated RTUV is an estimated amount of time remaining during which said hot water will be available, based on said flow rate. 7. The retrofit system of claim 1, wherein said at least one estimated RTUV includes a number of distinct hot-water activities that can be completed with said amount of available hot water. 8. The retrofit system of claim 7, wherein another estimated RTUV displayed on said display panel includes a measure of time remaining for completing one of said distinct hot water activities, based on said flow rate. 9. The retrofit system of claim 1, wherein said at least one Real-Time Usage Value includes a measure of time remaining before a requisite amount of hot water is available. 10. The retrofit system of claim 4, wherein said at least one Real-Time Usage Value includes an indication of a working condition of a heating element of the water boiler system. 11. The retrofit system of claim 10, wherein said working condition of said heating element is calculated based on said sensor data compared to said usage data. 12. The retrofit system of claim 4, wherein said processing unit includes logic for calculating said amount of available hot water, said logic including an adaptive learning algorithm configured to learn characteristics of the water boiler system based on said usage data stored in said non-transient memory. 13. The retrofit system of claim 12, wherein said amount of available hot water is calculated based on said learned characteristics of the water boiler system. 14. The retrofit system of claim 13, wherein said amount of available hot water is further calculated based on learned usage characteristics of the water boiler. 15. The retrofit system of claim 12, wherein said processor calculates a relative level of efficiency of a heating element of the water boiler system, based on said learned characteristics of the water boiler system. 16. The retrofit system of claim 4, wherein said processing unit includes logic for calculating said amount of available hot water, said logic including an adaptive learning algorithm configured to learn usage characteristics of the water boiler based on said usage data. 17. The retrofit system of claim 16, wherein said amount of available hot water is further calculated based on learned characteristics of the water boiler. 18. The retrofit system of claim 1, wherein said processing unit includes logic configured to detect a leak in the water boiler system, based on said sensor data. 19. The retrofit system of claim 1, wherein said processing unit is configured to distinguish between sources of hot-water usage. 20. The retrofit system of claim 1, further adapted for use with a water boiler system including a solar collector, the retrofit system further comprising at least one of:
(i) a second flow meter adapted to measure water flow through said solar collector operationally coupled to the water boiler; (ii) a solar collector outlet sensor adapted to measure temperature of water flowing from said solar collector to the water boiler; and (iii) a solar collector intake sensor adapted to measure temperature of water flowing from the water boiler to said solar collector. 21. The retrofit system of claim 20, further comprising a photo voltaic (PV) cell, said PV cell being adapted to provide solar-related data. 22. The retrofit system of claim 21, wherein said PV cell further produces usable energy. 23. A method for providing a real-time estimate of available hot water in a hot water boiler, the method comprising the steps of:
(a) receiving flow data; (b) receiving an outlet temperature measurement of water in a boiler outlet pipe; and (c) receiving an intake temperature measurement of water in a boiler intake pipe; (d) calculating an estimated amount of hot water in the boiler based on said flow data, outlet temperature measurement and intake temperature measurement. 24. The method of claim 23, further comprising the step of:
(e) receiving a thermostat value, prior to step (d). 25. The method of claim 23, wherein said flow data includes at least one of: a flow rate value and a flow duration value. 26. A method for calculating an estimated amount of hot water in a water boiler, the method comprising the steps of:
(a) receiving sensor data over a predetermined time interval, said sensor data including at least: flow data, an outlet temperature measurement of water in a boiler outlet pipe and an intake temperature measurement of water in a boiler intake pipe; (b) comparing said received sensor data with stored sensor data; and (c) calculating, based on said comparison, an approximate amount of available hot water in the water boiler. 27. The method of claim 26, further comprising the step of:
(d) storing said received sensor data on a non-transient storage medium. 28. The method of claim 27, wherein said stored sensor data includes aggregated sensor data. 29. The method of claim 27, further comprising the step of:
(d) analyzing said flow sensor data so as to extrapolate usage data. 30. The method of claim 29, wherein said usage data includes:
(i) distinct usage activities, (ii) usage patterns for said distinct usage activities. 31. The method of claim 30, further comprising the steps of:
(e) calculating, based on said estimated amount of available hot water and said usage patterns, an amount of said distinct usage activities that can be effected; and (f) displaying said amount of distinct usage activities that can be effected. 32. The method of claim 30, further comprising the steps of:
(e) forecasting, based on said estimated amount of available hot water and said flow sensor data, an amount of time delta for which hot water will be available from the water boiler; and (f) displaying said time delta. 33. The method of claim 26, further comprising the step of:
(d) analyzing said sensor data to extrapolate water boiler characteristics. 34. The method of claim 33, wherein said water boiler characteristics include at least one of:
(i) boiler efficiency, (ii) heating time, (iii) water leakage, and (iv) environmental affect on said heating time. 36. A computer program product embodied on a non-transitory storage medium and executed via a processor for effecting the steps of claim 31. 37. The retrofit system of claim 22, wherein said usable energy is adapted to power at least the retrofit system. | 2,100 |
5,278 | 14,170,364 | 2,164 | Content maintained in a first repository of a first installation (which can optionally be an on-premise installation) of a content management system, as well as metadata associated with the content, can be shared via an approach in which content items maintained in the first repository are synchronized with a copy of the content items maintained in a second repository of a second installation (which can optionally be a cloud-based installation). The first installation can be optionally firewall protected. The copy of the content items can be accessed by collaborative users both within and external to a firewall. Related systems, methods, products, etc. are described. | 1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations of a first installation of a content management system, the operations comprising:
establishing authentication between a first repository managed by the first installation and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 2. A computer program product as in claim 1, wherein the access controls are defined based on either or both of an input from an internal user of the first installation who initiates the linking of the content item and the copy of the content item, and an access permission defined for an existing structure at the second installation that is designated as a destination for the copy of the content item. 3. A computer program product as in claim 1, wherein the linking further comprises:
adding the content item to a synchronization set; associating a marker aspect with the content item at the first repository when the content item is added to the synchronization set; and adding an entry in a first audit log for the synchronization indicating addition of the content item the synchronization set, the adding of the entry triggering a first push synchronization to the second installation to create the copy of the content item at the second repository. 4. A computer program product as in claim 3, wherein the operations further comprise: unsynchronizing the copy of the content item and the content item, the unsynchronizing comprising removing the marker aspect from the content item at the first repository and adding an unsynchronization record to the first audit log. 5. A computer program product as in claim 4, wherein the unsynchronizing further comprises pushing a removal node from the first installation to the second installation, the removal node causing the second installation to delete the copy of the content item upon receipt of the removal node. 6. A computer program product as in claim 4, wherein the unsynchronizing further comprises pushing a removal node from the first installation to the second installation, the removal node causing the second installation to retain the copy of the content item without further reporting of changes made to the copy back to the first installation. 7. A computer program product as in claim 1, wherein the synchronizing occurs periodically and comprises receiving from the second installation a change manifest generated from a second audit log that records changes to the copy of the content item at the second repository occurring since a previous synchronization and reading from a first audit log that records changes to the content item at the first repository occurring since the previous synchronization. 8. A computer program product as in claim 7, wherein the pull further comprises querying the second audit log from the first installation and the push further comprises sending information from the first audit log to the second installation. 9. A computer program product as in claim 1, wherein the first installation serves as a system of record for changes to the content item and the second installation serves as a system of engagement where collaborative changes to the copy of the content item occur. 10. A computer program product as in claim 1, wherein the content item and the copy of the content item comprise one or more of a file, a folder, and a directory structure. 11. A computer program product as in claim 1, wherein the linking further comprises creating a synchronization set defining content for synchronization between the first repository and the second repository, the defining comprising selecting the content item for inclusion in the synchronization set and a destination in the second repository to which the content item in the synchronization set is to be synchronized. 12. A computer program product as in claim 1, wherein the first repository comprises an on-premise repository protected from access by external users by a firewall, and the second repository comprises a cloud-based tenant repository outside of the firewall. 13. A computer program product as in claim 12, wherein the cloud-based tenant repository comprises a plurality of sites, and wherein a synchronization set defines content for synchronization between the first repository and the second repository, the synchronization set comprising the content item for inclusion in the synchronization set and a site of the plurality of sites in the second repository as a destination to which the content item in the synchronization set is to be synchronized 14. A computer program product as in claim 1, wherein the synchronizing further comprises:
sending a request for a change manifest from the first installation to the second installation, the request comprising a repository identifier identifying the first repository; receiving the change manifest from the second repository at the first repository, the change manifest comprising a synchronization set identifier identifying a changed synchronization set of the one or more synchronization sets, the changed synchronization set comprising the content item which has had its copy changed at the second repository subsequent to a previous synchronization between the first repository and the second repository; requesting from the second repository based on the change manifest, a detailed record of changes made at the second repository to the content item identified by the content item identifier; and receiving, at the first repository from the second repository, a set of change descriptions comprising the detailed record of changes. 15. A computer program product as in claim 1, wherein the establishing authentication comprises verifying that an internal user of the first installation has authorized access to a destination for the copy of the content item at the second installation, the verifying comprising at least one of receiving authentication credentials provided by the first user and retrieving the authentication credentials from a credentials store. 16. A system comprising:
computer hardware configured to perform operations of a first installation of a content management system, the operations comprising: establishing authentication between a first repository managed by the first installation and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 17. A system as in claim 14, wherein the computer hardware comprises at least one programmable processor and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform the operations. 18. A system as in claim 16, wherein the linking further comprises:
adding the content item to a synchronization set; associating a marker aspect with the content item at the first repository when the content item is added to the synchronization set; and adding an entry in a first audit log for the synchronization indicating addition of the content item the synchronization set, the adding of the entry triggering a first push synchronization to the second installation to create the copy of the content item at the second repository. 19. A system as in claim 16, wherein the first repository comprises an on-premise repository protected from access by external users by a firewall, and the second repository comprises a cloud-based tenant repository outside of the firewall. 20. A system as in claim 19, wherein the cloud-based tenant repository comprises a plurality of sites, and wherein a synchronization set defines content for synchronization between the first repository and the second repository, the synchronization set comprising the content item for inclusion in the synchronization set and a site of the plurality of sites in the second repository as a destination to which the content item in the synchronization set is to be synchronized. 21. A system as in claim 16, wherein the synchronizing further comprises:
sending a request for a change manifest from the first installation to the second installation, the request comprising a repository identifier identifying the first repository; receiving the change manifest from the second repository at the first repository, the change manifest comprising a synchronization set identifier identifying a changed synchronization set of the one or more synchronization sets, the changed synchronization set comprising the content item which has had its copy changed at the second repository subsequent to a previous synchronization between the first repository and the second repository; requesting from the second repository based on the change manifest, a detailed record of changes made at the second repository to the content item identified by the content item identifier; and receiving, at the first repository from the second repository, a set of change descriptions comprising the detailed record of changes. 22. A computer-implemented method comprising:
establishing authentication between a first repository managed by a first installation of a content management system and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 23. A computer-implemented method comprising:
receiving, by a second installation of a content management system from a first installation of the content management, confirmation that a first repository managed by the first installation of the content management system has established authentication with a second repository managed by the second installation, the first installation being protected by a firewall preventing access to the first repository by an external user; receiving, at the second installation, a link of a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via receipt by the second installation of a push from the first installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and by the second installation responding to a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. | Content maintained in a first repository of a first installation (which can optionally be an on-premise installation) of a content management system, as well as metadata associated with the content, can be shared via an approach in which content items maintained in the first repository are synchronized with a copy of the content items maintained in a second repository of a second installation (which can optionally be a cloud-based installation). The first installation can be optionally firewall protected. The copy of the content items can be accessed by collaborative users both within and external to a firewall. Related systems, methods, products, etc. are described.1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations of a first installation of a content management system, the operations comprising:
establishing authentication between a first repository managed by the first installation and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 2. A computer program product as in claim 1, wherein the access controls are defined based on either or both of an input from an internal user of the first installation who initiates the linking of the content item and the copy of the content item, and an access permission defined for an existing structure at the second installation that is designated as a destination for the copy of the content item. 3. A computer program product as in claim 1, wherein the linking further comprises:
adding the content item to a synchronization set; associating a marker aspect with the content item at the first repository when the content item is added to the synchronization set; and adding an entry in a first audit log for the synchronization indicating addition of the content item the synchronization set, the adding of the entry triggering a first push synchronization to the second installation to create the copy of the content item at the second repository. 4. A computer program product as in claim 3, wherein the operations further comprise: unsynchronizing the copy of the content item and the content item, the unsynchronizing comprising removing the marker aspect from the content item at the first repository and adding an unsynchronization record to the first audit log. 5. A computer program product as in claim 4, wherein the unsynchronizing further comprises pushing a removal node from the first installation to the second installation, the removal node causing the second installation to delete the copy of the content item upon receipt of the removal node. 6. A computer program product as in claim 4, wherein the unsynchronizing further comprises pushing a removal node from the first installation to the second installation, the removal node causing the second installation to retain the copy of the content item without further reporting of changes made to the copy back to the first installation. 7. A computer program product as in claim 1, wherein the synchronizing occurs periodically and comprises receiving from the second installation a change manifest generated from a second audit log that records changes to the copy of the content item at the second repository occurring since a previous synchronization and reading from a first audit log that records changes to the content item at the first repository occurring since the previous synchronization. 8. A computer program product as in claim 7, wherein the pull further comprises querying the second audit log from the first installation and the push further comprises sending information from the first audit log to the second installation. 9. A computer program product as in claim 1, wherein the first installation serves as a system of record for changes to the content item and the second installation serves as a system of engagement where collaborative changes to the copy of the content item occur. 10. A computer program product as in claim 1, wherein the content item and the copy of the content item comprise one or more of a file, a folder, and a directory structure. 11. A computer program product as in claim 1, wherein the linking further comprises creating a synchronization set defining content for synchronization between the first repository and the second repository, the defining comprising selecting the content item for inclusion in the synchronization set and a destination in the second repository to which the content item in the synchronization set is to be synchronized. 12. A computer program product as in claim 1, wherein the first repository comprises an on-premise repository protected from access by external users by a firewall, and the second repository comprises a cloud-based tenant repository outside of the firewall. 13. A computer program product as in claim 12, wherein the cloud-based tenant repository comprises a plurality of sites, and wherein a synchronization set defines content for synchronization between the first repository and the second repository, the synchronization set comprising the content item for inclusion in the synchronization set and a site of the plurality of sites in the second repository as a destination to which the content item in the synchronization set is to be synchronized 14. A computer program product as in claim 1, wherein the synchronizing further comprises:
sending a request for a change manifest from the first installation to the second installation, the request comprising a repository identifier identifying the first repository; receiving the change manifest from the second repository at the first repository, the change manifest comprising a synchronization set identifier identifying a changed synchronization set of the one or more synchronization sets, the changed synchronization set comprising the content item which has had its copy changed at the second repository subsequent to a previous synchronization between the first repository and the second repository; requesting from the second repository based on the change manifest, a detailed record of changes made at the second repository to the content item identified by the content item identifier; and receiving, at the first repository from the second repository, a set of change descriptions comprising the detailed record of changes. 15. A computer program product as in claim 1, wherein the establishing authentication comprises verifying that an internal user of the first installation has authorized access to a destination for the copy of the content item at the second installation, the verifying comprising at least one of receiving authentication credentials provided by the first user and retrieving the authentication credentials from a credentials store. 16. A system comprising:
computer hardware configured to perform operations of a first installation of a content management system, the operations comprising: establishing authentication between a first repository managed by the first installation and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 17. A system as in claim 14, wherein the computer hardware comprises at least one programmable processor and a machine-readable medium storing instructions that, when executed by the at least one processor, cause the at least one programmable processor to perform the operations. 18. A system as in claim 16, wherein the linking further comprises:
adding the content item to a synchronization set; associating a marker aspect with the content item at the first repository when the content item is added to the synchronization set; and adding an entry in a first audit log for the synchronization indicating addition of the content item the synchronization set, the adding of the entry triggering a first push synchronization to the second installation to create the copy of the content item at the second repository. 19. A system as in claim 16, wherein the first repository comprises an on-premise repository protected from access by external users by a firewall, and the second repository comprises a cloud-based tenant repository outside of the firewall. 20. A system as in claim 19, wherein the cloud-based tenant repository comprises a plurality of sites, and wherein a synchronization set defines content for synchronization between the first repository and the second repository, the synchronization set comprising the content item for inclusion in the synchronization set and a site of the plurality of sites in the second repository as a destination to which the content item in the synchronization set is to be synchronized. 21. A system as in claim 16, wherein the synchronizing further comprises:
sending a request for a change manifest from the first installation to the second installation, the request comprising a repository identifier identifying the first repository; receiving the change manifest from the second repository at the first repository, the change manifest comprising a synchronization set identifier identifying a changed synchronization set of the one or more synchronization sets, the changed synchronization set comprising the content item which has had its copy changed at the second repository subsequent to a previous synchronization between the first repository and the second repository; requesting from the second repository based on the change manifest, a detailed record of changes made at the second repository to the content item identified by the content item identifier; and receiving, at the first repository from the second repository, a set of change descriptions comprising the detailed record of changes. 22. A computer-implemented method comprising:
establishing authentication between a first repository managed by a first installation of a content management system and a second repository managed by a second installation of the content management system, the first installation being protected by a firewall preventing access to the first repository by an external user; linking a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via a push to the second installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and via a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. 23. A computer-implemented method comprising:
receiving, by a second installation of a content management system from a first installation of the content management, confirmation that a first repository managed by the first installation of the content management system has established authentication with a second repository managed by the second installation, the first installation being protected by a firewall preventing access to the first repository by an external user; receiving, at the second installation, a link of a content item maintained by the first repository with a copy of the content item maintained by the second repository such that the copy of the content item is accessible by an external user subject to one or more access controls enforceable by the second installation, the copy comprising both content of the content item and a set of metadata in common with the content item at the first repository; and synchronizing the set of metadata between the copy of the content item and the content item in the first repository, the synchronizing occurring via receipt by the second installation of a push from the first installation of changes to the content item at the first repository for writing to the copy of the content item at the second repository, and by the second installation responding to a pull to the first installation of changes to the copy of the content item at the second repository for writing to the content item at the first repository, the first installation initiating both the push and the pull. | 2,100 |
5,279 | 13,531,368 | 2,132 | Techniques and mechanisms for programming an operation mode of a dynamic random access memory (DRAM) device. In an embodiment, a memory controller stores a value in a mode register of a DRAM device, the value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled. An external contact of the DRAM device is coupled to the memory controller device via a signal line of a data bus. In another embodiment, the memory controller sends a signal to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable. | 1. A dynamic random access memory (DRAM) device comprising:
a memory array; an external contact to couple the DRAM device to a signal line of a data bus; a mode register to store a value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled; and control logic coupled to the mode register, wherein, while the PDA mode of the DRAM device is enabled, the control logic to condition programmability of one or more features of the DRAM device upon detection of a signal received via the external contact. 2. The DRAM device of claim 1, wherein the control logic to condition programmability of the one or more features includes the control logic to select, based on the detection of the signal, between executing a received command and foregoing execution of the received command. 3. The DRAM device of claim 1, wherein the control logic to condition programmability of the one or more features includes the control logic to condition execution of any mode register set command. 4. The DRAM device of claim 1, wherein the DRAM device is a DDR4 SDRAM device. 5. The DRAM device of claim 1, wherein the DRAM device is a LPDDR4 SDRAM device. 6. The DRAM device of claim 1, wherein the programmability of the one or more features includes a programmability of an on-die termination parameter. 7. The DRAM device of claim 1, wherein the programmability of the one or more features includes a programmability of a voltage reference parameter. 8. A memory controller device comprising:
a data interface to couple the memory controller device via a signal line of a data bus to an external contact of a dynamic random access memory (DRAM) device; and memory access logic to store in a mode register of the DRAM device a value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled, the memory access logic further to send a signal via the data interface to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable. 9. The memory controller device of claim 8, wherein, in response to the signal, the DRAM device selects between executing a received command and foregoing execution of the received command. 10. The memory controller device of claim 8, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of an on-die termination parameter of the DRAM device. 11. The memory controller device of claim 8, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of a voltage reference parameter of the DRAM device. 12. The memory controller device of claim 8, wherein the DRAM device is a DDR4 SDRAM device. 13. The memory controller device of claim 8, wherein the DRAM device is a LPDDR4 SDRAM device. 14. The memory controller device of claim 8, wherein the memory controller is integrated in an integrated circuit with a processor. 15. The memory controller device of claim 8, further comprising:
a command interface to couple to both the DRAM device and to another DRAM device; wherein the memory access logic further to send a command signal via the command interface to the DRAM device and the other DRAM device, to send via the data interface a first signal for the DRAM device to execute a command indicated by the command signal, and to send via the data interface a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 16. A method at a memory controller, the method comprising:
storing a value in a mode register of a dynamic random access memory (DRAM) device, the value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled, wherein an external contact of the DRAM device is coupled to the memory controller device via a signal line of a data bus; and sending a signal to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable. 17. The method of claim 16, wherein, in response to the signal, the DRAM device selects between executing a received command and foregoing execution of the received command. 18. The method of claim 16, further comprising:
while the PDA mode of the DRAM device is enabled, providing device-specific programming of an on-die termination parameter of the DRAM device. 19. The method of claim 16, further comprising:
while the PDA mode of the DRAM device is enabled, providing device-specific programming of a voltage reference parameter of the DRAM device. 20. The method of claim 16, wherein the DRAM device is a DDR4 SDRAM device. 21. The method of claim 16, wherein the DRAM device is a LPDDR4 SDRAM device. 22. The method of claim 16, wherein the memory controller is integrated in an integrated circuit with a processor. 23. The method of claim 16, further comprising:
sending a command signal via a command bus to the DRAM device and to another DRAM device; sending via the data bus a first signal for the DRAM device to execute a command indicated by the command signal; and sending via the data bus a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 24. A system comprising:
a data bus; dynamic random access memory (DRAM) device including:
a memory array;
an external contact to couple the DRAM device to a signal line of the data bus;
a mode register; and
control logic coupled to the mode register, wherein, while a per-DRAM addressability (PDA) mode of the DRAM device is enabled, the control logic to condition programmability of one or more features of the DRAM device upon detection of a signal received via the external contact.
a memory controller including:
a data interface coupled via the signal line to the external contact; and
memory access logic to store in the mode register a value specifying whether the PDA mode of the DRAM device is enabled, the memory access logic further to send the signal to the external contact. 25. The system of claim 24, wherein, in response to the signal, the DRAM device to select between executing a received command and foregoing execution of the received command. 26. The system of claim 24, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of an on-die termination parameter of the DRAM device. 27. The system of claim 24, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of a voltage reference parameter of the DRAM device. 28. The system of claim 24, wherein the DRAM device is a DDR4 SDRAM device. 29. The system of claim 24, wherein the memory controller is integrated in an integrated circuit with a processor. 30. The system of claim 24, the memory controller further comprising:
a command interface to couple to both the DRAM device and to another DRAM device; wherein the memory access logic further to send a command signal via the command interface to the DRAM device and the other DRAM device, to send via the data interface a first signal for the DRAM device to execute a command indicated by the command signal, and to send via the data interface a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 31. A system comprising:
a synchronous dynamic random access memory (SDRAM) device, the SDRAM device including:
a memory array, and
a mode register to hold at least one mode register bit, the value of the at least one mode register bit to determine whether a per DRAM addressability mode is enabled wherein one or more features of the SDRAM device can be programmed if the SDRAM device is in the per DRAM addressability mode; and
a memory controller coupled with the SDRAM device, the memory controller including command and control logic capable to issue a command to transition the SDRAM device to a per DRAM addressability mode. 32. The system of claim 31, wherein the memory controller further includes command and control logic to program an on-die termination value for the SDRAM device. 33. The system of claim 31, wherein the memory controller further includes command and control logic to program a voltage reference (Vref) for the SDRAM device. 34. The system of claim 31, wherein the SDRAM device is a DDR4 SDRAM device. 35. The system of claim 31, wherein the SDRAM device is a LPDDR4 SDRAM device. 36. A synchronous dynamic random access memory (SDRAM) device, the SDRAM device comprising:
a memory array; command decoder logic to receive and decode commands from a memory controller; and a mode register to hold at least one mode register bit, the value of the at least one mode register bit to determine whether a per DRAM addressability mode is enabled wherein one or more features of the SDRAM device can be programmed if the SDRAM device is in the per DRAM addressability mode. 37. The SDRAM device of claim 36, wherein the mode register can be programmed with a device specific on-die termination value if the per DRAM addressability mode is enabled. 38. The SDRAM device of claim 36, wherein the mode register can be programmed with a device specific voltage reference (Vref) value if the per DRAM addressability mode is enabled. 39. The SDRAM device of claim 36, wherein the SDRAM device is a LPDDR4 SDRAM device. 40. A memory controller comprising:
an input/output interface to couple the memory controller to one or more synchronous dynamic random access memory devices (SDRAMs); and command and control logic capable to issue a command to transition a synchronous dynamic random access memory (SDRAM) device to a per DRAM addressability mode. 41. The memory controller of claim 40, wherein the memory controller is integrated onto the same integrated circuit as a processor. 42. The memory controller of claim 40, wherein the memory controller further includes command and control logic to program an on-die termination value for the SDRAM device. 43. The memory controller of claim 40, wherein the memory controller further includes command and control logic to program a voltage reference (Vref) for the SDRAM device. 44. The memory controller of claim 40, wherein the memory controller is capable of controlling a DDR4 compliant SDRAM device. | Techniques and mechanisms for programming an operation mode of a dynamic random access memory (DRAM) device. In an embodiment, a memory controller stores a value in a mode register of a DRAM device, the value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled. An external contact of the DRAM device is coupled to the memory controller device via a signal line of a data bus. In another embodiment, the memory controller sends a signal to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable.1. A dynamic random access memory (DRAM) device comprising:
a memory array; an external contact to couple the DRAM device to a signal line of a data bus; a mode register to store a value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled; and control logic coupled to the mode register, wherein, while the PDA mode of the DRAM device is enabled, the control logic to condition programmability of one or more features of the DRAM device upon detection of a signal received via the external contact. 2. The DRAM device of claim 1, wherein the control logic to condition programmability of the one or more features includes the control logic to select, based on the detection of the signal, between executing a received command and foregoing execution of the received command. 3. The DRAM device of claim 1, wherein the control logic to condition programmability of the one or more features includes the control logic to condition execution of any mode register set command. 4. The DRAM device of claim 1, wherein the DRAM device is a DDR4 SDRAM device. 5. The DRAM device of claim 1, wherein the DRAM device is a LPDDR4 SDRAM device. 6. The DRAM device of claim 1, wherein the programmability of the one or more features includes a programmability of an on-die termination parameter. 7. The DRAM device of claim 1, wherein the programmability of the one or more features includes a programmability of a voltage reference parameter. 8. A memory controller device comprising:
a data interface to couple the memory controller device via a signal line of a data bus to an external contact of a dynamic random access memory (DRAM) device; and memory access logic to store in a mode register of the DRAM device a value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled, the memory access logic further to send a signal via the data interface to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable. 9. The memory controller device of claim 8, wherein, in response to the signal, the DRAM device selects between executing a received command and foregoing execution of the received command. 10. The memory controller device of claim 8, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of an on-die termination parameter of the DRAM device. 11. The memory controller device of claim 8, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of a voltage reference parameter of the DRAM device. 12. The memory controller device of claim 8, wherein the DRAM device is a DDR4 SDRAM device. 13. The memory controller device of claim 8, wherein the DRAM device is a LPDDR4 SDRAM device. 14. The memory controller device of claim 8, wherein the memory controller is integrated in an integrated circuit with a processor. 15. The memory controller device of claim 8, further comprising:
a command interface to couple to both the DRAM device and to another DRAM device; wherein the memory access logic further to send a command signal via the command interface to the DRAM device and the other DRAM device, to send via the data interface a first signal for the DRAM device to execute a command indicated by the command signal, and to send via the data interface a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 16. A method at a memory controller, the method comprising:
storing a value in a mode register of a dynamic random access memory (DRAM) device, the value specifying whether a per-DRAM addressability (PDA) mode of the DRAM device is enabled, wherein an external contact of the DRAM device is coupled to the memory controller device via a signal line of a data bus; and sending a signal to the external contact while the PDA mode of the DRAM device is enabled, the signal to specify whether one or more features of the DRAM device are programmable. 17. The method of claim 16, wherein, in response to the signal, the DRAM device selects between executing a received command and foregoing execution of the received command. 18. The method of claim 16, further comprising:
while the PDA mode of the DRAM device is enabled, providing device-specific programming of an on-die termination parameter of the DRAM device. 19. The method of claim 16, further comprising:
while the PDA mode of the DRAM device is enabled, providing device-specific programming of a voltage reference parameter of the DRAM device. 20. The method of claim 16, wherein the DRAM device is a DDR4 SDRAM device. 21. The method of claim 16, wherein the DRAM device is a LPDDR4 SDRAM device. 22. The method of claim 16, wherein the memory controller is integrated in an integrated circuit with a processor. 23. The method of claim 16, further comprising:
sending a command signal via a command bus to the DRAM device and to another DRAM device; sending via the data bus a first signal for the DRAM device to execute a command indicated by the command signal; and sending via the data bus a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 24. A system comprising:
a data bus; dynamic random access memory (DRAM) device including:
a memory array;
an external contact to couple the DRAM device to a signal line of the data bus;
a mode register; and
control logic coupled to the mode register, wherein, while a per-DRAM addressability (PDA) mode of the DRAM device is enabled, the control logic to condition programmability of one or more features of the DRAM device upon detection of a signal received via the external contact.
a memory controller including:
a data interface coupled via the signal line to the external contact; and
memory access logic to store in the mode register a value specifying whether the PDA mode of the DRAM device is enabled, the memory access logic further to send the signal to the external contact. 25. The system of claim 24, wherein, in response to the signal, the DRAM device to select between executing a received command and foregoing execution of the received command. 26. The system of claim 24, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of an on-die termination parameter of the DRAM device. 27. The system of claim 24, wherein, while the PDA mode of the DRAM device is enabled, the memory access logic further to provide device-specific programming of a voltage reference parameter of the DRAM device. 28. The system of claim 24, wherein the DRAM device is a DDR4 SDRAM device. 29. The system of claim 24, wherein the memory controller is integrated in an integrated circuit with a processor. 30. The system of claim 24, the memory controller further comprising:
a command interface to couple to both the DRAM device and to another DRAM device; wherein the memory access logic further to send a command signal via the command interface to the DRAM device and the other DRAM device, to send via the data interface a first signal for the DRAM device to execute a command indicated by the command signal, and to send via the data interface a second signal for the other DRAM device to forego execution of any command indicated by the command signal. 31. A system comprising:
a synchronous dynamic random access memory (SDRAM) device, the SDRAM device including:
a memory array, and
a mode register to hold at least one mode register bit, the value of the at least one mode register bit to determine whether a per DRAM addressability mode is enabled wherein one or more features of the SDRAM device can be programmed if the SDRAM device is in the per DRAM addressability mode; and
a memory controller coupled with the SDRAM device, the memory controller including command and control logic capable to issue a command to transition the SDRAM device to a per DRAM addressability mode. 32. The system of claim 31, wherein the memory controller further includes command and control logic to program an on-die termination value for the SDRAM device. 33. The system of claim 31, wherein the memory controller further includes command and control logic to program a voltage reference (Vref) for the SDRAM device. 34. The system of claim 31, wherein the SDRAM device is a DDR4 SDRAM device. 35. The system of claim 31, wherein the SDRAM device is a LPDDR4 SDRAM device. 36. A synchronous dynamic random access memory (SDRAM) device, the SDRAM device comprising:
a memory array; command decoder logic to receive and decode commands from a memory controller; and a mode register to hold at least one mode register bit, the value of the at least one mode register bit to determine whether a per DRAM addressability mode is enabled wherein one or more features of the SDRAM device can be programmed if the SDRAM device is in the per DRAM addressability mode. 37. The SDRAM device of claim 36, wherein the mode register can be programmed with a device specific on-die termination value if the per DRAM addressability mode is enabled. 38. The SDRAM device of claim 36, wherein the mode register can be programmed with a device specific voltage reference (Vref) value if the per DRAM addressability mode is enabled. 39. The SDRAM device of claim 36, wherein the SDRAM device is a LPDDR4 SDRAM device. 40. A memory controller comprising:
an input/output interface to couple the memory controller to one or more synchronous dynamic random access memory devices (SDRAMs); and command and control logic capable to issue a command to transition a synchronous dynamic random access memory (SDRAM) device to a per DRAM addressability mode. 41. The memory controller of claim 40, wherein the memory controller is integrated onto the same integrated circuit as a processor. 42. The memory controller of claim 40, wherein the memory controller further includes command and control logic to program an on-die termination value for the SDRAM device. 43. The memory controller of claim 40, wherein the memory controller further includes command and control logic to program a voltage reference (Vref) for the SDRAM device. 44. The memory controller of claim 40, wherein the memory controller is capable of controlling a DDR4 compliant SDRAM device. | 2,100 |
5,280 | 14,636,319 | 2,129 | Methods, computing systems, and computer-readable media for multi-scale modeling. The method includes determining a first matrix for a plurality of fine cells of a model based at least in part on a physical property value represented by respective fine cells, identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains, and determining a second matrix. Determining the second matrix includes determining an intermediate product by multiplying the first matrix by a prolongation matrix, which includes predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells. Determining the second matrix also includes multiplying the intermediate product by a restriction matrix. | 1. A method for multi-scale modeling, comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells; determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells; identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains; determining, using a processor, a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 2. The method of claim 1, wherein the physical property comprises pressure in the subterranean domain at respective locations represented by the respective fine cells of the plurality of fine cells. 3. The method of claim 1, wherein the plurality of subdomains comprise a plurality of dual coarse grid cells, wherein one or more values represented by the plurality of dual coarse grid cells are calculated based at least in part on a basis function for at least one physical characteristic. 4. The method of claim 1, wherein the model further comprises a plurality of coarse cells, wherein each of the plurality of coarse cells contains two or more of the plurality of fine cells. 5. The method of claim 4, wherein the plurality of coarse cells do not overlap. 6. The method of claim 5, wherein the one or more overlapped cells comprises a subset of the plurality of fine cells that are located proximal to an interface between two of the plurality of coarse cells. 7. The method of claim 1, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 8. The method of claim 1, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. 9. The method of claim 1, further comprising displaying the model after adjusting the model. 10. The method of claim 1, wherein the model is constructed based on data collected from a physical source, the physical source comprising at least one of a seismic acquisition device, a well-logging device, or a core-sampling device. 11. A computing system, comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells;
determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells;
identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains;
determining a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 12. The system of claim 11, wherein the physical property comprises pressure in the subterranean domain at respective locations represented by the respective fine cells of the plurality of fine cells. 13. The system of claim 11, wherein the plurality of subdomains comprise a plurality of dual coarse grid cells, wherein one or more values represented by the plurality of dual coarse grid cells are calculated based at least in part on a basis function for at least one physical characteristic. 14. The system of claim 11, wherein the model further comprises a plurality of coarse cells, wherein each of the plurality of coarse cells contains two or more of the plurality of fine cells. 15. The system of claim 11, wherein the one or more overlapped cells comprises a subset of the plurality of fine cells that are located proximal to an interface between two of the plurality of coarse cells. 16. The system of claim 11, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 17. The system of claim 11, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. 18. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a computing system, cause the computing system to perform operations, the operations comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells; determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells; identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains; determining a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 19. The medium of claim 18, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 20. The medium of claim 18, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. | Methods, computing systems, and computer-readable media for multi-scale modeling. The method includes determining a first matrix for a plurality of fine cells of a model based at least in part on a physical property value represented by respective fine cells, identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains, and determining a second matrix. Determining the second matrix includes determining an intermediate product by multiplying the first matrix by a prolongation matrix, which includes predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells. Determining the second matrix also includes multiplying the intermediate product by a restriction matrix.1. A method for multi-scale modeling, comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells; determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells; identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains; determining, using a processor, a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 2. The method of claim 1, wherein the physical property comprises pressure in the subterranean domain at respective locations represented by the respective fine cells of the plurality of fine cells. 3. The method of claim 1, wherein the plurality of subdomains comprise a plurality of dual coarse grid cells, wherein one or more values represented by the plurality of dual coarse grid cells are calculated based at least in part on a basis function for at least one physical characteristic. 4. The method of claim 1, wherein the model further comprises a plurality of coarse cells, wherein each of the plurality of coarse cells contains two or more of the plurality of fine cells. 5. The method of claim 4, wherein the plurality of coarse cells do not overlap. 6. The method of claim 5, wherein the one or more overlapped cells comprises a subset of the plurality of fine cells that are located proximal to an interface between two of the plurality of coarse cells. 7. The method of claim 1, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 8. The method of claim 1, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. 9. The method of claim 1, further comprising displaying the model after adjusting the model. 10. The method of claim 1, wherein the model is constructed based on data collected from a physical source, the physical source comprising at least one of a seismic acquisition device, a well-logging device, or a core-sampling device. 11. A computing system, comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells;
determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells;
identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains;
determining a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 12. The system of claim 11, wherein the physical property comprises pressure in the subterranean domain at respective locations represented by the respective fine cells of the plurality of fine cells. 13. The system of claim 11, wherein the plurality of subdomains comprise a plurality of dual coarse grid cells, wherein one or more values represented by the plurality of dual coarse grid cells are calculated based at least in part on a basis function for at least one physical characteristic. 14. The system of claim 11, wherein the model further comprises a plurality of coarse cells, wherein each of the plurality of coarse cells contains two or more of the plurality of fine cells. 15. The system of claim 11, wherein the one or more overlapped cells comprises a subset of the plurality of fine cells that are located proximal to an interface between two of the plurality of coarse cells. 16. The system of claim 11, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 17. The system of claim 11, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. 18. A non-transitory computer-readable medium storing instructions that, when executed by one or more processors of a computing system, cause the computing system to perform operations, the operations comprising:
obtaining a model of a subterranean domain, the model comprising a plurality of fine cells and a plurality of subdomains, wherein respective subdomains of the plurality of subdomains comprise two or more of the plurality of fine cells; determining a first matrix for the plurality of fine cells based at least in part on a physical property value represented by respective fine cells of the plurality of fine cells; identifying one or more overlapped cells of the plurality of fine cells that are part of at least two of the plurality of subdomains; determining a second matrix, comprising:
determining an intermediate product by multiplying the first matrix by a prolongation matrix, wherein determining the intermediate product comprises predicting a row of zeros in the intermediate product for the plurality of fine cells that are not the one or more overlapped cells and are not part of the at least two of the plurality of subdomains that include the one or more overlapped cells; and
multiplying the intermediate product by a restriction matrix; and
adjusting the model based at least partially on the second matrix. 19. The medium of claim 18, wherein predicting the row of zeros in the intermediate product comprises setting elements of the row in the intermediate product to zero without performing a matrix multiplication operation for the row. 20. The medium of claim 18, wherein:
the prolongation matrix multiplied by a first vector representing the physical property value in the one or more overlapped cells equals a second vector representing the physical property value in the plurality of fine cells; a source/sink vector for the one or more overlapping cells is equal to the restriction matrix multiplied by a source/sink vector for the plurality of fine cells; and the second matrix multiplied by the first vector equals the source/sink vector for the one or more overlapping cells. | 2,100 |
5,281 | 14,454,020 | 2,124 | A technique solves an SVM problem on table J, defined as the join of two tables T 1 and T 2 , without explicitly joining the tables T 1 and T 2 , in which the table T 1 has m rows (p i T , u i T ), i= 1 , . . . , m, and the table T 2 has n rows (q j T , v j T ), j= 1 , . . . , n. A computer obtains a modified optimization problem from a primal optimization problem in which the modified optimization problem includes minimize w,b,η,ζ ½ ∥w∥ 2 +C·Σ i=1 m J(i)·η i +C·Σ j=1 n I(j)·ζ j , subject to y i x ij T w−y i b+η i +ζ j ≧1 ((i,j)∈IJ) and η i , ζ j ≧0 . The penalty variables are reduced in the modified optimization problem by replacing the penalty variables in a form of ξ ij for each (i,j)∈IJ with the penalty variables in a form of ζ ij =η i +ζ j . A compact form of the modified optimization problem is obtained which includes minimize w,b,η,ζ,σ,τ ½ ∥w P ∥ 2 +½ ∥w U ∥ 2 +½ ∥w Q ∥ 2 +C·Σ i=1 m J(i)·η i +C·Σ j=1 n I(j) ·ζ j which is subject to y i p i T w P −y i b+ξ i −σ k ≧0 (i∈I k , k= 1 , . . . l), q j T w Q −τ k ≧0 (j∈J k , k= 1 , . . . l), σ k +z k T w U +τ k ≧1 (for k= 1 , . . . l such that J k ≠), σ k z k T w U ≧1 (for k= 1 , . . . l such that J k =), and ξ i ≧0 (i= 1 , . . . , m). The compact form of the modified optimization problem is solved. | 1. A method, by a computer, of solving a support vector machine problem on table J, defined as the join of two tables T1 and T2, without explicitly joining the tables T1 and T2, wherein the table T1 has m rows (pi T, ui T), i=1, . . . , m, and the table T2 has n rows (qj T, vj T), j=1, . . . , n, the method comprising:
providing a primal optimization problem over a join of the tables T1 and T2; obtaining, by the computer, a modified optimization problem from the primal optimization problem; reducing penalty variables in the modified optimization problem by replacing the penalty variables in a form of ξij for each (i,j)∈IJ with the penalty variables in a form of ξij=ηi+ζj; obtaining a compact form of the modified optimization problem in which the compact form comprises the penalty variables in the form of ξijηiζj; and solving the compact form of the modified optimization problem. 2. The method of claim 1, wherein the compact form comprises:
Minimizew,b,η,ζ,σ,τ½∥w P∥2+½∥w U∥2½∥w Q∥2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj, subject to y i p i T w P −y i b+ξ i−σk≧0 (i∈I k , k=1, . . . l) q j T w Q−τk≧0 (j∈J k , k=1, . . . l) σk +z k T w U+τk≧1 (for k=1, . . . l such that J k≠) σk +z k T w U≧1 (for k=1, . . . l such that J k=) ξi≧0 (i=1, . . . , m);
wherein the compact form includes auxiliary variables σ1, . . . , σl and τk for k=1, . . . l such that Jk≠. 3. The method of claim 2, wherein the primal optimization problem comprises:
minimizew,b,ξ½∥w∥ 2 +C·Σ (i,j)∈IJξij subject to y i x ij T w−y i b+ξ ij≧1 ((i,j)∈IJ) ξij≧0 ((i,j)∈IJ); and
wherein the modified optimization problem comprises:
minimizew,b,η,ζ½∥w∥ 2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj subject to y i x ij T w−y i b+η i+ζj≧1 ((i,j)∈IJ) ηi,ζj≧0. 4. The method of claim 3, further comprising:
denoting a set P as attributes represented by pis; denoting a set Q as attributes represented by qjs; denoting a set U of attributes represented by uis; and denoting a set V of attributes represented by vjs, wherein the uis and the vjs are both common attributes of the T1 and T2; wherein J(i)=|{j:(i,j)∈IJ}|; wherein I(j)=|{i:(i,j)∈IJ}|; wherein I0={(i, 0):(∀j)(ui≠vj)}; and wherein IJ=I0∪{(i,j):ui=vj}. 5. The method of claim 4, wherein the table J is a new table based on a universal join of tables T1 and T2; and
wherein the table J comprises |P|+|U|+|Q| columns; wherein class labels yi are associated with the rows of T1; wherein denote by z1, . . . , zl all the distinct values that appear as ui, such that for each k, k=1, . . . , l, denote Ik={i:ui=zk} and Jk={j:vi=zk}; wherein C is chosen as an arbitrary coefficient; and wherein b is a scalar. 6. The method of claim 5, wherein for each i, i=1, . . . , m, if there is no j such that ui T=vj T, then J has a row xi0 T=(pi T,ui T,0T), otherwise, J has rows of the form xij T=(pi T, ui T, qj T) for every pair (i, j) such that ui T=vj T. 7. The method of claim 6, further comprising denoting by wP, wU and wQ projections of an unknown vector w on the sets P, U and Q, respectively. 8. The method of claim 1, further comprising solving the compact form by finding an optimal solution for: σk=mini∈I k {yipi TwP−yib+ηi} and τkminj∈J k {qj TwQ+ζj}. 9. The method of claim 1, further comprising developing a dual problem from the compact form of the modified optimization problem, the dual problem comprising:
minimize ½Σi,i′ y i y i′ p i T p i′αiαi′+½Σj,j′ q j T q j′βjβj′+½Σk,k′ z k T z k′γkγk′−Σi=1 mγi subject to Σi=1 m y iαi=0 0≦αi ≦CJ(i) (i=1, . . . , m) 0≦βi ≦CI(j) (j=1, . . . , n) 0≦γk≦αi (k=1, . . . , l, i∈I k) 0≦γk≦βj (k=1, . . . , l, j∈J k). 10. The method of claim 9, further comprising solving the dual problem. 11. A computer program product for solving a support vector machine problem on table J, defined as the join of two tables T1 and T2, without explicitly joining the tables T1 and T2, wherein the table T1 has m rows (pi T, ui T), i=1, . . . , m, and the table T2 has n rows (qj T, vj T), j=1, . . . , n, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by computer to cause the computer to perform a method comprising:
providing a primal optimization problem over a join of the tables T1 and T2; obtaining, by the computer, a modified optimization problem from the primal optimization problem; reducing penalty variables in the modified optimization problem by replacing the penalty variables in a form of ξij for each (i,j)∈IJ with the penalty variables in a form of ξij=ηi+ζj; obtaining a compact form of the modified optimization problem in which the compact form comprises the penalty variables in the form of ξijηiζj; and solving the compact form of the modified optimization problem. 12. The computer program product of claim 11, wherein the compact form comprises:
Minimizew,b,η,ζ,σ,τ½∥w P∥2+½∥w U∥2½∥w Q∥2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj, subject to y i p i T w P −y i b+ξ i−σk≧0 (i∈I k , k=1, . . . l) q j T w Q−τk≧0 (j∈J k , k=1, . . . l) σk +z k T w U+τk≧1 (for k=1, . . . l such that J k≠) σk +z k T w U≧1 (for k=1, . . . l such that J k=) ξi≧0 (i=1, . . . , m);
wherein the compact form includes auxiliary variables σ1, . . . , σl and τk for k=1, . . . l such that Jk≠. 13. The computer program product of claim 12, wherein the primal optimization problem comprises:
minimizew,b,ξ½∥w∥ 2 +C·Σ (i,j)∈IJξij subject to y i x ij T w−y i b+ξ ij≧1 ((i,j)∈IJ) ξij≧0 ((i,j)∈IJ); and
wherein the modified optimization problem comprises:
minimizew,b,η,ζ½∥w∥ 2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj subject to y i x ij T w−y i b+η i+ζj≧1 ((i,j)∈IJ) ηi,ζj≧0. 14. The computer program product of claim 13, further comprising:
denoting a set P as attributes represented by pis; denoting a set Q as attributes represented by qjs; denoting a set U of attributes represented by uis; and denoting a set V of attributes represented by vjs, wherein the uis and the vjs are both common attributes of the T1 and T2; wherein J(i)=|{j:(i,j)∈IJ}|; wherein I(j)=|{i:(i,j)∈IJ}|; wherein I0={(i, 0):(∀j)(ui≠vj)}; and wherein IJ=I0∪{(i,j):ui=vj}. 15. The computer program product of claim 14, wherein the table J is a new table based on a universal join of tables T1 and T2; and
wherein the table J comprises |P|+|U|+|Q| columns; wherein class labels yi are associated with the rows of T1; wherein denote by z1, . . . , zl all the distinct values that appear as ui, such that for each k, k=1, . . . , l, denote Ik={i:ui=zk} and Jk={j:vi=zk}; wherein C is chosen as an arbitrary coefficient; and wherein b is a scalar. 16. The computer program product of claim 15, wherein for each i, i=1, . . . , m, if there is no j such that ui T=vj T, then J has a row xi0 T=(pi T,ui T,0T), otherwise, J has rows of the form xij T=(pi T, ui T, qj T) for every pair (i, j) such that ui T=vj T. 17. The computer program product of claim 16, further comprising denoting by wP, wU and wQ projections of an unknown vector w on the sets P, U and Q, respectively. 18. The computer program product of claim 11, further comprising solving the compact form by finding an optimal solution for: σk=mini∈I k {yipi TwP−yib+ηi} and τ k=minj∈J k {qj TwQ+ζj}. 19. The computer program product of claim 11, further comprising developing a dual problem from the compact form of the modified optimization problem, the dual problem comprising:
minimize ½Σi,i′ y i y i′ p i T p i′αiαi′+½Σj,j′ q j T q j′βjβj′+½Σk,k′ z k T z k′γkγk′−Σi=1 mγi subject to Σi=1 m y iαi=0 0≦αi ≦CJ(i) (i=1, . . . , m) 0≦βi ≦CI(j) (j=1, . . . , n) 0≦γk≦αi (k=1, . . . , l, i∈I k) 0≦γk≦βj (k=1, . . . , l, j∈J k). 20. The computer program product of claim 19, further comprising solving the dual problem. | A technique solves an SVM problem on table J, defined as the join of two tables T 1 and T 2 , without explicitly joining the tables T 1 and T 2 , in which the table T 1 has m rows (p i T , u i T ), i= 1 , . . . , m, and the table T 2 has n rows (q j T , v j T ), j= 1 , . . . , n. A computer obtains a modified optimization problem from a primal optimization problem in which the modified optimization problem includes minimize w,b,η,ζ ½ ∥w∥ 2 +C·Σ i=1 m J(i)·η i +C·Σ j=1 n I(j)·ζ j , subject to y i x ij T w−y i b+η i +ζ j ≧1 ((i,j)∈IJ) and η i , ζ j ≧0 . The penalty variables are reduced in the modified optimization problem by replacing the penalty variables in a form of ξ ij for each (i,j)∈IJ with the penalty variables in a form of ζ ij =η i +ζ j . A compact form of the modified optimization problem is obtained which includes minimize w,b,η,ζ,σ,τ ½ ∥w P ∥ 2 +½ ∥w U ∥ 2 +½ ∥w Q ∥ 2 +C·Σ i=1 m J(i)·η i +C·Σ j=1 n I(j) ·ζ j which is subject to y i p i T w P −y i b+ξ i −σ k ≧0 (i∈I k , k= 1 , . . . l), q j T w Q −τ k ≧0 (j∈J k , k= 1 , . . . l), σ k +z k T w U +τ k ≧1 (for k= 1 , . . . l such that J k ≠), σ k z k T w U ≧1 (for k= 1 , . . . l such that J k =), and ξ i ≧0 (i= 1 , . . . , m). The compact form of the modified optimization problem is solved.1. A method, by a computer, of solving a support vector machine problem on table J, defined as the join of two tables T1 and T2, without explicitly joining the tables T1 and T2, wherein the table T1 has m rows (pi T, ui T), i=1, . . . , m, and the table T2 has n rows (qj T, vj T), j=1, . . . , n, the method comprising:
providing a primal optimization problem over a join of the tables T1 and T2; obtaining, by the computer, a modified optimization problem from the primal optimization problem; reducing penalty variables in the modified optimization problem by replacing the penalty variables in a form of ξij for each (i,j)∈IJ with the penalty variables in a form of ξij=ηi+ζj; obtaining a compact form of the modified optimization problem in which the compact form comprises the penalty variables in the form of ξijηiζj; and solving the compact form of the modified optimization problem. 2. The method of claim 1, wherein the compact form comprises:
Minimizew,b,η,ζ,σ,τ½∥w P∥2+½∥w U∥2½∥w Q∥2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj, subject to y i p i T w P −y i b+ξ i−σk≧0 (i∈I k , k=1, . . . l) q j T w Q−τk≧0 (j∈J k , k=1, . . . l) σk +z k T w U+τk≧1 (for k=1, . . . l such that J k≠) σk +z k T w U≧1 (for k=1, . . . l such that J k=) ξi≧0 (i=1, . . . , m);
wherein the compact form includes auxiliary variables σ1, . . . , σl and τk for k=1, . . . l such that Jk≠. 3. The method of claim 2, wherein the primal optimization problem comprises:
minimizew,b,ξ½∥w∥ 2 +C·Σ (i,j)∈IJξij subject to y i x ij T w−y i b+ξ ij≧1 ((i,j)∈IJ) ξij≧0 ((i,j)∈IJ); and
wherein the modified optimization problem comprises:
minimizew,b,η,ζ½∥w∥ 2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj subject to y i x ij T w−y i b+η i+ζj≧1 ((i,j)∈IJ) ηi,ζj≧0. 4. The method of claim 3, further comprising:
denoting a set P as attributes represented by pis; denoting a set Q as attributes represented by qjs; denoting a set U of attributes represented by uis; and denoting a set V of attributes represented by vjs, wherein the uis and the vjs are both common attributes of the T1 and T2; wherein J(i)=|{j:(i,j)∈IJ}|; wherein I(j)=|{i:(i,j)∈IJ}|; wherein I0={(i, 0):(∀j)(ui≠vj)}; and wherein IJ=I0∪{(i,j):ui=vj}. 5. The method of claim 4, wherein the table J is a new table based on a universal join of tables T1 and T2; and
wherein the table J comprises |P|+|U|+|Q| columns; wherein class labels yi are associated with the rows of T1; wherein denote by z1, . . . , zl all the distinct values that appear as ui, such that for each k, k=1, . . . , l, denote Ik={i:ui=zk} and Jk={j:vi=zk}; wherein C is chosen as an arbitrary coefficient; and wherein b is a scalar. 6. The method of claim 5, wherein for each i, i=1, . . . , m, if there is no j such that ui T=vj T, then J has a row xi0 T=(pi T,ui T,0T), otherwise, J has rows of the form xij T=(pi T, ui T, qj T) for every pair (i, j) such that ui T=vj T. 7. The method of claim 6, further comprising denoting by wP, wU and wQ projections of an unknown vector w on the sets P, U and Q, respectively. 8. The method of claim 1, further comprising solving the compact form by finding an optimal solution for: σk=mini∈I k {yipi TwP−yib+ηi} and τkminj∈J k {qj TwQ+ζj}. 9. The method of claim 1, further comprising developing a dual problem from the compact form of the modified optimization problem, the dual problem comprising:
minimize ½Σi,i′ y i y i′ p i T p i′αiαi′+½Σj,j′ q j T q j′βjβj′+½Σk,k′ z k T z k′γkγk′−Σi=1 mγi subject to Σi=1 m y iαi=0 0≦αi ≦CJ(i) (i=1, . . . , m) 0≦βi ≦CI(j) (j=1, . . . , n) 0≦γk≦αi (k=1, . . . , l, i∈I k) 0≦γk≦βj (k=1, . . . , l, j∈J k). 10. The method of claim 9, further comprising solving the dual problem. 11. A computer program product for solving a support vector machine problem on table J, defined as the join of two tables T1 and T2, without explicitly joining the tables T1 and T2, wherein the table T1 has m rows (pi T, ui T), i=1, . . . , m, and the table T2 has n rows (qj T, vj T), j=1, . . . , n, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by computer to cause the computer to perform a method comprising:
providing a primal optimization problem over a join of the tables T1 and T2; obtaining, by the computer, a modified optimization problem from the primal optimization problem; reducing penalty variables in the modified optimization problem by replacing the penalty variables in a form of ξij for each (i,j)∈IJ with the penalty variables in a form of ξij=ηi+ζj; obtaining a compact form of the modified optimization problem in which the compact form comprises the penalty variables in the form of ξijηiζj; and solving the compact form of the modified optimization problem. 12. The computer program product of claim 11, wherein the compact form comprises:
Minimizew,b,η,ζ,σ,τ½∥w P∥2+½∥w U∥2½∥w Q∥2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj, subject to y i p i T w P −y i b+ξ i−σk≧0 (i∈I k , k=1, . . . l) q j T w Q−τk≧0 (j∈J k , k=1, . . . l) σk +z k T w U+τk≧1 (for k=1, . . . l such that J k≠) σk +z k T w U≧1 (for k=1, . . . l such that J k=) ξi≧0 (i=1, . . . , m);
wherein the compact form includes auxiliary variables σ1, . . . , σl and τk for k=1, . . . l such that Jk≠. 13. The computer program product of claim 12, wherein the primal optimization problem comprises:
minimizew,b,ξ½∥w∥ 2 +C·Σ (i,j)∈IJξij subject to y i x ij T w−y i b+ξ ij≧1 ((i,j)∈IJ) ξij≧0 ((i,j)∈IJ); and
wherein the modified optimization problem comprises:
minimizew,b,η,ζ½∥w∥ 2 +C·Σ i=1 m J(i)·ηi +C·Σ j=1 n I(j)·ζj subject to y i x ij T w−y i b+η i+ζj≧1 ((i,j)∈IJ) ηi,ζj≧0. 14. The computer program product of claim 13, further comprising:
denoting a set P as attributes represented by pis; denoting a set Q as attributes represented by qjs; denoting a set U of attributes represented by uis; and denoting a set V of attributes represented by vjs, wherein the uis and the vjs are both common attributes of the T1 and T2; wherein J(i)=|{j:(i,j)∈IJ}|; wherein I(j)=|{i:(i,j)∈IJ}|; wherein I0={(i, 0):(∀j)(ui≠vj)}; and wherein IJ=I0∪{(i,j):ui=vj}. 15. The computer program product of claim 14, wherein the table J is a new table based on a universal join of tables T1 and T2; and
wherein the table J comprises |P|+|U|+|Q| columns; wherein class labels yi are associated with the rows of T1; wherein denote by z1, . . . , zl all the distinct values that appear as ui, such that for each k, k=1, . . . , l, denote Ik={i:ui=zk} and Jk={j:vi=zk}; wherein C is chosen as an arbitrary coefficient; and wherein b is a scalar. 16. The computer program product of claim 15, wherein for each i, i=1, . . . , m, if there is no j such that ui T=vj T, then J has a row xi0 T=(pi T,ui T,0T), otherwise, J has rows of the form xij T=(pi T, ui T, qj T) for every pair (i, j) such that ui T=vj T. 17. The computer program product of claim 16, further comprising denoting by wP, wU and wQ projections of an unknown vector w on the sets P, U and Q, respectively. 18. The computer program product of claim 11, further comprising solving the compact form by finding an optimal solution for: σk=mini∈I k {yipi TwP−yib+ηi} and τ k=minj∈J k {qj TwQ+ζj}. 19. The computer program product of claim 11, further comprising developing a dual problem from the compact form of the modified optimization problem, the dual problem comprising:
minimize ½Σi,i′ y i y i′ p i T p i′αiαi′+½Σj,j′ q j T q j′βjβj′+½Σk,k′ z k T z k′γkγk′−Σi=1 mγi subject to Σi=1 m y iαi=0 0≦αi ≦CJ(i) (i=1, . . . , m) 0≦βi ≦CI(j) (j=1, . . . , n) 0≦γk≦αi (k=1, . . . , l, i∈I k) 0≦γk≦βj (k=1, . . . , l, j∈J k). 20. The computer program product of claim 19, further comprising solving the dual problem. | 2,100 |
5,282 | 12,850,606 | 2,113 | A method begins by a dispersed storage processing module obtaining data for storage. The method continues with the dispersed storage processing module soliciting dispersed storage (DS) units to store encoded data slices of the data. The method continues with the dispersed storage processing module receiving favorable responses from a set of DS units. The method continues with the dispersed storage processing module encoding the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses. | 1. A method for execution by a dispersed storage processing module, the method comprises:
obtaining data for storage; soliciting dispersed storage (DS) units to store encoded data slices of the data; receiving favorable responses from a set of DS units; and encoding the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses. 2. The method of claim 1, wherein the soliciting further comprises:
interpreting metadata; determining the DS units based on the metadata; and sending a message to each of the DS units, wherein the message includes requirements for storage. 3. The method of claim 1, wherein the favorable responses further comprises at least one of:
first storage requirements that substantially matches requirements of the soliciting; and second storage requirements that encompasses the requirements of the soliciting. 4. The method of claim 1, wherein the encoding further comprises:
establishing error coding dispersal storage function parameters based on the favorable responses from the set of DS units, wherein the error coding dispersal storage function parameters includes at least one of:
a segmenting protocol;
a pre-slice data manipulation function;
a forward error correction encoding function;
a slicing pillar width;
a post-slice data manipulation function;
a write threshold; and
a read threshold. 5. The method of claim 1, wherein the soliciting further comprises:
sending a solicitation broadcast message to the DS units, wherein the solicitation broadcast message includes storage requirements. 6. The method of claim 1 further comprises:
interpreting metadata;
establishing a slicing pillar width in accordance with the metadata;
encoding the data in accordance with the error coding dispersal storage function and the slicing pillar width when a number of the favorable responses is equal to or greater than the slicing pillar width; and
when the number of the favorable responses is less than the slicing pillar width, adjusting the error coding dispersal storage function. 7. A method for execution by a dispersed storage (DS) unit, the method comprises:
receiving a solicitation message regarding dispersed storage of data, wherein the solicitation message includes one or more storage requirements regarding storage of encoded data slices of the data; comparing the one or more storage requirements with storage capabilities of the DS unit; when the storage capabilities compares favorably to the one or more storage requirements, sending a favorable response; receiving at least one of the encoded data slices of the data; and storing the at least one of the encoded data slices in accordance with the one or more storage requirements. 8. The method of claim 7, wherein the favorable response further comprises one of:
the storage capabilities substantially matches the one or more storage requirements; and the storage capabilities substantially encompasses the one or more storage requirements. 9. The method of claim 7 further comprises:
maintaining a storage record of the at least one of the encoded data slices, wherein the record includes at least one of: the one or more storage requirements, the storage capabilities, a storage agreement, a slice name, a source name, a data object name, an integrity check value, and a storage location. 10. The method of claim 9 further comprises:
receiving a retrieval message that includes identities of a set of encoded data slices;
determining whether an encoded data slice of the set of encoded data slices is identified in the record; and
when the encoded data slice is identified in the record, sending a message that includes the encoded data slice. 11. A dispersed storage processing module comprises:
an interface; and a processing module operable to:
obtain data for storage;
solicit, via the interface, dispersed storage (DS) units to store encoded data slices of the data;
receive, via the interface, favorable responses from a set of DS units; and
encode the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses. 12. The dispersed storage processing module of claim 11, wherein the processing module further functions to solicit by:
interpreting metadata; determining the DS units based on the metadata; and sending, via the interface, a message to each of the DS units, wherein the message includes requirements for storage. 13. The dispersed storage processing module of claim 11, wherein the favorable responses further comprises one of:
first storage requirements that substantially matches requirements of the soliciting; and second storage requirements that encompasses the requirements of the soliciting. 14. The dispersed storage processing module of claim 11, wherein the processing module further functions to encode by:
establishing error coding dispersal storage function parameters based on the favorable responses from the set of DS units, wherein the error coding dispersal storage function parameters includes at least one of:
a segmenting protocol;
a pre-slice data manipulation function;
a forward error correction encoding function;
a slicing pillar width;
a post-slice data manipulation function;
a write threshold; and
a read threshold. 15. The dispersed storage processing module of claim 11, wherein the processing module further functions to solicit by:
sending, via the interface, a solicitation broadcast message to the DS units, wherein the solicitation broadcast message includes storage requirements. 16. The dispersed storage processing module of claim 11 further functions to:
interpret metadata;
establish a slicing pillar width in accordance with the metadata;
encode the data in accordance with the error coding dispersal storage function and the slicing pillar width when a number of the favorable responses is equal to or greater than the slicing pillar width; and
adjust the error coding dispersal storage function when the number of the favorable responses is less than the slicing pillar width. 17. A dispersed storage (DS) unit comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a solicitation message regarding dispersed storage of data, wherein the solicitation message includes one or more storage requirements regarding storage of encoded data slices of the data;
compare the one or more storage requirements with storage capabilities of the DS unit;
send, via the interface, a favorable response when the storage capabilities compares favorably to the one or more storage requirements;
receive, via the interface, at least one of the encoded data slices of the data; and
store, in the memory, the at least one of the encoded data slices in accordance with the one or more storage requirements. 18. The dispersed storage unit of claim 17, wherein the favorable response further comprises one of:
the storage capabilities substantially matches the one or more storage requirements; and the storage capabilities substantially encompasses the one or more storage requirements. 19. The dispersed storage unit of claim 17 further functions to:
maintain, in the memory, a storage record of the at least one of the encoded data slices, wherein the record of storage includes at least one of: the one or more storage requirements, the storage capabilities, a storage agreement, a slice name, a source name, a data object name, an integrity check value, and a storage location. 20. The dispersed storage unit of claim 19 further functions to:
receive, via the interface, a retrieval message that includes identities of a set of encoded data slices;
determine whether an encoded data slice of the set of encoded data slices is identified in the record; and
send, via the interface, a message that includes the encoded data slice when the encoded data slice is identified in the record. | A method begins by a dispersed storage processing module obtaining data for storage. The method continues with the dispersed storage processing module soliciting dispersed storage (DS) units to store encoded data slices of the data. The method continues with the dispersed storage processing module receiving favorable responses from a set of DS units. The method continues with the dispersed storage processing module encoding the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses.1. A method for execution by a dispersed storage processing module, the method comprises:
obtaining data for storage; soliciting dispersed storage (DS) units to store encoded data slices of the data; receiving favorable responses from a set of DS units; and encoding the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses. 2. The method of claim 1, wherein the soliciting further comprises:
interpreting metadata; determining the DS units based on the metadata; and sending a message to each of the DS units, wherein the message includes requirements for storage. 3. The method of claim 1, wherein the favorable responses further comprises at least one of:
first storage requirements that substantially matches requirements of the soliciting; and second storage requirements that encompasses the requirements of the soliciting. 4. The method of claim 1, wherein the encoding further comprises:
establishing error coding dispersal storage function parameters based on the favorable responses from the set of DS units, wherein the error coding dispersal storage function parameters includes at least one of:
a segmenting protocol;
a pre-slice data manipulation function;
a forward error correction encoding function;
a slicing pillar width;
a post-slice data manipulation function;
a write threshold; and
a read threshold. 5. The method of claim 1, wherein the soliciting further comprises:
sending a solicitation broadcast message to the DS units, wherein the solicitation broadcast message includes storage requirements. 6. The method of claim 1 further comprises:
interpreting metadata;
establishing a slicing pillar width in accordance with the metadata;
encoding the data in accordance with the error coding dispersal storage function and the slicing pillar width when a number of the favorable responses is equal to or greater than the slicing pillar width; and
when the number of the favorable responses is less than the slicing pillar width, adjusting the error coding dispersal storage function. 7. A method for execution by a dispersed storage (DS) unit, the method comprises:
receiving a solicitation message regarding dispersed storage of data, wherein the solicitation message includes one or more storage requirements regarding storage of encoded data slices of the data; comparing the one or more storage requirements with storage capabilities of the DS unit; when the storage capabilities compares favorably to the one or more storage requirements, sending a favorable response; receiving at least one of the encoded data slices of the data; and storing the at least one of the encoded data slices in accordance with the one or more storage requirements. 8. The method of claim 7, wherein the favorable response further comprises one of:
the storage capabilities substantially matches the one or more storage requirements; and the storage capabilities substantially encompasses the one or more storage requirements. 9. The method of claim 7 further comprises:
maintaining a storage record of the at least one of the encoded data slices, wherein the record includes at least one of: the one or more storage requirements, the storage capabilities, a storage agreement, a slice name, a source name, a data object name, an integrity check value, and a storage location. 10. The method of claim 9 further comprises:
receiving a retrieval message that includes identities of a set of encoded data slices;
determining whether an encoded data slice of the set of encoded data slices is identified in the record; and
when the encoded data slice is identified in the record, sending a message that includes the encoded data slice. 11. A dispersed storage processing module comprises:
an interface; and a processing module operable to:
obtain data for storage;
solicit, via the interface, dispersed storage (DS) units to store encoded data slices of the data;
receive, via the interface, favorable responses from a set of DS units; and
encode the data in accordance with an error coding dispersal storage function and in accordance with the favorable responses. 12. The dispersed storage processing module of claim 11, wherein the processing module further functions to solicit by:
interpreting metadata; determining the DS units based on the metadata; and sending, via the interface, a message to each of the DS units, wherein the message includes requirements for storage. 13. The dispersed storage processing module of claim 11, wherein the favorable responses further comprises one of:
first storage requirements that substantially matches requirements of the soliciting; and second storage requirements that encompasses the requirements of the soliciting. 14. The dispersed storage processing module of claim 11, wherein the processing module further functions to encode by:
establishing error coding dispersal storage function parameters based on the favorable responses from the set of DS units, wherein the error coding dispersal storage function parameters includes at least one of:
a segmenting protocol;
a pre-slice data manipulation function;
a forward error correction encoding function;
a slicing pillar width;
a post-slice data manipulation function;
a write threshold; and
a read threshold. 15. The dispersed storage processing module of claim 11, wherein the processing module further functions to solicit by:
sending, via the interface, a solicitation broadcast message to the DS units, wherein the solicitation broadcast message includes storage requirements. 16. The dispersed storage processing module of claim 11 further functions to:
interpret metadata;
establish a slicing pillar width in accordance with the metadata;
encode the data in accordance with the error coding dispersal storage function and the slicing pillar width when a number of the favorable responses is equal to or greater than the slicing pillar width; and
adjust the error coding dispersal storage function when the number of the favorable responses is less than the slicing pillar width. 17. A dispersed storage (DS) unit comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a solicitation message regarding dispersed storage of data, wherein the solicitation message includes one or more storage requirements regarding storage of encoded data slices of the data;
compare the one or more storage requirements with storage capabilities of the DS unit;
send, via the interface, a favorable response when the storage capabilities compares favorably to the one or more storage requirements;
receive, via the interface, at least one of the encoded data slices of the data; and
store, in the memory, the at least one of the encoded data slices in accordance with the one or more storage requirements. 18. The dispersed storage unit of claim 17, wherein the favorable response further comprises one of:
the storage capabilities substantially matches the one or more storage requirements; and the storage capabilities substantially encompasses the one or more storage requirements. 19. The dispersed storage unit of claim 17 further functions to:
maintain, in the memory, a storage record of the at least one of the encoded data slices, wherein the record of storage includes at least one of: the one or more storage requirements, the storage capabilities, a storage agreement, a slice name, a source name, a data object name, an integrity check value, and a storage location. 20. The dispersed storage unit of claim 19 further functions to:
receive, via the interface, a retrieval message that includes identities of a set of encoded data slices;
determine whether an encoded data slice of the set of encoded data slices is identified in the record; and
send, via the interface, a message that includes the encoded data slice when the encoded data slice is identified in the record. | 2,100 |
5,283 | 14,016,420 | 2,128 | Performing diagnostic of hydrocarbon production in a field includes generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field, and simulating, using the thermal-hydraulic production system model, and based on multiple root causes, a hydrocarbon production problem to generate a feature vectors corresponding to the root causes. Each of feature vectors includes parameter values corresponding to physical parameters associated with the hydrocarbon production. Performing diagnostic further includes configuring, using the feature vectors, a classifier of the hydrocarbon production problem, detecting the hydrocarbon production problem in the field, analyzing, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause, and presenting the root cause to a user. The classifier is configured to classify the hydrocarbon production problem according to the root causes. | 1. A method to perform diagnostic of hydrocarbon production in a field, comprising:
generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field; simulating, by a computer processor, using the thermal-hydraulic production system model, and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production;
configuring, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier is configured to classify the hydrocarbon production problem according to the plurality of root causes;
detecting the hydrocarbon production problem in the field; analyzing, by the computer processor, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes; and presenting the root cause to a user. 2. The method of claim 1,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 3. The method of claim 1,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 4. The method of claim 1, further comprising:
obtaining a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 5. The method of claim 1, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 6. The method of claim 5, further comprising:
obtaining previous surveillance data at a previous time; analyzing, using the classifier, the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier; and obtaining the surveillance data at a current time subsequent to the previous time, wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. 7. The method of claim 1,
wherein the plurality of root causes comprise at least one selected from a group consisting of gas failing to flow into a bottom value in a gas lift well, a flowrate to a gas lift well being incorrect, a gas lift valve being stuck in an open position, and an injection through multiple gas lift values. 8. A system to perform diagnostic of hydrocarbon production in a field, comprising:
a wellsite and a surface facility in the field for performing the hydrocarbon production; a surveillance and diagnostics computer system, comprising:
a model generator executing on a computer processor configured to:
generate a thermal-hydraulic production system model of the wellsite and the surface facility in the field, and
an analysis engine executing on a computer processor and configured to:
simulate, using the thermal-hydraulic production system model and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production, and
configure, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier executes on a computer processor and is further configured to:
classify the hydrocarbon production problem according to the plurality of root causes,
detect the hydrocarbon production problem in the field,
analyze, in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes, and
present the root cause to a user; and
a repository configured to store the surveillance data and the thermal-hydraulic production system model. 9. The system of claim 8,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 10. The system of claim 8,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 11. The system of claim 8, wherein the analysis engine is further configured to:
obtain a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 12. The system of claim 8, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 13. The system of claim 12,
wherein the analysis engine is further configured to:
obtain previous surveillance data at a previous time; and
obtain the surveillance data at a current time subsequent to the previous time,
wherein the classifier is further configured to:
analyze the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier, and
wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. 14. The system of claim 8,
wherein the plurality of root causes comprise at least one selected from a group consisting of gas failing to flow into a bottom value in a gas lift well, a flowrate to a gas lift well being incorrect, a gas lift valve being stuck in an open position, and an injection through multiple gas lift values. 15. A non-transitory computer readable medium comprising instructions to perform diagnostic of hydrocarbon production in a field, the instructions when executed by a computer processor comprising functionality for:
generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field; simulating, by a computer processor, using the thermal-hydraulic production system model, and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production;
configuring, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier is configured to classify the hydrocarbon production problem according to the plurality of root causes;
detecting the hydrocarbon production problem in the field; analyzing, by the computer processor, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes; and presenting the root cause to a user. 16. The non-transitory computer readable medium of claim 15,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 17. The non-transitory computer readable medium of claim 15,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 18. The non-transitory computer readable medium of claim 15, further comprising:
obtaining a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 19. The non-transitory computer readable medium of claim 15, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 20. The non-transitory computer readable medium of claim 19, further comprising:
obtaining previous surveillance data at a previous time; analyzing, using the classifier, the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier; and obtaining the surveillance data at a current time subsequent to the previous time, wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. | Performing diagnostic of hydrocarbon production in a field includes generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field, and simulating, using the thermal-hydraulic production system model, and based on multiple root causes, a hydrocarbon production problem to generate a feature vectors corresponding to the root causes. Each of feature vectors includes parameter values corresponding to physical parameters associated with the hydrocarbon production. Performing diagnostic further includes configuring, using the feature vectors, a classifier of the hydrocarbon production problem, detecting the hydrocarbon production problem in the field, analyzing, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause, and presenting the root cause to a user. The classifier is configured to classify the hydrocarbon production problem according to the root causes.1. A method to perform diagnostic of hydrocarbon production in a field, comprising:
generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field; simulating, by a computer processor, using the thermal-hydraulic production system model, and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production;
configuring, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier is configured to classify the hydrocarbon production problem according to the plurality of root causes;
detecting the hydrocarbon production problem in the field; analyzing, by the computer processor, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes; and presenting the root cause to a user. 2. The method of claim 1,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 3. The method of claim 1,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 4. The method of claim 1, further comprising:
obtaining a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 5. The method of claim 1, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 6. The method of claim 5, further comprising:
obtaining previous surveillance data at a previous time; analyzing, using the classifier, the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier; and obtaining the surveillance data at a current time subsequent to the previous time, wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. 7. The method of claim 1,
wherein the plurality of root causes comprise at least one selected from a group consisting of gas failing to flow into a bottom value in a gas lift well, a flowrate to a gas lift well being incorrect, a gas lift valve being stuck in an open position, and an injection through multiple gas lift values. 8. A system to perform diagnostic of hydrocarbon production in a field, comprising:
a wellsite and a surface facility in the field for performing the hydrocarbon production; a surveillance and diagnostics computer system, comprising:
a model generator executing on a computer processor configured to:
generate a thermal-hydraulic production system model of the wellsite and the surface facility in the field, and
an analysis engine executing on a computer processor and configured to:
simulate, using the thermal-hydraulic production system model and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production, and
configure, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier executes on a computer processor and is further configured to:
classify the hydrocarbon production problem according to the plurality of root causes,
detect the hydrocarbon production problem in the field,
analyze, in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes, and
present the root cause to a user; and
a repository configured to store the surveillance data and the thermal-hydraulic production system model. 9. The system of claim 8,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 10. The system of claim 8,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 11. The system of claim 8, wherein the analysis engine is further configured to:
obtain a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 12. The system of claim 8, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 13. The system of claim 12,
wherein the analysis engine is further configured to:
obtain previous surveillance data at a previous time; and
obtain the surveillance data at a current time subsequent to the previous time,
wherein the classifier is further configured to:
analyze the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier, and
wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. 14. The system of claim 8,
wherein the plurality of root causes comprise at least one selected from a group consisting of gas failing to flow into a bottom value in a gas lift well, a flowrate to a gas lift well being incorrect, a gas lift valve being stuck in an open position, and an injection through multiple gas lift values. 15. A non-transitory computer readable medium comprising instructions to perform diagnostic of hydrocarbon production in a field, the instructions when executed by a computer processor comprising functionality for:
generating a thermal-hydraulic production system model of a wellsite and a surface facility in the field; simulating, by a computer processor, using the thermal-hydraulic production system model, and based on a plurality of root causes, a hydrocarbon production problem to generate a plurality of feature vectors corresponding to the plurality of root causes,
wherein each of the plurality of feature vectors comprises a plurality of parameter values corresponding to a plurality of physical parameters associated with the hydrocarbon production;
configuring, using the plurality of feature vectors, a classifier of the hydrocarbon production problem,
wherein the classifier is configured to classify the hydrocarbon production problem according to the plurality of root causes;
detecting the hydrocarbon production problem in the field; analyzing, by the computer processor, using the classifier, and in response to detecting the hydrocarbon production problem, surveillance data from the wellsite and the surface facility to identify a root cause of the plurality of root causes; and presenting the root cause to a user. 16. The non-transitory computer readable medium of claim 15,
wherein the plurality of root causes comprises at least one selected from a group consisting of a change in a reservoir inflow performance, a change in a tubing characteristic, and a change in a surface characteristic. 17. The non-transitory computer readable medium of claim 15,
wherein the plurality of root causes comprises at least one selected from a group consisting of a zero flow through a downhole pump, low flow rate through the downhole pump, and operating the downhole pump that is not submerged in liquid, and wherein the plurality of physical parameters comprises at least one selected from a group consisting of electrical current to the downhole pump, electrical voltage at the downhole pump, frequency of the electrical current, well head tubing fluid temperature, well head tubing fluid pressure, downhole pump intake pressure, downhole pump discharge pressure, downhole pump intake fluid temperature, downhole pump motor windings temperature, and well head annulus fluid pressure. 18. The non-transitory computer readable medium of claim 15, further comprising:
obtaining a plurality of probability density functions, wherein each of the plurality of probability density functions represents a probability distribution of measurement noise associated with one of the plurality of parameter values, wherein the classifier is further configured using the plurality of probability density functions. 19. The non-transitory computer readable medium of claim 15, wherein analyzing the surveillance data comprises:
generating, using the classifier and based on the surveillance data, a classification probability associated with each of the plurality of root causes, wherein identifying the root cause is based on the classification probability associated with the root cause meeting a pre-determined criterion. 20. The non-transitory computer readable medium of claim 19, further comprising:
obtaining previous surveillance data at a previous time; analyzing, using the classifier, the previous surveillance data to generate a previous classification probability associated with each of the plurality of root causes, wherein the classifier is a Bayesian classifier; and obtaining the surveillance data at a current time subsequent to the previous time, wherein generating the classification probability associated with each of the plurality of root causes comprises updating, based on the surveillance data, the previous classification probability associated with each of the plurality of root causes. | 2,100 |
5,284 | 12,733,297 | 2,144 | A communications apparatus includes a processing resource arranged to support, when in use, a main application and a user interface. The apparatus, in at least one embodiment, also includes a data store and a user interface host entity arranged to access, when in use, a user interface template selectable in response to a received message. The user interface template includes an expression of a number of user interface elements. The user interface is arranged to translate the user interface template selected from the expression of the number of user interface elements into a user interface instantiation. | 1. A communications apparatus comprising:
a processing resource arranged to support, when in use, a main application and a user interface; a data store; and a user interface host entity arranged to access, when in use, a user interface template selectable in response to a received message, the user interface template including an expression of a number of user interface elements the user interface being arranged to translate the user interface template selected from the expression of the number of user interface elements into a user interface instantiation. 2. An apparatus as claimed in claim 1, wherein the processing resource is arranged to arbitrate between competing requests to use the user interface. 3. An apparatus as claimed in claim 1, further comprising:
a communications interface capable of supporting communication with an external application relative to the main application via a communications network; wherein the processing resource is arranged to provide, when in use, the external application with remote access to the user interface via the communications network. 4. An apparatus as claimed in claim 3, wherein the communications interface is arranged to communicate, when in use, with the external application, the external application being located in a device external to the processing resource. 5. An apparatus as claimed in claim 4, further comprising an electronic apparatus comprising the device, the electronic apparatus being housed separately from the processing resource. 6. An apparatus as claimed in claim 1, wherein the number of user interface elements includes is a Graphical User Interface (GUI) widget. 7. An apparatus as claimed in claim 3, wherein the user interface is arranged to access the user interface template from a number of user interface templates stored locally. 8. An apparatus as claimed in claim 7, wherein the message received via the communications interface identifies the user interface template and constitutes a selection of the user interface template. 9. An apparatus as claimed in claim 1, wherein the user interface is arranged to receive, when in use, information qualifying a user interface element of the user interface template. 10. An apparatus as claimed in claim 1, wherein the number of user interface elements comprises a definable control element. 11. An apparatus as claimed in claim 1, wherein the number of user interface elements comprises a definable label element. 12. An apparatus as claimed in claim 3, wherein the user interface is arranged to generate event data in response to a user interaction with the user interface instantiation of an element of the number of user interface elements. 13. An apparatus as claimed in claim 12, wherein the processing resource is arranged to communicate the event data via the communications interface for receipt by the external application. 14. An apparatus as claimed in claim 1, further comprising an input device arranged to receive a user interface navigation gesture, the event data corresponding to the user interface navigation gesture. 15. An apparatus as claimed in claim 1, wherein the user interface is a graphical user interface. 16. An apparatus as claimed in claim 15, wherein the user interface template has a layout associated therewith. 17. An apparatus as claimed in claim 3, wherein the communications interface is a wireless communications interface. 18. A navigation apparatus comprising the communications apparatus as claimed in claim 1. 19. A communications system comprising:
a first device comprising the communications apparatus as claimed in claim 3; and a second device supporting the external application; wherein the first and second devices are arranged to communicate via the communications network. 20. A system as claimed in claim 19, wherein the first device has a first operational task associated therewith and the second device has a second operational task associated therewith, the first and second operational tasks being different. 21. A system as claimed in claim 19, wherein the first device is a navigation device and the second device is an entertainment system. 22. A method of providing a user interface, the method comprising:
supporting a main application and a user interface therefor; receiving a message; selecting a user interface template in response to the message received, the user interface template including an expression of a number of user interface elements; and translating the selected user interface template from the expression of the number of user interface elements into a user interface instantiation for a user. 23. A method as claimed in claim 22, further comprising:
supporting a communications interface; supporting communication in a communications network; and providing an external application relative to the main application with remote access to the user interface via the communications network. 24. A computer program element comprising computer program code segments to make a computer device execute the method as claimed in claim 22 when the computer program segments are executed on the computer device. 25. A computer program element as claimed in claim 24, embodied on a computer readable medium. 26. An apparatus as claimed in claim 1, wherein the user interface is arranged to access the user interface template from a number of user interface templates stored locally. 27. An apparatus as claimed in claim 1, wherein the user interface is arranged to generate event data in response to a user interaction with the user interface instantiation of an element of the number of user interface elements. 28. A system as claimed in claim 20, wherein the first device is a navigation device and the second device is an entertainment system. 29. A computer readable medium including program segments for, when executed on a computer device, causing the computer device to implement the method of claim 1. | A communications apparatus includes a processing resource arranged to support, when in use, a main application and a user interface. The apparatus, in at least one embodiment, also includes a data store and a user interface host entity arranged to access, when in use, a user interface template selectable in response to a received message. The user interface template includes an expression of a number of user interface elements. The user interface is arranged to translate the user interface template selected from the expression of the number of user interface elements into a user interface instantiation.1. A communications apparatus comprising:
a processing resource arranged to support, when in use, a main application and a user interface; a data store; and a user interface host entity arranged to access, when in use, a user interface template selectable in response to a received message, the user interface template including an expression of a number of user interface elements the user interface being arranged to translate the user interface template selected from the expression of the number of user interface elements into a user interface instantiation. 2. An apparatus as claimed in claim 1, wherein the processing resource is arranged to arbitrate between competing requests to use the user interface. 3. An apparatus as claimed in claim 1, further comprising:
a communications interface capable of supporting communication with an external application relative to the main application via a communications network; wherein the processing resource is arranged to provide, when in use, the external application with remote access to the user interface via the communications network. 4. An apparatus as claimed in claim 3, wherein the communications interface is arranged to communicate, when in use, with the external application, the external application being located in a device external to the processing resource. 5. An apparatus as claimed in claim 4, further comprising an electronic apparatus comprising the device, the electronic apparatus being housed separately from the processing resource. 6. An apparatus as claimed in claim 1, wherein the number of user interface elements includes is a Graphical User Interface (GUI) widget. 7. An apparatus as claimed in claim 3, wherein the user interface is arranged to access the user interface template from a number of user interface templates stored locally. 8. An apparatus as claimed in claim 7, wherein the message received via the communications interface identifies the user interface template and constitutes a selection of the user interface template. 9. An apparatus as claimed in claim 1, wherein the user interface is arranged to receive, when in use, information qualifying a user interface element of the user interface template. 10. An apparatus as claimed in claim 1, wherein the number of user interface elements comprises a definable control element. 11. An apparatus as claimed in claim 1, wherein the number of user interface elements comprises a definable label element. 12. An apparatus as claimed in claim 3, wherein the user interface is arranged to generate event data in response to a user interaction with the user interface instantiation of an element of the number of user interface elements. 13. An apparatus as claimed in claim 12, wherein the processing resource is arranged to communicate the event data via the communications interface for receipt by the external application. 14. An apparatus as claimed in claim 1, further comprising an input device arranged to receive a user interface navigation gesture, the event data corresponding to the user interface navigation gesture. 15. An apparatus as claimed in claim 1, wherein the user interface is a graphical user interface. 16. An apparatus as claimed in claim 15, wherein the user interface template has a layout associated therewith. 17. An apparatus as claimed in claim 3, wherein the communications interface is a wireless communications interface. 18. A navigation apparatus comprising the communications apparatus as claimed in claim 1. 19. A communications system comprising:
a first device comprising the communications apparatus as claimed in claim 3; and a second device supporting the external application; wherein the first and second devices are arranged to communicate via the communications network. 20. A system as claimed in claim 19, wherein the first device has a first operational task associated therewith and the second device has a second operational task associated therewith, the first and second operational tasks being different. 21. A system as claimed in claim 19, wherein the first device is a navigation device and the second device is an entertainment system. 22. A method of providing a user interface, the method comprising:
supporting a main application and a user interface therefor; receiving a message; selecting a user interface template in response to the message received, the user interface template including an expression of a number of user interface elements; and translating the selected user interface template from the expression of the number of user interface elements into a user interface instantiation for a user. 23. A method as claimed in claim 22, further comprising:
supporting a communications interface; supporting communication in a communications network; and providing an external application relative to the main application with remote access to the user interface via the communications network. 24. A computer program element comprising computer program code segments to make a computer device execute the method as claimed in claim 22 when the computer program segments are executed on the computer device. 25. A computer program element as claimed in claim 24, embodied on a computer readable medium. 26. An apparatus as claimed in claim 1, wherein the user interface is arranged to access the user interface template from a number of user interface templates stored locally. 27. An apparatus as claimed in claim 1, wherein the user interface is arranged to generate event data in response to a user interaction with the user interface instantiation of an element of the number of user interface elements. 28. A system as claimed in claim 20, wherein the first device is a navigation device and the second device is an entertainment system. 29. A computer readable medium including program segments for, when executed on a computer device, causing the computer device to implement the method of claim 1. | 2,100 |
5,285 | 14,830,993 | 2,143 | An example system includes: an information processing device including a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image transmission device transmitting the background image of the basic screen. The display processing unit of the information processing device automatically receives the background image transmitted by the background image transmission device and displays the received background image in the background of the selection image. | 1. An information processing system comprising:
an information processing device including a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image transmission device transmitting the background image of the basic screen, wherein the display processing unit of the information processing device automatically receives the background image transmitted by the background image transmission device and displays the received background image in the background of the selection image. 2. The information processing system according to claim 1, wherein the background image transmission device performs push-based information distribution of the background image. 3. The information processing system according to claim 1, wherein
the information processing device automatically performs transmission request to the background image transmission device for the background image, and wherein in response to the request from the information processing device, the background image transmission device transmits the background image. 4. The information processing system according to claim 1, wherein on a basis of a given transmission condition, the background image transmission device transmits the background image to the information processing device. 5. The information processing system according to claim 4, wherein the background image transmission device stores the background image provided with a type, and transmits a background image of a type defined as the given transmission condition for each information processing device. 6. The information processing system according to claim 5, wherein
the information processing device includes: a type setting reception unit receiving setting of the type; and a type setting transmission unit transmitting to the background image transmission device the setting received by the type setting reception unit, and wherein in accordance with setting of the type received from the information processing device, the background image transmission device transmits a background image. 7. The information processing system according to claim 1, wherein
the information processing device includes: a transmission permissibility setting reception unit receiving setting of permission or non-permission of transmission of the background image performed by the background image transmission device; and a transmission permissibility setting transmission unit transmitting to the background image transmission device the setting received by the transmission permissibility setting reception unit, and wherein in accordance with the setting of permission or non-permission received from the information processing device, the background image transmission device transmits the background image to the information processing device transmission to which is permitted. 8. The information processing system according to claim 1, wherein
the information processing device includes: a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 9. An information processing system comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of setting items, other than the background image, concerning a user interface. 10. An information processing device comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image reception unit automatically receiving the background image transmitted by a background image transmission device, wherein when the background image reception unit has automatically received the background image from the background image transmission device, the display processing unit displays the received background image in the background of the selection image. 11. An information processing device comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 12. The information processing device according to claim 11, wherein the given condition is a condition concerning a date, a time of day, or a time. 13. The information processing device according to claim 11, wherein the given condition is a condition concerning execution of given application. 14. The information processing device according to claim 11, wherein the setting item to be changed by the change unit includes at least one of a BGM, a sound effect, a design of an icon, and a design of a window. 15. The information processing device according to claim 11, comprising
a type setting reception unit storing the background image provided with a type, and receiving setting of the type, wherein on a basis of the type whose setting has been received by the type setting reception unit, the change unit changes the background image and at least one of the setting items. 16. A non-transitory recording medium in which an information processing program is recorded, the program causing an information processing device to operate as:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image reception unit automatically receiving the background image transmitted by a background image transmission device, wherein when the background image reception unit has automatically received the background image from the background image transmission device, the display processing unit displays the received background image in the background of the selection image. 17. A non-transitory recording medium in which an information processing program is recorded, the program causing an information processing device to operate as:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 18. An information processing system comprising:
a first information processing device including at least one processor configured to display on a display a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a second information processing device including at least one processor configured to transmit the background image to the first information processing device, wherein the at least one processor of the first information processing device is further configured to automatically receive the background image transmitted by the second information processing device and display the received background image in the background of the selection image. | An example system includes: an information processing device including a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image transmission device transmitting the background image of the basic screen. The display processing unit of the information processing device automatically receives the background image transmitted by the background image transmission device and displays the received background image in the background of the selection image.1. An information processing system comprising:
an information processing device including a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image transmission device transmitting the background image of the basic screen, wherein the display processing unit of the information processing device automatically receives the background image transmitted by the background image transmission device and displays the received background image in the background of the selection image. 2. The information processing system according to claim 1, wherein the background image transmission device performs push-based information distribution of the background image. 3. The information processing system according to claim 1, wherein
the information processing device automatically performs transmission request to the background image transmission device for the background image, and wherein in response to the request from the information processing device, the background image transmission device transmits the background image. 4. The information processing system according to claim 1, wherein on a basis of a given transmission condition, the background image transmission device transmits the background image to the information processing device. 5. The information processing system according to claim 4, wherein the background image transmission device stores the background image provided with a type, and transmits a background image of a type defined as the given transmission condition for each information processing device. 6. The information processing system according to claim 5, wherein
the information processing device includes: a type setting reception unit receiving setting of the type; and a type setting transmission unit transmitting to the background image transmission device the setting received by the type setting reception unit, and wherein in accordance with setting of the type received from the information processing device, the background image transmission device transmits a background image. 7. The information processing system according to claim 1, wherein
the information processing device includes: a transmission permissibility setting reception unit receiving setting of permission or non-permission of transmission of the background image performed by the background image transmission device; and a transmission permissibility setting transmission unit transmitting to the background image transmission device the setting received by the transmission permissibility setting reception unit, and wherein in accordance with the setting of permission or non-permission received from the information processing device, the background image transmission device transmits the background image to the information processing device transmission to which is permitted. 8. The information processing system according to claim 1, wherein
the information processing device includes: a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 9. An information processing system comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of setting items, other than the background image, concerning a user interface. 10. An information processing device comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image reception unit automatically receiving the background image transmitted by a background image transmission device, wherein when the background image reception unit has automatically received the background image from the background image transmission device, the display processing unit displays the received background image in the background of the selection image. 11. An information processing device comprising:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 12. The information processing device according to claim 11, wherein the given condition is a condition concerning a date, a time of day, or a time. 13. The information processing device according to claim 11, wherein the given condition is a condition concerning execution of given application. 14. The information processing device according to claim 11, wherein the setting item to be changed by the change unit includes at least one of a BGM, a sound effect, a design of an icon, and a design of a window. 15. The information processing device according to claim 11, comprising
a type setting reception unit storing the background image provided with a type, and receiving setting of the type, wherein on a basis of the type whose setting has been received by the type setting reception unit, the change unit changes the background image and at least one of the setting items. 16. A non-transitory recording medium in which an information processing program is recorded, the program causing an information processing device to operate as:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a background image reception unit automatically receiving the background image transmitted by a background image transmission device, wherein when the background image reception unit has automatically received the background image from the background image transmission device, the display processing unit displays the received background image in the background of the selection image. 17. A non-transitory recording medium in which an information processing program is recorded, the program causing an information processing device to operate as:
a display processing unit performing processing of displaying on a display unit a basic screen containing a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; a determination unit determining whether a given condition has been satisfied; and a change unit, when the determination unit determines that the given condition has been satisfied, changing the background image and at least one of the setting items, other than the background image, concerning the user interface. 18. An information processing system comprising:
a first information processing device including at least one processor configured to display on a display a selection image and a background image, the selection image being constructed from one or a plurality of images used for receiving selection operation, the background image serving as a background of the selection image; and a second information processing device including at least one processor configured to transmit the background image to the first information processing device, wherein the at least one processor of the first information processing device is further configured to automatically receive the background image transmitted by the second information processing device and display the received background image in the background of the selection image. | 2,100 |
5,286 | 15,327,923 | 2,176 | An image is to be shared across a plurality of pages. Versions of attribute information are computed for the image, each of the versions of the attribute information associated with a respective different page of the plurality of pages, each version of the attribute information specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages. The plurality of pages are produced for output using the respective versions of the attribute information, the produced pages for output each including at least a portion of the image. | 1. A method comprising:
receiving, by a system including a processor, an image to be shared across a plurality of pages; computing, by the system, versions of attribute information for the image, each of the versions of the attribute information associated with a respective different page of the plurality of pages, each version of the attribute information specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages; and producing, by the system, the plurality of pages for output using the respective versions of the attribute information, the produced pages for output each including at least a portion of the image. 2. The method of claim 1, wherein a first version of the attribute information associated with a first page of the plurality pages is different from a second version of the attribute information associated with a second page of the plurality of pages. 3. The method of claim 1, wherein producing the plurality of pages for output that each includes the at least a portion of the image is performed without duplicating any part of the image in a memory of the system. 4. The method of claim 1, further comprising:
dividing the image into a plurality of tiles, wherein each of the versions of the attribute information includes multiple metadata for the corresponding tiles. 5. The method of claim 4, wherein each of the versions of the attribute information includes a data structure comprising a plurality of entries, each of the entries including metadata for a corresponding one of the tiles. 6. The method of claim 5, wherein each of the entries further includes a pointer to a next entry of the data structure, and wherein a given page of the plurality of pages comprises multiple images including the image to be shared, wherein each of the multiple images is associated with a respective data structure comprising entries each including metadata for a respective tile of the respective image, and
wherein to link a first image of the multiple images with a second image of the multiple images, an entry of the data structure associated with the first image includes a pointer to an entry of the data structure associated with the second image. 7. The method of claim 4, wherein the multiple metadata specify positions of the corresponding tiles. 8. The method of claim 4, wherein producing a given page of the plurality of pages comprises arranging the tiles in the given page using the multiple metadata of a respective one of the versions of the attribute information. 9. The method of claim 4, further comprising:
compressing the tiles and storing the compressed tiles in a storage medium; and accessing the compressed tiles for producing the plurality of pages. 10. A system comprising:
at least one processor to:
divide an image into a plurality of tiles;
generate a plurality of versions of attribute information for the tiles of the image, and associate the plurality of versions of the attribute information with respective pages that share at least one tile of the image, the plurality of versions including a first version associated with a first of the pages that differs from a second version associated with a second of the pages; and
arrange the shared at least one tile in the first page for output using a respective one of the versions of the attribute information. 11. The system of claim 10, wherein each version of the attribute information specifies positions and orientations of the tiles. 12. The system of claim 10, wherein the at least one processor is to further:
arrange the shared at least one tile in a second page for output using another respective one of the versions of the attribute information, wherein the at least one tile is arranged differently in the second page than in the first page. 13. The system of claim 10, wherein the shared at least one tile of the image is included in the first page that also includes another image. 14. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a system to:
receive an image to be shared across a plurality of pages; compute versions of a data structure for the image, each of the versions of the data structure associated with a respective different page of the plurality of pages, the data structure including metadata for the image, each version of the data structure specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages; and produce the plurality of pages for output using the respective versions of the data structure, the produced pages for output each including at least a portion of the image. 15. The article of claim 14, wherein the image is divided into a plurality of tiles, and the data structure comprises a plurality of entries including metadata for the respective tiles, the metadata of each of the plurality of entries including position information for the respective tile. | An image is to be shared across a plurality of pages. Versions of attribute information are computed for the image, each of the versions of the attribute information associated with a respective different page of the plurality of pages, each version of the attribute information specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages. The plurality of pages are produced for output using the respective versions of the attribute information, the produced pages for output each including at least a portion of the image.1. A method comprising:
receiving, by a system including a processor, an image to be shared across a plurality of pages; computing, by the system, versions of attribute information for the image, each of the versions of the attribute information associated with a respective different page of the plurality of pages, each version of the attribute information specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages; and producing, by the system, the plurality of pages for output using the respective versions of the attribute information, the produced pages for output each including at least a portion of the image. 2. The method of claim 1, wherein a first version of the attribute information associated with a first page of the plurality pages is different from a second version of the attribute information associated with a second page of the plurality of pages. 3. The method of claim 1, wherein producing the plurality of pages for output that each includes the at least a portion of the image is performed without duplicating any part of the image in a memory of the system. 4. The method of claim 1, further comprising:
dividing the image into a plurality of tiles, wherein each of the versions of the attribute information includes multiple metadata for the corresponding tiles. 5. The method of claim 4, wherein each of the versions of the attribute information includes a data structure comprising a plurality of entries, each of the entries including metadata for a corresponding one of the tiles. 6. The method of claim 5, wherein each of the entries further includes a pointer to a next entry of the data structure, and wherein a given page of the plurality of pages comprises multiple images including the image to be shared, wherein each of the multiple images is associated with a respective data structure comprising entries each including metadata for a respective tile of the respective image, and
wherein to link a first image of the multiple images with a second image of the multiple images, an entry of the data structure associated with the first image includes a pointer to an entry of the data structure associated with the second image. 7. The method of claim 4, wherein the multiple metadata specify positions of the corresponding tiles. 8. The method of claim 4, wherein producing a given page of the plurality of pages comprises arranging the tiles in the given page using the multiple metadata of a respective one of the versions of the attribute information. 9. The method of claim 4, further comprising:
compressing the tiles and storing the compressed tiles in a storage medium; and accessing the compressed tiles for producing the plurality of pages. 10. A system comprising:
at least one processor to:
divide an image into a plurality of tiles;
generate a plurality of versions of attribute information for the tiles of the image, and associate the plurality of versions of the attribute information with respective pages that share at least one tile of the image, the plurality of versions including a first version associated with a first of the pages that differs from a second version associated with a second of the pages; and
arrange the shared at least one tile in the first page for output using a respective one of the versions of the attribute information. 11. The system of claim 10, wherein each version of the attribute information specifies positions and orientations of the tiles. 12. The system of claim 10, wherein the at least one processor is to further:
arrange the shared at least one tile in a second page for output using another respective one of the versions of the attribute information, wherein the at least one tile is arranged differently in the second page than in the first page. 13. The system of claim 10, wherein the shared at least one tile of the image is included in the first page that also includes another image. 14. An article comprising at least one non-transitory machine-readable storage medium storing instructions that upon execution cause a system to:
receive an image to be shared across a plurality of pages; compute versions of a data structure for the image, each of the versions of the data structure associated with a respective different page of the plurality of pages, the data structure including metadata for the image, each version of the data structure specifying a respective arrangement of at least a portion of the image in the respective page of the plurality of pages; and produce the plurality of pages for output using the respective versions of the data structure, the produced pages for output each including at least a portion of the image. 15. The article of claim 14, wherein the image is divided into a plurality of tiles, and the data structure comprises a plurality of entries including metadata for the respective tiles, the metadata of each of the plurality of entries including position information for the respective tile. | 2,100 |
5,287 | 15,095,230 | 2,191 | Examples of techniques to deploy an application on an application platform are described. In an example, an input application design, that defines dependencies for the application for the components of the application platform based on capability attributes and characteristic attributes, is received. The capability attributes provide deployment requirements of the application and the characteristic attributes provide specifications of the deployment requirements. A candidate design comprising at least one of the components of the application platform is identified based on the attributes. The candidate design is a configuration of the application platform to deploy the application. A service design, that specifies operational requirements for deploying the application, is generated based on the candidate design. | 1. A method for deploying applications on application platforms, the method comprising:
receiving an input application design of an application, wherein the input application design defines dependencies for the application for components of an application platform based on capability attributes and characteristic attributes corresponding to the application, the capability attributes providing deployment requirements of the application and the characteristic attributes providing specifications of the capability attributes corresponding to the components of the application platform; identifying, based on the capability attributes and characteristic attributes, at least one candidate design comprising at least one of the components of the application platform, the at least one candidate design being a configuration of the application platform to deploy the application; and based on the at least one candidate design, generating a service design specifying operational requirements for deploying the application on the application platform. 2. The method as claimed in claim 1, wherein identifying the at least one candidate design comprises:
examining components of each of a plurality of designs of the application platform to identify eligible designs having components which conform with the deployment requirements of the application; ascertaining deployment requirements of the components of the each of the eligible designs; and identifying an eligible design as a candidate design when the deployment requirements of the components of the eligible design are satisfied by one or more components of the application platform. 3. The method as claimed in claim 1, further comprising:
causing a presentation of a preview of each of the at least one candidate design to a user; receiving a selection of a candidate design, from amongst the presented at least one candidate design, to generate the service design; and deploying the application in accordance with the service design. 4. The method as claimed in claim 3, wherein each of the at least one candidate design is presented in one of an interactive mode and a non-interactive mode, such that in the interactive mode, a candidate design to generate the service design is selected by the user and in the non-interactive mode, the candidate design to generate the service design is selected based on predefined rules. 5. The method as claimed in claim 4, wherein in the non-interactive mode, the candidate design to generate the service design is selected automatically based on a preference rating associated with each of the at least one candidate design. 6. The method as claimed in claim 1, wherein identifying the at least one candidate design is based on role-based access rules associated with a user deploying the application. 7. The method as claimed in claim 1 further comprising:
creating a checksum for the service design based on a unique identifier associated with the service design;
comparing the checksum of the service design with a checksum of another application to be deployed, the checksum of the another application being based on a unique identifier associated with the another application and revision and version of application components of the another application; and
reusing the service design for deploying the another application based on the comparison. 8. A system for deploying applications on application platforms, the system comprising:
a processor; a requirement identification module, coupled to the processor to:
receive an input application design of an application, the input application design defining dependencies for the application for components of an application platform based on a capability attribute that represent a deployment requirement of the application and characteristic attribute that provides a specification of the capability attribute corresponding to the components of the application platform;
a design identification module, coupled to the processor to:
identify, based on the capability attribute and characteristic attribute, at least one candidate design of the application platform to deploy the application, wherein the components of the application platform satisfy deployment requirements for implementing the candidate design; and
a service design generation module, coupled to the processor to:
create a service design based on the at least one candidate design, wherein the service design provides operational requirements to implement the at least one candidate design for deploying the application. 9. The system as claimed in claim 8 further comprising a deployment module, coupled to the processor to deploy the application in accordance with the service design. 10. The system as claimed in claim 8, wherein the requirement identification module is to receive a change in the characteristic attributes and wherein the design identification module is to identify the at least one candidate design based on the change in the characteristic attributes. 11. The system as claimed in claim 8, wherein to identify the at least one candidate design, the design identification module is to:
retrieve a plurality of designs of the application platform from a repository; examine components of each of the plurality of designs to identify eligible designs having components to fulfill the deployment requirements of the application; identify deployment requirements of the components of the each of the eligible designs; and designate an eligible design as a candidate design upon identifying the deployment requirements of the components of the eligible design to be satisfied by one or more components of the application platform. 12. The system as claimed in claim 11, wherein the design identification module is to retrieve the plurality of designs of the application platform based on role-based access rules associated with a user deploying the application. 13. The system as claimed in claim 8 further comprising a service design reuse module, coupled to the processor to:
generate a checksum of an application to be deployed based on a unique identifier associated with the application and revision and version of application components of the application;
generate a checksum of the service design based on a unique identifier associated with the service design;
compare the checksum of the service design with the checksum of application; and
reuse the service design for deploying the application based on the comparison. 14. A non-transitory computer-readable medium comprising instructions for deploying applications on application platforms, executable by a processing resource to:
receive an input application design of an application, the input application design defining dependencies for the application for components of an application platform based on capability attributes that indicate deployment requirements of the application and characteristic attributes that provide specifications corresponding to the deployment requirements; identify, based on the capability attributes and characteristic attributes of the application, at least one candidate design of the application platform, wherein to deploy the application on the least one candidate design additional deployment requirements of the at least one candidate design are satisfied by the application platform; and generate a service design based on the at least one candidate design, the service design comprising operational requirements for deploying the application on the application platform. 15. The non-transitory computer-readable medium as claimed in claim 14 further comprising instructions executable to:
examine components of each of a plurality of designs of the application platform to identify eligible designs having components which conform with the deployment requirements of the application;
ascertain deployment requirements of the components of the each of the eligible designs; and
identify an eligible design as a candidate design when the deployment requirements of the components of the eligible design are satisfied by one or more components of the application platform. | Examples of techniques to deploy an application on an application platform are described. In an example, an input application design, that defines dependencies for the application for the components of the application platform based on capability attributes and characteristic attributes, is received. The capability attributes provide deployment requirements of the application and the characteristic attributes provide specifications of the deployment requirements. A candidate design comprising at least one of the components of the application platform is identified based on the attributes. The candidate design is a configuration of the application platform to deploy the application. A service design, that specifies operational requirements for deploying the application, is generated based on the candidate design.1. A method for deploying applications on application platforms, the method comprising:
receiving an input application design of an application, wherein the input application design defines dependencies for the application for components of an application platform based on capability attributes and characteristic attributes corresponding to the application, the capability attributes providing deployment requirements of the application and the characteristic attributes providing specifications of the capability attributes corresponding to the components of the application platform; identifying, based on the capability attributes and characteristic attributes, at least one candidate design comprising at least one of the components of the application platform, the at least one candidate design being a configuration of the application platform to deploy the application; and based on the at least one candidate design, generating a service design specifying operational requirements for deploying the application on the application platform. 2. The method as claimed in claim 1, wherein identifying the at least one candidate design comprises:
examining components of each of a plurality of designs of the application platform to identify eligible designs having components which conform with the deployment requirements of the application; ascertaining deployment requirements of the components of the each of the eligible designs; and identifying an eligible design as a candidate design when the deployment requirements of the components of the eligible design are satisfied by one or more components of the application platform. 3. The method as claimed in claim 1, further comprising:
causing a presentation of a preview of each of the at least one candidate design to a user; receiving a selection of a candidate design, from amongst the presented at least one candidate design, to generate the service design; and deploying the application in accordance with the service design. 4. The method as claimed in claim 3, wherein each of the at least one candidate design is presented in one of an interactive mode and a non-interactive mode, such that in the interactive mode, a candidate design to generate the service design is selected by the user and in the non-interactive mode, the candidate design to generate the service design is selected based on predefined rules. 5. The method as claimed in claim 4, wherein in the non-interactive mode, the candidate design to generate the service design is selected automatically based on a preference rating associated with each of the at least one candidate design. 6. The method as claimed in claim 1, wherein identifying the at least one candidate design is based on role-based access rules associated with a user deploying the application. 7. The method as claimed in claim 1 further comprising:
creating a checksum for the service design based on a unique identifier associated with the service design;
comparing the checksum of the service design with a checksum of another application to be deployed, the checksum of the another application being based on a unique identifier associated with the another application and revision and version of application components of the another application; and
reusing the service design for deploying the another application based on the comparison. 8. A system for deploying applications on application platforms, the system comprising:
a processor; a requirement identification module, coupled to the processor to:
receive an input application design of an application, the input application design defining dependencies for the application for components of an application platform based on a capability attribute that represent a deployment requirement of the application and characteristic attribute that provides a specification of the capability attribute corresponding to the components of the application platform;
a design identification module, coupled to the processor to:
identify, based on the capability attribute and characteristic attribute, at least one candidate design of the application platform to deploy the application, wherein the components of the application platform satisfy deployment requirements for implementing the candidate design; and
a service design generation module, coupled to the processor to:
create a service design based on the at least one candidate design, wherein the service design provides operational requirements to implement the at least one candidate design for deploying the application. 9. The system as claimed in claim 8 further comprising a deployment module, coupled to the processor to deploy the application in accordance with the service design. 10. The system as claimed in claim 8, wherein the requirement identification module is to receive a change in the characteristic attributes and wherein the design identification module is to identify the at least one candidate design based on the change in the characteristic attributes. 11. The system as claimed in claim 8, wherein to identify the at least one candidate design, the design identification module is to:
retrieve a plurality of designs of the application platform from a repository; examine components of each of the plurality of designs to identify eligible designs having components to fulfill the deployment requirements of the application; identify deployment requirements of the components of the each of the eligible designs; and designate an eligible design as a candidate design upon identifying the deployment requirements of the components of the eligible design to be satisfied by one or more components of the application platform. 12. The system as claimed in claim 11, wherein the design identification module is to retrieve the plurality of designs of the application platform based on role-based access rules associated with a user deploying the application. 13. The system as claimed in claim 8 further comprising a service design reuse module, coupled to the processor to:
generate a checksum of an application to be deployed based on a unique identifier associated with the application and revision and version of application components of the application;
generate a checksum of the service design based on a unique identifier associated with the service design;
compare the checksum of the service design with the checksum of application; and
reuse the service design for deploying the application based on the comparison. 14. A non-transitory computer-readable medium comprising instructions for deploying applications on application platforms, executable by a processing resource to:
receive an input application design of an application, the input application design defining dependencies for the application for components of an application platform based on capability attributes that indicate deployment requirements of the application and characteristic attributes that provide specifications corresponding to the deployment requirements; identify, based on the capability attributes and characteristic attributes of the application, at least one candidate design of the application platform, wherein to deploy the application on the least one candidate design additional deployment requirements of the at least one candidate design are satisfied by the application platform; and generate a service design based on the at least one candidate design, the service design comprising operational requirements for deploying the application on the application platform. 15. The non-transitory computer-readable medium as claimed in claim 14 further comprising instructions executable to:
examine components of each of a plurality of designs of the application platform to identify eligible designs having components which conform with the deployment requirements of the application;
ascertain deployment requirements of the components of the each of the eligible designs; and
identify an eligible design as a candidate design when the deployment requirements of the components of the eligible design are satisfied by one or more components of the application platform. | 2,100 |
5,288 | 13,111,635 | 2,165 | A method, system and computer program product for graphically displaying lifecycle information of a governed object in a service registry in combination with the policies associated with the lifecycle states. Properties (e.g., object type, current lifecycle state) are retrieved for a governed object. Additionally, lifecycle definitions for the current lifecycle state and one or more potential future lifecycle states associated with the governed object are retrieved. Furthermore, policy definitions that apply to the object type, the current lifecycle state and one or more potential future lifecycle states are retrieved. A table is then built that correlates the retrieved lifecycle definitions with the retrieved policy definitions. A graphical representation is generated detailing the current lifecycle state, transitions to the one or more potential future lifecycle states and the policy definitions that apply to each transition for the governed object based on the built table. | 1-7. (canceled) 8. A computer program product embodied in a computer readable storage medium for graphically displaying lifecycle information of a governed object in combination with policies associated with lifecycle states, the computer program product comprising the programming instructions for:
retrieving properties of said governed object, wherein said properties comprise an object type and a current lifecycle state; retrieving lifecycle definitions for said current lifecycle state and one or more potential future lifecycle states associated with said governed object; retrieving policy definitions that apply to said object type, said current lifecycle state and said one or more potential future lifecycle states; building a table correlating said lifecycle definitions for said current lifecycle state and said one or more potential future lifecycle states with said policy definitions; and generating a graphical representation detailing said current lifecycle state, transitions to said one or more potential future lifecycle states and said policy definitions that apply to each transition for said governed object using said table. 9. The computer program product as recited in claim 8 further comprising the programming instructions for:
retrieving a governance record for said governed object, wherein said governance record comprises information directed to a historical transition and a historical lifecycle state of said governed object. 10. The computer program product as recited in claim 9 further comprising the programming instructions for:
generating said graphical representation detailing said historical transition and said historical lifecycle state of said governed object. 11. The computer program product as recited in claim 8, wherein said graphical representation is provided in an XML representation. 12. The computer program product as recited in claim 8, wherein said properties of said governed object are represented in a web ontology language. 13. The computer program product as recited in claim 8, wherein said lifecycle definitions are represented in a state adaptive choreography language. 14. The computer program product as recited in claim 8, wherein said policy definitions are represented in a WS-Policy. 15. A system, comprising:
a memory unit for storing a computer program for graphically displaying lifecycle information of a governed object in combination with policies associated with lifecycle states; and a processor coupled to said memory unit, wherein said processor, responsive to said computer program, comprises
circuitry for retrieving properties of said governed object, wherein said properties comprise an object type and a current lifecycle state;
circuitry for retrieving lifecycle definitions for said current lifecycle state and one or more potential future lifecycle states associated with said governed object;
circuitry for retrieving policy definitions that apply to said object type, said current lifecycle state and said one or more potential future lifecycle states;
circuitry for building a table correlating said lifecycle definitions for said current lifecycle state and said one or more potential future lifecycle states with said policy definitions; and
circuitry for generating a graphical representation detailing said current lifecycle state, transitions to said one or more potential future lifecycle states and said policy definitions that apply to each transition for said governed object using said table. 16. The system as recited in claim 15, wherein said processor further comprises:
circuitry for retrieving a governance record for said governed object, wherein said governance record comprises information directed to a historical transition and a historical lifecycle state of said governed object. 17. The system as recited in claim 16, wherein said processor further comprises:
circuitry for generating said graphical representation detailing said historical transition and said historical lifecycle state of said governed object. 18. The system as recited in claim 15, wherein said graphical representation is provided in an XML representation. 19. The system as recited in claim 15, wherein said properties of said governed object are represented in a web ontology language. 20. The system as recited in claim 15, wherein said lifecycle definitions are represented in a state adaptive choreography language. 21. The system as recited in claim 15, wherein said policy definitions are represented in a WS-Policy. | A method, system and computer program product for graphically displaying lifecycle information of a governed object in a service registry in combination with the policies associated with the lifecycle states. Properties (e.g., object type, current lifecycle state) are retrieved for a governed object. Additionally, lifecycle definitions for the current lifecycle state and one or more potential future lifecycle states associated with the governed object are retrieved. Furthermore, policy definitions that apply to the object type, the current lifecycle state and one or more potential future lifecycle states are retrieved. A table is then built that correlates the retrieved lifecycle definitions with the retrieved policy definitions. A graphical representation is generated detailing the current lifecycle state, transitions to the one or more potential future lifecycle states and the policy definitions that apply to each transition for the governed object based on the built table.1-7. (canceled) 8. A computer program product embodied in a computer readable storage medium for graphically displaying lifecycle information of a governed object in combination with policies associated with lifecycle states, the computer program product comprising the programming instructions for:
retrieving properties of said governed object, wherein said properties comprise an object type and a current lifecycle state; retrieving lifecycle definitions for said current lifecycle state and one or more potential future lifecycle states associated with said governed object; retrieving policy definitions that apply to said object type, said current lifecycle state and said one or more potential future lifecycle states; building a table correlating said lifecycle definitions for said current lifecycle state and said one or more potential future lifecycle states with said policy definitions; and generating a graphical representation detailing said current lifecycle state, transitions to said one or more potential future lifecycle states and said policy definitions that apply to each transition for said governed object using said table. 9. The computer program product as recited in claim 8 further comprising the programming instructions for:
retrieving a governance record for said governed object, wherein said governance record comprises information directed to a historical transition and a historical lifecycle state of said governed object. 10. The computer program product as recited in claim 9 further comprising the programming instructions for:
generating said graphical representation detailing said historical transition and said historical lifecycle state of said governed object. 11. The computer program product as recited in claim 8, wherein said graphical representation is provided in an XML representation. 12. The computer program product as recited in claim 8, wherein said properties of said governed object are represented in a web ontology language. 13. The computer program product as recited in claim 8, wherein said lifecycle definitions are represented in a state adaptive choreography language. 14. The computer program product as recited in claim 8, wherein said policy definitions are represented in a WS-Policy. 15. A system, comprising:
a memory unit for storing a computer program for graphically displaying lifecycle information of a governed object in combination with policies associated with lifecycle states; and a processor coupled to said memory unit, wherein said processor, responsive to said computer program, comprises
circuitry for retrieving properties of said governed object, wherein said properties comprise an object type and a current lifecycle state;
circuitry for retrieving lifecycle definitions for said current lifecycle state and one or more potential future lifecycle states associated with said governed object;
circuitry for retrieving policy definitions that apply to said object type, said current lifecycle state and said one or more potential future lifecycle states;
circuitry for building a table correlating said lifecycle definitions for said current lifecycle state and said one or more potential future lifecycle states with said policy definitions; and
circuitry for generating a graphical representation detailing said current lifecycle state, transitions to said one or more potential future lifecycle states and said policy definitions that apply to each transition for said governed object using said table. 16. The system as recited in claim 15, wherein said processor further comprises:
circuitry for retrieving a governance record for said governed object, wherein said governance record comprises information directed to a historical transition and a historical lifecycle state of said governed object. 17. The system as recited in claim 16, wherein said processor further comprises:
circuitry for generating said graphical representation detailing said historical transition and said historical lifecycle state of said governed object. 18. The system as recited in claim 15, wherein said graphical representation is provided in an XML representation. 19. The system as recited in claim 15, wherein said properties of said governed object are represented in a web ontology language. 20. The system as recited in claim 15, wherein said lifecycle definitions are represented in a state adaptive choreography language. 21. The system as recited in claim 15, wherein said policy definitions are represented in a WS-Policy. | 2,100 |
5,289 | 13,333,605 | 2,177 | This invention discloses a novel system and method for displaying electronic documents on remote devices and enabling collaborative editing in conjunction with an Entity Content Management system | 1. A system for providing remote access to documents stored in a computer memory comprising a first and second server and a remote device where the remote device is adapted to receive directory listings from the second server, transmit one or more commands to the second server, at least one of said commands comprised of a data message containing a request for a document referenced by the received directory listing, so as to cause the second server to authenticate the request from the remote device and to request the document from the first server so as to cause the first server to transmit the document to the second server. 2. The system of claim 1 where at least one of said commands is comprised of a data message containing a request for one of renaming, deleting, copying, or moving said document and the second server is adapted to cause the at least one commands to be transmitted to the first server for execution. 3. The system of claim 2 where the remote device is a computer operating an Internet browser that is operating a secure protocol to provide web based access to the second server in order to access data from the first server. 4. The system of claim 1 where the remote device is adapted so that it the data messages that it transmits to the second server are further comprised of an authentication token. 5. The system of claim 1 where at least one of the commands is a data message requesting that the second server retrieve a directory structure from the first server, then transmit the retrieved directory structure to the remote device. 6. The system of claim 1 where the system is adapted to cause a plurality of the files on the second server to he copied to the first server upon the occurrence of a predetermined condition. 7. The system of claim 6 adapted so that the data files copied to the first server are deleted from. the second server, 8. The system of claim 6 where trigger is based on a. predetermined test of metadata associated with the files on the second server. 9. System of claim 6 where the predetermined condition is based on the content present in the files. 10. The system of claim 6 where the system is adapted so that the metadata, markups and comments associated with the plurality of data files are expunged after the files are moved into first server. 11. The system of claim 6 adapted to cause a geographic identifier to be embedded in the document at the remote device, so as to cause the first server to selectively determine whether to permit the file to be stored on the first server based on value of the geographic identifier, 12. system of claim 11 adapted to cause the file to be quarantined if the geographic identifier is from a. predetermined no permission location. 13. The system of Claim I further comprising an adaptation to cause the first server to store a plurality of pre-selected documents in local storage on the second server. 14. The system of claim 13 where the pre-selection is based on one of search, metadata, tracking, activity history and user behavior. 15. The system of claim 13 where the logical ocation of the local storage is associated with a user identity. 16. The system of claim 13 where the pre-selected documents are selected on a determination that the selected document has metadata that makes the document related to metadata associated with a document already present in the local storage. 17. The system of claim 13 where the selectively retrieved documents are selected on a determination that the selected document is a document that in the past was selected by a user after having requested a document already present in the local storage. 18. The system of claim 1 where the remote device is adapted to present on its user interface screen two regions, one that presents icons associated with items stored on the second server and the other icons associated with items stored on the first server. 19. The system of claim 1 where the second server is adapted to provide a storage directory exclusively associated with the user operating the remote device where all documents requested by said user to be retrieved from the first server are stored. 20. The system of claim 18 adapted so that the remote device detects the condition when the user has selected an icon on the user interface region associated with the first server and has dragged the icon to the region associated with the second server so as to cause a command to be transmitted from the remote device to the second server requesting that the second server request the document associated with the selected icon to be transmitted from the first server to the second server. 21. The system of claim 1 adapted so that the second server can determine that the remote device does not have the latest version of the document and in that condition, to transmit the latest version of the document to the remote device. 22. The system of claim 1 where the commands between the remote device, the second server and first server are process to process messages. 23. The system of claim 1 adapted so that a data flag representing the condition that the requested document has been changed is set and so that periodically, the second server can determine document files whose data flags are set in order to cause the document files to be transmitted to the first server and stored at their associated locations on the first server. 24. The system of claim 23 further adapted so that upon a trigger condition, the document file is transmitted to the first server and stored at the associated location on the first server, said trigger condition being one of: the time stamp in the metadata associated with the document is younger than the original time stamp, the document is a new document, and external command from an authorized party. 25. The system of claim 1 further adapted to cause the second server to check for condition flags in the metadata associated with the document and based on the condition flag state, cause the file to be transmitted to the remote device. 26. The system of claim 1 further adapted to present on the remote device display screen a tree diagram showing the lineage of historical changes or versions of the document. 27. The system of claim 26 further adapted to permit the user to select a node on the displayed tree diagram so as to select for download to the remote device, that selected version of the document. 28. The system of claim 1 further adapted to detect the condition that the version of the document transmitted to the remote device has been superceded by a newer version and to cause a message to be transmitted to the remote device alerting the user of that condition. 29. The system of claim 1 further adapted to cause the remote device email client to automatically route an email associated with a predetermined folder with an associated identity that has a. document attached, to be forwarded to the second server so as to cause the second server to isolate the document from the email and store the document in a directory location associated with the associated identity. 30. The system of claim 29 further adapted to cause the second server to generate and store metadata based on the information present in the email data and to have the generated metadata to be associated with the stored document. 31. The system of claim 30 further adapted to cause a. selection of an identity determined to be associated with the sender of the email to be inserted into the metadata. | This invention discloses a novel system and method for displaying electronic documents on remote devices and enabling collaborative editing in conjunction with an Entity Content Management system1. A system for providing remote access to documents stored in a computer memory comprising a first and second server and a remote device where the remote device is adapted to receive directory listings from the second server, transmit one or more commands to the second server, at least one of said commands comprised of a data message containing a request for a document referenced by the received directory listing, so as to cause the second server to authenticate the request from the remote device and to request the document from the first server so as to cause the first server to transmit the document to the second server. 2. The system of claim 1 where at least one of said commands is comprised of a data message containing a request for one of renaming, deleting, copying, or moving said document and the second server is adapted to cause the at least one commands to be transmitted to the first server for execution. 3. The system of claim 2 where the remote device is a computer operating an Internet browser that is operating a secure protocol to provide web based access to the second server in order to access data from the first server. 4. The system of claim 1 where the remote device is adapted so that it the data messages that it transmits to the second server are further comprised of an authentication token. 5. The system of claim 1 where at least one of the commands is a data message requesting that the second server retrieve a directory structure from the first server, then transmit the retrieved directory structure to the remote device. 6. The system of claim 1 where the system is adapted to cause a plurality of the files on the second server to he copied to the first server upon the occurrence of a predetermined condition. 7. The system of claim 6 adapted so that the data files copied to the first server are deleted from. the second server, 8. The system of claim 6 where trigger is based on a. predetermined test of metadata associated with the files on the second server. 9. System of claim 6 where the predetermined condition is based on the content present in the files. 10. The system of claim 6 where the system is adapted so that the metadata, markups and comments associated with the plurality of data files are expunged after the files are moved into first server. 11. The system of claim 6 adapted to cause a geographic identifier to be embedded in the document at the remote device, so as to cause the first server to selectively determine whether to permit the file to be stored on the first server based on value of the geographic identifier, 12. system of claim 11 adapted to cause the file to be quarantined if the geographic identifier is from a. predetermined no permission location. 13. The system of Claim I further comprising an adaptation to cause the first server to store a plurality of pre-selected documents in local storage on the second server. 14. The system of claim 13 where the pre-selection is based on one of search, metadata, tracking, activity history and user behavior. 15. The system of claim 13 where the logical ocation of the local storage is associated with a user identity. 16. The system of claim 13 where the pre-selected documents are selected on a determination that the selected document has metadata that makes the document related to metadata associated with a document already present in the local storage. 17. The system of claim 13 where the selectively retrieved documents are selected on a determination that the selected document is a document that in the past was selected by a user after having requested a document already present in the local storage. 18. The system of claim 1 where the remote device is adapted to present on its user interface screen two regions, one that presents icons associated with items stored on the second server and the other icons associated with items stored on the first server. 19. The system of claim 1 where the second server is adapted to provide a storage directory exclusively associated with the user operating the remote device where all documents requested by said user to be retrieved from the first server are stored. 20. The system of claim 18 adapted so that the remote device detects the condition when the user has selected an icon on the user interface region associated with the first server and has dragged the icon to the region associated with the second server so as to cause a command to be transmitted from the remote device to the second server requesting that the second server request the document associated with the selected icon to be transmitted from the first server to the second server. 21. The system of claim 1 adapted so that the second server can determine that the remote device does not have the latest version of the document and in that condition, to transmit the latest version of the document to the remote device. 22. The system of claim 1 where the commands between the remote device, the second server and first server are process to process messages. 23. The system of claim 1 adapted so that a data flag representing the condition that the requested document has been changed is set and so that periodically, the second server can determine document files whose data flags are set in order to cause the document files to be transmitted to the first server and stored at their associated locations on the first server. 24. The system of claim 23 further adapted so that upon a trigger condition, the document file is transmitted to the first server and stored at the associated location on the first server, said trigger condition being one of: the time stamp in the metadata associated with the document is younger than the original time stamp, the document is a new document, and external command from an authorized party. 25. The system of claim 1 further adapted to cause the second server to check for condition flags in the metadata associated with the document and based on the condition flag state, cause the file to be transmitted to the remote device. 26. The system of claim 1 further adapted to present on the remote device display screen a tree diagram showing the lineage of historical changes or versions of the document. 27. The system of claim 26 further adapted to permit the user to select a node on the displayed tree diagram so as to select for download to the remote device, that selected version of the document. 28. The system of claim 1 further adapted to detect the condition that the version of the document transmitted to the remote device has been superceded by a newer version and to cause a message to be transmitted to the remote device alerting the user of that condition. 29. The system of claim 1 further adapted to cause the remote device email client to automatically route an email associated with a predetermined folder with an associated identity that has a. document attached, to be forwarded to the second server so as to cause the second server to isolate the document from the email and store the document in a directory location associated with the associated identity. 30. The system of claim 29 further adapted to cause the second server to generate and store metadata based on the information present in the email data and to have the generated metadata to be associated with the stored document. 31. The system of claim 30 further adapted to cause a. selection of an identity determined to be associated with the sender of the email to be inserted into the metadata. | 2,100 |
5,290 | 14,037,029 | 2,169 | The present invention improves the SEO of a website by incorporating related keywords into the website based on an identified category for the website. The category for the website may be identified via keywords within the website matched to one or more categories containing the identified keywords and stored within a database. The keywords may be further matched to one or more related keywords within the one or more categories. Each of these related keywords may be scored according to category relevance, and may further be recommended to the website owner for inclusion on the website. Positive responses by the website owner to the recommended related keywords may increase the related keyword score, while negative responses may decrease the score. | 1. A method, comprising:
A) storing in an electronic database a plurality of universal keywords and a plurality of related keywords, wherein at least one universal keyword is associated with a related keyword; B) analyzing a website, designed by a website builder, having a text; C) finding a first universal keyword in the text; D) determining a first related keyword in the electronic database associated with the first universal keyword; E) displaying on an electronic device the first related keyword to the website builder; F) accepting from the website builder a response to the first related keyword; and G) if the response is a positive response from the website builder for the first related keyword, incorporating the first related keyword into the website. 2. The method of claim 1, further comprising the step of hosting the website. 3. The method of claim 1, further comprising the step of providing a website development tool to allow the website builder to build the website. 4. The method of claim 1, wherein the determined first related keyword in step D) is not incorporated into the website prior to step G). 5. The method of claim 1, further comprising the steps of:
H) finding a second universal keyword in the text; I) determining two or more related keywords in the electronic database that are associated with the second universal keyword; J) displaying on the electronic device the two or more related keywords to the website builder; K) accepting from the website builder a response for each of the two or more related keywords; and L) incorporating each related keyword in the two or more related keywords into the website for each related keyword that received a positive response from the website builder. 6. The method of claim 1, wherein at least one universal keyword in the plurality of universal keywords is associated with a category. 7. The method of claim 1, wherein at least one related keyword in the plurality of related keywords is associated with a score. 8. The method of claim 1, wherein at least one universal keyword in the plurality of universal keywords is associated with a category, wherein the category is associated with a second related keyword in the plurality of keywords, and wherein the second related keyword is associated with a score. 9. A method, comprising:
A) storing in an electronic database a plurality of categories, a plurality of universal keywords, and a plurality of related keywords, wherein at least one category is associated with at least one universal keyword and wherein at least one universal keyword is associated with at least one related keyword; B) determining a first category for a website; C) analyzing the website, built by a website builder, having a text; D) finding a first universal keyword in the text associated with the first category; E) determining a first related keyword associated with the first universal keyword; F) displaying on an electronic device the first related keyword to the website builder; G) accepting from the website builder a response to the first related keyword; and H) if the response is a positive response, incorporating the first related keyword into the website. 10. The method of claim 9, further comprising the step of hosting the website. 11. The method of claim 9, further comprising the step of providing a website development tool to allow the website builder to build the website. 12. The method of claim 9, wherein at least one category in the plurality of categories is associated with two or more universal keywords and wherein at least one universal keyword is associated with at least one related keyword in the plurality of related keywords. 13. The method of claim 9, wherein the determined first related keyword in step E) is not incorporated into the website prior to step H). 14. The method of claim 9, further comprising the steps of:
H) finding a second universal keyword in the text associated with the first category; I) determining two or more related keywords in the electronic database that are associated with the second universal keyword; J) displaying on the electronic device the two or more related keywords to the website builder; K) accepting from the website builder a response for each of the two or more related keywords; and L) incorporating each related keyword in the two or more related keywords into the website for each related keyword that received a positive response from the website builder. 15. The method of claim 9, wherein at least one related keyword in the plurality of related keywords is associated with a score. 16. A method, comprising:
A) storing in an electronic database a plurality of universal keywords, a plurality of related keywords, and a plurality of scores wherein at least one universal keyword is associated with a related keyword, and wherein at least one related keyword is associated with a score; B) analyzing a website, built by a website builder, having a text; C) finding a universal keyword in the text; D) determining a related keyword associated with the universal keyword in the electronic database; E) determining a score associated with the related keyword in the electronic database; F) using the score to determine if the related keyword should be displayed to the website builder; G) if the related keyword should be displayed to the website builder based on the score:
i) displaying on an electronic device the related keyword to the website builder;
ii) accepting from the website builder a response to the related keyword;
iii) if the response is a negative response, reducing the score in the electronic database associated with the related keyword; and
iv) if the response is a positive response:
a) incorporating the related keyword into the website; and
b) increasing the score in the electronic database associated with the related keyword. 17. The method of claim 16, further comprising the step of:
H) hosting the website. 18. The method of claim 16, further comprising the step of:
H) providing a website development tool to allow the website builder to build the website. 19. The method of claim 16, wherein at least one universal keyword in the plurality of universal keywords is associated with at least two related keywords in the plurality of related keywords. 20. The method of claim 16, further comprising the steps of:
H) finding a second universal keyword in the text; I) determining a second related keyword and a third related keyword in the electronic database that are associated with the second universal keyword; J) determining a second score associated with the second related keyword and a third score associated with the third related keyword in the electronic database; K) using the second score to determine if the second related keyword should be displayed to the website builder; L) if the second related keyword should be displayed to the website builder based on the score:
i) displaying on the electronic device the second related keyword to the website builder;
ii) accepting from the website builder a second response for the second related keyword;
iii) if the second response is a positive response from the website builder:
a) incorporating the second related keyword into the website; and
b) increasing the second score;
iv) if the second response is a negative response, decreasing the second score; and
M) using the third score to determine if the third related keyword should be displayed to the website builder; N) if the third related keyword should be displayed to the website builder based on the third score:
i) displaying on the electronic device the third related keyword to the website builder;
ii) accepting from the website builder a third response for the third related keyword;
iii) if the third response is positive from the website builder:
a) incorporating the third related keyword into the website; and
b) increasing the third score; and
iv) if the third response is negative from the web site builder, decreasing the third score. 21. A method, comprising:
A) storing in an electronic database a plurality of categories, a plurality of universal keywords, a plurality of related keywords, and a plurality of scores, wherein each category is associated with at least one universal keyword, wherein at least one universal keyword is associated with at least one related keyword, and wherein at least one related keyword is associated with a score; B) determining a category within the plurality of categories, for a website designed by a website builder, having a text; C) analyzing the text; D) finding a universal keyword within the plurality of universal keywords associated with the category, in the text; E) determining a related keyword within the plurality of related keywords associated with the universal keyword; F) finding a score within the plurality of scores associated with the related keyword; G) using the score to determine if the related keyword should be displayed to the website builder; H) if the related keyword should be displayed to the website builder based on the score:
i) displaying on an electronic device the related keyword to the website builder;
ii) accepting from the website builder a response to the related keyword;
iii) if the response is a negative response from the website builder for the related keyword, reducing the score in the electronic database associated with the related keyword; and
iv) if the response is a positive response from the website builder for the related keyword:
a) incorporating the related keyword into the website; and
b) increasing the score in the electronic database associated with the related keyword. | The present invention improves the SEO of a website by incorporating related keywords into the website based on an identified category for the website. The category for the website may be identified via keywords within the website matched to one or more categories containing the identified keywords and stored within a database. The keywords may be further matched to one or more related keywords within the one or more categories. Each of these related keywords may be scored according to category relevance, and may further be recommended to the website owner for inclusion on the website. Positive responses by the website owner to the recommended related keywords may increase the related keyword score, while negative responses may decrease the score.1. A method, comprising:
A) storing in an electronic database a plurality of universal keywords and a plurality of related keywords, wherein at least one universal keyword is associated with a related keyword; B) analyzing a website, designed by a website builder, having a text; C) finding a first universal keyword in the text; D) determining a first related keyword in the electronic database associated with the first universal keyword; E) displaying on an electronic device the first related keyword to the website builder; F) accepting from the website builder a response to the first related keyword; and G) if the response is a positive response from the website builder for the first related keyword, incorporating the first related keyword into the website. 2. The method of claim 1, further comprising the step of hosting the website. 3. The method of claim 1, further comprising the step of providing a website development tool to allow the website builder to build the website. 4. The method of claim 1, wherein the determined first related keyword in step D) is not incorporated into the website prior to step G). 5. The method of claim 1, further comprising the steps of:
H) finding a second universal keyword in the text; I) determining two or more related keywords in the electronic database that are associated with the second universal keyword; J) displaying on the electronic device the two or more related keywords to the website builder; K) accepting from the website builder a response for each of the two or more related keywords; and L) incorporating each related keyword in the two or more related keywords into the website for each related keyword that received a positive response from the website builder. 6. The method of claim 1, wherein at least one universal keyword in the plurality of universal keywords is associated with a category. 7. The method of claim 1, wherein at least one related keyword in the plurality of related keywords is associated with a score. 8. The method of claim 1, wherein at least one universal keyword in the plurality of universal keywords is associated with a category, wherein the category is associated with a second related keyword in the plurality of keywords, and wherein the second related keyword is associated with a score. 9. A method, comprising:
A) storing in an electronic database a plurality of categories, a plurality of universal keywords, and a plurality of related keywords, wherein at least one category is associated with at least one universal keyword and wherein at least one universal keyword is associated with at least one related keyword; B) determining a first category for a website; C) analyzing the website, built by a website builder, having a text; D) finding a first universal keyword in the text associated with the first category; E) determining a first related keyword associated with the first universal keyword; F) displaying on an electronic device the first related keyword to the website builder; G) accepting from the website builder a response to the first related keyword; and H) if the response is a positive response, incorporating the first related keyword into the website. 10. The method of claim 9, further comprising the step of hosting the website. 11. The method of claim 9, further comprising the step of providing a website development tool to allow the website builder to build the website. 12. The method of claim 9, wherein at least one category in the plurality of categories is associated with two or more universal keywords and wherein at least one universal keyword is associated with at least one related keyword in the plurality of related keywords. 13. The method of claim 9, wherein the determined first related keyword in step E) is not incorporated into the website prior to step H). 14. The method of claim 9, further comprising the steps of:
H) finding a second universal keyword in the text associated with the first category; I) determining two or more related keywords in the electronic database that are associated with the second universal keyword; J) displaying on the electronic device the two or more related keywords to the website builder; K) accepting from the website builder a response for each of the two or more related keywords; and L) incorporating each related keyword in the two or more related keywords into the website for each related keyword that received a positive response from the website builder. 15. The method of claim 9, wherein at least one related keyword in the plurality of related keywords is associated with a score. 16. A method, comprising:
A) storing in an electronic database a plurality of universal keywords, a plurality of related keywords, and a plurality of scores wherein at least one universal keyword is associated with a related keyword, and wherein at least one related keyword is associated with a score; B) analyzing a website, built by a website builder, having a text; C) finding a universal keyword in the text; D) determining a related keyword associated with the universal keyword in the electronic database; E) determining a score associated with the related keyword in the electronic database; F) using the score to determine if the related keyword should be displayed to the website builder; G) if the related keyword should be displayed to the website builder based on the score:
i) displaying on an electronic device the related keyword to the website builder;
ii) accepting from the website builder a response to the related keyword;
iii) if the response is a negative response, reducing the score in the electronic database associated with the related keyword; and
iv) if the response is a positive response:
a) incorporating the related keyword into the website; and
b) increasing the score in the electronic database associated with the related keyword. 17. The method of claim 16, further comprising the step of:
H) hosting the website. 18. The method of claim 16, further comprising the step of:
H) providing a website development tool to allow the website builder to build the website. 19. The method of claim 16, wherein at least one universal keyword in the plurality of universal keywords is associated with at least two related keywords in the plurality of related keywords. 20. The method of claim 16, further comprising the steps of:
H) finding a second universal keyword in the text; I) determining a second related keyword and a third related keyword in the electronic database that are associated with the second universal keyword; J) determining a second score associated with the second related keyword and a third score associated with the third related keyword in the electronic database; K) using the second score to determine if the second related keyword should be displayed to the website builder; L) if the second related keyword should be displayed to the website builder based on the score:
i) displaying on the electronic device the second related keyword to the website builder;
ii) accepting from the website builder a second response for the second related keyword;
iii) if the second response is a positive response from the website builder:
a) incorporating the second related keyword into the website; and
b) increasing the second score;
iv) if the second response is a negative response, decreasing the second score; and
M) using the third score to determine if the third related keyword should be displayed to the website builder; N) if the third related keyword should be displayed to the website builder based on the third score:
i) displaying on the electronic device the third related keyword to the website builder;
ii) accepting from the website builder a third response for the third related keyword;
iii) if the third response is positive from the website builder:
a) incorporating the third related keyword into the website; and
b) increasing the third score; and
iv) if the third response is negative from the web site builder, decreasing the third score. 21. A method, comprising:
A) storing in an electronic database a plurality of categories, a plurality of universal keywords, a plurality of related keywords, and a plurality of scores, wherein each category is associated with at least one universal keyword, wherein at least one universal keyword is associated with at least one related keyword, and wherein at least one related keyword is associated with a score; B) determining a category within the plurality of categories, for a website designed by a website builder, having a text; C) analyzing the text; D) finding a universal keyword within the plurality of universal keywords associated with the category, in the text; E) determining a related keyword within the plurality of related keywords associated with the universal keyword; F) finding a score within the plurality of scores associated with the related keyword; G) using the score to determine if the related keyword should be displayed to the website builder; H) if the related keyword should be displayed to the website builder based on the score:
i) displaying on an electronic device the related keyword to the website builder;
ii) accepting from the website builder a response to the related keyword;
iii) if the response is a negative response from the website builder for the related keyword, reducing the score in the electronic database associated with the related keyword; and
iv) if the response is a positive response from the website builder for the related keyword:
a) incorporating the related keyword into the website; and
b) increasing the score in the electronic database associated with the related keyword. | 2,100 |
5,291 | 14,385,302 | 2,185 | A modular server system includes a plurality of server groups, wherein each server group is adapted to receive a plurality of server modules, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components and includes a switching arrangement with at least one switch element, wherein each of the plurality of I/O groups is allocated to exactly one of the plurality of server groups, the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of I/O components of the I/O group, the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of server modules of the server group allocated to the I/O group, and the switch arrangement of each I/O group is coupled by a data link to at least one other switch arrangement of another I/O group. | 1.-12. (canceled) 13. A modular server system comprising:
a plurality of server groups, wherein each server group is adapted to receive a plurality of server modules, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components and comprises a switching arrangement with at least one switch element,
wherein
each of the plurality of I/O groups is allocated to exactly one of the plurality of server groups,
the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of I/O components of the I/O group,
the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of server modules of the server group allocated to the I/O group, and
the switch arrangement of each I/O group is coupled by a data link to at least one other switch arrangement of another I/O group. 14. The modular server system according to claim 13, wherein at least one first I/O group of the plurality of I/O groups comprises at least one first subgroup with a first switch element and a second subgroup with a second switch element, the first switch element is directly coupled by a data link to each server module of a first server group allocated to the first I/O group and the second switch element is directly coupled by a data link to each server module of the first server group. 15. The modular server system according to claim 13, further comprising at least one shared printed circuit board with a plurality of first electrical connections that couple the server groups to the respective allocated I/O groups by a data link. 16. The modular server system according to claim 15, wherein the at least one shared printed circuit board comprises a plurality of further electrical connections that couple together the switch arrangements of the plurality of I/O groups by a data link. 17. The modular server system according to claim 13, wherein the coupling by a data link via point-to-point connections is established with a plurality of data lines according to the PCI Express standard. 18. The modular server system according to claim 13, wherein the at least one first I/O component of the plurality of I/O components can be shared by a plurality of server modules, and the first I/O component is one of a power supply component with a plurality of functional units and a mass storage component. 19. The modular server system according to claim 13, wherein the plurality of I/O components of at least one first I/O group of the plurality of I/O groups and/or the plurality of server modules of at least one allocated first server group of the plurality of server groups form a redundant system so that on failure of one of the I/O components of the first I/O group and/or on failure of one of the server modules of the first server group, remaining I/O components of the first I/O group and remaining server modules of the first server group are able to assume the function of the failed components. 20. The modular server system according to claim 13, wherein first data connections between server modules of a first server group and I/O components of a first I/O group allocated to the first server group have a higher data rate and/or a lower latency than second data connections between server modules of the first server group and I/O components of a second I/O group not allocated to the first server group. 21. The modular server system according to claim 13, wherein each server module comprises at least one processor and at least one main memory associated with the processor. 22. A modular server system comprising:
a plurality of server groups, each server group adapted to receive a plurality of server modules and comprising a switch arrangement with at least one switch element, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components,
wherein
each of the plurality of server groups is allocated exactly one of the plurality of I/O groups,
the switch arrangement of each server group is directly coupled by a data link to each of the plurality of server modules of the server group,
the switch arrangement of each server group is directly coupled by a data link to each of the plurality of I/O components of the I/O group allocated to the server group, and
the switch arrangement of each server group is directly coupled by a data link to at least one other switch arrangement of another server group. 23. The modular server system according to claim 22, further comprising at least one shared printed circuit board with a plurality of first electrical connections that couple the server groups to the respective allocated I/O groups by a data link. 24. The modular server system according to claim 23, wherein the at least one shared printed circuit board comprises a plurality of further electrical connections that couple together the switch arrangements of the plurality of server groups by a data link. 25. The modular server system according to claim 22, wherein the coupling by a data link via point-to-point connections is established with a plurality of data lines according to the PCI Express standard. 26. The modular server system according to claim 22, wherein the at least one first I/O component of the plurality of I/O components can be shared by a plurality of server modules, and the first I/O component is one of a power supply component with a plurality of functional units and a mass storage component. 27. The modular server system according to claim 22, wherein the plurality of I/O components of at least one first I/O group of the plurality of I/O groups and/or the plurality of server modules of at least one allocated first server group of the plurality of server groups form a redundant system so that on failure of one of the I/O components of the first I/O group and/or on failure of one of the server modules of the first server group, the remaining I/O components of the first I/O group and the remaining server modules of the first server group are able to assume the function of the failed components. 28. The modular server system according to claim 22, wherein first data connections between server modules of a first server group and I/O components of a first I/O group allocated to the first server group have a higher data rate and/or a lower latency than second data connections between server modules of the first server group and I/O components of a second I/O group not allocated to the first server group. 29. An I/O module for use in a modular server system comprising:
at least one module printed circuit board, at least one first terminal arranged on the module printed circuit board for a first I/O component, at least one second terminal arranged on the module printed circuit board for a second I/O component, at least one plug arranged on the module printed circuit board that couples the I/O module to a shared printed circuit board of the modular server system by a data link, and at least one switch element arranged on the module printed circuit board that selectively establishes data connections between a predetermined group of server modules of the modular server system, said predetermined group being allocated to the I/O module, and the first and/or second I/O component, and establishes data connections between the predetermined group of server modules of the modular server system and a switch element of a similar I/O module. 30. A switching method for a modular server system comprising:
directly establishing first data connections between a first component of a first type of a first group of similar components, and a second component of a second type of a second group of similar components via a first switch element of the second group; and indirectly establishing second data connections between the first component of the first group and a third component of the second type via the first switch element and a second switch element of the third group. 31. The method according to claim 30, wherein the first data connections have a higher data rate and/or a lower latency than the second data connections. 32. The method according to claim 30, wherein the first data connections can be used exclusively by the first component of the first group and the second component of the second group and wherein the second data connections can be shared by a plurality of components of the first group and/or a plurality of third components of the third group via a multiplex operation. | A modular server system includes a plurality of server groups, wherein each server group is adapted to receive a plurality of server modules, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components and includes a switching arrangement with at least one switch element, wherein each of the plurality of I/O groups is allocated to exactly one of the plurality of server groups, the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of I/O components of the I/O group, the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of server modules of the server group allocated to the I/O group, and the switch arrangement of each I/O group is coupled by a data link to at least one other switch arrangement of another I/O group.1.-12. (canceled) 13. A modular server system comprising:
a plurality of server groups, wherein each server group is adapted to receive a plurality of server modules, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components and comprises a switching arrangement with at least one switch element,
wherein
each of the plurality of I/O groups is allocated to exactly one of the plurality of server groups,
the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of I/O components of the I/O group,
the switch arrangement of each I/O group is directly coupled by a data link to each of the plurality of server modules of the server group allocated to the I/O group, and
the switch arrangement of each I/O group is coupled by a data link to at least one other switch arrangement of another I/O group. 14. The modular server system according to claim 13, wherein at least one first I/O group of the plurality of I/O groups comprises at least one first subgroup with a first switch element and a second subgroup with a second switch element, the first switch element is directly coupled by a data link to each server module of a first server group allocated to the first I/O group and the second switch element is directly coupled by a data link to each server module of the first server group. 15. The modular server system according to claim 13, further comprising at least one shared printed circuit board with a plurality of first electrical connections that couple the server groups to the respective allocated I/O groups by a data link. 16. The modular server system according to claim 15, wherein the at least one shared printed circuit board comprises a plurality of further electrical connections that couple together the switch arrangements of the plurality of I/O groups by a data link. 17. The modular server system according to claim 13, wherein the coupling by a data link via point-to-point connections is established with a plurality of data lines according to the PCI Express standard. 18. The modular server system according to claim 13, wherein the at least one first I/O component of the plurality of I/O components can be shared by a plurality of server modules, and the first I/O component is one of a power supply component with a plurality of functional units and a mass storage component. 19. The modular server system according to claim 13, wherein the plurality of I/O components of at least one first I/O group of the plurality of I/O groups and/or the plurality of server modules of at least one allocated first server group of the plurality of server groups form a redundant system so that on failure of one of the I/O components of the first I/O group and/or on failure of one of the server modules of the first server group, remaining I/O components of the first I/O group and remaining server modules of the first server group are able to assume the function of the failed components. 20. The modular server system according to claim 13, wherein first data connections between server modules of a first server group and I/O components of a first I/O group allocated to the first server group have a higher data rate and/or a lower latency than second data connections between server modules of the first server group and I/O components of a second I/O group not allocated to the first server group. 21. The modular server system according to claim 13, wherein each server module comprises at least one processor and at least one main memory associated with the processor. 22. A modular server system comprising:
a plurality of server groups, each server group adapted to receive a plurality of server modules and comprising a switch arrangement with at least one switch element, and a plurality of I/O groups, wherein each I/O group is adapted to receive a plurality of I/O components,
wherein
each of the plurality of server groups is allocated exactly one of the plurality of I/O groups,
the switch arrangement of each server group is directly coupled by a data link to each of the plurality of server modules of the server group,
the switch arrangement of each server group is directly coupled by a data link to each of the plurality of I/O components of the I/O group allocated to the server group, and
the switch arrangement of each server group is directly coupled by a data link to at least one other switch arrangement of another server group. 23. The modular server system according to claim 22, further comprising at least one shared printed circuit board with a plurality of first electrical connections that couple the server groups to the respective allocated I/O groups by a data link. 24. The modular server system according to claim 23, wherein the at least one shared printed circuit board comprises a plurality of further electrical connections that couple together the switch arrangements of the plurality of server groups by a data link. 25. The modular server system according to claim 22, wherein the coupling by a data link via point-to-point connections is established with a plurality of data lines according to the PCI Express standard. 26. The modular server system according to claim 22, wherein the at least one first I/O component of the plurality of I/O components can be shared by a plurality of server modules, and the first I/O component is one of a power supply component with a plurality of functional units and a mass storage component. 27. The modular server system according to claim 22, wherein the plurality of I/O components of at least one first I/O group of the plurality of I/O groups and/or the plurality of server modules of at least one allocated first server group of the plurality of server groups form a redundant system so that on failure of one of the I/O components of the first I/O group and/or on failure of one of the server modules of the first server group, the remaining I/O components of the first I/O group and the remaining server modules of the first server group are able to assume the function of the failed components. 28. The modular server system according to claim 22, wherein first data connections between server modules of a first server group and I/O components of a first I/O group allocated to the first server group have a higher data rate and/or a lower latency than second data connections between server modules of the first server group and I/O components of a second I/O group not allocated to the first server group. 29. An I/O module for use in a modular server system comprising:
at least one module printed circuit board, at least one first terminal arranged on the module printed circuit board for a first I/O component, at least one second terminal arranged on the module printed circuit board for a second I/O component, at least one plug arranged on the module printed circuit board that couples the I/O module to a shared printed circuit board of the modular server system by a data link, and at least one switch element arranged on the module printed circuit board that selectively establishes data connections between a predetermined group of server modules of the modular server system, said predetermined group being allocated to the I/O module, and the first and/or second I/O component, and establishes data connections between the predetermined group of server modules of the modular server system and a switch element of a similar I/O module. 30. A switching method for a modular server system comprising:
directly establishing first data connections between a first component of a first type of a first group of similar components, and a second component of a second type of a second group of similar components via a first switch element of the second group; and indirectly establishing second data connections between the first component of the first group and a third component of the second type via the first switch element and a second switch element of the third group. 31. The method according to claim 30, wherein the first data connections have a higher data rate and/or a lower latency than the second data connections. 32. The method according to claim 30, wherein the first data connections can be used exclusively by the first component of the first group and the second component of the second group and wherein the second data connections can be shared by a plurality of components of the first group and/or a plurality of third components of the third group via a multiplex operation. | 2,100 |
5,292 | 15,063,521 | 2,193 | The current document is directed to an automated-application-release-management subsystem, or facility, that organizes and manages the application-development and application-release processes to allow for continuous application development and release. The current document is particularly directed to implementations in which the automated application-release-management subsystem is highly modularized to provide plug-in compatibility with a large variety of external, third-party subsystems, libraries, and functionalities. This highly plug-in-compatible architecture provides for decreasing dependencies on various subsystems and components of a workflow-based cloud-management system in which the plug-compatible automated application-release-management subsystem is incorporated. | 1. An automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility; an artifact-storage-and-management subsystem; and a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from the workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 wherein the automated-application-release-management controller controls execution of application-release-management pipelines, each application-release-management pipeline representing a sequence of tasks carried out by the automated-application-release-management subsystem to generate a releasable version of an application. 4. The automated-application-release-management subsystem of claim 3 wherein each application-release-management pipeline comprises one or more stages. 5. The automated-application-release-management subsystem of claim 4 wherein each application-release-management-pipeline stage comprises:
a set of one or more tasks; and
a plug-in framework that maps entrypoints in the tasks to entrypoints within sets of routine and/or function entrypoints in descriptors within the set of sets of descriptors. 6. The automated-application-release-management subsystem of claim 5 wherein the tasks includes tasks of task types selected from among:
initialization tasks;
deployment tasks;
run-tests tasks;
gating-rule tasks; and
finalize tasks. 7. The automated-application-release-management subsystem of claim 5 wherein, when the automated-application-release-management controller, while controlling execution of an application-release-management pipeline, receives a callback from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage, the automated-application-release-management controller:
accesses the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calls the entrypoint to the routine or function entrypoint to which entrypoint in the task is mapped. 8. The automated-application-release-management subsystem of claim 1 wherein, during installation of the automated-application-release-management subsystem within the cloud-computing facility, a particular external module, subsystem, or library is selected for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 9. The automated-application-release-management subsystem of claim 1 wherein the automated-application-release-management subsystem provides a reconfiguration facility that can be directed to select a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 10. A method that renders an automated-application-release-management subsystem, operating within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, modular, the method comprising:
storing, in a memory, a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from a workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem; incorporating within each stage of each application-release-management pipeline executed by the automated-application-release-management subsystem, a plug-in framework; and when a callback is received from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage,
accessing the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calling the entrypoint to the routine or function entrypoint to which the entrypoint in the task is mapped. 11. The method of claim 10 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
an automated-application-release-management controller,
an interface to the workflow-execution engine within the cloud-computing facility;
an artifact-storage-and-management subsystem; and
the set of sets of descriptors. 12. The method of claim 11 wherein the automated-application-release-management subsystem is incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 13. The method of claim 11 wherein the automated-application-release-management controller controls execution of application-release-management pipelines, each application-release-management pipeline representing a sequence of tasks carried out by the automated-application-release-management subsystem to generate a releasable version of an application. 14. The method of claim 13 wherein each application-release-management pipeline comprises one or more stages. 15. The method of claim 14 wherein each application-release-management-pipeline stage comprises:
a set of one or more tasks; and
the plug-in framework. 16. The method of claim 15 wherein the tasks includes tasks of task types selected from among:
initialization tasks;
deployment tasks;
run-tests tasks;
gating-rule tasks; and
finalize tasks. 17. The method of claim 11 further including, during installation of the automated-application-release-management subsystem within the cloud-computing facility, selecting a particular external module, subsystem, or library for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 18. The method of claim 11 further including selecting, in response to a command received through a reconfiguration interface, a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 19. Computer instructions, stored within one or more physical data-storage devices, that, when executed on one or more processors within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, control the cloud-computing facility to render an automated-application-release-management subsystem, operating within the cloud-computing facility, modular by:
storing, in a memory, a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from a workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem; incorporating within each stage of each application-release-management pipeline executed by the automated-application-release-management subsystem, a plug-in framework; and when a callback is received from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage,
accessing the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calling the entrypoint to the routine or function entrypoint to which the entrypoint in the task is mapped. 20. The computer instructions of claim 19 wherein the computer instructions further control the cloud-computing facility to:
during installation of the automated-application-release-management subsystem within the cloud-computing facility, select a particular external module, subsystem, or library for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline; and
select, in response to a command received through a reconfiguration interface, a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. | The current document is directed to an automated-application-release-management subsystem, or facility, that organizes and manages the application-development and application-release processes to allow for continuous application development and release. The current document is particularly directed to implementations in which the automated application-release-management subsystem is highly modularized to provide plug-in compatibility with a large variety of external, third-party subsystems, libraries, and functionalities. This highly plug-in-compatible architecture provides for decreasing dependencies on various subsystems and components of a workflow-based cloud-management system in which the plug-compatible automated application-release-management subsystem is incorporated.1. An automated-application-release-management subsystem within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the automated-application-release-management subsystem comprising:
a dashboard user interface; an automated-application-release-management controller, an interface to a workflow-execution engine within the cloud-computing facility; an artifact-storage-and-management subsystem; and a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from the workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem. 2. The automated-application-release-management subsystem of claim 1 that is further incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 3. The automated-application-release-management subsystem of claim 1 wherein the automated-application-release-management controller controls execution of application-release-management pipelines, each application-release-management pipeline representing a sequence of tasks carried out by the automated-application-release-management subsystem to generate a releasable version of an application. 4. The automated-application-release-management subsystem of claim 3 wherein each application-release-management pipeline comprises one or more stages. 5. The automated-application-release-management subsystem of claim 4 wherein each application-release-management-pipeline stage comprises:
a set of one or more tasks; and
a plug-in framework that maps entrypoints in the tasks to entrypoints within sets of routine and/or function entrypoints in descriptors within the set of sets of descriptors. 6. The automated-application-release-management subsystem of claim 5 wherein the tasks includes tasks of task types selected from among:
initialization tasks;
deployment tasks;
run-tests tasks;
gating-rule tasks; and
finalize tasks. 7. The automated-application-release-management subsystem of claim 5 wherein, when the automated-application-release-management controller, while controlling execution of an application-release-management pipeline, receives a callback from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage, the automated-application-release-management controller:
accesses the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calls the entrypoint to the routine or function entrypoint to which entrypoint in the task is mapped. 8. The automated-application-release-management subsystem of claim 1 wherein, during installation of the automated-application-release-management subsystem within the cloud-computing facility, a particular external module, subsystem, or library is selected for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 9. The automated-application-release-management subsystem of claim 1 wherein the automated-application-release-management subsystem provides a reconfiguration facility that can be directed to select a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 10. A method that renders an automated-application-release-management subsystem, operating within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, modular, the method comprising:
storing, in a memory, a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from a workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem; incorporating within each stage of each application-release-management pipeline executed by the automated-application-release-management subsystem, a plug-in framework; and when a callback is received from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage,
accessing the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calling the entrypoint to the routine or function entrypoint to which the entrypoint in the task is mapped. 11. The method of claim 10 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
an automated-application-release-management controller,
an interface to the workflow-execution engine within the cloud-computing facility;
an artifact-storage-and-management subsystem; and
the set of sets of descriptors. 12. The method of claim 11 wherein the automated-application-release-management subsystem is incorporated in a workflow-based cloud-management system that additionally includes an infrastructure-management-and-administration subsystem and the workflow-execution engine. 13. The method of claim 11 wherein the automated-application-release-management controller controls execution of application-release-management pipelines, each application-release-management pipeline representing a sequence of tasks carried out by the automated-application-release-management subsystem to generate a releasable version of an application. 14. The method of claim 13 wherein each application-release-management pipeline comprises one or more stages. 15. The method of claim 14 wherein each application-release-management-pipeline stage comprises:
a set of one or more tasks; and
the plug-in framework. 16. The method of claim 15 wherein the tasks includes tasks of task types selected from among:
initialization tasks;
deployment tasks;
run-tests tasks;
gating-rule tasks; and
finalize tasks. 17. The method of claim 11 further including, during installation of the automated-application-release-management subsystem within the cloud-computing facility, selecting a particular external module, subsystem, or library for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 18. The method of claim 11 further including selecting, in response to a command received through a reconfiguration interface, a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. 19. Computer instructions, stored within one or more physical data-storage devices, that, when executed on one or more processors within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, control the cloud-computing facility to render an automated-application-release-management subsystem, operating within the cloud-computing facility, modular by:
storing, in a memory, a set of sets of descriptors, each descriptor including one or more sets of routine and function entrypoints that the automated-application-release-management controller calls in response to callbacks from a workflow-execution engine, each set of routine and/or function entrypoints describing entrypoints within an external module, library, or subsystem, and each descriptor corresponding to a type of task executed by the automated-application-release-management subsystem; incorporating within each stage of each application-release-management pipeline executed by the automated-application-release-management subsystem, a plug-in framework; and when a callback is received from the workflow execution engine to an entrypoint in a task within an application-release-management-pipeline stage,
accessing the plug-in framework of the application-release-management-pipeline stage to map the entrypoint to a routine or function entrypoint within a set of routine and/or function entrypoints in a descriptor, corresponding to type of the task, within the set of sets of descriptors; and
calling the entrypoint to the routine or function entrypoint to which the entrypoint in the task is mapped. 20. The computer instructions of claim 19 wherein the computer instructions further control the cloud-computing facility to:
during installation of the automated-application-release-management subsystem within the cloud-computing facility, select a particular external module, subsystem, or library for each descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline; and
select, in response to a command received through a reconfiguration interface, a different external module, subsystem, or library for a descriptor in the set of descriptors for executing callbacks from the workflow execution engine mapped to the descriptor by the automated-application-release-management controller while controlling execution of an application-release-management pipeline. | 2,100 |
5,293 | 14,303,064 | 2,156 | A method of tracking an entity includes generating data relevant to the entity at a first location, storing the data at a server, and accessing at least a portion of the data at the first location or at a second location. The data can include location information, time information, image data, text, and/or biometric data. The data an be encrypted, organized, categorized, updated, accumulated with other data, classified, and/or disseminated, and an automated search can include an image feature recognition and facial recognition search. The entity can be a person, an animal, or an object. A communications system includes a processing device and a server that includes an automated search engine. The server can be configured to perform data analysis, such as data grouping. | 1. A method of tracking an entity, comprising:
generating data relevant to the entity at a first location; storing the data at a server; and accessing at least a portion of the stored data at the first location or at a second location. 2. The method of claim 1, wherein the data includes at least one of location information and time information. 3. The method of claim 1, wherein the data includes image data. 4. The method of claim 1, wherein the data includes text. 5. The method of claim 1, wherein the data includes biometric data. 6. The method of claim 1, wherein accessing at least a portion of the data includes at least one of decrypting the at least a portion of the data, viewing the at least a portion of the data, manipulating the at least a portion of the data, tracking the at least a portion of the data, sharing the at least a portion of the data, associating the at least a portion of the data, correlating the at least a portion of the data, and modifying the at least a portion of the data. 7. The method of claim 1, further comprising satisfying an authentication process, prior to accessing at the least a portion of the data. 8. The method of claim 7, wherein the authentication process includes enrollment in an organizational account. 9. The method of claim 7, further comprising utilizing the data at the server, including at least one of encrypting the data, organizing the data, categorizing the data, updating the data, accumulating the data with other data, classifying the data, and disseminating the data. 10. The method of claim 9, wherein utilizing the data includes performing an automated search of the data. 11. The method of claim 10, wherein the automated search includes image feature recognition search. 12. The method of claim 11, wherein the image feature recognition search includes facial recognition search. 13. The method of claim 9, wherein utilizing the data includes performing data analysis. 14. The method of claim 13, wherein performing data analysis includes performing data grouping. 15. The method of claim 14, wherein data grouping includes grouping data sets based on common attributes. 16. The method of claim 1, further comprising accepting additional data from an additional source. 17. The method of claim 16, wherein the additional data is relevant to the entity. 18. The method of claim 16, wherein the additional data is identified as being relevant to the entity. 19. The method of claim 16, wherein the additional data is not identified as being relevant to the entity, further comprising correlating the additional data with the data to identify the entity. 20. The method of claim 1, further comprising prompting user for additional data. 21. The method of claim 1, further comprising transmitting the data directly from a first device to a second device, separate from any communication with the server. 22. The method of claim 1, wherein the entity is a person. 23. The method of claim 22, wherein the data includes at least one of name, sex, age, height, weight, markings and distinguishing features, address, telephone number, email address, medical information, injury information, identification code, and family information. 24. The method of claim 1, wherein the entity is an animal. 25. The method of claim 24, wherein the data includes name, sex, age, height, eye color, coat type, length, weight, markings and distinguishing features, medical information, injury information, identification code, and owner name and contact information. 26. The method of claim 1, wherein the entity is an object. 27. The method of claim 26, wherein the object is one of a vehicle an a vessel. 28. The method of claim 26, wherein the object is of a package and a container. 29. The method of claim 26, wherein the data includes description, size, weight, color, markings, identification code, listing of contents, origin location, destination location, content warnings, handling restrictions, value, and insurance information. 30. A storage medium that is readable by a processing device and on which are stored instructions that, when read by the processing device, cause the method of claim 1 to be performed by the processing device. 31. A processor, comprising:
the storage medium of claim 30, the processing device, communicatively coupled to the storage medium, an input interface configured to receive the generated data, a transmitter configured to send the data to the server, a receiver configured to receive the data from the server, a display that is communicatively coupled to the processing device, and an input/output device that is communicatively coupled to the processing device. 32. The processor claim 31, further comprising a portable housing. 33. A communications system, comprising:
the processor of claim 31, and the server, wherein the processor and the server are mutually communicatively coupled. 34. The communications system of claim 33, wherein the processor is a first processor, further comprising a second processor that is communicatively coupled with the server and the first processor. 35. The communications system of claim 33, wherein the server includes an automated search engine. 36. The communications system of claim 35, wherein the automated search engine is configured to perform image feature recognition. 37. The communications system of claim 36, wherein the image feature recognition is image facial recognition. 38. The communications system of claim 33, wherein the server is configured to perform data analysis. 39. The communications system of claim 38, wherein the data analysis includes data grouping. 40. The communications system of claim 33, further comprising a data entry terminal at is communicatively coupled to the server. 41. The communications system of claim 40, wherein the data entry terminal includes an input port and a display. 42. The communications system of claim 41, wherein the input port is configured to communicatively couple with at least one of a keyboard, a tablet, a computer mouse, a trackball, a stylus, a scanner, a telephone, and an image-capture device. 43. The communications system of claim 42, wherein the server is configured to correlate data received from the data entry terminal with data previously stored at the server. 44. The communications system of claim 43, wherein the server is configured to associate data received from the data entry terminal with an entity identified at the server. 45. The communications system of claim 33, wherein the server is configured to perform at least one of encrypting the data organizing the data categorizing the data, updating the data, accumulating the data with other data, classifying the data, and disseminating the data. 46. The communications system of claim 45, organizing the data includes grouping data sets based on common attributes. | A method of tracking an entity includes generating data relevant to the entity at a first location, storing the data at a server, and accessing at least a portion of the data at the first location or at a second location. The data can include location information, time information, image data, text, and/or biometric data. The data an be encrypted, organized, categorized, updated, accumulated with other data, classified, and/or disseminated, and an automated search can include an image feature recognition and facial recognition search. The entity can be a person, an animal, or an object. A communications system includes a processing device and a server that includes an automated search engine. The server can be configured to perform data analysis, such as data grouping.1. A method of tracking an entity, comprising:
generating data relevant to the entity at a first location; storing the data at a server; and accessing at least a portion of the stored data at the first location or at a second location. 2. The method of claim 1, wherein the data includes at least one of location information and time information. 3. The method of claim 1, wherein the data includes image data. 4. The method of claim 1, wherein the data includes text. 5. The method of claim 1, wherein the data includes biometric data. 6. The method of claim 1, wherein accessing at least a portion of the data includes at least one of decrypting the at least a portion of the data, viewing the at least a portion of the data, manipulating the at least a portion of the data, tracking the at least a portion of the data, sharing the at least a portion of the data, associating the at least a portion of the data, correlating the at least a portion of the data, and modifying the at least a portion of the data. 7. The method of claim 1, further comprising satisfying an authentication process, prior to accessing at the least a portion of the data. 8. The method of claim 7, wherein the authentication process includes enrollment in an organizational account. 9. The method of claim 7, further comprising utilizing the data at the server, including at least one of encrypting the data, organizing the data, categorizing the data, updating the data, accumulating the data with other data, classifying the data, and disseminating the data. 10. The method of claim 9, wherein utilizing the data includes performing an automated search of the data. 11. The method of claim 10, wherein the automated search includes image feature recognition search. 12. The method of claim 11, wherein the image feature recognition search includes facial recognition search. 13. The method of claim 9, wherein utilizing the data includes performing data analysis. 14. The method of claim 13, wherein performing data analysis includes performing data grouping. 15. The method of claim 14, wherein data grouping includes grouping data sets based on common attributes. 16. The method of claim 1, further comprising accepting additional data from an additional source. 17. The method of claim 16, wherein the additional data is relevant to the entity. 18. The method of claim 16, wherein the additional data is identified as being relevant to the entity. 19. The method of claim 16, wherein the additional data is not identified as being relevant to the entity, further comprising correlating the additional data with the data to identify the entity. 20. The method of claim 1, further comprising prompting user for additional data. 21. The method of claim 1, further comprising transmitting the data directly from a first device to a second device, separate from any communication with the server. 22. The method of claim 1, wherein the entity is a person. 23. The method of claim 22, wherein the data includes at least one of name, sex, age, height, weight, markings and distinguishing features, address, telephone number, email address, medical information, injury information, identification code, and family information. 24. The method of claim 1, wherein the entity is an animal. 25. The method of claim 24, wherein the data includes name, sex, age, height, eye color, coat type, length, weight, markings and distinguishing features, medical information, injury information, identification code, and owner name and contact information. 26. The method of claim 1, wherein the entity is an object. 27. The method of claim 26, wherein the object is one of a vehicle an a vessel. 28. The method of claim 26, wherein the object is of a package and a container. 29. The method of claim 26, wherein the data includes description, size, weight, color, markings, identification code, listing of contents, origin location, destination location, content warnings, handling restrictions, value, and insurance information. 30. A storage medium that is readable by a processing device and on which are stored instructions that, when read by the processing device, cause the method of claim 1 to be performed by the processing device. 31. A processor, comprising:
the storage medium of claim 30, the processing device, communicatively coupled to the storage medium, an input interface configured to receive the generated data, a transmitter configured to send the data to the server, a receiver configured to receive the data from the server, a display that is communicatively coupled to the processing device, and an input/output device that is communicatively coupled to the processing device. 32. The processor claim 31, further comprising a portable housing. 33. A communications system, comprising:
the processor of claim 31, and the server, wherein the processor and the server are mutually communicatively coupled. 34. The communications system of claim 33, wherein the processor is a first processor, further comprising a second processor that is communicatively coupled with the server and the first processor. 35. The communications system of claim 33, wherein the server includes an automated search engine. 36. The communications system of claim 35, wherein the automated search engine is configured to perform image feature recognition. 37. The communications system of claim 36, wherein the image feature recognition is image facial recognition. 38. The communications system of claim 33, wherein the server is configured to perform data analysis. 39. The communications system of claim 38, wherein the data analysis includes data grouping. 40. The communications system of claim 33, further comprising a data entry terminal at is communicatively coupled to the server. 41. The communications system of claim 40, wherein the data entry terminal includes an input port and a display. 42. The communications system of claim 41, wherein the input port is configured to communicatively couple with at least one of a keyboard, a tablet, a computer mouse, a trackball, a stylus, a scanner, a telephone, and an image-capture device. 43. The communications system of claim 42, wherein the server is configured to correlate data received from the data entry terminal with data previously stored at the server. 44. The communications system of claim 43, wherein the server is configured to associate data received from the data entry terminal with an entity identified at the server. 45. The communications system of claim 33, wherein the server is configured to perform at least one of encrypting the data organizing the data categorizing the data, updating the data, accumulating the data with other data, classifying the data, and disseminating the data. 46. The communications system of claim 45, organizing the data includes grouping data sets based on common attributes. | 2,100 |
5,294 | 14,076,436 | 2,196 | A virtual time control apparatus, method, and non-transitory computer readable storage medium thereof are provided. The virtual time control apparatus includes a system timer, a real time clock, and a processing unit, wherein the processing unit is electrically connected to the system timer and the real time clock. The system timer has an original timer period, while the real time clock has an original tick period. The processing unit executes a hypervisor. The hypervisor generates a virtual timer period according to an adjustment ratio and the original timer period. The hypervisor generates a virtual tick period according to the adjustment ratio and the original tick period. | 1. A virtual time control apparatus, comprising:
a system timer, having an original timer period; a real time clock, having an original tick period; and a processing unit, being electrically connected to the system timer and the real time clock and configured to execute a hypervisor, wherein the hypervisor is configured to generate a virtual timer period according to an adjustment ratio and the original timer period and generate a virtual tick period according to the adjustment ratio and the original tick period. 2. The virtual time control apparatus of claim 1, wherein the hypervisor is further configured to generate a virtual real time clock and generate a virtual real time according to the virtual real time clock and the virtual tick period. 3. The virtual time control apparatus of claim 2, wherein the processing unit is further configured to execute an operating system, the hypervisor further provides the virtual real time to the operating system, and the hypervisor further generates a triggering signal to the operating system periodically according to the virtual timer period. 4. The virtual time control apparatus as of claim 3, wherein the operating system further takes the virtual real time as a wall time and uses the triggering signal to update an operating time. 5. The virtual time control apparatus of claim 1, wherein the adjustment ratio is a positive number. 6. The virtual time control apparatus of claim 1, wherein the hypervisor generates the virtual timer period by dividing the original timer period by the adjustment ratio and generates the virtual tick period by dividing the original tick period by the adjustment ratio. 7. A virtual time control method for use in a hypervisor, the hypervisor being executed in a processing unit, the virtual time control method comprising the steps of:
generating a virtual timer period according to an adjustment ratio and an original timer period of a system timer; and generating a virtual tick period according to the adjustment ratio and an original tick period of a real time clock. 8. The virtual time control method of claim 7, further comprising the steps of:
generating a virtual real time clock; and generating a virtual real time according to the virtual real time clock and the virtual tick period. 9. The virtual time control method of claim 8, wherein the processing unit is further configured to execute an operating system and the virtual time control method further comprises the steps of:
providing the virtual real time to the operating system; and generating a triggering signal to the operating system periodically according to the virtual timer period. 10. The virtual time control method of claim 7, wherein the adjustment ratio is a positive number. 11. The virtual time control method of claim 7, wherein the virtual timer period is obtained by dividing the original timer period by the adjustment ratio, and the virtual tick period is obtained by dividing the original tick period by the adjustment ratio. 12. A non-transitory computer readable storage medium, having a computer program stored therein, the computer program executing a virtual time control method after being loaded into a hypervisor executed on a processing unit, and the computer program comprising:
a code A for enabling the hypervisor to generate a virtual timer period according to an adjustment ratio and an original timer period of a system timer; and a code B for enabling the hypervisor to generate a virtual tick period according to the adjustment ratio and an original tick period of a real time clock. | A virtual time control apparatus, method, and non-transitory computer readable storage medium thereof are provided. The virtual time control apparatus includes a system timer, a real time clock, and a processing unit, wherein the processing unit is electrically connected to the system timer and the real time clock. The system timer has an original timer period, while the real time clock has an original tick period. The processing unit executes a hypervisor. The hypervisor generates a virtual timer period according to an adjustment ratio and the original timer period. The hypervisor generates a virtual tick period according to the adjustment ratio and the original tick period.1. A virtual time control apparatus, comprising:
a system timer, having an original timer period; a real time clock, having an original tick period; and a processing unit, being electrically connected to the system timer and the real time clock and configured to execute a hypervisor, wherein the hypervisor is configured to generate a virtual timer period according to an adjustment ratio and the original timer period and generate a virtual tick period according to the adjustment ratio and the original tick period. 2. The virtual time control apparatus of claim 1, wherein the hypervisor is further configured to generate a virtual real time clock and generate a virtual real time according to the virtual real time clock and the virtual tick period. 3. The virtual time control apparatus of claim 2, wherein the processing unit is further configured to execute an operating system, the hypervisor further provides the virtual real time to the operating system, and the hypervisor further generates a triggering signal to the operating system periodically according to the virtual timer period. 4. The virtual time control apparatus as of claim 3, wherein the operating system further takes the virtual real time as a wall time and uses the triggering signal to update an operating time. 5. The virtual time control apparatus of claim 1, wherein the adjustment ratio is a positive number. 6. The virtual time control apparatus of claim 1, wherein the hypervisor generates the virtual timer period by dividing the original timer period by the adjustment ratio and generates the virtual tick period by dividing the original tick period by the adjustment ratio. 7. A virtual time control method for use in a hypervisor, the hypervisor being executed in a processing unit, the virtual time control method comprising the steps of:
generating a virtual timer period according to an adjustment ratio and an original timer period of a system timer; and generating a virtual tick period according to the adjustment ratio and an original tick period of a real time clock. 8. The virtual time control method of claim 7, further comprising the steps of:
generating a virtual real time clock; and generating a virtual real time according to the virtual real time clock and the virtual tick period. 9. The virtual time control method of claim 8, wherein the processing unit is further configured to execute an operating system and the virtual time control method further comprises the steps of:
providing the virtual real time to the operating system; and generating a triggering signal to the operating system periodically according to the virtual timer period. 10. The virtual time control method of claim 7, wherein the adjustment ratio is a positive number. 11. The virtual time control method of claim 7, wherein the virtual timer period is obtained by dividing the original timer period by the adjustment ratio, and the virtual tick period is obtained by dividing the original tick period by the adjustment ratio. 12. A non-transitory computer readable storage medium, having a computer program stored therein, the computer program executing a virtual time control method after being loaded into a hypervisor executed on a processing unit, and the computer program comprising:
a code A for enabling the hypervisor to generate a virtual timer period according to an adjustment ratio and an original timer period of a system timer; and a code B for enabling the hypervisor to generate a virtual tick period according to the adjustment ratio and an original tick period of a real time clock. | 2,100 |
5,295 | 14,696,117 | 2,168 | In one aspect, an example method includes receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, modifying, by the computing device, an electronic report by adding the first text to the electronic report. | 1. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, modifying, by the computing device, an electronic report by adding the first text to the electronic report. 2. The method of claim 1, further comprising:
retrieving, by the computing device, second data representing third text that corresponds to the first text; and wherein the first search-phrase further includes the represented third text. 3. The method of claim 2, wherein the first text comprises a name of a candidate for a political office corresponding to a government, and the third text comprises at least one of the political office and the government. 4. The method of claim 1, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 5. The method of claim 1, further comprising:
outputting, by the computing device via a user interface, the modified electronic report. 6. The method of claim 5, wherein modifying, by the computing device via the user interface, the electronic report, comprises adding to the electronic report, the second text. 7. The method of claim 1, wherein outputting, by the computing device via the user interface, the modified electronic report, comprises displaying, by the computing device via the user interface, the modified electronic report. 8. The method of claim 1, further comprising:
receiving a video stream; modifying the received video stream by overlaying the second text on the received video stream; and transmitting the modified video stream to a receiver. 9. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, outputting, by the computing device via a user interface, a prompt requesting a command to modify the first text by replacing the first text with the second text. 10. The method of claim 9, further comprising:
retrieving, by the computing device, second data representing third text that corresponds to the first text, wherein the first search-phrase further includes the represented third text. 11. The method of claim 10, wherein the first text comprises a name of a candidate for a political office corresponding to a government, and the third text comprises at least one of the political office and the government. 12. The method of claim 9, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 13. The method of claim 9, further comprising:
receiving, by the computing device via the user interface, the command; responsive to receiving, by the computing device via the user interface, the command, modifying, by the computing device, the first data such that the modified first data represents the second text in place of the first text. 14. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, performing, by the computing device, an action. 15. The method of claim 14, further comprising:
retrieving, by the computing device, data representing third text that corresponds to the first text; and wherein the first search-phrase further includes the represented third text. 16. The method of claim 14, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 17. The method of claim 14, wherein performing, by the computing device, the action, comprises modifying, by the computing device, the first data such that the modified first data represents the second text in place of the first text. 18. The method of claim 17, further comprising:
receiving a video stream; modifying the received video stream by overlaying the second text on the received video stream; and transmitting the modified video stream to a receiver. 19. The method of claim 14, wherein performing, by the computing device, the action comprises modifying, by the computing device, an electronic report by adding the first search-phrase to the electronic report. 20. The method of claim 14, wherein performing, by the computing device, the action comprises outputting, by the computing device via a user interface, a prompt requesting a command to modify the first text by replacing the first text with the second text. | In one aspect, an example method includes receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, modifying, by the computing device, an electronic report by adding the first text to the electronic report.1. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, modifying, by the computing device, an electronic report by adding the first text to the electronic report. 2. The method of claim 1, further comprising:
retrieving, by the computing device, second data representing third text that corresponds to the first text; and wherein the first search-phrase further includes the represented third text. 3. The method of claim 2, wherein the first text comprises a name of a candidate for a political office corresponding to a government, and the third text comprises at least one of the political office and the government. 4. The method of claim 1, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 5. The method of claim 1, further comprising:
outputting, by the computing device via a user interface, the modified electronic report. 6. The method of claim 5, wherein modifying, by the computing device via the user interface, the electronic report, comprises adding to the electronic report, the second text. 7. The method of claim 1, wherein outputting, by the computing device via the user interface, the modified electronic report, comprises displaying, by the computing device via the user interface, the modified electronic report. 8. The method of claim 1, further comprising:
receiving a video stream; modifying the received video stream by overlaying the second text on the received video stream; and transmitting the modified video stream to a receiver. 9. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, outputting, by the computing device via a user interface, a prompt requesting a command to modify the first text by replacing the first text with the second text. 10. The method of claim 9, further comprising:
retrieving, by the computing device, second data representing third text that corresponds to the first text, wherein the first search-phrase further includes the represented third text. 11. The method of claim 10, wherein the first text comprises a name of a candidate for a political office corresponding to a government, and the third text comprises at least one of the political office and the government. 12. The method of claim 9, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 13. The method of claim 9, further comprising:
receiving, by the computing device via the user interface, the command; responsive to receiving, by the computing device via the user interface, the command, modifying, by the computing device, the first data such that the modified first data represents the second text in place of the first text. 14. A method comprising:
receiving, by a computing device, first data representing first text; querying, by the computing device, a search engine using a first search-phrase, wherein the first search-phrase includes the represented first text; determining, by the computing device, that the search engine has suggested a second search-phrase based on the query, wherein the second search-phrase includes second text and is different from the first search-phrase; and responsive to determining that the search engine has suggested the second search-phrase based on the query, performing, by the computing device, an action. 15. The method of claim 14, further comprising:
retrieving, by the computing device, data representing third text that corresponds to the first text; and wherein the first search-phrase further includes the represented third text. 16. The method of claim 14, further comprising:
receiving, by the computing device, a search result of the query; and wherein determining, by the computing device, that the search engine has suggested the second search-phrase based on the query comprises identifying, by the computing device, an indicator phrase within the received search result. 17. The method of claim 14, wherein performing, by the computing device, the action, comprises modifying, by the computing device, the first data such that the modified first data represents the second text in place of the first text. 18. The method of claim 17, further comprising:
receiving a video stream; modifying the received video stream by overlaying the second text on the received video stream; and transmitting the modified video stream to a receiver. 19. The method of claim 14, wherein performing, by the computing device, the action comprises modifying, by the computing device, an electronic report by adding the first search-phrase to the electronic report. 20. The method of claim 14, wherein performing, by the computing device, the action comprises outputting, by the computing device via a user interface, a prompt requesting a command to modify the first text by replacing the first text with the second text. | 2,100 |
5,296 | 15,250,871 | 2,191 | An application executing in a containerized environment may be configured at started up by deploying a configuration agent to execute in a container engine. For each container deployed, instantiating a user configuration plugin and one or more applications to execute in the container. The user configuration plugin may send a request to the configuration agent to request for configuration information relating to the application. The configuration plugin may receive configuration information from the configuration agent and used the received configuration information to configure the application. | 1. A method for configuring an application with user configuration information executing in a container, the method comprising:
deploying a container engine to execute on a first machine; deploying a configuration agent to execute on the first machine; deploying one or more containers to execute on the container engine; for each container:
instantiating at least one corresponding application to execute in the container;
sending to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receiving from the configuration agent configuration information relating to the user's configuration of the application; and
configuring the application using the received configuration information. 2. The method of claim 1, further comprising, for each container, instantiating a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 3. The method of claim 1, further comprising, the configuration agent receiving a request from one of the containers and in response:
communicating with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sending the obtained configuration information to the container. 4. The method of claim 3, further comprising storing the obtained information in a database of the first machine. 5. The method of claim 1, further comprising the configuration agent receiving a request from one of the containers and in response:
accessing configuration information, stored on the first machine, for an application in the container; and sending the accessed configuration information to the container. 6. The method of claim 1, further comprising the configuration agent storing configuration information on the first machine and periodically updating the stored configuration information with information received from a server separate from the first machine. 7. The method of claim 1, further comprising the configuration agent storing configuration information on the first machine; receiving update information from a first container; and updating the stored configuration information using the update information. 8. The method of claim 1, wherein the first machine is a physical computer system, the method further comprising deploying an operating system to execute on the physical computer system and deploying the container engine to execute on the operating system. 9. The method of claim 1, wherein the first machine is a virtual machine, the method further comprising deploying a hypervisor to execute on a physical computer system and deploying the virtual machine to execute on the hypervisor. 10. A system for configuring an application with user configuration information executing in a container, the system comprising:
a processor; and a computer-readable storage medium having stored thereon executable program code, the executable program code, which when executed by the processor, being configured to cause the processor to: deploy a container engine to execute on a first machine; deploy a configuration agent to execute on the first machine; deploy one or more containers to execute on the container engine; for each container:
instantiate at least one corresponding application to execute in the container;
send to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receive from the configuration agent configuration information relating to the user's configuration of the application; and
configure the application using the received configuration information. 11. The system of claim 10, wherein the executable program code, which when executed by the processor, is further configured to cause the processor to instantiate, for each container, a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 12. The system of claim 10, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
communicates with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sends the obtained configuration information to the container. 13. The system of claim 12, wherein the obtained information is stored in a database of the first machine. 14. The system of claim 10, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
accesses configuration information, stored on the first machine, for an application in the container; and sends the accessed configuration information to the container. 15. The system of claim 10, wherein the configuration agent stores configuration information on the first machine and periodically updates the stored configuration information with information received from a server separate from the first machine. 16. The system of claim 10, wherein the configuration agent stores configuration information on the first machine; receives update information from a first container; and updates the stored configuration information using the update information. 17. A non-transitory computer-readable storage medium having stored thereon computer executable instructions, which when executed by a computer device, cause the computer device to:
deploy a container engine to execute on a first machine; deploy a configuration agent to execute on the first machine; deploy one or more containers to execute on the container engine; for each container:
instantiate at least one corresponding application to execute in the container;
send to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receive from the configuration agent configuration information relating to the user's configuration of the application; and
configure the application using the received configuration information. 18. The non-transitory computer-readable storage medium of claim 17, wherein the computer executable instructions, which when executed by the computer device, is further configured to cause the computer device to instantiate, for each container, a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 19. The system of claim 17, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
communicates with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sends the obtained configuration information to the container. 20. The system of claim 17, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
accesses configuration information, stored on the first machine, for an application in the container; and sends the accessed configuration information to the container. | An application executing in a containerized environment may be configured at started up by deploying a configuration agent to execute in a container engine. For each container deployed, instantiating a user configuration plugin and one or more applications to execute in the container. The user configuration plugin may send a request to the configuration agent to request for configuration information relating to the application. The configuration plugin may receive configuration information from the configuration agent and used the received configuration information to configure the application.1. A method for configuring an application with user configuration information executing in a container, the method comprising:
deploying a container engine to execute on a first machine; deploying a configuration agent to execute on the first machine; deploying one or more containers to execute on the container engine; for each container:
instantiating at least one corresponding application to execute in the container;
sending to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receiving from the configuration agent configuration information relating to the user's configuration of the application; and
configuring the application using the received configuration information. 2. The method of claim 1, further comprising, for each container, instantiating a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 3. The method of claim 1, further comprising, the configuration agent receiving a request from one of the containers and in response:
communicating with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sending the obtained configuration information to the container. 4. The method of claim 3, further comprising storing the obtained information in a database of the first machine. 5. The method of claim 1, further comprising the configuration agent receiving a request from one of the containers and in response:
accessing configuration information, stored on the first machine, for an application in the container; and sending the accessed configuration information to the container. 6. The method of claim 1, further comprising the configuration agent storing configuration information on the first machine and periodically updating the stored configuration information with information received from a server separate from the first machine. 7. The method of claim 1, further comprising the configuration agent storing configuration information on the first machine; receiving update information from a first container; and updating the stored configuration information using the update information. 8. The method of claim 1, wherein the first machine is a physical computer system, the method further comprising deploying an operating system to execute on the physical computer system and deploying the container engine to execute on the operating system. 9. The method of claim 1, wherein the first machine is a virtual machine, the method further comprising deploying a hypervisor to execute on a physical computer system and deploying the virtual machine to execute on the hypervisor. 10. A system for configuring an application with user configuration information executing in a container, the system comprising:
a processor; and a computer-readable storage medium having stored thereon executable program code, the executable program code, which when executed by the processor, being configured to cause the processor to: deploy a container engine to execute on a first machine; deploy a configuration agent to execute on the first machine; deploy one or more containers to execute on the container engine; for each container:
instantiate at least one corresponding application to execute in the container;
send to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receive from the configuration agent configuration information relating to the user's configuration of the application; and
configure the application using the received configuration information. 11. The system of claim 10, wherein the executable program code, which when executed by the processor, is further configured to cause the processor to instantiate, for each container, a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 12. The system of claim 10, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
communicates with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sends the obtained configuration information to the container. 13. The system of claim 12, wherein the obtained information is stored in a database of the first machine. 14. The system of claim 10, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
accesses configuration information, stored on the first machine, for an application in the container; and sends the accessed configuration information to the container. 15. The system of claim 10, wherein the configuration agent stores configuration information on the first machine and periodically updates the stored configuration information with information received from a server separate from the first machine. 16. The system of claim 10, wherein the configuration agent stores configuration information on the first machine; receives update information from a first container; and updates the stored configuration information using the update information. 17. A non-transitory computer-readable storage medium having stored thereon computer executable instructions, which when executed by a computer device, cause the computer device to:
deploy a container engine to execute on a first machine; deploy a configuration agent to execute on the first machine; deploy one or more containers to execute on the container engine; for each container:
instantiate at least one corresponding application to execute in the container;
send to the configuration agent a configuration request for configuration information relating to the application, the configuration request including information that identifies the container, information that identifies a user associated with the container, and information that identifies the application;
receive from the configuration agent configuration information relating to the user's configuration of the application; and
configure the application using the received configuration information. 18. The non-transitory computer-readable storage medium of claim 17, wherein the computer executable instructions, which when executed by the computer device, is further configured to cause the computer device to instantiate, for each container, a configuration plugin to execute in the container, wherein the configuration plugin communicates with the configuration agent to obtain the configuration information and the configuration plugin configures the application using the received configuration information. 19. The system of claim 17, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
communicates with a server separate from the first machine to obtain configuration information from the server for an application in the container; and sends the obtained configuration information to the container. 20. The system of claim 17, wherein when the configuration agent receives a request from one of the containers, the configuration agent:
accesses configuration information, stored on the first machine, for an application in the container; and sends the accessed configuration information to the container. | 2,100 |
5,297 | 14,760,017 | 2,143 | A system, method and interface for viewer interaction relative to a 3D representation of a vehicle are provided including providing a viewer interface, presenting a 3D vehicle representation to a viewer, receiving input from a viewer via the viewer interface relative to a desired aspect or perspective of the vehicle, and adjusting or changing the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective. | 1. A method for viewer interaction relative to a 3D representation of a vehicle, comprising:
providing an interface to a viewer; presenting a 3D vehicle representation to a viewer; receiving input from a viewer relative to a desired aspect or perspective of the vehicle; and adjusting or changing the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective. 2. A method in accordance with claim 1, wherein said presentation is a broadcast presentation, and wherein said input from a viewer is input from a broadcast personnel 3. A method in accordance with claim 2, wherein said presentation comprises manipulation of a virtual 3D car by a broadcast analyst. 4. A method in accordance with claim 3, wherein said presentation further comprises selection of a vehicle component and manipulation of a vehicle component displayed aspect by said analyst for broadcast. 5. A method in accordance with claim 1, wherein said interface comprises a touchscreen display interface. 6. A method in accordance with claim 1, wherein said interface comprises a mobile device interface. 7. A method in accordance with claim 1, wherein said interface comprises a web interface. 8. A method in accordance with claim 4, wherein said interface comprises a touchscreen display at a first interface and a mobile interface at a second location. 9. A method in accordance with claim 8, wherein said interface comprises a production broadcast display screen and at least one remote mobile device configured to control the production broadcast display screen. 10. A method in accordance with claim 1, wherein said display is a touchscreen display that is configured with a populated index of selectable categories and subcategories corresponding to vehicle aspects and components. 11. A method in accordance with claim 10, wherein said display further includes at least selectable animation of a vehicle aspect or component. 12. A system for viewer interaction relative to a 3D representation of a vehicle, comprising:
a viewer interface, the viewer interface configured to present a 3D vehicle representation to a viewer as a presentation; a control input configured to permit a viewer to select a desired aspect or perspective of the vehicle; and a server configured to adjust or change the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective, wherein the server accesses storage containing 3D vehicle information corresponding to said desired aspect or perspective. 13. A system in accordance with claim 12, wherein said presentation is a broadcast presentation, and wherein said input from a viewer is input from a broadcast personnel 14. A system in accordance with claim 13, wherein said presentation comprises manipulation of a virtual 3D car by a broadcast analyst. 15. A system in accordance with claim 14, wherein said presentation further comprises selection of a vehicle component and manipulation of a vehicle component displayed aspect by said analyst for broadcast. 16. A system in accordance with claim 12, wherein said interface comprises a touchscreen display interface. 17. A system in accordance with claim 12, wherein said interface comprises a mobile device interface. 18. A system in accordance with claim 12, wherein said interface comprises a web interface. 19. A system in accordance with claim 15, wherein said interface comprises a touchscreen display at a first interface and a mobile interface at a second location. 20. A system in accordance with claim 19, wherein said interface comprises a production broadcast display screen and at least one remote mobile device configured to control the production broadcast display screen. 21. A system in accordance with claim 12, wherein said display is a touchscreen display that is configured with a populated index of selectable categories and subcategories corresponding to vehicle aspects and components. 22. A system in accordance with claim 21, wherein said display further includes at least selectable animation of a vehicle aspect or component. | A system, method and interface for viewer interaction relative to a 3D representation of a vehicle are provided including providing a viewer interface, presenting a 3D vehicle representation to a viewer, receiving input from a viewer via the viewer interface relative to a desired aspect or perspective of the vehicle, and adjusting or changing the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective.1. A method for viewer interaction relative to a 3D representation of a vehicle, comprising:
providing an interface to a viewer; presenting a 3D vehicle representation to a viewer; receiving input from a viewer relative to a desired aspect or perspective of the vehicle; and adjusting or changing the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective. 2. A method in accordance with claim 1, wherein said presentation is a broadcast presentation, and wherein said input from a viewer is input from a broadcast personnel 3. A method in accordance with claim 2, wherein said presentation comprises manipulation of a virtual 3D car by a broadcast analyst. 4. A method in accordance with claim 3, wherein said presentation further comprises selection of a vehicle component and manipulation of a vehicle component displayed aspect by said analyst for broadcast. 5. A method in accordance with claim 1, wherein said interface comprises a touchscreen display interface. 6. A method in accordance with claim 1, wherein said interface comprises a mobile device interface. 7. A method in accordance with claim 1, wherein said interface comprises a web interface. 8. A method in accordance with claim 4, wherein said interface comprises a touchscreen display at a first interface and a mobile interface at a second location. 9. A method in accordance with claim 8, wherein said interface comprises a production broadcast display screen and at least one remote mobile device configured to control the production broadcast display screen. 10. A method in accordance with claim 1, wherein said display is a touchscreen display that is configured with a populated index of selectable categories and subcategories corresponding to vehicle aspects and components. 11. A method in accordance with claim 10, wherein said display further includes at least selectable animation of a vehicle aspect or component. 12. A system for viewer interaction relative to a 3D representation of a vehicle, comprising:
a viewer interface, the viewer interface configured to present a 3D vehicle representation to a viewer as a presentation; a control input configured to permit a viewer to select a desired aspect or perspective of the vehicle; and a server configured to adjust or change the 3D vehicle representation to correspond with the viewer indicated desired aspect or perspective, wherein the server accesses storage containing 3D vehicle information corresponding to said desired aspect or perspective. 13. A system in accordance with claim 12, wherein said presentation is a broadcast presentation, and wherein said input from a viewer is input from a broadcast personnel 14. A system in accordance with claim 13, wherein said presentation comprises manipulation of a virtual 3D car by a broadcast analyst. 15. A system in accordance with claim 14, wherein said presentation further comprises selection of a vehicle component and manipulation of a vehicle component displayed aspect by said analyst for broadcast. 16. A system in accordance with claim 12, wherein said interface comprises a touchscreen display interface. 17. A system in accordance with claim 12, wherein said interface comprises a mobile device interface. 18. A system in accordance with claim 12, wherein said interface comprises a web interface. 19. A system in accordance with claim 15, wherein said interface comprises a touchscreen display at a first interface and a mobile interface at a second location. 20. A system in accordance with claim 19, wherein said interface comprises a production broadcast display screen and at least one remote mobile device configured to control the production broadcast display screen. 21. A system in accordance with claim 12, wherein said display is a touchscreen display that is configured with a populated index of selectable categories and subcategories corresponding to vehicle aspects and components. 22. A system in accordance with claim 21, wherein said display further includes at least selectable animation of a vehicle aspect or component. | 2,100 |
5,298 | 13,969,622 | 2,142 | A system, method and computer product for managing resources for tasks. An example system includes a rules database storing requirements and restrictions associated with a task. A graphical user interface contains resource icons of resources that can, at least partially, fulfill the requirements of the task and a virtual service agent (VSA) icon of a VSA associated with the task. When a resource icon is attempted to be dragged and dropped onto the VSA icon, the graphical user interface permits or prohibits the dragging and dropping responsive to a rules-checking module that checks violations of the restrictions. Furthermore, an agent-checking module ensures that at least one resource includes a software agent configured to answer natural language questions. The software agent queries data repositories and applies language processing, information retrieval, and machine learning to arrive at a conclusion. | 1. A method for managing resources for tasks, the method compromising:
storing requirements and restrictions associated with a task in a rules database; and displaying a graphical user interface including resource icons of resources that can, at least partially, fulfill the requirements of the task, and a virtual service agent (VSA) icon of a VSA associated with the task such that when a resource icon is attempted to be dragged and dropped onto the VSA icon, the graphical user interface permits and prohibits the dragging and dropping responsive to a rules-checking module that checks violations of the restrictions and a checking module that ensures that at least one resource includes a software agent configured to answer natural language questions by querying data repositories, and applying language processing, information retrieval and machine learning to determine answers to the natural language questions. 2. The method of claim 1, further comprising:
specifying, in the rules database, social-network connectivity characteristics that must be fulfilled by one or more resources of the VSA; and associating the social network connectivity characteristics with the task. 3. The method of claim 2, wherein the social-network connectivity characteristics include at least one of:
a degree centrality parameter specifying a minimum number of direct relationships of the VSA; a betweenness centrality parameter specifying the VSA's minimum position within a network in terms of its ability to make connections to other entities in a network; a closeness parameter specifying how quickly the VSA can access more entities in the network; an Eigenvalue parameter specifying how close the VSA is to other highly close entities within the network; an authority parameter specifying the minimum number of network nodes that point to the VSA; and a hub parameter specifying the minimum number of authorities the VSA must point to. 4. The method of claim 1, further comprising changing an appearance of the VSA icon to indicate a remaining amount of unfulfilled requirements associated with the task by the graphical user interface. 5. The method of claim 1, wherein the graphical user interface is configured to, in response to the resource icon being dragged and dropped onto the VSA icon, search for additional resources that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task. 6. The method of claim 5, further comprising changing an appearance of the additional resource icons that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task by configuring the graphical user interface. 7. The method of claim 6, further comprising moving the additional resource icons that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task closer to the VSA icon by configuring the graphical user interface. 8. The method of claim 1, further comprising:
checking laws and regulations that may apply to members of the VSA in different states and countries using a legal-checking component (LCC); calculating a risk factor associated with the members of the VSA in fulfilling the requirements of the task using a risk-management component (RMC); distributing work among the members of the VSA using a workload-distribution component (WDC); estimating social-network characteristics of the members of the VSA using a social-networking component (SNC); and adjusting the members of the VSA based on signals from at least one of the workload-distribution component (WDC), the legal-checking component (LCC), the risk-management component (RMC) and the social-networking component (SNC) using a VSA formation component (VFC). 9. The method of claim 1, wherein the graphical user interface includes graphical widgets to adjust the requirements and restrictions associated with the task and, in response to adjustments to the requirements and restrictions associated with the task, the graphical user interface changes an appearance of the VSA icon to indicate a remaining amount of unfulfilled requirements associated with the task. | A system, method and computer product for managing resources for tasks. An example system includes a rules database storing requirements and restrictions associated with a task. A graphical user interface contains resource icons of resources that can, at least partially, fulfill the requirements of the task and a virtual service agent (VSA) icon of a VSA associated with the task. When a resource icon is attempted to be dragged and dropped onto the VSA icon, the graphical user interface permits or prohibits the dragging and dropping responsive to a rules-checking module that checks violations of the restrictions. Furthermore, an agent-checking module ensures that at least one resource includes a software agent configured to answer natural language questions. The software agent queries data repositories and applies language processing, information retrieval, and machine learning to arrive at a conclusion.1. A method for managing resources for tasks, the method compromising:
storing requirements and restrictions associated with a task in a rules database; and displaying a graphical user interface including resource icons of resources that can, at least partially, fulfill the requirements of the task, and a virtual service agent (VSA) icon of a VSA associated with the task such that when a resource icon is attempted to be dragged and dropped onto the VSA icon, the graphical user interface permits and prohibits the dragging and dropping responsive to a rules-checking module that checks violations of the restrictions and a checking module that ensures that at least one resource includes a software agent configured to answer natural language questions by querying data repositories, and applying language processing, information retrieval and machine learning to determine answers to the natural language questions. 2. The method of claim 1, further comprising:
specifying, in the rules database, social-network connectivity characteristics that must be fulfilled by one or more resources of the VSA; and associating the social network connectivity characteristics with the task. 3. The method of claim 2, wherein the social-network connectivity characteristics include at least one of:
a degree centrality parameter specifying a minimum number of direct relationships of the VSA; a betweenness centrality parameter specifying the VSA's minimum position within a network in terms of its ability to make connections to other entities in a network; a closeness parameter specifying how quickly the VSA can access more entities in the network; an Eigenvalue parameter specifying how close the VSA is to other highly close entities within the network; an authority parameter specifying the minimum number of network nodes that point to the VSA; and a hub parameter specifying the minimum number of authorities the VSA must point to. 4. The method of claim 1, further comprising changing an appearance of the VSA icon to indicate a remaining amount of unfulfilled requirements associated with the task by the graphical user interface. 5. The method of claim 1, wherein the graphical user interface is configured to, in response to the resource icon being dragged and dropped onto the VSA icon, search for additional resources that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task. 6. The method of claim 5, further comprising changing an appearance of the additional resource icons that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task by configuring the graphical user interface. 7. The method of claim 6, further comprising moving the additional resource icons that can, at least partially, fulfill any unfulfilled requirements associated with the task without violating the restrictions associated with the task closer to the VSA icon by configuring the graphical user interface. 8. The method of claim 1, further comprising:
checking laws and regulations that may apply to members of the VSA in different states and countries using a legal-checking component (LCC); calculating a risk factor associated with the members of the VSA in fulfilling the requirements of the task using a risk-management component (RMC); distributing work among the members of the VSA using a workload-distribution component (WDC); estimating social-network characteristics of the members of the VSA using a social-networking component (SNC); and adjusting the members of the VSA based on signals from at least one of the workload-distribution component (WDC), the legal-checking component (LCC), the risk-management component (RMC) and the social-networking component (SNC) using a VSA formation component (VFC). 9. The method of claim 1, wherein the graphical user interface includes graphical widgets to adjust the requirements and restrictions associated with the task and, in response to adjustments to the requirements and restrictions associated with the task, the graphical user interface changes an appearance of the VSA icon to indicate a remaining amount of unfulfilled requirements associated with the task. | 2,100 |
5,299 | 14,626,913 | 2,137 | A method for controlling cache snoop and/or invalidate coherence traffic for specific caches based on transaction attributes is described. A memory management unit (MMU) determines one or more transaction attributes for a cache coherence transaction from a requesting processor. A routing module identifies a cachability domain and/or shareability domain based on the transaction attributes and routes the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. Instead of coherence traffic being routed to all caches on a coherence bus, coherence traffic is selectively routed based on transaction attributes such as an address space identifier (ASID), a virtual machine identifier (VMID), a secure bit (NS), a hypervisor identifier (HYP), etc. | 1. A method for routing a coherence request to one or more caches in a computing system, the method comprising:
determining one or more transaction attributes for a cache coherence transaction from a requesting processor; identifying a cachability domain and/or shareability domain based on the transaction attributes; and routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 2. The method of claim 1, wherein the one or more transaction attributes includes an address space identifier (ASID). 3. The method of claim 1, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 4. The method of claim 1, wherein the one or more transaction attributes includes a secure root identifier (NS). 5. The method of claim 1, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 6. The method of claim 1, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 7. The method of claim 1, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). 8. An apparatus for routing a coherence request to one or more caches in a computing system, the apparatus comprising:
a memory management unit (MMU) configured to determine one or more transaction attributes for a cache coherence transaction from a requesting processor; and a routing module configured to:
identify a cachability domain and/or shareability domain based on the transaction attributes and to route the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 9. The apparatus of claim 8, wherein the one or more transaction attributes includes an address space identifier (ASID). 10. The apparatus of claim 8, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 11. The apparatus of claim 8, wherein the one or more transaction attributes includes a secure root identifier (NS). 12. The apparatus of claim 8, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 13. The apparatus of claim 8, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 14. The apparatus of claim 8, wherein the requesting processor is a Graphics Processing Unit (GPU) and a Digital Signal Processor (DSP). 15. The apparatus of claim 8, wherein the requesting processor is integrated in an integrated circuit. 16. The apparatus of claim 15, wherein the integrated circuit is integrated into a device selected from the group consisting of: a set-top box, music player, video player, entertainment unit, navigation device, communications device, personal digital assistant (PDA), fixed location data unit, and a computer. 17. An apparatus for routing a coherence request to one or more caches in a computing system, the apparatus comprising:
means for determining one or more transaction attributes for a cache coherence transaction from a requesting processor; means for identifying a cachability domain and/or shareability domain based on the transaction attributes; and means for routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 18. The apparatus of claim 17, wherein the one or more transaction attributes includes an address space identifier (ASID). 19. The apparatus of claim 17, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 20. The apparatus of claim 17, wherein the one or more transaction attributes includes a secure root identifier (NS). 21. The apparatus of claim 17, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 22. The apparatus of claim 17, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 23. The apparatus of claim 17, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). 24. The apparatus of claim 17, wherein the requesting processor is integrated in an integrated circuit. 25. The apparatus of claim 24, wherein the integrated circuit is integrated into a device selected from the group consisting of: a set-top box, music player, video player, entertainment unit, navigation device, communications device, personal digital assistant (PDA), fixed location data unit, and a computer. 26. A computer-readable storage medium including information that, when accessed by a machine, cause the machine to perform operations for routing a coherence request to one or more caches in a computing system, the operations comprising:
determining one or more transaction attributes for a cache coherence transaction from a requesting processor; identifying a cachability domain and/or shareability domain based on the transaction attributes; and routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 27. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least one of an address space identifier (ASID) and a virtual machine identifier (VMID). 28. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least one of a secure root identifier (NS) and a hypervisor identifier (HYP). 29. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 30. The computer-readable storage medium of claim 26, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). | A method for controlling cache snoop and/or invalidate coherence traffic for specific caches based on transaction attributes is described. A memory management unit (MMU) determines one or more transaction attributes for a cache coherence transaction from a requesting processor. A routing module identifies a cachability domain and/or shareability domain based on the transaction attributes and routes the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. Instead of coherence traffic being routed to all caches on a coherence bus, coherence traffic is selectively routed based on transaction attributes such as an address space identifier (ASID), a virtual machine identifier (VMID), a secure bit (NS), a hypervisor identifier (HYP), etc.1. A method for routing a coherence request to one or more caches in a computing system, the method comprising:
determining one or more transaction attributes for a cache coherence transaction from a requesting processor; identifying a cachability domain and/or shareability domain based on the transaction attributes; and routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 2. The method of claim 1, wherein the one or more transaction attributes includes an address space identifier (ASID). 3. The method of claim 1, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 4. The method of claim 1, wherein the one or more transaction attributes includes a secure root identifier (NS). 5. The method of claim 1, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 6. The method of claim 1, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 7. The method of claim 1, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). 8. An apparatus for routing a coherence request to one or more caches in a computing system, the apparatus comprising:
a memory management unit (MMU) configured to determine one or more transaction attributes for a cache coherence transaction from a requesting processor; and a routing module configured to:
identify a cachability domain and/or shareability domain based on the transaction attributes and to route the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 9. The apparatus of claim 8, wherein the one or more transaction attributes includes an address space identifier (ASID). 10. The apparatus of claim 8, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 11. The apparatus of claim 8, wherein the one or more transaction attributes includes a secure root identifier (NS). 12. The apparatus of claim 8, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 13. The apparatus of claim 8, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 14. The apparatus of claim 8, wherein the requesting processor is a Graphics Processing Unit (GPU) and a Digital Signal Processor (DSP). 15. The apparatus of claim 8, wherein the requesting processor is integrated in an integrated circuit. 16. The apparatus of claim 15, wherein the integrated circuit is integrated into a device selected from the group consisting of: a set-top box, music player, video player, entertainment unit, navigation device, communications device, personal digital assistant (PDA), fixed location data unit, and a computer. 17. An apparatus for routing a coherence request to one or more caches in a computing system, the apparatus comprising:
means for determining one or more transaction attributes for a cache coherence transaction from a requesting processor; means for identifying a cachability domain and/or shareability domain based on the transaction attributes; and means for routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 18. The apparatus of claim 17, wherein the one or more transaction attributes includes an address space identifier (ASID). 19. The apparatus of claim 17, wherein the one or more transaction attributes includes a virtual machine identifier (VMID). 20. The apparatus of claim 17, wherein the one or more transaction attributes includes a secure root identifier (NS). 21. The apparatus of claim 17, wherein the one or more transaction attributes includes a hypervisor identifier (HYP). 22. The apparatus of claim 17, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 23. The apparatus of claim 17, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). 24. The apparatus of claim 17, wherein the requesting processor is integrated in an integrated circuit. 25. The apparatus of claim 24, wherein the integrated circuit is integrated into a device selected from the group consisting of: a set-top box, music player, video player, entertainment unit, navigation device, communications device, personal digital assistant (PDA), fixed location data unit, and a computer. 26. A computer-readable storage medium including information that, when accessed by a machine, cause the machine to perform operations for routing a coherence request to one or more caches in a computing system, the operations comprising:
determining one or more transaction attributes for a cache coherence transaction from a requesting processor; identifying a cachability domain and/or shareability domain based on the transaction attributes; and routing the cache coherence transaction to one or more caches in the cachability domain and/or shareability domain. 27. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least one of an address space identifier (ASID) and a virtual machine identifier (VMID). 28. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least one of a secure root identifier (NS) and a hypervisor identifier (HYP). 29. The computer-readable storage medium of claim 26, wherein the one or more transaction attributes includes at least two selected from the group consisting of: an address space identifier (ASID), a virtual machine identifier (VMID), a secure root identifier (NS), and a hypervisor identifier (HYP) for the requesting processor. 30. The computer-readable storage medium of claim 26, wherein the requesting processor is a Graphics Processing Unit (GPU) or a Digital Signal Processor (DSP). | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.