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,000 | 12,761,418 | 2,177 | A visual layout system is described herein that supports complex interface transitions between declaratively defined interface templates and states. The system builds a correspondence between an old template and the new template, preserves visual elements that are present in both templates, and changes the visual elements' properties and position in a rendering tree as needed. The system creates or destroys visuals that are only in one template as needed. Using the visual layout system, a designer can specify states of a user interface within a declarative representation of the template that will produce the specified displays. The system allows sweeping state changes to be specified as templates for the designer. Thus, the visual layout system provides designers with an easy facility for specifying complex user interface transitions and manages the transitions at runtime for acceptable performance. | 1. A computer-implemented method for determining a delta between two user interface templates, the method comprising:
receiving a first declarative template definition that defines a user interface layout of one or more controls associated with one or more first states; receiving a second declarative template definition that defines a user interface layout of one or more controls associated with one or more second states; correlating at least one of the one or more controls in the first template definition with at least one of the one or more controls in the second template definition; identifying one or more differences between the first template definition and second template definition; and creating editing operations based on the identified differences that comprise procedural instructions for transitioning from the user interface layout defined by the first template definition to the user interface layout defined by the second template definition, wherein the preceding steps are performed by at least one processor. 2. The method of claim 1 wherein receiving the first declarative template definition comprises receiving an extensible markup language (XML) file that includes hierarchical elements that specify controls associated with the first template. 3. The method of claim 1 wherein receiving the first declarative template definition comprises includes receiving one or more states that a template designer created to represent behavior of the template and ways in which a user's actions or other events can modify the template's layout or properties. 4. The method of claim 1 wherein receiving the second declarative template definition comprises receiving a user interface state to which the user interface can transition based on user actions, wherein the second declarative template definition adds at least one user interface element not present in the first declarative template definition. 5. The method of claim 1 wherein correlating controls comprises identifying controls by identifier and determining that controls are correlated if they have the same identifier in both template definitions. 6. The method of claim 1 wherein correlating controls comprises identifying items that can be displayed upon transition to the second declarative template definition by reusing existing controls and without instantiating new controls. 7. The method of claim 1 wherein identifying differences comprises identifying property value differences for controls that are correlated in both templates. 8. The method of claim 1 wherein identifying differences comprises identifying controls that are present in the second template definition that are not present in the first template definition. 9. The method of claim 1 wherein identifying differences comprises identifying structural changes in controls that are present in the first template definition. 10. The method of claim 1 wherein creating editing operations comprises creating editing operations that modify the properties of controls defined in the first and second templates based on the property differences specified in the respective template. 11. The method of claim 1 wherein creating editing operations comprises creating editing operations that instantiate controls for controls added by the second template definition. 12. The method of claim 1 further comprising storing the created editing operations in association with the first template definition so that transition requests from the first template definition can invoke the editing operations to transition to the user interface layout specified by the second template definition. 13. A computer system for allowing a user interface designer to define complex user interface state changes, the system comprising:
a processor and memory configured to execute software instructions; a template definition component configured to receive from the user interface designer a declarative definition of one or more templates and states for a user interface; a state management component configured to store multiple states in which the user interface can exist and receive indications to transition from one state to another; a template delta component configured to compare templates of one or more incoming and outgoing states to determine a layout of elements and properties that change between the states; a state transition component configured to generate one or more editing operations to translate from the incoming state to the outgoing state based on the comparison of templates; a snapshot component configured to take a snapshot that includes a position of each user interface element before a state transition; and an element transition component configured to transition an element smoothly between the outgoing state and the incoming state. 14. The system of claim 13 wherein the template definition component is further configured to receive user interface definition information from a visual editing tool that allows the designer to visually create an interface definition that the visual tool exports into a declarative format. 15. The system of claim 13 wherein the template definition component is further configured to receive a declarative definition that includes base template information with controls common to all states and additional states that include additional controls added to the common controls for those states. 16. The system of claim 13 wherein the template delta component is further configured to identify corresponding elements between the templates based on an identifier that is the same for elements in both templates. 17. The system of claim 13 wherein the template delta component is further configured to compare templates at design or compile time and compile multiple templates into a base template and one or more editing operations that translate at runtime the base template into a representation of each design time template. 18. The system of claim 13 wherein the state transition component is further configured to invoke a compiler that acts upon the received declarative definition at design time to automatically generate procedural steps to transition the user interface from an initial view in the outgoing state to a new view in the incoming state. 19. A computer-readable storage medium comprising instructions for controlling a computer system to animate a transition between user interface states, wherein the instructions, when executed, cause a processor to perform actions comprising:
receiving a request to transition from a first state characterized by a first user interface layout to a second state characterized by a second user interface layout; accessing information related to one or more templates associated with the first and second user interface layouts to identify state information associated with each layout; receiving a procedural set of automatically generated editing operations that identify differences between the first user interface layout and the second user interface layout; storing one or more starting positions of elements in the first user interface layout; invoking the received editing operations to transition a user interface from the first state to the second state; and animating the user interface from the stored starting positions of elements in the first user interlace layout to one or more ending positions identified by the invoked editing operations. 20. The medium of claim 19 wherein receiving editing operations comprise receiving instructions that invoke application programming interfaces (APIs) for setting property values, instantiating controls to be added to the display, and hiding controls to be removed from the user interface. | A visual layout system is described herein that supports complex interface transitions between declaratively defined interface templates and states. The system builds a correspondence between an old template and the new template, preserves visual elements that are present in both templates, and changes the visual elements' properties and position in a rendering tree as needed. The system creates or destroys visuals that are only in one template as needed. Using the visual layout system, a designer can specify states of a user interface within a declarative representation of the template that will produce the specified displays. The system allows sweeping state changes to be specified as templates for the designer. Thus, the visual layout system provides designers with an easy facility for specifying complex user interface transitions and manages the transitions at runtime for acceptable performance.1. A computer-implemented method for determining a delta between two user interface templates, the method comprising:
receiving a first declarative template definition that defines a user interface layout of one or more controls associated with one or more first states; receiving a second declarative template definition that defines a user interface layout of one or more controls associated with one or more second states; correlating at least one of the one or more controls in the first template definition with at least one of the one or more controls in the second template definition; identifying one or more differences between the first template definition and second template definition; and creating editing operations based on the identified differences that comprise procedural instructions for transitioning from the user interface layout defined by the first template definition to the user interface layout defined by the second template definition, wherein the preceding steps are performed by at least one processor. 2. The method of claim 1 wherein receiving the first declarative template definition comprises receiving an extensible markup language (XML) file that includes hierarchical elements that specify controls associated with the first template. 3. The method of claim 1 wherein receiving the first declarative template definition comprises includes receiving one or more states that a template designer created to represent behavior of the template and ways in which a user's actions or other events can modify the template's layout or properties. 4. The method of claim 1 wherein receiving the second declarative template definition comprises receiving a user interface state to which the user interface can transition based on user actions, wherein the second declarative template definition adds at least one user interface element not present in the first declarative template definition. 5. The method of claim 1 wherein correlating controls comprises identifying controls by identifier and determining that controls are correlated if they have the same identifier in both template definitions. 6. The method of claim 1 wherein correlating controls comprises identifying items that can be displayed upon transition to the second declarative template definition by reusing existing controls and without instantiating new controls. 7. The method of claim 1 wherein identifying differences comprises identifying property value differences for controls that are correlated in both templates. 8. The method of claim 1 wherein identifying differences comprises identifying controls that are present in the second template definition that are not present in the first template definition. 9. The method of claim 1 wherein identifying differences comprises identifying structural changes in controls that are present in the first template definition. 10. The method of claim 1 wherein creating editing operations comprises creating editing operations that modify the properties of controls defined in the first and second templates based on the property differences specified in the respective template. 11. The method of claim 1 wherein creating editing operations comprises creating editing operations that instantiate controls for controls added by the second template definition. 12. The method of claim 1 further comprising storing the created editing operations in association with the first template definition so that transition requests from the first template definition can invoke the editing operations to transition to the user interface layout specified by the second template definition. 13. A computer system for allowing a user interface designer to define complex user interface state changes, the system comprising:
a processor and memory configured to execute software instructions; a template definition component configured to receive from the user interface designer a declarative definition of one or more templates and states for a user interface; a state management component configured to store multiple states in which the user interface can exist and receive indications to transition from one state to another; a template delta component configured to compare templates of one or more incoming and outgoing states to determine a layout of elements and properties that change between the states; a state transition component configured to generate one or more editing operations to translate from the incoming state to the outgoing state based on the comparison of templates; a snapshot component configured to take a snapshot that includes a position of each user interface element before a state transition; and an element transition component configured to transition an element smoothly between the outgoing state and the incoming state. 14. The system of claim 13 wherein the template definition component is further configured to receive user interface definition information from a visual editing tool that allows the designer to visually create an interface definition that the visual tool exports into a declarative format. 15. The system of claim 13 wherein the template definition component is further configured to receive a declarative definition that includes base template information with controls common to all states and additional states that include additional controls added to the common controls for those states. 16. The system of claim 13 wherein the template delta component is further configured to identify corresponding elements between the templates based on an identifier that is the same for elements in both templates. 17. The system of claim 13 wherein the template delta component is further configured to compare templates at design or compile time and compile multiple templates into a base template and one or more editing operations that translate at runtime the base template into a representation of each design time template. 18. The system of claim 13 wherein the state transition component is further configured to invoke a compiler that acts upon the received declarative definition at design time to automatically generate procedural steps to transition the user interface from an initial view in the outgoing state to a new view in the incoming state. 19. A computer-readable storage medium comprising instructions for controlling a computer system to animate a transition between user interface states, wherein the instructions, when executed, cause a processor to perform actions comprising:
receiving a request to transition from a first state characterized by a first user interface layout to a second state characterized by a second user interface layout; accessing information related to one or more templates associated with the first and second user interface layouts to identify state information associated with each layout; receiving a procedural set of automatically generated editing operations that identify differences between the first user interface layout and the second user interface layout; storing one or more starting positions of elements in the first user interface layout; invoking the received editing operations to transition a user interface from the first state to the second state; and animating the user interface from the stored starting positions of elements in the first user interlace layout to one or more ending positions identified by the invoked editing operations. 20. The medium of claim 19 wherein receiving editing operations comprise receiving instructions that invoke application programming interfaces (APIs) for setting property values, instantiating controls to be added to the display, and hiding controls to be removed from the user interface. | 2,100 |
5,001 | 14,451,109 | 2,167 | Systems and methods are disclosed which employ a centralized selection context having selection states spread across user interface elements. Methods are described in which the binding between widgets and data storage is isolated using the centralized selection context paradigm for a majority of data items represented within a user interface. This selection context is fully accessible by methods that access data while considering the current selection context. The centralized selection context simplifies event-handling logic by having selection context readily available thus removing the need to query individual widgets for their state. | 1. A method implemented by a computer for automatically capturing file format information directly from the file input/output, comprising:
modifying source code corresponding to certain file operations so as to cause the certain file operations to capture file format information; collecting, by the computer, the file format information during execution of the certain file operations in a captured file object; and processing the captured file object to obtain the file structure specification. 2. The method of claim 1, wherein processing includes printing the file structure specification into a specification document. 3. The method of claim 1, wherein collecting the file format information comprises performing an automatic line-by-line determination of the file format. 4. The method of claim 1, wherein modifying source code includes instrumenting write operations such that the file format specification is captured by a dummy file capturing object. 5. The method of claim 4, wherein processing includes processing the dummy file capturing object to produce the file structure specification. 6. The method of claim 1, further comprising providing a layered input/output mechanism for working with files. 7. The method of claim 4, wherein instrumenting includes instrumenting the write operations with descriptions and/or a mechanism to detect data type and size. 8. The method of claim 4, wherein the capturing object automatically detects when a write operation occurs and identifies metadata associated with the write operation. 9. The method of claim 8, wherein the metadata includes one or more of data type, size, and description. 10. A method implemented by a computer for automatically capturing file format information directly from the file input/output, comprising:
modifying source code corresponding to certain file read operations so as to cause the certain file read operations to capture file format information; collecting, by the computer, the file format information during execution of the certain file operations in a captured file object; and processing the captured file object to obtain the file structure specification. 11. The method of claim 10, wherein processing includes printing the file structure specification into a specification document. 12. The method of claim 10, wherein collecting the file format information comprises performing an automatic line-by-line determination of the file format. 13. The method of claim 10, wherein modifying source code includes instrumenting the file read operations such that the file format specification is captured by a dummy file capturing object. 14. The method of claim 13, wherein processing includes processing the dummy file capturing object to produce the file structure specification. 15. The method of claim 10, further comprising providing a layered input/output mechanism for working with files. 16. The method of claim 13, wherein instrumenting includes instrumenting the file read operations with descriptions and/or a mechanism to detect data type and size. 17. The method of claim 13, wherein the capturing object automatically detects when a file read operation occurs and identifies metadata associated with the file read operation. 18. The method of claim 17, wherein the metadata includes one or more of data type, size, and description. | Systems and methods are disclosed which employ a centralized selection context having selection states spread across user interface elements. Methods are described in which the binding between widgets and data storage is isolated using the centralized selection context paradigm for a majority of data items represented within a user interface. This selection context is fully accessible by methods that access data while considering the current selection context. The centralized selection context simplifies event-handling logic by having selection context readily available thus removing the need to query individual widgets for their state.1. A method implemented by a computer for automatically capturing file format information directly from the file input/output, comprising:
modifying source code corresponding to certain file operations so as to cause the certain file operations to capture file format information; collecting, by the computer, the file format information during execution of the certain file operations in a captured file object; and processing the captured file object to obtain the file structure specification. 2. The method of claim 1, wherein processing includes printing the file structure specification into a specification document. 3. The method of claim 1, wherein collecting the file format information comprises performing an automatic line-by-line determination of the file format. 4. The method of claim 1, wherein modifying source code includes instrumenting write operations such that the file format specification is captured by a dummy file capturing object. 5. The method of claim 4, wherein processing includes processing the dummy file capturing object to produce the file structure specification. 6. The method of claim 1, further comprising providing a layered input/output mechanism for working with files. 7. The method of claim 4, wherein instrumenting includes instrumenting the write operations with descriptions and/or a mechanism to detect data type and size. 8. The method of claim 4, wherein the capturing object automatically detects when a write operation occurs and identifies metadata associated with the write operation. 9. The method of claim 8, wherein the metadata includes one or more of data type, size, and description. 10. A method implemented by a computer for automatically capturing file format information directly from the file input/output, comprising:
modifying source code corresponding to certain file read operations so as to cause the certain file read operations to capture file format information; collecting, by the computer, the file format information during execution of the certain file operations in a captured file object; and processing the captured file object to obtain the file structure specification. 11. The method of claim 10, wherein processing includes printing the file structure specification into a specification document. 12. The method of claim 10, wherein collecting the file format information comprises performing an automatic line-by-line determination of the file format. 13. The method of claim 10, wherein modifying source code includes instrumenting the file read operations such that the file format specification is captured by a dummy file capturing object. 14. The method of claim 13, wherein processing includes processing the dummy file capturing object to produce the file structure specification. 15. The method of claim 10, further comprising providing a layered input/output mechanism for working with files. 16. The method of claim 13, wherein instrumenting includes instrumenting the file read operations with descriptions and/or a mechanism to detect data type and size. 17. The method of claim 13, wherein the capturing object automatically detects when a file read operation occurs and identifies metadata associated with the file read operation. 18. The method of claim 17, wherein the metadata includes one or more of data type, size, and description. | 2,100 |
5,002 | 13,915,551 | 2,126 | One embodiment of the present invention provides a system for clustering heterogeneous events using user-provided constraints. During operation, the system estimates, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events. Next, the system estimates a probability distribution for an event property associated with each cluster. The system receives heterogeneous event data, and analyzes the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters. The system receives user input specifying the user-provided constraints for specializing the probabilistic model, and performs at least one of: re-computing the assignment of events to clusters, and re-determining the probability distribution of event properties of clusters based on the user input. | 1. A computer-executable method performed by a system for clustering heterogeneous events using user-provided constraints, comprising:
estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 2. The method of claim 1, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 3. The method of claim 1, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 4. The method of claim 1, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 5. The method of claim 1, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 6. The method of claim 1, further comprising receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for clustering heterogeneous events using user-provided constraints, the method comprising:
estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 8. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 9. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 10. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 11. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 12. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. 13. A computing system for clustering heterogeneous events using user-provided constraints, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 14. The computing system of claim 13, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 15. The computing system of claim 13, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 16. The computing system of claim 13, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 17. The computing system of claim 13, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 18. The computing system of claim 13, further comprising receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. | One embodiment of the present invention provides a system for clustering heterogeneous events using user-provided constraints. During operation, the system estimates, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events. Next, the system estimates a probability distribution for an event property associated with each cluster. The system receives heterogeneous event data, and analyzes the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters. The system receives user input specifying the user-provided constraints for specializing the probabilistic model, and performs at least one of: re-computing the assignment of events to clusters, and re-determining the probability distribution of event properties of clusters based on the user input.1. A computer-executable method performed by a system for clustering heterogeneous events using user-provided constraints, comprising:
estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 2. The method of claim 1, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 3. The method of claim 1, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 4. The method of claim 1, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 5. The method of claim 1, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 6. The method of claim 1, further comprising receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for clustering heterogeneous events using user-provided constraints, the method comprising:
estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 8. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 9. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 10. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 11. The computer-readable storage medium of claim 7, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 12. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. 13. A computing system for clustering heterogeneous events using user-provided constraints, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: estimating, based on a probabilistic model, a distribution of events across clusters such that each cluster includes a set of events; estimating a probability distribution for an event property associated with each cluster; receiving heterogeneous event data; analyzing the heterogeneous event data to determine the probability distribution of event properties of clusters and to assign events to clusters; receiving user input specifying the user-provided constraints for specializing the probabilistic model; and performing at least one of: re-computing the assignment of events to clusters; and re-determining the probability distribution of event properties of clusters based on the user input. 14. The computing system of claim 13, wherein the user-provided constraints specify that two or more events belong to the same cluster in the probabilistic model. 15. The computing system of claim 13, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed according to the probabilistic model, and that events associated with time after the particular time are processed according to another probabilistic model. 16. The computing system of claim 13, wherein the user-provided constraints specify that events associated with time prior to a particular time are processed as a first event type, and that events associated with time after the particular time are processed as a second event type. 17. The computing system of claim 13, wherein the user-provided constraints specify relationships between variables in the probabilistic model. 18. The computing system of claim 13, further comprising receiving user input that specifies parameters associated with events are same when locations associated with the events are the same. | 2,100 |
5,003 | 14,191,314 | 2,173 | A method of operating a data processing system to display a plurality of list entries is disclosed. Each list entry includes a timestamp, an identifier, and a message. The method includes sorting the list entries by the identifier associated with the list entries and displaying a data flow chart on a display associated with the data processing system. The data flow chart has a plurality of rows. Each row is a graphical view of the list entries having a given identifier. Each row includes a graphical element representing each message and a row label indicating the identifier associated with that row. Each row has a time region representing a time axis on which the graphical elements are placed, each of the graphical elements being placed at a location in the time region determined by the timestamp associated with that message. | 1. A method of operating a data processing system to display a plurality of list entries, each list entry comprising a timestamp, an identifier, and a message, said method comprising:
causing said data processing system to group said list entries by said identifier associated with said list entries; and generating a data flow chart on a display associated with said data processing system, said data flow chart having a plurality of rows, each row being a graphical view of said list entries having a given identifier, said rows comprising graphical elements representing each message in that row, each row comprising a row label indicating said identifier associated with that row and a time region representing a time axis on which each of said graphical elements is placed, said graphical elements being placed at a location in said time region determined by said timestamp associated with that message. 2. The method of claim 1 wherein each of said list entries further comprises a duration indicating a time span associated with an action that generated said list entry, and wherein each of said graphical elements has a dimension along said time axis that is determined by said duration. 3. The method of claim 2 wherein each row having two graphical elements that overlap in time includes a plurality of sub-rows that display said graphical elements such that no two graphical elements overlap in time in any sub-row. 4. The method of claim 1 wherein each of said list entries further comprises a message type and wherein each of said graphical elements comprises a label that indicates said message type associated with said list entry corresponding to that graphical element. 5. The method of claim 1 further comprising:
receiving user information indicating a sub-region of said data flow chart and display; and
displaying said message corresponding to each graphical element in said sub-region. 6. The method of claim 5 wherein said displaying said message comprises generating a table of said list entries corresponding to graphical elements within said sub-region, said table including said message for each of said graphical elements in said sub-region, said identifier corresponding to that message, and said timestamp corresponding to that message. 7. The method of claim 2 further comprising providing an indication of a number of graphical elements that overlap in time in said graphical view as a function of time as indicated by said timestamps. 8. The method of claim 7 wherein each of said list entries further comprises a message type and wherein said data processing system displays a message type parallelism graph that represents a degree of parallel processes that is operative when a given message type is operative. 9. The method of claim 8 wherein said display comprises a plurality of message type parallelism graphs. 10. The method of claim 9 wherein said message type parallelism graphs are sorted on said display based on a total time messages of each type were active. 11. The method of claim 9 wherein said message type parallelism graphs are sorted by an indicator specifying a degree of parallelism in said messages of each type. 12. A computer readable medium comprising instructions that cause a data processing system to execute a method for operating a display that is part of said data processing system to display a plurality of list entries, each list entry comprising a timestamp, an identifier, and a message, said method comprising:
causing said data processing system to group said list entries by said identifier associated with said list entries; and generating a data flow chart on a display associated with said data processing system, said data flow chart having a plurality of rows, each row being a graphical view of said list entries having a given identifier, said rows comprising graphical elements representing each message on that row, each row comprising a row label indicating said identifier associated with that row and a time region representing a time axis on which said graphical elements are placed, each of said graphical elements being placed at a location in said time region determined by said timestamp associated with that message. 13. The computer readable medium of claim 12 wherein each of said list entries further comprises a duration indicating a time span associated with an action that generated said list entry, and wherein each of said graphical elements has a dimension along said time axis that is determined by said duration. 14. The computer readable medium of claim 12 wherein each of said list entries further comprises a message type and wherein each of said graphical elements comprises a label that indicates said message type associated with said list entry corresponding to that graphical element. 15. The computer readable medium of claim 12 wherein said method further comprises:
receiving user information indicating a sub-region of said data flow chart and display; and
displaying said message corresponding to each graphical element in said sub-region. 16. The computer readable medium of claim 15 wherein said displaying said message comprises generating a table of said list entries corresponding to graphical elements within said sub-region, said table including said message for each of said graphical elements in said sub-region, said identifier corresponding to that message, and said timestamp corresponding to that message. 17. The computer readable medium of claim 13 further comprising providing an indication of a number of graphical elements that overlap in time in said graphical view as a function of time as indicated by said timestamps. 18. The computer readable medium of claim 17 wherein each of said list entries further comprises a message type and wherein said data processing system display a message type parallelism graph that represents a degree of parallel processes that is operative when a given message type is operative. 19. The computer readable medium of claim 18 wherein said display comprises a plurality of message type parallelism graphs. 20. The computer readable medium of claim 19 wherein said message type parallelism graphs are sorted by an indicator specifying a degree of parallelism in said messages of each type. | A method of operating a data processing system to display a plurality of list entries is disclosed. Each list entry includes a timestamp, an identifier, and a message. The method includes sorting the list entries by the identifier associated with the list entries and displaying a data flow chart on a display associated with the data processing system. The data flow chart has a plurality of rows. Each row is a graphical view of the list entries having a given identifier. Each row includes a graphical element representing each message and a row label indicating the identifier associated with that row. Each row has a time region representing a time axis on which the graphical elements are placed, each of the graphical elements being placed at a location in the time region determined by the timestamp associated with that message.1. A method of operating a data processing system to display a plurality of list entries, each list entry comprising a timestamp, an identifier, and a message, said method comprising:
causing said data processing system to group said list entries by said identifier associated with said list entries; and generating a data flow chart on a display associated with said data processing system, said data flow chart having a plurality of rows, each row being a graphical view of said list entries having a given identifier, said rows comprising graphical elements representing each message in that row, each row comprising a row label indicating said identifier associated with that row and a time region representing a time axis on which each of said graphical elements is placed, said graphical elements being placed at a location in said time region determined by said timestamp associated with that message. 2. The method of claim 1 wherein each of said list entries further comprises a duration indicating a time span associated with an action that generated said list entry, and wherein each of said graphical elements has a dimension along said time axis that is determined by said duration. 3. The method of claim 2 wherein each row having two graphical elements that overlap in time includes a plurality of sub-rows that display said graphical elements such that no two graphical elements overlap in time in any sub-row. 4. The method of claim 1 wherein each of said list entries further comprises a message type and wherein each of said graphical elements comprises a label that indicates said message type associated with said list entry corresponding to that graphical element. 5. The method of claim 1 further comprising:
receiving user information indicating a sub-region of said data flow chart and display; and
displaying said message corresponding to each graphical element in said sub-region. 6. The method of claim 5 wherein said displaying said message comprises generating a table of said list entries corresponding to graphical elements within said sub-region, said table including said message for each of said graphical elements in said sub-region, said identifier corresponding to that message, and said timestamp corresponding to that message. 7. The method of claim 2 further comprising providing an indication of a number of graphical elements that overlap in time in said graphical view as a function of time as indicated by said timestamps. 8. The method of claim 7 wherein each of said list entries further comprises a message type and wherein said data processing system displays a message type parallelism graph that represents a degree of parallel processes that is operative when a given message type is operative. 9. The method of claim 8 wherein said display comprises a plurality of message type parallelism graphs. 10. The method of claim 9 wherein said message type parallelism graphs are sorted on said display based on a total time messages of each type were active. 11. The method of claim 9 wherein said message type parallelism graphs are sorted by an indicator specifying a degree of parallelism in said messages of each type. 12. A computer readable medium comprising instructions that cause a data processing system to execute a method for operating a display that is part of said data processing system to display a plurality of list entries, each list entry comprising a timestamp, an identifier, and a message, said method comprising:
causing said data processing system to group said list entries by said identifier associated with said list entries; and generating a data flow chart on a display associated with said data processing system, said data flow chart having a plurality of rows, each row being a graphical view of said list entries having a given identifier, said rows comprising graphical elements representing each message on that row, each row comprising a row label indicating said identifier associated with that row and a time region representing a time axis on which said graphical elements are placed, each of said graphical elements being placed at a location in said time region determined by said timestamp associated with that message. 13. The computer readable medium of claim 12 wherein each of said list entries further comprises a duration indicating a time span associated with an action that generated said list entry, and wherein each of said graphical elements has a dimension along said time axis that is determined by said duration. 14. The computer readable medium of claim 12 wherein each of said list entries further comprises a message type and wherein each of said graphical elements comprises a label that indicates said message type associated with said list entry corresponding to that graphical element. 15. The computer readable medium of claim 12 wherein said method further comprises:
receiving user information indicating a sub-region of said data flow chart and display; and
displaying said message corresponding to each graphical element in said sub-region. 16. The computer readable medium of claim 15 wherein said displaying said message comprises generating a table of said list entries corresponding to graphical elements within said sub-region, said table including said message for each of said graphical elements in said sub-region, said identifier corresponding to that message, and said timestamp corresponding to that message. 17. The computer readable medium of claim 13 further comprising providing an indication of a number of graphical elements that overlap in time in said graphical view as a function of time as indicated by said timestamps. 18. The computer readable medium of claim 17 wherein each of said list entries further comprises a message type and wherein said data processing system display a message type parallelism graph that represents a degree of parallel processes that is operative when a given message type is operative. 19. The computer readable medium of claim 18 wherein said display comprises a plurality of message type parallelism graphs. 20. The computer readable medium of claim 19 wherein said message type parallelism graphs are sorted by an indicator specifying a degree of parallelism in said messages of each type. | 2,100 |
5,004 | 15,014,576 | 2,182 | A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence. | 1. A method for solving the Lagrangian dual of a constrained binary quadratic programming problem, the method comprising:
use of a processor for obtaining a constrained quadratic binary programming problem; until a convergence is detected, use of a processor for iteratively:
performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem;
providing the unconstrained quadratic binary programming problem to a quantum annealer;
obtaining from the quantum annealer at least one corresponding solution;
using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound;
use of a processor for providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after the convergence. 2. The method as claimed in claim 1, wherein the use of a processor for obtaining of a constrained quadratic binary programming problem comprises:
use of a processor for obtaining data representative of an objective function ƒ(x) having a degree less than or equal to two; use of a processor for obtaining data representative of equality constraints having a degree less than or equal to two; and use of a processor for obtaining data representative of inequality constraints having a degree less than or equal to two. 3. The method as claimed in claim 1, wherein the use of a processor for obtaining the constrained quadratic binary programming problem comprises use of a processor for obtaining the constrained quadratic binary programming problem from at least one of a user, a computer, a software package and an intelligent agent. 4. The method as claimed in claim 1, wherein the use of a processor for obtaining of the constrained quadratic binary programming problem further comprises use of a processor for initializing software parameters and use of a processor for initializing a linear programming procedure. 5. The method as claimed in claim 4, wherein the software parameters are obtained by the processor from at least one of a user, a computer, a software package and an intelligent agent. 6. The method as claimed in claim 4, wherein the use of a processor for initializing of the software parameters comprises:
use of a processor for providing an embedding of the constrained quadratic binary programming problem on the quantum annealer; use of a processor for providing an embedding solver function for providing a list of solutions; use of a processor for providing one of lower and upper bounds and default values for Lagrange multipliers; use of a processor for providing one of initial values and default values for Lagrange multipliers; and use of a processor for providing an error tolerance value for duality gap. 7. The method as claimed in claim 4, wherein the linear programming procedure is carried out until the convergence is detected. 8. The method as claimed in claim 7, wherein the using of the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound comprises using the at least one corresponding solution in the linear programming procedure. 9. The method as claimed in claim 1, wherein the use of a processor for providing of a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem comprises storing the corresponding solution to a file. 10. A digital computer comprising:
a central processing unit; a display device; a communication port for operatively connecting the digital computer to a quantum annealer; a memory unit comprising an application for solving the Lagrangian dual of a constrained binary quadratic problem, the application comprising:
instructions for obtaining a constrained binary quadratic problem;
instructions for iteratively performing a Lagrangian relaxation of the constrained quadratic problem to provide an unconstrained quadratic programming problem;
instructions for providing the unconstrained quadratic programming problem to the quantum annealer using the communication port;
instructions for obtaining from the quantum annealer via the communication port at least one corresponding solution and for using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound;
instructions for providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem once a convergence is detected; and
a data bus for interconnecting the central processing unit, the display device, the communication port and the memory unit. 11. A non-transitory computer-readable storage medium for storing computer-executable instructions which, when executed, cause a digital computer to perform a method for solving the Lagrangian dual of a constrained binary quadratic programming problem, the method comprising obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively: performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem; providing the unconstrained quadratic binary programming problem to a quantum annealer; obtaining from the quantum annealer at least one corresponding solution; using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem causing the convergence. 12. Use of the method claimed in claim 1 for solving a maximum weighted k-clique problem. | A method is disclosed for solving the Lagrangian dual of a constrained binary quadratic programming problem. The method comprises obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively, performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem, providing the unconstrained quadratic binary programming problem to a quantum annealer, obtaining from the quantum annealer at least one corresponding solution, using the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound; and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after convergence.1. A method for solving the Lagrangian dual of a constrained binary quadratic programming problem, the method comprising:
use of a processor for obtaining a constrained quadratic binary programming problem; until a convergence is detected, use of a processor for iteratively:
performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem;
providing the unconstrained quadratic binary programming problem to a quantum annealer;
obtaining from the quantum annealer at least one corresponding solution;
using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound;
use of a processor for providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem after the convergence. 2. The method as claimed in claim 1, wherein the use of a processor for obtaining of a constrained quadratic binary programming problem comprises:
use of a processor for obtaining data representative of an objective function ƒ(x) having a degree less than or equal to two; use of a processor for obtaining data representative of equality constraints having a degree less than or equal to two; and use of a processor for obtaining data representative of inequality constraints having a degree less than or equal to two. 3. The method as claimed in claim 1, wherein the use of a processor for obtaining the constrained quadratic binary programming problem comprises use of a processor for obtaining the constrained quadratic binary programming problem from at least one of a user, a computer, a software package and an intelligent agent. 4. The method as claimed in claim 1, wherein the use of a processor for obtaining of the constrained quadratic binary programming problem further comprises use of a processor for initializing software parameters and use of a processor for initializing a linear programming procedure. 5. The method as claimed in claim 4, wherein the software parameters are obtained by the processor from at least one of a user, a computer, a software package and an intelligent agent. 6. The method as claimed in claim 4, wherein the use of a processor for initializing of the software parameters comprises:
use of a processor for providing an embedding of the constrained quadratic binary programming problem on the quantum annealer; use of a processor for providing an embedding solver function for providing a list of solutions; use of a processor for providing one of lower and upper bounds and default values for Lagrange multipliers; use of a processor for providing one of initial values and default values for Lagrange multipliers; and use of a processor for providing an error tolerance value for duality gap. 7. The method as claimed in claim 4, wherein the linear programming procedure is carried out until the convergence is detected. 8. The method as claimed in claim 7, wherein the using of the at least one corresponding solution to generate a new approximation for the Lagrangian dual bound comprises using the at least one corresponding solution in the linear programming procedure. 9. The method as claimed in claim 1, wherein the use of a processor for providing of a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem comprises storing the corresponding solution to a file. 10. A digital computer comprising:
a central processing unit; a display device; a communication port for operatively connecting the digital computer to a quantum annealer; a memory unit comprising an application for solving the Lagrangian dual of a constrained binary quadratic problem, the application comprising:
instructions for obtaining a constrained binary quadratic problem;
instructions for iteratively performing a Lagrangian relaxation of the constrained quadratic problem to provide an unconstrained quadratic programming problem;
instructions for providing the unconstrained quadratic programming problem to the quantum annealer using the communication port;
instructions for obtaining from the quantum annealer via the communication port at least one corresponding solution and for using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound;
instructions for providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem once a convergence is detected; and
a data bus for interconnecting the central processing unit, the display device, the communication port and the memory unit. 11. A non-transitory computer-readable storage medium for storing computer-executable instructions which, when executed, cause a digital computer to perform a method for solving the Lagrangian dual of a constrained binary quadratic programming problem, the method comprising obtaining a constrained quadratic binary programming problem; until a convergence is detected, iteratively: performing a Lagrangian relaxation of the constrained quadratic binary programming problem to provide an unconstrained quadratic binary programming problem; providing the unconstrained quadratic binary programming problem to a quantum annealer; obtaining from the quantum annealer at least one corresponding solution; using the at least one corresponding solution to generate a new approximation for a Lagrangian dual bound and providing a corresponding solution to the Lagrangian dual of the constrained binary quadratic programming problem causing the convergence. 12. Use of the method claimed in claim 1 for solving a maximum weighted k-clique problem. | 2,100 |
5,005 | 14,851,816 | 2,118 | A vehicle system includes a processor programmed to synchronize a vehicle setting based on a home setting received from a home network. The processor is in communication with the home network via a transceiver. The processor is programmed to establish communication with the home network based on a vehicle start request, receive the home system setting from the home network if a vehicle location is less than a predefined distance, and synchronize one or more vehicle settings based on the home system setting. | 1. A vehicle system comprising:
a vehicle processor configured with a transceiver and programmed to, in response to a vehicle start request, establish communication with a home network via the transceiver; if a vehicle location is less than a predefined distance, receive a home system setting from the home network; and synchronize one or more vehicle settings based on the home system setting. 2. The vehicle system of claim 1, wherein the vehicle processor is further programmed to synchronize a radio setting as being the one or more vehicle settings to a radio station based on the home system setting being a television channel associated with the radio station. 3. The vehicle system of claim 2, wherein the vehicle processor is further programmed to synchronize a heating and air conditioning setting as being the one or more vehicle settings to a temperature value based on the home system setting being a house temperature setting. 4. The vehicle system of claim 1, wherein the predefined distance is a range value associated with a distance between a home location having the home network to the vehicle location. 5. The vehicle system of claim 1, wherein the home system setting is at least one of climate settings, music selection, television selection, light adjustment, and appliance notification. 6. The vehicle system of claim 5, wherein the appliance notification is a grocery reminder from a smart refrigerator. 7. The vehicle system of claim 6, wherein the processor is further programmed to output a grocery notification via a vehicle display as being the one or more vehicle settings based on the grocery reminder. 8. The vehicle system of claim 1, wherein the home network is configured to communicate with one or more appliance sensors and systems. 9. The vehicle system of claim 8, wherein the one or more appliance sensors and systems is at least one of a refrigerator, thermostat, television, stove, light, and radio. 10. The vehicle system of claim 1, wherein the processor is further programmed to generate one or more messages for the home network based on vehicle data. 11. The vehicle system of claim 10, wherein the processor is further programmed to transmit the vehicle data to the home network based on the predefined distance. 12. The vehicle system of claim 11, wherein the vehicle data is a home arrival notification. 13. The vehicle system of claim 11, wherein the vehicle data is at least one of a radio setting, climate setting, vehicle location and light setting. 14. A home network synchronization method comprising:
comparing a vehicle location to a predefined home distance based on a vehicle start request; in response to the vehicle location being within the predefined home distance, receiving current settings associated with one or more home devices via a home network; and synchronizing, via a vehicle processor, one or more infotainment settings based on the current settings of the one or more home devices. 15. The method of claim 14, further comprising synchronizing the one or more infotainment settings to a radio station based on the received current settings being a radio broadcast channel. 16. The method of claim 14, further comprising synchronizing a navigation system as being the one or more infotainment settings based on the received current settings being an errand list having a task associated with an address and outputting a route at a vehicle display based on the address via the navigation system. 17. The method of claim 16, wherein the errand list is generated at the home network based on received input from at least one sensor and system at the one or more home devices. 18. A computer-program product embodied in a non-transitory computer readable medium having stored instructions for programming a processor, comprising instructions for:
in response to communication with a vehicle processor, receiving a vehicle setting; generating a configuration message for a home system based on the vehicle setting; transmitting the configuration message to the home system; and in response to synchronization of the home system based on the configuration message, transmitting a confirmation message to the vehicle processor. 19. The computer-program product of claim 18, wherein the non-transitory computer readable medium further comprises instructions for:
synchronizing the home system to a climate setting based on the vehicle setting being a temperature value associated with the climate setting. 20. The computer program product of claim 18, wherein the confirmation message is configured to output at a vehicle display verifying that the configuration message was received by the home system. | A vehicle system includes a processor programmed to synchronize a vehicle setting based on a home setting received from a home network. The processor is in communication with the home network via a transceiver. The processor is programmed to establish communication with the home network based on a vehicle start request, receive the home system setting from the home network if a vehicle location is less than a predefined distance, and synchronize one or more vehicle settings based on the home system setting.1. A vehicle system comprising:
a vehicle processor configured with a transceiver and programmed to, in response to a vehicle start request, establish communication with a home network via the transceiver; if a vehicle location is less than a predefined distance, receive a home system setting from the home network; and synchronize one or more vehicle settings based on the home system setting. 2. The vehicle system of claim 1, wherein the vehicle processor is further programmed to synchronize a radio setting as being the one or more vehicle settings to a radio station based on the home system setting being a television channel associated with the radio station. 3. The vehicle system of claim 2, wherein the vehicle processor is further programmed to synchronize a heating and air conditioning setting as being the one or more vehicle settings to a temperature value based on the home system setting being a house temperature setting. 4. The vehicle system of claim 1, wherein the predefined distance is a range value associated with a distance between a home location having the home network to the vehicle location. 5. The vehicle system of claim 1, wherein the home system setting is at least one of climate settings, music selection, television selection, light adjustment, and appliance notification. 6. The vehicle system of claim 5, wherein the appliance notification is a grocery reminder from a smart refrigerator. 7. The vehicle system of claim 6, wherein the processor is further programmed to output a grocery notification via a vehicle display as being the one or more vehicle settings based on the grocery reminder. 8. The vehicle system of claim 1, wherein the home network is configured to communicate with one or more appliance sensors and systems. 9. The vehicle system of claim 8, wherein the one or more appliance sensors and systems is at least one of a refrigerator, thermostat, television, stove, light, and radio. 10. The vehicle system of claim 1, wherein the processor is further programmed to generate one or more messages for the home network based on vehicle data. 11. The vehicle system of claim 10, wherein the processor is further programmed to transmit the vehicle data to the home network based on the predefined distance. 12. The vehicle system of claim 11, wherein the vehicle data is a home arrival notification. 13. The vehicle system of claim 11, wherein the vehicle data is at least one of a radio setting, climate setting, vehicle location and light setting. 14. A home network synchronization method comprising:
comparing a vehicle location to a predefined home distance based on a vehicle start request; in response to the vehicle location being within the predefined home distance, receiving current settings associated with one or more home devices via a home network; and synchronizing, via a vehicle processor, one or more infotainment settings based on the current settings of the one or more home devices. 15. The method of claim 14, further comprising synchronizing the one or more infotainment settings to a radio station based on the received current settings being a radio broadcast channel. 16. The method of claim 14, further comprising synchronizing a navigation system as being the one or more infotainment settings based on the received current settings being an errand list having a task associated with an address and outputting a route at a vehicle display based on the address via the navigation system. 17. The method of claim 16, wherein the errand list is generated at the home network based on received input from at least one sensor and system at the one or more home devices. 18. A computer-program product embodied in a non-transitory computer readable medium having stored instructions for programming a processor, comprising instructions for:
in response to communication with a vehicle processor, receiving a vehicle setting; generating a configuration message for a home system based on the vehicle setting; transmitting the configuration message to the home system; and in response to synchronization of the home system based on the configuration message, transmitting a confirmation message to the vehicle processor. 19. The computer-program product of claim 18, wherein the non-transitory computer readable medium further comprises instructions for:
synchronizing the home system to a climate setting based on the vehicle setting being a temperature value associated with the climate setting. 20. The computer program product of claim 18, wherein the confirmation message is configured to output at a vehicle display verifying that the configuration message was received by the home system. | 2,100 |
5,006 | 14,082,937 | 2,173 | In one embodiment, a method includes receiving, by a client computing device, an input associated with a user interface of an application. The user interface may include multiple elements. The client computing device may transition from a first state of the application to a second state of the application based on the input. The client computing device may then determine one or more listeners associated with the application that are registered to receive information when the second state of the application is entered. The client computing device may provide information associated with the second state of the application to one or more of the listeners, and the listeners may implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. | 1. A method comprising:
by a client computing device, receiving an input associated with a user interface of an application, the user interface comprising a plurality of elements; by the client computing device, transitioning from a first state of the application to a second state of the application based on the input; by the client computing device, determining one or more listeners associated with the application and registered to receive information when the second state of the application is entered; by the client computing device, providing information associated with the second state of the application to one or more of the listeners; by the registered listeners of the client computing device, implementing one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 2. The method of claim 1, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 3. The method of claim 2, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 4. The method of claim 1, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 5. The method of claim 1, wherein the input comprises a user gesture. 6. The method of claim 1, wherein the input comprises a notification received from a social-networking system. 7. The method of claim 1, wherein the input comprises information associated with a state of the client computing device. 8. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive an input associated with a user interface of an application, the user interface comprising a plurality of elements; transition from a first state of the application to a second state of the application based on the input; determine one or more listeners associated with the application and registered to receive information when the second state of the application is entered; provide information associated with the second state of the application to one or more of the listeners; implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 9. The media of claim 8, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 10. The media of claim 9, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 11. The media of claim 8, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 12. The media of claim 8, wherein the input comprises a user gesture. 13. The media of claim 8, wherein the input comprises a notification received from a social-networking system. 14. The media of claim 8, wherein the input comprises information associated with a state of a client computing device. 15. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
receive an input associated with a user interface of an application, the user interface comprising a plurality of elements;
transition from a first state of the application to a second state of the application based on the input;
determine one or more listeners associated with the application and registered to receive information when the second state of the application is entered;
provide information associated with the second state of the application to one or more of the listeners;
implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 16. The system of claim 15, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 17. The system of claim 16, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 18. The system of claim 15, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 19. The system of claim 15, wherein the input comprises a user gesture. 20. The system of claim 15, wherein the input comprises a notification received from a social-networking system. | In one embodiment, a method includes receiving, by a client computing device, an input associated with a user interface of an application. The user interface may include multiple elements. The client computing device may transition from a first state of the application to a second state of the application based on the input. The client computing device may then determine one or more listeners associated with the application that are registered to receive information when the second state of the application is entered. The client computing device may provide information associated with the second state of the application to one or more of the listeners, and the listeners may implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application.1. A method comprising:
by a client computing device, receiving an input associated with a user interface of an application, the user interface comprising a plurality of elements; by the client computing device, transitioning from a first state of the application to a second state of the application based on the input; by the client computing device, determining one or more listeners associated with the application and registered to receive information when the second state of the application is entered; by the client computing device, providing information associated with the second state of the application to one or more of the listeners; by the registered listeners of the client computing device, implementing one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 2. The method of claim 1, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 3. The method of claim 2, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 4. The method of claim 1, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 5. The method of claim 1, wherein the input comprises a user gesture. 6. The method of claim 1, wherein the input comprises a notification received from a social-networking system. 7. The method of claim 1, wherein the input comprises information associated with a state of the client computing device. 8. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive an input associated with a user interface of an application, the user interface comprising a plurality of elements; transition from a first state of the application to a second state of the application based on the input; determine one or more listeners associated with the application and registered to receive information when the second state of the application is entered; provide information associated with the second state of the application to one or more of the listeners; implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 9. The media of claim 8, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 10. The media of claim 9, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 11. The media of claim 8, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 12. The media of claim 8, wherein the input comprises a user gesture. 13. The media of claim 8, wherein the input comprises a notification received from a social-networking system. 14. The media of claim 8, wherein the input comprises information associated with a state of a client computing device. 15. A system comprising:
one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
receive an input associated with a user interface of an application, the user interface comprising a plurality of elements;
transition from a first state of the application to a second state of the application based on the input;
determine one or more listeners associated with the application and registered to receive information when the second state of the application is entered;
provide information associated with the second state of the application to one or more of the listeners;
implement one or more changes to one or more elements of the user interface in response to the transition to the second state of the application. 16. The system of claim 15, wherein implementing one or more changes to one or more elements of the user interface comprises one or more of the following:
providing information associated with the second state of the application to a physics animation system; providing information associated with the second state of the application to a time-based animation system; or providing information associated with the second state of the application to a component of the application. 17. The system of claim 16, wherein the physics animation engine is operable to use a spring model to model changes in one or more of the following properties of one or more elements of the user interface:
scale; position; transparency; or dimension. 18. The system of claim 15, wherein the elements comprise one or more of the following:
an application launcher; a chat interface; a message interface; an interactive element associated with a user of a social-networking system; or an interactive element associated with content of a social-networking system. 19. The system of claim 15, wherein the input comprises a user gesture. 20. The system of claim 15, wherein the input comprises a notification received from a social-networking system. | 2,100 |
5,007 | 14,202,657 | 2,161 | A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items. | 1. A method for personalizing reviews for a user on a social network, comprising the steps of:
receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items. 2. The method of claim 1, wherein one of the one or more social degrees includes all first order connections. 3. The method of claim 2, wherein one of the one or more social degrees includes all first order connections, wherein the first order connections users of the social network that the user is following. 4. The method of claim 2, wherein one of the one or more social degrees includes all first order connections, wherein the first order connections include users of the social network that the user has accepted as a friend in the social network. 5. The method of claim 1, wherein one of the one or more social degrees includes all second order connections, wherein the second order connections include user of the social network accepted as friends by the users of the social network that the user has accepted as a friend in the social network. 6. The method of claim 1, wherein one of the one or more social degrees includes all users of the social network. 7. The method of claim 1, wherein the one of the one or more social degrees includes the subset of all users who exceed a threshold similarity to the user, wherein the threshold similarity is determined based on the ratings and recommendations of the user and the ratings and recommendations of each of the all users. 8. The method of claim 1, wherein the request from a user to view the ratings and recommendations for a reviewable item includes a designation of at least one or more social degrees, and wherein the step of displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees includes displaying the combined rating and combined recommendation for all users of the social network at the designated one or more social degrees. | A method for personalizing reviews for a user on a social network, comprising the steps of: receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items.1. A method for personalizing reviews for a user on a social network, comprising the steps of:
receiving from at least two or more users a rating and a recommendation for a reviewable item, wherein the rating is numerical value in a rating scale, and wherein a recommendation is a binary endorsement; receiving a request from a user to view the ratings and recommendations for one or more reviewable items; determining a combined rating and an combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items; and displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees for the one or more reviewable items. 2. The method of claim 1, wherein one of the one or more social degrees includes all first order connections. 3. The method of claim 2, wherein one of the one or more social degrees includes all first order connections, wherein the first order connections users of the social network that the user is following. 4. The method of claim 2, wherein one of the one or more social degrees includes all first order connections, wherein the first order connections include users of the social network that the user has accepted as a friend in the social network. 5. The method of claim 1, wherein one of the one or more social degrees includes all second order connections, wherein the second order connections include user of the social network accepted as friends by the users of the social network that the user has accepted as a friend in the social network. 6. The method of claim 1, wherein one of the one or more social degrees includes all users of the social network. 7. The method of claim 1, wherein the one of the one or more social degrees includes the subset of all users who exceed a threshold similarity to the user, wherein the threshold similarity is determined based on the ratings and recommendations of the user and the ratings and recommendations of each of the all users. 8. The method of claim 1, wherein the request from a user to view the ratings and recommendations for a reviewable item includes a designation of at least one or more social degrees, and wherein the step of displaying, by a user interface, the combined rating and combined recommendation for all users of the social network at one or more social degrees includes displaying the combined rating and combined recommendation for all users of the social network at the designated one or more social degrees. | 2,100 |
5,008 | 14,166,581 | 2,128 | A simulation device capable of executing a proper simulation without changing a program, while the definition of virtual peripheral equipment and/or a PLC is not necessary. A signal status setting file, which is separated from a robot program, can be executed in parallel with the program, and includes a command for setting or changing a signal status described corresponding to a line in execution of the program, wherein the status is referenced by executing the line of the program. For example, a command of the file, described corresponding to a fifth line of the robot program, commands inputting a signal which indicates that the opening motion of a door is completed. Therefore, when the simulation is executed, in synchronization with the line in execution of the program, the setting or changing of the signal status, described corresponding to the line in execution, is performed. | 1. A simulation device for performing a simulation of a robot based on a robot program,
wherein the simulation device further uses a separate file which is different from the robot program, wherein the separate program includes a command for setting a status of a signal or a command for setting a value of a data register, the command being described corresponding to a line of the robot program, the status and the value being referenced by executing the line of the robot program, and wherein the status of the signal or the value of the data register described corresponding to the line in execution of the robot program is changed in synchronization with the line in execution of the robot program, when the simulation is performed based on the command. 2. The simulation device as set forth in claim 1, wherein the command for setting a status of a signal specifies at least a name of the signal and a signal state to be set, and the command for setting a value of a data register specifies at least a name of the data register and a value to be set. 3. The simulation device as set forth in claim 1, wherein the robot program includes a logic command which references the status of the signal and/or the value of the data register, and a line of the robot program corresponding to the logic command is automatically specified displayed. 4. The simulation device as set forth in claim 1, wherein the command includes a specification of a delay time, and the status of the signal or the value of the data register is set to a status or a value to be set after the delay time has passed from when the corresponding line of the program is executed. 5. The simulation device as set forth in claim 1, wherein the status of the signal, the value of the data register, or a position of the robot is specified at the beginning of the simulation, such that an initial setting of the status of the signal, the value of the data register, or the position of the robot is changed. 6. The simulation device as set forth in claim 1, wherein the status of the signal or the value of the data register in a specified line of the program is changed to a specified status or value. | A simulation device capable of executing a proper simulation without changing a program, while the definition of virtual peripheral equipment and/or a PLC is not necessary. A signal status setting file, which is separated from a robot program, can be executed in parallel with the program, and includes a command for setting or changing a signal status described corresponding to a line in execution of the program, wherein the status is referenced by executing the line of the program. For example, a command of the file, described corresponding to a fifth line of the robot program, commands inputting a signal which indicates that the opening motion of a door is completed. Therefore, when the simulation is executed, in synchronization with the line in execution of the program, the setting or changing of the signal status, described corresponding to the line in execution, is performed.1. A simulation device for performing a simulation of a robot based on a robot program,
wherein the simulation device further uses a separate file which is different from the robot program, wherein the separate program includes a command for setting a status of a signal or a command for setting a value of a data register, the command being described corresponding to a line of the robot program, the status and the value being referenced by executing the line of the robot program, and wherein the status of the signal or the value of the data register described corresponding to the line in execution of the robot program is changed in synchronization with the line in execution of the robot program, when the simulation is performed based on the command. 2. The simulation device as set forth in claim 1, wherein the command for setting a status of a signal specifies at least a name of the signal and a signal state to be set, and the command for setting a value of a data register specifies at least a name of the data register and a value to be set. 3. The simulation device as set forth in claim 1, wherein the robot program includes a logic command which references the status of the signal and/or the value of the data register, and a line of the robot program corresponding to the logic command is automatically specified displayed. 4. The simulation device as set forth in claim 1, wherein the command includes a specification of a delay time, and the status of the signal or the value of the data register is set to a status or a value to be set after the delay time has passed from when the corresponding line of the program is executed. 5. The simulation device as set forth in claim 1, wherein the status of the signal, the value of the data register, or a position of the robot is specified at the beginning of the simulation, such that an initial setting of the status of the signal, the value of the data register, or the position of the robot is changed. 6. The simulation device as set forth in claim 1, wherein the status of the signal or the value of the data register in a specified line of the program is changed to a specified status or value. | 2,100 |
5,009 | 14,499,297 | 2,124 | Various embodiments are described that relate to an adaptive learning system. The adaptive learning system can be trained by correlation between a first set of raw technical performance data and a set of actual operational effectiveness assessment data. Once trained, the adaptive learning system can be deployed. Once deployed, the adaptive learning system can produce a set of predicted operational effectiveness assessment data from a second set of raw technical performance data that is different from the first set of raw technical performance data. | 1. A method, comprising:
obtaining a set of raw technical performance data; and predicting, by way of a learning system, a set of predicted operational assessment data based, at least in part, on the set of raw technical performance data, where the learning system is trained from a set of training technical performance data and a set of training operational assessment data. 2. The method of claim 1,
where the set of training technical performance data is technical performance data from an initial duration of a test and evaluation event and where the set of technical performance data is technical performance data from a remaining duration of the test and evaluation event. 3. The method of claim 1, where the set of predicted operational assessment data is a prediction of operational score of individual services. 4. The method of claim 1, where the learning system is an adaptive deep learning system. 5. The method of claim 1, where the set of training operational assessment data is human produced. 6. The method of claim 1, where the set of training operational assessment data is produced from mathematical calculation. 7. The method of claim 1,
where the learning system is trained prior to predicting the set of predicted operational assessment data and where the learning system is validated after being trained and prior to predicting the set of predicted operational assessment data. 8. The method of claim 1,
where the set of training technical performance data is of a first classification and of a second classification and where the set of raw technical performance data is of the first classification and not of the second classification. 9. A computer-implemented method, comprising:
accessing a set of raw technical performance data; accessing a set of actual operational effectiveness data; training an adaptive learning system based on a relationship between at least part of the set of raw technical performance data and the set of actual operational effectiveness data. 10. The computer-implemented method of claim 9, comprising:
validating the adaptive learning system after the adaptive learning system is trained; and deploying the adaptive learning system after successful validation of the adaptive learning system. 11. The computer-implemented method of claim 10, comprising:
dividing the set of raw technical performance data into a first raw part and the second raw part, where training the adaptive learning system based on the relationship between at least part of the set of raw technical performance data and the set of actual operational effectiveness data comprises training the adaptive learning system based on a relationship between the first raw part and the set of actual operational effectiveness data and where validating the adaptive learning system comprises testing the adaptive learning system through observation of a predicted operation effectiveness by use of the second raw part. 12. The computer-implemented method of claim 9, where the adaptive learning system is a deep learning system that employs at least five layers. 13. The computer-implemented method of claim 12, comprising:
deploying the adaptive learning system once trained; and further training the adaptive learning system while the adaptive learning system is deployed. 14. The computer-implemented method of claim 13, comprising:
collecting a set of actual technical performance data; and making an actual operation effectiveness prediction through use of the set of actual technical performance data by way of the adaptive learning system while the adaptive learning system is deployed. 15. The computer-implemented method of claim 14,
where the set of raw technical performance data is from an initial duration of a test and evaluation event and where the set of actual technical performance data is from a remaining duration of the test and evaluation event. 16. The computer-implemented method of claim 9, where the set of raw technical performance data is human produced. 17. The computer-implemented method of claim 16, where the set of actual operational effectiveness data produced from mathematical calculation. 18. The computer-implemented method of claim 9, where the set of actual operational effectiveness data is derived, at least in part, from the set of raw technical performance data. 19. A method, comprising:
predicting a first operational score for a first individual service by way of a first service adaptive learning system; predicting a second operational score for a second individual service by way of a second service adaptive learning system that is distinct from the first service adaptive learning system; and predicting an overall operational effectiveness though use of an operational adaptive learning system, where the overall operational effectiveness is based, at least in part, on the first operational score and the second operational score. 20. The method of claim 19, where the first individual service and the second individual service are on the same hierarchical level. | Various embodiments are described that relate to an adaptive learning system. The adaptive learning system can be trained by correlation between a first set of raw technical performance data and a set of actual operational effectiveness assessment data. Once trained, the adaptive learning system can be deployed. Once deployed, the adaptive learning system can produce a set of predicted operational effectiveness assessment data from a second set of raw technical performance data that is different from the first set of raw technical performance data.1. A method, comprising:
obtaining a set of raw technical performance data; and predicting, by way of a learning system, a set of predicted operational assessment data based, at least in part, on the set of raw technical performance data, where the learning system is trained from a set of training technical performance data and a set of training operational assessment data. 2. The method of claim 1,
where the set of training technical performance data is technical performance data from an initial duration of a test and evaluation event and where the set of technical performance data is technical performance data from a remaining duration of the test and evaluation event. 3. The method of claim 1, where the set of predicted operational assessment data is a prediction of operational score of individual services. 4. The method of claim 1, where the learning system is an adaptive deep learning system. 5. The method of claim 1, where the set of training operational assessment data is human produced. 6. The method of claim 1, where the set of training operational assessment data is produced from mathematical calculation. 7. The method of claim 1,
where the learning system is trained prior to predicting the set of predicted operational assessment data and where the learning system is validated after being trained and prior to predicting the set of predicted operational assessment data. 8. The method of claim 1,
where the set of training technical performance data is of a first classification and of a second classification and where the set of raw technical performance data is of the first classification and not of the second classification. 9. A computer-implemented method, comprising:
accessing a set of raw technical performance data; accessing a set of actual operational effectiveness data; training an adaptive learning system based on a relationship between at least part of the set of raw technical performance data and the set of actual operational effectiveness data. 10. The computer-implemented method of claim 9, comprising:
validating the adaptive learning system after the adaptive learning system is trained; and deploying the adaptive learning system after successful validation of the adaptive learning system. 11. The computer-implemented method of claim 10, comprising:
dividing the set of raw technical performance data into a first raw part and the second raw part, where training the adaptive learning system based on the relationship between at least part of the set of raw technical performance data and the set of actual operational effectiveness data comprises training the adaptive learning system based on a relationship between the first raw part and the set of actual operational effectiveness data and where validating the adaptive learning system comprises testing the adaptive learning system through observation of a predicted operation effectiveness by use of the second raw part. 12. The computer-implemented method of claim 9, where the adaptive learning system is a deep learning system that employs at least five layers. 13. The computer-implemented method of claim 12, comprising:
deploying the adaptive learning system once trained; and further training the adaptive learning system while the adaptive learning system is deployed. 14. The computer-implemented method of claim 13, comprising:
collecting a set of actual technical performance data; and making an actual operation effectiveness prediction through use of the set of actual technical performance data by way of the adaptive learning system while the adaptive learning system is deployed. 15. The computer-implemented method of claim 14,
where the set of raw technical performance data is from an initial duration of a test and evaluation event and where the set of actual technical performance data is from a remaining duration of the test and evaluation event. 16. The computer-implemented method of claim 9, where the set of raw technical performance data is human produced. 17. The computer-implemented method of claim 16, where the set of actual operational effectiveness data produced from mathematical calculation. 18. The computer-implemented method of claim 9, where the set of actual operational effectiveness data is derived, at least in part, from the set of raw technical performance data. 19. A method, comprising:
predicting a first operational score for a first individual service by way of a first service adaptive learning system; predicting a second operational score for a second individual service by way of a second service adaptive learning system that is distinct from the first service adaptive learning system; and predicting an overall operational effectiveness though use of an operational adaptive learning system, where the overall operational effectiveness is based, at least in part, on the first operational score and the second operational score. 20. The method of claim 19, where the first individual service and the second individual service are on the same hierarchical level. | 2,100 |
5,010 | 14,497,760 | 2,158 | Many content systems (e.g., social networks) present to a user a set of content items posted by other individuals. The user may selectively view content items that reinforce and are consistent with the user's perspective, creating an “echo chamber” effect. Conversely, content systems that selectively expose users to content items exhibiting contrary perspectives, and from individuals with no connection with the user, may alienate the user. Presented herein are techniques for recommending content items that present a different perspective from that of the user, and from individuals who share a similar profile to the user (e.g., alternative opinions from other individuals within the user's social circle or community). Optionally, opinions may be selected that do not directly oppose the user's perspective, but that are orthogonal with it. Such selective recommendations may persuade the user to consider contrary viewpoints that may alter the user's perspective while reducing user alienation. | 1. A method of recommending a content item to a user having a user background, comprising:
identifying a user perspective of the user about a topic; selecting, from an individual set, an individual having an individual background that is similar to the user background of the user; identifying a content item associated with the individual and presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and presenting the content item to the user. 2. The method of claim 1, wherein identifying the user perspective of the user about the topic further comprises: identifying the user perspective of the user about the topic expressed in at least one message of the user. 3. The method of claim 2, wherein:
the user is a member of a user set; and identifying the user perspective of the user expressed in the at least one message further comprises, for respective messages expressed by the members of the user set:
identifying at least one identifier in the message, and
correlating the identifier with a user perspective of the member about the topic. 4. The method of claim 1, wherein identifying the user perspective of the user further comprises:
for the respective topics associated with a user perspective of the user, ranking the topics according to a user perspective score of the user perspective about the topic; and selecting a representative user perspective subset of the user according to the user perspective scores of the user perspectives about the topic. 5. The method of claim 4, wherein selecting the representative user perspective subset of the user further comprises: excluding, from the representative user perspective subset, an excluded user perspective having a user perspective score about the topic that is above a user perspective score threshold. 6. The method of claim 1, wherein identifying the user perspective of the user about the topic further comprises: for respective topic, inferring the user perspective of the user about the topic from the user background of the user. 7. The method of claim 6, wherein:
the user is a member of a user set, where respective members are associated with a user background; and inferring the user perspective of the user about the topic further comprises:
clustering the members of the user set into at least one cluster according to the user background of the member; and
inferring the user perspective of the members of the cluster about the topic. 8. A nontransitory memory device storing instructions that, when executed on a processor of a server, cause the server to recommend a content item to a user having a user background, by:
identifying a user perspective of the user about a topic; selecting, from an individual set, an individual having an individual background that is similar to the user background of the user; identifying a content item associated with the individual and presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and presenting the content item to the user. 9. The nontransitory memory device of claim 8, wherein selecting the individual from the individual set further comprises: selecting the individual according to a network distance of the individual and the user within the individual set. 10. The nontransitory memory device of claim 8, wherein identifying the content item further comprises:
for respective content items, calculating a perspective difference score between the individual perspective of the content item and the user perspective of the user about the topic; and selecting a content item having a perspective difference score within a perspective difference score range. 11. The nontransitory memory device of claim 8, wherein identifying the content item further comprises: identifying a content item that has an individual perspective about the topic that differs from the user perspective of the user about the topic and that does not oppose the user perspective of the user about the topic. 12. The nontransitory memory device of claim 8, wherein:
identifying the content item further comprises: upon receiving from a first user at least one user rating of the content item, store the user rating of the content item; and identifying the content item further comprises: identifying a content item according to the at least one user rating of the content item. 13. A server that recommends a content item to a user having a user background, the server comprising:
a processor; and a memory storing instructions that, when executed on the processor, present:
a user perspective determiner that identifies a user perspective of the user about a topic;
a content item recommender that:
selects, from an individual set, an individual having an individual background that is similar to the user background of the user; and
identifies a content item associated with the individual presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and
a content item presenter that presents the content item to the user. 14. The server of claim 13, wherein:
the content item recommender identifies the content item by, upon receiving from the user a selection of a selected topic, identifying at least two selected content items about the selected topic, including the content item of the individual that presents an individual perspective about the selected topic that differs from the user perspective of the user about the topic; and presenting the content item to the user further comprises: presenting the selected content items to the user in relation to the selected topic. 15. The server of claim 14, wherein:
the user is associated with a diversity score; and the content item recommender identifies the content item by:
for the respective selected content items, calculating a perspective difference score between the individual perspective of the selected content item and the user perspective of the user about the topic; and
identifying the at least two selected content items according to the diversity score of the user and the perspective difference scores of the selected content items. 16. The server of claim 13, wherein the content item presenter presents the selected content items by:
for at least two topics, identifying at least two selected content items of the individual from an individual perspective about the selected topic that differs from the user perspective of the user about the topic; presenting a visual cloud of the at least two selected content items. 17. The server of claim 16, wherein the content item presenter presents the visual cloud of the selected content items by:
selecting a center coordinate; and for the respective selected content items:
calculating a polar offset according to an age of the selected content item; and
presenting the selected content item at the polar offset with respect to the center coordinate. 18. The server of claim 16, wherein the content item presenter presents the selected content items by:
presenting the at least one topic peripheral to the visual cloud of the selected content items; and presenting a Bezier curve connecting at least one selected content item with the topic associated with the selected content item. 19. The server of claim 16, wherein the content item presenter presents the selected content items by:
for the respective topics, selecting a visual style; and presenting the selected content item in the visual style selected for the topic of the selected content item. 20. The server of claim 16, wherein the content item presenter presents the selected content items by:
presenting, at the polar coordinate, a preview of the selected content item; and upon receiving from the user an activation of an activated content item, present the activated content item to the user. | Many content systems (e.g., social networks) present to a user a set of content items posted by other individuals. The user may selectively view content items that reinforce and are consistent with the user's perspective, creating an “echo chamber” effect. Conversely, content systems that selectively expose users to content items exhibiting contrary perspectives, and from individuals with no connection with the user, may alienate the user. Presented herein are techniques for recommending content items that present a different perspective from that of the user, and from individuals who share a similar profile to the user (e.g., alternative opinions from other individuals within the user's social circle or community). Optionally, opinions may be selected that do not directly oppose the user's perspective, but that are orthogonal with it. Such selective recommendations may persuade the user to consider contrary viewpoints that may alter the user's perspective while reducing user alienation.1. A method of recommending a content item to a user having a user background, comprising:
identifying a user perspective of the user about a topic; selecting, from an individual set, an individual having an individual background that is similar to the user background of the user; identifying a content item associated with the individual and presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and presenting the content item to the user. 2. The method of claim 1, wherein identifying the user perspective of the user about the topic further comprises: identifying the user perspective of the user about the topic expressed in at least one message of the user. 3. The method of claim 2, wherein:
the user is a member of a user set; and identifying the user perspective of the user expressed in the at least one message further comprises, for respective messages expressed by the members of the user set:
identifying at least one identifier in the message, and
correlating the identifier with a user perspective of the member about the topic. 4. The method of claim 1, wherein identifying the user perspective of the user further comprises:
for the respective topics associated with a user perspective of the user, ranking the topics according to a user perspective score of the user perspective about the topic; and selecting a representative user perspective subset of the user according to the user perspective scores of the user perspectives about the topic. 5. The method of claim 4, wherein selecting the representative user perspective subset of the user further comprises: excluding, from the representative user perspective subset, an excluded user perspective having a user perspective score about the topic that is above a user perspective score threshold. 6. The method of claim 1, wherein identifying the user perspective of the user about the topic further comprises: for respective topic, inferring the user perspective of the user about the topic from the user background of the user. 7. The method of claim 6, wherein:
the user is a member of a user set, where respective members are associated with a user background; and inferring the user perspective of the user about the topic further comprises:
clustering the members of the user set into at least one cluster according to the user background of the member; and
inferring the user perspective of the members of the cluster about the topic. 8. A nontransitory memory device storing instructions that, when executed on a processor of a server, cause the server to recommend a content item to a user having a user background, by:
identifying a user perspective of the user about a topic; selecting, from an individual set, an individual having an individual background that is similar to the user background of the user; identifying a content item associated with the individual and presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and presenting the content item to the user. 9. The nontransitory memory device of claim 8, wherein selecting the individual from the individual set further comprises: selecting the individual according to a network distance of the individual and the user within the individual set. 10. The nontransitory memory device of claim 8, wherein identifying the content item further comprises:
for respective content items, calculating a perspective difference score between the individual perspective of the content item and the user perspective of the user about the topic; and selecting a content item having a perspective difference score within a perspective difference score range. 11. The nontransitory memory device of claim 8, wherein identifying the content item further comprises: identifying a content item that has an individual perspective about the topic that differs from the user perspective of the user about the topic and that does not oppose the user perspective of the user about the topic. 12. The nontransitory memory device of claim 8, wherein:
identifying the content item further comprises: upon receiving from a first user at least one user rating of the content item, store the user rating of the content item; and identifying the content item further comprises: identifying a content item according to the at least one user rating of the content item. 13. A server that recommends a content item to a user having a user background, the server comprising:
a processor; and a memory storing instructions that, when executed on the processor, present:
a user perspective determiner that identifies a user perspective of the user about a topic;
a content item recommender that:
selects, from an individual set, an individual having an individual background that is similar to the user background of the user; and
identifies a content item associated with the individual presenting an individual perspective about the topic that differs from the user perspective of the user about the topic; and
a content item presenter that presents the content item to the user. 14. The server of claim 13, wherein:
the content item recommender identifies the content item by, upon receiving from the user a selection of a selected topic, identifying at least two selected content items about the selected topic, including the content item of the individual that presents an individual perspective about the selected topic that differs from the user perspective of the user about the topic; and presenting the content item to the user further comprises: presenting the selected content items to the user in relation to the selected topic. 15. The server of claim 14, wherein:
the user is associated with a diversity score; and the content item recommender identifies the content item by:
for the respective selected content items, calculating a perspective difference score between the individual perspective of the selected content item and the user perspective of the user about the topic; and
identifying the at least two selected content items according to the diversity score of the user and the perspective difference scores of the selected content items. 16. The server of claim 13, wherein the content item presenter presents the selected content items by:
for at least two topics, identifying at least two selected content items of the individual from an individual perspective about the selected topic that differs from the user perspective of the user about the topic; presenting a visual cloud of the at least two selected content items. 17. The server of claim 16, wherein the content item presenter presents the visual cloud of the selected content items by:
selecting a center coordinate; and for the respective selected content items:
calculating a polar offset according to an age of the selected content item; and
presenting the selected content item at the polar offset with respect to the center coordinate. 18. The server of claim 16, wherein the content item presenter presents the selected content items by:
presenting the at least one topic peripheral to the visual cloud of the selected content items; and presenting a Bezier curve connecting at least one selected content item with the topic associated with the selected content item. 19. The server of claim 16, wherein the content item presenter presents the selected content items by:
for the respective topics, selecting a visual style; and presenting the selected content item in the visual style selected for the topic of the selected content item. 20. The server of claim 16, wherein the content item presenter presents the selected content items by:
presenting, at the polar coordinate, a preview of the selected content item; and upon receiving from the user an activation of an activated content item, present the activated content item to the user. | 2,100 |
5,011 | 14,597,174 | 2,132 | In response to receiving a request to perform a transaction with two or more memory operations on one or more tiered data structures, the memory controller: writes a start transaction record to the log stream including a transaction identifier corresponding to the transaction; and performs the two or more memory operations. For a first memory operation associated with a key, the memory controller: writes a new data object in a datastore; assigns, in a key-map, a location of the new data object to the key; maintains an old data object in the datastore whose location was previously assigned to the key; and writes an operation commit record to a log stream upon completion of the first memory operation. In accordance with a determination that the two or more memory operations are complete, the memory controller writes a transaction commit record to the log stream including the transaction identifier. | 1. A method of managing a data storage system that includes: a memory controller with one or more processors; a non-volatile memory with a datastore and a log stream; and a key-map, wherein the key-map stores datastore location information for a plurality of keys, the plurality of keys corresponding to data objects in one or more tiered data structures stored in the datastore; the method comprising:
at the memory controller operatively coupled with the non-volatile memory and the key-map: in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
writing a start transaction record to the log stream including a unique transaction identifier corresponding to the transaction; and
performing the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, writing an operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
writing a new data object in the datastore;
assigning, in the key-map, a location of the new data object in the datastore to the first key; and
maintaining an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, writing a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 2. The method of claim 1, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 3. The method of claim 2, wherein the first memory operation replaces an old value in the first tiered data structure with a new value, wherein the old value corresponds to the old data object and the new value corresponds to the new data object;
the method further comprising:
prior to writing the new data object in the datastore, allocating the first slab in the datastore for the new data object; and
wherein writing the new data object in the datastore comprises writing the new data object to the first slab in the datastore, wherein the new data object includes the new value and the first key. 4. The method of claim 3, further comprising:
prior to writing the new data object to the first slab:
locating the old data object that includes the old value in a second slab of the datastore using the key-map to map the first key to the second slab in the datastore; and
retrieving an old leaf node of the first tiered data structure that is stored at the second slab, wherein the old leaf node includes the old data object and zero or more other data objects;
wherein writing the new data object to the first slab comprises writing a first new leaf node of the first tiered data structure to the first slab, the first new leaf node includes the new data object and the zero or more other data objects in the retrieved old leaf node. 5. The method of claim 4, wherein the pointer to the location of the new data object in the datastore is a pointer to the first slab in the datastore; and
wherein the pointer to the location of the old data object in the datastore is a pointer to the second slab in the datastore. 6. The method of claim 4, wherein the old leaf node of the first tiered data structure is write-locked during the first memory operation. 7. The method of claim 2, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the method further comprising:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 8. The method of claim 7, wherein the second memory operation creates a second new value in the first tiered data structure, the second new value corresponds to the second new data object; and
the method further comprising:
prior to writing the second new data object in the datastore, allocating a third slab in the datastore for the second new data object; and
wherein writing the second new data object in the datastore comprises writing the second new data object to the third slab in the datastore, wherein the second new data object includes the second new value and the second key. 9. The method of claim 8, further comprising:
prior to writing the second new data object to the third slab:
identifying an adjacent data object corresponding to an adjacent key that is closest to the second key;
locating the adjacent data object in a fourth slab of the datastore using the key-map to map the adjacent key to the fourth slab in the datastore; and
retrieving a second old leaf node of the first tiered data structure that is stored at the fourth slab, wherein the second old leaf node includes the adjacent data object and zero or more other data objects;
wherein writing the second new data object to the third slab comprises writing a second new leaf node of the first tiered data structure to the third slab, the second new leaf node includes the second new data object, the adjacent data object, and the zero or more other data objects in the retrieved second old leaf node. 10. The method of claim 9, wherein the second memory operation causes a split of the second old leaf node in the first tiered data structure. 11. The method of claim 2, wherein a third memory operation in the set of two or more memory operations is associated with a third key, and wherein the new data object is a first new data object; and
the method further comprising:
for the third memory operation in the set of two or more memory operations:
writing a third new data object, distinct from the first new data object, in the datastore;
assigning, in the key-map, a location of the third new data object in the datastore to the third key; and
maintaining a third old data object in the datastore, wherein a location of the third old data object was previously assigned, in the key-map, to the third key;
wherein the operation commit record for the third memory operation includes the third key, the unique transaction identifier, a pointer to the location of the third new data object in the datastore, and a pointer to the location of the third old data object in the datastore. 12. The method of claim 11, wherein the third memory operation replaces a third old value in the first tiered data structure with a tombstone, the third old value corresponds to the third old data object and the tombstone corresponds to the third new data object; and
the method further comprising:
prior to writing the third new data object in the datastore, allocating a fifth slab in the datastore for the third new data object; and
wherein writing the third new data object in the datastore comprises writing the third new data object to the fifth slab in the datastore, wherein the third new data object includes the tombstone and the third key. 13. The method of claim 12, further comprising:
prior to writing the third new data object to the fifth slab:
locating the third old data object that includes the third old value in a sixth slab of the datastore using the key-map to map the third key to the sixth slab in the datastore; and
retrieving a third old leaf node of the first tiered data structure that is stored at the sixth slab, wherein the third old leaf node includes the third old data object and zero or more other data objects;
wherein writing the third new data object comprises writing a third new leaf node of the first tiered data structure to the fifth slab in the datastore, the third new leaf node includes the third new data object and the zero or more other data objects in the retrieved third old leaf node. 14. The method of claim 2, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. 15. The method of claim 14, further comprising:
at a time subsequent to writing the transaction commit record, updating the persistent key-map with records in the log stream that were stored in the log stream after the previous update of the persistent key-map. 16. The method of claim 15, further comprising:
after updating the persistent key-map, reclaiming one or more slabs in the datastore that are not referenced by keys in the persistent key-map. 17. A data storage system, comprising:
a non-volatile memory with a log stream and a datastore storing one or more tiered data structures; a volatile memory with a key-map; and a memory controller with one or more processors and memory storing one or more programs, wherein the one or more programs are configured to be executed by the one or more processors, the one or more programs including instructions for:
in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
writing a start transaction record to the log stream including a unique transaction identifier corresponding to the transaction; and
performing the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, writing a first operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
writing a new data object in the datastore;
assigning, in the key-map, a location of the new data object in the datastore to the first key; and
maintaining an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, writing a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 18. The data storage system of claim 17, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 19. The data storage system of claim 17, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the one or more programs further include instructions for:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 20. The data storage system of claim 17, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. 21. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a memory controller with one or more processors, cause the memory controller to:
in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
write a start transaction record to a log stream including a unique transaction identifier corresponding to the transaction; and
perform the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, write a first operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
write a new data object in the datastore;
assign, in the key-map, a location of the new data object in the datastore to the first key; and
maintain an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, write a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 22. The non-transitory computer readable storage medium of claim 21, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 23. The non-transitory computer readable storage medium of claim 21, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the one or more programs further include instructions for:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 24. The non-transitory computer readable storage medium of claim 21, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. | In response to receiving a request to perform a transaction with two or more memory operations on one or more tiered data structures, the memory controller: writes a start transaction record to the log stream including a transaction identifier corresponding to the transaction; and performs the two or more memory operations. For a first memory operation associated with a key, the memory controller: writes a new data object in a datastore; assigns, in a key-map, a location of the new data object to the key; maintains an old data object in the datastore whose location was previously assigned to the key; and writes an operation commit record to a log stream upon completion of the first memory operation. In accordance with a determination that the two or more memory operations are complete, the memory controller writes a transaction commit record to the log stream including the transaction identifier.1. A method of managing a data storage system that includes: a memory controller with one or more processors; a non-volatile memory with a datastore and a log stream; and a key-map, wherein the key-map stores datastore location information for a plurality of keys, the plurality of keys corresponding to data objects in one or more tiered data structures stored in the datastore; the method comprising:
at the memory controller operatively coupled with the non-volatile memory and the key-map: in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
writing a start transaction record to the log stream including a unique transaction identifier corresponding to the transaction; and
performing the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, writing an operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
writing a new data object in the datastore;
assigning, in the key-map, a location of the new data object in the datastore to the first key; and
maintaining an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, writing a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 2. The method of claim 1, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 3. The method of claim 2, wherein the first memory operation replaces an old value in the first tiered data structure with a new value, wherein the old value corresponds to the old data object and the new value corresponds to the new data object;
the method further comprising:
prior to writing the new data object in the datastore, allocating the first slab in the datastore for the new data object; and
wherein writing the new data object in the datastore comprises writing the new data object to the first slab in the datastore, wherein the new data object includes the new value and the first key. 4. The method of claim 3, further comprising:
prior to writing the new data object to the first slab:
locating the old data object that includes the old value in a second slab of the datastore using the key-map to map the first key to the second slab in the datastore; and
retrieving an old leaf node of the first tiered data structure that is stored at the second slab, wherein the old leaf node includes the old data object and zero or more other data objects;
wherein writing the new data object to the first slab comprises writing a first new leaf node of the first tiered data structure to the first slab, the first new leaf node includes the new data object and the zero or more other data objects in the retrieved old leaf node. 5. The method of claim 4, wherein the pointer to the location of the new data object in the datastore is a pointer to the first slab in the datastore; and
wherein the pointer to the location of the old data object in the datastore is a pointer to the second slab in the datastore. 6. The method of claim 4, wherein the old leaf node of the first tiered data structure is write-locked during the first memory operation. 7. The method of claim 2, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the method further comprising:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 8. The method of claim 7, wherein the second memory operation creates a second new value in the first tiered data structure, the second new value corresponds to the second new data object; and
the method further comprising:
prior to writing the second new data object in the datastore, allocating a third slab in the datastore for the second new data object; and
wherein writing the second new data object in the datastore comprises writing the second new data object to the third slab in the datastore, wherein the second new data object includes the second new value and the second key. 9. The method of claim 8, further comprising:
prior to writing the second new data object to the third slab:
identifying an adjacent data object corresponding to an adjacent key that is closest to the second key;
locating the adjacent data object in a fourth slab of the datastore using the key-map to map the adjacent key to the fourth slab in the datastore; and
retrieving a second old leaf node of the first tiered data structure that is stored at the fourth slab, wherein the second old leaf node includes the adjacent data object and zero or more other data objects;
wherein writing the second new data object to the third slab comprises writing a second new leaf node of the first tiered data structure to the third slab, the second new leaf node includes the second new data object, the adjacent data object, and the zero or more other data objects in the retrieved second old leaf node. 10. The method of claim 9, wherein the second memory operation causes a split of the second old leaf node in the first tiered data structure. 11. The method of claim 2, wherein a third memory operation in the set of two or more memory operations is associated with a third key, and wherein the new data object is a first new data object; and
the method further comprising:
for the third memory operation in the set of two or more memory operations:
writing a third new data object, distinct from the first new data object, in the datastore;
assigning, in the key-map, a location of the third new data object in the datastore to the third key; and
maintaining a third old data object in the datastore, wherein a location of the third old data object was previously assigned, in the key-map, to the third key;
wherein the operation commit record for the third memory operation includes the third key, the unique transaction identifier, a pointer to the location of the third new data object in the datastore, and a pointer to the location of the third old data object in the datastore. 12. The method of claim 11, wherein the third memory operation replaces a third old value in the first tiered data structure with a tombstone, the third old value corresponds to the third old data object and the tombstone corresponds to the third new data object; and
the method further comprising:
prior to writing the third new data object in the datastore, allocating a fifth slab in the datastore for the third new data object; and
wherein writing the third new data object in the datastore comprises writing the third new data object to the fifth slab in the datastore, wherein the third new data object includes the tombstone and the third key. 13. The method of claim 12, further comprising:
prior to writing the third new data object to the fifth slab:
locating the third old data object that includes the third old value in a sixth slab of the datastore using the key-map to map the third key to the sixth slab in the datastore; and
retrieving a third old leaf node of the first tiered data structure that is stored at the sixth slab, wherein the third old leaf node includes the third old data object and zero or more other data objects;
wherein writing the third new data object comprises writing a third new leaf node of the first tiered data structure to the fifth slab in the datastore, the third new leaf node includes the third new data object and the zero or more other data objects in the retrieved third old leaf node. 14. The method of claim 2, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. 15. The method of claim 14, further comprising:
at a time subsequent to writing the transaction commit record, updating the persistent key-map with records in the log stream that were stored in the log stream after the previous update of the persistent key-map. 16. The method of claim 15, further comprising:
after updating the persistent key-map, reclaiming one or more slabs in the datastore that are not referenced by keys in the persistent key-map. 17. A data storage system, comprising:
a non-volatile memory with a log stream and a datastore storing one or more tiered data structures; a volatile memory with a key-map; and a memory controller with one or more processors and memory storing one or more programs, wherein the one or more programs are configured to be executed by the one or more processors, the one or more programs including instructions for:
in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
writing a start transaction record to the log stream including a unique transaction identifier corresponding to the transaction; and
performing the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, writing a first operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
writing a new data object in the datastore;
assigning, in the key-map, a location of the new data object in the datastore to the first key; and
maintaining an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, writing a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 18. The data storage system of claim 17, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 19. The data storage system of claim 17, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the one or more programs further include instructions for:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 20. The data storage system of claim 17, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. 21. A non-transitory computer-readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by a memory controller with one or more processors, cause the memory controller to:
in response to receiving a request, from a requestor, to perform a transaction including a set of two or more memory operations to be performed on the one or more tiered data structures, wherein a first memory operation in the set of two or more memory operations is associated with a first key:
write a start transaction record to a log stream including a unique transaction identifier corresponding to the transaction; and
perform the two or more memory operations, including:
for each of the memory operations, upon completion of the memory operation, write a first operation commit record to the log stream, wherein the operation commit record guarantees a memory operation level of atomicity across the one or more tiered data structures; and
for the first memory operation in the set of two or more memory operations:
write a new data object in the datastore;
assign, in the key-map, a location of the new data object in the datastore to the first key; and
maintain an old data object in the datastore, wherein a location of the old data object was previously assigned, in the key-map, to the first key;
wherein the operation commit record for the first memory operation includes the first key, the unique transaction identifier, a pointer to the location of the new data object in the datastore, and a pointer to the location of the old data object in the datastore; and
in accordance with a determination that the set of two or more memory operations in the transaction are complete, write a transaction commit record to the log stream including the unique transaction identifier corresponding to the transaction, wherein the transaction commit record guarantees a transaction level of atomicity across the data storage system. 22. The non-transitory computer readable storage medium of claim 21, wherein the datastore comprises a plurality of slabs; and
wherein a first tiered data structure of the one or more tiered data structures includes a plurality of leaf nodes, wherein a first leaf node of the first tiered data structure includes one or more data objects and is stored in a first slab of the plurality of slabs. 23. The non-transitory computer readable storage medium of claim 21, wherein a second memory operation in the set of two or more memory operations is associated with a second key, and wherein the new data object is a first new data object; and
the one or more programs further include instructions for:
for the second memory operation in the set of two or more memory operations:
writing a second new data object, distinct from the first new data object, in the datastore; and
assigning, in the key-map, a location of the second new data object in the datastore to the second key;
wherein the operation commit record for the second memory operation includes the second key, the unique transaction identifier, and a pointer to the location of the second new data object in the datastore. 24. The non-transitory computer readable storage medium of claim 21, wherein the key-map is a non-persistent key-map stored in volatile memory; and
wherein the non-volatile memory includes a persistent key-map. | 2,100 |
5,012 | 13,288,010 | 2,177 | A method includes sending to the plurality of clients copies of the document for realtime editing, and obtaining respective changesets for two or more respective clients in the plurality of clients. A respective changeset represents one or more changes to a respective copy of the document at a respective client. The method also includes generating a result changeset in accordance with the respective changesets, and sending the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. | 1. A method of providing a document to a plurality of clients for realtime editing, the method comprising:
at a server having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, sending to the plurality of clients copies of the document for realtime editing; obtaining respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client; generating a result changeset in accordance with the respective changesets; and sending the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 2. The method of claim 1, further comprising updating the document stored at the server in accordance with the respective changesets. 3. The method of claim 1, further comprising:
assigning editing-right-control to a master editor, wherein the editing-right-control is configured to modify an editing-right of the respective client; and wherein obtaining the respective changesets for the two or more respective clients includes receiving the respective changesets from the two or more respective clients when the two or more respective clients have the editing-right. 4. The method of claim 3, wherein:
the editing-right comprises an editing-right for commenting; the method includes sending content of the document in a webpage to the plurality of clients for realtime editing, wherein the webpage is configured, when rendered at a respective client having the editing-right, to receive one or more comments on the document and to convey the one or more comments to the server; and receiving the respective changesets from the respective clients includes receiving the respective changeset from the respective client when the respective client has the editing-right for commenting and the respective changeset includes at least a portion of a respective comment on the document. 5. The method of claim 1, further comprising sending content of the document in a webpage to the plurality of clients for realtime editing, wherein the webpage is configured, when rendered at a respective client having the editing-right, to receive inputs from a respective user of the respective client for editing the document. 6. The method of claim 5, wherein the webpage includes instructions for:
determining the respective changeset in accordance with the inputs; and sending the respective changeset to the server. 7. The method of claim 6, further comprising sending an acknowledgment of the respective changeset to a respective client, and
wherein the webpage includes: instructions for maintaining at the respective client a set of changesets, the set of changesets comprising:
a first changeset, representing changes not transmitted to the server;
and
a second changeset, representing changes transmitted to the server but not acknowledged by the server; and
instructions for sending the first changeset to the server; and instructions for updating the second changeset in response to receipt of the acknowledgment of the respective changeset by the respective client. 8. The method of claim 7, wherein the webpage includes instructions for updating the set of changesets in accordance with the result changeset. 9. The method of claim 5, wherein the webpage includes instructions for:
receiving the result changeset for updating the respective copy of the document at the respective client; and updating the respective copy of the document at the respective client in accordance with the result changeset. 10. The method of claim 5, wherein the webpage includes instructions for selecting to view changes to the document in realtime. 11. The method of claim 1, wherein the document includes at least a portion of a weblog. 12. The method of claim 1, further comprising maintaining a revision record for the respective client. 13. A server for providing a document to a plurality of clients for realtime editing, comprising:
one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions to:
send to the plurality of clients copies of the document for realtime editing;
obtain respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client;
generate a result changeset in accordance with the respective changesets; and
send the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 14. A computer readable storage medium storing one or more programs configured for execution by one or more processors of a server, the one or more programs comprising instructions to:
send to the plurality of clients copies of the document for realtime editing; obtain respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client; generate a result changeset in accordance with the respective changesets; and send the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 15. A method of processing a document for realtime editing, the method comprising:
at a client having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, displaying at least a portion of a respective copy of the document; receiving inputs from a respective user of the client for editing the document; sending, to a server connected to a plurality of clients, document information in accordance with the inputs; receiving a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and updating the respective copy of the document at the client in accordance with the result changeset. 16. The method of claim 15, further comprising determining a respective changeset in accordance with the inputs, wherein sending the document information comprises sending a respective changeset, and the respective changeset represents one or more changes to the document at the client. 17. The method of claim 16, further comprising:
maintaining a set of changesets at the client, the set of changesets comprising:
a first changeset, representing changes not transmitted to the server; and
a second changeset, representing changes transmitted to the server but not acknowledged by the server; and
displaying the changesets with the at least a portion of the document, wherein sending the respective changeset comprises sending the first changeset. 18. The method of claim 17, further comprising updating the set of changesets in accordance with the result changeset. 19. A client for processing a document for realtime editing, comprising:
a display device, one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions to:
display at least a portion of a respective copy of the document on the display device;
receive inputs from a respective user of the client for editing the document;
send, to a server connected to a plurality of clients, document information in accordance with the inputs;
receive a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and
update the respective copy of the document at the client in accordance with the result changeset. 20. A computer readable storage medium storing one or more programs configured for execution by one or more processors of a client, the one or more programs comprising instructions to:
display at least a portion of a respective copy of the document; receive inputs from a respective user of the client for editing the document; send, to a server connected to a plurality of clients, document information in accordance with the inputs; receive a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and update the respective copy of the document at the client in accordance with the result changeset. 21. A method of providing a document to a plurality of clients for realtime editing, the method comprising:
at a server having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, sending to a first client of the plurality of clients a first copy of the document; sending to a second client of the plurality of clients a second copy of the document; obtaining a first changeset from the first client, the first changeset representing one or more changes to the first copy of the document at the first client; obtaining a second changeset from the second client, the second changeset representing one or more changes to the second copy of the document at the second client; generating a result changeset in accordance with at least the first changeset and the second changeset; sending the result changeset to the first client for updating the first copy of the document; and sending the result changeset to the second client for updating the second copy of the document. 22. The method of claim 21, further comprising concurrently with sending the result changeset to the first client and second client, sending the result changeset to a third client for updating a third copy of the document. | A method includes sending to the plurality of clients copies of the document for realtime editing, and obtaining respective changesets for two or more respective clients in the plurality of clients. A respective changeset represents one or more changes to a respective copy of the document at a respective client. The method also includes generating a result changeset in accordance with the respective changesets, and sending the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients.1. A method of providing a document to a plurality of clients for realtime editing, the method comprising:
at a server having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, sending to the plurality of clients copies of the document for realtime editing; obtaining respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client; generating a result changeset in accordance with the respective changesets; and sending the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 2. The method of claim 1, further comprising updating the document stored at the server in accordance with the respective changesets. 3. The method of claim 1, further comprising:
assigning editing-right-control to a master editor, wherein the editing-right-control is configured to modify an editing-right of the respective client; and wherein obtaining the respective changesets for the two or more respective clients includes receiving the respective changesets from the two or more respective clients when the two or more respective clients have the editing-right. 4. The method of claim 3, wherein:
the editing-right comprises an editing-right for commenting; the method includes sending content of the document in a webpage to the plurality of clients for realtime editing, wherein the webpage is configured, when rendered at a respective client having the editing-right, to receive one or more comments on the document and to convey the one or more comments to the server; and receiving the respective changesets from the respective clients includes receiving the respective changeset from the respective client when the respective client has the editing-right for commenting and the respective changeset includes at least a portion of a respective comment on the document. 5. The method of claim 1, further comprising sending content of the document in a webpage to the plurality of clients for realtime editing, wherein the webpage is configured, when rendered at a respective client having the editing-right, to receive inputs from a respective user of the respective client for editing the document. 6. The method of claim 5, wherein the webpage includes instructions for:
determining the respective changeset in accordance with the inputs; and sending the respective changeset to the server. 7. The method of claim 6, further comprising sending an acknowledgment of the respective changeset to a respective client, and
wherein the webpage includes: instructions for maintaining at the respective client a set of changesets, the set of changesets comprising:
a first changeset, representing changes not transmitted to the server;
and
a second changeset, representing changes transmitted to the server but not acknowledged by the server; and
instructions for sending the first changeset to the server; and instructions for updating the second changeset in response to receipt of the acknowledgment of the respective changeset by the respective client. 8. The method of claim 7, wherein the webpage includes instructions for updating the set of changesets in accordance with the result changeset. 9. The method of claim 5, wherein the webpage includes instructions for:
receiving the result changeset for updating the respective copy of the document at the respective client; and updating the respective copy of the document at the respective client in accordance with the result changeset. 10. The method of claim 5, wherein the webpage includes instructions for selecting to view changes to the document in realtime. 11. The method of claim 1, wherein the document includes at least a portion of a weblog. 12. The method of claim 1, further comprising maintaining a revision record for the respective client. 13. A server for providing a document to a plurality of clients for realtime editing, comprising:
one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions to:
send to the plurality of clients copies of the document for realtime editing;
obtain respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client;
generate a result changeset in accordance with the respective changesets; and
send the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 14. A computer readable storage medium storing one or more programs configured for execution by one or more processors of a server, the one or more programs comprising instructions to:
send to the plurality of clients copies of the document for realtime editing; obtain respective changesets for two or more respective clients in the plurality of clients, a respective changeset representing one or more changes to a respective copy of the document at a respective client; generate a result changeset in accordance with the respective changesets; and send the result changeset to the plurality of clients for updating the respective copies of the document at the plurality of clients. 15. A method of processing a document for realtime editing, the method comprising:
at a client having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, displaying at least a portion of a respective copy of the document; receiving inputs from a respective user of the client for editing the document; sending, to a server connected to a plurality of clients, document information in accordance with the inputs; receiving a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and updating the respective copy of the document at the client in accordance with the result changeset. 16. The method of claim 15, further comprising determining a respective changeset in accordance with the inputs, wherein sending the document information comprises sending a respective changeset, and the respective changeset represents one or more changes to the document at the client. 17. The method of claim 16, further comprising:
maintaining a set of changesets at the client, the set of changesets comprising:
a first changeset, representing changes not transmitted to the server; and
a second changeset, representing changes transmitted to the server but not acknowledged by the server; and
displaying the changesets with the at least a portion of the document, wherein sending the respective changeset comprises sending the first changeset. 18. The method of claim 17, further comprising updating the set of changesets in accordance with the result changeset. 19. A client for processing a document for realtime editing, comprising:
a display device, one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions to:
display at least a portion of a respective copy of the document on the display device;
receive inputs from a respective user of the client for editing the document;
send, to a server connected to a plurality of clients, document information in accordance with the inputs;
receive a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and
update the respective copy of the document at the client in accordance with the result changeset. 20. A computer readable storage medium storing one or more programs configured for execution by one or more processors of a client, the one or more programs comprising instructions to:
display at least a portion of a respective copy of the document; receive inputs from a respective user of the client for editing the document; send, to a server connected to a plurality of clients, document information in accordance with the inputs; receive a result changeset for updating the respective copy of the document at the client, the result changeset representing changes to the document based on changes to respective copies of the document at two or more clients in the plurality of clients; and update the respective copy of the document at the client in accordance with the result changeset. 21. A method of providing a document to a plurality of clients for realtime editing, the method comprising:
at a server having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method, sending to a first client of the plurality of clients a first copy of the document; sending to a second client of the plurality of clients a second copy of the document; obtaining a first changeset from the first client, the first changeset representing one or more changes to the first copy of the document at the first client; obtaining a second changeset from the second client, the second changeset representing one or more changes to the second copy of the document at the second client; generating a result changeset in accordance with at least the first changeset and the second changeset; sending the result changeset to the first client for updating the first copy of the document; and sending the result changeset to the second client for updating the second copy of the document. 22. The method of claim 21, further comprising concurrently with sending the result changeset to the first client and second client, sending the result changeset to a third client for updating a third copy of the document. | 2,100 |
5,013 | 14,231,472 | 2,159 | Computer readable software objects, methods and apparatus are provided for using a path specification to limit requested entity data by designating a single explicit multiple step path between any two pairs of entity types. The computer readable software object comprises an ordered collection of path specification elements, a start entity, and an end entity. The method comprises determining a relationship specification from an input from a user. The method further includes determining if more than one path specification element exists that is associated with the relationship specification. When more than one path specification element exists, the user is provided with a choice of path specifications. The method then returns a list of entities from the destination entity type filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user. | 1. A computer readable software object stored on a tangible recording medium, comprising:
an ordered collection of path specification elements; a start entity in a database; and an end entity in a database. 2. The computer readable software object of claim 1, wherein each path specification element comprises:
a path specification; one or more relationships logically arranged between the start entity and the end entity; an order of the one or more relationships; and a direction by which a processor traverses the order of the one or more relationships. 3. A method for using a path specification to limit requested entity data by designate a single explicit multiple step path between any two pairs of entities, the method comprising:
determining a relationship specification from an input from a user, the relationship specification comprising a source entity and a destination entity; determining if more than one path specification element exists that is associated with the relationship specification; when more than one path specification element exists, providing the user with a choice of path specification elements; and returning a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user. 4. The method of claim 3, further comprising:
when only one path specification element exists, return a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the only path specification element. 5. The method of claim 3, further comprising:
when no path specification element exists, return a list of all data items from the destination entity based on the relationship specification only. 6. A database system comprising:
a computing device; a memory device in electronic communication with the computing device; and a data model resident within the memory device, the data model comprising:
an ordered collection of path specification elements;
a start entity in a database; and
an end entity in a database. 7. The database system of claim 6, wherein each path specification element comprises:
a path specification; one or more relationships logically arranged between the start entity and the end entity; an order of the relationships; and a direction by which a processor traverses the order of the relationships. 8. The database system of claim 7, wherein the computing device uses the path specification to:
determine a relationship specification from an input from a user, the relationship specification comprising a source entity and a destination entity; determine if more than one path specification element exists that is associated with the relationship specification; when more than one path specification element exists, provide the user with a choice of path specification elements; and return a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user. | Computer readable software objects, methods and apparatus are provided for using a path specification to limit requested entity data by designating a single explicit multiple step path between any two pairs of entity types. The computer readable software object comprises an ordered collection of path specification elements, a start entity, and an end entity. The method comprises determining a relationship specification from an input from a user. The method further includes determining if more than one path specification element exists that is associated with the relationship specification. When more than one path specification element exists, the user is provided with a choice of path specifications. The method then returns a list of entities from the destination entity type filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user.1. A computer readable software object stored on a tangible recording medium, comprising:
an ordered collection of path specification elements; a start entity in a database; and an end entity in a database. 2. The computer readable software object of claim 1, wherein each path specification element comprises:
a path specification; one or more relationships logically arranged between the start entity and the end entity; an order of the one or more relationships; and a direction by which a processor traverses the order of the one or more relationships. 3. A method for using a path specification to limit requested entity data by designate a single explicit multiple step path between any two pairs of entities, the method comprising:
determining a relationship specification from an input from a user, the relationship specification comprising a source entity and a destination entity; determining if more than one path specification element exists that is associated with the relationship specification; when more than one path specification element exists, providing the user with a choice of path specification elements; and returning a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user. 4. The method of claim 3, further comprising:
when only one path specification element exists, return a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the only path specification element. 5. The method of claim 3, further comprising:
when no path specification element exists, return a list of all data items from the destination entity based on the relationship specification only. 6. A database system comprising:
a computing device; a memory device in electronic communication with the computing device; and a data model resident within the memory device, the data model comprising:
an ordered collection of path specification elements;
a start entity in a database; and
an end entity in a database. 7. The database system of claim 6, wherein each path specification element comprises:
a path specification; one or more relationships logically arranged between the start entity and the end entity; an order of the relationships; and a direction by which a processor traverses the order of the relationships. 8. The database system of claim 7, wherein the computing device uses the path specification to:
determine a relationship specification from an input from a user, the relationship specification comprising a source entity and a destination entity; determine if more than one path specification element exists that is associated with the relationship specification; when more than one path specification element exists, provide the user with a choice of path specification elements; and return a list of data items from the destination entity filtered through a restricted set of entities logically located between the source entity and the destination entity based exclusively on the path specification element chosen by the user. | 2,100 |
5,014 | 14,171,474 | 2,165 | A method, system, and computer program product for dynamically building a database query by combining a static query clause with a user-specified filter. A method commences upon receiving a user-specified query filter from a user interface, then reformatting the user-specified query filter from a first query filter representation (e.g., clicks or text from the user interface) into a second query filter representation (e.g., into XML or into a database connectivity format, or into an SQL format, or into any native format). Subsequent steps combine the second query filter representation with a predefined database query (e.g., from an enterprise application) to form a dynamically-generated database language query. The filter is specified at a user interface, and the predefined database query is specified by an application. | 1. A computer implemented method using a processor organized into a system having three or more tiers, the processor to perform one or more steps comprising:
receiving a user-specified filter clause from a user interface operating in a first tier; reformatting the user-specified filter clause from a first filter clause representation into a second filter clause representation; and modifying a predefined database query at a second tier of the system to form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 2. The method of claim 1, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 3. The method of claim 2, wherein the second filter clause representation comprises a SQL WHERE clause. 4. The method of claim 1, wherein the reformatting is performed by a middleware component. 5. The method of claim 4, wherein the predefined database query is registered with the middleware component. 6. The method of claim 1, wherein the predefined database query is a static query specified by an application. 7. The method of claim 6, wherein application runs in a middleware tier or backend tier. 8. The method of claim 1, wherein the user-specified filter clause comprises two or more data selection terms. 9. The method of claim 8, wherein the two or more data selection terms comprise at least one value and least one operator. 10. The method of claim 8, wherein the one or more data selection terms comprises at least one of, an equal operator, a not equal operator, a greater than operator, and a less than operator. 11. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process, the process comprising:
receiving a user-specified filter clause from a user interface operating in a first tier; reformatting the user-specified filter clause from a first filter clause representation into a second filter clause representation; and modifying a predefined database query at a second tier form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 12. The computer program product of claim 11, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 13. The computer program product of claim 12, wherein the second filter clause representation comprises a SQL WHERE clause. 14. The computer program product of claim 11, wherein the reformatting is performed by a middleware component. 15. The computer program product of claim 14, wherein the predefined database query is registered with the middleware component. 16. The computer program product of claim 11, wherein the predefined database query is a static query specified by an application. 17. The computer program product of claim 16, wherein application runs in a second tier or runs in a third tier. 18. A computer system comprising:
a first tier processor to receive a user-specified filter clause from a user interface operating in the first tier; and a second tier processor configured to reformat the user-specified filter clause from a first filter clause representation into a second filter clause representation and modify a predefined database query at another tier of the system to form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 19. The computer system of claim 18, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 20. The computer system of claim 18, wherein the second filter clause representation comprises a SQL WHERE clause. | A method, system, and computer program product for dynamically building a database query by combining a static query clause with a user-specified filter. A method commences upon receiving a user-specified query filter from a user interface, then reformatting the user-specified query filter from a first query filter representation (e.g., clicks or text from the user interface) into a second query filter representation (e.g., into XML or into a database connectivity format, or into an SQL format, or into any native format). Subsequent steps combine the second query filter representation with a predefined database query (e.g., from an enterprise application) to form a dynamically-generated database language query. The filter is specified at a user interface, and the predefined database query is specified by an application.1. A computer implemented method using a processor organized into a system having three or more tiers, the processor to perform one or more steps comprising:
receiving a user-specified filter clause from a user interface operating in a first tier; reformatting the user-specified filter clause from a first filter clause representation into a second filter clause representation; and modifying a predefined database query at a second tier of the system to form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 2. The method of claim 1, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 3. The method of claim 2, wherein the second filter clause representation comprises a SQL WHERE clause. 4. The method of claim 1, wherein the reformatting is performed by a middleware component. 5. The method of claim 4, wherein the predefined database query is registered with the middleware component. 6. The method of claim 1, wherein the predefined database query is a static query specified by an application. 7. The method of claim 6, wherein application runs in a middleware tier or backend tier. 8. The method of claim 1, wherein the user-specified filter clause comprises two or more data selection terms. 9. The method of claim 8, wherein the two or more data selection terms comprise at least one value and least one operator. 10. The method of claim 8, wherein the one or more data selection terms comprises at least one of, an equal operator, a not equal operator, a greater than operator, and a less than operator. 11. A computer program product embodied in a non-transitory computer readable medium, the computer readable medium having stored thereon a sequence of instructions which, when executed by a processor causes the processor to execute a process, the process comprising:
receiving a user-specified filter clause from a user interface operating in a first tier; reformatting the user-specified filter clause from a first filter clause representation into a second filter clause representation; and modifying a predefined database query at a second tier form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 12. The computer program product of claim 11, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 13. The computer program product of claim 12, wherein the second filter clause representation comprises a SQL WHERE clause. 14. The computer program product of claim 11, wherein the reformatting is performed by a middleware component. 15. The computer program product of claim 14, wherein the predefined database query is registered with the middleware component. 16. The computer program product of claim 11, wherein the predefined database query is a static query specified by an application. 17. The computer program product of claim 16, wherein application runs in a second tier or runs in a third tier. 18. A computer system comprising:
a first tier processor to receive a user-specified filter clause from a user interface operating in the first tier; and a second tier processor configured to reformat the user-specified filter clause from a first filter clause representation into a second filter clause representation and modify a predefined database query at another tier of the system to form a dynamically-generated database language query, wherein the predefined database query is modified by adding the second filter clause representation to the predefined database query rather than updating an existing filter clause in the predefined database query with a new or modified predicate. 19. The computer system of claim 18, wherein the user-specified filter clause is specified using an interactive screen device and the predefined database query comprises SQL. 20. The computer system of claim 18, wherein the second filter clause representation comprises a SQL WHERE clause. | 2,100 |
5,015 | 14,323,896 | 2,135 | Systems, methods and/or devices are used to enable real-time I/O pattern recognition to enhance performance and endurance of a storage device. In one aspect, the method includes (1) at a storage device, receiving from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including (a) maintaining a history of I/O request patterns in the region for a predetermined time period, and (b) using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. | 1. A data processing method, comprising:
at a storage device:
receiving from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 2. The method of claim 1, wherein the plurality of I/O requests includes read requests from one or more regions of the plurality of regions and write requests to one or more regions of the plurality of regions. 3. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking whether a total number of write requests to the region has exceeded a write threshold. 4. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of sequential read requests from the region. 5. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of sequential write requests to the region. 6. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of unaligned write requests to the region, wherein unaligned write requests are write requests not aligned with predefined page boundaries. 7. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of write requests to write data of size less than a predefined small-size threshold. 8. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of write requests to write data of size greater than a predefined large-size threshold. 9. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking whether the region is accessed at least once by the plurality of I/O requests. 10. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking a lowest logical block address (LBA) accessed in the region. 11. The method of claim 10, wherein maintaining the history of I/O request patterns in the region includes tracking a highest logical block address (LBA) accessed in the region. 12. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes recording a time stamp corresponding to when the history of I/O request patterns is reset. 13. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold. 14. The method of claim 1, wherein each region includes a plurality of sub-regions, and maintaining the history of I/O request patterns in the region includes:
for each sub-region of the plurality of sub-regions:
tracking a total number of times the sub-region is accessed. 15. The method of claim 1, wherein the predetermined time period is configurable. 16. The method of claim 1, wherein the history of I/O request patterns is maintained in a data structure stored on the storage device. 17. The method of claim 1, wherein the history of I/O request patterns is maintained in a data structure stored on the host. 18. The method of claim 1, further comprising:
for each region of the plurality of regions, subsequent to maintaining the history of I/O request patterns in the region for the predetermined time period, maintaining a second history of I/O request patterns in the region for a next instance of the predetermined time period. 19. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 20. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 21. The method of claim 20, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 22. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 23. The storage device of claim 22, wherein the history of I/O request patterns is maintained in a data structure stored on the storage device. 24. The storage device of claim 22, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions, subsequent to maintaining the history of I/O request patterns in the region for the predetermined time period, maintain a second history of I/O request patterns in the region for a next instance of the predetermined time period. 25. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 26. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at the storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. | Systems, methods and/or devices are used to enable real-time I/O pattern recognition to enhance performance and endurance of a storage device. In one aspect, the method includes (1) at a storage device, receiving from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host, and (2) performing one or more operations for each region of the plurality of regions in the logical address space of the host, including (a) maintaining a history of I/O request patterns in the region for a predetermined time period, and (b) using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region.1. A data processing method, comprising:
at a storage device:
receiving from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 2. The method of claim 1, wherein the plurality of I/O requests includes read requests from one or more regions of the plurality of regions and write requests to one or more regions of the plurality of regions. 3. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking whether a total number of write requests to the region has exceeded a write threshold. 4. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of sequential read requests from the region. 5. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of sequential write requests to the region. 6. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of unaligned write requests to the region, wherein unaligned write requests are write requests not aligned with predefined page boundaries. 7. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of write requests to write data of size less than a predefined small-size threshold. 8. The method of claim 2, wherein maintaining the history of I/O request patterns in the region includes tracking a total number of write requests to write data of size greater than a predefined large-size threshold. 9. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking whether the region is accessed at least once by the plurality of I/O requests. 10. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking a lowest logical block address (LBA) accessed in the region. 11. The method of claim 10, wherein maintaining the history of I/O request patterns in the region includes tracking a highest logical block address (LBA) accessed in the region. 12. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes recording a time stamp corresponding to when the history of I/O request patterns is reset. 13. The method of claim 1, wherein maintaining the history of I/O request patterns in the region includes tracking whether a total number of sequential I/O requests to the region has exceeded a sequential request threshold. 14. The method of claim 1, wherein each region includes a plurality of sub-regions, and maintaining the history of I/O request patterns in the region includes:
for each sub-region of the plurality of sub-regions:
tracking a total number of times the sub-region is accessed. 15. The method of claim 1, wherein the predetermined time period is configurable. 16. The method of claim 1, wherein the history of I/O request patterns is maintained in a data structure stored on the storage device. 17. The method of claim 1, wherein the history of I/O request patterns is maintained in a data structure stored on the host. 18. The method of claim 1, further comprising:
for each region of the plurality of regions, subsequent to maintaining the history of I/O request patterns in the region for the predetermined time period, maintaining a second history of I/O request patterns in the region for a next instance of the predetermined time period. 19. The method of claim 1, wherein the storage device comprises one or more flash memory devices. 20. The method of claim 1, wherein the storage device comprises one or more three-dimensional (3D) memory devices and circuitry associated with operation of memory elements in the one or more 3D memory devices. 21. The method of claim 20, wherein the circuitry and one or more memory elements in a respective 3D memory device, of the one or more 3D memory devices, are on the same substrate. 22. A storage device, comprising:
one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage device to:
receive, at the storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 23. The storage device of claim 22, wherein the history of I/O request patterns is maintained in a data structure stored on the storage device. 24. The storage device of claim 22, wherein the one or more programs, which when executed by the one or more processors, further cause the storage device to:
for each region of the plurality of regions, subsequent to maintaining the history of I/O request patterns in the region for the predetermined time period, maintain a second history of I/O request patterns in the region for a next instance of the predetermined time period. 25. A storage system, comprising:
a storage medium; one or more processors; and memory storing one or more programs, which when executed by the one or more processors cause the storage system to:
receive, at a storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and
perform one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. 26. A non-transitory computer readable storage medium, storing one or more programs configured for execution by one or more processors of a storage device, the one or more programs including instructions for:
receiving, at the storage device, from a host a plurality of input/output (I/O) requests, the I/O requests specifying operations to be performed in a plurality of regions in a logical address space of the host; and performing one or more operations for each region of the plurality of regions in the logical address space of the host, including:
maintaining a history of I/O request patterns in the region for a predetermined time period; and
using the history of I/O request patterns in the region to adjust subsequent I/O processing in the region. | 2,100 |
5,016 | 14,693,861 | 2,175 | Embodiments of the invention provide for persistently tracking a work space arrangement of a CRM application through a Web browser. In an embodiment of the invention, a method for persistently tracking work space arrangement of a CRM application through a Web browser includes identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session. The method also includes storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application. Finally, the method includes subsequently detecting the end user establishing a new Web browser session with the CRM application and automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. | 1. A method for persistently tracking work space arrangement of a customer relationship management (CRM) application through a Web browser, the method comprising:
identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session; storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application; subsequently detecting the end user establishing a new Web browser session with the CRM application; and, automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 2. The method of claim 1, wherein the record further includes a reference to different records of a database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 3. The method of claim 1, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 4. The method of claim 1, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 5. The method of claim 1, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 6. The method of claim 1, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. 7. A Web driven application data processing system configured for persistently tracking a work space arrangement of a customer relationship management (CRM) application through a Web browser, the system comprising:
a host computing system comprising one or more computers each with memory and at least one processor; a CRM application executing in the host computing system and providing access to CRM data in a coupled database to requesting end users over a computer communications network; a Web server serving to different Web browsers of the end users different Web pages each set of the different Web pages being reflective of a workspace for a corresponding one of the end users; and, a work space persistence management module coupled to the CRM application, the module comprising program code that when executed in the memory of the host computing system is enabled to identify different Web browser windows and tabs spawned in a Web browser in connection with an end user interacting with the CRM application through the Web browser in an initial Web browser session, to store a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application, to subsequently detect the end user establishing a new Web browser session with the CRM application, and to automatically spawn the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 8. The system of claim 7, wherein the record further includes a reference to different records of the database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 9. The system of claim 7, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 10. The system of claim 7, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 11. The system of claim 7, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 12. The system of claim 7, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. 13. A computer program product for persistently tracking work space arrangement of a customer relationship management (CRM) application through a Web browser, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session; storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application; subsequently detecting the end user establishing a new Web browser session with the CRM application; and, automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 14. The computer program product of claim 13, wherein the record further includes a reference to different records of a database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 15. The computer program product of claim 13, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 16. The computer program product of claim 13, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 17. The computer program product of claim 13, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 18. The computer program product of claim 13, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. | Embodiments of the invention provide for persistently tracking a work space arrangement of a CRM application through a Web browser. In an embodiment of the invention, a method for persistently tracking work space arrangement of a CRM application through a Web browser includes identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session. The method also includes storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application. Finally, the method includes subsequently detecting the end user establishing a new Web browser session with the CRM application and automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user.1. A method for persistently tracking work space arrangement of a customer relationship management (CRM) application through a Web browser, the method comprising:
identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session; storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application; subsequently detecting the end user establishing a new Web browser session with the CRM application; and, automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 2. The method of claim 1, wherein the record further includes a reference to different records of a database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 3. The method of claim 1, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 4. The method of claim 1, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 5. The method of claim 1, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 6. The method of claim 1, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. 7. A Web driven application data processing system configured for persistently tracking a work space arrangement of a customer relationship management (CRM) application through a Web browser, the system comprising:
a host computing system comprising one or more computers each with memory and at least one processor; a CRM application executing in the host computing system and providing access to CRM data in a coupled database to requesting end users over a computer communications network; a Web server serving to different Web browsers of the end users different Web pages each set of the different Web pages being reflective of a workspace for a corresponding one of the end users; and, a work space persistence management module coupled to the CRM application, the module comprising program code that when executed in the memory of the host computing system is enabled to identify different Web browser windows and tabs spawned in a Web browser in connection with an end user interacting with the CRM application through the Web browser in an initial Web browser session, to store a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application, to subsequently detect the end user establishing a new Web browser session with the CRM application, and to automatically spawn the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 8. The system of claim 7, wherein the record further includes a reference to different records of the database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 9. The system of claim 7, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 10. The system of claim 7, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 11. The system of claim 7, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 12. The system of claim 7, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. 13. A computer program product for persistently tracking work space arrangement of a customer relationship management (CRM) application through a Web browser, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
identifying different Web browser windows and tabs spawned in the Web browser connection with an end user interacting with a CRM application through the Web browser in an initial Web browser session; storing a record of an arrangement of the identified Web browser windows and tabs in connection with the end user in connection with the CRM application; subsequently detecting the end user establishing a new Web browser session with the CRM application; and, automatically spawning the different Web browser windows and tabs stored in the arrangement specified in the record for the end user. 14. The computer program product of claim 13, wherein the record further includes a reference to different records of a database presented in selected ones of the identified Web browser windows and tabs such that during automatic spawning, the different records are retrieved and presented in the selected ones of the identified Web browser windows and tabs. 15. The computer program product of claim 13, wherein the record further includes a list of identified work paths, each of the work paths comprising a window and one or more tabs opened in the window, and wherein different ones of the Web browser windows and corresponding tabs specified in the record for the end user are automatically spawned as specified by one of the work paths selected by the end user in the list. 16. The computer program product of claim 13, wherein the record further includes state information for the tabs, the state information comprising a scroll position and data input provided in one or more user interface controls present in one or more of the tabs, and wherein the state information is restored in the tabs as part of the automatic spawning. 17. The computer program product of claim 13, wherein the Web browser of the initial Web browser session is presented in a desktop computer and the new Web browser session is established through a mobile device. 18. The computer program product of claim 13, wherein the Web browser of the initial Web browser session is presented in a mobile device and the new Web browser session is established through a desktop computer. | 2,100 |
5,017 | 13,838,731 | 2,152 | Arrangements relate to crowdsourcing and consolidating user notes taken within a virtual meeting. Notes from one or more meeting attendees can be received. The received user notes can be analyzed to identify a key element therein using natural language processing. The analysis of received user notes can be performed by a processor. A consolidated system notes can be generated. The consolidated system notes can include the key element. | 1-7. (canceled) 8. A system for crowdsourcing user notes taken within a virtual meeting comprising:
a processor programmed to initiate executable operations comprising:
receiving user notes from one or more meeting attendees;
analyzing the received user notes to identify a key element therein using natural language processing; and
generating consolidated system notes that includes the key element. 9. The system of claim 8, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 10. The system of claim 8, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 11. The system of claim 8, wherein the executable operations further include:
publishing the consolidated system notes. 12. The system of claim 8, wherein the executable operations further include:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 13. The system of claim 8, wherein the executable operations further include:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 14. The system of claim 8, wherein the executable operations further include:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 15. A computer program product for crowdsourcing user notes taken within a virtual meeting, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, by the processor, user notes from one or more meeting attendees; analyzing, by the processor, the received user notes to identify a key element therein using natural language processing; and generating, by the processor, consolidated system notes that includes the key element. 16. The computer program product of claim 15, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 17. The computer program product of claim 15, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 18. The computer program product of claim 15, wherein the method further includes:
publishing the consolidated system notes. 19. The computer program product of claim 15, wherein the method further includes:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 20. The computer program product of claim 15, wherein the method further includes:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 21. A method of crowdsourcing and consolidating user notes taken within a virtual meeting comprising:
receiving user notes from one or more meeting attendees; via a processor, analyzing the received user notes to identify a key element therein using natural language processing; and generating consolidated system notes that include the key element. 22. The method of claim 21, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 23. The method of claim 21, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 24. The method of claim 21, further including publishing the consolidated system notes. 25. The method of claim 21, further including:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 26. The method of claim 21, further including:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 27. The method of claim 21, further including:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. | Arrangements relate to crowdsourcing and consolidating user notes taken within a virtual meeting. Notes from one or more meeting attendees can be received. The received user notes can be analyzed to identify a key element therein using natural language processing. The analysis of received user notes can be performed by a processor. A consolidated system notes can be generated. The consolidated system notes can include the key element.1-7. (canceled) 8. A system for crowdsourcing user notes taken within a virtual meeting comprising:
a processor programmed to initiate executable operations comprising:
receiving user notes from one or more meeting attendees;
analyzing the received user notes to identify a key element therein using natural language processing; and
generating consolidated system notes that includes the key element. 9. The system of claim 8, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 10. The system of claim 8, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 11. The system of claim 8, wherein the executable operations further include:
publishing the consolidated system notes. 12. The system of claim 8, wherein the executable operations further include:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 13. The system of claim 8, wherein the executable operations further include:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 14. The system of claim 8, wherein the executable operations further include:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 15. A computer program product for crowdsourcing user notes taken within a virtual meeting, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to perform a method comprising:
receiving, by the processor, user notes from one or more meeting attendees; analyzing, by the processor, the received user notes to identify a key element therein using natural language processing; and generating, by the processor, consolidated system notes that includes the key element. 16. The computer program product of claim 15, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 17. The computer program product of claim 15, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 18. The computer program product of claim 15, wherein the method further includes:
publishing the consolidated system notes. 19. The computer program product of claim 15, wherein the method further includes:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 20. The computer program product of claim 15, wherein the method further includes:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 21. A method of crowdsourcing and consolidating user notes taken within a virtual meeting comprising:
receiving user notes from one or more meeting attendees; via a processor, analyzing the received user notes to identify a key element therein using natural language processing; and generating consolidated system notes that include the key element. 22. The method of claim 21, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof. 23. The method of claim 21, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 24. The method of claim 21, further including publishing the consolidated system notes. 25. The method of claim 21, further including:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 26. The method of claim 21, further including:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 27. The method of claim 21, further including:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. | 2,100 |
5,018 | 14,719,163 | 2,143 | At an electronic device with a touch-sensitive display, display a message transcript, where the message transcript includes at least one message from at least a first user. Determine, based at least in-part on the at least one message, a plurality of suggested one or more characters. Display, on the touch-sensitive display, the plurality of suggested one or more characters. Detect an input on the touch-sensitive display. Determine whether the input represents user selection of one of the plurality of suggested one or more characters. Display the selected one of the plurality of suggested one or more characters in the message transcript. Send the selected one or more characters to the first user. | 1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device with a touch-sensitive display, cause the electronic device to:
display a message transcript, the message transcript including at least one message from at least a first user; determine, based at least in-part on the at least one message, a plurality of suggested one or more characters; display, on the touch-sensitive display, the plurality of suggested one or more characters; detect an input on the touch-sensitive display; determine whether the input represents user selection of one of the plurality of suggested one or more characters; and in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, display the selected one of the plurality of suggested one or more characters in the message transcript. 2. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
detecting a second input on the touch-sensitive display, the second input representing user selection of a confirmation affordance; and in response to detecting the second input, sending the selected one or more characters to the first user. 3. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
displaying a virtual keyboard, the virtual keyboard including a number of character keys; detecting keyboard input representing one or more contacts on the virtual keyboard; and in response to detecting the keyboard input:
ceasing to the display the plurality of suggested one or more characters; and
displaying, in the third region, auto-correct information based on the keyboard input. 4. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least one word used in the at least one message. 5. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
identifying a use of the word “or” in the at least one message; identifying a preceding word that appears immediately before the word “or”; and identifying a subsequent word that appears immediately after the word “or”, wherein:
displaying the plurality of suggested one or more characters comprises displaying at least the preceding word and the subsequent word. 6. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on a punctuation mark used in the at least one message. 7. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining whether the at least one message contains an interrogatory sentence; and in accordance with a determination that the at least one message contains an interrogatory sentence, displaying at least “yes” and “no” as part of the plurality of suggested one or more characters. 8. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least the identity of the first user. 9. A non-transitory computer readable storage medium according to claim 8, wherein the one or more programs further comprises instructions for:
identifying the most-frequently-sent messages to the first user, wherein: displaying the plurality of suggested one or more characters comprises displaying the most-frequently-sent messages. 10. A non-transitory computer readable storage medium according to claim 9, wherein the one or more programs further comprises instructions for:
identifying the most-recently-sent messages to the first user, and wherein: displaying the plurality of suggested one or more characters comprises displaying at least one of the most-recently-sent messages. 11. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least a location of the first user. 12. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining a location of the electronic device, and displaying an affordance for sending the location as a message to the first user. 13. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least one calendar entry stored in the electronic device. 14. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
obtaining a calendar entry based on the message received from the first user; and displaying an affordance for sending at least a portion of the obtained calendar entry as a message to the first user. 15. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least an honorific used in the at least one message. 16. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
obtaining a plurality of contact names stored on the electronic device; detecting the use of a contact name of the plurality of contact names in the at least one message; obtaining contact information corresponding to the used contact name; and displaying an affordance for sending at least a portion of the obtained contact information as a message to the second user. 17. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
displaying an affordance for calling a phone number associated with the obtained contact information. 18. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
counting the number of messages received from the first user within a time interval; and in accordance with a determination that the number exceeds a predetermined threshold, displaying an affordance for calling the first user. 19. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
counting the number of messages received from the first user within a time interval; and in accordance with a determination that the number exceeds a predetermined threshold, displaying an affordance for video conferencing the first user. 20. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
ranking the suggested one or more characters; and displaying the top-ranked characters in the center most position among the displayed suggested one or more characters. 21. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters comprises a first word or phrase, a second word or phrase, and a third word or phrase. 22. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters consists of a first word or phrase, a second word or phrase, and a third word or phrase. 23. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters comprises at least one emoji. 24. A non-transitory computer readable storage medium according to claim 1, wherein the at least one message is the most-recently-received message from the first user. 25. A method comprising:
at an electronic device with a touch-sensitive display:
displaying a message transcript, the message transcript including at least one message from at least a first user;
determining, based at least in-part on the at least one message, a plurality of suggested one or more characters;
displaying, on the touch-sensitive display, the plurality of suggested one or more characters;
detecting an input on the touch-sensitive display;
determining whether the input represents user selection of one of the plurality of suggested one or more characters; and
in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, displaying the selected one of the plurality of suggested one or more characters in the message transcript. 26. An electronic device, comprising:
a touch-sensitive display; one or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a message transcript, the message transcript including at least one message from at least a first user;
determining, based at least in-part on the at least one message, a plurality of suggested one or more characters;
displaying, on the touch-sensitive display, the plurality of suggested one or more characters;
detecting an input on the touch-sensitive display;
determining whether the input represents user selection of one of the plurality of suggested one or more characters; and
in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, displaying the selected one of the plurality of suggested one or more characters in the message transcript. | At an electronic device with a touch-sensitive display, display a message transcript, where the message transcript includes at least one message from at least a first user. Determine, based at least in-part on the at least one message, a plurality of suggested one or more characters. Display, on the touch-sensitive display, the plurality of suggested one or more characters. Detect an input on the touch-sensitive display. Determine whether the input represents user selection of one of the plurality of suggested one or more characters. Display the selected one of the plurality of suggested one or more characters in the message transcript. Send the selected one or more characters to the first user.1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device with a touch-sensitive display, cause the electronic device to:
display a message transcript, the message transcript including at least one message from at least a first user; determine, based at least in-part on the at least one message, a plurality of suggested one or more characters; display, on the touch-sensitive display, the plurality of suggested one or more characters; detect an input on the touch-sensitive display; determine whether the input represents user selection of one of the plurality of suggested one or more characters; and in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, display the selected one of the plurality of suggested one or more characters in the message transcript. 2. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
detecting a second input on the touch-sensitive display, the second input representing user selection of a confirmation affordance; and in response to detecting the second input, sending the selected one or more characters to the first user. 3. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
displaying a virtual keyboard, the virtual keyboard including a number of character keys; detecting keyboard input representing one or more contacts on the virtual keyboard; and in response to detecting the keyboard input:
ceasing to the display the plurality of suggested one or more characters; and
displaying, in the third region, auto-correct information based on the keyboard input. 4. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least one word used in the at least one message. 5. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
identifying a use of the word “or” in the at least one message; identifying a preceding word that appears immediately before the word “or”; and identifying a subsequent word that appears immediately after the word “or”, wherein:
displaying the plurality of suggested one or more characters comprises displaying at least the preceding word and the subsequent word. 6. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on a punctuation mark used in the at least one message. 7. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining whether the at least one message contains an interrogatory sentence; and in accordance with a determination that the at least one message contains an interrogatory sentence, displaying at least “yes” and “no” as part of the plurality of suggested one or more characters. 8. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least the identity of the first user. 9. A non-transitory computer readable storage medium according to claim 8, wherein the one or more programs further comprises instructions for:
identifying the most-frequently-sent messages to the first user, wherein: displaying the plurality of suggested one or more characters comprises displaying the most-frequently-sent messages. 10. A non-transitory computer readable storage medium according to claim 9, wherein the one or more programs further comprises instructions for:
identifying the most-recently-sent messages to the first user, and wherein: displaying the plurality of suggested one or more characters comprises displaying at least one of the most-recently-sent messages. 11. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least a location of the first user. 12. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining a location of the electronic device, and displaying an affordance for sending the location as a message to the first user. 13. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least one calendar entry stored in the electronic device. 14. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
obtaining a calendar entry based on the message received from the first user; and displaying an affordance for sending at least a portion of the obtained calendar entry as a message to the first user. 15. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
determining the plurality of suggested one or more characters based on at least an honorific used in the at least one message. 16. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
obtaining a plurality of contact names stored on the electronic device; detecting the use of a contact name of the plurality of contact names in the at least one message; obtaining contact information corresponding to the used contact name; and displaying an affordance for sending at least a portion of the obtained contact information as a message to the second user. 17. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
displaying an affordance for calling a phone number associated with the obtained contact information. 18. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
counting the number of messages received from the first user within a time interval; and in accordance with a determination that the number exceeds a predetermined threshold, displaying an affordance for calling the first user. 19. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
counting the number of messages received from the first user within a time interval; and in accordance with a determination that the number exceeds a predetermined threshold, displaying an affordance for video conferencing the first user. 20. A non-transitory computer readable storage medium according to claim 1, wherein the one or more programs further comprises instructions for:
ranking the suggested one or more characters; and displaying the top-ranked characters in the center most position among the displayed suggested one or more characters. 21. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters comprises a first word or phrase, a second word or phrase, and a third word or phrase. 22. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters consists of a first word or phrase, a second word or phrase, and a third word or phrase. 23. A non-transitory computer readable storage medium according to claim 1, wherein the plurality of suggested one or more characters comprises at least one emoji. 24. A non-transitory computer readable storage medium according to claim 1, wherein the at least one message is the most-recently-received message from the first user. 25. A method comprising:
at an electronic device with a touch-sensitive display:
displaying a message transcript, the message transcript including at least one message from at least a first user;
determining, based at least in-part on the at least one message, a plurality of suggested one or more characters;
displaying, on the touch-sensitive display, the plurality of suggested one or more characters;
detecting an input on the touch-sensitive display;
determining whether the input represents user selection of one of the plurality of suggested one or more characters; and
in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, displaying the selected one of the plurality of suggested one or more characters in the message transcript. 26. An electronic device, comprising:
a touch-sensitive display; one or more processors; a memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
displaying a message transcript, the message transcript including at least one message from at least a first user;
determining, based at least in-part on the at least one message, a plurality of suggested one or more characters;
displaying, on the touch-sensitive display, the plurality of suggested one or more characters;
detecting an input on the touch-sensitive display;
determining whether the input represents user selection of one of the plurality of suggested one or more characters; and
in accordance with a determination that the input represents user selection of one of the plurality of suggested one or more characters, displaying the selected one of the plurality of suggested one or more characters in the message transcript. | 2,100 |
5,019 | 13,692,884 | 2,128 | Methods and systems for creating and running and industrial control system simulation are described herein. The physical I/O and other modules of the industrial control system may be modeled and specific communication channels may be created by a modeling software module. This may increase the likelihood that the timing of the simulation may be more like real-time operation of the industrial control system. This may enhance the system design and save time of system design and start-up and troubleshooting of the operational industrial control system. | 1. A computer apparatus comprising software that when executed by the computer apparatus directs the apparatus to simulate operation of an industrial system; the software comprising:
simulation configuration software, that when executed by the computer apparatus directs the apparatus to create a simulation of an industrial control system, and a simulation executable file; simulation execution software that when executed by the computer apparatus directs the apparatus to receive the simulation executable file from the simulation creation software, and execute the simulation executable file to run a simulation; communication software that when executed by the computer apparatus directs the apparatus to communicate with the simulation execution software to assist in running the simulation, and to further communicate with at least one industrial control module; and a non-transitory computer readable storage medium having the user simulation configuration software, the simulation execution software, and the communication software stored thereon. 2. The apparatus of claim 1, wherein the simulation configuration software comprises an industrial module modeler software configured to model the at least one industrial control module for the simulation. 3. The apparatus of claim 2, wherein the industrial module modeler software is configured to establish communication links between the simulation and the at least one industrial control module. 4. The apparatus of claim 1, wherein the simulation creation software and/or the simulation execution software is configured to synchronize the timing between the simulation and the at least one industrial control module. 5. The apparatus of claim 1, wherein at least a portion of the simulation configuration software, the simulation execution software, and the communication software is instantiated on a simulation module configured to assist in the running of the simulation. 6. A system for simulation of an industrial automation system, comprising:
a workstation configured to create a simulation of an industrial control system, create a simulation executable file based on the simulation, and execute the simulation executable file to run the simulation; an industrial control system capable of sending and receiving data related to the running simulation on the workstation, and controlling physical industrial control modules within the industrial control system based at least in part on the running simulation; wherein the creating the simulation comprises modeling the industrial control module and creating communication links between the modeled industrial control module and the physical industrial control module. 7. The system of claim 6, wherein the industrial control system comprises one or more physical industrial control modules. 8. The system of claim 7, wherein the creating a simulation of an industrial control system comprises modeling the one or more industrial control modules, and creating communication links between the modeled industrial control module and the physical industrial control module. 9. The system of claim 6, wherein the industrial control system comprises a simulation module configured to assist in the running of the simulation, and configured to send and receive data related to the running simulation. 10. The system of claim 6, further comprising an execution workstation configured to receive the simulation executable file and execute the simulation executable file to run the simulation, and wherein the industrial control system is configured to send and receive data related to the running simulation on the execution workstation. 11. The system of claim 10, wherein the communication between the workstation and executable workstation comprises TCP-type communication. 12. The system of claim 10, wherein the communication between the execution workstation and industrial control system comprises one or more user data protocol-type communication links. 13. The system of claim 10, wherein the workstation and the execution workstation comprise Windows-based operating system. 14. A method for creating a simulation of an industrial automation system comprising:
creating a simulation of an industrial control system at least in part using a simulation creation module on a computer: modeling industrial modules at least in part using the simulation creation module on a computer; creating communication channels between the modeled industrial control module and a physical industrial control module at least in part using a simulation execution module; and synchronizing the timing between the simulation and the physical industrial control module at least in part using the simulation execution module. 15. The method of claim 14, further comprising executing the simulation at least in part using the workstation and the physical industrial control module. 16. The method of claim 14, further comprising an industrial control system, which comprises the physical industrial control module. 17. The method of claim 14, wherein the creating a simulation is accomplished at least in part using C++ programming language. 18. The method of claim 14, wherein the modeling is accomplished at least in part using an industrial module modeler. 19. The method of claim 14, wherein the creating communication channels is accomplished at least in part using an industrial module modeler. 20. The method of claim 14, wherein the creating a simulation is accomplished at least in part using software libraries. | Methods and systems for creating and running and industrial control system simulation are described herein. The physical I/O and other modules of the industrial control system may be modeled and specific communication channels may be created by a modeling software module. This may increase the likelihood that the timing of the simulation may be more like real-time operation of the industrial control system. This may enhance the system design and save time of system design and start-up and troubleshooting of the operational industrial control system.1. A computer apparatus comprising software that when executed by the computer apparatus directs the apparatus to simulate operation of an industrial system; the software comprising:
simulation configuration software, that when executed by the computer apparatus directs the apparatus to create a simulation of an industrial control system, and a simulation executable file; simulation execution software that when executed by the computer apparatus directs the apparatus to receive the simulation executable file from the simulation creation software, and execute the simulation executable file to run a simulation; communication software that when executed by the computer apparatus directs the apparatus to communicate with the simulation execution software to assist in running the simulation, and to further communicate with at least one industrial control module; and a non-transitory computer readable storage medium having the user simulation configuration software, the simulation execution software, and the communication software stored thereon. 2. The apparatus of claim 1, wherein the simulation configuration software comprises an industrial module modeler software configured to model the at least one industrial control module for the simulation. 3. The apparatus of claim 2, wherein the industrial module modeler software is configured to establish communication links between the simulation and the at least one industrial control module. 4. The apparatus of claim 1, wherein the simulation creation software and/or the simulation execution software is configured to synchronize the timing between the simulation and the at least one industrial control module. 5. The apparatus of claim 1, wherein at least a portion of the simulation configuration software, the simulation execution software, and the communication software is instantiated on a simulation module configured to assist in the running of the simulation. 6. A system for simulation of an industrial automation system, comprising:
a workstation configured to create a simulation of an industrial control system, create a simulation executable file based on the simulation, and execute the simulation executable file to run the simulation; an industrial control system capable of sending and receiving data related to the running simulation on the workstation, and controlling physical industrial control modules within the industrial control system based at least in part on the running simulation; wherein the creating the simulation comprises modeling the industrial control module and creating communication links between the modeled industrial control module and the physical industrial control module. 7. The system of claim 6, wherein the industrial control system comprises one or more physical industrial control modules. 8. The system of claim 7, wherein the creating a simulation of an industrial control system comprises modeling the one or more industrial control modules, and creating communication links between the modeled industrial control module and the physical industrial control module. 9. The system of claim 6, wherein the industrial control system comprises a simulation module configured to assist in the running of the simulation, and configured to send and receive data related to the running simulation. 10. The system of claim 6, further comprising an execution workstation configured to receive the simulation executable file and execute the simulation executable file to run the simulation, and wherein the industrial control system is configured to send and receive data related to the running simulation on the execution workstation. 11. The system of claim 10, wherein the communication between the workstation and executable workstation comprises TCP-type communication. 12. The system of claim 10, wherein the communication between the execution workstation and industrial control system comprises one or more user data protocol-type communication links. 13. The system of claim 10, wherein the workstation and the execution workstation comprise Windows-based operating system. 14. A method for creating a simulation of an industrial automation system comprising:
creating a simulation of an industrial control system at least in part using a simulation creation module on a computer: modeling industrial modules at least in part using the simulation creation module on a computer; creating communication channels between the modeled industrial control module and a physical industrial control module at least in part using a simulation execution module; and synchronizing the timing between the simulation and the physical industrial control module at least in part using the simulation execution module. 15. The method of claim 14, further comprising executing the simulation at least in part using the workstation and the physical industrial control module. 16. The method of claim 14, further comprising an industrial control system, which comprises the physical industrial control module. 17. The method of claim 14, wherein the creating a simulation is accomplished at least in part using C++ programming language. 18. The method of claim 14, wherein the modeling is accomplished at least in part using an industrial module modeler. 19. The method of claim 14, wherein the creating communication channels is accomplished at least in part using an industrial module modeler. 20. The method of claim 14, wherein the creating a simulation is accomplished at least in part using software libraries. | 2,100 |
5,020 | 12,976,849 | 2,144 | Techniques to automatically correct or complete text are disclosed. An entered text and a context data indicating a context in which the entered text is used are received. Examples of context data include additional words and/or a phrase or sentence in which the entered text occurs. A replacement candidate to replace the entered text is determined based on the entered text and the context data. | 1. A method of automatically correcting or completing text, comprising:
receiving an entered text and a context data indicating a context in which the entered text is used; and determining based on the entered text and the context data a replacement candidate to replace the entered text. 2. The method of claim 1, wherein the replacement candidate comprises a more correct or complete word or phrase than the entered text. 3. The method of claim 1, wherein the entered text comprises one or more of a string, a word, and a phrase. 4. The method of claim 3, wherein the context data comprises one or more words that occur in a same sentence as the entered text. 5. The method of claim 1, wherein the context data comprises and/or is used to determine one or more features of the entered text. 6. The method of claim 5, wherein the features include one or more of the following: a part of speech, an identification as a named entity, a prefix, a suffix, and capitalization. 7. The method of claim 1, further comprising receiving further context data as additional text is entered and using the further context data to update an evaluation of one or more replacement candidates. 8. The method of claim 1, wherein determining the replacement candidate includes using the context data to evaluate the replacement candidate. 9. The method of claim 1, wherein determining the replacement candidate includes using the context data to assign to the replacement candidate a score indicating a degree of confidence that the replacement candidate should be suggested. 10. The method of claim 9, wherein determining the replacement candidate further includes selecting the replacement candidate based at least in part on a determination that the score exceeds a selection threshold. 11. The method of claim 1, wherein determining the replacement candidate includes determining based at least in part on the context data that the replacement candidate is more likely correct than one or more alternative replacement candidates. 12. The method of claim 1, further comprising using a statistical language model, the entered text, and the context data to determine an expected attribute of the entered text. 13. The method of claim 12, further comprising generating the statistical model. 14. The method of claim 13, wherein generating the statistical model includes augmenting a commercially available annotated corpus with annotated content comprising one or more of blog entries, online comments, comments posted on online social networks, and other user generated online content. 15. A system, comprising:
an input device configured to receive user inputs comprising entered text; and a processor coupled to the input device and configured to:
receive an entered text entered using the input device and a context data is indicating a context in which the entered text is used; and
determine based on the entered text and the context data a replacement candidate to replace the entered text. 16. The system of claim 15, wherein the context data comprises one or more words that occur in a same sentence as the entered text. 17. The system of claim 15, wherein the processor is configured to use the context data to determine an expected attribute of the entered text and to use the expected attribute to evaluate the replacement candidate. 18. The system of claim 15, wherein the processor is configured to update an evaluation of the replacement candidate as additional context data is received. 19. The system of claim 15, wherein the processor is configured to use the context data to assign to the replacement candidate a score indicating a degree of confidence that the replacement candidate should be suggested. 20. A computer program product for automatically correcting or completing text, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving an entered text and a context data indicating a context in which the entered text is used; and determining based on the entered text and the context data a replacement candidate to replace the entered text. | Techniques to automatically correct or complete text are disclosed. An entered text and a context data indicating a context in which the entered text is used are received. Examples of context data include additional words and/or a phrase or sentence in which the entered text occurs. A replacement candidate to replace the entered text is determined based on the entered text and the context data.1. A method of automatically correcting or completing text, comprising:
receiving an entered text and a context data indicating a context in which the entered text is used; and determining based on the entered text and the context data a replacement candidate to replace the entered text. 2. The method of claim 1, wherein the replacement candidate comprises a more correct or complete word or phrase than the entered text. 3. The method of claim 1, wherein the entered text comprises one or more of a string, a word, and a phrase. 4. The method of claim 3, wherein the context data comprises one or more words that occur in a same sentence as the entered text. 5. The method of claim 1, wherein the context data comprises and/or is used to determine one or more features of the entered text. 6. The method of claim 5, wherein the features include one or more of the following: a part of speech, an identification as a named entity, a prefix, a suffix, and capitalization. 7. The method of claim 1, further comprising receiving further context data as additional text is entered and using the further context data to update an evaluation of one or more replacement candidates. 8. The method of claim 1, wherein determining the replacement candidate includes using the context data to evaluate the replacement candidate. 9. The method of claim 1, wherein determining the replacement candidate includes using the context data to assign to the replacement candidate a score indicating a degree of confidence that the replacement candidate should be suggested. 10. The method of claim 9, wherein determining the replacement candidate further includes selecting the replacement candidate based at least in part on a determination that the score exceeds a selection threshold. 11. The method of claim 1, wherein determining the replacement candidate includes determining based at least in part on the context data that the replacement candidate is more likely correct than one or more alternative replacement candidates. 12. The method of claim 1, further comprising using a statistical language model, the entered text, and the context data to determine an expected attribute of the entered text. 13. The method of claim 12, further comprising generating the statistical model. 14. The method of claim 13, wherein generating the statistical model includes augmenting a commercially available annotated corpus with annotated content comprising one or more of blog entries, online comments, comments posted on online social networks, and other user generated online content. 15. A system, comprising:
an input device configured to receive user inputs comprising entered text; and a processor coupled to the input device and configured to:
receive an entered text entered using the input device and a context data is indicating a context in which the entered text is used; and
determine based on the entered text and the context data a replacement candidate to replace the entered text. 16. The system of claim 15, wherein the context data comprises one or more words that occur in a same sentence as the entered text. 17. The system of claim 15, wherein the processor is configured to use the context data to determine an expected attribute of the entered text and to use the expected attribute to evaluate the replacement candidate. 18. The system of claim 15, wherein the processor is configured to update an evaluation of the replacement candidate as additional context data is received. 19. The system of claim 15, wherein the processor is configured to use the context data to assign to the replacement candidate a score indicating a degree of confidence that the replacement candidate should be suggested. 20. A computer program product for automatically correcting or completing text, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving an entered text and a context data indicating a context in which the entered text is used; and determining based on the entered text and the context data a replacement candidate to replace the entered text. | 2,100 |
5,021 | 13,902,677 | 2,157 | A knowledge base provides a mechanism for storing an organization's data in a way that represents the semantics of the data being stored. The knowledge base may include a knowledge graph that represents relationships between the different classes of data comprising the organization's data. Data that is loaded into the knowledge graph may be stored in data tables associated with the knowledge graph, and cross referenced with node identifiers that contain the data. Searching the knowledge base includes parsing a search input to identify terms in the search input, and mapping the terms to nodes in the knowledge base using the cross referenced information. The relationships among the identified nodes are used to identify a suitable application for processing the search. | 1. A computer-implemented method for storing data comprising steps of:
receiving a plurality of data to be stored; accessing graph information representative of a graph comprising a plurality of first-level nodes, and including information about properties associated with each of the first-level nodes; identifying at least one first-level node in the graph using the received data and the graph information; identifying a database table that corresponds to the identified first-level node, the database table comprising columns corresponding to some of the properties associated with the identified first-level node; and storing some of the received data in both the identified database table and in one or more second-level nodes of the graph that are linked to the identified first-level node. 2. The computer-implemented method of claim 1 wherein the graph further comprises a data source node that is linked to the identified first-level node and corresponds to the database table, the data source node storing parameters of the database table. 3. The computer-implemented method of claim 1 wherein identifying a database table includes creating the database table. 4. The computer-implemented method of claim 1 further comprising storing some of the data values that comprise the received data in an index. 5. The computer-implemented method of claim 1 wherein the graph information further comprises link information representative of links between the plurality of first-level nodes that comprise the graph, the method further comprising creating links between second-level nodes of the graph based on the links between the plurality of first-level nodes. 6. The computer-implemented method of claim 1 wherein the first-level nodes represent classes of data, wherein the second-level nodes represent instances of the classes of data. 7. The computer-implemented method of claim 1 wherein the identified first-level node is identified based on data field names associated with data that comprise the received data. 8. The computer-implemented method of claim 7 wherein the identified first-level node is identified based further on a sampling of the data that comprise the received data. 9. A method for storing data comprising operating a computer system to perform steps of:
receiving enterprise data comprising data collected from one or more business systems in an enterprise; accessing a graph; using the enterprise data to identify at least one first-level node, from among a plurality of nodes comprising the graph, that corresponds to at least some of the enterprise data; using the enterprise data to identify one or more properties, from among a plurality of properties associated with the first-level node, that correspond to one or more properties or attributes of the enterprise data; identifying a database table that corresponds to the first-level node, the database table comprising a plurality of columns, some of the columns corresponding to some of the properties of the first-level node; and storing at least some of the enterprise data including:
storing some of the enterprise data in instance nodes that are linked to the first-level node; and
storing some of the enterprise data in the database table. 10. The method of claim 9 wherein some nodes in the graph have links to other nodes in the graph, the method further comprising linking instance nodes according to links between respective first-level nodes to which the instance nodes are linked. 11. The method of claim 9 further comprising storing properties of the database table in a node that is linked to the first-level node. 12. The method of claim 11 wherein the properties of the database table include a name of the database table and a mapping between column names of the database table and properties of the first-level node. 13. The method of claim 9 wherein the enterprise data is organized as rows of data and columns of data, wherein the first-level node is identified based at least on column names associated with the columns of data. 14. The method of claim 13 wherein the first-level node is identified based further on a sampling of the columns of data. 15. The method of claim 9 wherein the storing further includes indexing some the enterprise data in a search index. 16. The method of claim 9 further comprising using the enterprise data to identify at least another first-level node, from among the plurality of nodes comprising the graph, whereby first data from the enterprise data correspond to the first-level node and second data from the enterprise data correspond to the other first-level node. 17. A computer system comprising:
a data processing sub-system; a data storage sub-system having stored therein program code, which, when executed by the data processing sub-system, causes the data processing sub-system to:
receive a plurality of data to be stored;
access graph information representative of a graph comprising a plurality of first-level nodes, and including information about properties associated with each of the first-level nodes;
identify at least one first-level node in the graph using the received data and the graph information;
identify a database table that corresponds to the identified first-level node, the database table comprising columns corresponding to some of the properties associated with the identified first-level node; and
store some of the received data in both the identified database table and in one or more second-level nodes of the graph that are linked to the identified first-level node. 18. The computer system of claim 17 wherein the first-level nodes represent classes of data, wherein the second-level nodes represent instances of the classes of data. 19. The computer system of claim 17 wherein the program code, which, when executed by the data processing sub-system, further causes the data processing sub-system to index at least some the enterprise data in a search index. 20. The computer system of claim 17 wherein the plurality of data to be stored includes computed data and publicly accessible data. | A knowledge base provides a mechanism for storing an organization's data in a way that represents the semantics of the data being stored. The knowledge base may include a knowledge graph that represents relationships between the different classes of data comprising the organization's data. Data that is loaded into the knowledge graph may be stored in data tables associated with the knowledge graph, and cross referenced with node identifiers that contain the data. Searching the knowledge base includes parsing a search input to identify terms in the search input, and mapping the terms to nodes in the knowledge base using the cross referenced information. The relationships among the identified nodes are used to identify a suitable application for processing the search.1. A computer-implemented method for storing data comprising steps of:
receiving a plurality of data to be stored; accessing graph information representative of a graph comprising a plurality of first-level nodes, and including information about properties associated with each of the first-level nodes; identifying at least one first-level node in the graph using the received data and the graph information; identifying a database table that corresponds to the identified first-level node, the database table comprising columns corresponding to some of the properties associated with the identified first-level node; and storing some of the received data in both the identified database table and in one or more second-level nodes of the graph that are linked to the identified first-level node. 2. The computer-implemented method of claim 1 wherein the graph further comprises a data source node that is linked to the identified first-level node and corresponds to the database table, the data source node storing parameters of the database table. 3. The computer-implemented method of claim 1 wherein identifying a database table includes creating the database table. 4. The computer-implemented method of claim 1 further comprising storing some of the data values that comprise the received data in an index. 5. The computer-implemented method of claim 1 wherein the graph information further comprises link information representative of links between the plurality of first-level nodes that comprise the graph, the method further comprising creating links between second-level nodes of the graph based on the links between the plurality of first-level nodes. 6. The computer-implemented method of claim 1 wherein the first-level nodes represent classes of data, wherein the second-level nodes represent instances of the classes of data. 7. The computer-implemented method of claim 1 wherein the identified first-level node is identified based on data field names associated with data that comprise the received data. 8. The computer-implemented method of claim 7 wherein the identified first-level node is identified based further on a sampling of the data that comprise the received data. 9. A method for storing data comprising operating a computer system to perform steps of:
receiving enterprise data comprising data collected from one or more business systems in an enterprise; accessing a graph; using the enterprise data to identify at least one first-level node, from among a plurality of nodes comprising the graph, that corresponds to at least some of the enterprise data; using the enterprise data to identify one or more properties, from among a plurality of properties associated with the first-level node, that correspond to one or more properties or attributes of the enterprise data; identifying a database table that corresponds to the first-level node, the database table comprising a plurality of columns, some of the columns corresponding to some of the properties of the first-level node; and storing at least some of the enterprise data including:
storing some of the enterprise data in instance nodes that are linked to the first-level node; and
storing some of the enterprise data in the database table. 10. The method of claim 9 wherein some nodes in the graph have links to other nodes in the graph, the method further comprising linking instance nodes according to links between respective first-level nodes to which the instance nodes are linked. 11. The method of claim 9 further comprising storing properties of the database table in a node that is linked to the first-level node. 12. The method of claim 11 wherein the properties of the database table include a name of the database table and a mapping between column names of the database table and properties of the first-level node. 13. The method of claim 9 wherein the enterprise data is organized as rows of data and columns of data, wherein the first-level node is identified based at least on column names associated with the columns of data. 14. The method of claim 13 wherein the first-level node is identified based further on a sampling of the columns of data. 15. The method of claim 9 wherein the storing further includes indexing some the enterprise data in a search index. 16. The method of claim 9 further comprising using the enterprise data to identify at least another first-level node, from among the plurality of nodes comprising the graph, whereby first data from the enterprise data correspond to the first-level node and second data from the enterprise data correspond to the other first-level node. 17. A computer system comprising:
a data processing sub-system; a data storage sub-system having stored therein program code, which, when executed by the data processing sub-system, causes the data processing sub-system to:
receive a plurality of data to be stored;
access graph information representative of a graph comprising a plurality of first-level nodes, and including information about properties associated with each of the first-level nodes;
identify at least one first-level node in the graph using the received data and the graph information;
identify a database table that corresponds to the identified first-level node, the database table comprising columns corresponding to some of the properties associated with the identified first-level node; and
store some of the received data in both the identified database table and in one or more second-level nodes of the graph that are linked to the identified first-level node. 18. The computer system of claim 17 wherein the first-level nodes represent classes of data, wherein the second-level nodes represent instances of the classes of data. 19. The computer system of claim 17 wherein the program code, which, when executed by the data processing sub-system, further causes the data processing sub-system to index at least some the enterprise data in a search index. 20. The computer system of claim 17 wherein the plurality of data to be stored includes computed data and publicly accessible data. | 2,100 |
5,022 | 15,167,238 | 2,121 | Systems and methods are included for adjusting a set of predicted future data points for a time series data set including a receiver for receiving a time series data set. One or more processors and one or more non-transitory computer readable storage mediums containing instructions may be utilized. A count series forecasting engine, utilizing the one or more processors, generates a set of counts corresponding to discrete values of the time series data set. An optimal discrete probability distribution for the set of counts is selected. A set of parameters are generated for the optimal discrete probability distribution. A statistical model is selected to generate a set of predicted future data points. The set of predicted future data points are adjusted using the generated set of parameters for the optimal discrete probability distribution in order to provide greater accuracy with respect to predictions of future data points. | 1. A computer program product, tangibly embodied in a non-transitory machine-readable storage medium, including instructions operable to cause a data processing apparatus to perform operations including:
receiving a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values; generating a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set; automatically selecting an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion; generating a set of parameters corresponding to the optimal discrete probability distribution; selecting a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion; generating a set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model; adjusting the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution; and predicting a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set. 2. The computer program product of claim 1, wherein a discrete probability distribution outputs a corresponding non-negative value for each value in a range of the discrete probability distribution, and wherein a set of candidate discrete probability distributions includes at least one of a binomial probability distribution, a zero-modified negative binomial distribution, a zero-modified binomial probability distribution, a geometric probability distribution, a zero-modified geometric probability distribution, a Poisson probability distribution, a zero-modified Poisson probability distribution, a log series distribution, or a negative binomial probability distribution. 3. The computer program product of claim 1, wherein the statistical model is configured to utilize the plurality of data points as continuous variables. 4. The computer program product of claim 1, wherein the plurality of data points correspond to a plurality of distinct values, the instructions further comprising providing the predicted future data point to a graphical user interface. 5. The computer program product of claim 1, wherein the time series data set includes greater than a threshold number of data points that correspond to a zero value, and wherein the set of statistical models includes at least one time series model comprising an exponential smoothing model. 6. The computer program product of claim 1, wherein the data processing apparatus comprises an event stream processing engine. 7. The computer program product of claim 1, wherein the data input is received from an edge computing device. 8. The computer program product of claim 1, wherein the data processing apparatus is configured to receive the data input from a sensor device. 9. The computer program product of claim 1, wherein the operations further include:
receiving the set of discrete probability distributions and the selection criterion from a device, wherein the set of parameters includes at least one of a standard error, an upper limit corresponding to a confidence range, and a lower limit correspond to the confidence range. 10. The computer program product of claim 1, where the data processing apparatus is a component of a home appliance device, an office-related device, a media-playback device, a lighting device, a security system device, a networked energy grid device, or an automobile device. 11. The computer program product of claim 1, wherein selecting the statistical model for the time series data set includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 12. The computer program product of claim 11, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 13. The computer program product of claim 11, wherein automatically selecting the optimal discrete probability distribution for the set of counts includes:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 14. The computer program product of claim 13, wherein the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion. 15. The computer program product of claim 13, wherein automatically selecting the optimal discrete probability distribution for the set of counts using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the optimal discrete probability distribution corresponds to the optimal error measurement. 16. The computer program product of claim 1, wherein the time series data set includes greater than a threshold number of data points that correspond to a zero value, and wherein the set of statistical models includes at least one time series model comprising an exponential smoothing model. 17. A device comprising:
a sensor; a connection component for a connection to a network; an event stream processor; and a non-transitory machine-readable storage medium connected to the event stream processor and the sensor, the non-transitory machine-readable storage medium including instructions operable to a data processing apparatus to perform operations including:
receiving, from the sensor or the connection component, a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values;
generating, with the event stream processor, a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set;
automatically selecting, with the event stream processor, an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion;
generating, with the event stream processor, a set of parameters corresponding to the optimal discrete probability distribution;
selecting, with the event stream processor, a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion;
generating, with the event stream processor, a set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model;
adjusting, with the event stream processor, the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution;
predicting, with the event stream processor, a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set; and
providing, to the sensor or the connection component, the predicted future data point. 18. The device of claim 17, wherein the connection component includes an intra-network connection component or an internetwork connection component, and wherein the sensor is operable to sense environmental data. 19. The device of claim 17, wherein selecting the statistical model for the time series data set further includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 20. The device of claim 18, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 21. The device of claim 19, wherein automatically selecting the optimal discrete probability distribution for the set of counts includes:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 22. The device of claim 19, wherein:
the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion, automatically selecting the optimal discrete probability distribution for the set of counts using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and the optimal discrete probability distribution corresponds to the optimal error measurement. 23. A computer-implemented method for adjusting a set of predicted future data points for a time series data set, comprising:
receiving a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values; generating, by a data processing apparatus, a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set; automatically selecting, by the data processing apparatus, an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion; generating, by the data processing apparatus, a set of parameters corresponding to the optimal discrete probability distribution; selecting, by the data processing apparatus, a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion; generating, by the data processing apparatus, the set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model; adjusting, by the data processing apparatus, the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution; and predicting, by the data processing apparatus, a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set, wherein the data processing apparatus is operable with a count series forecasting engine in a computing environment. 24. The computer-implemented method of claim 23, wherein a discrete probability distribution outputs a corresponding non-negative value for each value in a range of the discrete probability distribution, and wherein a set of candidate discrete probability distributions includes at least one of a binomial probability distribution, a zero-modified negative binomial distribution, a zero-modified binomial probability distribution, a geometric probability distribution, a zero-modified geometric probability distribution, a Poisson probability distribution, a zero-modified Poisson probability distribution, a log series distribution, or a negative binomial probability distribution. 25. The computer-implemented method of claim 23, wherein the statistical model uses the plurality of data points as continuous variables. 26. The computer-implemented method of claim 23, wherein the plurality of data points correspond to a plurality of distinct values. 27. The computer-implemented method of claim 23, wherein selecting the statistical model for the time series data set includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 28. The computer-implemented method of claim 27, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 29. The computer-implemented method of claim 27, wherein automatically selecting the optimal discrete probability distribution for the set of counts further comprises:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 30. The computer-implemented method of claim 29, wherein the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion, and wherein the data processing apparatus comprises an edge computing device in the computing environment. | Systems and methods are included for adjusting a set of predicted future data points for a time series data set including a receiver for receiving a time series data set. One or more processors and one or more non-transitory computer readable storage mediums containing instructions may be utilized. A count series forecasting engine, utilizing the one or more processors, generates a set of counts corresponding to discrete values of the time series data set. An optimal discrete probability distribution for the set of counts is selected. A set of parameters are generated for the optimal discrete probability distribution. A statistical model is selected to generate a set of predicted future data points. The set of predicted future data points are adjusted using the generated set of parameters for the optimal discrete probability distribution in order to provide greater accuracy with respect to predictions of future data points.1. A computer program product, tangibly embodied in a non-transitory machine-readable storage medium, including instructions operable to cause a data processing apparatus to perform operations including:
receiving a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values; generating a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set; automatically selecting an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion; generating a set of parameters corresponding to the optimal discrete probability distribution; selecting a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion; generating a set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model; adjusting the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution; and predicting a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set. 2. The computer program product of claim 1, wherein a discrete probability distribution outputs a corresponding non-negative value for each value in a range of the discrete probability distribution, and wherein a set of candidate discrete probability distributions includes at least one of a binomial probability distribution, a zero-modified negative binomial distribution, a zero-modified binomial probability distribution, a geometric probability distribution, a zero-modified geometric probability distribution, a Poisson probability distribution, a zero-modified Poisson probability distribution, a log series distribution, or a negative binomial probability distribution. 3. The computer program product of claim 1, wherein the statistical model is configured to utilize the plurality of data points as continuous variables. 4. The computer program product of claim 1, wherein the plurality of data points correspond to a plurality of distinct values, the instructions further comprising providing the predicted future data point to a graphical user interface. 5. The computer program product of claim 1, wherein the time series data set includes greater than a threshold number of data points that correspond to a zero value, and wherein the set of statistical models includes at least one time series model comprising an exponential smoothing model. 6. The computer program product of claim 1, wherein the data processing apparatus comprises an event stream processing engine. 7. The computer program product of claim 1, wherein the data input is received from an edge computing device. 8. The computer program product of claim 1, wherein the data processing apparatus is configured to receive the data input from a sensor device. 9. The computer program product of claim 1, wherein the operations further include:
receiving the set of discrete probability distributions and the selection criterion from a device, wherein the set of parameters includes at least one of a standard error, an upper limit corresponding to a confidence range, and a lower limit correspond to the confidence range. 10. The computer program product of claim 1, where the data processing apparatus is a component of a home appliance device, an office-related device, a media-playback device, a lighting device, a security system device, a networked energy grid device, or an automobile device. 11. The computer program product of claim 1, wherein selecting the statistical model for the time series data set includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 12. The computer program product of claim 11, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 13. The computer program product of claim 11, wherein automatically selecting the optimal discrete probability distribution for the set of counts includes:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 14. The computer program product of claim 13, wherein the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion. 15. The computer program product of claim 13, wherein automatically selecting the optimal discrete probability distribution for the set of counts using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the optimal discrete probability distribution corresponds to the optimal error measurement. 16. The computer program product of claim 1, wherein the time series data set includes greater than a threshold number of data points that correspond to a zero value, and wherein the set of statistical models includes at least one time series model comprising an exponential smoothing model. 17. A device comprising:
a sensor; a connection component for a connection to a network; an event stream processor; and a non-transitory machine-readable storage medium connected to the event stream processor and the sensor, the non-transitory machine-readable storage medium including instructions operable to a data processing apparatus to perform operations including:
receiving, from the sensor or the connection component, a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values;
generating, with the event stream processor, a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set;
automatically selecting, with the event stream processor, an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion;
generating, with the event stream processor, a set of parameters corresponding to the optimal discrete probability distribution;
selecting, with the event stream processor, a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion;
generating, with the event stream processor, a set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model;
adjusting, with the event stream processor, the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution;
predicting, with the event stream processor, a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set; and
providing, to the sensor or the connection component, the predicted future data point. 18. The device of claim 17, wherein the connection component includes an intra-network connection component or an internetwork connection component, and wherein the sensor is operable to sense environmental data. 19. The device of claim 17, wherein selecting the statistical model for the time series data set further includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 20. The device of claim 18, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 21. The device of claim 19, wherein automatically selecting the optimal discrete probability distribution for the set of counts includes:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 22. The device of claim 19, wherein:
the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion, automatically selecting the optimal discrete probability distribution for the set of counts using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and the optimal discrete probability distribution corresponds to the optimal error measurement. 23. A computer-implemented method for adjusting a set of predicted future data points for a time series data set, comprising:
receiving a time series data set, wherein the time series data set includes a plurality of data points that correspond to a plurality of discrete values; generating, by a data processing apparatus, a set of counts for the time series data set by analyzing the time series data set, wherein a count corresponds to a number of instances of a particular discrete value in the time series data set; automatically selecting, by the data processing apparatus, an optimal discrete probability distribution for the set of counts from a set of discrete probability distributions based on a selection criterion; generating, by the data processing apparatus, a set of parameters corresponding to the optimal discrete probability distribution; selecting, by the data processing apparatus, a statistical model for the time series data set, wherein selecting the statistical model includes using a set of statistical models and the selection criterion; generating, by the data processing apparatus, the set of predicted future data points for the time series data set, wherein generating the set of predicted future data points includes using the selected statistical model; adjusting, by the data processing apparatus, the set of predicted future data points for the time series data set, wherein adjusting the set of predicted future data points includes using the set of parameters corresponding to the optimal discrete probability distribution; and predicting, by the data processing apparatus, a future data point based on the adjusted set of predicted future data points and data input associated with the time series data set, wherein the data processing apparatus is operable with a count series forecasting engine in a computing environment. 24. The computer-implemented method of claim 23, wherein a discrete probability distribution outputs a corresponding non-negative value for each value in a range of the discrete probability distribution, and wherein a set of candidate discrete probability distributions includes at least one of a binomial probability distribution, a zero-modified negative binomial distribution, a zero-modified binomial probability distribution, a geometric probability distribution, a zero-modified geometric probability distribution, a Poisson probability distribution, a zero-modified Poisson probability distribution, a log series distribution, or a negative binomial probability distribution. 25. The computer-implemented method of claim 23, wherein the statistical model uses the plurality of data points as continuous variables. 26. The computer-implemented method of claim 23, wherein the plurality of data points correspond to a plurality of distinct values. 27. The computer-implemented method of claim 23, wherein selecting the statistical model for the time series data set includes:
receiving indication of the selection criterion; generating the set of predicted future data points for the time series data set using a plurality of statistical models; and generating, by the data processing apparatus, a plurality of error measurements corresponding to each of the plurality of statistical models. 28. The computer-implemented method of claim 27, wherein selecting the statistical model for the time series data set using the plurality of error measurements includes selecting an optimal error measurement of the plurality of error measurements, and wherein the selected statistical model corresponds to the optimal error measurement. 29. The computer-implemented method of claim 27, wherein automatically selecting the optimal discrete probability distribution for the set of counts further comprises:
receiving, by the data processing apparatus, indication of selection of the selection criterion; generating, by the data processing apparatus, a set of candidate discrete probability distributions for the set of counts using a set of discrete probability distribution algorithms; and generating a plurality of error measurements corresponding to each of the set of candidate discrete probability distributions. 30. The computer-implemented method of claim 29, wherein the received selection criterion includes one of an Akaike information criterion, a weighted least-squares criterion, a log-likelihood criterion, or a Bayesian information criterion, and wherein the data processing apparatus comprises an edge computing device in the computing environment. | 2,100 |
5,023 | 14,748,515 | 2,196 | Systems and methods may provide for making a power efficiency determination at runtime based on one or more runtime usage notifications and scheduling a workload for execution on a hardware accelerator if the power efficiency determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor. Additionally, the workload may be scheduled for execution on the host processor if the power efficiency determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. In one example, making the power efficiency determination includes applying one or more configurable rules to at least one of the one or more runtime usage notifications. | 1. A system comprising:
a hardware accelerator; a host processor; and logic, implemented at least partly in one or more of configurable logic or fixed functionality logic hardware, to:
make a power consumption determination at runtime based on one or more runtime usage notifications,
schedule a workload for execution on the hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on the host processor, and
schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 2. The system of claim 1, wherein the logic is to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 3. The system of claim 2, wherein the logic is to configure at least one of the one or more configurable rules at runtime. 4. The system of claim 1, wherein the logic is to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 5. The system of claim 1, wherein the workload is to include an audio playback workload. 6. The system of claim 1, wherein the hardware accelerator includes one or more of an audio digital signal processor, a sensor or a graphics accelerator. 7. An apparatus comprising:
logic, implemented at least partly in one or more of configurable logic or fixed functionality logic hardware, to:
make a power consumption determination at runtime based on one or more runtime usage notifications;
schedule a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and
schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 8. The apparatus of claim 7, wherein the logic is to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 9. The apparatus of claim 8, wherein the logic is to configure at least one of the one or more configurable rules at runtime. 10. The apparatus of claim 7, wherein the logic is to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 11. The apparatus of claim 7, wherein the workload is to include an audio playback workload. 12. The apparatus of claim 7, wherein the hardware accelerator is to include one or more of an audio digital signal processor, a sensor or a graphics accelerator. 13. A method comprising:
making a power consumption determination at runtime based on one or more runtime usage notifications; scheduling a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and scheduling the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 14. The method of claim 13, wherein making the power consumption determination includes applying one or more configurable rules to at least one of the one or more runtime usage notifications. 15. The method of claim 14, further including configuring at least one of the one or more configurable rules at runtime. 16. The method of claim 13, further including registering with a power hardware access layer for receipt of the one or more runtime usage notifications, wherein the one or more usage notifications indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 17. The method of claim 13, wherein the workload includes an audio playback workload. 18. The method of claim 13, wherein the hardware accelerator includes one or more of an audio digital signal processor, a sensor or a graphics accelerator. 19. At least one non-transitory computer readable storage medium comprising a set of instructions, which when executed by a computing device, cause the computing device to:
make a power consumption determination at runtime based on one or more runtime usage notifications; schedule a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 20. The at least one non-transitory computer readable storage medium of claim 19, wherein the instructions, when executed, cause a computing device to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 21. The at least one non-transitory computer readable storage medium of claim 20, wherein the instructions, when executed, cause a computing device to configure at least one of the one or more configurable rules at runtime. 22. The at least one non-transitory computer readable storage medium of claim 19, wherein the instructions, when executed, cause a computing device to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 23. The at least one non-transitory computer readable storage medium of claim 19, wherein the workload is to include an audio playback workload. 24. The at least one non-transitory computer readable storage medium of claim 19, wherein the hardware accelerator is to include one or more of an audio digital signal processor, a sensor or a graphics accelerator. | Systems and methods may provide for making a power efficiency determination at runtime based on one or more runtime usage notifications and scheduling a workload for execution on a hardware accelerator if the power efficiency determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor. Additionally, the workload may be scheduled for execution on the host processor if the power efficiency determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. In one example, making the power efficiency determination includes applying one or more configurable rules to at least one of the one or more runtime usage notifications.1. A system comprising:
a hardware accelerator; a host processor; and logic, implemented at least partly in one or more of configurable logic or fixed functionality logic hardware, to:
make a power consumption determination at runtime based on one or more runtime usage notifications,
schedule a workload for execution on the hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on the host processor, and
schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 2. The system of claim 1, wherein the logic is to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 3. The system of claim 2, wherein the logic is to configure at least one of the one or more configurable rules at runtime. 4. The system of claim 1, wherein the logic is to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 5. The system of claim 1, wherein the workload is to include an audio playback workload. 6. The system of claim 1, wherein the hardware accelerator includes one or more of an audio digital signal processor, a sensor or a graphics accelerator. 7. An apparatus comprising:
logic, implemented at least partly in one or more of configurable logic or fixed functionality logic hardware, to:
make a power consumption determination at runtime based on one or more runtime usage notifications;
schedule a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and
schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 8. The apparatus of claim 7, wherein the logic is to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 9. The apparatus of claim 8, wherein the logic is to configure at least one of the one or more configurable rules at runtime. 10. The apparatus of claim 7, wherein the logic is to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 11. The apparatus of claim 7, wherein the workload is to include an audio playback workload. 12. The apparatus of claim 7, wherein the hardware accelerator is to include one or more of an audio digital signal processor, a sensor or a graphics accelerator. 13. A method comprising:
making a power consumption determination at runtime based on one or more runtime usage notifications; scheduling a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and scheduling the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 14. The method of claim 13, wherein making the power consumption determination includes applying one or more configurable rules to at least one of the one or more runtime usage notifications. 15. The method of claim 14, further including configuring at least one of the one or more configurable rules at runtime. 16. The method of claim 13, further including registering with a power hardware access layer for receipt of the one or more runtime usage notifications, wherein the one or more usage notifications indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 17. The method of claim 13, wherein the workload includes an audio playback workload. 18. The method of claim 13, wherein the hardware accelerator includes one or more of an audio digital signal processor, a sensor or a graphics accelerator. 19. At least one non-transitory computer readable storage medium comprising a set of instructions, which when executed by a computing device, cause the computing device to:
make a power consumption determination at runtime based on one or more runtime usage notifications; schedule a workload for execution on a hardware accelerator if the power consumption determination indicates that execution of the workload on the hardware accelerator will be more efficient than execution of the workload on a host processor; and schedule the workload for execution on the host processor if the power consumption determination indicates that execution of the workload on the host processor will be more efficient than execution of the workload on the hardware accelerator. 20. The at least one non-transitory computer readable storage medium of claim 19, wherein the instructions, when executed, cause a computing device to apply one or more configurable rules to at least one of the one or more runtime usage notifications. 21. The at least one non-transitory computer readable storage medium of claim 20, wherein the instructions, when executed, cause a computing device to configure at least one of the one or more configurable rules at runtime. 22. The at least one non-transitory computer readable storage medium of claim 19, wherein the instructions, when executed, cause a computing device to register with a power hardware access layer for receipt of the one or more runtime usage notifications, and wherein the one or more usage notifications are to indicate one or more of user interaction activity, video encoding activity, video decoding activity, web browsing activity or touch boost activity. 23. The at least one non-transitory computer readable storage medium of claim 19, wherein the workload is to include an audio playback workload. 24. The at least one non-transitory computer readable storage medium of claim 19, wherein the hardware accelerator is to include one or more of an audio digital signal processor, a sensor or a graphics accelerator. | 2,100 |
5,024 | 14,172,512 | 2,198 | Methods and arrangements for discerning collective interests among communities. A contemplated method includes accepting input comprising: a population of entities, a collection of objects and/or topics, connectivity information among the population of entities, and data relative to an expression of interest of each of the entities in the objects and/or topics; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; associating, with each of the entities, the data relative to an expression of interest in the objects and/or topics; defining, relative to the social network graph, separate parameters for social connectivity and collective interests; defining a relative importance parameter for social connectivity and collective interests; defining an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and discerning at least one collective interest-based social community via optimizing the objective function. Other variants and embodiments are broadly contemplated herein. | 1. A method of discerning collective interest-based social communities, said method comprising:
accepting input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; defining, relative to the social network graph, separate parameters for social connectivity and collective interests; defining a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; defining an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and discerning at least one collective interest-based social community via optimizing the objective function. 2. The method according to claim 1, wherein the collective interest parameter relates to aggregate interests of a group of nodes in the social network graph in the objects and/or topics, and captures a preference of the group of nodes for one or more of the objects and/or topics. 3. The method according to claim 2, wherein the relative importance parameter governs a trade-off between social connectivity and collective interests. 4. The method according to claim 3, wherein the objective function comprises a social connectivity function which relates to a quality of partitioning of the nodes of the network into groups. 5. The method according to claim 2, wherein a value of the collective interest function is (i) higher if the group of nodes shows preference for a smaller number of objects and/or topics and/or (ii) lower if the group of nodes shows uniform preference for a larger number of objects and/or topics. 6. The method according to claim 2, wherein:
the collective interest function represents a differentiation of interests of the group of nodes relative to another, reference group of entities; and a value of the collective interest function is (i) higher if the group of nodes shows a different preference for one or more objects and/or topics as compared to the reference group, and/or (ii) lower if the group of nodes shows similar preference for one or more objects and/or topics as compared to the reference group. 7. The method according to claim 6, wherein the reference group comprises the entire population of the entities. 8. The method according to claim 2, wherein:
the collective interest function represents a uniformity of the interests of the group of nodes in the objects and/or topics; and a value of the collective interest function is (i) higher if the group of nodes shows similar preference for a large number of objects and/or topics, and/or (ii) lower if the group of nodes shows a marked preference for a smaller number of objects and/or topics. 9. The method according to claim 1, wherein said optimizing of the objective function comprises:
for each edge present in the social network graph, evaluating a gain from combining the pair of nodes defining the edge; determining a maximum gain from said evaluating, and designating an associated edge; combining the pair of nodes of the associated edge into a single community if the maximum gain is positive and above a predetermined threshold; and repeating said steps of evaluating, determining a maximum gain, and combining, until there is no positive maximum gain above the predetermined threshold. 10. The method, according to claim 1, wherein said optimizing comprises:
initializing each node in the social network graph as belonging to separate communities; for each node, evaluating whether there is an increase in the value of the objective function value by moving the node from its present community to a different community, the different community including at least one neighbor node; determining the maximum increase from said evaluating step, and designating an associated node; moving the associated node to its different community including at least one neighbor node, only if the maximum increase is positive and above a predetermined threshold; repeating said steps of evaluating, determining a maximum increase, and moving, until there is no positive maximum increase above the predetermined threshold; with respect to each community now defined, merging all nodes of the community into a single new node; establishing a super graph via consolidating edges between the new nodes; and repeating said steps of evaluating, determining a maximum increase, moving, repeating, and establishing a super graph, until no nodes can be merged any further. 11. An apparatus for discerning collective interest-based social communities, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to accept input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; computer readable program code configured to construct a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; computer readable program code configured to define, relative to the social network graph, separate parameters for social connectivity and collective interests; computer readable program code configured to define a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; computer readable program code configured to define an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and computer readable program code configured to discern at least one collective interest-based social community via optimizing the objective function. 12. A computer program product for discerning collective interest-based social communities, said apparatus comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to accept input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; computer readable program code configured to construct a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; computer readable program code configured to define, relative to the social network graph, separate parameters for social connectivity and collective interests; computer readable program code configured to define a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; computer readable program code configured to define an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and computer readable program code configured to discern at least one collective interest-based social community via optimizing the objective function. 13. The computer program product according to claim 12, wherein the collective interest parameter relates to aggregate interests of a group of nodes in the social network graph in the objects and/or topics, and captures a preference of the group of nodes for one or more of the objects and/or topics. 14. The computer program product according to claim 13, wherein the relative importance parameter governs a trade-off between social connectivity and collective interests. 15. The computer program product according to claim 14, wherein the objective function comprises a social connectivity function which relates to a quality of partitioning of the nodes of the network into groups. 16. The computer program product according to claim 13, wherein a value of the collective interest function is (i) higher if the group of nodes shows preference for a smaller number of objects and/or topics and (ii) lower if the group of nodes shows uniform preference for a larger number of objects and/or topics. 17. The computer program product according to claim 13, wherein:
the collective interest function represents a differentiation of interests of the group of nodes relative to another, reference group of entities; and a value of the collective interest function is (i) higher if the group of nodes shows a different preference for one or more objects and/or topics as compared to the reference group, and/or (ii) lower if the group of nodes shows similar preference for one or more objects and/or topics as compared to the reference group. 18. The computer program product according to claim 17, wherein the reference group comprises the entire population of the entities. 19. The computer program product according to claim 13, wherein:
the collective interest function represents a uniformity of the interests of the group of nodes in the objects and/or topics; and a value of the collective interest function is (i) higher if the group of nodes shows similar preference for a large number of objects and/or topics, and/or (ii) lower if the group of nodes shows a marked preference for a smaller number of objects and/or topics. 20. A method comprising:
input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; defining, relative to the social network graph, separate parameters for social connectivity and collective interests, the collective interest parameter relating to aggregate interests of a group of nodes in the social network graph in the objects and/or topics; defining a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; defining an objective function based on the social connectivity parameter, the collective interests parameter the relative importance parameter, and a social connectivity function which captures a quality of partitioning of the nodes of the network into groups; and discerning at least one collective interest-based social community via optimizing the objective function; said optimizing of the objective function comprising: for each edge present in the social network graph, evaluating a gain from combining the pair of nodes defining the edge; determining a maximum gain from said evaluating, and designating an associated edge; combining the pair of nodes of the associated edge into a single community if the maximum gain is positive and above a predetermined threshold; and repeating said steps of evaluating, determining a maximum gain and combining until there is no positive maximum gain above the predetermined threshold. | Methods and arrangements for discerning collective interests among communities. A contemplated method includes accepting input comprising: a population of entities, a collection of objects and/or topics, connectivity information among the population of entities, and data relative to an expression of interest of each of the entities in the objects and/or topics; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; associating, with each of the entities, the data relative to an expression of interest in the objects and/or topics; defining, relative to the social network graph, separate parameters for social connectivity and collective interests; defining a relative importance parameter for social connectivity and collective interests; defining an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and discerning at least one collective interest-based social community via optimizing the objective function. Other variants and embodiments are broadly contemplated herein.1. A method of discerning collective interest-based social communities, said method comprising:
accepting input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; defining, relative to the social network graph, separate parameters for social connectivity and collective interests; defining a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; defining an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and discerning at least one collective interest-based social community via optimizing the objective function. 2. The method according to claim 1, wherein the collective interest parameter relates to aggregate interests of a group of nodes in the social network graph in the objects and/or topics, and captures a preference of the group of nodes for one or more of the objects and/or topics. 3. The method according to claim 2, wherein the relative importance parameter governs a trade-off between social connectivity and collective interests. 4. The method according to claim 3, wherein the objective function comprises a social connectivity function which relates to a quality of partitioning of the nodes of the network into groups. 5. The method according to claim 2, wherein a value of the collective interest function is (i) higher if the group of nodes shows preference for a smaller number of objects and/or topics and/or (ii) lower if the group of nodes shows uniform preference for a larger number of objects and/or topics. 6. The method according to claim 2, wherein:
the collective interest function represents a differentiation of interests of the group of nodes relative to another, reference group of entities; and a value of the collective interest function is (i) higher if the group of nodes shows a different preference for one or more objects and/or topics as compared to the reference group, and/or (ii) lower if the group of nodes shows similar preference for one or more objects and/or topics as compared to the reference group. 7. The method according to claim 6, wherein the reference group comprises the entire population of the entities. 8. The method according to claim 2, wherein:
the collective interest function represents a uniformity of the interests of the group of nodes in the objects and/or topics; and a value of the collective interest function is (i) higher if the group of nodes shows similar preference for a large number of objects and/or topics, and/or (ii) lower if the group of nodes shows a marked preference for a smaller number of objects and/or topics. 9. The method according to claim 1, wherein said optimizing of the objective function comprises:
for each edge present in the social network graph, evaluating a gain from combining the pair of nodes defining the edge; determining a maximum gain from said evaluating, and designating an associated edge; combining the pair of nodes of the associated edge into a single community if the maximum gain is positive and above a predetermined threshold; and repeating said steps of evaluating, determining a maximum gain, and combining, until there is no positive maximum gain above the predetermined threshold. 10. The method, according to claim 1, wherein said optimizing comprises:
initializing each node in the social network graph as belonging to separate communities; for each node, evaluating whether there is an increase in the value of the objective function value by moving the node from its present community to a different community, the different community including at least one neighbor node; determining the maximum increase from said evaluating step, and designating an associated node; moving the associated node to its different community including at least one neighbor node, only if the maximum increase is positive and above a predetermined threshold; repeating said steps of evaluating, determining a maximum increase, and moving, until there is no positive maximum increase above the predetermined threshold; with respect to each community now defined, merging all nodes of the community into a single new node; establishing a super graph via consolidating edges between the new nodes; and repeating said steps of evaluating, determining a maximum increase, moving, repeating, and establishing a super graph, until no nodes can be merged any further. 11. An apparatus for discerning collective interest-based social communities, said apparatus comprising:
at least one processor; and a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising: computer readable program code configured to accept input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; computer readable program code configured to construct a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; computer readable program code configured to define, relative to the social network graph, separate parameters for social connectivity and collective interests; computer readable program code configured to define a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; computer readable program code configured to define an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and computer readable program code configured to discern at least one collective interest-based social community via optimizing the objective function. 12. A computer program product for discerning collective interest-based social communities, said apparatus comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to accept input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; computer readable program code configured to construct a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; computer readable program code configured to define, relative to the social network graph, separate parameters for social connectivity and collective interests; computer readable program code configured to define a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; computer readable program code configured to define an objective function based on the social connectivity parameter, the collective interests parameter, and the relative importance parameter; and computer readable program code configured to discern at least one collective interest-based social community via optimizing the objective function. 13. The computer program product according to claim 12, wherein the collective interest parameter relates to aggregate interests of a group of nodes in the social network graph in the objects and/or topics, and captures a preference of the group of nodes for one or more of the objects and/or topics. 14. The computer program product according to claim 13, wherein the relative importance parameter governs a trade-off between social connectivity and collective interests. 15. The computer program product according to claim 14, wherein the objective function comprises a social connectivity function which relates to a quality of partitioning of the nodes of the network into groups. 16. The computer program product according to claim 13, wherein a value of the collective interest function is (i) higher if the group of nodes shows preference for a smaller number of objects and/or topics and (ii) lower if the group of nodes shows uniform preference for a larger number of objects and/or topics. 17. The computer program product according to claim 13, wherein:
the collective interest function represents a differentiation of interests of the group of nodes relative to another, reference group of entities; and a value of the collective interest function is (i) higher if the group of nodes shows a different preference for one or more objects and/or topics as compared to the reference group, and/or (ii) lower if the group of nodes shows similar preference for one or more objects and/or topics as compared to the reference group. 18. The computer program product according to claim 17, wherein the reference group comprises the entire population of the entities. 19. The computer program product according to claim 13, wherein:
the collective interest function represents a uniformity of the interests of the group of nodes in the objects and/or topics; and a value of the collective interest function is (i) higher if the group of nodes shows similar preference for a large number of objects and/or topics, and/or (ii) lower if the group of nodes shows a marked preference for a smaller number of objects and/or topics. 20. A method comprising:
input comprising: a population of entities, a collection of objects and/or topics, connectivity information relative to entities among the population of entities, and data indicating an expression of interest in the objects and/or topics by each of the entities; constructing a social network graph among the entities by representing the entities as nodes in the graph and connectivity between the entities as edges in the graph; defining, relative to the social network graph, separate parameters for social connectivity and collective interests, the collective interest parameter relating to aggregate interests of a group of nodes in the social network graph in the objects and/or topics; defining a single relative importance parameter which indicates a relative importance, with respect to one another, of the social connectivity parameter and the collective interests parameter; defining an objective function based on the social connectivity parameter, the collective interests parameter the relative importance parameter, and a social connectivity function which captures a quality of partitioning of the nodes of the network into groups; and discerning at least one collective interest-based social community via optimizing the objective function; said optimizing of the objective function comprising: for each edge present in the social network graph, evaluating a gain from combining the pair of nodes defining the edge; determining a maximum gain from said evaluating, and designating an associated edge; combining the pair of nodes of the associated edge into a single community if the maximum gain is positive and above a predetermined threshold; and repeating said steps of evaluating, determining a maximum gain and combining until there is no positive maximum gain above the predetermined threshold. | 2,100 |
5,025 | 14,547,011 | 2,138 | Systems and methods for vendor-agnostic access to non-volatile memory of a wireless memory tag include: detecting, via a wireless memory host, a wireless memory tag; providing a vendor-agnostic command to the wireless memory tag to affect a change in a register-based interface of the wireless memory tag, wherein the change results in reading data from non-volatile memory of the wireless memory tag, writing data to the non-volatile memory of the wireless memory tag, or both. | 1. A wireless memory tag, comprising:
a non-volatile memory configured to store data; a register-based interface configured to receive one or more commands from a wireless memory host in a vendor-agnostic manner; and a controller configured to access the non-volatile memory based upon the one or more commands from the wireless memory host. 2. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a put-long request frame that is configured to put data within the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 3. The wireless memory tag of claim 2, wherein the put-long request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a put-long command code field configured to provide an indication that the request frame is of a put-long request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a least significant byte register-based interface start address field configured to store the least significant byte register-based interface start address, a payload size field configured to store the size of a payload provided with the put-long request frame, a payload field configured to store the payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 4. The wireless memory tag of claim 3, wherein the plurality of fields of the put-long request frame are arranged in the recited order. 5. The wireless memory tag of claim 3, wherein the start of frame field occupies 1 byte, the put-long command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the least significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, the payload field occupies between 1 and 256 bytes, and the cyclical redundancy check field occupies 2 bytes. 6. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a put-short request frame that is configured to put data within the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address. 7. The wireless memory tag of claim 6, wherein the put-short request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a put-short command code field configured to provide an indication that the request frame is of a put-short request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a payload size field configured to store the size of a payload provided with the put-short request frame, a payload field configured to store the payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 8. The wireless memory tag of claim 7, wherein the plurality of fields of the put-short request frame are arranged in the recited ordered. 9. The wireless memory tag of claim 7, wherein the start of frame field occupies 1 byte, the put-short command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, the payload field occupies between 1 and 256 bytes, and the cyclical redundancy check field occupies 2 bytes. 10. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a get-long request frame that is configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 11. The wireless memory tag of claim 10, wherein the get-long request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a get-long command code field configured to provide an indication that the request frame is of a get-long request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a least significant byte register-based interface start address field configured to store the least significant byte register-based interface start address, a payload size field configured to store the size of a payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 12. The wireless memory tag of claim 11, wherein the plurality of fields of the get-long request frame are arranged in the recited ordered. 13. The wireless memory tag of claim 11, wherein the start of frame field occupies 1 byte, the get-long command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the least significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, and the cyclical redundancy check field occupies 2 bytes. 14. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a get-short request frame that is configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address. 15. The wireless memory tag of claim 14, wherein the get-short request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a get-short command code field configured to provide an indication that the request frame is of a get-short request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a payload size field configured to store the size of a payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 16. The wireless memory tag of claim 15, wherein the plurality of fields of the get-short request frame are arranged in the recited order. 17. The wireless memory tag of claim 15, wherein the start of frame field occupies 1 byte, the get-short command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, and the cyclical redundancy check field occupies 2 bytes. 18. A wireless memory host, comprising:
a radio configured to communicatively couple with a wireless memory tag; and a controller configured to provide one or more vendor-agnostic commands to a register-based interface the wireless memory tag to access non-volatile memory of the wireless memory tag. 19. The wireless memory host of claim 18, wherein the one or more vendor-agnostic commands comprise:
at least one “get” request frame configured to get data from the register-based interface; and at least one “put” request frame configured to put data into the register-based interface. 20. The wireless memory host of claim 19, wherein the at least one “get” request frame comprises:
a get-short request frame configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address; and
a get-long request frame configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 21. The wireless memory host of claim 19, wherein the at least one “put” request frame comprises:
a put-short request frame configured to put data into the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address; and
a put-long request frame configured to put data into the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 22. A wireless memory tag controller, comprising:
a register-based interface configured to provide access of non-volatile memory of the wireless memory tag, based upon one or more received vendor-agnostic commands. 23. The wireless memory tag controller of claim 22, wherein the register-based interface is defined by a number of sections comprising:
an initialization information section configured to store communications initialization information of a wireless memory tag associated with the wireless memory tag controller; a controller management section configured to store data related to controller management; and a non-volatile memory access section configured to store data associated with access of the non-volatile memory. 24. The wireless memory tag controller of claim 23, wherein the initialization information section comprises:
a near field communication (NFC) information field configured to store information related to a type of wireless memory tag being accessed; and a data buffer information section configured to store information related to the number of data buffers in the wireless memory tag, the size of each data buffer in the wireless memory tag, and an offset of each data buffer in the wireless memory tag. 25. The wireless memory tag controller of claim 23, wherein the controller management section comprises controller direct access registers. 26. The wireless memory tag controller of claim 23, wherein the non-volatile memory access section comprises:
a command parameters section configured to store one or more parameters associated with the one or more received vendor-agnostic commands; one or more data buffers configured to store data that may be stored, retrieved, or stored and retrieved from the non-volatile memory; and a status indicator for each of the one or more data buffers configured to provide an indication of whether or not a corresponding data buffer is ready to be written to, ready to be read from, or both. 27. A wireless memory system, comprising:
a wireless memory host, comprising:
a controller configured to request an operation on non-volatile memory of a wireless memory tag by providing vendor-agnostic commands to a wireless memory tag; and
the wireless memory tag, comprising:
the non-volatile memory;
the register-based interface configured to enable access to the non-volatile memory;
wherein the vendor-agnostic commands are configured to affect changes in a register-based interface of the wireless memory tag, the changes triggering an operation by the wireless memory tag on the non-volatile memory. 28. The wireless memory system of claim 27, wherein the operation comprises a write operation and the vendor-agnostic commands comprise a “put” request frame comprising a payload, wherein the “put” request frame is configured to change the register-based interface such that the payload is stored in the non-volatile memory. 29. The wireless memory system of claim 27, wherein the operation comprises a read operation and the vendor-agnostic commands comprise:
a “put” request frame, wherein the “put” request frame is configured to change the register-based interface such that data from the non-volatile memory is put in the register-based interface; a “get” request frame, wherein the “get” request frame command is configured to change the register-based interface such that the data from the non-volatile memory that is put in the register-based interface is provided to the wireless memory host. 30. The wireless memory system of claim 27, wherein the wireless memory tag is configured to provide a response frame in response to receiving the vendor-agnostic commands;
wherein: when the vendor-agnostic commands comprise a “get” command, the response frame comprises an acknowledgement byte and between 1-256 payload bytes; and when the vendor-agnostic commands comprise a “put” command, the response frame comprises an acknowledgement byte. 31. A method, comprising:
detecting, via a wireless memory host, a wireless memory tag; and providing a vendor-agnostic command to the wireless memory tag to affect a change in a register-based interface of the wireless memory tag, wherein the change results in reading data from non-volatile memory of the wireless memory tag, writing data to the non-volatile memory of the wireless memory tag, or both. | Systems and methods for vendor-agnostic access to non-volatile memory of a wireless memory tag include: detecting, via a wireless memory host, a wireless memory tag; providing a vendor-agnostic command to the wireless memory tag to affect a change in a register-based interface of the wireless memory tag, wherein the change results in reading data from non-volatile memory of the wireless memory tag, writing data to the non-volatile memory of the wireless memory tag, or both.1. A wireless memory tag, comprising:
a non-volatile memory configured to store data; a register-based interface configured to receive one or more commands from a wireless memory host in a vendor-agnostic manner; and a controller configured to access the non-volatile memory based upon the one or more commands from the wireless memory host. 2. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a put-long request frame that is configured to put data within the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 3. The wireless memory tag of claim 2, wherein the put-long request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a put-long command code field configured to provide an indication that the request frame is of a put-long request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a least significant byte register-based interface start address field configured to store the least significant byte register-based interface start address, a payload size field configured to store the size of a payload provided with the put-long request frame, a payload field configured to store the payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 4. The wireless memory tag of claim 3, wherein the plurality of fields of the put-long request frame are arranged in the recited order. 5. The wireless memory tag of claim 3, wherein the start of frame field occupies 1 byte, the put-long command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the least significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, the payload field occupies between 1 and 256 bytes, and the cyclical redundancy check field occupies 2 bytes. 6. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a put-short request frame that is configured to put data within the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address. 7. The wireless memory tag of claim 6, wherein the put-short request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a put-short command code field configured to provide an indication that the request frame is of a put-short request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a payload size field configured to store the size of a payload provided with the put-short request frame, a payload field configured to store the payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 8. The wireless memory tag of claim 7, wherein the plurality of fields of the put-short request frame are arranged in the recited ordered. 9. The wireless memory tag of claim 7, wherein the start of frame field occupies 1 byte, the put-short command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, the payload field occupies between 1 and 256 bytes, and the cyclical redundancy check field occupies 2 bytes. 10. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a get-long request frame that is configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 11. The wireless memory tag of claim 10, wherein the get-long request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a get-long command code field configured to provide an indication that the request frame is of a get-long request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a least significant byte register-based interface start address field configured to store the least significant byte register-based interface start address, a payload size field configured to store the size of a payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 12. The wireless memory tag of claim 11, wherein the plurality of fields of the get-long request frame are arranged in the recited ordered. 13. The wireless memory tag of claim 11, wherein the start of frame field occupies 1 byte, the get-long command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the least significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, and the cyclical redundancy check field occupies 2 bytes. 14. The wireless memory tag of claim 1, wherein the wireless memory tag is configured to receive a get-short request frame that is configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address. 15. The wireless memory tag of claim 14, wherein the get-short request frame comprises a plurality of fields comprising: a start of frame field configured to provide an indication of the start of a request frame, a get-short command code field configured to provide an indication that the request frame is of a get-short request frame type, a most significant byte register-based interface start address field configured to store the most significant byte register-based interface start address, a payload size field configured to store the size of a payload, and a cyclical redundancy check field configured to cyclical redundancy information for error checking. 16. The wireless memory tag of claim 15, wherein the plurality of fields of the get-short request frame are arranged in the recited order. 17. The wireless memory tag of claim 15, wherein the start of frame field occupies 1 byte, the get-short command code field occupies 1 byte, the most significant byte register-based interface start address field occupies 1 byte, the payload size field occupies 1 byte, and the cyclical redundancy check field occupies 2 bytes. 18. A wireless memory host, comprising:
a radio configured to communicatively couple with a wireless memory tag; and a controller configured to provide one or more vendor-agnostic commands to a register-based interface the wireless memory tag to access non-volatile memory of the wireless memory tag. 19. The wireless memory host of claim 18, wherein the one or more vendor-agnostic commands comprise:
at least one “get” request frame configured to get data from the register-based interface; and at least one “put” request frame configured to put data into the register-based interface. 20. The wireless memory host of claim 19, wherein the at least one “get” request frame comprises:
a get-short request frame configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address; and
a get-long request frame configured to get data from the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 21. The wireless memory host of claim 19, wherein the at least one “put” request frame comprises:
a put-short request frame configured to put data into the register-based interface at a location defined by a most significant byte register-based interface start address and not a least significant byte register-based interface start address; and
a put-long request frame configured to put data into the register-based interface at a location defined by a most significant byte register-based interface start address and a least significant byte register-based interface start address. 22. A wireless memory tag controller, comprising:
a register-based interface configured to provide access of non-volatile memory of the wireless memory tag, based upon one or more received vendor-agnostic commands. 23. The wireless memory tag controller of claim 22, wherein the register-based interface is defined by a number of sections comprising:
an initialization information section configured to store communications initialization information of a wireless memory tag associated with the wireless memory tag controller; a controller management section configured to store data related to controller management; and a non-volatile memory access section configured to store data associated with access of the non-volatile memory. 24. The wireless memory tag controller of claim 23, wherein the initialization information section comprises:
a near field communication (NFC) information field configured to store information related to a type of wireless memory tag being accessed; and a data buffer information section configured to store information related to the number of data buffers in the wireless memory tag, the size of each data buffer in the wireless memory tag, and an offset of each data buffer in the wireless memory tag. 25. The wireless memory tag controller of claim 23, wherein the controller management section comprises controller direct access registers. 26. The wireless memory tag controller of claim 23, wherein the non-volatile memory access section comprises:
a command parameters section configured to store one or more parameters associated with the one or more received vendor-agnostic commands; one or more data buffers configured to store data that may be stored, retrieved, or stored and retrieved from the non-volatile memory; and a status indicator for each of the one or more data buffers configured to provide an indication of whether or not a corresponding data buffer is ready to be written to, ready to be read from, or both. 27. A wireless memory system, comprising:
a wireless memory host, comprising:
a controller configured to request an operation on non-volatile memory of a wireless memory tag by providing vendor-agnostic commands to a wireless memory tag; and
the wireless memory tag, comprising:
the non-volatile memory;
the register-based interface configured to enable access to the non-volatile memory;
wherein the vendor-agnostic commands are configured to affect changes in a register-based interface of the wireless memory tag, the changes triggering an operation by the wireless memory tag on the non-volatile memory. 28. The wireless memory system of claim 27, wherein the operation comprises a write operation and the vendor-agnostic commands comprise a “put” request frame comprising a payload, wherein the “put” request frame is configured to change the register-based interface such that the payload is stored in the non-volatile memory. 29. The wireless memory system of claim 27, wherein the operation comprises a read operation and the vendor-agnostic commands comprise:
a “put” request frame, wherein the “put” request frame is configured to change the register-based interface such that data from the non-volatile memory is put in the register-based interface; a “get” request frame, wherein the “get” request frame command is configured to change the register-based interface such that the data from the non-volatile memory that is put in the register-based interface is provided to the wireless memory host. 30. The wireless memory system of claim 27, wherein the wireless memory tag is configured to provide a response frame in response to receiving the vendor-agnostic commands;
wherein: when the vendor-agnostic commands comprise a “get” command, the response frame comprises an acknowledgement byte and between 1-256 payload bytes; and when the vendor-agnostic commands comprise a “put” command, the response frame comprises an acknowledgement byte. 31. A method, comprising:
detecting, via a wireless memory host, a wireless memory tag; and providing a vendor-agnostic command to the wireless memory tag to affect a change in a register-based interface of the wireless memory tag, wherein the change results in reading data from non-volatile memory of the wireless memory tag, writing data to the non-volatile memory of the wireless memory tag, or both. | 2,100 |
5,026 | 14,435,178 | 2,127 | A method for planning an orthopedic procedure including positioning a virtual implant component relative to a 3D volume of scan data of a patient is disclosed. A 3D volume of scan data of a patient, which includes scan data of a bony anatomy of the patient, is provided. A first 2D view of scan data is generated from the 3D volume of the scan data, wherein the 2D view of scan data comprises a first a portion of the bony anatomy. First positional information for the virtual implant component is defining relative to the first 2D view. A second 2D view of scan data is generated from the 3D volume of scan data, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data and comprises a second portion of the bony anatomy. Second positional information for the virtual implant component is defined relative to the second 2D view of scan data. 3D positional information for the virtual implant component relative the 3D volume of scan data is provided based on the first positional information and the second positional information. | 1. A method for planning an orthopedic procedure, said method including positioning a virtual implant component relative to a volume of scan data of a patient, said method comprising
providing a 3D volume of scan data of a patient, said scan data of a patient comprising scan data of a bony anatomy of the patient; generating a first 2D view of scan data based on the 3D volume of the scan data of the patient; defining, relative to the first 2D view, first positional information for the virtual implant component; generating a second 2D view of scan data based on the 3D volume of scan data of the patient, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data; defining, relative to the second 2D view of scan data second positional information for the virtual implant component; and providing 3D positional information for the virtual implant component relative the 3D volume of scan data based on the first positional information and the second positional information. 2. The method according to claim 1, comprising adjusting a position of at least one of:
an object relative to the first 2D view of scan data for generating the first positional information and an object relative to the second 2D view of scan data for generating the second positional information, wherein said adjusting is locked to adjustment in a single dimension in each of said first and second 2D views of scan data. 3. The method according to claim 1, comprising displaying a third 2D view of scan data generated from the 3D volume of scan data of the patient, wherein the third 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data and the second 2D view of scan data, and wherein the third 2D view of scan data comprises a third portion of the bony anatomy;
defining, relative to the third 2D view of scan data, third positional information for the virtual implant component; and providing 3D positional information for the virtual implant component relative the 3D volume of scan data by the first positional information, the second positional information, and the third positional information. 4. The method according to claim 1, comprising displaying a 3D representation the virtual implant component in a position defined by the first and second positional information; and
displaying a position adjustment object associated with the virtual implant component and being moveable in a single dimension at the time, wherein each dimension is parallel to at least one of the first and the second 2D views of scan data. 5. The method according to claim 1, wherein defining first and second positional information for the virtual implant component comprises defining positional information for at least one of: an affected femoral head, affected femoral shaft, unaffected femoral head, unaffected femoral shaft, a cup of the virtual implant, a stem of the virtual implant, and a knee implant. 6. The method according to claim 1, comprising dividing the 3D volume of scan data into a first 3D sub-volume of scan data and a second sub-volume of scan data based on the first and second positional information. 7. The method according to claim 1, further comprising displaying a first virtual implant component in a position relative to the 3D scan data based on the first and the second positional information, and a second virtual implant component, which is a virtual representation of the position of an actual implant relative to the actual bony anatomy of the patient. 8. The method according to claim 1, comprising exporting navigational data based on the first and second positional information to a navigation unit for guiding the position of an actual implant relative to the actual bony anatomy of the patient. 9. The method according to claim 1, wherein generating the first 2D view and the second 2D view comprises using reformatting techniques, the first and second 2D views comprise images reformatted and/or reconstructed from the 3D volume of scan data. 10. The method according to claim 9, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data that is orthogonal. 11. The method according to claim 1, wherein defining the first positional information and the second positional information for the virtual implant component is restricted to defining in maximum two degrees of freedom for at least one of the first positional information and the second positional information. 12. The method according to claim 1, wherein the first positional information is defined in the dimensions of the first 2D view and the second positional information is defined in the dimensions of the second 2D view. 13. The method according to claim 1, further comprising separately displaying the first 2D view and the second 2D view. 14. The method according to claim 1, comprising adjusting at least one of the first positional information relative to the first 2D view and the second positional information relative to the second 2D view. 15. The method according to claim 13, wherein the adjusting at least one of the first positional information and the second positional information for the virtual implant component is guided by an offset for an affected anatomy relative an unaffected anatomy. 16. The method according to claim 1, comprising defining each of the first positional information and the second positional information to comprise coordinate information in one or two dimensions, wherein the combination of the first positional information and the second positional information comprises coordinate information in three different dimensions. 17. Computer system comprising a programmable device adapted to perform the method of claim 1. 18. A computer program product stored on a computer readable medium, comprising: computer readable program code segments for causing a computer to execute the method of claim 1. 19. The method according to claim 3, wherein generating the first, second, and third 2D views comprises using reformatting techniques to provide at least one of reformatted slices and reconstructed slices, wherein the first and second 2D views comprise at least one of images reformatted from the 3D volume of scan data and images reconstructed from the 3D volume of scan data. 20. The method according to claim 3, wherein defining the first positional information, the second positional information, and the third positional information for the virtual implant component is restricted to defining a maximum of two degrees of freedom for at least one of the first positional information, the second positional information, and the third positional information. 21. The method according to claim 3, further comprising separately displaying each of the first 2D view, the second 2D views, and the third 2D view. | A method for planning an orthopedic procedure including positioning a virtual implant component relative to a 3D volume of scan data of a patient is disclosed. A 3D volume of scan data of a patient, which includes scan data of a bony anatomy of the patient, is provided. A first 2D view of scan data is generated from the 3D volume of the scan data, wherein the 2D view of scan data comprises a first a portion of the bony anatomy. First positional information for the virtual implant component is defining relative to the first 2D view. A second 2D view of scan data is generated from the 3D volume of scan data, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data and comprises a second portion of the bony anatomy. Second positional information for the virtual implant component is defined relative to the second 2D view of scan data. 3D positional information for the virtual implant component relative the 3D volume of scan data is provided based on the first positional information and the second positional information.1. A method for planning an orthopedic procedure, said method including positioning a virtual implant component relative to a volume of scan data of a patient, said method comprising
providing a 3D volume of scan data of a patient, said scan data of a patient comprising scan data of a bony anatomy of the patient; generating a first 2D view of scan data based on the 3D volume of the scan data of the patient; defining, relative to the first 2D view, first positional information for the virtual implant component; generating a second 2D view of scan data based on the 3D volume of scan data of the patient, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data; defining, relative to the second 2D view of scan data second positional information for the virtual implant component; and providing 3D positional information for the virtual implant component relative the 3D volume of scan data based on the first positional information and the second positional information. 2. The method according to claim 1, comprising adjusting a position of at least one of:
an object relative to the first 2D view of scan data for generating the first positional information and an object relative to the second 2D view of scan data for generating the second positional information, wherein said adjusting is locked to adjustment in a single dimension in each of said first and second 2D views of scan data. 3. The method according to claim 1, comprising displaying a third 2D view of scan data generated from the 3D volume of scan data of the patient, wherein the third 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data and the second 2D view of scan data, and wherein the third 2D view of scan data comprises a third portion of the bony anatomy;
defining, relative to the third 2D view of scan data, third positional information for the virtual implant component; and providing 3D positional information for the virtual implant component relative the 3D volume of scan data by the first positional information, the second positional information, and the third positional information. 4. The method according to claim 1, comprising displaying a 3D representation the virtual implant component in a position defined by the first and second positional information; and
displaying a position adjustment object associated with the virtual implant component and being moveable in a single dimension at the time, wherein each dimension is parallel to at least one of the first and the second 2D views of scan data. 5. The method according to claim 1, wherein defining first and second positional information for the virtual implant component comprises defining positional information for at least one of: an affected femoral head, affected femoral shaft, unaffected femoral head, unaffected femoral shaft, a cup of the virtual implant, a stem of the virtual implant, and a knee implant. 6. The method according to claim 1, comprising dividing the 3D volume of scan data into a first 3D sub-volume of scan data and a second sub-volume of scan data based on the first and second positional information. 7. The method according to claim 1, further comprising displaying a first virtual implant component in a position relative to the 3D scan data based on the first and the second positional information, and a second virtual implant component, which is a virtual representation of the position of an actual implant relative to the actual bony anatomy of the patient. 8. The method according to claim 1, comprising exporting navigational data based on the first and second positional information to a navigation unit for guiding the position of an actual implant relative to the actual bony anatomy of the patient. 9. The method according to claim 1, wherein generating the first 2D view and the second 2D view comprises using reformatting techniques, the first and second 2D views comprise images reformatted and/or reconstructed from the 3D volume of scan data. 10. The method according to claim 9, wherein the second 2D view of scan data is provided from the 3D volume of scan data at an angle relative to the first 2D view of scan data that is orthogonal. 11. The method according to claim 1, wherein defining the first positional information and the second positional information for the virtual implant component is restricted to defining in maximum two degrees of freedom for at least one of the first positional information and the second positional information. 12. The method according to claim 1, wherein the first positional information is defined in the dimensions of the first 2D view and the second positional information is defined in the dimensions of the second 2D view. 13. The method according to claim 1, further comprising separately displaying the first 2D view and the second 2D view. 14. The method according to claim 1, comprising adjusting at least one of the first positional information relative to the first 2D view and the second positional information relative to the second 2D view. 15. The method according to claim 13, wherein the adjusting at least one of the first positional information and the second positional information for the virtual implant component is guided by an offset for an affected anatomy relative an unaffected anatomy. 16. The method according to claim 1, comprising defining each of the first positional information and the second positional information to comprise coordinate information in one or two dimensions, wherein the combination of the first positional information and the second positional information comprises coordinate information in three different dimensions. 17. Computer system comprising a programmable device adapted to perform the method of claim 1. 18. A computer program product stored on a computer readable medium, comprising: computer readable program code segments for causing a computer to execute the method of claim 1. 19. The method according to claim 3, wherein generating the first, second, and third 2D views comprises using reformatting techniques to provide at least one of reformatted slices and reconstructed slices, wherein the first and second 2D views comprise at least one of images reformatted from the 3D volume of scan data and images reconstructed from the 3D volume of scan data. 20. The method according to claim 3, wherein defining the first positional information, the second positional information, and the third positional information for the virtual implant component is restricted to defining a maximum of two degrees of freedom for at least one of the first positional information, the second positional information, and the third positional information. 21. The method according to claim 3, further comprising separately displaying each of the first 2D view, the second 2D views, and the third 2D view. | 2,100 |
5,027 | 14,803,937 | 2,144 | An image editing apparatus includes a display device, a storage device for storing image data, and a preview display unit for displaying a preview image of the image data on a display screen. The preview display unit displays a scroll bar as a UI component for scrolling the preview image, on the display screen. When the image is scrolled, the scroll bar is changed to an enlarged scroll bar. On the screen image, a page jump button and a page number are additionally displayed. | 1. An apparatus, comprising:
a display device having a display screen; a storage unit storing image data; and a preview display unit configured to display a preview image of the image data stored in the storage unit on said display screen, wherein said preview display unit displays a user interface (UI) component allowing a user operation to scroll the preview image displayed on said display screen; said apparatus further comprising: a scroll unit configured to control said preview display unit such that said image data displayed on said display screen is scrolled in response to an operation of said UI component; and a display manner changing unit configured to change a manner of display of said UI component displayed on said display screen, in response to an operation of said preview image. 2. The apparatus according to claim 1, wherein
said preview display unit displays said UI component to occupy a first display area of said display screen; said display manner changing unit changes a first manner of display of said UI component to a second manner of display occupying a second display area larger than said first area of said display screen; and said second display area encompasses said first display area. 3. The apparatus according to claim 2, further comprising a display manner returning unit configured to return the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 4. The apparatus according to claim 3, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 5. The apparatus according to claim 4, wherein said UI component includes, in addition to said scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar, in said second manner of display. 6. The apparatus according to claim 5, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 7. The apparatus according to claim 3, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. 8. The apparatus according to claim 7, further comprising a page number display unit configured to additionally display a page number to each page of said image data displayed on said display screen by said preview display unit, in said second manner of display. 9. The apparatus according to claim 2, further comprising a display manner returning unit configured to return the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 10. The apparatus according to claim 2, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 11. The apparatus according to claim 10, wherein said UI component includes, in addition to said scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar, in said second manner of display. 12. The apparatus according to claim 11, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 13. The apparatus according to claim 2, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. 14. The apparatus according to claim 13, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 15. The apparatus according to claim 2, further comprising a page number display unit configured to additionally display a page number to each page of said image data displayed on said display screen by said preview display unit, in said second manner of display. 16. A method of editing an image displayed on a display screen of a display device, comprising the steps of:
storing image data; and displaying a preview image of the image data stored at said storing step on said display screen; wherein at said step of displaying, a user interface (UI) component allowing a user operation to scroll the preview image displayed on said display screen is displayed; said method further comprising the steps of: controlling display of said display device such that said image data displayed on said display screen is scrolled, in response to an operation of said UI component; and changing a manner of display of said UI component displayed on said display screen, in response to an operation of said preview image. 17. The image editing method according to claim 16, wherein
said step of displaying includes a step of displaying said UI component to occupy a first display area of said display screen; said step of changing a manner of display includes a step of changing a first manner of display of said UI component to a second manner of display occupying a second display area larger than said first area of said display screen; and said second area encompasses said first area. 18. The image editing method according to claim 17, further comprising the step of returning the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 19. The image editing method according to claim 17, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 20. The image editing method according to claim 17, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. | An image editing apparatus includes a display device, a storage device for storing image data, and a preview display unit for displaying a preview image of the image data on a display screen. The preview display unit displays a scroll bar as a UI component for scrolling the preview image, on the display screen. When the image is scrolled, the scroll bar is changed to an enlarged scroll bar. On the screen image, a page jump button and a page number are additionally displayed.1. An apparatus, comprising:
a display device having a display screen; a storage unit storing image data; and a preview display unit configured to display a preview image of the image data stored in the storage unit on said display screen, wherein said preview display unit displays a user interface (UI) component allowing a user operation to scroll the preview image displayed on said display screen; said apparatus further comprising: a scroll unit configured to control said preview display unit such that said image data displayed on said display screen is scrolled in response to an operation of said UI component; and a display manner changing unit configured to change a manner of display of said UI component displayed on said display screen, in response to an operation of said preview image. 2. The apparatus according to claim 1, wherein
said preview display unit displays said UI component to occupy a first display area of said display screen; said display manner changing unit changes a first manner of display of said UI component to a second manner of display occupying a second display area larger than said first area of said display screen; and said second display area encompasses said first display area. 3. The apparatus according to claim 2, further comprising a display manner returning unit configured to return the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 4. The apparatus according to claim 3, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 5. The apparatus according to claim 4, wherein said UI component includes, in addition to said scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar, in said second manner of display. 6. The apparatus according to claim 5, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 7. The apparatus according to claim 3, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. 8. The apparatus according to claim 7, further comprising a page number display unit configured to additionally display a page number to each page of said image data displayed on said display screen by said preview display unit, in said second manner of display. 9. The apparatus according to claim 2, further comprising a display manner returning unit configured to return the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 10. The apparatus according to claim 2, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 11. The apparatus according to claim 10, wherein said UI component includes, in addition to said scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar, in said second manner of display. 12. The apparatus according to claim 11, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 13. The apparatus according to claim 2, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. 14. The apparatus according to claim 13, wherein said button includes a jump-to-head button for jumping to the head page of said image data, and a jump-to-last button for jumping to the last page of said image data. 15. The apparatus according to claim 2, further comprising a page number display unit configured to additionally display a page number to each page of said image data displayed on said display screen by said preview display unit, in said second manner of display. 16. A method of editing an image displayed on a display screen of a display device, comprising the steps of:
storing image data; and displaying a preview image of the image data stored at said storing step on said display screen; wherein at said step of displaying, a user interface (UI) component allowing a user operation to scroll the preview image displayed on said display screen is displayed; said method further comprising the steps of: controlling display of said display device such that said image data displayed on said display screen is scrolled, in response to an operation of said UI component; and changing a manner of display of said UI component displayed on said display screen, in response to an operation of said preview image. 17. The image editing method according to claim 16, wherein
said step of displaying includes a step of displaying said UI component to occupy a first display area of said display screen; said step of changing a manner of display includes a step of changing a first manner of display of said UI component to a second manner of display occupying a second display area larger than said first area of said display screen; and said second area encompasses said first area. 18. The image editing method according to claim 17, further comprising the step of returning the manner of display of said UI component to said first manner of display, if a prescribed time period passes without any operation on said UI component displayed in said second manner of display. 19. The image editing method according to claim 17, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes a scroll bar displayed larger than said prescribed size on said second display area in said second manner of display. 20. The image editing method according to claim 17, wherein said UI component includes a scroll bar displayed in a prescribed size on said first display area in said first manner of display, and includes, in addition to the scroll bar, a button causing the preview image to jump to a prescribed page, displayed on said second display area close to said scroll bar in said second manner of display. | 2,100 |
5,028 | 14,930,703 | 2,132 | A method of restoring data from at least two tapes of a tape storage system, a first tape including two sets of data blocks in a first order and a second tape including the two sets of data blocks in a second order, the method including restoring the first set of data blocks from the first tape, and restoring the second set of data blocks simultaneously from the second tape. | 1. A method of restoring data from at least two tapes of a tape storage system, a first tape comprising two sets of data blocks in a first order and a second tape comprising the two sets of data blocks in a second order, the method comprising:
restoring the first set of data blocks from the first tape; and restoring the second set of data blocks simultaneously from the second tape. 2. A method of restoring at least one data block from a tape storage system using at least two tapes, a first tape comprising two sets of data blocks in a first order and a second tape comprising the two sets of data blocks in a second order, the method comprising:
determining a position of the at least one data block to be restored for the two tapes; and restoring the data from the tape requiring a minimal time to access the determined position. 3. A method of storing data on at least two tapes of a tape storage system for redundant data storage, the data being split into data blocks, the method comprising:
writing a first set of the data blocks and a second set of the data blocks on a first tape, based on a first order; and writing the first set of the data blocks and the second set of the data blocks on a second tape, based on a second order, the second order being different from the first order. 4. The method of claim 1, wherein the second order is based on the first order in reverse. 5. The method of claim 2, wherein the second order is based on the first order in reverse. 6. The method of claim 3, wherein the second order is based on the first order in reverse. 7. The method of claim 1, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 8. The method of claim 2, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 9. The method of claim 3, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 10. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 3 to store data on tapes. 11. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 1 to restore data. 12. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 2 to restore data. | A method of restoring data from at least two tapes of a tape storage system, a first tape including two sets of data blocks in a first order and a second tape including the two sets of data blocks in a second order, the method including restoring the first set of data blocks from the first tape, and restoring the second set of data blocks simultaneously from the second tape.1. A method of restoring data from at least two tapes of a tape storage system, a first tape comprising two sets of data blocks in a first order and a second tape comprising the two sets of data blocks in a second order, the method comprising:
restoring the first set of data blocks from the first tape; and restoring the second set of data blocks simultaneously from the second tape. 2. A method of restoring at least one data block from a tape storage system using at least two tapes, a first tape comprising two sets of data blocks in a first order and a second tape comprising the two sets of data blocks in a second order, the method comprising:
determining a position of the at least one data block to be restored for the two tapes; and restoring the data from the tape requiring a minimal time to access the determined position. 3. A method of storing data on at least two tapes of a tape storage system for redundant data storage, the data being split into data blocks, the method comprising:
writing a first set of the data blocks and a second set of the data blocks on a first tape, based on a first order; and writing the first set of the data blocks and the second set of the data blocks on a second tape, based on a second order, the second order being different from the first order. 4. The method of claim 1, wherein the second order is based on the first order in reverse. 5. The method of claim 2, wherein the second order is based on the first order in reverse. 6. The method of claim 3, wherein the second order is based on the first order in reverse. 7. The method of claim 1, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 8. The method of claim 2, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 9. The method of claim 3, wherein the first set of the data blocks and the second set of the data blocks each comprise more than one data block and an order of the data blocks of the second set of the data blocks is reversed with respect to the order of the data blocks in the first set of the data blocks. 10. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 3 to store data on tapes. 11. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 1 to restore data. 12. A tape storage system comprising a data processor and at least two tape storage drives that store data in data blocks according to the method of claim 2 to restore data. | 2,100 |
5,029 | 14,523,250 | 2,152 | Arrangements relate to crowdsourcing and consolidating user notes taken within a virtual meeting. Notes from one or more meeting attendees can be received. The received user notes can be analyzed to identify a key element therein using natural language processing. The analysis of received user notes can be performed by a processor. A consolidated system notes can be generated. The consolidated system notes can include the key element. | 1. A method of crowdsourcing and consolidating user notes taken within a virtual meeting comprising:
receiving user notes from one or more meeting attendees; via a processor, analyzing the received user notes to identify a key element therein using natural language processing; and generating consolidated system notes that include the key element. 2. The method of claim 1, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof 3. The method of claim 1, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 4. The method of claim 1, further including publishing the consolidated system notes. 5. The method of claim 1, further including:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 6. The method of claim 1, further including:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 7. The method of claim 1, further including:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 8-20. (canceled) | Arrangements relate to crowdsourcing and consolidating user notes taken within a virtual meeting. Notes from one or more meeting attendees can be received. The received user notes can be analyzed to identify a key element therein using natural language processing. The analysis of received user notes can be performed by a processor. A consolidated system notes can be generated. The consolidated system notes can include the key element.1. A method of crowdsourcing and consolidating user notes taken within a virtual meeting comprising:
receiving user notes from one or more meeting attendees; via a processor, analyzing the received user notes to identify a key element therein using natural language processing; and generating consolidated system notes that include the key element. 2. The method of claim 1, wherein analyzing the received user notes to identify a key element therein using natural language processing includes:
analyzing received user notes to identify one or more key elements therein; and cross-referencing the analyses of the received user notes to identify one or more common key elements in the analyses thereof 3. The method of claim 1, wherein analyzing the received user notes to identify a key element therein using natural language processing includes indexing the key elements. 4. The method of claim 1, further including publishing the consolidated system notes. 5. The method of claim 1, further including:
linking the key element in the consolidated system notes to a relevant portion of the user notes from which the key element was extracted. 6. The method of claim 1, further including:
tagging each of the received user notes with a timestamp to indicate when each user note was taken; recording meeting content within the virtual meeting associated with the timestamp; and linking the key element in the consolidated system notes with the associated meeting content within the virtual meeting. 7. The method of claim 1, further including:
receiving an input from a meeting attendee to designate the meeting attendee's user notes as being confidential; and excluding the user notes designated as being confidential from inclusion in the consolidated system note. 8-20. (canceled) | 2,100 |
5,030 | 13,189,131 | 2,128 | Systems and methods are provided for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time. A forecast model selection graph is accessed, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships. A plurality of model forecast nodes are resolved, where resolving a model forecast node includes generating a node forecast for the one or more physical process attributes. A combination node is processed, where a combination node transforms a plurality of node forecasts at child nodes of the combination node into a combined forecast. A selection node is processed, where a selection node chooses a node forecast from among child nodes of the selection node based on a selection criteria. | 1. A computer-implemented method of evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time, the method comprising:
accessing a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolving the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; processing a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; processing a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and processing any additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. 2. The method of claim 1, wherein a node forecast is generated using a model associated with the model forecast node. 3. The method of claim 2, wherein metadata is associated with the model, wherein processing a selection node includes selecting the node forecast based on the metadata associated with the model. 4. The method of claim 3, wherein the metadata identifies a model characteristic of the associated model, wherein the node forecast is selected or not selected based on a match of the model characteristic with a characteristic of one of the physical process attributes. 5. The method of claim 4, wherein the model characteristic is selected from the group consisting of trending, seasonal, intermittent, and transformed. 6. The method of claim 1, wherein a node forecast for one of the physical process attributes includes a plurality of time series forecasts for one or more of the physical process attributes, wherein each of the time series forecasts is associated with a time or time period. 7. The method of claim 6, wherein processing a selection node includes determining an absence of an expected time series forecast during a time period of interest for a node forecast of a child node of the selection node;
wherein the node forecast is not selected based on the absence of the expected time series forecast. 8. The method of claim 6, wherein processing a selection node includes determining a statistic of fit for the plurality of time series forecasts of a node forecast, wherein a node forecast is selected based on the statistic of fit. 9. The method of claim 1, wherein processing a combination node includes:
assigning weights to each of the child nodes of the combination node; multiplying a node forecast at a child node by a weight assigned to the child node to generate a weighted node forecast at the child node; summing weighted time series forecasts of the children nodes of the combination node to generate a combined forecast. 10. The method of claim 9, wherein the weights are a weight type selected from the group consisting of: a simple average, user-defined weights, rank weights, ranked user-weights, AICC weights, root mean square error weights, restricted least squares weights, OLS weights, and least absolute deviation weights. 11. The method of claim 1, wherein processing a selection node includes determining a redundancy factor of a node forecast of a child node, wherein a node forecast is not selected based on the redundancy factor. 12. The method of claim 1, wherein one or more of the node forecasts for one of the physical process attributes are generated by a person. 13. The method of claim 1, further comprising calculating a prediction error for the combined forecast based on a plurality of node forecast errors. 14. The method of claim 1, wherein a selection node is processed prior to processing of a combination node. 15. One or more computer-readable storage mediums for storing data structures for access by an application program being executed on one or more data processors for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, wherein physical process data generated over time is used in the forecasts for the one or more physical process attributes, the data structures that are stored in the one or more computer-readable storage mediums comprising:
a predictive models data structure, the predictive models data structure containing predictive data model records for specifying predictive data models; a forecast model selection graph data structure, wherein the forecast model selection graph data structure contains data about a hierarchical structure of nodes which specify how the forecasts for the one or more physical process attributes are combined, wherein the hierarchical structure of nodes has a root node, and wherein the nodes include model forecast nodes, one or more model combination nodes, and one or more model selection nodes; wherein the forecast model selection graph data structure includes:
model forecast node data which specifies, for the model forecast nodes, which particular predictive data models contained in the predictive models data structure are to be used for generating forecasts;
model combination node data which specifies, for the one or more model combination nodes, which of the forecasts generated by the model forecast nodes are to be combined;
selection node data which specifies, for the one or more model selection nodes, model selection criteria for selecting, based upon model forecasting performance, models associated with the model forecast nodes or the one or more model combination nodes. 16. The one or more computer-readable storage mediums of claim 15, wherein the one or more computer-readable storage mediums include non-volatile storage, volatile storage, and combinations thereof. 17. The one or more computer-readable storage mediums of claim 15, wherein a first predictive data model record contains fields for specifying type of a first predictive data model and parameter values of the first predictive data model. 18. The one or more computer-readable storage mediums of claim 15, wherein a model forecast node data specifies for a model forecast node which particular predictive data model contained in the predictive models data structure is to be used for forecasting by providing an index specifying the particular predicative data model. 19. A computer-implemented system for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time, comprising:
one or more processors; one or more computer-readable storage media containing instructions configured to cause the one or more processors to perform operations including: accessing a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolving the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; processing a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; processing a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and processing additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. 20. A computer program product for providing row-level security, tangibly embodied in a machine-readable storage medium, including instructions configured to cause a data processing system to:
access a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolve the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; process a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; process a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and process additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. | Systems and methods are provided for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time. A forecast model selection graph is accessed, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships. A plurality of model forecast nodes are resolved, where resolving a model forecast node includes generating a node forecast for the one or more physical process attributes. A combination node is processed, where a combination node transforms a plurality of node forecasts at child nodes of the combination node into a combined forecast. A selection node is processed, where a selection node chooses a node forecast from among child nodes of the selection node based on a selection criteria.1. A computer-implemented method of evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time, the method comprising:
accessing a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolving the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; processing a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; processing a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and processing any additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. 2. The method of claim 1, wherein a node forecast is generated using a model associated with the model forecast node. 3. The method of claim 2, wherein metadata is associated with the model, wherein processing a selection node includes selecting the node forecast based on the metadata associated with the model. 4. The method of claim 3, wherein the metadata identifies a model characteristic of the associated model, wherein the node forecast is selected or not selected based on a match of the model characteristic with a characteristic of one of the physical process attributes. 5. The method of claim 4, wherein the model characteristic is selected from the group consisting of trending, seasonal, intermittent, and transformed. 6. The method of claim 1, wherein a node forecast for one of the physical process attributes includes a plurality of time series forecasts for one or more of the physical process attributes, wherein each of the time series forecasts is associated with a time or time period. 7. The method of claim 6, wherein processing a selection node includes determining an absence of an expected time series forecast during a time period of interest for a node forecast of a child node of the selection node;
wherein the node forecast is not selected based on the absence of the expected time series forecast. 8. The method of claim 6, wherein processing a selection node includes determining a statistic of fit for the plurality of time series forecasts of a node forecast, wherein a node forecast is selected based on the statistic of fit. 9. The method of claim 1, wherein processing a combination node includes:
assigning weights to each of the child nodes of the combination node; multiplying a node forecast at a child node by a weight assigned to the child node to generate a weighted node forecast at the child node; summing weighted time series forecasts of the children nodes of the combination node to generate a combined forecast. 10. The method of claim 9, wherein the weights are a weight type selected from the group consisting of: a simple average, user-defined weights, rank weights, ranked user-weights, AICC weights, root mean square error weights, restricted least squares weights, OLS weights, and least absolute deviation weights. 11. The method of claim 1, wherein processing a selection node includes determining a redundancy factor of a node forecast of a child node, wherein a node forecast is not selected based on the redundancy factor. 12. The method of claim 1, wherein one or more of the node forecasts for one of the physical process attributes are generated by a person. 13. The method of claim 1, further comprising calculating a prediction error for the combined forecast based on a plurality of node forecast errors. 14. The method of claim 1, wherein a selection node is processed prior to processing of a combination node. 15. One or more computer-readable storage mediums for storing data structures for access by an application program being executed on one or more data processors for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, wherein physical process data generated over time is used in the forecasts for the one or more physical process attributes, the data structures that are stored in the one or more computer-readable storage mediums comprising:
a predictive models data structure, the predictive models data structure containing predictive data model records for specifying predictive data models; a forecast model selection graph data structure, wherein the forecast model selection graph data structure contains data about a hierarchical structure of nodes which specify how the forecasts for the one or more physical process attributes are combined, wherein the hierarchical structure of nodes has a root node, and wherein the nodes include model forecast nodes, one or more model combination nodes, and one or more model selection nodes; wherein the forecast model selection graph data structure includes:
model forecast node data which specifies, for the model forecast nodes, which particular predictive data models contained in the predictive models data structure are to be used for generating forecasts;
model combination node data which specifies, for the one or more model combination nodes, which of the forecasts generated by the model forecast nodes are to be combined;
selection node data which specifies, for the one or more model selection nodes, model selection criteria for selecting, based upon model forecasting performance, models associated with the model forecast nodes or the one or more model combination nodes. 16. The one or more computer-readable storage mediums of claim 15, wherein the one or more computer-readable storage mediums include non-volatile storage, volatile storage, and combinations thereof. 17. The one or more computer-readable storage mediums of claim 15, wherein a first predictive data model record contains fields for specifying type of a first predictive data model and parameter values of the first predictive data model. 18. The one or more computer-readable storage mediums of claim 15, wherein a model forecast node data specifies for a model forecast node which particular predictive data model contained in the predictive models data structure is to be used for forecasting by providing an index specifying the particular predicative data model. 19. A computer-implemented system for evaluating a physical process with respect to one or more attributes of the physical process by combining forecasts for the one or more physical process attributes, where data for evaluating the physical process is generated over time, comprising:
one or more processors; one or more computer-readable storage media containing instructions configured to cause the one or more processors to perform operations including: accessing a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolving the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; processing a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; processing a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and processing additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. 20. A computer program product for providing row-level security, tangibly embodied in a machine-readable storage medium, including instructions configured to cause a data processing system to:
access a forecast model selection graph, the forecast model selection graph comprising a hierarchy of nodes arranged in parent-child relationships including a root node, the nodes including a selection node, a combination node, and a plurality of model forecast nodes; resolve the plurality of model forecast nodes, resolving a model forecast node including generating a node forecast for the one or more physical process attributes; process a combination node, a combination node transforming a plurality of node forecasts at child nodes of the combination node into a combined forecast; process a selection node, a selection node choosing a node forecast from among child nodes of the selection node based on a selection criteria; and process additional model forecast nodes, combination nodes, and selection nodes until a combined forecast for the one or more physical process attributes is generated at the root node. | 2,100 |
5,031 | 13,679,495 | 2,194 | Aspects of the present disclosure extend to methods and systems for providing computing environments as a service. In various aspects, hardware and/or software resources are automatically provisioned or otherwise allocated to support the different phases of a software development project. One or more interfaces may be accessed that allow for the selection and/or configuration of the various hardware and/or software resources corresponding to a software application and its current computing environment. The configured resources and source code may be provided as a service to users. | 1. A method for providing a computing environment as a service comprising:
initiating, using at least one processor, an instance of a service comprising source code being developed, the service corresponding to a first computing environment; configuring, using the at least one processor, a plurality of resources of the service based on configuration information; and promoting, using the at least one processor, the plurality of resources and the source code to a second computing environment. 2. The method of claim 1, wherein initiating an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 3. The method of claim 1, wherein the plurality of resources comprises a database and an application server. 4. The method of claim 3, further comprising receiving the configuration information via one or more input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 5. The method of claim 1, wherein promoting the plurality of resources comprises promoting the resources as a container. 6. The method of claim 1 wherein promoting the source code comprises executing a work flow to automatically promote the plurality of resources to the second computing environment. 7. The method of claim 1 wherein promoting the source code comprises provisioning a continuous integration server to promote the source code. 8. A system for providing a computing environment as a service comprising:
at least one processor to: initiate an instance of a service including source code being developed, the service corresponding to a first computing environment; configure a plurality of resources of the service based on configuration information; and promote the plurality of resources and the source code to a second computing environment. 9. The system of claim 8, wherein to initiate an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 10. The system of claim 8, wherein the plurality of resources comprises a database and an application server. 11. The system of claim 10, wherein the at least one processor is further configured to receive the configuration information via one or more input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 12. The system of claim 8, wherein to promote the plurality of resources comprises promoting the resources as a container. 13. The system of claim 8, wherein to promote the source code comprises executing a work flow to automatically promote the plurality of resources to the second computing environment. 14. The system of claim 8, wherein to promote the source code comprises provisioning a continuous integration server to promote the source code. 15. A non-transitory computer readable medium encoded with a services application comprising modules executable by a processor, the modules comprising:
a service module to:
initiate an instance of a service comprising source code being developed, the service corresponding to a first computing environment; and
configure a plurality of resources of the service based on configuration information; and
a promotion module to promote the plurality of resources and the source code to a second computing environment. 16. The non-transitory computer readable medium of claim 15, wherein to initiate an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 17. The non-transitory computer readable medium of claim 15, wherein the plurality of resources comprises a database and an application server. 18. The non-transitory computer readable medium of claim 17, wherein the at least one processor is further configured to receive the configuration information via one or input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 19. The non-transitory computer readable medium of claim 15, wherein to promote the plurality of resources comprises promoting the plurality of resources as a container. 20. The non-transitory computer readable medium of claim 15, wherein the promotion module is configured to promote the source code by executing flow to automatically promote the plurality of resources to the second computing environment. | Aspects of the present disclosure extend to methods and systems for providing computing environments as a service. In various aspects, hardware and/or software resources are automatically provisioned or otherwise allocated to support the different phases of a software development project. One or more interfaces may be accessed that allow for the selection and/or configuration of the various hardware and/or software resources corresponding to a software application and its current computing environment. The configured resources and source code may be provided as a service to users.1. A method for providing a computing environment as a service comprising:
initiating, using at least one processor, an instance of a service comprising source code being developed, the service corresponding to a first computing environment; configuring, using the at least one processor, a plurality of resources of the service based on configuration information; and promoting, using the at least one processor, the plurality of resources and the source code to a second computing environment. 2. The method of claim 1, wherein initiating an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 3. The method of claim 1, wherein the plurality of resources comprises a database and an application server. 4. The method of claim 3, further comprising receiving the configuration information via one or more input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 5. The method of claim 1, wherein promoting the plurality of resources comprises promoting the resources as a container. 6. The method of claim 1 wherein promoting the source code comprises executing a work flow to automatically promote the plurality of resources to the second computing environment. 7. The method of claim 1 wherein promoting the source code comprises provisioning a continuous integration server to promote the source code. 8. A system for providing a computing environment as a service comprising:
at least one processor to: initiate an instance of a service including source code being developed, the service corresponding to a first computing environment; configure a plurality of resources of the service based on configuration information; and promote the plurality of resources and the source code to a second computing environment. 9. The system of claim 8, wherein to initiate an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 10. The system of claim 8, wherein the plurality of resources comprises a database and an application server. 11. The system of claim 10, wherein the at least one processor is further configured to receive the configuration information via one or more input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 12. The system of claim 8, wherein to promote the plurality of resources comprises promoting the resources as a container. 13. The system of claim 8, wherein to promote the source code comprises executing a work flow to automatically promote the plurality of resources to the second computing environment. 14. The system of claim 8, wherein to promote the source code comprises provisioning a continuous integration server to promote the source code. 15. A non-transitory computer readable medium encoded with a services application comprising modules executable by a processor, the modules comprising:
a service module to:
initiate an instance of a service comprising source code being developed, the service corresponding to a first computing environment; and
configure a plurality of resources of the service based on configuration information; and
a promotion module to promote the plurality of resources and the source code to a second computing environment. 16. The non-transitory computer readable medium of claim 15, wherein to initiate an instance of a service comprises automatically provisioning an integrated development environment for developing the source code and a code repository to contain the source code. 17. The non-transitory computer readable medium of claim 15, wherein the plurality of resources comprises a database and an application server. 18. The non-transitory computer readable medium of claim 17, wherein the at least one processor is further configured to receive the configuration information via one or input forms displayed at a user interface, the one or more input forms comprising one or more interactive components for configuring the database and the application server. 19. The non-transitory computer readable medium of claim 15, wherein to promote the plurality of resources comprises promoting the plurality of resources as a container. 20. The non-transitory computer readable medium of claim 15, wherein the promotion module is configured to promote the source code by executing flow to automatically promote the plurality of resources to the second computing environment. | 2,100 |
5,032 | 14,548,590 | 2,175 | A system and method for geolocation-based pictographs are provided. In example embodiments, a current geolocation of a user device is determined. A pictograph is identified based on the current geolocation of the user device. The identified pictograph is presented on a user interface of the user device. | 1. A system comprising:
a storage device configured to store a submission from a configuration device of a contributor, the submission comprises a pictograph, a geographic indication that corresponds to the pictograph, and a user-specified condition associated with access to the pictograph; a geolocation module configured to receive a current geolocation of a client device in real time; a pictograph module, implemented using a hardware processor, configured to:
identify the stored pictograph based on the current geolocation of the client device and the geographic indication and
determine satisfaction of the user-specified condition;
a presentation module configured to based on the determined satisfaction of the user-specified condition, cause presentation of the identified pictograph on a user interface of the client device; and a communication module configured to:
receive, from the user device; a request to transmit a user message that includes the identified pictograph and
cause transmission of the user message that includes the identified pictograph to a device of another user. 2. The system of claim 1, wherein the pictograph module is further configured to:
compare the current geolocation and a selected geolocation that corresponds to the pictograph, wherein the selected geolocation is indicated by the geographic indication; and identify the pictograph based on a determination that the user device is within a perimeter of the selected geolocation. 3. A method comprising:
receiving, from a configuration device of a submission user, a submission of a pictograph, a geographic indication corresponding to the pictograph, and a user-specified criterion associated with availability of the pictograph; receiving, from a user device in real time, a request for a pictograph, the request including a current geolocation of the user device; in response to the request for the pictograph, identifying, using a hardware processor of a machine, the pictograph based on the current geolocation of the user device and the geographic indication; determining satisfaction of the user-specified criterion; based on the determined satisfaction of the user-specified criterion, causing presentation of the identified pictograph on a user interface of the user device; receiving, from the user device, a request to transmit a user message that includes the identified pictograph; and causing transmission of the user message that includes the identified pictograph to a device of another user. 4. The method of claim 3, further comprising:
comparing the current geolocation and a specified geolocation corresponding to the pictograph, wherein the specified geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. 5. The method of claim 4, further comprising:
receiving an indication of a time period corresponding to the pictograph and the specified geolocation; and causing presentation of the pictograph on the user interface of the user device in response to the user device being within the perimeter of the specified geolocation during the time period. 6. The method of claim 3, further comprising:
performing a query for an entity identifier corresponding to the current geolocation; comparing the entity identifier with a specified entity identifier corresponding to the pictograph, wherein the specified entity identifier is indicated by the geographic indication; and identifying the pictograph based on a match between the entity identifier and the specified entity identifier. 7. The method of claim 3, further comprising:
causing inclusion of the identified pictograph into a virtual keyboard included in the user interface of the user device, wherein a selection of the pictograph included in the virtual keyboard renders the pictograph alongside characters generated in response to key selections from the virtual keyboard, wherein the virtual keyboard comprises a portable virtual keyboard used in conjunction with a third party application of the user device. 8. The method of claim 3, further comprising:
identifying a display parameter of the user device, the display parameter including at least one of a display resolution, a display text size, or a display image size; and causing a rendering of the identified pictograph based on the identified display parameter. 9. The method of claim 3, further comprising:
preventing the user device from accessing the pictograph based on the current geolocation being outside a perimeter of a specified geolocation indicated by the geographic indication. 10. The method of claim 3, further comprising:
identifying a plurality of pictographs corresponding to the current geolocation; determining a portion of the plurality of pictographs; and causing presentation of the portion of the plurality of pictographs on the user interface of the user device. 11. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
accessing user data corresponding to a user of the user device, the user data including member profile data of the user retrieved from a social messaging service; inferring a user preference based on the user data; and determining the portion of the plurality of pictographs according to the user preference. 12. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
receiving device data from the user device, the device data including sensor data detected at the user device; inferring a user status based on the device data; and determining the portion of the plurality of pictographs according to the user status. 13. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
retrieving, from a third-party server, situational data pertaining to the current geolocation and a current time; and determining the portion of the plurality of pictographs according to the situational data. 14. The method of claim 10, further comprising:
receiving, from the user device, an indication of a selected pictograph among the plurality of pictographs; storing the indication of the selected pictograph in association with a user of the user device; and determining a subsequent portion of the plurality of pictographs according to the stored indication of the selected pictograph. 15. The method of claim 10, further comprising:
accessing indications of a selected pictograph of users other than a user of the user device for respective pictographs of the plurality of pictographs; and determining the portion of the plurality of pictographs according to the indications of the selected pictograph of the users other than the user of the user device. 16. The method of claim 10, further comprising:
ranking the plurality of pictographs according to a popularity of respective pictographs of the plurality of pictographs, the popularity based on a message use count of the respective pictographs of the plurality of pictographs; the message use count incremented for each selection of a particular pictograph by a particular user; and causing presentation of the ranked plurality of pictographs on the user interface of the user device. 17. The method of claim 16, further comprising:
modifying the respective pictographs of the plurality of pictographs to indicate the popularity of the respective pictographs of the plurality of pictographs; and causing presentation of the modified respective pictographs of the plurality of pictographs on the user interface of the user device. 18. The method of claim 10, further comprising:
receiving at least one of a message text or a message image provided at the user device; inferring a predicted preference based on the at least one of the message text or the message image; ranking the plurality of pictographs according to the predicted preference; and causing presentation of the ranked plurality of pictographs on the user interface of the user device. 19. The method of claim 3, further comprising:
receiving, from bidding entities, bid amounts corresponding to the geographic indication; identifying a highest bid amount from among the bid amounts, the highest bid amount corresponding to a winning entity; receiving from the winning entity the pictograph corresponding to the geographic indication; and identifying the pictograph based on the current geolocation of the user device, the geographic indication, and the highest bid amount. 20. The method of claim 3, further comprising:
determining a price corresponding to the geographic indication based on member activity of members of a social messaging service, the member activity being associated with the geographic indication; and providing to the configuration device of the submission user an offer, for sale at the determined price, that includes an option to provide the pictograph to be presented on the user interface of the user device in response to the request associated with the geographic indication. 21. The method of claim 20, wherein the member activity includes at least one of a message send count associated with the geographic indication or an active member count associated with the geographic indication. 22. A method comprising:
determining a current geolocation of a user device; accessing a submission of a custom pictograph, a geographic indication corresponding to the custom pictograph, and a user-specified criterion associated with availability of the pictograph; identifying, using a hardware processor of a machine, the custom pictograph based on the current geolocation of the user device; determining satisfaction of the user-specified criterion; based on the determined satisfaction of the user-specified criterion, causing presentation of the identified custom pictograph on a user interface of the user device; receiving a request to transmit a user message that includes the identified pictograph; and transmitting the user message that includes the identified pictograph to a device of another user. 23. The method of claim 22, further comprising:
storing, at the user device, the custom pictograph and the geographic indication corresponding to the custom pictograph; and identifying the custom pictograph based on the current geolocation and the geographic indication corresponding to the custom pictograph. 24. The method of claim 23, further comprising:
comparing the current geolocation and a specified geolocation corresponding to the pictograph, wherein the specified geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. 25. A machine-readable medium having no transitory signals and storing instructions that, when executed by at least one processor of a machine, cause the machine to perform operations comprising:
receiving, from a configuration device of a submission entity, a submission of an emoticon, a geographic indication corresponding to the emoticon, and an entity-specified criterion associated with availability of the pictograph; receiving geolocation data of a client system in real time; identifying the emoticon based on the geolocation data of the client system and the geographic indication; determining satisfaction of the entity-specified criterion; based on the determined satisfaction of the entity-specified criterion, transmitting the identified emoticon to the user device for presentation on a user interface of the client system; receiving, from the user device, a request to transmit a user message that includes the identified pictograph; and causing transmission of the user message that includes the identified pictograph to a device of another user. 26. The machine-readable medium of claim 25, wherein the operations further comprise:
comparing the current geolocation and a designated geolocation corresponding to the pictograph, wherein the designated geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. | A system and method for geolocation-based pictographs are provided. In example embodiments, a current geolocation of a user device is determined. A pictograph is identified based on the current geolocation of the user device. The identified pictograph is presented on a user interface of the user device.1. A system comprising:
a storage device configured to store a submission from a configuration device of a contributor, the submission comprises a pictograph, a geographic indication that corresponds to the pictograph, and a user-specified condition associated with access to the pictograph; a geolocation module configured to receive a current geolocation of a client device in real time; a pictograph module, implemented using a hardware processor, configured to:
identify the stored pictograph based on the current geolocation of the client device and the geographic indication and
determine satisfaction of the user-specified condition;
a presentation module configured to based on the determined satisfaction of the user-specified condition, cause presentation of the identified pictograph on a user interface of the client device; and a communication module configured to:
receive, from the user device; a request to transmit a user message that includes the identified pictograph and
cause transmission of the user message that includes the identified pictograph to a device of another user. 2. The system of claim 1, wherein the pictograph module is further configured to:
compare the current geolocation and a selected geolocation that corresponds to the pictograph, wherein the selected geolocation is indicated by the geographic indication; and identify the pictograph based on a determination that the user device is within a perimeter of the selected geolocation. 3. A method comprising:
receiving, from a configuration device of a submission user, a submission of a pictograph, a geographic indication corresponding to the pictograph, and a user-specified criterion associated with availability of the pictograph; receiving, from a user device in real time, a request for a pictograph, the request including a current geolocation of the user device; in response to the request for the pictograph, identifying, using a hardware processor of a machine, the pictograph based on the current geolocation of the user device and the geographic indication; determining satisfaction of the user-specified criterion; based on the determined satisfaction of the user-specified criterion, causing presentation of the identified pictograph on a user interface of the user device; receiving, from the user device, a request to transmit a user message that includes the identified pictograph; and causing transmission of the user message that includes the identified pictograph to a device of another user. 4. The method of claim 3, further comprising:
comparing the current geolocation and a specified geolocation corresponding to the pictograph, wherein the specified geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. 5. The method of claim 4, further comprising:
receiving an indication of a time period corresponding to the pictograph and the specified geolocation; and causing presentation of the pictograph on the user interface of the user device in response to the user device being within the perimeter of the specified geolocation during the time period. 6. The method of claim 3, further comprising:
performing a query for an entity identifier corresponding to the current geolocation; comparing the entity identifier with a specified entity identifier corresponding to the pictograph, wherein the specified entity identifier is indicated by the geographic indication; and identifying the pictograph based on a match between the entity identifier and the specified entity identifier. 7. The method of claim 3, further comprising:
causing inclusion of the identified pictograph into a virtual keyboard included in the user interface of the user device, wherein a selection of the pictograph included in the virtual keyboard renders the pictograph alongside characters generated in response to key selections from the virtual keyboard, wherein the virtual keyboard comprises a portable virtual keyboard used in conjunction with a third party application of the user device. 8. The method of claim 3, further comprising:
identifying a display parameter of the user device, the display parameter including at least one of a display resolution, a display text size, or a display image size; and causing a rendering of the identified pictograph based on the identified display parameter. 9. The method of claim 3, further comprising:
preventing the user device from accessing the pictograph based on the current geolocation being outside a perimeter of a specified geolocation indicated by the geographic indication. 10. The method of claim 3, further comprising:
identifying a plurality of pictographs corresponding to the current geolocation; determining a portion of the plurality of pictographs; and causing presentation of the portion of the plurality of pictographs on the user interface of the user device. 11. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
accessing user data corresponding to a user of the user device, the user data including member profile data of the user retrieved from a social messaging service; inferring a user preference based on the user data; and determining the portion of the plurality of pictographs according to the user preference. 12. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
receiving device data from the user device, the device data including sensor data detected at the user device; inferring a user status based on the device data; and determining the portion of the plurality of pictographs according to the user status. 13. The method of claim 10, further comprising determining the portion of the plurality of pictographs by:
retrieving, from a third-party server, situational data pertaining to the current geolocation and a current time; and determining the portion of the plurality of pictographs according to the situational data. 14. The method of claim 10, further comprising:
receiving, from the user device, an indication of a selected pictograph among the plurality of pictographs; storing the indication of the selected pictograph in association with a user of the user device; and determining a subsequent portion of the plurality of pictographs according to the stored indication of the selected pictograph. 15. The method of claim 10, further comprising:
accessing indications of a selected pictograph of users other than a user of the user device for respective pictographs of the plurality of pictographs; and determining the portion of the plurality of pictographs according to the indications of the selected pictograph of the users other than the user of the user device. 16. The method of claim 10, further comprising:
ranking the plurality of pictographs according to a popularity of respective pictographs of the plurality of pictographs, the popularity based on a message use count of the respective pictographs of the plurality of pictographs; the message use count incremented for each selection of a particular pictograph by a particular user; and causing presentation of the ranked plurality of pictographs on the user interface of the user device. 17. The method of claim 16, further comprising:
modifying the respective pictographs of the plurality of pictographs to indicate the popularity of the respective pictographs of the plurality of pictographs; and causing presentation of the modified respective pictographs of the plurality of pictographs on the user interface of the user device. 18. The method of claim 10, further comprising:
receiving at least one of a message text or a message image provided at the user device; inferring a predicted preference based on the at least one of the message text or the message image; ranking the plurality of pictographs according to the predicted preference; and causing presentation of the ranked plurality of pictographs on the user interface of the user device. 19. The method of claim 3, further comprising:
receiving, from bidding entities, bid amounts corresponding to the geographic indication; identifying a highest bid amount from among the bid amounts, the highest bid amount corresponding to a winning entity; receiving from the winning entity the pictograph corresponding to the geographic indication; and identifying the pictograph based on the current geolocation of the user device, the geographic indication, and the highest bid amount. 20. The method of claim 3, further comprising:
determining a price corresponding to the geographic indication based on member activity of members of a social messaging service, the member activity being associated with the geographic indication; and providing to the configuration device of the submission user an offer, for sale at the determined price, that includes an option to provide the pictograph to be presented on the user interface of the user device in response to the request associated with the geographic indication. 21. The method of claim 20, wherein the member activity includes at least one of a message send count associated with the geographic indication or an active member count associated with the geographic indication. 22. A method comprising:
determining a current geolocation of a user device; accessing a submission of a custom pictograph, a geographic indication corresponding to the custom pictograph, and a user-specified criterion associated with availability of the pictograph; identifying, using a hardware processor of a machine, the custom pictograph based on the current geolocation of the user device; determining satisfaction of the user-specified criterion; based on the determined satisfaction of the user-specified criterion, causing presentation of the identified custom pictograph on a user interface of the user device; receiving a request to transmit a user message that includes the identified pictograph; and transmitting the user message that includes the identified pictograph to a device of another user. 23. The method of claim 22, further comprising:
storing, at the user device, the custom pictograph and the geographic indication corresponding to the custom pictograph; and identifying the custom pictograph based on the current geolocation and the geographic indication corresponding to the custom pictograph. 24. The method of claim 23, further comprising:
comparing the current geolocation and a specified geolocation corresponding to the pictograph, wherein the specified geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. 25. A machine-readable medium having no transitory signals and storing instructions that, when executed by at least one processor of a machine, cause the machine to perform operations comprising:
receiving, from a configuration device of a submission entity, a submission of an emoticon, a geographic indication corresponding to the emoticon, and an entity-specified criterion associated with availability of the pictograph; receiving geolocation data of a client system in real time; identifying the emoticon based on the geolocation data of the client system and the geographic indication; determining satisfaction of the entity-specified criterion; based on the determined satisfaction of the entity-specified criterion, transmitting the identified emoticon to the user device for presentation on a user interface of the client system; receiving, from the user device, a request to transmit a user message that includes the identified pictograph; and causing transmission of the user message that includes the identified pictograph to a device of another user. 26. The machine-readable medium of claim 25, wherein the operations further comprise:
comparing the current geolocation and a designated geolocation corresponding to the pictograph, wherein the designated geolocation is indicated by the geographic indication; and identifying the pictograph based on determining that the user device is within a perimeter of the specified geolocation. | 2,100 |
5,033 | 14,198,884 | 2,175 | Embodiments of systems and methods for interpreting physical interactions with a graphical user interface are disclosed. For example, one system for interpreting physical interactions with a graphical user interface is a device having a housing configured to be grasped by a user, a display disposed in the housing, the display configured to display a graphical user interface, and a sensor disposed in the housing, the sensor configured to detect a movement of the housing in a degree of freedom. The device also includes a processor disposed in the housing and in communication with the display and the sensor, the processor configured to receive a sensor signal from the sensor, the sensor signal comprising a parameter associated with the movement, to determine a command associated with the graphical user interface based on the parameter, to determine a function to be executed based on the command, and to execute the function. | 1. A device comprising:
a display configured to display a graphical user interface comprising a shared virtual physical space; a sensor configured to detect user interaction with the shared virtual physical space; a processor in communication with the display and the sensor, the processor configured to:
receive a sensor signal from the sensor, the sensor signal comprising data associated with the user interaction;
receive a remote signal from a remote device, the remote signal associated with the shared virtual physical space;
determine a command based, at least in part, on the user interaction;
determine a function to be executed based, at least in part, on the command; and
execute the function. 2. The device of claim 1, wherein the virtual physical space comprises a plurality of virtual physical objects. 3. The device of claim 1, wherein the virtual physical space comprises a two-dimensional virtual physical space. 4. The device of claim 1, wherein the virtual physical space comprises a three-dimensional virtual physical space. 5. The device of claim 1, further comprising an actuator and wherein the processor is further configured to generate an actuator signal based on user interaction and to output the actuator signal to the actuator to cause the actuator to output a haptic effect. 6. The device of claim 1, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 7. The device of claim 1, wherein the command comprises a command associated with transferring data from the device to the remote device. 8. The device of claim 1, wherein the processor is further configured to determine the command based in part on the remote signal. 9. A method comprising:
displaying a graphical user interface comprising a shared virtual physical space; receiving a sensor signal from a sensor configured to detect a first user interaction with a first device, the first user interaction associated with the shared virtual physical space; receiving a remote signal from a remote device, the remote signal associated with the shared virtual physical space; determining a command based, at least in part, on the user interaction; determining a function to be executed based, at least in part, on the command; and executing the function. 10. The method of claim 9, wherein the virtual physical space comprises a plurality of virtual physical objects. 11. The method of claim 9, wherein the virtual physical space comprises a two-dimensional virtual physical space. 12. The method of claim 9, wherein the virtual physical space comprises a three-dimensional virtual physical space. 13. The method of claim 9, further comprising generating an actuator signal based on the user interaction and outputting the actuator signal to an actuator configured to output a haptic effect. 14. The method of claim 9, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 15. The method of claim 9, wherein the command comprises a command associated with transferring data from the device to the remote device. 16. The method of claim 9, wherein the processor is further configured to determine the command based in part on the remote signal. 17. A non-transitory computer readable medium comprising program code, which when executed by a processor is configured to cause the processor to:
display a graphical user interface comprising a shared virtual physical space; receive a sensor signal from a sensor configured to detect a first user interaction with a first device, the first user interaction associated with the shared virtual physical space; receive a remote signal from a remote device, the remote signal associated with the shared virtual physical space; determine a command based, at least in part, on the user interaction; determine a function to be executed based, at least in part, on the command; and execute the function. 18. The computer readable medium of claim 17, wherein the virtual physical space comprises a three-dimensional virtual physical space. 19. The computer readable medium of claim 17, further comprising program code, which when executed by a processor is configured to cause the processor to generate an actuator signal based on the user interaction and outputting the actuator signal to an actuator configured to output a haptic effect. 20. The computer readable medium of claim 17, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 21. The computer readable medium of claim 17, wherein the processor is further configured to determine the command based in part on the remote signal. | Embodiments of systems and methods for interpreting physical interactions with a graphical user interface are disclosed. For example, one system for interpreting physical interactions with a graphical user interface is a device having a housing configured to be grasped by a user, a display disposed in the housing, the display configured to display a graphical user interface, and a sensor disposed in the housing, the sensor configured to detect a movement of the housing in a degree of freedom. The device also includes a processor disposed in the housing and in communication with the display and the sensor, the processor configured to receive a sensor signal from the sensor, the sensor signal comprising a parameter associated with the movement, to determine a command associated with the graphical user interface based on the parameter, to determine a function to be executed based on the command, and to execute the function.1. A device comprising:
a display configured to display a graphical user interface comprising a shared virtual physical space; a sensor configured to detect user interaction with the shared virtual physical space; a processor in communication with the display and the sensor, the processor configured to:
receive a sensor signal from the sensor, the sensor signal comprising data associated with the user interaction;
receive a remote signal from a remote device, the remote signal associated with the shared virtual physical space;
determine a command based, at least in part, on the user interaction;
determine a function to be executed based, at least in part, on the command; and
execute the function. 2. The device of claim 1, wherein the virtual physical space comprises a plurality of virtual physical objects. 3. The device of claim 1, wherein the virtual physical space comprises a two-dimensional virtual physical space. 4. The device of claim 1, wherein the virtual physical space comprises a three-dimensional virtual physical space. 5. The device of claim 1, further comprising an actuator and wherein the processor is further configured to generate an actuator signal based on user interaction and to output the actuator signal to the actuator to cause the actuator to output a haptic effect. 6. The device of claim 1, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 7. The device of claim 1, wherein the command comprises a command associated with transferring data from the device to the remote device. 8. The device of claim 1, wherein the processor is further configured to determine the command based in part on the remote signal. 9. A method comprising:
displaying a graphical user interface comprising a shared virtual physical space; receiving a sensor signal from a sensor configured to detect a first user interaction with a first device, the first user interaction associated with the shared virtual physical space; receiving a remote signal from a remote device, the remote signal associated with the shared virtual physical space; determining a command based, at least in part, on the user interaction; determining a function to be executed based, at least in part, on the command; and executing the function. 10. The method of claim 9, wherein the virtual physical space comprises a plurality of virtual physical objects. 11. The method of claim 9, wherein the virtual physical space comprises a two-dimensional virtual physical space. 12. The method of claim 9, wherein the virtual physical space comprises a three-dimensional virtual physical space. 13. The method of claim 9, further comprising generating an actuator signal based on the user interaction and outputting the actuator signal to an actuator configured to output a haptic effect. 14. The method of claim 9, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 15. The method of claim 9, wherein the command comprises a command associated with transferring data from the device to the remote device. 16. The method of claim 9, wherein the processor is further configured to determine the command based in part on the remote signal. 17. A non-transitory computer readable medium comprising program code, which when executed by a processor is configured to cause the processor to:
display a graphical user interface comprising a shared virtual physical space; receive a sensor signal from a sensor configured to detect a first user interaction with a first device, the first user interaction associated with the shared virtual physical space; receive a remote signal from a remote device, the remote signal associated with the shared virtual physical space; determine a command based, at least in part, on the user interaction; determine a function to be executed based, at least in part, on the command; and execute the function. 18. The computer readable medium of claim 17, wherein the virtual physical space comprises a three-dimensional virtual physical space. 19. The computer readable medium of claim 17, further comprising program code, which when executed by a processor is configured to cause the processor to generate an actuator signal based on the user interaction and outputting the actuator signal to an actuator configured to output a haptic effect. 20. The computer readable medium of claim 17, wherein the remote signal comprises data associated with a second user interaction with the shared virtual physical space. 21. The computer readable medium of claim 17, wherein the processor is further configured to determine the command based in part on the remote signal. | 2,100 |
5,034 | 12,362,209 | 2,198 | A solver for solving a dynamic constant satisfaction problem that includes a resource sum constraint and a port for coupling zero or more sub-problems to the problem. The solver couples a new sub-problem to the port. The solver then, based at least on the coupling, determines a revised resource sum domain for the problem, the revised resource sum domain including a contribution from existing participants and a contribution from potential participants. | 1. A computer readable media having instructions stored thereon that, when executed by a processor, causes the processor to solve a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the functionality of the instructions comprising:
coupling a first sub-problem to the port; and based at least on the coupling, determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 2. The computer readable media of claim 1, further comprising:
if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 3. The computer readable media of claim 2, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 4. The computer readable media of claim 2, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 5. The computer readable media of claim 1, wherein the constraint satisfaction problem is a product configurator and the sub-problems are components of the configurator. 6. The computer readable media of claim 1, wherein the contribution from existing participants comprises a total of resources of sub-problems coupled to the port. 7. The computer readable media of claim 1, wherein the contribution from potential participants is based at least on a cardinality domain of the port and a domain definition of a resource variable on the first sub-problem. 8. A computer implemented method for solving a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the method comprising:
coupling a first sub-problem to the port; and based at least on the coupling, determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 9. The method of claim 8, further comprising:
if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 10. The method of claim 8, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 11. The method of claim 8, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 12. A constraint solver for solving a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the solver comprising:
means for coupling a first sub-problem to the port; and based at least on the coupling, means for determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 13. A dynamic constraint solver comprising:
a processor; a memory coupled to the processor, the memory storing a constraint satisfaction problem model that comprises a resource sum constraint and at least one port for coupling at least one sub-problem to a problem; a dynamic constraint solver module coupled to the memory; the solver module adapted to coupled a first problem to the port; and based at least on the coupling, determine a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants, and if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 14. The solver of claim 13, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 15. The solver of claim 13, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 16. The solver of claim 13, wherein the solver is a product configurator and the sub-problems are components of the configurator. | A solver for solving a dynamic constant satisfaction problem that includes a resource sum constraint and a port for coupling zero or more sub-problems to the problem. The solver couples a new sub-problem to the port. The solver then, based at least on the coupling, determines a revised resource sum domain for the problem, the revised resource sum domain including a contribution from existing participants and a contribution from potential participants.1. A computer readable media having instructions stored thereon that, when executed by a processor, causes the processor to solve a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the functionality of the instructions comprising:
coupling a first sub-problem to the port; and based at least on the coupling, determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 2. The computer readable media of claim 1, further comprising:
if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 3. The computer readable media of claim 2, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 4. The computer readable media of claim 2, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 5. The computer readable media of claim 1, wherein the constraint satisfaction problem is a product configurator and the sub-problems are components of the configurator. 6. The computer readable media of claim 1, wherein the contribution from existing participants comprises a total of resources of sub-problems coupled to the port. 7. The computer readable media of claim 1, wherein the contribution from potential participants is based at least on a cardinality domain of the port and a domain definition of a resource variable on the first sub-problem. 8. A computer implemented method for solving a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the method comprising:
coupling a first sub-problem to the port; and based at least on the coupling, determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 9. The method of claim 8, further comprising:
if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 10. The method of claim 8, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 11. The method of claim 8, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 12. A constraint solver for solving a dynamic constant satisfaction problem, the problem comprising a resource sum constraint and a port for coupling zero or more sub-problems to the problem, the solver comprising:
means for coupling a first sub-problem to the port; and based at least on the coupling, means for determining a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants. 13. A dynamic constraint solver comprising:
a processor; a memory coupled to the processor, the memory storing a constraint satisfaction problem model that comprises a resource sum constraint and at least one port for coupling at least one sub-problem to a problem; a dynamic constraint solver module coupled to the memory; the solver module adapted to coupled a first problem to the port; and based at least on the coupling, determine a revised resource sum domain for the problem, the revised resource sum domain comprising a contribution from existing participants and a contribution from potential participants, and if the revised resource sum domain is reduced due to a first constraint, recomputing the contribution from existing participants and the contribution from potential participants based at least in part on the reduced domain. 14. The solver of claim 13, further comprising:
if the contribution from potential participants is reduced from the recomputing, computing a revised cardinality domain for the port. 15. The solver of claim 13, further comprising:
if the contribution from potential participants is reduced from the recomputing, generating a second sub-problem coupled to the port. 16. The solver of claim 13, wherein the solver is a product configurator and the sub-problems are components of the configurator. | 2,100 |
5,035 | 13,656,886 | 2,159 | A system includes reception of a query comprising one or more search terms, determination that one of the one or more search terms corresponds to a table column comprising Boolean operators, determination of a value of the table column corresponding to TRUE, and addition of a condition to the query, the condition specifying the value of the table column. | 1. A system comprising:
a data storage device storing data; a computing device comprising:
a memory storing processor-executable program code; and
a processor to execute the processor-executable program code in order to cause the computing device to:
receive a query comprising one or more search terms;
determine that one of the one or more search terms corresponds to a table column comprising Boolean operators;
determine a value of the table column corresponding to TRUE; and
add a condition to the query, the condition specifying the value of the table column. 2. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
remove the one of the one or more search terms from the query. 3. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
add a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 4. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
determine that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the query, the second condition specifying the second value of the second table column. 5. A system according to claim 4, the processor to further execute the processor-executable program code in order to cause the computing device to:
add a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 6. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the table column. 7. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the second table column. 8. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive a query comprising one or more search terms; determine that one of the one or more search terms corresponds to a table column comprising Boolean operators; determine a value of the table column corresponding to TRUE; and add a condition to the query, the condition specifying the value of the table column. 9. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
remove the one of the one or more search terms from the query. 10. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
add a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 11. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
determine that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the query, the second condition specifying the second value of the second table column. 12. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
add a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 13. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the table column. 14. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the second table column. 15. A computer-implemented method comprising:
receiving a query comprising one or more search terms; determining that one of the one or more search terms corresponds to a table column comprising Boolean operators; determining a value of the table column corresponding to TRUE; and adding a condition to the query, the condition specifying the value of the table column. 16. A method according to claim 15, further comprising:
removing the one of the one or more search terms from the query. 17. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
adding a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 18. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
determining that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the second table column corresponding to FALSE; and adding a second condition to the query, the second condition specifying the second value of the second table column. 19. A method according to claim 18, the processor to further execute the processor-executable program code in order to cause the computing device to:
adding a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 20. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
receiving a second query comprising a second one or more search terms; determining that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the table column corresponding to FALSE; and adding a second condition to the second query, the second condition specifying the second value of the table column. 21. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
receiving a second query comprising a second one or more search terms; determining that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the second table column corresponding to FALSE; and adding a second condition to the second query, the second condition specifying the second value of the second table column. | A system includes reception of a query comprising one or more search terms, determination that one of the one or more search terms corresponds to a table column comprising Boolean operators, determination of a value of the table column corresponding to TRUE, and addition of a condition to the query, the condition specifying the value of the table column.1. A system comprising:
a data storage device storing data; a computing device comprising:
a memory storing processor-executable program code; and
a processor to execute the processor-executable program code in order to cause the computing device to:
receive a query comprising one or more search terms;
determine that one of the one or more search terms corresponds to a table column comprising Boolean operators;
determine a value of the table column corresponding to TRUE; and
add a condition to the query, the condition specifying the value of the table column. 2. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
remove the one of the one or more search terms from the query. 3. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
add a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 4. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
determine that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the query, the second condition specifying the second value of the second table column. 5. A system according to claim 4, the processor to further execute the processor-executable program code in order to cause the computing device to:
add a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 6. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the table column. 7. A system according to claim 1, the processor to further execute the processor-executable program code in order to cause the computing device to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the second table column. 8. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive a query comprising one or more search terms; determine that one of the one or more search terms corresponds to a table column comprising Boolean operators; determine a value of the table column corresponding to TRUE; and add a condition to the query, the condition specifying the value of the table column. 9. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
remove the one of the one or more search terms from the query. 10. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
add a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 11. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
determine that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the query, the second condition specifying the second value of the second table column. 12. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
add a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 13. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the table column. 14. A medium according to claim 8, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query comprising a second one or more search terms; determine that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determine a second value of the second table column corresponding to FALSE; and add a second condition to the second query, the second condition specifying the second value of the second table column. 15. A computer-implemented method comprising:
receiving a query comprising one or more search terms; determining that one of the one or more search terms corresponds to a table column comprising Boolean operators; determining a value of the table column corresponding to TRUE; and adding a condition to the query, the condition specifying the value of the table column. 16. A method according to claim 15, further comprising:
removing the one of the one or more search terms from the query. 17. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
adding a second condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 18. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
determining that a second one of the one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the second table column corresponding to FALSE; and adding a second condition to the query, the second condition specifying the second value of the second table column. 19. A method according to claim 18, the processor to further execute the processor-executable program code in order to cause the computing device to:
adding a third condition to the query, the condition to exclude the table column from searches for other ones of the one or more search terms. 20. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
receiving a second query comprising a second one or more search terms; determining that one of the second one or more search terms corresponds to the table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the table column corresponding to FALSE; and adding a second condition to the second query, the second condition specifying the second value of the table column. 21. A method according to claim 15, the processor to further execute the processor-executable program code in order to cause the computing device to:
receiving a second query comprising a second one or more search terms; determining that one of the second one or more search terms corresponds to a second table column comprising Boolean operators, and is associated with an exclusion operator; determining a second value of the second table column corresponding to FALSE; and adding a second condition to the second query, the second condition specifying the second value of the second table column. | 2,100 |
5,036 | 13,830,023 | 2,178 | This invention discloses a novel system and method for displaying electronic documents on remote devices and enabling collaborative editing where the system tracks revisions, comments and other content between versions of the document by maintaining hierarchical representation of the version and mapping locations between the hierarchies. | 1. A method for tracking locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
generating for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; generating a data structure representing a hierarchical representation of the content comprising the first comparison rendition; for at least one piece of content present in the first version, generating a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 2. The method of claim 1 where the determining a mapping steps are comprised of sequentially comparing the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially comparing the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 3. The method of claim 2 further comprising:
for each mapping, generating two cursors, each corresponding to a respective first and second hierarchies being mapped and each cursor referencing a first node from the first hierarchy and a second node from the second hierarchy;
making a first determination whether data type associated with the first node may be ignored, and in dependence thereon, advancing the first cursor to the next node in a search sequence of the first hierarchy;
making a second determination whether the data type associated with the second node may be ignored, and in dependence thereon, advancing the second cursor to the next node in a search sequence of the second hierarchy;
in the case where the first and second determinations do not advance either the first or second cursors, making a third determination whether any of the contents of the first and second nodes match and in dependence thereon, storing in a data file data representing the matching contents. 4. The method of claim 1 further comprising:
using the determined mappings to cause content associated with a mapped location on the second version to be displayed as an overlay at the mapped location of the second version upon the condition that such location of the second version is displayed on the user's device. 5. The method of claim 3 further comprising:
modifying the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 6. The method of claim 1 comprising:
generating a data structure representing a hierarchical representation of the content in the third version of the document;
generating a second comparison rendition between the second version and the third version of the document;
generating a data structure representing a hierarchical representation of the content in the second comparison rendition; and
determining a mapping from the location of the content in the second version to the location of the content in the second comparison rendition and from the location of the content in the second comparison rendition to the location of the content in the third version of the document. 7. The method of claim 6 further comprising:
modifying the third version by applying the edit represented by the mapped content at the location of the mapped content in the third version. 8. A method for tracking locations of content changes to a document, said document comprised of content and said document being embodied by a first and second version, each an individual data file, comprising:
generating a hierarchy of the content in each of the first and second versions of the document; generating a third version of the document comprising a comparison rendition between the first and the second versions of the document; generating a hierarchy of the content comprising the comparison rendition; and generating a mapping between the first and second versions of the document by using the hierarchy of the comparison rendition. 9. The method of claim 8 further comprising:
determining the location of a content item in the second version of the document by means of using the location of the content item in the first version of the document as an input to a determination using the mapping in order to track the position of the content to its modified location in the second version. 10. Method of claim 9 further comprising:
modifying the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 11. The method of claim 10 where the creating a mapping step is further comprised of:
sequentially comparing the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially comparing the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 12. The method of claim 11 where the sequential comparing step is comprised of selectively ignoring certain data comprising the content referenced by the nodes in the hierarchies. 13. The method of claim 1 further comprising: creating a data structure representing the merging of the two mappings. 14. The method of claim 5 further comprising: creating a data structure representing the merging of the four mappings. 15. A method for tracking changes to a document, said document comprised of content and said document being embodied by a first and second versions, each an individual data file, comprising:
generating a comparison of the first and second versions of the document; creating three hierarchies of the content corresponding to the first and second versions and the comparison document, said hierarchies represented by a data structure; generating a data structure representing a mapping from the hierarchy of the first version to the hierarchy of the comparison document; and generating a data structure representing a mapping from the hierarchy of the comparison document to the hierarchy of the second version. 16. The method of claim 15 where the creating step is further comprised of ignoring at least one insertion present in the comparison rendition. 17. The method of claim 15 where the creating step is further comprised of ignoring at least one deletions present in the comparison rendition. 18. A computer system adapted to perform any of the methods recited by claims 1-17. 19. A computer readable data storage device comprised of program code that when executed, causes a computer system to perform any of the methods recited by claims 1-17. 20. A method for tracking locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
the step of generating for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; the step of generating a data structure representing a hierarchical representation of the content in the first comparison rendition. for at least one piece of content present in the first version, the step of generating a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 21. A computer system adapted to track locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
a first component adapted to generate for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; a second component adapted to generate a data structure representing a hierarchical representation of the content in the first comparison rendition. a third component adapted to generate, for at least one piece of content present in the first version, a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 22. The system of claim 21 where the third component is further adapted to sequentially compare the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially compare the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 23. The system of claim 22 where the third component is further adapted to:
generate for each mapping, two cursors, each corresponding to a respective first and second hierarchies being mapped and each cursor referencing a first node from the first hierarchy and a second node from the second hierarchy;
make a first determination whether data type associated with the first node may be ignored, and in dependence thereon, advance the first cursor to the next node in a search sequence of the first hierarchy;
make a second determination whether the data type associated with the second node may be ignored, and in dependence thereon, advance the second cursor to the next node in a search sequence of the second hierarchy;
in the case where the first and second determinations do not advance either the first or second cursors, make a third determination whether any of the contents of the first and second nodes match and in dependence thereon, store in a data file data representing the matching contents. 24. The system of claim 23 further comprised of a fourth component adapted to modify the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 25. The system of claim 21 further comprising;
a component adapted to track the location of at least one comment from the first version to the second version by means of using the two determined mappings to identify the location of the comment in the second version. 26. The method of claim 1 where the first and second versions of the document are data files of two different document encoding format types. 27. The system of claim 21 where the first and second versions of the document are data files of two different document encoding format types. 28. The system of claim 21 further comprising:
a component adapted to use the determined mappings to cause content associated with a mapped location on the second version to be displayed as an overlay at the mapped location of the second version upon the condition that such location of the second version is displayed on the user's device. | This invention discloses a novel system and method for displaying electronic documents on remote devices and enabling collaborative editing where the system tracks revisions, comments and other content between versions of the document by maintaining hierarchical representation of the version and mapping locations between the hierarchies.1. A method for tracking locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
generating for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; generating a data structure representing a hierarchical representation of the content comprising the first comparison rendition; for at least one piece of content present in the first version, generating a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 2. The method of claim 1 where the determining a mapping steps are comprised of sequentially comparing the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially comparing the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 3. The method of claim 2 further comprising:
for each mapping, generating two cursors, each corresponding to a respective first and second hierarchies being mapped and each cursor referencing a first node from the first hierarchy and a second node from the second hierarchy;
making a first determination whether data type associated with the first node may be ignored, and in dependence thereon, advancing the first cursor to the next node in a search sequence of the first hierarchy;
making a second determination whether the data type associated with the second node may be ignored, and in dependence thereon, advancing the second cursor to the next node in a search sequence of the second hierarchy;
in the case where the first and second determinations do not advance either the first or second cursors, making a third determination whether any of the contents of the first and second nodes match and in dependence thereon, storing in a data file data representing the matching contents. 4. The method of claim 1 further comprising:
using the determined mappings to cause content associated with a mapped location on the second version to be displayed as an overlay at the mapped location of the second version upon the condition that such location of the second version is displayed on the user's device. 5. The method of claim 3 further comprising:
modifying the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 6. The method of claim 1 comprising:
generating a data structure representing a hierarchical representation of the content in the third version of the document;
generating a second comparison rendition between the second version and the third version of the document;
generating a data structure representing a hierarchical representation of the content in the second comparison rendition; and
determining a mapping from the location of the content in the second version to the location of the content in the second comparison rendition and from the location of the content in the second comparison rendition to the location of the content in the third version of the document. 7. The method of claim 6 further comprising:
modifying the third version by applying the edit represented by the mapped content at the location of the mapped content in the third version. 8. A method for tracking locations of content changes to a document, said document comprised of content and said document being embodied by a first and second version, each an individual data file, comprising:
generating a hierarchy of the content in each of the first and second versions of the document; generating a third version of the document comprising a comparison rendition between the first and the second versions of the document; generating a hierarchy of the content comprising the comparison rendition; and generating a mapping between the first and second versions of the document by using the hierarchy of the comparison rendition. 9. The method of claim 8 further comprising:
determining the location of a content item in the second version of the document by means of using the location of the content item in the first version of the document as an input to a determination using the mapping in order to track the position of the content to its modified location in the second version. 10. Method of claim 9 further comprising:
modifying the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 11. The method of claim 10 where the creating a mapping step is further comprised of:
sequentially comparing the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially comparing the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 12. The method of claim 11 where the sequential comparing step is comprised of selectively ignoring certain data comprising the content referenced by the nodes in the hierarchies. 13. The method of claim 1 further comprising: creating a data structure representing the merging of the two mappings. 14. The method of claim 5 further comprising: creating a data structure representing the merging of the four mappings. 15. A method for tracking changes to a document, said document comprised of content and said document being embodied by a first and second versions, each an individual data file, comprising:
generating a comparison of the first and second versions of the document; creating three hierarchies of the content corresponding to the first and second versions and the comparison document, said hierarchies represented by a data structure; generating a data structure representing a mapping from the hierarchy of the first version to the hierarchy of the comparison document; and generating a data structure representing a mapping from the hierarchy of the comparison document to the hierarchy of the second version. 16. The method of claim 15 where the creating step is further comprised of ignoring at least one insertion present in the comparison rendition. 17. The method of claim 15 where the creating step is further comprised of ignoring at least one deletions present in the comparison rendition. 18. A computer system adapted to perform any of the methods recited by claims 1-17. 19. A computer readable data storage device comprised of program code that when executed, causes a computer system to perform any of the methods recited by claims 1-17. 20. A method for tracking locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
the step of generating for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; the step of generating a data structure representing a hierarchical representation of the content in the first comparison rendition. for at least one piece of content present in the first version, the step of generating a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 21. A computer system adapted to track locations of content in a document, said document comprised of content and said document being embodied by a first and second version and a first rendition of a comparison between the two versions, each an individual data file, comprising:
a first component adapted to generate for each of the first and second versions of the document, a corresponding data structure representing a hierarchical representation of the content comprising each corresponding version of the document; a second component adapted to generate a data structure representing a hierarchical representation of the content in the first comparison rendition. a third component adapted to generate, for at least one piece of content present in the first version, a data structure representing a mapping of the location of such content to the location of the content in the second version by means of determining a mapping from the location of the content in the first version to a location of the content in the first comparison rendition and a determining of a mapping from the location of the content in the first comparison rendition to the location of the content in the second version. 22. The system of claim 21 where the third component is further adapted to sequentially compare the content referenced by the nodes in the hierarchies of the first version and the comparison rendition and sequentially compare the content referenced by the nodes in the hierarchies of the comparison rendition and the second version. 23. The system of claim 22 where the third component is further adapted to:
generate for each mapping, two cursors, each corresponding to a respective first and second hierarchies being mapped and each cursor referencing a first node from the first hierarchy and a second node from the second hierarchy;
make a first determination whether data type associated with the first node may be ignored, and in dependence thereon, advance the first cursor to the next node in a search sequence of the first hierarchy;
make a second determination whether the data type associated with the second node may be ignored, and in dependence thereon, advance the second cursor to the next node in a search sequence of the second hierarchy;
in the case where the first and second determinations do not advance either the first or second cursors, make a third determination whether any of the contents of the first and second nodes match and in dependence thereon, store in a data file data representing the matching contents. 24. The system of claim 23 further comprised of a fourth component adapted to modify the second version by applying the edit represented by the mapped content at the location of the mapped content in the second version. 25. The system of claim 21 further comprising;
a component adapted to track the location of at least one comment from the first version to the second version by means of using the two determined mappings to identify the location of the comment in the second version. 26. The method of claim 1 where the first and second versions of the document are data files of two different document encoding format types. 27. The system of claim 21 where the first and second versions of the document are data files of two different document encoding format types. 28. The system of claim 21 further comprising:
a component adapted to use the determined mappings to cause content associated with a mapped location on the second version to be displayed as an overlay at the mapped location of the second version upon the condition that such location of the second version is displayed on the user's device. | 2,100 |
5,037 | 13,404,837 | 2,164 | Embodiments including a system for searching through a database using two or three dimensional data or data derived from the two three dimensional data. The database may be populated by searching a network environment to compile two dimensional image or three dimensional model data. A search for two or three dimensional data may be utilized to determine related advertisements that may be shown on a results page in connection with the search results. A database being searched may contain pricing data related to products that are associated with two or three dimensional data. | 1. A method comprising:
accepting a specification via a distributed network the specification including at least one of three dimensional digital content and data that is automatically derived from three-dimensional digital content; using a search process that refers to data that is at least in part three dimensional digital content to find information related to the specification; identifying advertising data relating to at least one of the specification and the information found by the search process; and displaying the advertising data. 2. The method of claim 1 wherein the three dimensional digital content includes information relating to an image of a surface of a subject of the content. 3. The method of claim 1 further comprising:
accessing previously recorded information relating to a user specifying the search; and
modifying at least one of the search process and the specification using the previously recorded information. 4. The method of claim 1 wherein the advertising comprises at least one of a promotional graphic that appears concurrently with the search result, a promotional text that appears concurrently with the search result, a link to promotional information that appears concurrently with the search result, a link to promotional information inserted into the search result, and a promotional email to a user specifying the search. 5. The method of claim 1 wherein using the search process comprises at least one of:
a comparing the specification to an index;
scoring the similarity of the specification to entries in a database;
creating a list of search results based on the scoring; and
sorting search results according to relevancy. 6. A method comprising:
accepting a specification via a distributed network, the specification including at least one of a digital graphical image and data that is automatically derived from a digital graphical image; using a search process that refers to data that is at least in part digital graphical image to find information related to the specification; identifying advertising data relating to at least one of the specification and the information found by the search process; and displaying the advertising data. 7. The method of claim 6 wherein the advertising data comprises at
least one of a promotional graphic that appears concurrently with the search result, a promotional
text that appears concurrently with the search result, a link to promotional information that appears
concurrently with the search result, a link to promotional information inserted into the search result,
and a promotional email to a user specifying the search. 8. The method of claim 6 wherein using the search process comprises at least one of:
comparing the specification to an index;
scoring the similarity of the specification to entries in a database;
creating a list of search results based on the scoring; and
sorting search results according to relevancy. | Embodiments including a system for searching through a database using two or three dimensional data or data derived from the two three dimensional data. The database may be populated by searching a network environment to compile two dimensional image or three dimensional model data. A search for two or three dimensional data may be utilized to determine related advertisements that may be shown on a results page in connection with the search results. A database being searched may contain pricing data related to products that are associated with two or three dimensional data.1. A method comprising:
accepting a specification via a distributed network the specification including at least one of three dimensional digital content and data that is automatically derived from three-dimensional digital content; using a search process that refers to data that is at least in part three dimensional digital content to find information related to the specification; identifying advertising data relating to at least one of the specification and the information found by the search process; and displaying the advertising data. 2. The method of claim 1 wherein the three dimensional digital content includes information relating to an image of a surface of a subject of the content. 3. The method of claim 1 further comprising:
accessing previously recorded information relating to a user specifying the search; and
modifying at least one of the search process and the specification using the previously recorded information. 4. The method of claim 1 wherein the advertising comprises at least one of a promotional graphic that appears concurrently with the search result, a promotional text that appears concurrently with the search result, a link to promotional information that appears concurrently with the search result, a link to promotional information inserted into the search result, and a promotional email to a user specifying the search. 5. The method of claim 1 wherein using the search process comprises at least one of:
a comparing the specification to an index;
scoring the similarity of the specification to entries in a database;
creating a list of search results based on the scoring; and
sorting search results according to relevancy. 6. A method comprising:
accepting a specification via a distributed network, the specification including at least one of a digital graphical image and data that is automatically derived from a digital graphical image; using a search process that refers to data that is at least in part digital graphical image to find information related to the specification; identifying advertising data relating to at least one of the specification and the information found by the search process; and displaying the advertising data. 7. The method of claim 6 wherein the advertising data comprises at
least one of a promotional graphic that appears concurrently with the search result, a promotional
text that appears concurrently with the search result, a link to promotional information that appears
concurrently with the search result, a link to promotional information inserted into the search result,
and a promotional email to a user specifying the search. 8. The method of claim 6 wherein using the search process comprises at least one of:
comparing the specification to an index;
scoring the similarity of the specification to entries in a database;
creating a list of search results based on the scoring; and
sorting search results according to relevancy. | 2,100 |
5,038 | 14,809,336 | 2,129 | A method including receiving a joint parameter for a joint between at least two composite structural components, a ply stackup for each of the at least two composite structural components and an electromagnetic effect parameter in a controller, iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of an electromagnetic effect resistance of the joint and the at least two composite structural components, and changing, with the controller, a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect resistance. | 1. A method comprising:
receiving a joint parameter for a joint between at least two composite structural components, a ply stackup for each of the at least two composite structural components and an electromagnetic effect parameter in a controller; iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of an electromagnetic effect resistance of the joint and the at least two composite structural components; and changing, with the controller, a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect resistance. 2. The method of claim 1, further comprising iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized ply stackup for each of the at least two composite structural components based on at least a convergence of the electromagnetic effect resistance. 3. The method of claim 2, further comprising outputting with the controller, the optimized ply stackup for each of the at least two composite structural components based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 4. The method of claim 2, further comprising determining, with the controller, a joint margin of safety, where the joint margin of safety is a constraint in the determination of the optimized ply stackup. 5. The method of claim 1, further comprising outputting, with the controller, the optimized joint parameter based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 6. The method of claim 1, further comprising determining, with the controller, a joint margin of safety for the joint, where the joint margin of safety is a constraint in the determination of the optimized joint parameters. 7. The method of claim 1, further comprising changing, with the controller, a fastener location in the joint parameter during the iterative processing to reach the convergence of the electromagnetic effect resistance. 8. The method of claim 1, further comprising changing, with the controller, one or more of a number of plies and a ply orientation of each of the at least two composite structural components during the iterative processing to reach the convergence of the electromagnetic effect resistance. 9. A method comprising:
receiving a joint parameter for a joint between at least two composite structural components, a load profile for the joint and an electromagnetic effect parameter in a controller; determining with the controller, a ply stackup for each of the at least two composite structural components; determining with the controller, an electromagnetic effect resistance of the joint and the at least two composite structural components; iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of the electromagnetic effect resistance; and changing with the controller, a value of one or more of the joint parameter and the ply stackup during the iterative processing to reach the convergence of at least the electromagnetic effect resistance. 10. The method of claim 9, further comprising iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized ply stackup for each of the at least two composite structural components based on at least a convergence of the electromagnetic effect resistance. 11. The method of claim 10, further comprising outputting with the controller, the optimized ply stackup for each of the at least two composite structural components based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 12. The method of claim 10, further comprising determining, with the controller, a joint margin of safety, where the joint margin of safety is a constraint in the determination of the optimized ply stackup. 13. The method of claim 9, further comprising outputting, with the controller, the optimized joint parameter based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 14. The method of claim 9, further comprising determining, with the controller, a joint margin of safety for the joint, where the joint margin of safety is a constraint in the determination of the optimized joint parameters. 15. The method of claim 9, further comprising changing, with the controller, a fastener location in the joint parameter during the iterative processing to reach the convergence of the electromagnetic effect resistance. 16. The method of claim 9, further comprising changing, with the controller, one or more of a number of plies and a ply orientation of each of the at least two composite structural components during the iterative processing to reach the convergence of the electromagnetic effect resistance. 17. A computer program product having instructions stored on a non-transitory computer-readable storage medium which, when executed, configure a controller to:
receive joint parameters for a joint between at least two composite structural components; receive a ply stackup for each of the at least two composite structural components; receive electromagnetic effect parameters; iteratively process the joint parameters, the ply stackup and the electromagnetic effect parameters and output optimized joint parameters based on at least a convergence of the electromagnetic effect parameters; and change a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect parameters. 18. The computer program product of claim 17, wherein the joint parameters and the ply stackup are iteratively processed and an optimized ply stackup for each of the at least two composite structural components is output based on at least a convergence of the electromagnetic effect resistance. 19. The method of claim 18, wherein the optimized ply stackup for each of the at least two composite structural components is output based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 20. The method of claim 17, wherein the optimized joint parameters are output based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. | A method including receiving a joint parameter for a joint between at least two composite structural components, a ply stackup for each of the at least two composite structural components and an electromagnetic effect parameter in a controller, iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of an electromagnetic effect resistance of the joint and the at least two composite structural components, and changing, with the controller, a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect resistance.1. A method comprising:
receiving a joint parameter for a joint between at least two composite structural components, a ply stackup for each of the at least two composite structural components and an electromagnetic effect parameter in a controller; iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of an electromagnetic effect resistance of the joint and the at least two composite structural components; and changing, with the controller, a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect resistance. 2. The method of claim 1, further comprising iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized ply stackup for each of the at least two composite structural components based on at least a convergence of the electromagnetic effect resistance. 3. The method of claim 2, further comprising outputting with the controller, the optimized ply stackup for each of the at least two composite structural components based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 4. The method of claim 2, further comprising determining, with the controller, a joint margin of safety, where the joint margin of safety is a constraint in the determination of the optimized ply stackup. 5. The method of claim 1, further comprising outputting, with the controller, the optimized joint parameter based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 6. The method of claim 1, further comprising determining, with the controller, a joint margin of safety for the joint, where the joint margin of safety is a constraint in the determination of the optimized joint parameters. 7. The method of claim 1, further comprising changing, with the controller, a fastener location in the joint parameter during the iterative processing to reach the convergence of the electromagnetic effect resistance. 8. The method of claim 1, further comprising changing, with the controller, one or more of a number of plies and a ply orientation of each of the at least two composite structural components during the iterative processing to reach the convergence of the electromagnetic effect resistance. 9. A method comprising:
receiving a joint parameter for a joint between at least two composite structural components, a load profile for the joint and an electromagnetic effect parameter in a controller; determining with the controller, a ply stackup for each of the at least two composite structural components; determining with the controller, an electromagnetic effect resistance of the joint and the at least two composite structural components; iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized joint parameter based on at least a convergence of the electromagnetic effect resistance; and changing with the controller, a value of one or more of the joint parameter and the ply stackup during the iterative processing to reach the convergence of at least the electromagnetic effect resistance. 10. The method of claim 9, further comprising iteratively processing with the controller, the joint parameter and the ply stackup and outputting an optimized ply stackup for each of the at least two composite structural components based on at least a convergence of the electromagnetic effect resistance. 11. The method of claim 10, further comprising outputting with the controller, the optimized ply stackup for each of the at least two composite structural components based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 12. The method of claim 10, further comprising determining, with the controller, a joint margin of safety, where the joint margin of safety is a constraint in the determination of the optimized ply stackup. 13. The method of claim 9, further comprising outputting, with the controller, the optimized joint parameter based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 14. The method of claim 9, further comprising determining, with the controller, a joint margin of safety for the joint, where the joint margin of safety is a constraint in the determination of the optimized joint parameters. 15. The method of claim 9, further comprising changing, with the controller, a fastener location in the joint parameter during the iterative processing to reach the convergence of the electromagnetic effect resistance. 16. The method of claim 9, further comprising changing, with the controller, one or more of a number of plies and a ply orientation of each of the at least two composite structural components during the iterative processing to reach the convergence of the electromagnetic effect resistance. 17. A computer program product having instructions stored on a non-transitory computer-readable storage medium which, when executed, configure a controller to:
receive joint parameters for a joint between at least two composite structural components; receive a ply stackup for each of the at least two composite structural components; receive electromagnetic effect parameters; iteratively process the joint parameters, the ply stackup and the electromagnetic effect parameters and output optimized joint parameters based on at least a convergence of the electromagnetic effect parameters; and change a value of one or more of the joint parameters and the ply stackup during the iterative processing to reach the convergence of the electromagnetic effect parameters. 18. The computer program product of claim 17, wherein the joint parameters and the ply stackup are iteratively processed and an optimized ply stackup for each of the at least two composite structural components is output based on at least a convergence of the electromagnetic effect resistance. 19. The method of claim 18, wherein the optimized ply stackup for each of the at least two composite structural components is output based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. 20. The method of claim 17, wherein the optimized joint parameters are output based on the convergence of the electromagnetic effect resistance and a convergence of a weight of the at least two composite structural components. | 2,100 |
5,039 | 15,389,402 | 2,136 | A memory controller includes logic circuitry to generate a first data address identifying a location in a first external memory array for storing first data, a first tag address identifying a location in a second external memory array for storing a first tag, a second data address identifying a location in the second external memory array for storing second data, and a second tag address identifying a location in the first external memory array for storing a second tag. The memory controller includes an interface that transfers the first data address and the first tag address for a first set of memory operations in the first and the second external memory arrays. The interface transfers the second data address and the second tag address for a second set of memory operations in the first and the second external memory arrays. | 1. (canceled) 2. A memory device comprising:
a first bank group of memory storage locations; a second bank group of memory storage locations; interface circuitry responsive to a memory access command to select one of the first bank group of memory storage locations or the second bank group of memory storage locations for a memory access, the selection identified by a unique bank group address; wherein access to the first bank group of storage locations involves an access for first data; and wherein access to the second bank group of storage locations involves an access for first tag information associated with the first data. 3. The memory device according to claim 2, wherein the interface circuitry includes a first interface circuit dedicated to the first bank group, and a second interface circuit dedicated to the second bank group. 4. The memory device according to claim 3, wherein:
the first interface circuit includes a first address interface to receive first bank group address information and a first data interface; and the second interface circuit includes a second address interface to receive second bank group address information and a second data interface. 5. The memory device according to claim 2, wherein:
the tag information includes information at least partially identifying the location of the data. 6. The memory device according to claim 2, realized as a dynamic random access memory (DRAM) device. 7. The memory device according to claim 2, wherein each bank group includes multiple banks, each bank being selectable via a bank address. 8. The memory device according to claim 2, wherein:
a subsequent access to the first bank group of storage locations involves an access for second tag information; and a subsequent access to the second bank group of storage locations involves an access for second data associated with the second tag information. 9. A method of operation in a memory device, the method comprising:
receiving a memory access command; in response to the memory access command, selecting one of a first bank group of memory storage locations or a second bank group of memory storage locations for a memory access, the selecting based on a unique bank group address; wherein selecting the first bank group of storage locations is based on an access for first data; and wherein selecting the second bank group of storage locations is based on an access for first tag information associated with the first data. 10. The method according to claim 9, wherein:
the tag information includes information at least partially identifying the location of the data. 11. The method according to claim 9, wherein:
the selecting of the first bank group is carried out by a first interface circuit dedicated to the first bank group; and the selecting of the second bank group is carried out by a second interface circuit dedicated to the second bank group. 12. The method according to claim 11, wherein:
the selecting of the first bank group is responsive to the first interface circuit receiving first bank group address information specifying the first bank group; and the selecting of the second bank group is responsive to the second interface circuit receiving second bank group address information specifying the second bank group. 13. The method according to claim 9, further comprising:
subsequently accessing the first bank group of storage locations for second tag information; and subsequently accessing the second bank group of storage locations for second data associated with the second tag information. 14. The method according to claim 9, wherein each bank group includes multiple banks, the method further comprising:
selecting a given bank within each bank group via a unique bank address. 15. An integrated circuit (IC) chip comprising:
means for receiving a memory access command; means for selecting one of a first bank group of memory storage locations or a second bank group of memory storage locations for a memory access in response to the memory access command, the selecting based on a unique bank group address; wherein the means for selecting the first bank group of storage locations is responsive to an access for first data; and wherein the means for selecting the second bank group of storage locations is responsive to an access for first tag information associated with the first data. 16. The IC chip according to claim 15, embodied as a dynamic random access memory (DRAM) memory chip. 17. The IC chip according to claim 15, wherein:
the tag information includes information at least partially identifying the location of the data. 18. The IC chip according to claim 15, wherein:
the means for selecting the first bank group comprises a first interface circuit dedicated to the first bank group; and the means for selecting the second bank group comprises a second interface circuit dedicated to the second bank group. 19. The IC chip according to claim 18, wherein:
the first interface circuit selects the first bank group in response to receiving first bank group address information specifying the first bank group; and the second interface circuit selects the second bank group in response to receiving second bank group address information specifying the second bank group. 20. The IC chip according to claim 15, wherein each bank group includes multiple banks, the method further comprising:
means for selecting a given bank within each bank group via a unique bank address. 21. The IC chip according to claim 15, further comprising:
means for receiving a second access command; means for subsequently accessing the first bank group of storage locations for second tag information; and means for subsequently accessing the second bank group of storage locations for second data associated with the second tag information. | A memory controller includes logic circuitry to generate a first data address identifying a location in a first external memory array for storing first data, a first tag address identifying a location in a second external memory array for storing a first tag, a second data address identifying a location in the second external memory array for storing second data, and a second tag address identifying a location in the first external memory array for storing a second tag. The memory controller includes an interface that transfers the first data address and the first tag address for a first set of memory operations in the first and the second external memory arrays. The interface transfers the second data address and the second tag address for a second set of memory operations in the first and the second external memory arrays.1. (canceled) 2. A memory device comprising:
a first bank group of memory storage locations; a second bank group of memory storage locations; interface circuitry responsive to a memory access command to select one of the first bank group of memory storage locations or the second bank group of memory storage locations for a memory access, the selection identified by a unique bank group address; wherein access to the first bank group of storage locations involves an access for first data; and wherein access to the second bank group of storage locations involves an access for first tag information associated with the first data. 3. The memory device according to claim 2, wherein the interface circuitry includes a first interface circuit dedicated to the first bank group, and a second interface circuit dedicated to the second bank group. 4. The memory device according to claim 3, wherein:
the first interface circuit includes a first address interface to receive first bank group address information and a first data interface; and the second interface circuit includes a second address interface to receive second bank group address information and a second data interface. 5. The memory device according to claim 2, wherein:
the tag information includes information at least partially identifying the location of the data. 6. The memory device according to claim 2, realized as a dynamic random access memory (DRAM) device. 7. The memory device according to claim 2, wherein each bank group includes multiple banks, each bank being selectable via a bank address. 8. The memory device according to claim 2, wherein:
a subsequent access to the first bank group of storage locations involves an access for second tag information; and a subsequent access to the second bank group of storage locations involves an access for second data associated with the second tag information. 9. A method of operation in a memory device, the method comprising:
receiving a memory access command; in response to the memory access command, selecting one of a first bank group of memory storage locations or a second bank group of memory storage locations for a memory access, the selecting based on a unique bank group address; wherein selecting the first bank group of storage locations is based on an access for first data; and wherein selecting the second bank group of storage locations is based on an access for first tag information associated with the first data. 10. The method according to claim 9, wherein:
the tag information includes information at least partially identifying the location of the data. 11. The method according to claim 9, wherein:
the selecting of the first bank group is carried out by a first interface circuit dedicated to the first bank group; and the selecting of the second bank group is carried out by a second interface circuit dedicated to the second bank group. 12. The method according to claim 11, wherein:
the selecting of the first bank group is responsive to the first interface circuit receiving first bank group address information specifying the first bank group; and the selecting of the second bank group is responsive to the second interface circuit receiving second bank group address information specifying the second bank group. 13. The method according to claim 9, further comprising:
subsequently accessing the first bank group of storage locations for second tag information; and subsequently accessing the second bank group of storage locations for second data associated with the second tag information. 14. The method according to claim 9, wherein each bank group includes multiple banks, the method further comprising:
selecting a given bank within each bank group via a unique bank address. 15. An integrated circuit (IC) chip comprising:
means for receiving a memory access command; means for selecting one of a first bank group of memory storage locations or a second bank group of memory storage locations for a memory access in response to the memory access command, the selecting based on a unique bank group address; wherein the means for selecting the first bank group of storage locations is responsive to an access for first data; and wherein the means for selecting the second bank group of storage locations is responsive to an access for first tag information associated with the first data. 16. The IC chip according to claim 15, embodied as a dynamic random access memory (DRAM) memory chip. 17. The IC chip according to claim 15, wherein:
the tag information includes information at least partially identifying the location of the data. 18. The IC chip according to claim 15, wherein:
the means for selecting the first bank group comprises a first interface circuit dedicated to the first bank group; and the means for selecting the second bank group comprises a second interface circuit dedicated to the second bank group. 19. The IC chip according to claim 18, wherein:
the first interface circuit selects the first bank group in response to receiving first bank group address information specifying the first bank group; and the second interface circuit selects the second bank group in response to receiving second bank group address information specifying the second bank group. 20. The IC chip according to claim 15, wherein each bank group includes multiple banks, the method further comprising:
means for selecting a given bank within each bank group via a unique bank address. 21. The IC chip according to claim 15, further comprising:
means for receiving a second access command; means for subsequently accessing the first bank group of storage locations for second tag information; and means for subsequently accessing the second bank group of storage locations for second data associated with the second tag information. | 2,100 |
5,040 | 15,488,649 | 2,185 | Methods and systems for improved control of traffic generated by a processor are described. In an embodiment, when a device generates a pre-fetch request for a piece of data or an instruction from a memory hierarchy, the device includes a pre-fetch identifier in the request. This identifier flags the request as a pre-fetch request rather than a non-pre-fetch request, such as a time-critical request. Based on this identifier, the memory hierarchy can then issue an abort response at times of high traffic which suppresses the pre-fetch traffic, as the pre-fetch traffic is not fulfilled by the memory hierarchy. On receipt of an abort response, the device deletes at least a part of any record of the pre-fetch request and if the data/instruction is later required, a new request is issued at a higher priority than the original pre-fetch request. | 1. A system comprising:
a plurality of devices arranged to generate requests for items from a memory hierarchy, wherein an item comprises a piece of data or an instruction; at least a portion of the memory hierarchy; and at least one bus connecting the plurality of devices and the memory hierarchy, wherein the memory hierarchy comprises: abort response generating logic arranged to determine whether to generate an abort response based on a pre-fetch identifier in a pre-fetch request received from one of the plurality of devices and an assessment of traffic levels within a part of the memory hierarchy and if the determination is positive, to generate the abort response and transmit the abort response to the device from which the pre-fetch request was received. 2. The system as set forth in claim 1, wherein the memory hierarchy further comprises:
traffic assessment logic arranged to compare a measure of traffic levels and one or more threshold values. 3. The system as set forth in claim 1, wherein determining whether to generate an abort response corresponding to the pre-fetch request comprises:
determining that an abort response is to be generated if a pre-fetch identifier is included within the request and if traffic levels exceed a predefined level; and determining that an abort response is not to be generated if no pre-fetch identifier is included within the request and/or if traffic levels do not exceed the predefined level. 4. The system as set forth in claim 1, wherein determining whether to generate an abort response corresponding to the pre-fetch request comprises:
determining that an abort response is to be generated if the pre-fetch identifier satisfies filter criteria and if traffic levels exceed a predefined level; and determining that an abort response is not to be generated if no pre-fetch identifier is included within the request, if the pre-fetch identifier does not satisfy the filter criteria and/or if traffic levels do not exceed the predefined level. 5. The system as set forth in claim 4, further comprising:
hardware logic arranged to dynamically update the filter criteria based on an assessment of traffic levels within a part of the memory hierarchy. 6. A system comprising:
a device arranged to generate requests for items from a memory hierarchy, wherein an item comprises a piece of data or an instruction; and at least a portion of the memory hierarchy, the portion comprising logic arranged to generate an abort all response; wherein the device is further arranged, in response to receiving the abort all response, to remove at least a portion of data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy. 7. The system as set forth in claim 6, wherein portion of the memory hierarchy comprises an L3 cache and the L3 cache comprises the logic arranged to generate an abort all response. 8. The system as set forth in claim 6, wherein the memory hierarchy comprises main memory and the logic is arranged to generate an abort all response in response to detecting that memory access to the main memory has been reset. 9. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by receipt of a request from the device. 10. The system as set forth in claim 9, wherein the generation of the abort all response in the logic is triggered by receipt of a request from the device and further involves one or more other triggering factors. 11. The system as set forth in claim 9, wherein the request is a time-critical request or a pre-fetch request. 12. The system as set forth in claim 9, wherein the request is a pre-fetch request and the device is further arranged to insert a pre-fetch identifier into the request. 13. The system as set forth in claim 6, wherein removing at least a portion of data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy comprises:
removing all of the data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy. 14. The system as set forth in claim 6, wherein the device is further arranged, subsequent to removing at least a portion of data stored locally relating to a request for a data item, to transmit a new request for the data item to the memory hierarchy. 15. The system as set forth in claim 14, wherein the request is a pre-fetch request and the new request is a non-pre-fetch request. 16. The system as set forth in claim 6, wherein the device is further arranged, in response to receiving the abort all response, to trigger a hardware or software operation. 17. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by a status event of the memory hierarchy. 18. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by a power off operation to memory within the memory hierarchy. 19. A non-transitory computer readable storage medium having stored thereon a computer readable description of hardware components that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture a device comprising:
first hardware logic arranged to attach a pre-fetch identifier to a pre-fetch request to flag the pre-fetch request as a pre-fetch request, rather than a non-pre-fetch request, the pre-fetch request requesting an item from a memory hierarchy, wherein the item comprises a piece of data or an instruction; and second hardware logic arranged to remove at least a portion of data stored locally to the device relating to a pre-fetch request in response to receiving an abort response corresponding to the pre-fetch request generated by a node of the memory hierarchy based on the pre-fetch identifier. | Methods and systems for improved control of traffic generated by a processor are described. In an embodiment, when a device generates a pre-fetch request for a piece of data or an instruction from a memory hierarchy, the device includes a pre-fetch identifier in the request. This identifier flags the request as a pre-fetch request rather than a non-pre-fetch request, such as a time-critical request. Based on this identifier, the memory hierarchy can then issue an abort response at times of high traffic which suppresses the pre-fetch traffic, as the pre-fetch traffic is not fulfilled by the memory hierarchy. On receipt of an abort response, the device deletes at least a part of any record of the pre-fetch request and if the data/instruction is later required, a new request is issued at a higher priority than the original pre-fetch request.1. A system comprising:
a plurality of devices arranged to generate requests for items from a memory hierarchy, wherein an item comprises a piece of data or an instruction; at least a portion of the memory hierarchy; and at least one bus connecting the plurality of devices and the memory hierarchy, wherein the memory hierarchy comprises: abort response generating logic arranged to determine whether to generate an abort response based on a pre-fetch identifier in a pre-fetch request received from one of the plurality of devices and an assessment of traffic levels within a part of the memory hierarchy and if the determination is positive, to generate the abort response and transmit the abort response to the device from which the pre-fetch request was received. 2. The system as set forth in claim 1, wherein the memory hierarchy further comprises:
traffic assessment logic arranged to compare a measure of traffic levels and one or more threshold values. 3. The system as set forth in claim 1, wherein determining whether to generate an abort response corresponding to the pre-fetch request comprises:
determining that an abort response is to be generated if a pre-fetch identifier is included within the request and if traffic levels exceed a predefined level; and determining that an abort response is not to be generated if no pre-fetch identifier is included within the request and/or if traffic levels do not exceed the predefined level. 4. The system as set forth in claim 1, wherein determining whether to generate an abort response corresponding to the pre-fetch request comprises:
determining that an abort response is to be generated if the pre-fetch identifier satisfies filter criteria and if traffic levels exceed a predefined level; and determining that an abort response is not to be generated if no pre-fetch identifier is included within the request, if the pre-fetch identifier does not satisfy the filter criteria and/or if traffic levels do not exceed the predefined level. 5. The system as set forth in claim 4, further comprising:
hardware logic arranged to dynamically update the filter criteria based on an assessment of traffic levels within a part of the memory hierarchy. 6. A system comprising:
a device arranged to generate requests for items from a memory hierarchy, wherein an item comprises a piece of data or an instruction; and at least a portion of the memory hierarchy, the portion comprising logic arranged to generate an abort all response; wherein the device is further arranged, in response to receiving the abort all response, to remove at least a portion of data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy. 7. The system as set forth in claim 6, wherein portion of the memory hierarchy comprises an L3 cache and the L3 cache comprises the logic arranged to generate an abort all response. 8. The system as set forth in claim 6, wherein the memory hierarchy comprises main memory and the logic is arranged to generate an abort all response in response to detecting that memory access to the main memory has been reset. 9. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by receipt of a request from the device. 10. The system as set forth in claim 9, wherein the generation of the abort all response in the logic is triggered by receipt of a request from the device and further involves one or more other triggering factors. 11. The system as set forth in claim 9, wherein the request is a time-critical request or a pre-fetch request. 12. The system as set forth in claim 9, wherein the request is a pre-fetch request and the device is further arranged to insert a pre-fetch identifier into the request. 13. The system as set forth in claim 6, wherein removing at least a portion of data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy comprises:
removing all of the data stored locally relating to any unfulfilled requests for data items stored in the memory hierarchy previously sent to the memory hierarchy. 14. The system as set forth in claim 6, wherein the device is further arranged, subsequent to removing at least a portion of data stored locally relating to a request for a data item, to transmit a new request for the data item to the memory hierarchy. 15. The system as set forth in claim 14, wherein the request is a pre-fetch request and the new request is a non-pre-fetch request. 16. The system as set forth in claim 6, wherein the device is further arranged, in response to receiving the abort all response, to trigger a hardware or software operation. 17. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by a status event of the memory hierarchy. 18. The system as set forth in claim 6, wherein the generation of the abort all response in the logic is triggered by a power off operation to memory within the memory hierarchy. 19. A non-transitory computer readable storage medium having stored thereon a computer readable description of hardware components that, when processed in an integrated circuit manufacturing system, causes the integrated circuit manufacturing system to manufacture a device comprising:
first hardware logic arranged to attach a pre-fetch identifier to a pre-fetch request to flag the pre-fetch request as a pre-fetch request, rather than a non-pre-fetch request, the pre-fetch request requesting an item from a memory hierarchy, wherein the item comprises a piece of data or an instruction; and second hardware logic arranged to remove at least a portion of data stored locally to the device relating to a pre-fetch request in response to receiving an abort response corresponding to the pre-fetch request generated by a node of the memory hierarchy based on the pre-fetch identifier. | 2,100 |
5,041 | 14,150,735 | 2,122 | A data management system is provided that comprises a data collation module configured to collect data for a problem statement specified by a client. The data collation system comprises a situation control question (SCQ) module configured to create a SCQ matrix. The SCQ matrix is configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement. The data collation system also comprises a factor map module configured to create a factor map to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem. The data collation system further comprises a hypothesis module configured to create a hypothesis matrix that enables one or more users to formulate one or more hypotheses based on the problem statement. The data management system further comprises memory circuitry coupled to the data collation module and configured to store data related to the problem statement. | 1. A data management system comprising:
a data collation module configured to collect data for a problem statement, wherein the problem statement is specified by a client, and wherein the data collation system comprises: a situation control question (SCQ) module configured to create a SCQ matrix; wherein the SCQ map is configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement; a factor map module configured to create a factor map; wherein the factor map interface is configured to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem; a hypothesis module configured to create a hypothesis matrix, wherein the hypothesis matrix is configured to enable one or more users to formulate one or more hypotheses based on the problem statement; and memory circuitry coupled to the data collation module and configured to store data related to the problem statement. 2. The data management system of claim 1, wherein the SCQ matrix is further configured to enable one or more users to identify gaps between the current state and the desired solution. 3. The data management system of claim 2, wherein the SCQ matrix is further configured to enable one or more users to provide one or more questions related to the desired solution. 4. The data management system of claim 1, wherein the factor map is further configured to enable one or more users to add and/or delete factors contributing to the problem. 5. The data management system of claim 1, wherein the hypothesis matrix is configured to enable one or more users to add and/or delete a plurality of component questions to each hypothesis in the hypothesis matrix. 6. The data management system of claim 5, wherein the hypothesis matrix is configured to enable one or more users to add and/or delete a plurality of data elements to each hypothesis in the hypothesis matrix. 7. The data management system of claim 1, wherein the data collation module further comprises a structured questionnaire module configured to provide a structured questionnaire to enable one or more users to provide answers to a plurality of questions. 8. The data management system of claim 7, wherein the structured questionnaire comprises a plurality of pre-defined questions. 9. The data management system of claim 1, wherein the data collation module further comprises a quality check questionnaire module configured to create a quality check chart. 10. The data management system of claim 1, wherein the quality check chart comprises a metric and an expectation comparison. 11. The data management system of claim 1, wherein the data collation module is hosted on a shared network to enable access by a plurality of users. 12. The data management system of claim 1, wherein the memory circuitry comprises a library configured to store a plurality of problem statements defined by a plurality of clients. 13. The data management system of claim 5, wherein the library comprises a search option configured to enable one or more users to search the plurality of problem statements and access corresponding data stored in the library. 14. A data management tool for collating data for a defined problem statement, the data management tool comprising:
a SCQ interface configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement; a factor map interface configured to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem; and a hypothesis interface configured to enable one or more users to formulate one or more hypotheses based on the problem statement; wherein the one or more hypotheses are represented together in a hypothesis matrix. 15. The data management tool of claim 14, wherein the SCQ interface is further configured to:
enable one or more users to identify gaps between the current state and the desired solution; and enable one or more users to provide one or more questions related to the desired solution. 16. The data management tool of claim 14, wherein the factor map interface is further configured to enable one or more users to add and/or delete factors contributing to the problem. 17. The data management tool of claim 14, wherein the hypothesis interface is configured to enable one or more users to add and/or delete a plurality of component questions to each hypothesis in the hypothesis matrix and a plurality of data elements to each hypothesis in the hypothesis matrix. 18. The data management tool of claim 14, further comprising a structured questionnaire interface configured to enable one or more users to provide answers to a plurality of questions; wherein the structured questionnaire interface comprises a plurality of pre-defined questions. 19. The data management tool of claim 14, further comprises a quality check questionnaire configured to create a quality check chart; wherein the quality check chart comprises a metric and an expectation comparison. 20. The data management tool of claim 14, further comprising a library configured to store a plurality of problem statements defined by a plurality of clients; wherein the library comprises a search option configured to enable one or more users to search the plurality of problem statements and access corresponding data stored in the library. | A data management system is provided that comprises a data collation module configured to collect data for a problem statement specified by a client. The data collation system comprises a situation control question (SCQ) module configured to create a SCQ matrix. The SCQ matrix is configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement. The data collation system also comprises a factor map module configured to create a factor map to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem. The data collation system further comprises a hypothesis module configured to create a hypothesis matrix that enables one or more users to formulate one or more hypotheses based on the problem statement. The data management system further comprises memory circuitry coupled to the data collation module and configured to store data related to the problem statement.1. A data management system comprising:
a data collation module configured to collect data for a problem statement, wherein the problem statement is specified by a client, and wherein the data collation system comprises: a situation control question (SCQ) module configured to create a SCQ matrix; wherein the SCQ map is configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement; a factor map module configured to create a factor map; wherein the factor map interface is configured to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem; a hypothesis module configured to create a hypothesis matrix, wherein the hypothesis matrix is configured to enable one or more users to formulate one or more hypotheses based on the problem statement; and memory circuitry coupled to the data collation module and configured to store data related to the problem statement. 2. The data management system of claim 1, wherein the SCQ matrix is further configured to enable one or more users to identify gaps between the current state and the desired solution. 3. The data management system of claim 2, wherein the SCQ matrix is further configured to enable one or more users to provide one or more questions related to the desired solution. 4. The data management system of claim 1, wherein the factor map is further configured to enable one or more users to add and/or delete factors contributing to the problem. 5. The data management system of claim 1, wherein the hypothesis matrix is configured to enable one or more users to add and/or delete a plurality of component questions to each hypothesis in the hypothesis matrix. 6. The data management system of claim 5, wherein the hypothesis matrix is configured to enable one or more users to add and/or delete a plurality of data elements to each hypothesis in the hypothesis matrix. 7. The data management system of claim 1, wherein the data collation module further comprises a structured questionnaire module configured to provide a structured questionnaire to enable one or more users to provide answers to a plurality of questions. 8. The data management system of claim 7, wherein the structured questionnaire comprises a plurality of pre-defined questions. 9. The data management system of claim 1, wherein the data collation module further comprises a quality check questionnaire module configured to create a quality check chart. 10. The data management system of claim 1, wherein the quality check chart comprises a metric and an expectation comparison. 11. The data management system of claim 1, wherein the data collation module is hosted on a shared network to enable access by a plurality of users. 12. The data management system of claim 1, wherein the memory circuitry comprises a library configured to store a plurality of problem statements defined by a plurality of clients. 13. The data management system of claim 5, wherein the library comprises a search option configured to enable one or more users to search the plurality of problem statements and access corresponding data stored in the library. 14. A data management tool for collating data for a defined problem statement, the data management tool comprising:
a SCQ interface configured to enable one or more users to define a current state and a desired solution of a problem defined by the problem statement; a factor map interface configured to enable one or more users to enumerate a plurality of factors that directly and/or indirectly contribute to the problem; and a hypothesis interface configured to enable one or more users to formulate one or more hypotheses based on the problem statement; wherein the one or more hypotheses are represented together in a hypothesis matrix. 15. The data management tool of claim 14, wherein the SCQ interface is further configured to:
enable one or more users to identify gaps between the current state and the desired solution; and enable one or more users to provide one or more questions related to the desired solution. 16. The data management tool of claim 14, wherein the factor map interface is further configured to enable one or more users to add and/or delete factors contributing to the problem. 17. The data management tool of claim 14, wherein the hypothesis interface is configured to enable one or more users to add and/or delete a plurality of component questions to each hypothesis in the hypothesis matrix and a plurality of data elements to each hypothesis in the hypothesis matrix. 18. The data management tool of claim 14, further comprising a structured questionnaire interface configured to enable one or more users to provide answers to a plurality of questions; wherein the structured questionnaire interface comprises a plurality of pre-defined questions. 19. The data management tool of claim 14, further comprises a quality check questionnaire configured to create a quality check chart; wherein the quality check chart comprises a metric and an expectation comparison. 20. The data management tool of claim 14, further comprising a library configured to store a plurality of problem statements defined by a plurality of clients; wherein the library comprises a search option configured to enable one or more users to search the plurality of problem statements and access corresponding data stored in the library. | 2,100 |
5,042 | 13,525,017 | 2,135 | Embodiments of the present invention provide a flash memory device write-access management amongst different virtual machines (VMs) in a virtualized computing environment. In one embodiment, a virtualized computing data processing system can include a host computer with at least one processor and memory and different VMs executing in the host computer. The system also can include a flash memory device coupled to the host computer and accessible by the VMs. Finally, a flash memory controller can manage access to the flash memory device. The controller can include program code enabled to compute a contemporaneous bandwidth of requests for write operations for the flash memory device, to allocate a corresponding number of tokens to the VMs, to accept write requests to the flash memory device from the VMs only when accompanied by a token and to repeat the computing, allocating and accepting after a lapse of a pre-determined time period. | 1. A flash memory device write-access management method for different virtual machines (VMs) in a virtualized computing environment, the method comprising:
computing a contemporaneous bandwidth of requests for write operations for a flash memory device; allocating a corresponding number of tokens to virtual machines (VMs) in a virtualized computing environment seeking write access to the flash memory device; accepting write requests to the flash memory device from VMs only when accompanied by a token; and, repeating the computing, allocating and accepting after a lapse of a pre-determined time period. 2. The method of claim 1, further comprising:
detecting the lapse of the predetermined time period; and, re-allocating in response to the detecting of the lapse unused tokens in over-allocated ones of the VMs to under-allocated ones of the VMs for use during a subsequent pre-determined time period. 3. The method of claim 1, further comprising:
identifying ones of the VMs experiencing a burst of requests to write to the flash memory device; and, allocating in response to the identification of VMs experiencing a burst of requests, additional tokens to the VMs experiencing a burst of requests. 4-9. (canceled) | Embodiments of the present invention provide a flash memory device write-access management amongst different virtual machines (VMs) in a virtualized computing environment. In one embodiment, a virtualized computing data processing system can include a host computer with at least one processor and memory and different VMs executing in the host computer. The system also can include a flash memory device coupled to the host computer and accessible by the VMs. Finally, a flash memory controller can manage access to the flash memory device. The controller can include program code enabled to compute a contemporaneous bandwidth of requests for write operations for the flash memory device, to allocate a corresponding number of tokens to the VMs, to accept write requests to the flash memory device from the VMs only when accompanied by a token and to repeat the computing, allocating and accepting after a lapse of a pre-determined time period.1. A flash memory device write-access management method for different virtual machines (VMs) in a virtualized computing environment, the method comprising:
computing a contemporaneous bandwidth of requests for write operations for a flash memory device; allocating a corresponding number of tokens to virtual machines (VMs) in a virtualized computing environment seeking write access to the flash memory device; accepting write requests to the flash memory device from VMs only when accompanied by a token; and, repeating the computing, allocating and accepting after a lapse of a pre-determined time period. 2. The method of claim 1, further comprising:
detecting the lapse of the predetermined time period; and, re-allocating in response to the detecting of the lapse unused tokens in over-allocated ones of the VMs to under-allocated ones of the VMs for use during a subsequent pre-determined time period. 3. The method of claim 1, further comprising:
identifying ones of the VMs experiencing a burst of requests to write to the flash memory device; and, allocating in response to the identification of VMs experiencing a burst of requests, additional tokens to the VMs experiencing a burst of requests. 4-9. (canceled) | 2,100 |
5,043 | 15,393,182 | 2,199 | Disclosed herein are representative embodiments of tools and techniques for installing, executing, and/or updating managed applications through generation of native code from code in an intermediate language. According to one exemplary technique, a computing device receives machine dependent intermediate language code (MDIL code) generated by an online provider for an application. Additionally, the computing device installs the application on the computing device by generating a native image for the application, which includes binding a portion of the MDIL code with one or more libraries on the computing device. Also, the native image is stored on the computing device for use in loading the application for execution. | 1. A method comprising:
receiving, at a computing device, machine dependent intermediate language code (MDIL code) generated by an online provider for an application; at the computing device, installing the application on the computing device by generating a native image for the application by binding the MDIL code, the generating the native image comprising:
binding a portion of the MDIL code with one or more libraries on the computing device; and
storing the native image on the computing device for use when loading the application for execution. 2. The method of claim 1 further comprising updating the computing device, the updating the computing device comprising:
updating a set of libraries on the computing device, the set of libraries including at least one library of the one or more libraries bound to the portion of the MDIL code;
updating at least one runtime engine of the computing device;
after the updating of the set of libraries, automatically generating an updated native image for the application by binding the portion of the MDIL code with the at least one library of the one or more libraries after the one or more libraries are updated on the computing device, the updated native image for the application generated such that the updated native image is runnable using the updated at least one runtime engine; and
storing the updated native image on the computing device for use when loading the application for execution. 3. The method of claim 2, wherein the application is a first application and the computing device includes a native image for a second application installed on the computing device, and wherein the method further comprises:
responsive to the updating of the set of libraries, automatically generating an updated native image for the second application using one or more files included received in an installation package for the second application before the application was installed on the computing device. 4. The method of claim 2 further comprising:
temporarily preserving the native image of the application during the updating of the computing device;
determining that the updating of the computing device failed; and
restoring the native image of the application for use when loading the application. 5. The method of claim 1, wherein the MDIL code is generated by the online provided by compiling preliminary code, and wherein the preliminary code comprises source code or code of the application in an intermediate language that does not include code in a machine dependent intermediate language. 6. The method of claim 1, wherein:
the MDIL code is received in an installation package for the application; the MDIL code is included in a set of files; and the portion of the MDIL code is included in at least one file of the set of files. 7. The method of claim 6 further comprising, determining that the at least one file of the set of files is signed by the online provider to indicate the at least one file is trusted as having been generated by the online provider. 8. The method of claim 6, wherein the installation package further includes a binding list that identifies the respective files of the set of files that include the MDIL code, and the method further comprises:
with a package manager, evaluating the binding list, the binding list associating the at least one file of the set of files with a list of the one or more libraries; invoking a binder to perform the binding; and based on the evaluation of the binding list, providing the binding list of the one or more libraries to the binder to identify the one or more libraries for binding to the at least one file of the set of files. 9. The method of claim 1, further comprising loading the native image during execution of the application, wherein the loading of the native image is performed by a common language runtime. 10. The method of claim 1, wherein the MDIL code comprises one or more machine code instructions and one or more pseudo instructions encoded at a binary level, and wherein the machine code instructions are based on a processor instruction set for a processor of the computing device. 11. The method of claim 10, wherein the binding the MDIL code with the one or more libraries comprises:
generating executable code at least by generating a native language instruction from a pseudo instruction of the pseudo instructions in the MDIL code. 12. The method of claim 11 wherein the generating a native language instruction comprises generating a numeric field offset based on the pseudo instruction. 13. The method of claim 12, wherein the pseudo instruction includes a token that identifies a field and the native instruction includes the numeric field offset to reference the field when executed. 14. The method of claim 10, further comprising:
receiving new MDIL code for the application; updating the application on the computing device by generating an updated native image for the application, including binding a new portion of the MDIL code with the one or more libraries on the computing device; and storing the updated native image on the computing device for use when loading the application for execution. 15. A computing device that includes a processor and memory, the memory storing computer-executable instructions for causing the computing device to perform a method, the method comprising:
receiving, at the computing device, at least one installation package for an application from an online provider, the at least one installation package comprising a set of machine dependent intermediate language files (MDIL files); providing, to a binder of the computing device, at least one MDIL file of the set of MDIL files and one or more libraries to be bound to the at least one MDIL file; and with the binder, generating a native image for the application, the generating comprising binding machine dependent intermediate language code (MDIL code) of the at least one MDIL file using the one or more libraries. 16. The computing device of claim 15, wherein the set of MDIL files are generated by the online provider at least by compiling preliminary code of the application to generate the set of MDIL files, before the at least one installation package is received at the computing device. 17. The computing device of claim 15, wherein the respective files of the set of MDIL files are signed at an online marketplace to indicate the respective files have been generated at the online marketplace before the at least one installation package is received. 18. A method comprising:
generating a set of machine dependent intermediate language files (MDIL files) for an application by compiling preliminary code of the application into machine dependent intermediate language code (MDIL code); signing respective files of the set of MDIL files to indicate the respective files are trusted as being from an online marketplace; generating a binding list that identifies the respective files of the set of MDIL files; generating an installation package for the application comprising the set of MDIL files for the application and the binding list; and providing, at the online marketplace, the installation package for downloading. 19. The method of claim 18 further comprising:
receiving, at a computing device, the installation package from the online marketplace;
generating a native image for the application by binding the MDIL code included in the set of MDIL files with one or more libraries of the computing device;
marking the application as being trusted to execute on the computing device; and
storing the native image on the computing device for use when loading the application for execution. 20. The method of claim 19 further comprising:
updating at least one library of the one or more libraries of the computing device;
updating at least one runtime engine of the computing device; and
responsive to the updating of the at least one of the one or more libraries, generating an updated native image for the application by binding the MDIL code included in the set of MDIL files with the updated at least one library of the computing device such that the updated native image is runnable using the updated at least one runtime engine. | Disclosed herein are representative embodiments of tools and techniques for installing, executing, and/or updating managed applications through generation of native code from code in an intermediate language. According to one exemplary technique, a computing device receives machine dependent intermediate language code (MDIL code) generated by an online provider for an application. Additionally, the computing device installs the application on the computing device by generating a native image for the application, which includes binding a portion of the MDIL code with one or more libraries on the computing device. Also, the native image is stored on the computing device for use in loading the application for execution.1. A method comprising:
receiving, at a computing device, machine dependent intermediate language code (MDIL code) generated by an online provider for an application; at the computing device, installing the application on the computing device by generating a native image for the application by binding the MDIL code, the generating the native image comprising:
binding a portion of the MDIL code with one or more libraries on the computing device; and
storing the native image on the computing device for use when loading the application for execution. 2. The method of claim 1 further comprising updating the computing device, the updating the computing device comprising:
updating a set of libraries on the computing device, the set of libraries including at least one library of the one or more libraries bound to the portion of the MDIL code;
updating at least one runtime engine of the computing device;
after the updating of the set of libraries, automatically generating an updated native image for the application by binding the portion of the MDIL code with the at least one library of the one or more libraries after the one or more libraries are updated on the computing device, the updated native image for the application generated such that the updated native image is runnable using the updated at least one runtime engine; and
storing the updated native image on the computing device for use when loading the application for execution. 3. The method of claim 2, wherein the application is a first application and the computing device includes a native image for a second application installed on the computing device, and wherein the method further comprises:
responsive to the updating of the set of libraries, automatically generating an updated native image for the second application using one or more files included received in an installation package for the second application before the application was installed on the computing device. 4. The method of claim 2 further comprising:
temporarily preserving the native image of the application during the updating of the computing device;
determining that the updating of the computing device failed; and
restoring the native image of the application for use when loading the application. 5. The method of claim 1, wherein the MDIL code is generated by the online provided by compiling preliminary code, and wherein the preliminary code comprises source code or code of the application in an intermediate language that does not include code in a machine dependent intermediate language. 6. The method of claim 1, wherein:
the MDIL code is received in an installation package for the application; the MDIL code is included in a set of files; and the portion of the MDIL code is included in at least one file of the set of files. 7. The method of claim 6 further comprising, determining that the at least one file of the set of files is signed by the online provider to indicate the at least one file is trusted as having been generated by the online provider. 8. The method of claim 6, wherein the installation package further includes a binding list that identifies the respective files of the set of files that include the MDIL code, and the method further comprises:
with a package manager, evaluating the binding list, the binding list associating the at least one file of the set of files with a list of the one or more libraries; invoking a binder to perform the binding; and based on the evaluation of the binding list, providing the binding list of the one or more libraries to the binder to identify the one or more libraries for binding to the at least one file of the set of files. 9. The method of claim 1, further comprising loading the native image during execution of the application, wherein the loading of the native image is performed by a common language runtime. 10. The method of claim 1, wherein the MDIL code comprises one or more machine code instructions and one or more pseudo instructions encoded at a binary level, and wherein the machine code instructions are based on a processor instruction set for a processor of the computing device. 11. The method of claim 10, wherein the binding the MDIL code with the one or more libraries comprises:
generating executable code at least by generating a native language instruction from a pseudo instruction of the pseudo instructions in the MDIL code. 12. The method of claim 11 wherein the generating a native language instruction comprises generating a numeric field offset based on the pseudo instruction. 13. The method of claim 12, wherein the pseudo instruction includes a token that identifies a field and the native instruction includes the numeric field offset to reference the field when executed. 14. The method of claim 10, further comprising:
receiving new MDIL code for the application; updating the application on the computing device by generating an updated native image for the application, including binding a new portion of the MDIL code with the one or more libraries on the computing device; and storing the updated native image on the computing device for use when loading the application for execution. 15. A computing device that includes a processor and memory, the memory storing computer-executable instructions for causing the computing device to perform a method, the method comprising:
receiving, at the computing device, at least one installation package for an application from an online provider, the at least one installation package comprising a set of machine dependent intermediate language files (MDIL files); providing, to a binder of the computing device, at least one MDIL file of the set of MDIL files and one or more libraries to be bound to the at least one MDIL file; and with the binder, generating a native image for the application, the generating comprising binding machine dependent intermediate language code (MDIL code) of the at least one MDIL file using the one or more libraries. 16. The computing device of claim 15, wherein the set of MDIL files are generated by the online provider at least by compiling preliminary code of the application to generate the set of MDIL files, before the at least one installation package is received at the computing device. 17. The computing device of claim 15, wherein the respective files of the set of MDIL files are signed at an online marketplace to indicate the respective files have been generated at the online marketplace before the at least one installation package is received. 18. A method comprising:
generating a set of machine dependent intermediate language files (MDIL files) for an application by compiling preliminary code of the application into machine dependent intermediate language code (MDIL code); signing respective files of the set of MDIL files to indicate the respective files are trusted as being from an online marketplace; generating a binding list that identifies the respective files of the set of MDIL files; generating an installation package for the application comprising the set of MDIL files for the application and the binding list; and providing, at the online marketplace, the installation package for downloading. 19. The method of claim 18 further comprising:
receiving, at a computing device, the installation package from the online marketplace;
generating a native image for the application by binding the MDIL code included in the set of MDIL files with one or more libraries of the computing device;
marking the application as being trusted to execute on the computing device; and
storing the native image on the computing device for use when loading the application for execution. 20. The method of claim 19 further comprising:
updating at least one library of the one or more libraries of the computing device;
updating at least one runtime engine of the computing device; and
responsive to the updating of the at least one of the one or more libraries, generating an updated native image for the application by binding the MDIL code included in the set of MDIL files with the updated at least one library of the computing device such that the updated native image is runnable using the updated at least one runtime engine. | 2,100 |
5,044 | 12,607,675 | 2,174 | A method includes causing, in a first frame of a user interface, a display of thumbnails each corresponding to a different digital image. With the thumbnails displayed in the first frame, a display of a series of product controls is caused to be displayed. Upon a user's selection of a first one of the product controls, the thumbnails are modified to a first product preview format corresponding with the first product control. Upon the user's selection of a second one of the product controls, the thumbnails are modified to a second product preview format corresponding with the second product control. | 1. A method comprising:
causing, in a first frame of a user interface, a display of thumbnails each corresponding to a digital image; with the thumbnails displayed in the first frame, causing, in the user interface, a display of a series of product controls; upon a user's selection of a first one of the product controls modifying the thumbnails to a first product preview format corresponding to the first product control; and upon the user's selection of a second one of the product controls, modifying the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 2. The method of claim 1, further comprising:
upon the users selection of the first product control and a first thumbnail, updating a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the user's selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 3. The method of claim 2, wherein the first and second thumbnails are the same thumbnail and the first and second product controls are different. 4. The method of claim 2, comprising:
upon a user's selection of a workflow control, causing, in a second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list; causing, in a third frame of the user interface, a display of a first editable preview image upon a users selection of a first one of the thumbnails in the second frame; and causing, in the third frame of the user interface, a display of a second editable preview image upon a users selection of a second one of the thumbnails in the second frame. 5. The method of claim 4, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and causing, in a second frame of the user interface, a display of thumbnails each corresponding to each product included on the list comprises:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 6. The method of claim 5, wherein causing a display of a grouping of second thumbnails comprises causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 7. The method of claim 4, further comprising;
modifying the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modifying the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. 8. A computer readable medium storing computer executable instructions that when executed implement a method that includes:
causing, in a first frame of a user interface, a display of thumbnails each representing a digital image; with the thumbnails displayed in the first frame, causing, in the user interface, a display of a series of product controls; upon a user's selection of a first one of the product controls modifying the thumbnails to a first product preview format corresponding to the first product control; and upon the users selection of a second one of the product controls, modifying the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 9. The medium of claim 8, wherein the method includes:
upon the users selection of the first product control and a first thumbnail, updating a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the users selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 10. The medium of claim 9, wherein: the first and second thumbnails are the same thumbnail and the first and second product controls are different. 11. The medium of claim 9, wherein the method includes:
upon a user's selection of a workflow control, causing, in a second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list; causing, in a third frame of the user interface, a display of a first editable preview image upon a users selection of a first one of the thumbnails in the second frame; and causing, in the third frame of the user interface, a display of a second editable preview image upon a users selection of a second one of the thumbnails in the second frame. 12. The medium of claim 11, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and wherein causing, in a second frame of the user interface, a display of thumbnails each corresponding to each product Included on the list comprises:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 13. The medium of claim 12, wherein causing a display of a grouping of second thumbnails comprises causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 14. The medium of claim 11, wherein the method includes:
modifying the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modifying the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. 15. A system, comprising an image engine, a display engine, and a command engine, wherein:
the image engine is configured to generate a thumbnails each corresponding to one of a plurality of digital images; the display engine is configured cause a display of the thumbnails in a first frame of a graphical user interface together with a display of product controls; the command engine is configured to detect a user's selections from among the thumbnails and the product controls; and the image engine is configured to:
upon detection by the command engine of a user's selection of a first one of the product controls, modify the thumbnails to a first product preview format corresponding to the first product control; and
upon detection by the command engine of the user's selection of a second one of the product controls, modify the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 16. The system of claim 15, wherein the image engine is configured to:
upon the user's selection of the first product control and a first thumbnail, update a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the user's selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 17. The system of claim 16, wherein:
the display engine is configured to cause a display of a workflow control in the user interface; the command engine is configured to detect the user's selection of the workflow control and the user's selection from among thumbnails in a second frame of the user interface; the display engine is configured to:
upon the user's selection of the workflow control, cause, in the second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list;
cause, in a third frame of the user interface, a display of a first editable preview image upon a user's selection of a first one of the thumbnails in the second frame; and
cause, in the third frame of the user interface, a display of a second editable preview image upon a user's selection of a second one of the thumbnails in the second frame. 18. The system of claim 17, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and wherein the display engine is configured to cause the display of the thumbnails each corresponding to each product included on the list by:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 19. The system of claim 18, wherein the display engine is configured to cause the display of the grouping of second thumbnails by causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 20. The system of claim 17, wherein the image engine is configured to:
modify the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modify the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. | A method includes causing, in a first frame of a user interface, a display of thumbnails each corresponding to a different digital image. With the thumbnails displayed in the first frame, a display of a series of product controls is caused to be displayed. Upon a user's selection of a first one of the product controls, the thumbnails are modified to a first product preview format corresponding with the first product control. Upon the user's selection of a second one of the product controls, the thumbnails are modified to a second product preview format corresponding with the second product control.1. A method comprising:
causing, in a first frame of a user interface, a display of thumbnails each corresponding to a digital image; with the thumbnails displayed in the first frame, causing, in the user interface, a display of a series of product controls; upon a user's selection of a first one of the product controls modifying the thumbnails to a first product preview format corresponding to the first product control; and upon the user's selection of a second one of the product controls, modifying the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 2. The method of claim 1, further comprising:
upon the users selection of the first product control and a first thumbnail, updating a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the user's selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 3. The method of claim 2, wherein the first and second thumbnails are the same thumbnail and the first and second product controls are different. 4. The method of claim 2, comprising:
upon a user's selection of a workflow control, causing, in a second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list; causing, in a third frame of the user interface, a display of a first editable preview image upon a users selection of a first one of the thumbnails in the second frame; and causing, in the third frame of the user interface, a display of a second editable preview image upon a users selection of a second one of the thumbnails in the second frame. 5. The method of claim 4, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and causing, in a second frame of the user interface, a display of thumbnails each corresponding to each product included on the list comprises:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 6. The method of claim 5, wherein causing a display of a grouping of second thumbnails comprises causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 7. The method of claim 4, further comprising;
modifying the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modifying the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. 8. A computer readable medium storing computer executable instructions that when executed implement a method that includes:
causing, in a first frame of a user interface, a display of thumbnails each representing a digital image; with the thumbnails displayed in the first frame, causing, in the user interface, a display of a series of product controls; upon a user's selection of a first one of the product controls modifying the thumbnails to a first product preview format corresponding to the first product control; and upon the users selection of a second one of the product controls, modifying the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 9. The medium of claim 8, wherein the method includes:
upon the users selection of the first product control and a first thumbnail, updating a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the users selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 10. The medium of claim 9, wherein: the first and second thumbnails are the same thumbnail and the first and second product controls are different. 11. The medium of claim 9, wherein the method includes:
upon a user's selection of a workflow control, causing, in a second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list; causing, in a third frame of the user interface, a display of a first editable preview image upon a users selection of a first one of the thumbnails in the second frame; and causing, in the third frame of the user interface, a display of a second editable preview image upon a users selection of a second one of the thumbnails in the second frame. 12. The medium of claim 11, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and wherein causing, in a second frame of the user interface, a display of thumbnails each corresponding to each product Included on the list comprises:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 13. The medium of claim 12, wherein causing a display of a grouping of second thumbnails comprises causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 14. The medium of claim 11, wherein the method includes:
modifying the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modifying the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. 15. A system, comprising an image engine, a display engine, and a command engine, wherein:
the image engine is configured to generate a thumbnails each corresponding to one of a plurality of digital images; the display engine is configured cause a display of the thumbnails in a first frame of a graphical user interface together with a display of product controls; the command engine is configured to detect a user's selections from among the thumbnails and the product controls; and the image engine is configured to:
upon detection by the command engine of a user's selection of a first one of the product controls, modify the thumbnails to a first product preview format corresponding to the first product control; and
upon detection by the command engine of the user's selection of a second one of the product controls, modify the thumbnails to a second product preview format corresponding to the second product control, the second product preview format differing from the first product preview format. 16. The system of claim 15, wherein the image engine is configured to:
upon the user's selection of the first product control and a first thumbnail, update a list to identify a first product corresponding to the first product control and the first thumbnail; and upon the user's selection of the second product control and the second thumbnail, updating the list to include a second product corresponding to the second product control and the second thumbnail. 17. The system of claim 16, wherein:
the display engine is configured to cause a display of a workflow control in the user interface; the command engine is configured to detect the user's selection of the workflow control and the user's selection from among thumbnails in a second frame of the user interface; the display engine is configured to:
upon the user's selection of the workflow control, cause, in the second frame of the user interface, a display of thumbnails each corresponding to a different product included on the list;
cause, in a third frame of the user interface, a display of a first editable preview image upon a user's selection of a first one of the thumbnails in the second frame; and
cause, in the third frame of the user interface, a display of a second editable preview image upon a user's selection of a second one of the thumbnails in the second frame. 18. The system of claim 17, wherein the first product control corresponds to a single image product and the second product control corresponds to a multi-image product and wherein the display engine is configured to cause the display of the thumbnails each corresponding to each product included on the list by:
causing a display of a first thumbnail reflective of the single image product; and causing a display of a grouping of second thumbnails each reflective of an image in the multi-image product. 19. The system of claim 18, wherein the display engine is configured to cause the display of the grouping of second thumbnails by causing a display of a grouping of second thumbnails such that each of the second thumbnails is individually selectable to cause a display of a different editable preview image in the third frame of the user interface. 20. The system of claim 17, wherein the image engine is configured to:
modify the first thumbnail in the second frame to reflect a user's manipulation of the first editable product preview image in the third frame; and modify the second thumbnail in the second frame to reflect the user's manipulation of the second editable product preview image in the third frame. | 2,100 |
5,045 | 12,817,511 | 2,156 | A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query. | 1. A method of applying a relational query comprising at least one operator to a relational data set on a device having a processor and defining a query slice threshold, the method comprising:
executing on the processor instructions configured to:
generate at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator;
from the candidate query plans, select a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans; and
execute the query slices of the query plan on the relational data set. 2. The method of claim 1:
the shallow cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
SC
(
ρ
)
=
max
i
(
LC
(
χ
(
ρ
′
)
[
r
i
]
)
)
+
SC
(
ρ
′
[
r
i
]
)
wherein:
ρ represents a root operator of the query plan;
SC(ρ) represents an estimated shallow cost of the root operator ρ;
LC(ρ) represents an estimated local cost of the root operator ρ;
ρ′[ri] represents a subplan parameterized over range [ri]; and
χ(ρ′[ri]) represents an input parameterized subplan for subplan ρ′ over range [ri]; and
the estimated deep cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
D
C
(
ρ
)
=
∑
i
=
1
n
LC
(
χ
(
ρ
′
[
r
i
]
)
)
+
D
C
(
ρ
′
[
r
1
]
)
+
∑
i
=
2
n
SC
(
ρ
′
[
r
i
]
)
wherein:
DC(ρ′[r1]) represents an estimated deep cost of a first range over an input parameterized subplan ρ′. 3. The method of claim 1, generating the at least one candidate query plan for a relation set comprising joining a first relation and a second relation comprising:
evaluating the first relation to identify a first query subplan; evaluating the second relation to identify a second query subplan; and generating a candidate query plan by joining the first query subplan and the second query subplan. 4. The method of claim 3:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a candidate query plan; generating a candidate query plan for a relation set comprising:
for a relation set specifying a sort order:
generating a first candidate query plan incorporating the sort order;
generating a second candidate query plan not incorporating the sort order and appending a sort operator; and
comparing the deep cost of the first candidate query plan and the deep cost of the second candidate query plan;
for a relation set comprising one relation, generating a candidate query plan comprising the relation; and
upon generating a candidate query plan:
examining the candidate query plan store for a current candidate query plan associated with the relation set and the sort order; and
if the candidate query plan store does not store a current candidate query plan having a deep cost not exceeding the deep cost of the candidate query plan, storing the candidate query plan in the candidate query plan store associated with the relation set and the sort order. 5. The method of claim 3, generating the at least one candidate query plan comprising:
upon generating a candidate query plan:
generating a spooled candidate query plan comprising the query plan appending a spool operator and a scan operator, and
comparing the deep cost of the candidate query plan and the deep cost of the spooled candidate query plan. 6. The method of claim 5:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans; the instructions configured to, upon generating a candidate query plan associated with a relation set and a sort order:
determine whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order, store the candidate query plan in the candidate query plan store associated with the relation set and the sort order; and
generating the at least one candidate query plan for a relation set comprising joining a first query subplan and a second query subplan comprising: generating at least one candidate query plan comprising joining a first candidate query plan within the skyline of the first relation and a second candidate query plan within the skyline of the second relation. 7. The method of claim 5, generating the at least one candidate query plan comprising:
upon generating a candidate query plan, generating from the candidate query plan a parameterized spooled candidate query plan parameterized upon an attribute of a relation utilized by an operator of the candidate query plan by:
identifying at least two ranges over the attribute of the relation;
inserting before the operator an output spool operator parameterized on the at least two ranges over the attribute; and
inserting after the operator an input spool operator parameterized on the at least two ranges over the attribute. 8. The method of claim 7, identifying the at least two ranges over the attribute of the relation comprising:
initiating a range set; initiating an unallocated range as a full range over the attribute; while a local cost of processing the records of the relation within the unallocated range is greater than the query slice threshold:
identifying an unallocated range portion having a local cost below the query slice threshold;
adding the unallocated range portion to the range set; and
removing the unallocated range portion from the unallocated range; and
adding the unallocated range to the range set. 9. The method of claim 8, identifying an unallocated range portion comprising: performing a binary search over the unallocated range to identify a range portion having a shallow cost that approaches and does not exceed the query slice threshold. 10. The method of claim 8, comprising: upon failing to partition a range into at least two ranges having a shallow cost not exceeding the query slice threshold:
identifying a secondary attribute, and generating the parameterized spooled candidate query plan that is parameterized upon the secondary attribute. 11. The method of claim 7, generating the at least one candidate query plan comprising:
for relation sets comprising one relation:
selecting at least one attribute of the relation, and
generating at least one parameterized candidate query plan parameterized on at least two ranges over the attribute; and
for relation sets comprising at least two relations that are parameterized on at least two range of an attribute, generating a parameterized spooled candidate query plan by:
joining the first relation and the second relation, the join parameterized on the at least two ranges over the attribute, and
appending an input spool operator parameterized on the at least two ranges over the attribute. 12. The method of claim 11, the at least one attribute of the relation selected from a set of output parameterizing attributes comprising:
a key attribute of the relation, and a predicate of a joining of the relation with another relation. 13. The method of claim 11:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans, respective candidate query plans associated with at least two ranges of at least zero attributes on which the candidate query plan is parameterized; and the instructions configured to, upon generating a candidate query plan associated with a relation set and a sort order:
determine whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order, store the candidate query plan in the candidate query plan store associated with the relation set, the sort order, and the at least two ranges of the at least zero attributes on which the candidate query plan is parameterized. 14. The method of claim 13, the instructions configured to, upon storing a candidate query plan in the candidate query plan store associated with the relation set and the sort order, remove from the candidate query plan store candidate query plans not having a low shallow cost among the candidate query plans associated with the relation set and the sort order and not having a low deep cost among the candidate query plans associated with the relation set and the sort order. 15. The method of claim 11, generating the at least one candidate query plan for a relation set comprising:
selecting the first query subplan having a query subplan type selected from a restricted query subplan type set comprising:
a nonparameterized query subplan,
a relation set having one relation, and
a query subplan having a scan operator as a root operator; and
selecting the second query subplan having a query subplan type selected from the restricted query subplan type set. 16. The method of claim 11:
the instructions configured to:
generate an unconstrained candidate query plan having an unconstrained query slice threshold, and
identify in the unconstrained candidate query plan a join pattern comprising joining a first query subplan and a second query subplan; and
generating a candidate query plan comprising a join of the first query subplan and the second query subplan comprising: generating the candidate query plan comprising joining a first query subplan and a second query subplan that corresponds to a join of the join pattern of the unconstrained candidate query plan. 17. The method of claim 1, the instructions configured to:
before executing the query slices on the relational data set, acquire at least one lock on at least one resource of the relational data set utilized in the query plan; and after executing the query slices on the relational data set, release the at least one lock on the at least one resource of the relational data set. 18. The method of claim 1, the instructions configured to:
while executing respective query slices of the query plan:
monitor a query slice cost of executing the query slice, and
compare the query slice cost with the shallow cost to detect a query cost estimation inaccuracy; and
upon detecting a query cost estimation inaccuracy, reevaluate the query plan. 19. A system configured to apply a relational query comprising at least one operator to a relational data set respecting a query slice threshold, the system comprising:
a candidate query plan store configured to store, associated with a relation set and a sort order, a candidate query plan; a query plan generating component configured to generate at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator; a query plan selecting component configured to, from the candidate query plans, select a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans; and a query plan executing component configured to execute the query slices of the query plan on the relational data set. 20. A computer-readable storage medium comprising instructions that, when executed on a processor of a device defining a query slice threshold and having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans, apply a relational query comprising at least one operator to a relational data set by:
generating at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator by: for relation sets comprising one relation:
selecting at least one attribute of the relation from a set of output parameterizing attributes comprising:
a key attribute of the relation, and
a predicate of a joining of the relation and another relation;
generating candidate query subplans by:
for a relation set comprising one relation, generating a candidate query subplan comprising the one relation;
evaluating the first relation to identify a first query subplan;
evaluating the second relation to identify a second query subplan;
generating a first candidate query subplan by joining the first query subplan and the second query subplan;
selecting at least one parameterized candidate query plan associated with at least one relation;
generating a second candidate query subplan by:
joining the first query subplan and the second query subplan, and
appending an input spool operator parameterized on the at least two ranges over the attribute;
for a relation set specifying a sort order:
generating a first candidate query plan incorporating the sort order, and
generating a second candidate query plan not incorporating the sort order and appending a sort operator; and
for relation sets comprising at least two relations associated with parameterized candidate query plans, generating a parameterized spooled candidate query plan by:
joining the first relation and the second relation parameterized on the at least two ranges over the attribute, and
appending an input spool operator parameterized on the at least two ranges over the attribute;
upon generating a candidate query plan:
determining whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order:
storing the candidate query plan in the candidate query plan store associated with the relation set, the sort order, and the at least two ranges of the at least zero attributes on which the candidate query plan is parameterized, and
removing from the candidate query plan store candidate query plans not having a low shallow cost among the candidate query plans associated with the relation set and the sort order and not having a low deep cost among the candidate query plans associated with the relation set and the sort order;
generating at least one candidate query plan comprising joining a first candidate query plan within the skyline of the first relation and a second candidate query plan within the skyline of the second relation;
generating a spooled candidate query plan comprising the query plan appending a spool operator and a scan operator;
comparing the deep cost of the candidate query plan and the deep cost of the spooled candidate query plan;
generating from the candidate query plan a parameterized spooled candidate query plan parameterized upon an attribute of a relation utilized by an operator of the candidate query plan by:
identifying at least two ranges over the attribute of the relation by:
initiating a range set;
initiating an unallocated range as a full range over the attribute;
while a local cost of processing the records of the relation within the unallocated range is greater than the query slice threshold:
identifying an unallocated range portion having a local cost below the query slice threshold by performing a binary search over the unallocated range to identify a range portion having a shallow cost that approaches and does not exceed the query slice threshold;
adding the unallocated range portion to the range set; and
removing the unallocated range portion from the unallocated range; and
adding the unallocated range to the range set;
inserting before the operator an output spool operator parameterized on the at least two ranges over the attribute;
inserting after the operator an input spool operator parameterized on the at least two ranges over the attribute; and
upon failing to partition a range into at least two ranges having a shallow cost not exceeding the query slice threshold:
identifying a secondary attribute, and
generating the parameterized spooled candidate query plan parameterized upon the secondary attribute;
from the candidate query plans, selecting a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans, the shallow cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
SC
(
ρ
)
=
max
i
(
LC
(
χ
(
ρ
′
)
[
r
i
]
)
)
+
SC
(
ρ
′
[
r
i
]
)
wherein:
ρ represents a root operator of the query plan;
SC(ρ) represents an estimated shallow cost of the root operator ρ;
LC(ρ) represents an estimated local cost of the root operator ρ;
ρ′[ri] represents a subplan parameterized over range [ri]; and
χ(ρ′[ri]) represents an input parameterized subplan for subplan ρ′ over range [ri];
and the estimated deep cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
D
C
(
ρ
)
=
∑
i
=
1
n
LC
(
χ
(
ρ
′
[
r
i
]
)
)
+
D
C
(
ρ
′
[
r
1
]
)
+
∑
i
=
2
n
SC
(
ρ
′
[
r
i
]
)
wherein:
DC(ρ′[r1]) represents an estimated deep cost of a first range over an input parameterized subplan ρ′;
before executing the query slices on the relational data set, acquiring at least one lock on at least one resource of the relational data set utilized in the query plan;
executing the query slices of the query plan on the relational data set;
while executing respective query slices of the query plan:
monitoring a query slice cost of executing the query slice, and
comparing the query slice cost with the shallow cost to detect a query cost estimation inaccuracy;
upon detecting a query cost estimation inaccuracy, reevaluating the query plan; and
after executing the query slices on the relational data set, releasing the at least one lock on the at least one resource of the relational data set. | A relational database server may concurrently execute many relational queries, but a complex relational query may cause performance delays in the fulfillment of other relational queries. Instead, the relational database server may generate a query plan for the relational query, and may endeavor to partition the relational query between a spool operator and a scan operator into two or more query slices, where each query slice may be executed within a query slice threshold. Many alternative candidate query plans may be considered, such as inserting spool and scan operators after various operators and parameterizing operators in order to partition the records of a relation into two or more ranges based on an attribute of the relation. A large search space of candidate query plans may be reviewed in order to select a query plan that respects the query slice threshold while efficiently executing the logic of the relational query.1. A method of applying a relational query comprising at least one operator to a relational data set on a device having a processor and defining a query slice threshold, the method comprising:
executing on the processor instructions configured to:
generate at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator;
from the candidate query plans, select a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans; and
execute the query slices of the query plan on the relational data set. 2. The method of claim 1:
the shallow cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
SC
(
ρ
)
=
max
i
(
LC
(
χ
(
ρ
′
)
[
r
i
]
)
)
+
SC
(
ρ
′
[
r
i
]
)
wherein:
ρ represents a root operator of the query plan;
SC(ρ) represents an estimated shallow cost of the root operator ρ;
LC(ρ) represents an estimated local cost of the root operator ρ;
ρ′[ri] represents a subplan parameterized over range [ri]; and
χ(ρ′[ri]) represents an input parameterized subplan for subplan ρ′ over range [ri]; and
the estimated deep cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
D
C
(
ρ
)
=
∑
i
=
1
n
LC
(
χ
(
ρ
′
[
r
i
]
)
)
+
D
C
(
ρ
′
[
r
1
]
)
+
∑
i
=
2
n
SC
(
ρ
′
[
r
i
]
)
wherein:
DC(ρ′[r1]) represents an estimated deep cost of a first range over an input parameterized subplan ρ′. 3. The method of claim 1, generating the at least one candidate query plan for a relation set comprising joining a first relation and a second relation comprising:
evaluating the first relation to identify a first query subplan; evaluating the second relation to identify a second query subplan; and generating a candidate query plan by joining the first query subplan and the second query subplan. 4. The method of claim 3:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a candidate query plan; generating a candidate query plan for a relation set comprising:
for a relation set specifying a sort order:
generating a first candidate query plan incorporating the sort order;
generating a second candidate query plan not incorporating the sort order and appending a sort operator; and
comparing the deep cost of the first candidate query plan and the deep cost of the second candidate query plan;
for a relation set comprising one relation, generating a candidate query plan comprising the relation; and
upon generating a candidate query plan:
examining the candidate query plan store for a current candidate query plan associated with the relation set and the sort order; and
if the candidate query plan store does not store a current candidate query plan having a deep cost not exceeding the deep cost of the candidate query plan, storing the candidate query plan in the candidate query plan store associated with the relation set and the sort order. 5. The method of claim 3, generating the at least one candidate query plan comprising:
upon generating a candidate query plan:
generating a spooled candidate query plan comprising the query plan appending a spool operator and a scan operator, and
comparing the deep cost of the candidate query plan and the deep cost of the spooled candidate query plan. 6. The method of claim 5:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans; the instructions configured to, upon generating a candidate query plan associated with a relation set and a sort order:
determine whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order, store the candidate query plan in the candidate query plan store associated with the relation set and the sort order; and
generating the at least one candidate query plan for a relation set comprising joining a first query subplan and a second query subplan comprising: generating at least one candidate query plan comprising joining a first candidate query plan within the skyline of the first relation and a second candidate query plan within the skyline of the second relation. 7. The method of claim 5, generating the at least one candidate query plan comprising:
upon generating a candidate query plan, generating from the candidate query plan a parameterized spooled candidate query plan parameterized upon an attribute of a relation utilized by an operator of the candidate query plan by:
identifying at least two ranges over the attribute of the relation;
inserting before the operator an output spool operator parameterized on the at least two ranges over the attribute; and
inserting after the operator an input spool operator parameterized on the at least two ranges over the attribute. 8. The method of claim 7, identifying the at least two ranges over the attribute of the relation comprising:
initiating a range set; initiating an unallocated range as a full range over the attribute; while a local cost of processing the records of the relation within the unallocated range is greater than the query slice threshold:
identifying an unallocated range portion having a local cost below the query slice threshold;
adding the unallocated range portion to the range set; and
removing the unallocated range portion from the unallocated range; and
adding the unallocated range to the range set. 9. The method of claim 8, identifying an unallocated range portion comprising: performing a binary search over the unallocated range to identify a range portion having a shallow cost that approaches and does not exceed the query slice threshold. 10. The method of claim 8, comprising: upon failing to partition a range into at least two ranges having a shallow cost not exceeding the query slice threshold:
identifying a secondary attribute, and generating the parameterized spooled candidate query plan that is parameterized upon the secondary attribute. 11. The method of claim 7, generating the at least one candidate query plan comprising:
for relation sets comprising one relation:
selecting at least one attribute of the relation, and
generating at least one parameterized candidate query plan parameterized on at least two ranges over the attribute; and
for relation sets comprising at least two relations that are parameterized on at least two range of an attribute, generating a parameterized spooled candidate query plan by:
joining the first relation and the second relation, the join parameterized on the at least two ranges over the attribute, and
appending an input spool operator parameterized on the at least two ranges over the attribute. 12. The method of claim 11, the at least one attribute of the relation selected from a set of output parameterizing attributes comprising:
a key attribute of the relation, and a predicate of a joining of the relation with another relation. 13. The method of claim 11:
the device having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans, respective candidate query plans associated with at least two ranges of at least zero attributes on which the candidate query plan is parameterized; and the instructions configured to, upon generating a candidate query plan associated with a relation set and a sort order:
determine whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order, store the candidate query plan in the candidate query plan store associated with the relation set, the sort order, and the at least two ranges of the at least zero attributes on which the candidate query plan is parameterized. 14. The method of claim 13, the instructions configured to, upon storing a candidate query plan in the candidate query plan store associated with the relation set and the sort order, remove from the candidate query plan store candidate query plans not having a low shallow cost among the candidate query plans associated with the relation set and the sort order and not having a low deep cost among the candidate query plans associated with the relation set and the sort order. 15. The method of claim 11, generating the at least one candidate query plan for a relation set comprising:
selecting the first query subplan having a query subplan type selected from a restricted query subplan type set comprising:
a nonparameterized query subplan,
a relation set having one relation, and
a query subplan having a scan operator as a root operator; and
selecting the second query subplan having a query subplan type selected from the restricted query subplan type set. 16. The method of claim 11:
the instructions configured to:
generate an unconstrained candidate query plan having an unconstrained query slice threshold, and
identify in the unconstrained candidate query plan a join pattern comprising joining a first query subplan and a second query subplan; and
generating a candidate query plan comprising a join of the first query subplan and the second query subplan comprising: generating the candidate query plan comprising joining a first query subplan and a second query subplan that corresponds to a join of the join pattern of the unconstrained candidate query plan. 17. The method of claim 1, the instructions configured to:
before executing the query slices on the relational data set, acquire at least one lock on at least one resource of the relational data set utilized in the query plan; and after executing the query slices on the relational data set, release the at least one lock on the at least one resource of the relational data set. 18. The method of claim 1, the instructions configured to:
while executing respective query slices of the query plan:
monitor a query slice cost of executing the query slice, and
compare the query slice cost with the shallow cost to detect a query cost estimation inaccuracy; and
upon detecting a query cost estimation inaccuracy, reevaluate the query plan. 19. A system configured to apply a relational query comprising at least one operator to a relational data set respecting a query slice threshold, the system comprising:
a candidate query plan store configured to store, associated with a relation set and a sort order, a candidate query plan; a query plan generating component configured to generate at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator; a query plan selecting component configured to, from the candidate query plans, select a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans; and a query plan executing component configured to execute the query slices of the query plan on the relational data set. 20. A computer-readable storage medium comprising instructions that, when executed on a processor of a device defining a query slice threshold and having a candidate query plan store configured to store, associated with a relation set and a sort order, a skyline of candidate query plans, apply a relational query comprising at least one operator to a relational data set by:
generating at least one candidate query plan by partitioning the relational query into at least two query slices between a spool operator and a scan operator by: for relation sets comprising one relation:
selecting at least one attribute of the relation from a set of output parameterizing attributes comprising:
a key attribute of the relation, and
a predicate of a joining of the relation and another relation;
generating candidate query subplans by:
for a relation set comprising one relation, generating a candidate query subplan comprising the one relation;
evaluating the first relation to identify a first query subplan;
evaluating the second relation to identify a second query subplan;
generating a first candidate query subplan by joining the first query subplan and the second query subplan;
selecting at least one parameterized candidate query plan associated with at least one relation;
generating a second candidate query subplan by:
joining the first query subplan and the second query subplan, and
appending an input spool operator parameterized on the at least two ranges over the attribute;
for a relation set specifying a sort order:
generating a first candidate query plan incorporating the sort order, and
generating a second candidate query plan not incorporating the sort order and appending a sort operator; and
for relation sets comprising at least two relations associated with parameterized candidate query plans, generating a parameterized spooled candidate query plan by:
joining the first relation and the second relation parameterized on the at least two ranges over the attribute, and
appending an input spool operator parameterized on the at least two ranges over the attribute;
upon generating a candidate query plan:
determining whether the candidate query plan is within a skyline of candidate query plans associated with the relation set and the sort order; and
upon determining that the candidate query plan is within the skyline of candidate query plans associated with the relation set and the sort order:
storing the candidate query plan in the candidate query plan store associated with the relation set, the sort order, and the at least two ranges of the at least zero attributes on which the candidate query plan is parameterized, and
removing from the candidate query plan store candidate query plans not having a low shallow cost among the candidate query plans associated with the relation set and the sort order and not having a low deep cost among the candidate query plans associated with the relation set and the sort order;
generating at least one candidate query plan comprising joining a first candidate query plan within the skyline of the first relation and a second candidate query plan within the skyline of the second relation;
generating a spooled candidate query plan comprising the query plan appending a spool operator and a scan operator;
comparing the deep cost of the candidate query plan and the deep cost of the spooled candidate query plan;
generating from the candidate query plan a parameterized spooled candidate query plan parameterized upon an attribute of a relation utilized by an operator of the candidate query plan by:
identifying at least two ranges over the attribute of the relation by:
initiating a range set;
initiating an unallocated range as a full range over the attribute;
while a local cost of processing the records of the relation within the unallocated range is greater than the query slice threshold:
identifying an unallocated range portion having a local cost below the query slice threshold by performing a binary search over the unallocated range to identify a range portion having a shallow cost that approaches and does not exceed the query slice threshold;
adding the unallocated range portion to the range set; and
removing the unallocated range portion from the unallocated range; and
adding the unallocated range to the range set;
inserting before the operator an output spool operator parameterized on the at least two ranges over the attribute;
inserting after the operator an input spool operator parameterized on the at least two ranges over the attribute; and
upon failing to partition a range into at least two ranges having a shallow cost not exceeding the query slice threshold:
identifying a secondary attribute, and
generating the parameterized spooled candidate query plan parameterized upon the secondary attribute;
from the candidate query plans, selecting a query plan comprising query slices respectively having a local cost below the query slice threshold and a deep cost lower than the deep costs of other candidate query plans, the shallow cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
SC
(
ρ
)
=
max
i
(
LC
(
χ
(
ρ
′
)
[
r
i
]
)
)
+
SC
(
ρ
′
[
r
i
]
)
wherein:
ρ represents a root operator of the query plan;
SC(ρ) represents an estimated shallow cost of the root operator ρ;
LC(ρ) represents an estimated local cost of the root operator ρ;
ρ′[ri] represents a subplan parameterized over range [ri]; and
χ(ρ′[ri]) represents an input parameterized subplan for subplan ρ′ over range [ri];
and the estimated deep cost of a query plan associated with a query slice estimated according to a mathematical formula comprising:
D
C
(
ρ
)
=
∑
i
=
1
n
LC
(
χ
(
ρ
′
[
r
i
]
)
)
+
D
C
(
ρ
′
[
r
1
]
)
+
∑
i
=
2
n
SC
(
ρ
′
[
r
i
]
)
wherein:
DC(ρ′[r1]) represents an estimated deep cost of a first range over an input parameterized subplan ρ′;
before executing the query slices on the relational data set, acquiring at least one lock on at least one resource of the relational data set utilized in the query plan;
executing the query slices of the query plan on the relational data set;
while executing respective query slices of the query plan:
monitoring a query slice cost of executing the query slice, and
comparing the query slice cost with the shallow cost to detect a query cost estimation inaccuracy;
upon detecting a query cost estimation inaccuracy, reevaluating the query plan; and
after executing the query slices on the relational data set, releasing the at least one lock on the at least one resource of the relational data set. | 2,100 |
5,046 | 14,106,900 | 2,126 | Systems and techniques are provided for template exploration in a large-scale machine learning system. A method may include obtaining multiple base templates, each base template comprising multiple features. A template performance score may be obtained for each base template and a first base template may be selected from among the multiple base templates based on the template performance score of the first base template. Multiple cross-templates may be constructed by generating a cross-template of the selected first base template and each of the multiple base templates. Performance of a machine learning model may be tested based on each cross-template to generate a cross-template performance score for each of the cross-templates. A first cross-template may be selected from among the multiple cross-templates based on the cross-template performance score of the cross-template. Accordingly, the first cross-template may be added to the machine learning model. | 1. A computer-implemented method comprising:
obtaining a computer-implemented machine learning model having features; obtaining three or more base templates, each base template comprising a plurality of features, wherein the features of each of the base templates are not found in any of the other base templates and the features of each of the base templates are not features of the machine learning model at a time of obtaining the three or more base templates; obtaining a respective template performance score for each base template; selecting a first base template from the three or more base templates based on the first base template having the highest template performance score relative to the performance scores of the other base templates; constructing a first plurality of cross-templates by generating a respective cross-template of the selected first base template and each of the other base templates; testing the performance of a computer-implemented machine learning model based on each of the first plurality of cross-templates to generate a respective cross-template performance score for each of the first plurality of cross-templates; selecting a first cross-template of the first plurality of cross-templates based on the cross-template performance score of the first cross-template; and adding the features of the first cross-template to the machine learning model. 2. The method of claim 1, further comprising adding the features of the first base template to the machine learning model. 3. The method of claim 1, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance per feature of the machine learning model including the first cross-template relative to a performance of the machine learning model excluding the first cross-template. 4. The method of claim 1, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance of the machine learning model including the first cross-template relative to performance of the machine learning model excluding the first cross-template. 5. The method of claim 1, wherein the template performance score of each base template is based on a degree of performance of a machine learning model including each base template. 6. The method of claim 1, wherein the performance score of each base template is based on a number of occurrences associated with each feature in a base template. 7. The method of claim 1, wherein the performance score of each base template is based on a number of impressions associated with each feature in a base template. 8. (canceled) 9. The method of claim 1, further comprising:
constructing a second plurality of cross-templates by generating a cross-template of the first cross-template and each one of the other cross-templates in the first plurality of cross-templates; and testing the performance of a machine learning model based on each of the second plurality of cross-templates to generate a cross-template performance score for each of the second plurality of cross-templates; and selecting a second cross-template of the second plurality of cross-templates based on the cross-template performance score of the second cross-template. 10. The method of claim 9, further comprising:
adding the features of the second cross-template to the machine learning model. 11. The method of claim 1, further comprising:
training the machine learning model; and using the trained machine learning model to make a prediction. 12. A computer-implemented machine learning system configured, by instructions adapted to be executed by the machine learning system to:
obtain a computer-implemented machine learning model having features; obtain three or more base templates, each base template comprising a plurality of features, wherein the features of each of the base templates are not found in any of the other base templates and the features of each of the base templates are not features of the machine learning model at a time of obtaining the three or more base templates; obtain a respective template performance score for each base template; select a first base template from the three or more base templates based on the first base template having the highest performance score relative to the performance scores of the other base templates; construct a first plurality of cross-templates by generating a respective cross-template of the selected first base template and each of the other base templates; test the performance of a machine learning model based on each of the first plurality of cross-templates to generate a respective cross-template performance score for each of the first plurality of cross-templates; select a first cross-template of the first plurality of cross-templates based on the cross-template performance score of the first cross-template; and add the features of the first cross-template to the machine learning model. 13. The system of claim 12, wherein the machine learning system is further configured to add the features of the first base template to the machine learning model. 14. The system of claim 12, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance per feature of the machine learning model including the first cross-template relative to a performance of the machine learning model excluding the first cross-template. 15. The system of claim 12, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance of the machine learning model including the first cross-template relative to performance of the machine learning model excluding the first cross-template. 16. The system of claim 12, wherein the template performance score of each base template is based on a degree of performance of a machine learning model including each template. 17. The system of claim 12, wherein the performance score of each base template is based on a number of occurrences associated with each feature in a template. 18. The system of claim 12, wherein the performance score of each base template is based on a number of impressions associated with each feature in a template. 19. (canceled) 20. The system of claim 12, wherein the machine learning system is further configured to:
construct a second plurality of cross-templates by generating a cross-template of the first cross-template and each one of the other cross-templates in the first plurality of cross-templates; and test the performance of a machine learning model based on each of the second plurality of cross-templates to generate a cross-template performance score for each of the second plurality of cross-templates; and select a second cross-template of the second plurality of cross-templates based on the cross-template performance score of the second cross-template. 21. The system of claim 20, wherein the machine learning system is further configured to:
add the features of the second cross-template to the machine learning model. 22. The system of claim 12, wherein the machine learning system is further configures to:
train the machine learning model; and use the trained machine learning model to make a prediction. | Systems and techniques are provided for template exploration in a large-scale machine learning system. A method may include obtaining multiple base templates, each base template comprising multiple features. A template performance score may be obtained for each base template and a first base template may be selected from among the multiple base templates based on the template performance score of the first base template. Multiple cross-templates may be constructed by generating a cross-template of the selected first base template and each of the multiple base templates. Performance of a machine learning model may be tested based on each cross-template to generate a cross-template performance score for each of the cross-templates. A first cross-template may be selected from among the multiple cross-templates based on the cross-template performance score of the cross-template. Accordingly, the first cross-template may be added to the machine learning model.1. A computer-implemented method comprising:
obtaining a computer-implemented machine learning model having features; obtaining three or more base templates, each base template comprising a plurality of features, wherein the features of each of the base templates are not found in any of the other base templates and the features of each of the base templates are not features of the machine learning model at a time of obtaining the three or more base templates; obtaining a respective template performance score for each base template; selecting a first base template from the three or more base templates based on the first base template having the highest template performance score relative to the performance scores of the other base templates; constructing a first plurality of cross-templates by generating a respective cross-template of the selected first base template and each of the other base templates; testing the performance of a computer-implemented machine learning model based on each of the first plurality of cross-templates to generate a respective cross-template performance score for each of the first plurality of cross-templates; selecting a first cross-template of the first plurality of cross-templates based on the cross-template performance score of the first cross-template; and adding the features of the first cross-template to the machine learning model. 2. The method of claim 1, further comprising adding the features of the first base template to the machine learning model. 3. The method of claim 1, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance per feature of the machine learning model including the first cross-template relative to a performance of the machine learning model excluding the first cross-template. 4. The method of claim 1, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance of the machine learning model including the first cross-template relative to performance of the machine learning model excluding the first cross-template. 5. The method of claim 1, wherein the template performance score of each base template is based on a degree of performance of a machine learning model including each base template. 6. The method of claim 1, wherein the performance score of each base template is based on a number of occurrences associated with each feature in a base template. 7. The method of claim 1, wherein the performance score of each base template is based on a number of impressions associated with each feature in a base template. 8. (canceled) 9. The method of claim 1, further comprising:
constructing a second plurality of cross-templates by generating a cross-template of the first cross-template and each one of the other cross-templates in the first plurality of cross-templates; and testing the performance of a machine learning model based on each of the second plurality of cross-templates to generate a cross-template performance score for each of the second plurality of cross-templates; and selecting a second cross-template of the second plurality of cross-templates based on the cross-template performance score of the second cross-template. 10. The method of claim 9, further comprising:
adding the features of the second cross-template to the machine learning model. 11. The method of claim 1, further comprising:
training the machine learning model; and using the trained machine learning model to make a prediction. 12. A computer-implemented machine learning system configured, by instructions adapted to be executed by the machine learning system to:
obtain a computer-implemented machine learning model having features; obtain three or more base templates, each base template comprising a plurality of features, wherein the features of each of the base templates are not found in any of the other base templates and the features of each of the base templates are not features of the machine learning model at a time of obtaining the three or more base templates; obtain a respective template performance score for each base template; select a first base template from the three or more base templates based on the first base template having the highest performance score relative to the performance scores of the other base templates; construct a first plurality of cross-templates by generating a respective cross-template of the selected first base template and each of the other base templates; test the performance of a machine learning model based on each of the first plurality of cross-templates to generate a respective cross-template performance score for each of the first plurality of cross-templates; select a first cross-template of the first plurality of cross-templates based on the cross-template performance score of the first cross-template; and add the features of the first cross-template to the machine learning model. 13. The system of claim 12, wherein the machine learning system is further configured to add the features of the first base template to the machine learning model. 14. The system of claim 12, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance per feature of the machine learning model including the first cross-template relative to a performance of the machine learning model excluding the first cross-template. 15. The system of claim 12, wherein the cross-template performance score of the first cross-template measures a degree of improvement of performance of the machine learning model including the first cross-template relative to performance of the machine learning model excluding the first cross-template. 16. The system of claim 12, wherein the template performance score of each base template is based on a degree of performance of a machine learning model including each template. 17. The system of claim 12, wherein the performance score of each base template is based on a number of occurrences associated with each feature in a template. 18. The system of claim 12, wherein the performance score of each base template is based on a number of impressions associated with each feature in a template. 19. (canceled) 20. The system of claim 12, wherein the machine learning system is further configured to:
construct a second plurality of cross-templates by generating a cross-template of the first cross-template and each one of the other cross-templates in the first plurality of cross-templates; and test the performance of a machine learning model based on each of the second plurality of cross-templates to generate a cross-template performance score for each of the second plurality of cross-templates; and select a second cross-template of the second plurality of cross-templates based on the cross-template performance score of the second cross-template. 21. The system of claim 20, wherein the machine learning system is further configured to:
add the features of the second cross-template to the machine learning model. 22. The system of claim 12, wherein the machine learning system is further configures to:
train the machine learning model; and use the trained machine learning model to make a prediction. | 2,100 |
5,047 | 14,975,616 | 2,168 | In an example embodiment, usage information is used to calculate one or more individual document historical information-deficient metrics (IDHIDMs) by combining values for the one or more metrics from multiple documents within the document corpus that share an identical combination of entities of the one or more entity types. A search query is segmented into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type. At least one IDHIDM for a combination of entities matching the tagged segments is used to rank one or more retrieved documents responsive to the query. | 1. A computer-implemented method for automatically calculating online metrics, comprising:
obtaining usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identifying entity types of the plurality of limited lifespan objects; calculating one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; creating a plurality of groupings including a set of limited lifespan objects of the plurality of limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receiving a search query, via a second user interface, for one or more documents; segmenting the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieving from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determining, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and displaying the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 2. The method of claim 1, wherein the single combined metric is click-through-rate (CTR). 3. The method of claim 1, wherein the one or more documents are job postings. 4. The method of claim 3, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 5. The method of claim 1, wherein the obtaining, identifying, and calculating are performed offline. 6. The method of claim 1, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. 7. The method of claim 1, wherein the calculating further comprises calculating the one or more IDHIDMs by combining values for one or more metrics of the plurality of limited lifespan objects corresponding to the documents within the document corpus that have a different combination of entities of the one or more entity types, but whose entities have a defined relationship to one another. 8. A system comprising:
a computer readable medium having instructions stored there on, which, when executed by a processor, cause the system to: obtain usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identify entity types of the plurality of limited lifespan objects; calculate one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; create a plurality of groupings including a set of limited lifespan objects of the plurality limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for the two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receive a search query, via a second user interface, for one or more documents; segment the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieve from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determine, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and display the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 9. The system of claim 8, wherein the single combined metric is click-through-rate (CTR). 10. The system of claim 8, wherein the one or more documents are job postings. 11. The system of claim 10, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 12. The system of claim 8, wherein the obtaining, identifying, and calculating are performed offline. 13. The system of claim 8, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. 14. The system of claim 8, wherein the calculating further comprises calculating the one or more IDHIDMs by combining values for one or more metrics of the plurality of limited lifespan objects corresponding to the documents within the document corpus that have a different combination of entities of the one or more entity types, but whose entities have a defined relationship to one another. 15. 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 operations comprising:
obtaining usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identifying entity types of the plurality of limited lifespan objects; calculating one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; creating a plurality of groupings including a set of limited lifespan objects of the plurality of limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for the two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receiving a search query, via a second user interface, for one or more documents; segmenting the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieving from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determining, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and displaying the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 16. The non-transitory machine-readable storage medium of claim 15, wherein the single combined metric is click-through-rate (CTR). 17. The non-transitory machine-readable storage medium of claim 15, wherein the one or more documents are job postings. 18. The non-transitory machine-readable storage medium of claim 17, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 19. The non-transitory machine-readable storage medium of claim 15, wherein the obtaining, identifying, and calculating are performed offline. 20. The non-transitory machine-readable storage medium of claim 15, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. | In an example embodiment, usage information is used to calculate one or more individual document historical information-deficient metrics (IDHIDMs) by combining values for the one or more metrics from multiple documents within the document corpus that share an identical combination of entities of the one or more entity types. A search query is segmented into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type. At least one IDHIDM for a combination of entities matching the tagged segments is used to rank one or more retrieved documents responsive to the query.1. A computer-implemented method for automatically calculating online metrics, comprising:
obtaining usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identifying entity types of the plurality of limited lifespan objects; calculating one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; creating a plurality of groupings including a set of limited lifespan objects of the plurality of limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receiving a search query, via a second user interface, for one or more documents; segmenting the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieving from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determining, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and displaying the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 2. The method of claim 1, wherein the single combined metric is click-through-rate (CTR). 3. The method of claim 1, wherein the one or more documents are job postings. 4. The method of claim 3, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 5. The method of claim 1, wherein the obtaining, identifying, and calculating are performed offline. 6. The method of claim 1, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. 7. The method of claim 1, wherein the calculating further comprises calculating the one or more IDHIDMs by combining values for one or more metrics of the plurality of limited lifespan objects corresponding to the documents within the document corpus that have a different combination of entities of the one or more entity types, but whose entities have a defined relationship to one another. 8. A system comprising:
a computer readable medium having instructions stored there on, which, when executed by a processor, cause the system to: obtain usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identify entity types of the plurality of limited lifespan objects; calculate one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; create a plurality of groupings including a set of limited lifespan objects of the plurality limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for the two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receive a search query, via a second user interface, for one or more documents; segment the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieve from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determine, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and display the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 9. The system of claim 8, wherein the single combined metric is click-through-rate (CTR). 10. The system of claim 8, wherein the one or more documents are job postings. 11. The system of claim 10, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 12. The system of claim 8, wherein the obtaining, identifying, and calculating are performed offline. 13. The system of claim 8, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. 14. The system of claim 8, wherein the calculating further comprises calculating the one or more IDHIDMs by combining values for one or more metrics of the plurality of limited lifespan objects corresponding to the documents within the document corpus that have a different combination of entities of the one or more entity types, but whose entities have a defined relationship to one another. 15. 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 operations comprising:
obtaining usage information about how users previously interacted, via a first user interface of an electronic device, with a plurality of limited lifespan objects in a database of objects, wherein a limited lifespan object of the plurality of limited lifespan objects corresponds to a respective document in a document corpus for which a click-through-rate cannot be determined based on the historical data related to the document; identifying entity types of the plurality of limited lifespan objects; calculating one or more individual document historical information-deficient metrics (IDHIDMs) for each of the plurality of limited lifespan objects; creating a plurality of groupings including a set of limited lifespan objects of the plurality of limited lifespan objects corresponding to documents that share an identical combination of entity types; combining values for the two or more IDHIDMs corresponding to a group of limited lifespan objects in each grouping of the plurality of groupings into a single combined metric for the respective grouping; receiving a search query, via a second user interface, for one or more documents; segmenting the search query into a plurality of segments, wherein at least one of the plurality of segments is tagged as a first entity type and at least one of the plurality of segments is tagged as a second entity type; retrieving from the database in response to receiving the search query, the set of limited lifespan objects by comparing the tagged segments to index terms having identical entity types as the first entity type and the second entity type; determining, using the single combined metric for one or more groupings of limited lifespan objects matching the tagged segments, a rank of each limited lifespan object of the set of limited lifespan objects; and displaying the documents corresponding to the set of limited lifespan objects in response to receiving the search query to the user in an order dictated by the rank. 16. The non-transitory machine-readable storage medium of claim 15, wherein the single combined metric is click-through-rate (CTR). 17. The non-transitory machine-readable storage medium of claim 15, wherein the one or more documents are job postings. 18. The non-transitory machine-readable storage medium of claim 17, wherein job postings are indexed in a job posting database using terms extracted from the job postings and assigned a plurality of different entity types. 19. The non-transitory machine-readable storage medium of claim 15, wherein the obtaining, identifying, and calculating are performed offline. 20. The non-transitory machine-readable storage medium of claim 15, wherein the calculating is performed on-the-fly at runtime in response to the segmenting of the search query. | 2,100 |
5,048 | 15,049,830 | 2,131 | A prefetch controller is configured to communicate with a prefetch cache in order to increase system performance. The prefetch controller includes an instruction lookup table (ILT) configured to receive a first tuple including a first instruction ID and a first missed data address. The prefetch controller further includes a tuple history queue (THQ) configured to receive an instruction/stride tuple, the instruction/stride tuple generated by subtracting a last data access address from the first missed data address. The prefetch controller further includes a sequence prediction table (SPT) in communication with the tuple history queue (THQ) and the instruction lookup table. The prefetch controller includes an adder in communication with the instruction lookup table (ILT) and the sequence prediction table (SPT) configured to generate a predicted prefetch address and to provide the predicted prefetch address to a prefetch cache. | 1-20. (canceled) 21. A computer hardware system, comprising:
a data cache; a prefetch controller configured to
receive an initial tuple including an initial instruction ID and an initial missed data address,
retrieve a last data access address,
subtract the last data access address from the initial missed data address to generate an instruction/stride tuple,
generate a predicted prefetch address using the instruction/stride tuple; and
a prefetch cache configured to
receive, from the prefetch controller, the predicted prefetch address, and
provide, to the data cache, the predicted prefetch address. 22. The system of claim 21, wherein
the prefetch controller includes a tuple history queue (THQ) configured to receive and store the instruction/stride tuple. 23. The system of claim 22, wherein
the prefetch controller includes a sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 24. The system of claim 23, wherein
the prefetch controller includes an instruction lookup table (ILT) in communication with the sequence prediction table (SPT) and configured to store a last data address accessed for each tuple. 25. The system of claim 23, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 26. The system of claim 25, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. 27. The system of claim 24, wherein
the predicted prefetch address is generated by adding a predicted tuple having a stride data address from the sequence prediction table (SPT) with a last data address obtained from the instruction lookup table (ILT). 28. A computer-implemented method, comprising:
receiving, by a prefetch controller, an initial tuple including an initial instruction ID and an initial missed data address; retrieving, by the prefetch controller, a last data access address; subtracting, by the prefetch controller, the last data access address from the initial missed data address to generate an instruction/stride tuple; generating, by the prefetch controller, a predicted prefetch address using the instruction/stride tuple; receiving, by a prefetch cache and from the prefetch controller, the predicted prefetch address, and providing, to the data cache and by the prefect cache, the predicted prefetch address. 29. The method of claim 28, wherein
the prefetch controller includes a tuple history queue (THQ) configured to receive and store the instruction/stride tuple. 30. The method of claim 29, wherein
the prefetch controller includes a sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 31. The method of claim 30, wherein
the prefetch controller includes an instruction lookup table (ILT) in communication with the sequence prediction table (SPT) and configured to store a last data address accessed for each tuple. 32. The method of claim 30, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 33. The method of claim 32, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. 34. The method of claim 31, wherein
the predicted prefetch address is generated by adding a predicted tuple having a stride data address from the sequence prediction table (SPT) with a last data address obtained from the instruction lookup table (ILT). 35. A prefetch controller within a computer hardware system including a data cache and a prefetch cache, comprising:
an instruction lookup table (ILT) configured to receive an initial tuple including an initial instruction ID and an initial missed data address; a tuple history queue (THQ) configured to receive an instruction/stride tuple generated by subtracting a last data access address from the initial missed data address; a sequence prediction table (SPT) in communication with the instruction lookup table (ILT) and the tuple history queue (THQ); an adder in communication with the instruction lookup table (ILT) and sequence prediction table (SPT) and configured to
generate a predicted prefetch address using the instruction/stride tuple, and
provide, to the prefetch cache, the predicted prefetch address, wherein
the prefetch cache is configured to provide, to the data cache, the predicted prefetch address. 36. The prefetch controller of claim 35, wherein
the tuple history queue (THQ) is configured to store the instruction/stride tuple and provide access for the sequence prediction table (SPT) 37. The prefetch controller of claim 36, wherein
the sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 38. The prefetch controller of claim 37, wherein
the instruction lookup table (ILT) is configured to store a last data address accessed for each tuple. 39. The prefetch controller of claim 37, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 40. The prefetch controller of claim 39, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. | A prefetch controller is configured to communicate with a prefetch cache in order to increase system performance. The prefetch controller includes an instruction lookup table (ILT) configured to receive a first tuple including a first instruction ID and a first missed data address. The prefetch controller further includes a tuple history queue (THQ) configured to receive an instruction/stride tuple, the instruction/stride tuple generated by subtracting a last data access address from the first missed data address. The prefetch controller further includes a sequence prediction table (SPT) in communication with the tuple history queue (THQ) and the instruction lookup table. The prefetch controller includes an adder in communication with the instruction lookup table (ILT) and the sequence prediction table (SPT) configured to generate a predicted prefetch address and to provide the predicted prefetch address to a prefetch cache.1-20. (canceled) 21. A computer hardware system, comprising:
a data cache; a prefetch controller configured to
receive an initial tuple including an initial instruction ID and an initial missed data address,
retrieve a last data access address,
subtract the last data access address from the initial missed data address to generate an instruction/stride tuple,
generate a predicted prefetch address using the instruction/stride tuple; and
a prefetch cache configured to
receive, from the prefetch controller, the predicted prefetch address, and
provide, to the data cache, the predicted prefetch address. 22. The system of claim 21, wherein
the prefetch controller includes a tuple history queue (THQ) configured to receive and store the instruction/stride tuple. 23. The system of claim 22, wherein
the prefetch controller includes a sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 24. The system of claim 23, wherein
the prefetch controller includes an instruction lookup table (ILT) in communication with the sequence prediction table (SPT) and configured to store a last data address accessed for each tuple. 25. The system of claim 23, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 26. The system of claim 25, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. 27. The system of claim 24, wherein
the predicted prefetch address is generated by adding a predicted tuple having a stride data address from the sequence prediction table (SPT) with a last data address obtained from the instruction lookup table (ILT). 28. A computer-implemented method, comprising:
receiving, by a prefetch controller, an initial tuple including an initial instruction ID and an initial missed data address; retrieving, by the prefetch controller, a last data access address; subtracting, by the prefetch controller, the last data access address from the initial missed data address to generate an instruction/stride tuple; generating, by the prefetch controller, a predicted prefetch address using the instruction/stride tuple; receiving, by a prefetch cache and from the prefetch controller, the predicted prefetch address, and providing, to the data cache and by the prefect cache, the predicted prefetch address. 29. The method of claim 28, wherein
the prefetch controller includes a tuple history queue (THQ) configured to receive and store the instruction/stride tuple. 30. The method of claim 29, wherein
the prefetch controller includes a sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 31. The method of claim 30, wherein
the prefetch controller includes an instruction lookup table (ILT) in communication with the sequence prediction table (SPT) and configured to store a last data address accessed for each tuple. 32. The method of claim 30, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 33. The method of claim 32, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. 34. The method of claim 31, wherein
the predicted prefetch address is generated by adding a predicted tuple having a stride data address from the sequence prediction table (SPT) with a last data address obtained from the instruction lookup table (ILT). 35. A prefetch controller within a computer hardware system including a data cache and a prefetch cache, comprising:
an instruction lookup table (ILT) configured to receive an initial tuple including an initial instruction ID and an initial missed data address; a tuple history queue (THQ) configured to receive an instruction/stride tuple generated by subtracting a last data access address from the initial missed data address; a sequence prediction table (SPT) in communication with the instruction lookup table (ILT) and the tuple history queue (THQ); an adder in communication with the instruction lookup table (ILT) and sequence prediction table (SPT) and configured to
generate a predicted prefetch address using the instruction/stride tuple, and
provide, to the prefetch cache, the predicted prefetch address, wherein
the prefetch cache is configured to provide, to the data cache, the predicted prefetch address. 36. The prefetch controller of claim 35, wherein
the tuple history queue (THQ) is configured to store the instruction/stride tuple and provide access for the sequence prediction table (SPT) 37. The prefetch controller of claim 36, wherein
the sequence prediction table (SPT) configured to receive at least one of a current tuple and current sequence from the tuple history queue (THQ). 38. The prefetch controller of claim 37, wherein
the instruction lookup table (ILT) is configured to store a last data address accessed for each tuple. 39. The prefetch controller of claim 37, wherein
the sequence prediction table (SPT) is configured to search for a match for the current sequence. 40. The prefetch controller of claim 39, wherein
the sequence prediction table (SPT) is configured to increment a next tuple count if the match for the current sequence is located. | 2,100 |
5,049 | 14,485,615 | 2,174 | The techniques discussed herein may facilitate user account management while also protecting a user's personally identifiable information (PII). The user's PII is stored in a protected area, such as a secure operating system area. The techniques may also implement a broker process to access a user's PII. The techniques display a user's accounts that are available for use with an application. The techniques further provide for passing a hint to the application upon receiving selection of an account, wherein the hint indicates which user account is selected, without divulging to the application any of the user's PII. | 1. A method comprising:
receiving, from an application, a request for information for available user accounts for use with the application; retrieving the information for the available user accounts, the information being inaccessible to the application; assigning a unique hint to each of the available user accounts; displaying a list of the available user accounts; receiving a selection of a user account from the list; and providing a hint to the application, the hint corresponding to the selected user account. 2. The method of claim 1, wherein the information for available user accounts includes personally identifiable information (PII). 3. The method of claim 2, wherein the unique hint does not include the PII. 4. The method of claim 3, wherein the hint comprises at least a number, character, or symbol. 5. The method of claim 1, wherein the information for the available user accounts is accessible to an operating system. 6. The method of claim 1, wherein the application is associated with a lower security level than the information for available user accounts. 7. The method of claim 1, wherein displaying the list of the available user accounts further comprises displaying a list of account types that are recognized by an operating system. 8. The method of claim 1, wherein the information for the available user accounts is stored in a data store associated with the operating system. 9. The method of claim 1, wherein the information for the available user accounts is stored in a distributed computing environment. 10. A device comprising:
one or more processing units; computer-readable media with modules thereon, the modules comprising:
an accounts control module configured to:
query an operating system for saved user accounts for use with an application;
assign a hint to each of the saved user accounts;
display a list of the saved user accounts;
receive a selection of a user account from the list; and
provide a hint to the application, the hint corresponding to the selected user account. 11. The device of claim 10, wherein personally identifiable information (PII) associated with the saved user accounts is inaccessible to the application. 12. The device of claim 10, wherein the application is associated with a lower security level than a security level associated with the saved user accounts. 13. The device of claim 10, wherein the accounts control module is associated with a same security level as a security level associated with the saved user accounts. 14. The device of claim 10, wherein the saved accounts are stored in a data store, wherein the data store is at least in part separate from the operating system. 15. The device of claim 10, wherein the accounts control module receives an indication of types of accounts that can be used with the application. 16. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, configure a computer to perform acts comprising:
receiving a request for saved user accounts for use with an application, the saved user accounts inaccessible to the application; retrieving the saved user accounts from a data store; displaying a list of the saved user accounts; receiving a selection of a user account from the list; and providing, to the application, an indication of the selected user account. 17. The computer-readable media of claim 16, wherein the acts further comprise assigning a unique hint to each of the available user accounts, and wherein providing, to the application, the indication of the selected user account comprises providing, to the application, a hint corresponding to the selected user account. 18. The computer-readable media of claim 16, wherein the data store is associated with a higher level of security than the application. 19. The computer-readable media of claim 16, wherein the data store is associated with a same security level as the operating system. 20. The computer-readable media of claim 16, wherein retrieving the saved user accounts from the data store comprises downloading an updated version of the data store from a distributed computing environment. | The techniques discussed herein may facilitate user account management while also protecting a user's personally identifiable information (PII). The user's PII is stored in a protected area, such as a secure operating system area. The techniques may also implement a broker process to access a user's PII. The techniques display a user's accounts that are available for use with an application. The techniques further provide for passing a hint to the application upon receiving selection of an account, wherein the hint indicates which user account is selected, without divulging to the application any of the user's PII.1. A method comprising:
receiving, from an application, a request for information for available user accounts for use with the application; retrieving the information for the available user accounts, the information being inaccessible to the application; assigning a unique hint to each of the available user accounts; displaying a list of the available user accounts; receiving a selection of a user account from the list; and providing a hint to the application, the hint corresponding to the selected user account. 2. The method of claim 1, wherein the information for available user accounts includes personally identifiable information (PII). 3. The method of claim 2, wherein the unique hint does not include the PII. 4. The method of claim 3, wherein the hint comprises at least a number, character, or symbol. 5. The method of claim 1, wherein the information for the available user accounts is accessible to an operating system. 6. The method of claim 1, wherein the application is associated with a lower security level than the information for available user accounts. 7. The method of claim 1, wherein displaying the list of the available user accounts further comprises displaying a list of account types that are recognized by an operating system. 8. The method of claim 1, wherein the information for the available user accounts is stored in a data store associated with the operating system. 9. The method of claim 1, wherein the information for the available user accounts is stored in a distributed computing environment. 10. A device comprising:
one or more processing units; computer-readable media with modules thereon, the modules comprising:
an accounts control module configured to:
query an operating system for saved user accounts for use with an application;
assign a hint to each of the saved user accounts;
display a list of the saved user accounts;
receive a selection of a user account from the list; and
provide a hint to the application, the hint corresponding to the selected user account. 11. The device of claim 10, wherein personally identifiable information (PII) associated with the saved user accounts is inaccessible to the application. 12. The device of claim 10, wherein the application is associated with a lower security level than a security level associated with the saved user accounts. 13. The device of claim 10, wherein the accounts control module is associated with a same security level as a security level associated with the saved user accounts. 14. The device of claim 10, wherein the saved accounts are stored in a data store, wherein the data store is at least in part separate from the operating system. 15. The device of claim 10, wherein the accounts control module receives an indication of types of accounts that can be used with the application. 16. One or more computer-readable media storing computer-executable instructions that, when executed on one or more processors, configure a computer to perform acts comprising:
receiving a request for saved user accounts for use with an application, the saved user accounts inaccessible to the application; retrieving the saved user accounts from a data store; displaying a list of the saved user accounts; receiving a selection of a user account from the list; and providing, to the application, an indication of the selected user account. 17. The computer-readable media of claim 16, wherein the acts further comprise assigning a unique hint to each of the available user accounts, and wherein providing, to the application, the indication of the selected user account comprises providing, to the application, a hint corresponding to the selected user account. 18. The computer-readable media of claim 16, wherein the data store is associated with a higher level of security than the application. 19. The computer-readable media of claim 16, wherein the data store is associated with a same security level as the operating system. 20. The computer-readable media of claim 16, wherein retrieving the saved user accounts from the data store comprises downloading an updated version of the data store from a distributed computing environment. | 2,100 |
5,050 | 15,280,022 | 2,125 | An artificial intelligence apparatus includes an input processor configured to convert input information to patterns, an analyzer configured to analyze the input information, a recorder configured to record the information, a controller configured to perform at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal and an output processor configured to convert the patterns to information or control signals. | 1. An artificial intelligence apparatus comprising:
an input processor configured to convert input information to patterns, the input information including at least one of a word, language, a sentence, knowledge, a numerical expression, a symbol, an image and sound; an analyzer configured to analyze, of the input information, at least one of words, meanings, parts of speech, fields, reliability, newness, validity, comparison with recorded information, types of sentences, intention and relations between sentences, the parts of speech including subject, predicate, modifiers of the subject, modifiers of the predicate or relations between modifiers; a recorder configured to record at least one of information, a type of a problem, a methods to solve the problem, a procedure, a thought, an idea, a context, a result of analysis, a connective relations and a relationship between information, a conditions to activate information or a program, and an activation history of information and a program; a controller configured to perform at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal; and an output processor configured to convert the patterns to information or control signals 2. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to perform processing instructed by language autonomously. 3. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to solve a problem autonomously using data of at least one of truth, facts, special knowledge, rules, common sense, the input information and procedures instructed by language. 4. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to evaluate the input information and perform the processing according to the results of analysis autonomously, the processing including recording the information, updating a knowledge system, executing the instructed items, and answering to the questions. 5. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
extract a useful relation by strengthening a relation between one group of patterns and another group of patterns, the relations associating the input information with a significant relation, and
construct a generalized thought, a prediction, an estimate, a common sense from the input information autonomously. 6. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to generate a procedure by searching related information from a knowledge system and the input information autonomously, and to proceed processing considering a result of the processing autonomously. 7. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
analyze at least one of a source, reliability, newness, fields, themes, the subject, modifiers of the subject, the predicate, modifiers of the predicate, relations between modifiers, when, where, who, what, how, why, do what, the types of the sentences, numerical expressions, chemical expressions and relations with recorded information, the types of the sentences including normal sentences, interrogative sentences, imperative sentences, conditional sentences, truth, facts, rules, common sense, definitions, logics, explanations, assumptions, predictions, opinions, impressions, and rumors, of the input information, and
arrange and record into the structures for easy searching. 8. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to, by using a knowledge system, analyze a situation, recognize a problem, search for information to solve the problems, activate a program to perform processing, generate information to solve the problem, install the information into the knowledge system, and solve the problem and expand the knowledge furthermore autonomously. 9. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to analyze a relation between the input information and recorded information, extract and record valuable and safe information, construct, update and expand a knowledge system, search for the recorded information to solve a problem, activate a necessary program among various solving programs, generate information necessary to solve the problem, and solve the problem. 10. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to record and output information regarding designated information associatively. 11. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to compare designated information with the recorded information in a knowledge system and evaluate at least one of newness, a difference with the knowledge system, and a value of the designated information. 12. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to construct a knowledge system having a relation between information and summarize or develop in detail using the relation between the information and the knowledge system autonomously. 13. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to record the information associatively, search for the information about a designated theme and a topic and generate a conversation according to an intentions of a speaker. 14. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to detect and learn a context using a history of a pattern activation and generate conversations according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument. 15. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
detect and learn a context using a history of a pattern activation and generate a conversation according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument,
gather information about a designated speaker or a topic including at least one of an interested topic, a thought about a problem, a response to a phenomenon, an opinion, an action, and a detailed information, and
record and accumulate in a knowledge system. 16. A computer implemented method for realizing an artificial intelligence comprising:
converting input information to patterns, the input information including at least one of a word, language, a sentence, knowledge, a numerical expression, a symbol, an image and sound; analyzing, of the input information, at least one of words, meanings, parts of speech, fields, reliability, newness, validity, comparing with the recorded information, types of sentences, and intention and relations between sentences of the input information, the parts of speech including subject, predicate, modifiers of the subject, modifiers of the predicate or relations between modifiers; recording at least one of information, a type of a problem, a methods to solve the problem, a procedure, a thought, an idea, a context, a result of analysis, a connective relations and a relationship between information, a conditions to activate information or a program, and an activation history of information and a program; performing at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal; and converting the patterns to information or control signals. 17. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising performing processing instructed by language autonomously. 18. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising solving a problem autonomously using data of at least one of truth, facts, special knowledge, rules, common sense, the input information and procedures instructed by language. 19. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising evaluating the input information and performing the processing according to the results of analysis autonomously, the processing including recording the information, updating a knowledge system, executing the instructed items, answering to the questions. 20. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising extracting a useful relation by strengthening a relation between one group of patterns and another group of patterns, the relations associating the input information with a significant relation, and
constructing a generalized thought, a prediction, an estimate, a common sense from the input information autonomously. 21. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising generating a procedure by searching related information from a knowledge system and the input information autonomously, and proceeding processing considering a result of the processing autonomously. 22. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising analyzing at least one of a source, reliability, newness, fields, themes, the subject, modifiers of the subject, the predicate, modifiers of the predicate, relations between modifiers, when, where, who, what, how, why, do what, the types of the sentences, numerical expressions, chemical expressions and relations with recorded information, the types of the sentences including normal sentences, interrogative sentences, imperative sentences, conditional sentences, truth, facts, rules, common sense, definitions, logics, explanations, assumptions, predictions, opinions, impressions, and rumors, of the input information, and
arranging and recording into the structures for easy searching. 23. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising, by using a knowledge system, analyzing a situation, recognizing a problem, searching for information to solve the problem, activating a programs to perform processing, generating information to solve the problem, installing the information into the knowledge system, solving the problem and expanding the knowledge furthermore autonomously. 24. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising analyzing a relation between the input information and recorded information, extracting and record valuable and safe information, constructing, updating and expanding a knowledge system, searching for the recorded information to solve the problem, activating a necessary program among various solving programs, generating information necessary to solve the problem and solving the problem. 25. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising recording and outputting information regarding designated information associatively. 26. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising comparing designated information with the recorded information in a knowledge system and evaluating at least one of newness, a difference with the knowledge system, and a value of the designated information. 27. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising constructing a knowledge system having a relation between information and summarizing or developing in detail using the relation between the information and the knowledge system autonomously. 28. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising recording the information associatively, searching for the information about a designated theme and a topic and generating a conversation according to an intention of a speaker. 29. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising detecting and learning a context using a history of a pattern activation and generate conversations according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument. 30. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising
detecting and learning a context using a history of a pattern activation and generate a conversation according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument
gathering information about a designated speaker or a topic including at least one of an interested topic, a thought about a problem, a response to a phenomenon, an opinion, an action, and a detailed information, and
recording and accumulating in a knowledge system. | An artificial intelligence apparatus includes an input processor configured to convert input information to patterns, an analyzer configured to analyze the input information, a recorder configured to record the information, a controller configured to perform at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal and an output processor configured to convert the patterns to information or control signals.1. An artificial intelligence apparatus comprising:
an input processor configured to convert input information to patterns, the input information including at least one of a word, language, a sentence, knowledge, a numerical expression, a symbol, an image and sound; an analyzer configured to analyze, of the input information, at least one of words, meanings, parts of speech, fields, reliability, newness, validity, comparison with recorded information, types of sentences, intention and relations between sentences, the parts of speech including subject, predicate, modifiers of the subject, modifiers of the predicate or relations between modifiers; a recorder configured to record at least one of information, a type of a problem, a methods to solve the problem, a procedure, a thought, an idea, a context, a result of analysis, a connective relations and a relationship between information, a conditions to activate information or a program, and an activation history of information and a program; a controller configured to perform at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal; and an output processor configured to convert the patterns to information or control signals 2. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to perform processing instructed by language autonomously. 3. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to solve a problem autonomously using data of at least one of truth, facts, special knowledge, rules, common sense, the input information and procedures instructed by language. 4. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to evaluate the input information and perform the processing according to the results of analysis autonomously, the processing including recording the information, updating a knowledge system, executing the instructed items, and answering to the questions. 5. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
extract a useful relation by strengthening a relation between one group of patterns and another group of patterns, the relations associating the input information with a significant relation, and
construct a generalized thought, a prediction, an estimate, a common sense from the input information autonomously. 6. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to generate a procedure by searching related information from a knowledge system and the input information autonomously, and to proceed processing considering a result of the processing autonomously. 7. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
analyze at least one of a source, reliability, newness, fields, themes, the subject, modifiers of the subject, the predicate, modifiers of the predicate, relations between modifiers, when, where, who, what, how, why, do what, the types of the sentences, numerical expressions, chemical expressions and relations with recorded information, the types of the sentences including normal sentences, interrogative sentences, imperative sentences, conditional sentences, truth, facts, rules, common sense, definitions, logics, explanations, assumptions, predictions, opinions, impressions, and rumors, of the input information, and
arrange and record into the structures for easy searching. 8. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to, by using a knowledge system, analyze a situation, recognize a problem, search for information to solve the problems, activate a program to perform processing, generate information to solve the problem, install the information into the knowledge system, and solve the problem and expand the knowledge furthermore autonomously. 9. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to analyze a relation between the input information and recorded information, extract and record valuable and safe information, construct, update and expand a knowledge system, search for the recorded information to solve a problem, activate a necessary program among various solving programs, generate information necessary to solve the problem, and solve the problem. 10. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to record and output information regarding designated information associatively. 11. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to compare designated information with the recorded information in a knowledge system and evaluate at least one of newness, a difference with the knowledge system, and a value of the designated information. 12. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to construct a knowledge system having a relation between information and summarize or develop in detail using the relation between the information and the knowledge system autonomously. 13. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to record the information associatively, search for the information about a designated theme and a topic and generate a conversation according to an intentions of a speaker. 14. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to detect and learn a context using a history of a pattern activation and generate conversations according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument. 15. The artificial intelligence apparatus of claim 1 wherein the artificial intelligence apparatus is configured to
detect and learn a context using a history of a pattern activation and generate a conversation according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument,
gather information about a designated speaker or a topic including at least one of an interested topic, a thought about a problem, a response to a phenomenon, an opinion, an action, and a detailed information, and
record and accumulate in a knowledge system. 16. A computer implemented method for realizing an artificial intelligence comprising:
converting input information to patterns, the input information including at least one of a word, language, a sentence, knowledge, a numerical expression, a symbol, an image and sound; analyzing, of the input information, at least one of words, meanings, parts of speech, fields, reliability, newness, validity, comparing with the recorded information, types of sentences, and intention and relations between sentences of the input information, the parts of speech including subject, predicate, modifiers of the subject, modifiers of the predicate or relations between modifiers; recording at least one of information, a type of a problem, a methods to solve the problem, a procedure, a thought, an idea, a context, a result of analysis, a connective relations and a relationship between information, a conditions to activate information or a program, and an activation history of information and a program; performing at least one of a development of a process according to a type of a sentences and an intention, a search for information and a logic development to solve a problem, an execution of a process and activating a program, a generalization of information and a procedure, an update to a better knowledge and a logic, a search and an arrangement of information about an interesting field and an item, recording and updating of information, connective relations and relationship, and a transition control between information to a goal; and converting the patterns to information or control signals. 17. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising performing processing instructed by language autonomously. 18. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising solving a problem autonomously using data of at least one of truth, facts, special knowledge, rules, common sense, the input information and procedures instructed by language. 19. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising evaluating the input information and performing the processing according to the results of analysis autonomously, the processing including recording the information, updating a knowledge system, executing the instructed items, answering to the questions. 20. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising extracting a useful relation by strengthening a relation between one group of patterns and another group of patterns, the relations associating the input information with a significant relation, and
constructing a generalized thought, a prediction, an estimate, a common sense from the input information autonomously. 21. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising generating a procedure by searching related information from a knowledge system and the input information autonomously, and proceeding processing considering a result of the processing autonomously. 22. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising analyzing at least one of a source, reliability, newness, fields, themes, the subject, modifiers of the subject, the predicate, modifiers of the predicate, relations between modifiers, when, where, who, what, how, why, do what, the types of the sentences, numerical expressions, chemical expressions and relations with recorded information, the types of the sentences including normal sentences, interrogative sentences, imperative sentences, conditional sentences, truth, facts, rules, common sense, definitions, logics, explanations, assumptions, predictions, opinions, impressions, and rumors, of the input information, and
arranging and recording into the structures for easy searching. 23. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising, by using a knowledge system, analyzing a situation, recognizing a problem, searching for information to solve the problem, activating a programs to perform processing, generating information to solve the problem, installing the information into the knowledge system, solving the problem and expanding the knowledge furthermore autonomously. 24. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising analyzing a relation between the input information and recorded information, extracting and record valuable and safe information, constructing, updating and expanding a knowledge system, searching for the recorded information to solve the problem, activating a necessary program among various solving programs, generating information necessary to solve the problem and solving the problem. 25. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising recording and outputting information regarding designated information associatively. 26. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising comparing designated information with the recorded information in a knowledge system and evaluating at least one of newness, a difference with the knowledge system, and a value of the designated information. 27. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising constructing a knowledge system having a relation between information and summarizing or developing in detail using the relation between the information and the knowledge system autonomously. 28. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising recording the information associatively, searching for the information about a designated theme and a topic and generating a conversation according to an intention of a speaker. 29. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising detecting and learning a context using a history of a pattern activation and generate conversations according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument. 30. The computer implemented method for realizing an artificial intelligence of claim 16,
further comprising
detecting and learning a context using a history of a pattern activation and generate a conversation according to the context including at least one of a question, a response, a confirmation, generation of an associated topic, an opinion, and an argument
gathering information about a designated speaker or a topic including at least one of an interested topic, a thought about a problem, a response to a phenomenon, an opinion, an action, and a detailed information, and
recording and accumulating in a knowledge system. | 2,100 |
5,051 | 14,452,472 | 2,163 | A contact center is operated, on behalf of an entity, by reference to social media analytics. A user profile, acquired for each of a plurality of social media users, identifies the user and includes at least one of three indications of sentiment derived over time through analysis of social media event activities and/or behavior. The sentiment indications of a profile include user sentiment toward the entity, user sentiment toward one or more competitor(s) of the entity, and/or user sentiment toward a particular product or service offered by the entity or a competitor(s) of the entity. A communication session is established between a communication terminal of a contact center agent and one of the users for whom a user profile is stored. A menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user's profile is displayed to the agent. | 1. A computer implemented method for managing communications in a contact center, comprising:
monitoring social media activities by a community of users, wherein the community of users includes at least one of
one or more customers of an entity;
one or more customers of a competitor of the entity;
one or more users of a product or service provided by the entity; or
one or more users of a product or service provided by a competitor of the entity;
by a processor, automatically generating and storing a user profile for at least some of the community of users, wherein each generated and stored user profile includes an identity of the user, and at least one of
an indication of the identified user's sentiment toward the entity at one or more points in time;
an indication of the identified user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the identified user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
establishing a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and retrieving and displaying, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 2. The method according to claim 1, wherein the monitored social media activities includes at least one of posts, comments, likes, or tags expressed by users of the community of users via one or more social network channels. 3. The method according to claim 1, wherein the establishing is responsive to a request received by a communication from the first user. 4. The method according to claim 3, wherein the request is submitted by a message posted to a social network page of the entity. 5. The method according to claim 4, wherein the established communication session includes a reply message posted to a social network page of the entity or to a social network page of the first user. 6. The method according to claim 3, wherein the request is for an interactive voice communication session 7. The method according to claim 1, further including identifying, based on the monitoring, at least one shift in at least one of:
sentiment toward or away from the entity; sentiment toward or away from a competitor of the entity; sentiment toward or away from a product or service offered by the entity; or sentiment toward or away from a product or service offered by a competitor of the entity; and correlating, by execution of instructions using a processor, the shift to at least one of a plurality of stored, predefined event windows. 8. The method according to claim 7, wherein each event window corresponds to a product or service launch by the entity or a competitor of the entity, a public announcement by the entity or a competitor of the entity, or launch of a promotional campaign by the entity or a competitor of the entity. 9. The method according to claim 7, further including a step of generating and transmitting an alerting message responsive to identification of a shift. 10. The method according to claim 1, wherein the monitoring comprises:
determining, during at least one monitoring window, a quantity of social media activity events accessible via the internet and identifying both a user of the community of users and at least one of the entity or a competitor of the entity. 11. The method according to claim 10, wherein social media activity events include messages, posts, comments, or tags used for expression of sentiment by users of the community of users. 12. The method according to claim 10, wherein the generating includes
assigning a time varying score to at least one of the entity or the at least one competitor of the entity, based on the volume of social media activity with respect to time during the monitoring window. 13. An apparatus comprising:
a computer having one or more processors, memory and at least one network interface, and further comprising:
a social media activity response module, including instructions executable by the one or more processors and configured to:
monitor social media activities by a community of users, wherein the community of users includes at least one of
one or more customers of an entity;
one or more customers of a competitor of the entity;
one or more user of a product or service provided by the entity; or
one or more user of a product or service provided by a competitor of the entity;
generate and store a user profile for at least some of the community of users, wherein each generated and stored user profile includes an identity of the user, and at least one of
an indication of the identified user's sentiment toward the entity at one or more points in time;
an indication of the identified user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the identified user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
establish a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and
forward, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 14. A computer implemented method for managing communications in a contact center operated on behalf of an entity, comprising:
receiving and storing a user profile for a community of social media users, wherein each respective generated and stored user profile includes
an identity of a corresponding user of the community of social media users, and
an indication of sentiment derived from social media event activities, the indication of sentiment including at least one of
an indication of the corresponding user's sentiment toward the entity at one or more points in time;
an indication of the corresponding user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the corresponding user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
scheduling a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and retrieving and displaying, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 15. The method according to claim 14, wherein social media activity events from which sentiment indications are derived include messages, posts, comments, or tags used for expression of sentiment by users of the community of users. 16. The method according to claim 14, wherein each corresponding user profile includes a time varying score assigned to at least one of the entity or the at least one competitor of the entity, based on a monitored volume of social media activity with respect to time during a monitoring window. 17. The method according to claim 14, further including establishing a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored. 18. The method according to claim 17, wherein establishing the communication session includes setting up an interactive voice communication session between the assigned agent and the user. | A contact center is operated, on behalf of an entity, by reference to social media analytics. A user profile, acquired for each of a plurality of social media users, identifies the user and includes at least one of three indications of sentiment derived over time through analysis of social media event activities and/or behavior. The sentiment indications of a profile include user sentiment toward the entity, user sentiment toward one or more competitor(s) of the entity, and/or user sentiment toward a particular product or service offered by the entity or a competitor(s) of the entity. A communication session is established between a communication terminal of a contact center agent and one of the users for whom a user profile is stored. A menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user's profile is displayed to the agent.1. A computer implemented method for managing communications in a contact center, comprising:
monitoring social media activities by a community of users, wherein the community of users includes at least one of
one or more customers of an entity;
one or more customers of a competitor of the entity;
one or more users of a product or service provided by the entity; or
one or more users of a product or service provided by a competitor of the entity;
by a processor, automatically generating and storing a user profile for at least some of the community of users, wherein each generated and stored user profile includes an identity of the user, and at least one of
an indication of the identified user's sentiment toward the entity at one or more points in time;
an indication of the identified user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the identified user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
establishing a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and retrieving and displaying, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 2. The method according to claim 1, wherein the monitored social media activities includes at least one of posts, comments, likes, or tags expressed by users of the community of users via one or more social network channels. 3. The method according to claim 1, wherein the establishing is responsive to a request received by a communication from the first user. 4. The method according to claim 3, wherein the request is submitted by a message posted to a social network page of the entity. 5. The method according to claim 4, wherein the established communication session includes a reply message posted to a social network page of the entity or to a social network page of the first user. 6. The method according to claim 3, wherein the request is for an interactive voice communication session 7. The method according to claim 1, further including identifying, based on the monitoring, at least one shift in at least one of:
sentiment toward or away from the entity; sentiment toward or away from a competitor of the entity; sentiment toward or away from a product or service offered by the entity; or sentiment toward or away from a product or service offered by a competitor of the entity; and correlating, by execution of instructions using a processor, the shift to at least one of a plurality of stored, predefined event windows. 8. The method according to claim 7, wherein each event window corresponds to a product or service launch by the entity or a competitor of the entity, a public announcement by the entity or a competitor of the entity, or launch of a promotional campaign by the entity or a competitor of the entity. 9. The method according to claim 7, further including a step of generating and transmitting an alerting message responsive to identification of a shift. 10. The method according to claim 1, wherein the monitoring comprises:
determining, during at least one monitoring window, a quantity of social media activity events accessible via the internet and identifying both a user of the community of users and at least one of the entity or a competitor of the entity. 11. The method according to claim 10, wherein social media activity events include messages, posts, comments, or tags used for expression of sentiment by users of the community of users. 12. The method according to claim 10, wherein the generating includes
assigning a time varying score to at least one of the entity or the at least one competitor of the entity, based on the volume of social media activity with respect to time during the monitoring window. 13. An apparatus comprising:
a computer having one or more processors, memory and at least one network interface, and further comprising:
a social media activity response module, including instructions executable by the one or more processors and configured to:
monitor social media activities by a community of users, wherein the community of users includes at least one of
one or more customers of an entity;
one or more customers of a competitor of the entity;
one or more user of a product or service provided by the entity; or
one or more user of a product or service provided by a competitor of the entity;
generate and store a user profile for at least some of the community of users, wherein each generated and stored user profile includes an identity of the user, and at least one of
an indication of the identified user's sentiment toward the entity at one or more points in time;
an indication of the identified user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the identified user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
establish a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and
forward, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 14. A computer implemented method for managing communications in a contact center operated on behalf of an entity, comprising:
receiving and storing a user profile for a community of social media users, wherein each respective generated and stored user profile includes
an identity of a corresponding user of the community of social media users, and
an indication of sentiment derived from social media event activities, the indication of sentiment including at least one of
an indication of the corresponding user's sentiment toward the entity at one or more points in time;
an indication of the corresponding user's sentiment toward a competitor of the entity at one or more points in time; or
an indication of the corresponding user's sentiment toward a particular product or service offered by the entity or a competitor of the entity at one or more points in time;
scheduling a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored; and retrieving and displaying, to a display of the communication terminal of the assigned contact center agent, a menu including at least one option for addressing or capitalizing on a change of sentiment reflected in the user profile. 15. The method according to claim 14, wherein social media activity events from which sentiment indications are derived include messages, posts, comments, or tags used for expression of sentiment by users of the community of users. 16. The method according to claim 14, wherein each corresponding user profile includes a time varying score assigned to at least one of the entity or the at least one competitor of the entity, based on a monitored volume of social media activity with respect to time during a monitoring window. 17. The method according to claim 14, further including establishing a communication session between a communication terminal of an assigned contact center agent and a first user for whom a user profile is stored. 18. The method according to claim 17, wherein establishing the communication session includes setting up an interactive voice communication session between the assigned agent and the user. | 2,100 |
5,052 | 14,094,682 | 2,126 | Provided are methods and systems for knowledge discovery utilizing knowledge profiles. | 1. A computer-based method for textual analysis comprising:
storing, by one or more computer processors, a fingerprint for each of a plurality of documents; and combining, by one or more computer processors, fingerprints having a relationship. 2. The method of claim 1, further comprising the step of generating, by one or more computer processors, a fingerprint for at least one of the plurality of documents. 3. The method of claim 1, wherein the fingerprint is a list of concepts and their associated relevance weights. 4. The method of claim 1, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 5. The method of claim 3, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 6. The method of claim 1, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. 7. A system for textual analysis comprising:
a memory configured for storing text data; and a processor, coupled to the memory, configured for performing steps comprising,
storing a fingerprint for each of a plurality of documents; and
combining fingerprints having a relationship. 8. The system of claim 7, wherein the processor is further configured to generate a fingerprint for at least one of the plurality of documents. 9. The system of claim 7, wherein the fingerprint is a list of concepts and their associated relevance weights. 10. The system of claim 7, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 11. The system of claim 9, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 12. The system of claim 7, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. 13. A non-transitory computer-readable storage medium with computer executable instructions embodied thereon for textual analysis comprising:
storing a fingerprint for each of a plurality of documents; and combining fingerprints having a relationship. 14. The computer-readable storage medium of claim 13 further comprising generating a fingerprint for at least one of the plurality of documents. 15. The computer-readable storage medium of claim 13, wherein the fingerprint is a list of concepts and their associated relevance weights. 16. The computer-readable storage medium of claim 13, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 17. The computer-readable storage medium of claim 15, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 18. The computer-readable storage medium of claim 13, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. | Provided are methods and systems for knowledge discovery utilizing knowledge profiles.1. A computer-based method for textual analysis comprising:
storing, by one or more computer processors, a fingerprint for each of a plurality of documents; and combining, by one or more computer processors, fingerprints having a relationship. 2. The method of claim 1, further comprising the step of generating, by one or more computer processors, a fingerprint for at least one of the plurality of documents. 3. The method of claim 1, wherein the fingerprint is a list of concepts and their associated relevance weights. 4. The method of claim 1, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 5. The method of claim 3, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 6. The method of claim 1, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. 7. A system for textual analysis comprising:
a memory configured for storing text data; and a processor, coupled to the memory, configured for performing steps comprising,
storing a fingerprint for each of a plurality of documents; and
combining fingerprints having a relationship. 8. The system of claim 7, wherein the processor is further configured to generate a fingerprint for at least one of the plurality of documents. 9. The system of claim 7, wherein the fingerprint is a list of concepts and their associated relevance weights. 10. The system of claim 7, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 11. The system of claim 9, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 12. The system of claim 7, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. 13. A non-transitory computer-readable storage medium with computer executable instructions embodied thereon for textual analysis comprising:
storing a fingerprint for each of a plurality of documents; and combining fingerprints having a relationship. 14. The computer-readable storage medium of claim 13 further comprising generating a fingerprint for at least one of the plurality of documents. 15. The computer-readable storage medium of claim 13, wherein the fingerprint is a list of concepts and their associated relevance weights. 16. The computer-readable storage medium of claim 13, wherein combining fingerprints having a relationship comprises averaging the fingerprints. 17. The computer-readable storage medium of claim 15, wherein combining fingerprints having a relationship comprises:
taking a square of the associated relevance weights; averaging the squares of the weights, and taking the root of the averages. 18. The computer-readable storage medium of claim 13, wherein the relationship comprises at least one of: stems from the same author, published in the same publication, contains the same concept, or stems from the same organization. | 2,100 |
5,053 | 12,213,471 | 2,191 | The invention relates to a process for creating an automatically distributable software package, as based on a standard software that is supplied to the computer. The process calls for a server that is connected to the computer over a communication network, such as the Internet, and involves the following steps:
automatic transmission to the computer of packaging data stored on the server, on the basis of the standard software designation and at least one installation parameter, and automatic packaging of the standard software into an automatically distributable software package on the computer on the basis of the packaging data transmitted by the server.
For the customer who desires to automatically distribute a standard software to a number of computers in his firm, this process provides a simple and cost-effective means of creating an automatically distributable software package, without the need for scripting know-how. | 1. Process for creating an automatically distributable software package as based on a standard software that is supplied to the computer (3), where a server (1) is connected to the computer (3) over a communication network (2), involving the following steps:
automatic transmission to the computer (1) of packaging data stored on the server (1), as based on the standard software designation and at least one installation parameter, and automatic packaging of the standard software into an automatically distributable software package on the computer (3), as based on the packaging data transmitted by the server (1). 2. Process according to claim 1, wherein
an inquiry dialogue regarding the installation parameter automatically takes place on the computer (3). 3. Process according to claim 1, wherein
an inquiry dialogue automatically takes place on the computer (3) regarding the designation of the standard software. 4. Process according to claim 1, wherein
the designation of the standard software made available to the computer (3) is automatically recorded. 5. Process according to claim 1, wherein
the standard software is provided on the computer (3) itself, ideally on a removable data medium (4). 6. Process according to claim 1, wherein
the standard software is provided online over the communication network (2). 7. Process according to claim 6, wherein
the standard software is provided by the server (1). 8. Process according to claim 1, wherein
the communication network (2) employed is the Internet. 9. Process according to claim 1, wherein
the automatic transmission to the computer (3) of the packaging data stored on the server (1) and/or the automatic packaging of the standard software into an automatically distributable software package on the computer (3) is performed by means of a procedure executed on the computer (3). 10. Process according to claim 9, wherein
the procedure is made available by the server (1) and ideally is transmitted over the communication network (2). 11. Process according to claim 1, wherein
the installation parameter is stored on the server (1). 12. Process according to claim 1, wherein
the automatic packaging of the standard software into an automatically distributable software package is performed in a predetermined format, such that, when a standard software is not present in this predetermined format, an automatic conversion into this format is performed during packaging. | The invention relates to a process for creating an automatically distributable software package, as based on a standard software that is supplied to the computer. The process calls for a server that is connected to the computer over a communication network, such as the Internet, and involves the following steps:
automatic transmission to the computer of packaging data stored on the server, on the basis of the standard software designation and at least one installation parameter, and automatic packaging of the standard software into an automatically distributable software package on the computer on the basis of the packaging data transmitted by the server.
For the customer who desires to automatically distribute a standard software to a number of computers in his firm, this process provides a simple and cost-effective means of creating an automatically distributable software package, without the need for scripting know-how.1. Process for creating an automatically distributable software package as based on a standard software that is supplied to the computer (3), where a server (1) is connected to the computer (3) over a communication network (2), involving the following steps:
automatic transmission to the computer (1) of packaging data stored on the server (1), as based on the standard software designation and at least one installation parameter, and automatic packaging of the standard software into an automatically distributable software package on the computer (3), as based on the packaging data transmitted by the server (1). 2. Process according to claim 1, wherein
an inquiry dialogue regarding the installation parameter automatically takes place on the computer (3). 3. Process according to claim 1, wherein
an inquiry dialogue automatically takes place on the computer (3) regarding the designation of the standard software. 4. Process according to claim 1, wherein
the designation of the standard software made available to the computer (3) is automatically recorded. 5. Process according to claim 1, wherein
the standard software is provided on the computer (3) itself, ideally on a removable data medium (4). 6. Process according to claim 1, wherein
the standard software is provided online over the communication network (2). 7. Process according to claim 6, wherein
the standard software is provided by the server (1). 8. Process according to claim 1, wherein
the communication network (2) employed is the Internet. 9. Process according to claim 1, wherein
the automatic transmission to the computer (3) of the packaging data stored on the server (1) and/or the automatic packaging of the standard software into an automatically distributable software package on the computer (3) is performed by means of a procedure executed on the computer (3). 10. Process according to claim 9, wherein
the procedure is made available by the server (1) and ideally is transmitted over the communication network (2). 11. Process according to claim 1, wherein
the installation parameter is stored on the server (1). 12. Process according to claim 1, wherein
the automatic packaging of the standard software into an automatically distributable software package is performed in a predetermined format, such that, when a standard software is not present in this predetermined format, an automatic conversion into this format is performed during packaging. | 2,100 |
5,054 | 14,813,952 | 2,181 | A trigger operation method of an electronic device is provided. The trigger operation method includes when a trigger jack device is connected to a jack interface, configuring trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information, and recording the trigger execution information in the trigger jack device connected to the jack interface. | 1. A trigger operation method of an electronic device, the method comprising:
when a trigger jack device is connected to a jack interface, configuring trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information; and recording the trigger execution information in the trigger jack device connected to the jack interface. 2. The method of claim 1, wherein the trigger execution information includes at least one of execution instructions for a trigger function, instruction configuration values, and instruction sequence information. 3. The method of claim 1, further comprising:
determining the state of the trigger jack device when the trigger jack device is connected to the jack interface; and when the trigger jack device is in a writing state, configuring the trigger execution information. 4. The method of claim 3, further comprising:
when the trigger jack device is in a reading state, reading the trigger execution information stored in the trigger jack device; and executing a trigger function on the basis of the read trigger execution information. 5. The method of claim 4, further comprising, when a plurality of trigger functions is included in the read trigger execution information, providing selection notification information requesting a selection of at least one of the plurality of trigger functions, through a display unit. 6. The method of claim 4, wherein executing the trigger function comprises:
identifying a type of the electronic device for executing the trigger function; and executing the trigger function with respect to the type of the electronic device. 7. The method of claim 2, wherein the trigger function includes at least one of a function for transmitting files, a function for sharing files, a function for performing a communication connection, and a function for changing a configuration option. 8. The method of claim 1, further comprising:
determining a mode of the trigger jack device; and switching a signal transmission/reception path according to the mode of the trigger jack device. 9. An electronic device comprising:
a communication unit that communicates with at least one external device; a jack interface that includes one or more connection ports, the jack interface for connecting an accessory device; and a controller that detects a connection of a trigger jack device to the jack interface, configures trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information, and records the trigger execution information in the trigger jack device. 10. The electronic device of claim 9, wherein the controller determines the state of the trigger jack device, and when the trigger jack device is in a writing state, configures the trigger execution information. 11. The electronic device of claim 9, wherein the trigger execution information includes at least one of execution instructions for a trigger function, instruction configuration values, and instruction sequence information. 12. The electronic device of claim 10, wherein the controller, when the trigger jack device is in a reading state, reads the trigger execution information stored in the trigger jack device, and executes a trigger function on the basis of the read trigger execution information. 13. The electronic device of claim 12, wherein the controller determines the trigger function on the basis of the read trigger execution information, when a plurality of trigger functions is included in the read trigger execution information, provides selection notification information requesting a selection of at least one of the plurality of trigger functions, through a display unit, and further executes the trigger function according to the user selection input. 14. The electronic device of claim 11, wherein the trigger function includes at least one of a function for transmitting files, a function for sharing files, a function for performing a communication connection, and a function for changing a configuration option. 15. The electronic device of claim 13, wherein the controller identifies a type of the electronic device for executing the trigger function, and further executes the trigger function with respect to the type of device. 16. The electronic device of claim 9, wherein a signal transmission/reception path of the jack interface is switched according to a type of the accessory device connected to the jack interface. 17. A trigger jack accessory device comprising:
a jack plug that is inserted into a jack interface of an electronic device and includes one or more connection ports for transmitting/receiving signals; and a memory that stores signals and data, which are transferred through the one or more connection ports of the jack plug. 18. The trigger jack accessory device of claim 17, wherein the memory, according to a request of the electronic device,
stores trigger execution information transferred from the electronic device, and transfers the stored trigger execution information to the electronic device. | A trigger operation method of an electronic device is provided. The trigger operation method includes when a trigger jack device is connected to a jack interface, configuring trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information, and recording the trigger execution information in the trigger jack device connected to the jack interface.1. A trigger operation method of an electronic device, the method comprising:
when a trigger jack device is connected to a jack interface, configuring trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information; and recording the trigger execution information in the trigger jack device connected to the jack interface. 2. The method of claim 1, wherein the trigger execution information includes at least one of execution instructions for a trigger function, instruction configuration values, and instruction sequence information. 3. The method of claim 1, further comprising:
determining the state of the trigger jack device when the trigger jack device is connected to the jack interface; and when the trigger jack device is in a writing state, configuring the trigger execution information. 4. The method of claim 3, further comprising:
when the trigger jack device is in a reading state, reading the trigger execution information stored in the trigger jack device; and executing a trigger function on the basis of the read trigger execution information. 5. The method of claim 4, further comprising, when a plurality of trigger functions is included in the read trigger execution information, providing selection notification information requesting a selection of at least one of the plurality of trigger functions, through a display unit. 6. The method of claim 4, wherein executing the trigger function comprises:
identifying a type of the electronic device for executing the trigger function; and executing the trigger function with respect to the type of the electronic device. 7. The method of claim 2, wherein the trigger function includes at least one of a function for transmitting files, a function for sharing files, a function for performing a communication connection, and a function for changing a configuration option. 8. The method of claim 1, further comprising:
determining a mode of the trigger jack device; and switching a signal transmission/reception path according to the mode of the trigger jack device. 9. An electronic device comprising:
a communication unit that communicates with at least one external device; a jack interface that includes one or more connection ports, the jack interface for connecting an accessory device; and a controller that detects a connection of a trigger jack device to the jack interface, configures trigger execution information on the basis of at least one of sharing configuration information related to a task in progress, configuration change information, and communication connection configuration information, and records the trigger execution information in the trigger jack device. 10. The electronic device of claim 9, wherein the controller determines the state of the trigger jack device, and when the trigger jack device is in a writing state, configures the trigger execution information. 11. The electronic device of claim 9, wherein the trigger execution information includes at least one of execution instructions for a trigger function, instruction configuration values, and instruction sequence information. 12. The electronic device of claim 10, wherein the controller, when the trigger jack device is in a reading state, reads the trigger execution information stored in the trigger jack device, and executes a trigger function on the basis of the read trigger execution information. 13. The electronic device of claim 12, wherein the controller determines the trigger function on the basis of the read trigger execution information, when a plurality of trigger functions is included in the read trigger execution information, provides selection notification information requesting a selection of at least one of the plurality of trigger functions, through a display unit, and further executes the trigger function according to the user selection input. 14. The electronic device of claim 11, wherein the trigger function includes at least one of a function for transmitting files, a function for sharing files, a function for performing a communication connection, and a function for changing a configuration option. 15. The electronic device of claim 13, wherein the controller identifies a type of the electronic device for executing the trigger function, and further executes the trigger function with respect to the type of device. 16. The electronic device of claim 9, wherein a signal transmission/reception path of the jack interface is switched according to a type of the accessory device connected to the jack interface. 17. A trigger jack accessory device comprising:
a jack plug that is inserted into a jack interface of an electronic device and includes one or more connection ports for transmitting/receiving signals; and a memory that stores signals and data, which are transferred through the one or more connection ports of the jack plug. 18. The trigger jack accessory device of claim 17, wherein the memory, according to a request of the electronic device,
stores trigger execution information transferred from the electronic device, and transfers the stored trigger execution information to the electronic device. | 2,100 |
5,055 | 14,817,717 | 2,186 | A method and apparatus for managing power used by a computer system. User input relating to the power for a group of objects is received. A system description is sent to a user when the user input requests the system description for the group of the objects. The system description describes the group of the objects in the computer system with a level of detail based on a role of the user. Attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes or control attributes. A group of the control attributes for the group of the objects is set to control the power used by the group of the objects using application programming interfaces to the group of objects when the user input requests changes to the power used by the group of the objects. | 1. An apparatus comprising:
a power manager that that receives a user input relating to power for a group of objects; sends a system description to a user when the user input requests the system description for the group of the objects in which the system description describes the group of the objects in a computer system with a level of detail based on a role of the user, and in which attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and sets a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces when the user input requests changes to the power used by the group of the objects. 2. The apparatus of claim 1, wherein the power manager returns the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 3. The apparatus of claim 1, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 4. The apparatus of claim 1, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 5. The apparatus of claim 1, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that are being managed by the user. 6. The apparatus of claim 3, wherein the power manager identifies the hierarchy of the objects in the computer system and adds the hierarchy to the system description. 7. The apparatus of claim 6, wherein the power manager identifies the role of the user and generates the system description based on the role. 8. The apparatus of claim 7, wherein the hierarchy contains levels for the objects, and wherein in identifying the system description based on the role, the power manager removes at least one of all of the objects in a level in the hierarchy, or an object in the group of the objects based on the role of the user. 9. The apparatus of claim 1 further comprising:
a monitor that monitors for a change in the power used by the group of the objects and sends a message to the user when the change in the power used is detected, wherein the message describes the change. 10. The apparatus of claim 9, wherein the monitor determines whether the power used by the group of the objects meets a desired amount, and wherein in sending the message describing the change to the user, the monitor sends the message to the user when the power used meets the desired amount. 11. The apparatus of claim 1, wherein the computer system is a group of computers in a location. 12. The apparatus of claim 1, wherein the user is selected from one of a human user and an application. 13. A method for managing power used by a computer system, the method comprising:
receiving a user input relating to the power for a group of objects; sending a system description to a user when the user input requests the system description for the group of the objects, wherein the system description describes the group of the objects in the computer system with a level of detail based on a role of the user, wherein attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and setting a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces to the group of objects when the user input requests changes to the power used by the group of the objects. 14. The method of claim 13 further comprising:
returning the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 15. The method of claim 13, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 16. The method of claim 13, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 17. The method of claim 13, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that is being managed by the user. 18. The method of claim 15 further comprising:
identifying the hierarchy of the objects in the computer system; and
adding the hierarchy to the system description. 19. The method of claim 18 further comprising:
identifying the role of the user; and
generating the system description based on the role. 20. The method of claim 13 further comprising:
monitoring for a change in the power used by the group of the objects; and
sending a message to the user when the change in the power used is detected, wherein the message describes the change in the power used. 21. The method of claim 20, wherein a monitor determines whether the power used by the group of the objects meets a desired amount, and wherein in sending the message describing the change to the user, the monitor sends the message to the user when the power used meets the desired amount. 22. A computer program product for managing power used by a computer system, the computer program product comprising:
a computer readable storage media; first program code, stored on the computer readable storage media, for receiving a user input relating to the power for a group of objects; second program code, stored on the computer readable storage media, for sending a system description to a user when the user input requests the system description for the group of the objects, wherein the system description describes the group of the objects in the computer system with a level of detail based on a role of the user, wherein attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and third program code, stored on the computer readable storage media, for setting a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces to the group of the objects when the user input requests changes to the power used by the group of the objects. 23. The computer program product of claim 22 further comprising:
fourth program code, stored on the computer readable storage media, for returning the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 24. The computer program product of claim 22, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 25. The computer program product of claim 22, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 26. The computer program product of claim 22, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that is being managed by the user. 27. The computer program product of claim 24 further comprising:
fourth program code, stored on the computer readable storage media, for identifying the hierarchy of the objects in the computing system; and
fifth program code, stored on the computer readable storage media, for adding the hierarchy to the system description. 28. The computer program product of claim 27 further comprising:
sixth program code, stored on the computer readable storage media, for identifying the role of the user; and
seventh program code, stored on the computer readable storage media, for generating the system description based on the role. | A method and apparatus for managing power used by a computer system. User input relating to the power for a group of objects is received. A system description is sent to a user when the user input requests the system description for the group of the objects. The system description describes the group of the objects in the computer system with a level of detail based on a role of the user. Attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes or control attributes. A group of the control attributes for the group of the objects is set to control the power used by the group of the objects using application programming interfaces to the group of objects when the user input requests changes to the power used by the group of the objects.1. An apparatus comprising:
a power manager that that receives a user input relating to power for a group of objects; sends a system description to a user when the user input requests the system description for the group of the objects in which the system description describes the group of the objects in a computer system with a level of detail based on a role of the user, and in which attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and sets a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces when the user input requests changes to the power used by the group of the objects. 2. The apparatus of claim 1, wherein the power manager returns the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 3. The apparatus of claim 1, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 4. The apparatus of claim 1, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 5. The apparatus of claim 1, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that are being managed by the user. 6. The apparatus of claim 3, wherein the power manager identifies the hierarchy of the objects in the computer system and adds the hierarchy to the system description. 7. The apparatus of claim 6, wherein the power manager identifies the role of the user and generates the system description based on the role. 8. The apparatus of claim 7, wherein the hierarchy contains levels for the objects, and wherein in identifying the system description based on the role, the power manager removes at least one of all of the objects in a level in the hierarchy, or an object in the group of the objects based on the role of the user. 9. The apparatus of claim 1 further comprising:
a monitor that monitors for a change in the power used by the group of the objects and sends a message to the user when the change in the power used is detected, wherein the message describes the change. 10. The apparatus of claim 9, wherein the monitor determines whether the power used by the group of the objects meets a desired amount, and wherein in sending the message describing the change to the user, the monitor sends the message to the user when the power used meets the desired amount. 11. The apparatus of claim 1, wherein the computer system is a group of computers in a location. 12. The apparatus of claim 1, wherein the user is selected from one of a human user and an application. 13. A method for managing power used by a computer system, the method comprising:
receiving a user input relating to the power for a group of objects; sending a system description to a user when the user input requests the system description for the group of the objects, wherein the system description describes the group of the objects in the computer system with a level of detail based on a role of the user, wherein attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and setting a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces to the group of objects when the user input requests changes to the power used by the group of the objects. 14. The method of claim 13 further comprising:
returning the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 15. The method of claim 13, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 16. The method of claim 13, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 17. The method of claim 13, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that is being managed by the user. 18. The method of claim 15 further comprising:
identifying the hierarchy of the objects in the computer system; and
adding the hierarchy to the system description. 19. The method of claim 18 further comprising:
identifying the role of the user; and
generating the system description based on the role. 20. The method of claim 13 further comprising:
monitoring for a change in the power used by the group of the objects; and
sending a message to the user when the change in the power used is detected, wherein the message describes the change in the power used. 21. The method of claim 20, wherein a monitor determines whether the power used by the group of the objects meets a desired amount, and wherein in sending the message describing the change to the user, the monitor sends the message to the user when the power used meets the desired amount. 22. A computer program product for managing power used by a computer system, the computer program product comprising:
a computer readable storage media; first program code, stored on the computer readable storage media, for receiving a user input relating to the power for a group of objects; second program code, stored on the computer readable storage media, for sending a system description to a user when the user input requests the system description for the group of the objects, wherein the system description describes the group of the objects in the computer system with a level of detail based on a role of the user, wherein attributes are associated with the objects and the attributes for the objects are selected by at least one of measurement attributes that have information about the power used by the objects or control attributes that control the power used by the objects; and third program code, stored on the computer readable storage media, for setting a group of the control attributes for the group of the objects to control the power used by the group of the objects using application programming interfaces to the group of the objects when the user input requests changes to the power used by the group of the objects. 23. The computer program product of claim 22 further comprising:
fourth program code, stored on the computer readable storage media, for returning the information about the power used by the group of the objects when the user input requests the information for a group of the measurement attributes for the group of the objects. 24. The computer program product of claim 22, wherein the objects in the computer system are arranged in a hierarchy and a portion of the attributes enable navigation through the hierarchy of the objects. 25. The computer program product of claim 22, wherein an object in the objects is selected from one of a computer, a processor, a processor core, a graphics processor, a graphics adapter, a display device, a bus, a port, and a storage device. 26. The computer program product of claim 22, wherein the user input requesting the system description for the group of the objects is for at least one of all of the objects in the computer system or the objects at a location that is being managed by the user. 27. The computer program product of claim 24 further comprising:
fourth program code, stored on the computer readable storage media, for identifying the hierarchy of the objects in the computing system; and
fifth program code, stored on the computer readable storage media, for adding the hierarchy to the system description. 28. The computer program product of claim 27 further comprising:
sixth program code, stored on the computer readable storage media, for identifying the role of the user; and
seventh program code, stored on the computer readable storage media, for generating the system description based on the role. | 2,100 |
5,056 | 11,618,162 | 2,156 | Embodiments of the present invention address deficiencies of the art in respect to relationship-based information management and provide a novel and non-obvious method, system and computer program product for context browser based navigation of pivotally related information for a document. In one embodiment of the invention a context browser-based information management data processing system can be configured for navigation of pivotally related information for a document. The system can include an activity-centric collaboration tool configured for managing activity objects in an activity-centric collaborative computing environment. The system further can include a relationship model for selected ones of the activity objects, the model defining direct relationships between individual ones of the activity objects. Additionally, the system can include a relationship browser. | 1. A context browser-based information management data processing system configured for navigation of pivotally related information for a document, the system comprising:
an activity-centric collaboration tool configured for managing a plurality of activity objects in an activity-centric collaborative computing environment; a relationship model for selected ones of the activity objects, the model defining direct relationships between individual ones of the activity objects; a relationship browser comprising program code enabled to query the relationship model with a pivot activity object to identify a set of related activity objects for the pivot activity object; and, a context browser configured to concurrently display the content of the pivot activity object and a listing of the set of related activity objects. 2. The system of claim 1, wherein the context browser is further configured to concurrently highlight a portion of the set of related activity objects related according to the relationship model to a selected one of the set of related activity objects. 3. The system of claim 1, wherein each related activity object in the listing is activatable such that an activation of any of the related activity objects results in a display of the content of the activated one of the related activity objects in the context browser. 4. The system of claim 3, wherein the context browser is further configured to highlight a most recently activated one of the related activity objects in the listing. 5. The system of claim 1, wherein the context browser further comprises a graphical view of at least a portion of the relationship model. 6. The system of claim 1, wherein the context browser further comprises a summary view for displaying summary content for a selected one of the related activity objects in the listing. 7. The system of claim 1, wherein the context browser further comprises a properties view for displaying properties for a selected one of the related activity objects in the listing. 8. A method for context browser based navigation of pivotally related information for a document, the method comprising:
pivoting a query on a relationship model of related activity objects for a specified activity object to identify a set of related activity objects for the specified activity object; and, concurrently displaying in the context browser, content for the specified activity object adjacent to a listing of the set of related activity objects. 9. The method of claim 8, further comprising:
selecting one activity object in the listing; pivoting a new query on the relationship model for the selected one activity object to identify a set of related activity objects for the selected one activity object; identifying common activity objects in the listing and the identified set of related activity objects for the selected one activity object; and, highlighting common activity objects in the listing. 10. The method of claim 8, further comprising:
activating one activity object in the listing; pivoting a new query on the relationship model for the activated one activity object to identify a set of related activity objects for the activated one activity object; and, replacing the content for the specified activity object in the context browser with content for the activated one activity object while replacing activity objects in the listing with the identified set of related activity objects for the activated one activity object. 11. The method of claim 8, further comprising:
generating a summary of a selected one of the activity objects in the listing; and, concurrently displaying the summary in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 12. The method of claim 8, further comprising
generating a graphical view of the relationship model; and, concurrently displaying the graphical view of the relationship model in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 13. A computer program product comprising a computer usable medium having computer usable program code for context browser based navigation of pivotally related information for a document, the computer program product including:
computer usable program code for pivoting a query on a relationship model of related activity objects for a specified activity object to identify a set of related activity objects for the specified activity object; and, computer usable program code for concurrently displaying in the context browser, content for the specified activity object adjacent to a listing of the set of related activity objects. 14. The computer program product of claim 13, further comprising:
computer usable program code for selecting one activity object in the listing; computer usable program code for pivoting a new query on the relationship model for the selected one activity object to identify a set of related activity objects for the selected one activity object; computer usable program code for identifying common activity objects in the listing and the identified set of related activity objects for the selected one activity object; and, computer usable program code for highlighting common activity objects in the listing. 15. The computer program product of claim 13, further comprising:
computer usable program code for activating one activity object in the listing; computer usable program code for pivoting a new query on the relationship model for the activated one activity object to identify a set of related activity objects for the activated one activity object; and, computer usable program code for replacing the content for the specified activity object in the context browser with content for the activated one activity object while replacing activity objects in the listing with the identified set of related activity objects for the activated one activity object. 16. The computer program product of claim 13, further comprising:
computer usable program code for generating a summary of a selected one of the activity objects in the listing; and, computer usable program code for concurrently displaying the summary in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 17. The computer program product of claim 13, further comprising
computer usable program code for generating a graphical view of the relationship model; and, computer usable program code for concurrently displaying the graphical view of the relationship model in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. | Embodiments of the present invention address deficiencies of the art in respect to relationship-based information management and provide a novel and non-obvious method, system and computer program product for context browser based navigation of pivotally related information for a document. In one embodiment of the invention a context browser-based information management data processing system can be configured for navigation of pivotally related information for a document. The system can include an activity-centric collaboration tool configured for managing activity objects in an activity-centric collaborative computing environment. The system further can include a relationship model for selected ones of the activity objects, the model defining direct relationships between individual ones of the activity objects. Additionally, the system can include a relationship browser.1. A context browser-based information management data processing system configured for navigation of pivotally related information for a document, the system comprising:
an activity-centric collaboration tool configured for managing a plurality of activity objects in an activity-centric collaborative computing environment; a relationship model for selected ones of the activity objects, the model defining direct relationships between individual ones of the activity objects; a relationship browser comprising program code enabled to query the relationship model with a pivot activity object to identify a set of related activity objects for the pivot activity object; and, a context browser configured to concurrently display the content of the pivot activity object and a listing of the set of related activity objects. 2. The system of claim 1, wherein the context browser is further configured to concurrently highlight a portion of the set of related activity objects related according to the relationship model to a selected one of the set of related activity objects. 3. The system of claim 1, wherein each related activity object in the listing is activatable such that an activation of any of the related activity objects results in a display of the content of the activated one of the related activity objects in the context browser. 4. The system of claim 3, wherein the context browser is further configured to highlight a most recently activated one of the related activity objects in the listing. 5. The system of claim 1, wherein the context browser further comprises a graphical view of at least a portion of the relationship model. 6. The system of claim 1, wherein the context browser further comprises a summary view for displaying summary content for a selected one of the related activity objects in the listing. 7. The system of claim 1, wherein the context browser further comprises a properties view for displaying properties for a selected one of the related activity objects in the listing. 8. A method for context browser based navigation of pivotally related information for a document, the method comprising:
pivoting a query on a relationship model of related activity objects for a specified activity object to identify a set of related activity objects for the specified activity object; and, concurrently displaying in the context browser, content for the specified activity object adjacent to a listing of the set of related activity objects. 9. The method of claim 8, further comprising:
selecting one activity object in the listing; pivoting a new query on the relationship model for the selected one activity object to identify a set of related activity objects for the selected one activity object; identifying common activity objects in the listing and the identified set of related activity objects for the selected one activity object; and, highlighting common activity objects in the listing. 10. The method of claim 8, further comprising:
activating one activity object in the listing; pivoting a new query on the relationship model for the activated one activity object to identify a set of related activity objects for the activated one activity object; and, replacing the content for the specified activity object in the context browser with content for the activated one activity object while replacing activity objects in the listing with the identified set of related activity objects for the activated one activity object. 11. The method of claim 8, further comprising:
generating a summary of a selected one of the activity objects in the listing; and, concurrently displaying the summary in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 12. The method of claim 8, further comprising
generating a graphical view of the relationship model; and, concurrently displaying the graphical view of the relationship model in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 13. A computer program product comprising a computer usable medium having computer usable program code for context browser based navigation of pivotally related information for a document, the computer program product including:
computer usable program code for pivoting a query on a relationship model of related activity objects for a specified activity object to identify a set of related activity objects for the specified activity object; and, computer usable program code for concurrently displaying in the context browser, content for the specified activity object adjacent to a listing of the set of related activity objects. 14. The computer program product of claim 13, further comprising:
computer usable program code for selecting one activity object in the listing; computer usable program code for pivoting a new query on the relationship model for the selected one activity object to identify a set of related activity objects for the selected one activity object; computer usable program code for identifying common activity objects in the listing and the identified set of related activity objects for the selected one activity object; and, computer usable program code for highlighting common activity objects in the listing. 15. The computer program product of claim 13, further comprising:
computer usable program code for activating one activity object in the listing; computer usable program code for pivoting a new query on the relationship model for the activated one activity object to identify a set of related activity objects for the activated one activity object; and, computer usable program code for replacing the content for the specified activity object in the context browser with content for the activated one activity object while replacing activity objects in the listing with the identified set of related activity objects for the activated one activity object. 16. The computer program product of claim 13, further comprising:
computer usable program code for generating a summary of a selected one of the activity objects in the listing; and, computer usable program code for concurrently displaying the summary in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. 17. The computer program product of claim 13, further comprising
computer usable program code for generating a graphical view of the relationship model; and, computer usable program code for concurrently displaying the graphical view of the relationship model in the context browser along with the content for the specified activity and the adjacent listing of the set of related activity objects. | 2,100 |
5,057 | 12,418,698 | 2,145 | The invention relates to a method for controlling a medical apparatus, wherein: patient image data is generated using an image-generating medical apparatus; a patient image is produced on the basis of this data and displayed on an image output unit; and a medical apparatus is in turn controlled by an interaction with the image. | 1. A method for controlling a medical apparatus, wherein: patient image data is generated using an image-generating medical apparatus; a patient image is produced on the basis of this data and displayed on an image output unit; and a medical apparatus is in turn controlled by an interaction with the image. 2. The method according to claim 1, wherein the medical apparatus is an image-generating apparatus or the image-generating apparatus. 3. The method according to claim 1, wherein the apparatuses are controlled by interaction at the image output unit. 4. The method according to claim 3, wherein the interaction is achieved using touch inputs, multi-touch inputs or gesture inputs/recognition. 5. The method according to claim 1, wherein the apparatuses are controlled by vision detection and/or eye movement detection. 6. The method according to claim 5, wherein the image output unit is switched on or off depending on whether and how a viewer is looking at the patient image, and/or the image is changed at the point being viewed. 7. The method according to claim 1, wherein the apparatuses are controlled by manipulating the image. 8. The method according to claim 7, wherein the image is manipulated by increasing/decreasing it in size, rotating it or shifting the viewing plane. 9. The method according to claim 1, wherein new image data is generated using the apparatus control. 10. The method according to claim 1, wherein new image data is retrieved from a memory using the apparatus control. 11. The method according to claim 1, wherein image data is altered using the apparatus control. 12. The method according to claim 1, wherein an image recording parameter is altered at the image-generating apparatus using the apparatus control. 13. The method according to claim 12, wherein one or more of the following manipulations is/are performed:
changing the position of the apparatus or of its image detection element; changing the image detection resolution; changing the image detection angle; changing or shifting the image detection range; changing contrast or brightness settings; changing the penetration depth; changing the layer detection depth. 14. The method according to claim 1, wherein one or more of the following actions is/are performed within the framework of image-based apparatus control:
the image recording characteristics of an endoscope are altered; reconstructed images obtained from imaging data sets (CT, MR) are added to or superimposed onto the patient image, or the patient image is at least partially replaced with them; the image recording parameters of a medical imaging apparatus (CT, MR, PET, etc.) are altered, and a new image is detected using the changed parameters; the sound penetration parameters or position of an ultrasound probe are altered; the image recording characteristics of a microscope are altered; image-enhancing substances are administered to the patient; ECG or pacemaker parameters are altered; the room lighting or operation light is altered; by manipulating its image, an instrument which appears in the image and can be automatically manipulated is correspondingly manipulated in reality; the radiation parameters and/or image recording characteristics of a LINAC are altered; areas marked in the image are localized. 15. The method according to claim 14, wherein the image-enhancing substances are contrast agents. 16. The method according to claim 14, wherein the room lighting or operation light is concentrated on a location displayed on the patient image. 17. The method according to claim 14, wherein manipulating the instrument or its image means shifting the instrument or its image. 18. The method according to claim 14, wherein the localized areas are then projected onto the patient. 19. The method according to claim 1, wherein the new or altered image data is used to renew, alter or supplement the patient image on the image output unit. 20. A program which, when it is running on a computer or is loaded onto a computer, causes the computer to perform a method in accordance with claim 1. 21. A computer program storage medium which comprises a program according to claim 20. | The invention relates to a method for controlling a medical apparatus, wherein: patient image data is generated using an image-generating medical apparatus; a patient image is produced on the basis of this data and displayed on an image output unit; and a medical apparatus is in turn controlled by an interaction with the image.1. A method for controlling a medical apparatus, wherein: patient image data is generated using an image-generating medical apparatus; a patient image is produced on the basis of this data and displayed on an image output unit; and a medical apparatus is in turn controlled by an interaction with the image. 2. The method according to claim 1, wherein the medical apparatus is an image-generating apparatus or the image-generating apparatus. 3. The method according to claim 1, wherein the apparatuses are controlled by interaction at the image output unit. 4. The method according to claim 3, wherein the interaction is achieved using touch inputs, multi-touch inputs or gesture inputs/recognition. 5. The method according to claim 1, wherein the apparatuses are controlled by vision detection and/or eye movement detection. 6. The method according to claim 5, wherein the image output unit is switched on or off depending on whether and how a viewer is looking at the patient image, and/or the image is changed at the point being viewed. 7. The method according to claim 1, wherein the apparatuses are controlled by manipulating the image. 8. The method according to claim 7, wherein the image is manipulated by increasing/decreasing it in size, rotating it or shifting the viewing plane. 9. The method according to claim 1, wherein new image data is generated using the apparatus control. 10. The method according to claim 1, wherein new image data is retrieved from a memory using the apparatus control. 11. The method according to claim 1, wherein image data is altered using the apparatus control. 12. The method according to claim 1, wherein an image recording parameter is altered at the image-generating apparatus using the apparatus control. 13. The method according to claim 12, wherein one or more of the following manipulations is/are performed:
changing the position of the apparatus or of its image detection element; changing the image detection resolution; changing the image detection angle; changing or shifting the image detection range; changing contrast or brightness settings; changing the penetration depth; changing the layer detection depth. 14. The method according to claim 1, wherein one or more of the following actions is/are performed within the framework of image-based apparatus control:
the image recording characteristics of an endoscope are altered; reconstructed images obtained from imaging data sets (CT, MR) are added to or superimposed onto the patient image, or the patient image is at least partially replaced with them; the image recording parameters of a medical imaging apparatus (CT, MR, PET, etc.) are altered, and a new image is detected using the changed parameters; the sound penetration parameters or position of an ultrasound probe are altered; the image recording characteristics of a microscope are altered; image-enhancing substances are administered to the patient; ECG or pacemaker parameters are altered; the room lighting or operation light is altered; by manipulating its image, an instrument which appears in the image and can be automatically manipulated is correspondingly manipulated in reality; the radiation parameters and/or image recording characteristics of a LINAC are altered; areas marked in the image are localized. 15. The method according to claim 14, wherein the image-enhancing substances are contrast agents. 16. The method according to claim 14, wherein the room lighting or operation light is concentrated on a location displayed on the patient image. 17. The method according to claim 14, wherein manipulating the instrument or its image means shifting the instrument or its image. 18. The method according to claim 14, wherein the localized areas are then projected onto the patient. 19. The method according to claim 1, wherein the new or altered image data is used to renew, alter or supplement the patient image on the image output unit. 20. A program which, when it is running on a computer or is loaded onto a computer, causes the computer to perform a method in accordance with claim 1. 21. A computer program storage medium which comprises a program according to claim 20. | 2,100 |
5,058 | 15,270,729 | 2,162 | In one embodiment, a method includes receiving, at the client system, an input of a search query, sending, to a search engine, the search query and a first location associated with the search query, receiving, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density, and providing, at the client system responsive to the search query, a search-results interface for display comprising at least the portion of the first tile and a threshold number of the search results referencing objects matching the search query having a location within the first tile. | 1. A method comprising, by a client system of a first user:
receiving, at the client system, an input of a search query by the first user; sending, to a search engine, the search query and a first location associated with the search query; receiving, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and providing, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. 2. The method of claim 1, wherein the map comprises a plurality of tiles representing a plurality of geographic areas, respectively, wherein each tile comprises a plurality of objects having locations within the tile, and wherein each tile has below a threshold number of objects located within the tile. 3. The method of claim 1, wherein the plurality of tiles comprises tiles of a plurality of sizes. 4. The method of claim 1, further comprising:
generating, by the search engine, the plurality of tiles by:
accessing the map;
generating a first set of tiles at a first level, wherein each tile of the first set of tiles has a first number of objects having locations within the tile; and
for each tile in the first set of tiles having a number of objects greater than or equal to the threshold number of objects, generating a second set of tiles at a second level within the tile. 5. The method of claim 1, further comprising
generating, by the search engine, the plurality of tiles by:
accessing the map, wherein the map comprises N levels of tiles; and
for each level m of levels 1 to N−1:
for each tile in level m:
calculating the number of objects located within the tile; and
if the number of objects is greater than or equal to the threshold number of objects, then generating a set of tiles at level m+1 with the tile. 6. The method of claim 1, further comprising:
identifying, by the search engine, one or more objects corresponding to the first query, each identified object having a location within the first tile. 7. The method of claim 6, wherein identifying one or more objects corresponding to the first query comprises:
calculating a distance for each object from the first location; identifying one or more object having a distance less than a threshold distance from the first location. 8. The method of claim 6, further comprising:
ranking the identified objects; and wherein the search-results interface comprises references to one or more of the identified objects having a raking greater than a threshold ranking. 9. The method of claim 1, wherein the map comprises N levels of tiles organized in a tree-data structure having a root node corresponding to the map and a plurality of child nodes corresponding to the tiles. 10. The method of claim 1, wherein the first location is received from a geographic-position component of the client system. 11. The method of claim 1, wherein the first location is based on one or more of a global position system (GPS) signal, a Wi-Fi signal, or a cellular radio signal. 12. The method of claim 1, wherein the first location is based on a search history associated with the first user. 13. The method of claim 1, further comprising:
accessing, by the search engine, a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user, the first user being associated with an online social network; and
a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively, each second node being associated with a second location. 14. The method of claim 13, wherein the search-results interface comprises references to one or more of the objects corresponding to one or more second nodes, respectively, having a degree of separation from the first node less than a threshold degree of separation. 15. The method of claim 1, wherein the search-results interface further comprises one or more neighboring tiles of the first tile, and wherein the displayed portion of each neighboring tile comprises one or more search results referencing objects matching the search query having a location within the respective neighboring tile. 16. One or more computer-readable non-transitory storage media embodying software that is operable when executed by a client system to:
receive, at the client system, an input of a search query by the first user; send, to a search engine, the search query and a first location associated with the search query; receive, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and provide, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. 17. A client system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive, at the client system, an input of a search query by the first user; send, to a search engine, the search query and a first location associated with the search query; receive, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and provide, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. | In one embodiment, a method includes receiving, at the client system, an input of a search query, sending, to a search engine, the search query and a first location associated with the search query, receiving, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density, and providing, at the client system responsive to the search query, a search-results interface for display comprising at least the portion of the first tile and a threshold number of the search results referencing objects matching the search query having a location within the first tile.1. A method comprising, by a client system of a first user:
receiving, at the client system, an input of a search query by the first user; sending, to a search engine, the search query and a first location associated with the search query; receiving, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and providing, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. 2. The method of claim 1, wherein the map comprises a plurality of tiles representing a plurality of geographic areas, respectively, wherein each tile comprises a plurality of objects having locations within the tile, and wherein each tile has below a threshold number of objects located within the tile. 3. The method of claim 1, wherein the plurality of tiles comprises tiles of a plurality of sizes. 4. The method of claim 1, further comprising:
generating, by the search engine, the plurality of tiles by:
accessing the map;
generating a first set of tiles at a first level, wherein each tile of the first set of tiles has a first number of objects having locations within the tile; and
for each tile in the first set of tiles having a number of objects greater than or equal to the threshold number of objects, generating a second set of tiles at a second level within the tile. 5. The method of claim 1, further comprising
generating, by the search engine, the plurality of tiles by:
accessing the map, wherein the map comprises N levels of tiles; and
for each level m of levels 1 to N−1:
for each tile in level m:
calculating the number of objects located within the tile; and
if the number of objects is greater than or equal to the threshold number of objects, then generating a set of tiles at level m+1 with the tile. 6. The method of claim 1, further comprising:
identifying, by the search engine, one or more objects corresponding to the first query, each identified object having a location within the first tile. 7. The method of claim 6, wherein identifying one or more objects corresponding to the first query comprises:
calculating a distance for each object from the first location; identifying one or more object having a distance less than a threshold distance from the first location. 8. The method of claim 6, further comprising:
ranking the identified objects; and wherein the search-results interface comprises references to one or more of the identified objects having a raking greater than a threshold ranking. 9. The method of claim 1, wherein the map comprises N levels of tiles organized in a tree-data structure having a root node corresponding to the map and a plurality of child nodes corresponding to the tiles. 10. The method of claim 1, wherein the first location is received from a geographic-position component of the client system. 11. The method of claim 1, wherein the first location is based on one or more of a global position system (GPS) signal, a Wi-Fi signal, or a cellular radio signal. 12. The method of claim 1, wherein the first location is based on a search history associated with the first user. 13. The method of claim 1, further comprising:
accessing, by the search engine, a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user, the first user being associated with an online social network; and
a plurality of second nodes corresponding to a plurality of objects associated with the online social network, respectively, each second node being associated with a second location. 14. The method of claim 13, wherein the search-results interface comprises references to one or more of the objects corresponding to one or more second nodes, respectively, having a degree of separation from the first node less than a threshold degree of separation. 15. The method of claim 1, wherein the search-results interface further comprises one or more neighboring tiles of the first tile, and wherein the displayed portion of each neighboring tile comprises one or more search results referencing objects matching the search query having a location within the respective neighboring tile. 16. One or more computer-readable non-transitory storage media embodying software that is operable when executed by a client system to:
receive, at the client system, an input of a search query by the first user; send, to a search engine, the search query and a first location associated with the search query; receive, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and provide, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. 17. A client system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive, at the client system, an input of a search query by the first user; send, to a search engine, the search query and a first location associated with the search query; receive, from the search engine, search results comprising references to a plurality of objects matching the search query, wherein the search results further comprise at least a portion of a first tile of a map comprising a plurality of tiles, the first location being within the first tile, wherein the map is divided into the plurality of tiles such that each tile has an approximately constant object density; and provide, at the client system responsive to the search query, a search-results interface for display, wherein the search-results interface comprises at least the portion of the first tile, and wherein the displayed portion of the first tile comprises a first threshold number of the search results referencing objects matching the search query having a location within the first tile. | 2,100 |
5,059 | 13,269,634 | 2,158 | A process may utilize multiple garbage collector threads, each having the capability to steal partially-marked object references from an accessible mark stack having additional work that has yet to be processed. A partially-marked object reference may be represented as a pair of entries on a mark stack. A garbage collector thread may utilize an atomic operation to access the pair of entries in a prescribed manner to steal an unprocessed partially-marked object reference. In this manner, the workload of an overloaded garbage collector thread is offloaded to another garbage collector thread that may be idle thereby balancing the workload more evenly among multiple garbage collector threads. | 1. A computer-implemented method, comprising:
storing onto a mark stack, by a first garbage collector thread, a partially-marked object reference having a parent object reference and a child object reference, the mark stack accessible by multiple garbage collector threads concurrently; searching the mark stack, by a second garbage collector thread, for a partially-marked object reference, the first garbage collector thread different from the second garbage collector thread; and stealing from the mark stack, by the second garbage collector thread, the partially-marked object reference by replacing the child object reference with a stolen value. 2. The computer-implemented method of claim 1, further comprising:
marking, by the second garbage collector thread, objects referenced by the child object reference. 3. The computer-implemented method of claim 1, the searching step further comprising:
reading the mark stack for a first entry having a parent object reference; reading the mark stack for a second entry having a child object reference; and determining that the first entry and the second entry form a partially-marked object reference. 4. The computer-implemented method of claim 3, further comprising:
atomically replacing the second entry with a stolen value if the child object reference has not been stolen. 5. The computer-implemented method of claim 1, further comprising:
reading the mark stack for a first entry having a parent object reference; reading the mark stack for a second entry having a child object reference; and determining that the first and second entry form a partially-marked object reference when the child object reference is contained within an address range encompassed by the parent object reference. 6. The computer-implemented method of claim 5, further comprising:
atomically replacing the second entry with a stolen value if the child object reference has not been stolen. 7. The computer-implemented method of claim 1, further comprising:
pushing a first place holder onto the mark stack; and pushing a second place holder onto the mark stack immediately after the first place holder. 8. The computer-implemented method of claim 7, further comprising:
replacing the first place holder with a parent object reference; and replacing the second place holder with a child object reference. 9. A computer-readable storage medium storing thereon processor-executable instructions, comprising:
instructions, that when executed on a processor, push a first entry onto a mark stack as a place holder for a parent object reference associated with a partially-marked object reference; instructions, that when executed on a processor, push a second entry onto a mark stack as a place holder for a child object reference that is associated with a parent object reference; and instructions, that when executed on a processor, replace the first entry with a parent object reference and the second entry with a child object reference that is associated with the parent object reference. 10. A computer-readable storage medium of claim 9, further comprising:
instructions, that when executed on a processor, traverses the mark stack to find a partially marked object reference, the partially marked object reference having a first entry and a second entry that are consecutively positioned, the first entry representing a parent object reference and a second entry representing a child object reference. 11. The computer-readable storage medium of claim 10, further comprising:
instructions, that when executed on a processor, steals the child object reference in the second entry by replacing the second entry with a stolen value when a current read of the second entry matches a last read of the second entry. 12. The computer-readable storage medium of claim 11, wherein an atomic instruction is used to match a stored value of the second entry from the last read with a current value of the second entry from the current read and to replace the second entry with the stolen value. 13. The computer-readable storage medium of claim 10, further comprising:
instructions, that when executed on a processor, marks the second entry as being stolen when the child object reference lies with an address range of the parent object reference and the child object reference has not changed since a last read of the child object reference. 14. The computer-readable storage medium of claim 13, wherein an atomic operation is used to mark the second entry as being stolen. 15. A system, comprising:
a plurality of processors; at least one process, each process having instructions that when executed on a processor allocates objects dynamically; and a garbage collector having a plurality of garbage collector threads and a plurality of mark stacks, at least one mark stack including at least one partially-marked object reference, each partially-marked object reference representing objects requiring marking, each partially-marked object reference including a parent object reference and a child object reference, each mark stack accessible by each garbage collector thread concurrently, each garbage collector thread containing instructions that when executed on a processor removes a partially-marked object reference from any mark stack for the garbage collector thread to mark objects starting from the child object reference. 16. The system of claim 15, the garbage collector thread contains further instructions that when executed on a processor, performs a first read on the parent object reference and a first read on the child object reference to determine that the parent object reference and the child object reference are a partially-marked object reference, and steals the child object reference when a subsequent atomic read on the child object reference matches a stored value of the child object reference. 17. The system of claim 15, the garbage collector thread contains further instructions, that when executed on a processor, performs a first read on the parent object reference and a first read on the child object reference and when an address of the child object reference lies within an address range of the parent object reference, the child object reference is stolen. 18. The system of claim 17, the garbage collector thread steals the child object reference after determining that the child object reference has not been stolen. 19. The system of claim 17, the garbage collector thread contains an atomic instruction, that when executed on a processor, compares a stored value of the child object reference with a current value of the child object reference and when the stored value of the child object reference matches the current value of the child object references, replaces the child object reference with a stolen value. 20. The system of claim 15, wherein the garbage collector threads do not execute on a same processor concurrently. | A process may utilize multiple garbage collector threads, each having the capability to steal partially-marked object references from an accessible mark stack having additional work that has yet to be processed. A partially-marked object reference may be represented as a pair of entries on a mark stack. A garbage collector thread may utilize an atomic operation to access the pair of entries in a prescribed manner to steal an unprocessed partially-marked object reference. In this manner, the workload of an overloaded garbage collector thread is offloaded to another garbage collector thread that may be idle thereby balancing the workload more evenly among multiple garbage collector threads.1. A computer-implemented method, comprising:
storing onto a mark stack, by a first garbage collector thread, a partially-marked object reference having a parent object reference and a child object reference, the mark stack accessible by multiple garbage collector threads concurrently; searching the mark stack, by a second garbage collector thread, for a partially-marked object reference, the first garbage collector thread different from the second garbage collector thread; and stealing from the mark stack, by the second garbage collector thread, the partially-marked object reference by replacing the child object reference with a stolen value. 2. The computer-implemented method of claim 1, further comprising:
marking, by the second garbage collector thread, objects referenced by the child object reference. 3. The computer-implemented method of claim 1, the searching step further comprising:
reading the mark stack for a first entry having a parent object reference; reading the mark stack for a second entry having a child object reference; and determining that the first entry and the second entry form a partially-marked object reference. 4. The computer-implemented method of claim 3, further comprising:
atomically replacing the second entry with a stolen value if the child object reference has not been stolen. 5. The computer-implemented method of claim 1, further comprising:
reading the mark stack for a first entry having a parent object reference; reading the mark stack for a second entry having a child object reference; and determining that the first and second entry form a partially-marked object reference when the child object reference is contained within an address range encompassed by the parent object reference. 6. The computer-implemented method of claim 5, further comprising:
atomically replacing the second entry with a stolen value if the child object reference has not been stolen. 7. The computer-implemented method of claim 1, further comprising:
pushing a first place holder onto the mark stack; and pushing a second place holder onto the mark stack immediately after the first place holder. 8. The computer-implemented method of claim 7, further comprising:
replacing the first place holder with a parent object reference; and replacing the second place holder with a child object reference. 9. A computer-readable storage medium storing thereon processor-executable instructions, comprising:
instructions, that when executed on a processor, push a first entry onto a mark stack as a place holder for a parent object reference associated with a partially-marked object reference; instructions, that when executed on a processor, push a second entry onto a mark stack as a place holder for a child object reference that is associated with a parent object reference; and instructions, that when executed on a processor, replace the first entry with a parent object reference and the second entry with a child object reference that is associated with the parent object reference. 10. A computer-readable storage medium of claim 9, further comprising:
instructions, that when executed on a processor, traverses the mark stack to find a partially marked object reference, the partially marked object reference having a first entry and a second entry that are consecutively positioned, the first entry representing a parent object reference and a second entry representing a child object reference. 11. The computer-readable storage medium of claim 10, further comprising:
instructions, that when executed on a processor, steals the child object reference in the second entry by replacing the second entry with a stolen value when a current read of the second entry matches a last read of the second entry. 12. The computer-readable storage medium of claim 11, wherein an atomic instruction is used to match a stored value of the second entry from the last read with a current value of the second entry from the current read and to replace the second entry with the stolen value. 13. The computer-readable storage medium of claim 10, further comprising:
instructions, that when executed on a processor, marks the second entry as being stolen when the child object reference lies with an address range of the parent object reference and the child object reference has not changed since a last read of the child object reference. 14. The computer-readable storage medium of claim 13, wherein an atomic operation is used to mark the second entry as being stolen. 15. A system, comprising:
a plurality of processors; at least one process, each process having instructions that when executed on a processor allocates objects dynamically; and a garbage collector having a plurality of garbage collector threads and a plurality of mark stacks, at least one mark stack including at least one partially-marked object reference, each partially-marked object reference representing objects requiring marking, each partially-marked object reference including a parent object reference and a child object reference, each mark stack accessible by each garbage collector thread concurrently, each garbage collector thread containing instructions that when executed on a processor removes a partially-marked object reference from any mark stack for the garbage collector thread to mark objects starting from the child object reference. 16. The system of claim 15, the garbage collector thread contains further instructions that when executed on a processor, performs a first read on the parent object reference and a first read on the child object reference to determine that the parent object reference and the child object reference are a partially-marked object reference, and steals the child object reference when a subsequent atomic read on the child object reference matches a stored value of the child object reference. 17. The system of claim 15, the garbage collector thread contains further instructions, that when executed on a processor, performs a first read on the parent object reference and a first read on the child object reference and when an address of the child object reference lies within an address range of the parent object reference, the child object reference is stolen. 18. The system of claim 17, the garbage collector thread steals the child object reference after determining that the child object reference has not been stolen. 19. The system of claim 17, the garbage collector thread contains an atomic instruction, that when executed on a processor, compares a stored value of the child object reference with a current value of the child object reference and when the stored value of the child object reference matches the current value of the child object references, replaces the child object reference with a stolen value. 20. The system of claim 15, wherein the garbage collector threads do not execute on a same processor concurrently. | 2,100 |
5,060 | 15,097,935 | 2,138 | A secure demand paging system ( 1020 ) includes a processor ( 1030 ) operable for executing instructions, an internal memory ( 1034 ) for a first page in a first virtual machine context, an external memory ( 1024 ) for a second page in a second virtual machine context, and a security circuit ( 1038 ) coupled to the processor ( 1030 ) and to the internal memory ( 1034 ) for maintaining the first page secure in the internal memory ( 1034 ). The processor ( 1030 ) is operable to execute sets of instructions representing: a central controller ( 4210 ), an abort handler ( 4260 ) coupled to supply to the central controller ( 4210 ) at least one signal representing a page fault by an instruction in the processor ( 1030 ), a scavenger ( 4220 ) responsive to the central controller ( 4210 ) and operable to identify the first page as a page to free, a virtual machine context switcher ( 4230 ) responsive to the central controller ( 4210 ) to change from the first virtual machine context to the second virtual machine context; and a swapper manager ( 4240 ) operable to swap in the second page from the external memory ( 1024 ) with decryption and integrity check, to the internal memory ( 1034 ) in place of the first page. | 1-8. (canceled) 9. A secure demand paging system comprising:
a secure internal memory; an external non-volatile memory having encrypted and integrity-protected code pages; an external volatile memory for swap pages; a processor coupled to said secure internal memory and to said external non-volatile memory and operable to decrypt and verify the integrity of the code pages thereby to transfer code pages to said secure internal memory directly from said external non-volatile memory bypassing said external volatile memory in respect of the code pages, and to swap out and swap in the swap pages between secure internal memory and said external volatile memory bypassing said external non-volatile memory in respect of the swap pages for said external volatile memory. 10-14. (canceled) 15. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying whether a page slot is empty. 16. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying swap status for a page slot. 17. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying whether a page slot is swapped in, or a page is swapped out, or a page is swapped in after a page was swapped out. 18. The secure demand paging system claimed in claim 9, wherein said processor is further operable to select code and data pages differently in priority for swap out. 19. (canceled) 20. A method of secure demand paging in a system comprising:
a secure memory; a non-volatile memory storing encrypted and integrity-protected code pages; a volatile page swap memory; a processor coupled to said secure memory and to said non-volatile memory; wherein said method of secure demand paging comprises the steps of:
decrypting and verifying the integrity of said code pages;
transferring said code pages to said secure memory directly from said non-volatile memory, bypassing said volatile memory; and
swapping out and swapping in pages between said secure memory and said volatile memory. 21-24. (canceled) 25. The method of secure demand paging described in claim 20, further comprising the steps of:
storing encrypted and integrity-protected data pages in said non-volatile memory; and assigning different swap out priorities to said code and data pages. 26. The method of secure demand paging described in claim 20, further comprising the step of:
assigning different wiping priorities to modified or unmodified pages. 27-33. (canceled) | A secure demand paging system ( 1020 ) includes a processor ( 1030 ) operable for executing instructions, an internal memory ( 1034 ) for a first page in a first virtual machine context, an external memory ( 1024 ) for a second page in a second virtual machine context, and a security circuit ( 1038 ) coupled to the processor ( 1030 ) and to the internal memory ( 1034 ) for maintaining the first page secure in the internal memory ( 1034 ). The processor ( 1030 ) is operable to execute sets of instructions representing: a central controller ( 4210 ), an abort handler ( 4260 ) coupled to supply to the central controller ( 4210 ) at least one signal representing a page fault by an instruction in the processor ( 1030 ), a scavenger ( 4220 ) responsive to the central controller ( 4210 ) and operable to identify the first page as a page to free, a virtual machine context switcher ( 4230 ) responsive to the central controller ( 4210 ) to change from the first virtual machine context to the second virtual machine context; and a swapper manager ( 4240 ) operable to swap in the second page from the external memory ( 1024 ) with decryption and integrity check, to the internal memory ( 1034 ) in place of the first page.1-8. (canceled) 9. A secure demand paging system comprising:
a secure internal memory; an external non-volatile memory having encrypted and integrity-protected code pages; an external volatile memory for swap pages; a processor coupled to said secure internal memory and to said external non-volatile memory and operable to decrypt and verify the integrity of the code pages thereby to transfer code pages to said secure internal memory directly from said external non-volatile memory bypassing said external volatile memory in respect of the code pages, and to swap out and swap in the swap pages between secure internal memory and said external volatile memory bypassing said external non-volatile memory in respect of the swap pages for said external volatile memory. 10-14. (canceled) 15. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying whether a page slot is empty. 16. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying swap status for a page slot. 17. The secure demand paging system claimed in claim 9, wherein said processor is further operable to record entries in the table identifying whether a page slot is swapped in, or a page is swapped out, or a page is swapped in after a page was swapped out. 18. The secure demand paging system claimed in claim 9, wherein said processor is further operable to select code and data pages differently in priority for swap out. 19. (canceled) 20. A method of secure demand paging in a system comprising:
a secure memory; a non-volatile memory storing encrypted and integrity-protected code pages; a volatile page swap memory; a processor coupled to said secure memory and to said non-volatile memory; wherein said method of secure demand paging comprises the steps of:
decrypting and verifying the integrity of said code pages;
transferring said code pages to said secure memory directly from said non-volatile memory, bypassing said volatile memory; and
swapping out and swapping in pages between said secure memory and said volatile memory. 21-24. (canceled) 25. The method of secure demand paging described in claim 20, further comprising the steps of:
storing encrypted and integrity-protected data pages in said non-volatile memory; and assigning different swap out priorities to said code and data pages. 26. The method of secure demand paging described in claim 20, further comprising the step of:
assigning different wiping priorities to modified or unmodified pages. 27-33. (canceled) | 2,100 |
5,061 | 13,955,331 | 2,144 | Systems, methods, and other embodiments associated with a user interface for tracking behaviors are described. In one embodiment, a method includes generating, on a display of a computing device, a graphical user interface (GUI). The GUI includes a dial that indicates a chronological order for a set of events. The dial includes a center area with an activity object for manipulating the set of events. The GUI includes a context panel with one or more buttons for modifying the set of events. The method includes populating the dial with icons for the set of events by pinning the icons to the dial. The set of events include predefined events for tracking behaviors of a user. Populating the dial includes displaying the icons around the dial to correlate with when each of the set of events occurs. | 1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
generating, on a display of the computer, a graphical user interface (GUI) comprising:
a dial that indicates a chronological order for a set of events, wherein the dial includes a center area with an activity object for manipulating the set of events, and
a context panel that includes one or more buttons for modifying the set of events; and
populating, on the display of the computer, the dial with icons for the set of events by pinning the icons to the dial, wherein the set of events include predefined events for tracking behaviors of a user, and wherein populating the dial includes displaying the icons around the dial to correlate with when each of the set of events occurs. 2. The non-transitory computer-readable medium of claim 1, further comprising:
monitoring the GUI for a gesture from the user that is an input to modify an event from the set of events, wherein monitoring the GUI for the gesture includes determining the gesture by resolving one or more conflicting gestures; and modifying, in response to the gesture, the GUI to reflect input from the gesture. 3. The non-transitory computer-readable medium of claim 2, wherein determining the gesture includes determining that the gesture includes:
tapping the activity object, dragging the activity object to a button of the context panel, dragging the activity object to the dial, tapping an icon for an event of the set of events, dragging an icon for an event, or tapping a button of the context panel. 4. The non-transitory computer-readable medium of claim 2, wherein the gesture provides a context sensitive input to the GUI without using additional menus or screens. 5. The non-transitory computer-readable medium of claim 1, wherein the dial displays a twenty four hour period that corresponds with a single day. 6. The non-transitory computer-readable medium of claim 1, wherein the set of events are medical events that include behaviors performed or to be performed by the user. 7. The non-transitory computer-readable medium of claim 6, wherein the set of events include medication doses. 8. The non-transitory computer-readable medium of claim 1, wherein generating the GUI includes generating the GUI to provide context relevant functions using the activity object and the context panel in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events. 9. The non-transitory computer-readable medium of claim 1, wherein generating the GUI includes generating multiple dials on separate screens for different behaviors of the user, wherein each of the multiple dials includes a different activity object and context panel for the different behaviors to track of the user. 10. The non-transitory computer-readable medium of claim 1, further comprising:
alerting the user that an event is due by changing an icon on the GUI when the event correlates with a current time, wherein the event is one of the set of events. 11. A system, comprising:
interface logic configured to generate, on a display of a device, a graphical user interface (GUI) comprising:
a dial that indicates a chronological order for a set of events, wherein the dial includes a center area with an activity object for manipulating the set of events, and
a context panel that includes one or more buttons for modifying the set of events on the dial; and
schedule logic configured to populate the dial with icons for the set of events by pinning the icons to the dial, wherein the set of events include predefined events for tracking behaviors of a user, and wherein the schedule logic is configured to populate the dial by displaying the icons around the dial to correlate with when each of the set of events occurs. 12. The system of claim 11, further comprising:
gesture logic configured to monitor the GUI for a gesture from the user that is an input to modify an event from the set of events, wherein the gesture logic is configured to monitor the GUI for the gesture by determining the gesture and resolving one or more conflicting gestures, wherein the interface logic is configured to modify, in response to the gesture, the GUI to reflect input from the gesture. 13. The system of claim 12, wherein the gesture logic is configured to determine the gesture by determining that the gesture includes:
tapping the activity object, dragging the activity object to a button of the context panel, dragging the activity object to the dial, tapping an icon for an event of the set of events, dragging an icon for an event, or tapping a button of the context panel. 14. The system of claim 11, wherein the gesture is a context sensitive input to the GUI that depends on a current state of the GUI and does not use additional menus or screens, wherein the interface logic is configured to generate the dial to display a twenty four hour period that corresponds with a single day, and wherein the set of events are medical events that include behaviors performed or to be performed by the user. 15. The system of claim 11, wherein the interface logic is configured to generate the GUI by generating the GUI to provide context relevant functions using the activity object and the context panel in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events. 16. The system of claim 11, wherein the interface logic is configured to generate the GUI by generating multiple dials on separate screens for different behaviors of the user, wherein each of the multiple dials includes a different activity object and context panel for the different behaviors to track of the user, and wherein each of the multiple screens include an independent context from other screens. 17. The system of claim 11, wherein the schedule logic is configured to alert the user that an event is due by changing an icon of the event on the GUI when the event correlates with a current time, and wherein the event is one of the set of events. 18. A computer-implemented method, the method comprising:
rendering, on a display of a computing device by at least a processor, a graphical user interface (GUI) comprising:
a dial for tracking behaviors, and
a set of buttons that provide functions for modifying a set of events on the dial, wherein the functions are contextually related to a health behavior that is tracked by a combination of the set of events and the dial;
detecting a gesture that is an input to the GUI from a user, wherein detecting the gesture permits context relevant input to control functions using the GUI in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events; and modifying, in response to the gesture, the GUI to reflect input from the gesture. 19. The computer-implemented method of claim 18, wherein rendering the GUI includes rendering the dial as a quantitative dial that indicates a number of portions associated with a behavior of the user, and wherein the number of portions track consumption by the user. 20. The computer-implemented method of claim 19, wherein rendering the GUI includes rendering the dial with indicators for a period of time that correlates with a day, and wherein the dial displays a schedule for the set of events. | Systems, methods, and other embodiments associated with a user interface for tracking behaviors are described. In one embodiment, a method includes generating, on a display of a computing device, a graphical user interface (GUI). The GUI includes a dial that indicates a chronological order for a set of events. The dial includes a center area with an activity object for manipulating the set of events. The GUI includes a context panel with one or more buttons for modifying the set of events. The method includes populating the dial with icons for the set of events by pinning the icons to the dial. The set of events include predefined events for tracking behaviors of a user. Populating the dial includes displaying the icons around the dial to correlate with when each of the set of events occurs.1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
generating, on a display of the computer, a graphical user interface (GUI) comprising:
a dial that indicates a chronological order for a set of events, wherein the dial includes a center area with an activity object for manipulating the set of events, and
a context panel that includes one or more buttons for modifying the set of events; and
populating, on the display of the computer, the dial with icons for the set of events by pinning the icons to the dial, wherein the set of events include predefined events for tracking behaviors of a user, and wherein populating the dial includes displaying the icons around the dial to correlate with when each of the set of events occurs. 2. The non-transitory computer-readable medium of claim 1, further comprising:
monitoring the GUI for a gesture from the user that is an input to modify an event from the set of events, wherein monitoring the GUI for the gesture includes determining the gesture by resolving one or more conflicting gestures; and modifying, in response to the gesture, the GUI to reflect input from the gesture. 3. The non-transitory computer-readable medium of claim 2, wherein determining the gesture includes determining that the gesture includes:
tapping the activity object, dragging the activity object to a button of the context panel, dragging the activity object to the dial, tapping an icon for an event of the set of events, dragging an icon for an event, or tapping a button of the context panel. 4. The non-transitory computer-readable medium of claim 2, wherein the gesture provides a context sensitive input to the GUI without using additional menus or screens. 5. The non-transitory computer-readable medium of claim 1, wherein the dial displays a twenty four hour period that corresponds with a single day. 6. The non-transitory computer-readable medium of claim 1, wherein the set of events are medical events that include behaviors performed or to be performed by the user. 7. The non-transitory computer-readable medium of claim 6, wherein the set of events include medication doses. 8. The non-transitory computer-readable medium of claim 1, wherein generating the GUI includes generating the GUI to provide context relevant functions using the activity object and the context panel in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events. 9. The non-transitory computer-readable medium of claim 1, wherein generating the GUI includes generating multiple dials on separate screens for different behaviors of the user, wherein each of the multiple dials includes a different activity object and context panel for the different behaviors to track of the user. 10. The non-transitory computer-readable medium of claim 1, further comprising:
alerting the user that an event is due by changing an icon on the GUI when the event correlates with a current time, wherein the event is one of the set of events. 11. A system, comprising:
interface logic configured to generate, on a display of a device, a graphical user interface (GUI) comprising:
a dial that indicates a chronological order for a set of events, wherein the dial includes a center area with an activity object for manipulating the set of events, and
a context panel that includes one or more buttons for modifying the set of events on the dial; and
schedule logic configured to populate the dial with icons for the set of events by pinning the icons to the dial, wherein the set of events include predefined events for tracking behaviors of a user, and wherein the schedule logic is configured to populate the dial by displaying the icons around the dial to correlate with when each of the set of events occurs. 12. The system of claim 11, further comprising:
gesture logic configured to monitor the GUI for a gesture from the user that is an input to modify an event from the set of events, wherein the gesture logic is configured to monitor the GUI for the gesture by determining the gesture and resolving one or more conflicting gestures, wherein the interface logic is configured to modify, in response to the gesture, the GUI to reflect input from the gesture. 13. The system of claim 12, wherein the gesture logic is configured to determine the gesture by determining that the gesture includes:
tapping the activity object, dragging the activity object to a button of the context panel, dragging the activity object to the dial, tapping an icon for an event of the set of events, dragging an icon for an event, or tapping a button of the context panel. 14. The system of claim 11, wherein the gesture is a context sensitive input to the GUI that depends on a current state of the GUI and does not use additional menus or screens, wherein the interface logic is configured to generate the dial to display a twenty four hour period that corresponds with a single day, and wherein the set of events are medical events that include behaviors performed or to be performed by the user. 15. The system of claim 11, wherein the interface logic is configured to generate the GUI by generating the GUI to provide context relevant functions using the activity object and the context panel in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events. 16. The system of claim 11, wherein the interface logic is configured to generate the GUI by generating multiple dials on separate screens for different behaviors of the user, wherein each of the multiple dials includes a different activity object and context panel for the different behaviors to track of the user, and wherein each of the multiple screens include an independent context from other screens. 17. The system of claim 11, wherein the schedule logic is configured to alert the user that an event is due by changing an icon of the event on the GUI when the event correlates with a current time, and wherein the event is one of the set of events. 18. A computer-implemented method, the method comprising:
rendering, on a display of a computing device by at least a processor, a graphical user interface (GUI) comprising:
a dial for tracking behaviors, and
a set of buttons that provide functions for modifying a set of events on the dial, wherein the functions are contextually related to a health behavior that is tracked by a combination of the set of events and the dial;
detecting a gesture that is an input to the GUI from a user, wherein detecting the gesture permits context relevant input to control functions using the GUI in a single display screen without using additional menus and display screens, and wherein the context relevant functions include functions associated with tracking the set of events; and modifying, in response to the gesture, the GUI to reflect input from the gesture. 19. The computer-implemented method of claim 18, wherein rendering the GUI includes rendering the dial as a quantitative dial that indicates a number of portions associated with a behavior of the user, and wherein the number of portions track consumption by the user. 20. The computer-implemented method of claim 19, wherein rendering the GUI includes rendering the dial with indicators for a period of time that correlates with a day, and wherein the dial displays a schedule for the set of events. | 2,100 |
5,062 | 14,361,884 | 2,145 | A planning tool, system and method include a processor ( 114 ) and memory ( 116 ) coupled to the processor which stores a planning module ( 144 ). A user interface ( 120 ) is coupled to the processor and configured to permit a user to select a path through a pathway system ( 148 ). The planning module is configured to upload one or more slices of an image volume ( 111 ) corresponding to a user-controlled cursor point ( 108 ) guided using the user interface such that as the path is navigated the one or more slices are updated in accordance with a depth of the cursor point in the path. | 1. A planning system, comprising:
a processor (114); memory (116) coupled to the processor and storing a planning module (144); and a user interface (120) coupled to the processor and configured to permit a user to select a path through a pathway system (148); the planning module configured to upload one or more slices of an image volume (111) corresponding to a user-controlled cursor point (108) guided using the user interface such that as the path is navigated the one or more slices are updated in accordance with a depth of the cursor point in the path. 2. The system as recited in claim 1, wherein the planning module (144) is configured to generate a trace line to indicate the path. 3. The system as recited in claim 1, wherein the pathway system (148) includes a lung and the path is determined between an entry point and a target within the lung. 4. The system as recited in claim 1, wherein the user-controlled cursor point (108) is centered within a depth dimension of an endoluminal structure and the planning module (144) checks the depth with images slices to determine whether the image slice should be updated. 5. The system as recited in claim 1, further comprising an image processing module (115) configured to perform a local extraction of an endoluminal structure of the pathway in two directions about a cursor location. 6. The system as recited in claim 1, wherein the memory (116) stores all three-dimensional positions along the path created by a drag of the cursor point to employ as input for path planning. 7. The system as recited in claim 1, wherein the image volume (111) includes pre-operatively collected images. 8. A system having operatively coupled viewports, comprising:
a processor (114); memory (116) coupled to the processor and storing an image processing module (115); a graphical user interface (106) coupled to the processor and configured to permit a user to select a path through a pathway system (148); the image processing module (115) being configured to render:
an endoluminal view (404) of the pathway;
one or more other views (402, 406, 408) of an image volume (111); and
a virtual line (410) to provide a spatial reference in all selected views including the endoluminal view and the one or more other views;
a user-controlled cursor point (412) configured to guide the endoluminal view wherein the cursor point is employed to permit updates in all the selected views corresponding to a selection update in the cursor point such that image information surrounding the cursor point in other views is concurrently viewable in the user interface. 9. The system as recited in claim 8, wherein the one or more views (402, 406, 408) includes one or more of a standard view and a reformatted view. 10. The system as recited in claim 8, wherein a reformatted view includes one of a view parallel to the virtual line or a view perpendicular to the virtual line. 11. The system as recited in claim 8, wherein the virtual line (410) is advanced or retracted in the endoluminal view by advancing or withdrawing a pointing control device. 12. The system as recited in claim 8, wherein the endoluminal view (404) is employed to determine a needle insertion point in a wall of the endoluminal structure and at least one other view is employed to determine a structure through the wall not visible in the endoluminal view. 13. The system as recited in claim 8, wherein the virtual line (410) is indicated in all the selected views. 14. The system as recited in claim 8, further comprising a pointing control device (108) configured to change a camera angle for at least one of the views. 15. The system as recited in claim 8, wherein the graphical user interface (106) includes a display (118) such that a plurality of panes corresponding to multiple views (124) is concurrently displayed. 16. A method for planning a procedure, comprising:
locating (506) an end point in an image volume of a pathway structure, the image volume comprised of stacked slices along a depth; selecting (508) a start point in the image volume of the pathway structure; extending (510) a path along the pathway structure; updating (512) image slices of the pathway structure along the path in accordance with a depth of the pathway structure corresponding with the image slices; navigating (516) along the pathway to the end point; and storing (518) the path for creating a plan for a procedure. 17. The method as recited in claim 16, further comprising segmenting (504) the pathway structure in pieces corresponding with a current location of a cursor. 18. The method as recited in claim 16, wherein the pathway structure includes an airway of a lung and the path is determined between a target as the start point and a trachea as the end point. 19. The method as recited in claim 16, further comprising computing (514) a center location for an endoluminal structure in the path and comparing the center location to a trace of the path to determine whether the stacked slice being viewed should be updated. 20. The method as recited in claim 16, further comprising performing (505) a local extraction of an endoluminal structure of the pathway structure in two directions about a cursor location. 21. The method as recited in claim 16, wherein the image volume includes pre-operatively collected images (111). 22. A method for operatively coupling viewports, comprising:
generating (604) an endoluminal view of a pathway structure in a graphical user interface configured to permit a user to select a path through a pathway system; generating (608) one or more other views of an image volume; and generating (612) a virtual line to provide a spatial reference in a plurality of views including the endoluminal view and the one or more other views such that the virtual line is configured to guide the endoluminal view and is employed to provide a reference to permit updates in the other views corresponding to a user selected position update of the virtual line such that image information surrounding the virtual line in the other views is concurrently viewable in the user interface. 23. The method as recited in claim 22, wherein the one or more views includes one or more of a standard view and a reformatted view. 24. The method as recited in claim 22, wherein a reformatted view includes one of a view parallel to the virtual line or a view perpendicular to the virtual line. 25. The method as recited in claim 22, wherein the virtual line is advanced or retracted in the endoluminal view by advancing or withdrawing a pointing control device. 26. The method as recited in claim 22, wherein the endoluminal view is employed (618) to determine a needle insertion point in a wall of the endoluminal structure and at least one other view is employed to determine a structure through the wall not visible in the endoluminal view. 27. The method as recited in claim 22, wherein the virtual line is indicated (622) in all selected views. 28. The method as recited in claim 22, further comprising changing (624) a camera angle for at least one of the views using a pointing control device. 29. The method as recited in claim 22, wherein the endoluminal and other views are concurrently displayed in a plurality of panes. | A planning tool, system and method include a processor ( 114 ) and memory ( 116 ) coupled to the processor which stores a planning module ( 144 ). A user interface ( 120 ) is coupled to the processor and configured to permit a user to select a path through a pathway system ( 148 ). The planning module is configured to upload one or more slices of an image volume ( 111 ) corresponding to a user-controlled cursor point ( 108 ) guided using the user interface such that as the path is navigated the one or more slices are updated in accordance with a depth of the cursor point in the path.1. A planning system, comprising:
a processor (114); memory (116) coupled to the processor and storing a planning module (144); and a user interface (120) coupled to the processor and configured to permit a user to select a path through a pathway system (148); the planning module configured to upload one or more slices of an image volume (111) corresponding to a user-controlled cursor point (108) guided using the user interface such that as the path is navigated the one or more slices are updated in accordance with a depth of the cursor point in the path. 2. The system as recited in claim 1, wherein the planning module (144) is configured to generate a trace line to indicate the path. 3. The system as recited in claim 1, wherein the pathway system (148) includes a lung and the path is determined between an entry point and a target within the lung. 4. The system as recited in claim 1, wherein the user-controlled cursor point (108) is centered within a depth dimension of an endoluminal structure and the planning module (144) checks the depth with images slices to determine whether the image slice should be updated. 5. The system as recited in claim 1, further comprising an image processing module (115) configured to perform a local extraction of an endoluminal structure of the pathway in two directions about a cursor location. 6. The system as recited in claim 1, wherein the memory (116) stores all three-dimensional positions along the path created by a drag of the cursor point to employ as input for path planning. 7. The system as recited in claim 1, wherein the image volume (111) includes pre-operatively collected images. 8. A system having operatively coupled viewports, comprising:
a processor (114); memory (116) coupled to the processor and storing an image processing module (115); a graphical user interface (106) coupled to the processor and configured to permit a user to select a path through a pathway system (148); the image processing module (115) being configured to render:
an endoluminal view (404) of the pathway;
one or more other views (402, 406, 408) of an image volume (111); and
a virtual line (410) to provide a spatial reference in all selected views including the endoluminal view and the one or more other views;
a user-controlled cursor point (412) configured to guide the endoluminal view wherein the cursor point is employed to permit updates in all the selected views corresponding to a selection update in the cursor point such that image information surrounding the cursor point in other views is concurrently viewable in the user interface. 9. The system as recited in claim 8, wherein the one or more views (402, 406, 408) includes one or more of a standard view and a reformatted view. 10. The system as recited in claim 8, wherein a reformatted view includes one of a view parallel to the virtual line or a view perpendicular to the virtual line. 11. The system as recited in claim 8, wherein the virtual line (410) is advanced or retracted in the endoluminal view by advancing or withdrawing a pointing control device. 12. The system as recited in claim 8, wherein the endoluminal view (404) is employed to determine a needle insertion point in a wall of the endoluminal structure and at least one other view is employed to determine a structure through the wall not visible in the endoluminal view. 13. The system as recited in claim 8, wherein the virtual line (410) is indicated in all the selected views. 14. The system as recited in claim 8, further comprising a pointing control device (108) configured to change a camera angle for at least one of the views. 15. The system as recited in claim 8, wherein the graphical user interface (106) includes a display (118) such that a plurality of panes corresponding to multiple views (124) is concurrently displayed. 16. A method for planning a procedure, comprising:
locating (506) an end point in an image volume of a pathway structure, the image volume comprised of stacked slices along a depth; selecting (508) a start point in the image volume of the pathway structure; extending (510) a path along the pathway structure; updating (512) image slices of the pathway structure along the path in accordance with a depth of the pathway structure corresponding with the image slices; navigating (516) along the pathway to the end point; and storing (518) the path for creating a plan for a procedure. 17. The method as recited in claim 16, further comprising segmenting (504) the pathway structure in pieces corresponding with a current location of a cursor. 18. The method as recited in claim 16, wherein the pathway structure includes an airway of a lung and the path is determined between a target as the start point and a trachea as the end point. 19. The method as recited in claim 16, further comprising computing (514) a center location for an endoluminal structure in the path and comparing the center location to a trace of the path to determine whether the stacked slice being viewed should be updated. 20. The method as recited in claim 16, further comprising performing (505) a local extraction of an endoluminal structure of the pathway structure in two directions about a cursor location. 21. The method as recited in claim 16, wherein the image volume includes pre-operatively collected images (111). 22. A method for operatively coupling viewports, comprising:
generating (604) an endoluminal view of a pathway structure in a graphical user interface configured to permit a user to select a path through a pathway system; generating (608) one or more other views of an image volume; and generating (612) a virtual line to provide a spatial reference in a plurality of views including the endoluminal view and the one or more other views such that the virtual line is configured to guide the endoluminal view and is employed to provide a reference to permit updates in the other views corresponding to a user selected position update of the virtual line such that image information surrounding the virtual line in the other views is concurrently viewable in the user interface. 23. The method as recited in claim 22, wherein the one or more views includes one or more of a standard view and a reformatted view. 24. The method as recited in claim 22, wherein a reformatted view includes one of a view parallel to the virtual line or a view perpendicular to the virtual line. 25. The method as recited in claim 22, wherein the virtual line is advanced or retracted in the endoluminal view by advancing or withdrawing a pointing control device. 26. The method as recited in claim 22, wherein the endoluminal view is employed (618) to determine a needle insertion point in a wall of the endoluminal structure and at least one other view is employed to determine a structure through the wall not visible in the endoluminal view. 27. The method as recited in claim 22, wherein the virtual line is indicated (622) in all selected views. 28. The method as recited in claim 22, further comprising changing (624) a camera angle for at least one of the views using a pointing control device. 29. The method as recited in claim 22, wherein the endoluminal and other views are concurrently displayed in a plurality of panes. | 2,100 |
5,063 | 13,762,765 | 2,139 | Method and apparatus for managing data in a memory. In accordance with some embodiments, a data object is stored in a first non-volatile tier of a multi-tier memory structure. An ECC data set adapted to detect at least one bit error in the data object during a read operation is generated. The ECC data set is stored in a different, second non-volatile tier of the multi-tier memory structure. | 1. A method comprising:
storing a data object in a first non-volatile tier of a multi-tier memory structure; generating an ECC data set adapted to detect at least one bit error in the data object during a read operation; and storing the ECC data set in a different, second non-volatile tier of the multi-tier memory structure. 2. The method of claim 1, in which the second non-volatile tier is selected responsive to a data attribute associated with the data object and a storage attribute associated with the second non-volatile tier. 3. The method of claim 1, in which the multi-tier memory structure comprises a plurality of non-volatile memory tiers each having different data transfer attributes and corresponding memory cell constructions arranged in a sequential priority order from highest to lowest. 4. The method of claim 3, in which the first non-volatile tier is a higher tier than the second non-volatile tier in the multi-tier memory structure. 5. The method of claim 3, in which the first non-volatile tier is a lower tier than the second non-volatile tier in the multi-tier memory structure. 6. The method of claim 1, in which the storing step comprises selecting the second non-volatile tier from a plurality of available lower tiers in the multi-tier memory structure responsive to a size of the ECC data set relative to a size of the data object. 7. The method of claim 6, in which the storing step further comprises selecting the second non-volatile tier from said plurality of available lower tiers in the multi-tier memory structure responsive to a data I/O transfer rate of the second non-volatile tier relative to a data I/O transfer rate of the first non-volatile tier. 8. The method of claim 1, in which the data object and the ECC data are stored simultaneously to the respective first and second non-volatile memory tiers over a common elapsed time interval. 9. The method of claim 1, in which the data object comprises at least one user data block supplied by a requestor device for storage in the multi-tiered memory structure, the ECC data comprises a codeword adapted to detect and correct up to at least one bit error in the data block during a read back operation. 10. The method of claim 1, further comprising generating a metadata unit comprising address information identifying a storage location of the data object within the first non-volatile memory tier and a storage location of the ECC data within the second non-volatile memory tier, wherein the metadata unit is stored in a different, third non-volatile tier in the multi-tier memory structure. 11. The method of claim 1, in which a selected one of the first or second tiers comprises rewriteable non-volatile memory cells and a remaining one of the first or second tiers comprises erasable non-volatile memory cells. 12. The method of claim 1, in which the multi-tier memory structure provides a plurality of tiers in sequential order from a fastest tier to a slowest tier, the second tier being slower than the first tier, and in which the method further comprises storing a second data object in the first tier and a corresponding second ECC data set to correct at least one bit error in the second data object in a third tier, the third tier faster than the first tier. 13. The method of claim 1, in which the multi-tier memory structure comprises a plurality of non-volatile memory tiers each having different data storage attributes, and the method further comprises selecting the first and second tiers by matching data storage attributes of the data object and the ECC data set to the respective first and second tiers. 14. An apparatus comprising:
a multi-tier memory structure comprising a plurality of non-volatile memory tiers each having different data transfer attributes and corresponding memory cell constructions, the memory tiers arranged in a priority order from fastest to slowest data I/O data transfer rate capabilities; and a storage manager adapted to generate a data object responsive to one or more data blocks supplied by a requestor, to generate an ECC data set for detecting up to a selected number of read back bit errors in the data object during a read back operation, to store the data object in a first selected memory tier of the multi-tier memory structure, and to store the ECC data set in a different second selected memory tier of the multi-tier memory structure. 15. The apparatus of claim 14, in which the storage manager selects the second memory tier responsive to a data attribute associated with the data object and a storage attribute associated with the second memory tier. 16. The apparatus of claim 14, in which the first selected memory tier comprises a relatively faster memory and the second selected memory tier comprises a relatively slower memory. 17. The apparatus of claim 14, in which the first selected memory tier comprises a relatively slower memory and the second selected memory tier comprises a relatively faster memory. 18. The apparatus of claim 14, in which a selected one of the first or second memory tiers comprises an erasable non-volatile memory and a remaining one of the first or second memory tiers comprises a rewritable non-volatile memory. 19. The apparatus of claim 14, in which the storage manager selects the second non-volatile tier from a plurality of available lower tiers in the multi-tier memory structure responsive to a size of the ECC data set relative to a size of the data object. 20. The method of claim 1, in which the storage manager further generates a metadata unit comprising address information identifying a storage location of the data object within the first selected memory tier and a storage location of the ECC data within the second selected memory tier, wherein the metadata unit is stored in a different, third selected tier in the multi-tier memory structure. | Method and apparatus for managing data in a memory. In accordance with some embodiments, a data object is stored in a first non-volatile tier of a multi-tier memory structure. An ECC data set adapted to detect at least one bit error in the data object during a read operation is generated. The ECC data set is stored in a different, second non-volatile tier of the multi-tier memory structure.1. A method comprising:
storing a data object in a first non-volatile tier of a multi-tier memory structure; generating an ECC data set adapted to detect at least one bit error in the data object during a read operation; and storing the ECC data set in a different, second non-volatile tier of the multi-tier memory structure. 2. The method of claim 1, in which the second non-volatile tier is selected responsive to a data attribute associated with the data object and a storage attribute associated with the second non-volatile tier. 3. The method of claim 1, in which the multi-tier memory structure comprises a plurality of non-volatile memory tiers each having different data transfer attributes and corresponding memory cell constructions arranged in a sequential priority order from highest to lowest. 4. The method of claim 3, in which the first non-volatile tier is a higher tier than the second non-volatile tier in the multi-tier memory structure. 5. The method of claim 3, in which the first non-volatile tier is a lower tier than the second non-volatile tier in the multi-tier memory structure. 6. The method of claim 1, in which the storing step comprises selecting the second non-volatile tier from a plurality of available lower tiers in the multi-tier memory structure responsive to a size of the ECC data set relative to a size of the data object. 7. The method of claim 6, in which the storing step further comprises selecting the second non-volatile tier from said plurality of available lower tiers in the multi-tier memory structure responsive to a data I/O transfer rate of the second non-volatile tier relative to a data I/O transfer rate of the first non-volatile tier. 8. The method of claim 1, in which the data object and the ECC data are stored simultaneously to the respective first and second non-volatile memory tiers over a common elapsed time interval. 9. The method of claim 1, in which the data object comprises at least one user data block supplied by a requestor device for storage in the multi-tiered memory structure, the ECC data comprises a codeword adapted to detect and correct up to at least one bit error in the data block during a read back operation. 10. The method of claim 1, further comprising generating a metadata unit comprising address information identifying a storage location of the data object within the first non-volatile memory tier and a storage location of the ECC data within the second non-volatile memory tier, wherein the metadata unit is stored in a different, third non-volatile tier in the multi-tier memory structure. 11. The method of claim 1, in which a selected one of the first or second tiers comprises rewriteable non-volatile memory cells and a remaining one of the first or second tiers comprises erasable non-volatile memory cells. 12. The method of claim 1, in which the multi-tier memory structure provides a plurality of tiers in sequential order from a fastest tier to a slowest tier, the second tier being slower than the first tier, and in which the method further comprises storing a second data object in the first tier and a corresponding second ECC data set to correct at least one bit error in the second data object in a third tier, the third tier faster than the first tier. 13. The method of claim 1, in which the multi-tier memory structure comprises a plurality of non-volatile memory tiers each having different data storage attributes, and the method further comprises selecting the first and second tiers by matching data storage attributes of the data object and the ECC data set to the respective first and second tiers. 14. An apparatus comprising:
a multi-tier memory structure comprising a plurality of non-volatile memory tiers each having different data transfer attributes and corresponding memory cell constructions, the memory tiers arranged in a priority order from fastest to slowest data I/O data transfer rate capabilities; and a storage manager adapted to generate a data object responsive to one or more data blocks supplied by a requestor, to generate an ECC data set for detecting up to a selected number of read back bit errors in the data object during a read back operation, to store the data object in a first selected memory tier of the multi-tier memory structure, and to store the ECC data set in a different second selected memory tier of the multi-tier memory structure. 15. The apparatus of claim 14, in which the storage manager selects the second memory tier responsive to a data attribute associated with the data object and a storage attribute associated with the second memory tier. 16. The apparatus of claim 14, in which the first selected memory tier comprises a relatively faster memory and the second selected memory tier comprises a relatively slower memory. 17. The apparatus of claim 14, in which the first selected memory tier comprises a relatively slower memory and the second selected memory tier comprises a relatively faster memory. 18. The apparatus of claim 14, in which a selected one of the first or second memory tiers comprises an erasable non-volatile memory and a remaining one of the first or second memory tiers comprises a rewritable non-volatile memory. 19. The apparatus of claim 14, in which the storage manager selects the second non-volatile tier from a plurality of available lower tiers in the multi-tier memory structure responsive to a size of the ECC data set relative to a size of the data object. 20. The method of claim 1, in which the storage manager further generates a metadata unit comprising address information identifying a storage location of the data object within the first selected memory tier and a storage location of the ECC data within the second selected memory tier, wherein the metadata unit is stored in a different, third selected tier in the multi-tier memory structure. | 2,100 |
5,064 | 13,502,296 | 2,127 | A computer-implemented method for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for moulding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, including the steps of: —acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, —generating the casting mold CAD model as an impression of at least a part of the input 3D model, said casting mold CAD model thereby including the negative geometry of the personalized device, and—defining at least one sectioning of the casting mold CAD model by means of at least one separation plane and/or separation spline. | 1-36. (canceled) 37. A computer-implemented method for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for moulding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, said method comprising the steps of:
acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, generating the casting mold CAD model as an impression of at least a part of the input 3D model, said casting mold CAD model thereby comprising the negative geometry of the personalized device, and defining at least one sectioning of the casting mold CAD model by means of at least one separation plane and/or separation spline. 38. A method according to claim 37, further comprising the step of providing an interlocking mechanism of the casting mold CAD model. 39. A method according to claim 37, wherein the personalized device is shaped to fit an anatomic part of person. 40. A method according to claim 37, further comprising the step of acquiring one or more 3D models of
at least a part of said anatomic part, and/or an impression of said anatomic part, and wherein the input 3D model is based on said one or more 3D-models. 41. A method according to claim 40, wherein said one or more 3D models are provided by 3D scanning said anatomic part and/or by 3D scanning an impression of said anatomic part. 42. A method according to claim 37, wherein said at least one separation plane and/or separation spline is defined at the input 3D model. 43. A method according to claim 37, further comprising the step of automatically arranging said at least one separation plane and/or separation spline, preferably based on one or more algorithms for a best fit. 44. A method according to claim 37, wherein said at least one separation plane and/or separation spline is arranged to remove undercuts. 45. A method according to claim 37, further comprising the step of selecting and/or generating one or more template casting mold CAD models. 46. A method according to claim 37, wherein the casting mold CAD model is generated from a template CAD model. 47. A method according to claim 37, wherein the casting mold CAD model and/or the template casting mold CAD model comprises a plurality of interlocking geometry section models that are adapted to assemble to an enclosed casting mold model. 48. A method according to claim 37, wherein the personalized device is a soft ear mold, the anatomic part is the human ear and the 3D model is a model of the human ear and/or the human ear canal and/or a model of an impression of the human ear and/or the human ear canal. 49. A method according to claim 37, wherein the casting mold CAD model and/or the template casting mold CAD model is defined by means of a plurality of configuration parameters, and where the configuration parameters of a casting mold CAD model and/or a template casting mold CAD model are selected from one or more of the following parameters:
number of interlocking sections, type of casting mold housing, such as open or enclosed casting mold, the width of the wall of the casting mold, configuration of interlocking mechanism, number, dimension and location of leg stanchions for the casting mold, type and location of one or more identification elements, connector strand dimensions between casting mold sections, locking mechanism dimensions between casting mold sections. 50. A method according to claim 37, further comprising the step of defining and positioning at least one injection point in the casting mold CAD model, said at least one injection point being adapted for pouring and/or injection of soft material in the casting process. 51. A method according to claim 37, further comprising the step of defining and positioning at least one drainage hole in the casting mold CAD model, said at least one drainage hole being adapted for the release of excess soft material during the casting process. 52. A method according to claim 50, wherein said positioning is provided manually or automatically or as a combination hereof. 53. A method according to claim 37, further comprising the step of minimizing the amount and/or volume of necessary material for the casting mold CAD model. 54. A method for producing a soft cast for a personalized device, a device such as an ear mold hearing aid device, said method comprising the steps of:
designing a casting mold CAD model according to claims 37, 3D printing a casting mold based on said casting mold CAD model, injection and/or pouring of soft material into the casting mold, assembling the different sections of the casting mold containing the soft material thereby producing the soft cast, and extracting the cast from the casting mold by:
disassembling each interlocked cast section, and/or
breaking the cast along one or more of the fragile lines. 55. A computer program product having a computer readable medium, said computer program product providing a system for creating a customized CAD model of a casting mold for molding of a personalized device, and said computer program product comprising means for carrying out all of the steps of the method according to claim 37. 56. A system for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for molding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, said system comprising:
means for acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, and means for generating the casting mold CAD model comprising:
an impression of the input 3D model, said casting mold CAD model thereby comprising the negative geometry of the personalized device, and
at least one separation plane and/or separation spline defining the sectioning of the casting mold CAD model. | A computer-implemented method for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for moulding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, including the steps of: —acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, —generating the casting mold CAD model as an impression of at least a part of the input 3D model, said casting mold CAD model thereby including the negative geometry of the personalized device, and—defining at least one sectioning of the casting mold CAD model by means of at least one separation plane and/or separation spline.1-36. (canceled) 37. A computer-implemented method for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for moulding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, said method comprising the steps of:
acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, generating the casting mold CAD model as an impression of at least a part of the input 3D model, said casting mold CAD model thereby comprising the negative geometry of the personalized device, and defining at least one sectioning of the casting mold CAD model by means of at least one separation plane and/or separation spline. 38. A method according to claim 37, further comprising the step of providing an interlocking mechanism of the casting mold CAD model. 39. A method according to claim 37, wherein the personalized device is shaped to fit an anatomic part of person. 40. A method according to claim 37, further comprising the step of acquiring one or more 3D models of
at least a part of said anatomic part, and/or an impression of said anatomic part, and wherein the input 3D model is based on said one or more 3D-models. 41. A method according to claim 40, wherein said one or more 3D models are provided by 3D scanning said anatomic part and/or by 3D scanning an impression of said anatomic part. 42. A method according to claim 37, wherein said at least one separation plane and/or separation spline is defined at the input 3D model. 43. A method according to claim 37, further comprising the step of automatically arranging said at least one separation plane and/or separation spline, preferably based on one or more algorithms for a best fit. 44. A method according to claim 37, wherein said at least one separation plane and/or separation spline is arranged to remove undercuts. 45. A method according to claim 37, further comprising the step of selecting and/or generating one or more template casting mold CAD models. 46. A method according to claim 37, wherein the casting mold CAD model is generated from a template CAD model. 47. A method according to claim 37, wherein the casting mold CAD model and/or the template casting mold CAD model comprises a plurality of interlocking geometry section models that are adapted to assemble to an enclosed casting mold model. 48. A method according to claim 37, wherein the personalized device is a soft ear mold, the anatomic part is the human ear and the 3D model is a model of the human ear and/or the human ear canal and/or a model of an impression of the human ear and/or the human ear canal. 49. A method according to claim 37, wherein the casting mold CAD model and/or the template casting mold CAD model is defined by means of a plurality of configuration parameters, and where the configuration parameters of a casting mold CAD model and/or a template casting mold CAD model are selected from one or more of the following parameters:
number of interlocking sections, type of casting mold housing, such as open or enclosed casting mold, the width of the wall of the casting mold, configuration of interlocking mechanism, number, dimension and location of leg stanchions for the casting mold, type and location of one or more identification elements, connector strand dimensions between casting mold sections, locking mechanism dimensions between casting mold sections. 50. A method according to claim 37, further comprising the step of defining and positioning at least one injection point in the casting mold CAD model, said at least one injection point being adapted for pouring and/or injection of soft material in the casting process. 51. A method according to claim 37, further comprising the step of defining and positioning at least one drainage hole in the casting mold CAD model, said at least one drainage hole being adapted for the release of excess soft material during the casting process. 52. A method according to claim 50, wherein said positioning is provided manually or automatically or as a combination hereof. 53. A method according to claim 37, further comprising the step of minimizing the amount and/or volume of necessary material for the casting mold CAD model. 54. A method for producing a soft cast for a personalized device, a device such as an ear mold hearing aid device, said method comprising the steps of:
designing a casting mold CAD model according to claims 37, 3D printing a casting mold based on said casting mold CAD model, injection and/or pouring of soft material into the casting mold, assembling the different sections of the casting mold containing the soft material thereby producing the soft cast, and extracting the cast from the casting mold by:
disassembling each interlocked cast section, and/or
breaking the cast along one or more of the fragile lines. 55. A computer program product having a computer readable medium, said computer program product providing a system for creating a customized CAD model of a casting mold for molding of a personalized device, and said computer program product comprising means for carrying out all of the steps of the method according to claim 37. 56. A system for creating a customized CAD model of a casting mold, defined as the casting mold CAD model, for molding of a personalized device, where the casting mold is used for casting an at least partly soft mould as part of the personalized device, and where the casting mold is adapted to be manufactured by means of rapid prototyping, such as 3D printing, said system comprising:
means for acquiring an input 3D model representing the personalized device, where the input 3D model is acquired by means of 3D scanning, and means for generating the casting mold CAD model comprising:
an impression of the input 3D model, said casting mold CAD model thereby comprising the negative geometry of the personalized device, and
at least one separation plane and/or separation spline defining the sectioning of the casting mold CAD model. | 2,100 |
5,065 | 14,959,013 | 2,192 | The current document is directed to an artifact-management subsystem and interface to the artifact-management subsystem that is, at least in part, implemented by plug-ins to a particular artifact repository. The currently disclosed artifact-management-subsystem interface includes a comprehensive set of search types, using which particular artifacts can be identified and retrieved from various artifact repositories. The search types include search types natively supported by one or more repositories as well as search types implemented by plug-ins to a particular artifact repository, with the plug-ins, in certain cases, accessing additional, remote artifact repositories. Use of plug-in technology provides a path to a comprehensive artifact-management-subsystem interface that does not involve the complexities and problems associated with individually interfacing to a variety of different types of artifact repositories. | 1. A workflow-based cloud-management system incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the workflow-based cloud-management system comprising:
an infrastructure-management-and-administration subsystem; a workflow-execution engine; an automated-application-deployment subsystem; and an automated-application-release-management subsystem that executes application-release-management pipelines that each comprises one or more stages, each comprising one of more tasks, and that interfaces to an artifact-management-subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. 2. The workflow-based cloud-management system of claim 1 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
a management controller; and
an interface to the workflow-execution engine 3. The workflow-based cloud-management system of claim 2 wherein the automated-application-release-management subsystem and the infrastructure-management-and-administration subsystem include control logic at least partially implemented as workflows that are executed by the workflow-execution-engine subsystem. 4. The workflow-based cloud-management system of claim 2 wherein the artifact-management-subsystem comprises:
the local plug-in-compatible artifact repository; and
the one or more plug-in modules that each interfaces to the artifact repository. 5. The workflow-based cloud-management system of claim 4 wherein the artifact-management-subsystem additionally comprises:
one or more remote artifact repositories to each of which at least one of the one or more plug-in modules interfaces. 6. The workflow-based cloud-management system of claim 5 wherein the artifact-management-subsystem interface provided by the artifact-management subsystem includes entrypoints that, when called with one or more parameter values, each invokes a search of a particular search-type. 7. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface entrypoints include entrypoints selected from among:
entrypoints that each invokes a search of a particular search-type carried out entirely within the local plug-in-compatible artifact repository;
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and one of the one or more remote artifact repositories; and
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and the local plug-in-compatible artifact repository. 8. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface additionally includes a table of search types, each search type described by a search-type name, a list of parameter values, and a list of repositories that support searches of the search type. 9. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface additionally includes a repository spec that, for each two or more repositories, includes a name and connection information for the repository. 10. The workflow-based cloud-management system of claim 6 wherein the management controller retries one or more artifacts from the artifact-management subsystem by:
compiling a search request; and
forwarding the search request to the artifact-management subsystem. 11. The workflow-based cloud-management system of claim 6 wherein the search request comprises:
a indication of a search type;
parameter values needed to invoke a search of the indicated search type; and
a list of artifact repositories to carry out a search of the search type. 12. A method by which a management controller of an automated-application-release-management-subsystem component of a workflow-based cloud-management system that is incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks searches for artifacts, the method comprising:
compiling a search request; and forwarding the search request to an artifact-management subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. 13. The method of claim 12 wherein the workflow-based cloud-management system comprises:
an infrastructure-management-and-administration subsystem;
a workflow-execution engine;
an automated-application-deployment subsystem;
the automated-application-release-management subsystem that executes application-release-management pipelines; and
the artifact-management subsystem. 14. The method of claim 13 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
the management controller; and
an interface to the workflow-execution engine 15. The method of claim 14 wherein the artifact-management-subsystem comprises:
the local plug-in-compatible artifact repository; and
the one or more plug-in modules that each interfaces to the artifact repository. 16. The method of claim 15 wherein the artifact-management-subsystem additionally comprises:
one or more remote artifact repositories to each of which at least one of the one or more plug-in modules interfaces. 17. The method of claim 16 wherein the artifact-management-subsystem interface provided by the artifact-management subsystem includes entrypoints that, when called with one or more parameter values, each invokes a search of a particular search-type. 18. The method of 17 wherein the artifact-management-subsystem-interface entrypoints include entrypoints selected from among:
entrypoints that each invokes a search of a particular search-type carried out entirely within the local plug-in-compatible artifact repository;
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and one of the one or more remote artifact repositories; and
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and the local plug-in-compatible artifact repository. 19. The method of 15 wherein the artifact-management-subsystem-interface additionally includes:
a table of search types, each search type described by a search-type name, a list of parameter values, and a list of repositories that support searches of the search type; and
a repository spec that, for each two or more repositories, includes a name and connection information for the repository. 20. The method of 12 wherein the search request comprises:
a indication of a search type;
parameter values needed to invoke a search of the indicated search type; and
a list of artifact repositories to carry out a search of the search type. 21. 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 a management controller of an automated-application-release-management-subsystem component of a workflow-based cloud-management system that is incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks to search for artifacts, the method comprising:
compiling a search request; and forwarding the search request to an artifact-management subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. | The current document is directed to an artifact-management subsystem and interface to the artifact-management subsystem that is, at least in part, implemented by plug-ins to a particular artifact repository. The currently disclosed artifact-management-subsystem interface includes a comprehensive set of search types, using which particular artifacts can be identified and retrieved from various artifact repositories. The search types include search types natively supported by one or more repositories as well as search types implemented by plug-ins to a particular artifact repository, with the plug-ins, in certain cases, accessing additional, remote artifact repositories. Use of plug-in technology provides a path to a comprehensive artifact-management-subsystem interface that does not involve the complexities and problems associated with individually interfacing to a variety of different types of artifact repositories.1. A workflow-based cloud-management system incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks, the workflow-based cloud-management system comprising:
an infrastructure-management-and-administration subsystem; a workflow-execution engine; an automated-application-deployment subsystem; and an automated-application-release-management subsystem that executes application-release-management pipelines that each comprises one or more stages, each comprising one of more tasks, and that interfaces to an artifact-management-subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. 2. The workflow-based cloud-management system of claim 1 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
a management controller; and
an interface to the workflow-execution engine 3. The workflow-based cloud-management system of claim 2 wherein the automated-application-release-management subsystem and the infrastructure-management-and-administration subsystem include control logic at least partially implemented as workflows that are executed by the workflow-execution-engine subsystem. 4. The workflow-based cloud-management system of claim 2 wherein the artifact-management-subsystem comprises:
the local plug-in-compatible artifact repository; and
the one or more plug-in modules that each interfaces to the artifact repository. 5. The workflow-based cloud-management system of claim 4 wherein the artifact-management-subsystem additionally comprises:
one or more remote artifact repositories to each of which at least one of the one or more plug-in modules interfaces. 6. The workflow-based cloud-management system of claim 5 wherein the artifact-management-subsystem interface provided by the artifact-management subsystem includes entrypoints that, when called with one or more parameter values, each invokes a search of a particular search-type. 7. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface entrypoints include entrypoints selected from among:
entrypoints that each invokes a search of a particular search-type carried out entirely within the local plug-in-compatible artifact repository;
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and one of the one or more remote artifact repositories; and
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and the local plug-in-compatible artifact repository. 8. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface additionally includes a table of search types, each search type described by a search-type name, a list of parameter values, and a list of repositories that support searches of the search type. 9. The workflow-based cloud-management system of claim 6 wherein the artifact-management-subsystem-interface additionally includes a repository spec that, for each two or more repositories, includes a name and connection information for the repository. 10. The workflow-based cloud-management system of claim 6 wherein the management controller retries one or more artifacts from the artifact-management subsystem by:
compiling a search request; and
forwarding the search request to the artifact-management subsystem. 11. The workflow-based cloud-management system of claim 6 wherein the search request comprises:
a indication of a search type;
parameter values needed to invoke a search of the indicated search type; and
a list of artifact repositories to carry out a search of the search type. 12. A method by which a management controller of an automated-application-release-management-subsystem component of a workflow-based cloud-management system that is incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks searches for artifacts, the method comprising:
compiling a search request; and forwarding the search request to an artifact-management subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. 13. The method of claim 12 wherein the workflow-based cloud-management system comprises:
an infrastructure-management-and-administration subsystem;
a workflow-execution engine;
an automated-application-deployment subsystem;
the automated-application-release-management subsystem that executes application-release-management pipelines; and
the artifact-management subsystem. 14. The method of claim 13 wherein the automated-application-release-management subsystem comprises:
a dashboard user interface;
the management controller; and
an interface to the workflow-execution engine 15. The method of claim 14 wherein the artifact-management-subsystem comprises:
the local plug-in-compatible artifact repository; and
the one or more plug-in modules that each interfaces to the artifact repository. 16. The method of claim 15 wherein the artifact-management-subsystem additionally comprises:
one or more remote artifact repositories to each of which at least one of the one or more plug-in modules interfaces. 17. The method of claim 16 wherein the artifact-management-subsystem interface provided by the artifact-management subsystem includes entrypoints that, when called with one or more parameter values, each invokes a search of a particular search-type. 18. The method of 17 wherein the artifact-management-subsystem-interface entrypoints include entrypoints selected from among:
entrypoints that each invokes a search of a particular search-type carried out entirely within the local plug-in-compatible artifact repository;
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and one of the one or more remote artifact repositories; and
entrypoints that each invokes a search of a particular search-type carried out within one or the one or more plug-in-modules and the local plug-in-compatible artifact repository. 19. The method of 15 wherein the artifact-management-subsystem-interface additionally includes:
a table of search types, each search type described by a search-type name, a list of parameter values, and a list of repositories that support searches of the search type; and
a repository spec that, for each two or more repositories, includes a name and connection information for the repository. 20. The method of 12 wherein the search request comprises:
a indication of a search type;
parameter values needed to invoke a search of the indicated search type; and
a list of artifact repositories to carry out a search of the search type. 21. 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 a management controller of an automated-application-release-management-subsystem component of a workflow-based cloud-management system that is incorporated within a cloud-computing facility having multiple servers, data-storage devices, and one or more internal networks to search for artifacts, the method comprising:
compiling a search request; and forwarding the search request to an artifact-management subsystem that includes entrypoints to searches for artifacts carried out by a local plug-in-compatible artifact repository as well as entrypoints to searches for artifacts carried out, at least in part, by one or more plug-in modules. | 2,100 |
5,066 | 14,181,917 | 2,195 | A method of distributing functions among a plurality of cores in a multi-core processing environment can include organizing cores of the multi-core processing environment into a plurality of different service pools. Each of the plurality of service pools can be associated with at least one function and have at least one core executing at least one soft co-processor that performs the associated function. The method further can include, responsive to a request from a primary processor to offload a selected function, selecting an available soft co-processor from a service pool associated with the selected function and assigning the selected function to the selected soft co-processor. The method also can include marking the selected soft co-processor as busy and, responsive to receiving an indication from the soft co-processor that processing of the selected function has completed, marking the selected soft co-processor as available. | 1-20. (canceled) 21. A method of allocating a plurality of cores in a multi-core processing environment, comprising:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function; preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned; receiving, from a primary processor, a request to offload a selected function; selecting, from a service pool associated with the selected function, a soft co-processor; and assigning the selected co-processor to perform the selected function. 22. The method of claim 21, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 23. The method of claim 21, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 24. The method of claim 21, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 25. The method of claim 24, further comprising
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 26. The method of claim 21, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. 27. The method of claim 21, wherein
the plurality of cores are located within a single multi-core processor. 28. A computer hardware system, comprising:
a plurality of cores; a primary processor; a core manager, wherein the core manager is configured to perform:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function;
preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned;
receiving, from the primary processor, a request to offload a selected function;
selecting, from a service pool associated with the selected function, a soft co-processor; and
assigning the selected co-processor to perform the selected function. 29. The system of claim 28, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 30. The system of claim 28, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 31. The system of claim 28, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 32. The system of claim 31, wherein the core manager is further configured to perform:
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 33. The system of claim 28, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. 34. The system of claim 28, wherein
the plurality of cores are located within a single multi-core processor. 35. A computer program product, comprising
a computer usable storage medium having stored therein computer usable program code for allocating a plurality of cores in a multi-core processing environment, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function;
preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned;
receiving, from a primary processor, a request to offload a selected function;
selecting, from a service pool associated with the selected function, a soft co-processor; and
assigning the selected co-processor to perform the selected function, wherein the computer usable storage medium is not a transitory, propagating signal per se. 36. The computer program product of claim 35, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 37. The computer program product of claim 35, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 38. The computer program product of claim 35, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 39. The computer program product of claim 38, wherein the computer usable program code further causes the computer hardware system to perform:
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 40. The computer program product of claim 35, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. | A method of distributing functions among a plurality of cores in a multi-core processing environment can include organizing cores of the multi-core processing environment into a plurality of different service pools. Each of the plurality of service pools can be associated with at least one function and have at least one core executing at least one soft co-processor that performs the associated function. The method further can include, responsive to a request from a primary processor to offload a selected function, selecting an available soft co-processor from a service pool associated with the selected function and assigning the selected function to the selected soft co-processor. The method also can include marking the selected soft co-processor as busy and, responsive to receiving an indication from the soft co-processor that processing of the selected function has completed, marking the selected soft co-processor as available.1-20. (canceled) 21. A method of allocating a plurality of cores in a multi-core processing environment, comprising:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function; preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned; receiving, from a primary processor, a request to offload a selected function; selecting, from a service pool associated with the selected function, a soft co-processor; and assigning the selected co-processor to perform the selected function. 22. The method of claim 21, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 23. The method of claim 21, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 24. The method of claim 21, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 25. The method of claim 24, further comprising
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 26. The method of claim 21, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. 27. The method of claim 21, wherein
the plurality of cores are located within a single multi-core processor. 28. A computer hardware system, comprising:
a plurality of cores; a primary processor; a core manager, wherein the core manager is configured to perform:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function;
preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned;
receiving, from the primary processor, a request to offload a selected function;
selecting, from a service pool associated with the selected function, a soft co-processor; and
assigning the selected co-processor to perform the selected function. 29. The system of claim 28, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 30. The system of claim 28, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 31. The system of claim 28, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 32. The system of claim 31, wherein the core manager is further configured to perform:
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 33. The system of claim 28, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. 34. The system of claim 28, wherein
the plurality of cores are located within a single multi-core processor. 35. A computer program product, comprising
a computer usable storage medium having stored therein computer usable program code for allocating a plurality of cores in a multi-core processing environment, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
allocating, dynamically, the plurality of cores into a plurality of different service pools, each of the plurality of service pools corresponding to a particular function;
preloading, into each of the plurality of cores, a soft co-processor corresponding to a particular function associated with a particular service pool to which a particular core is assigned;
receiving, from a primary processor, a request to offload a selected function;
selecting, from a service pool associated with the selected function, a soft co-processor; and
assigning the selected co-processor to perform the selected function, wherein the computer usable storage medium is not a transitory, propagating signal per se. 36. The computer program product of claim 35, wherein
more than one single core, from the plurality of cores, is assigned to one of the plurality of different services pools, and each of the more than one single core are loaded with an identical soft co-processor corresponding to a particular function associated with the one of the plurality of different service pools to which the more than one single core are assigned. 37. The computer program product of claim 35, wherein
the selected soft co-processor is marked as busy until the selected function is completed. 38. The computer program product of claim 35, wherein
a free core pool of the plurality of different service pools includes an allocated core into which a soft co-processor has not been loaded. 39. The computer program product of claim 38, wherein the computer usable program code further causes the computer hardware system to perform:
reallocating the core allocated to the free core pool to another of the plurality of different service pools. 40. The computer program product of claim 35, wherein
the plurality of cores are dynamically allocated based upon usage of soft co-processors loaded into the plurality of cores. | 2,100 |
5,067 | 13,842,252 | 2,174 | A method includes displaying, in a single story-mode presentation on a user interface, information on events occurring in and/or related to a business process managed by a business process management application. The single story-mode presentation includes a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line, and an event details section that contains information corresponding to the events displayed in the time map navigation section. | 1. An apparatus, comprising:
at least one processor; and a non-transitory computer-readable storage medium including instructions executable by the at least one processor, the instructions configured to implement, a user-interface of a business process management application,
the user-interface configured to display information on events occurring in and/or related to a business process managed by the business process management application, and the user-interface further configured to visually display the information on the events occurring in and/or related to the business process in a single story-mode presentation. 2. The apparatus of claim 1, wherein the single story-mode presentation includes a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line. 3. The apparatus of claim 2, wherein the time map navigation section that displays a time map of events relevant to a second business task or object of the business process along a second time line parallel to the first time line. 4. The apparatus of claim 2, wherein the single story-mode presentation includes an event details section that contains information corresponding to the events displayed in the time map navigation section of the single story-mode presentation. 5. The apparatus of claim 4, wherein the information contained in the event details section of the single story-mode presentation includes narrative descriptions including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions. 6. The apparatus of claim 1, wherein the events occurring in and/or related to a business process are in event categories, and wherein the events displayed the single story-mode presentation are visually highlighted by event category. 7. The apparatus of claim 1, wherein the single story-mode presentation includes controls or functions that enable a user to search for and/or filter events that are displayed in the single story-mode presentation. 8. The apparatus of claim 1, wherein the single story-mode presentation includes controls or functions that enable a user to perform actions including one or more of commenting on a post and updating specific event data. 9. The apparatus of claim 1, wherein the business application is an Information Technology Services Management (ITSM) system application, and wherein the user-interface is configured to visually display the information on the events occurring in and/or related to processing an IT service ticket in the single story-mode presentation. 10. The apparatus of claim 9, wherein the single story-mode presentation includes a time map navigation section that displays a time map of events relevant to processing the IT service ticket along a first time line. 11. The apparatus of claim 9, wherein the single story-mode presentation for the IT service ticket is abstracted from one or more of information gathered from work notes and activity logs, information gathered from system events and audits, key business events that may have occurred before and during a life cycle of the ticket, notifications of both internal and external events and information gathered from other applications and/or external systems. 12. The apparatus of claim 1, wherein the single story-mode presentation is designed to abstract information independent of backend implementation details of the business application regarding sourcing of the information. 13. The apparatus of claim 1, wherein the business application is an Information Technology Services Management (ITSM) system application, wherein the single story-mode presentation overlays a forms-based UI associated with the ITSM system application, and wherein the forms-based UI is configured to visually display an IT service ticket having a story-mode control or function that can be activated or switched by a user to display the information on the events occurring in and/or related to processing the IT service ticket in the single story-mode presentation. 14. A method for displaying information on events occurring in and/or related to a business process managed by a business process management application, the method comprising:
displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface including:
displaying a time map of events relevant to a first business task or object of the business process along a first time line in a time map navigation section of the single story-mode presentation on the user interface; and
displaying information corresponding to the events displayed in the time map navigation section of the single story-mode presentation in an event details section of the single story-mode presentation on the user interface. 15. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in the single story-mode presentation on the user interface includes:
displaying narrative descriptions of the events including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions. 16. The method of claim 14, wherein the events occurring in and/or related to a business process are in event categories, and wherein the method includes visually highlighting the events displayed in the single story-mode presentation by event category. 17. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface includes:
displaying, in the time map navigation section, a time map of events relevant to a second business task or object of the business process along a second time line parallel to the first time line. 18. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface includes abstracting the information to be displayed independent of backend implementation details of the business process management application regarding sourcing of the information. 19. A non-transitory computer-readable medium storing instructions for displaying information on events occurring in and/or related to a business process managed by a business process management application, the instructions when executed by one or more processors:
displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface, the single story-mode presentation including:
a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line; and
an event details section that contains information corresponding to the events displayed in the time map navigation section of the single story-mode presentation. 20. The non-transitory computer-readable medium of claim 19, wherein the instructions when executed by one or more processors:
display in a single story-mode presentation on a user interface includes displaying narrative descriptions of the events including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions; and visually highlight the events displayed in the single story-mode presentation by event category. | A method includes displaying, in a single story-mode presentation on a user interface, information on events occurring in and/or related to a business process managed by a business process management application. The single story-mode presentation includes a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line, and an event details section that contains information corresponding to the events displayed in the time map navigation section.1. An apparatus, comprising:
at least one processor; and a non-transitory computer-readable storage medium including instructions executable by the at least one processor, the instructions configured to implement, a user-interface of a business process management application,
the user-interface configured to display information on events occurring in and/or related to a business process managed by the business process management application, and the user-interface further configured to visually display the information on the events occurring in and/or related to the business process in a single story-mode presentation. 2. The apparatus of claim 1, wherein the single story-mode presentation includes a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line. 3. The apparatus of claim 2, wherein the time map navigation section that displays a time map of events relevant to a second business task or object of the business process along a second time line parallel to the first time line. 4. The apparatus of claim 2, wherein the single story-mode presentation includes an event details section that contains information corresponding to the events displayed in the time map navigation section of the single story-mode presentation. 5. The apparatus of claim 4, wherein the information contained in the event details section of the single story-mode presentation includes narrative descriptions including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions. 6. The apparatus of claim 1, wherein the events occurring in and/or related to a business process are in event categories, and wherein the events displayed the single story-mode presentation are visually highlighted by event category. 7. The apparatus of claim 1, wherein the single story-mode presentation includes controls or functions that enable a user to search for and/or filter events that are displayed in the single story-mode presentation. 8. The apparatus of claim 1, wherein the single story-mode presentation includes controls or functions that enable a user to perform actions including one or more of commenting on a post and updating specific event data. 9. The apparatus of claim 1, wherein the business application is an Information Technology Services Management (ITSM) system application, and wherein the user-interface is configured to visually display the information on the events occurring in and/or related to processing an IT service ticket in the single story-mode presentation. 10. The apparatus of claim 9, wherein the single story-mode presentation includes a time map navigation section that displays a time map of events relevant to processing the IT service ticket along a first time line. 11. The apparatus of claim 9, wherein the single story-mode presentation for the IT service ticket is abstracted from one or more of information gathered from work notes and activity logs, information gathered from system events and audits, key business events that may have occurred before and during a life cycle of the ticket, notifications of both internal and external events and information gathered from other applications and/or external systems. 12. The apparatus of claim 1, wherein the single story-mode presentation is designed to abstract information independent of backend implementation details of the business application regarding sourcing of the information. 13. The apparatus of claim 1, wherein the business application is an Information Technology Services Management (ITSM) system application, wherein the single story-mode presentation overlays a forms-based UI associated with the ITSM system application, and wherein the forms-based UI is configured to visually display an IT service ticket having a story-mode control or function that can be activated or switched by a user to display the information on the events occurring in and/or related to processing the IT service ticket in the single story-mode presentation. 14. A method for displaying information on events occurring in and/or related to a business process managed by a business process management application, the method comprising:
displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface including:
displaying a time map of events relevant to a first business task or object of the business process along a first time line in a time map navigation section of the single story-mode presentation on the user interface; and
displaying information corresponding to the events displayed in the time map navigation section of the single story-mode presentation in an event details section of the single story-mode presentation on the user interface. 15. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in the single story-mode presentation on the user interface includes:
displaying narrative descriptions of the events including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions. 16. The method of claim 14, wherein the events occurring in and/or related to a business process are in event categories, and wherein the method includes visually highlighting the events displayed in the single story-mode presentation by event category. 17. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface includes:
displaying, in the time map navigation section, a time map of events relevant to a second business task or object of the business process along a second time line parallel to the first time line. 18. The method of claim 14, wherein displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface includes abstracting the information to be displayed independent of backend implementation details of the business process management application regarding sourcing of the information. 19. A non-transitory computer-readable medium storing instructions for displaying information on events occurring in and/or related to a business process managed by a business process management application, the instructions when executed by one or more processors:
displaying the information on the events occurring in and/or related to the business process in a single story-mode presentation on a user interface, the single story-mode presentation including:
a time map navigation section that displays a time map of events relevant to a first business task or object of the business process along a first time line; and
an event details section that contains information corresponding to the events displayed in the time map navigation section of the single story-mode presentation. 20. The non-transitory computer-readable medium of claim 19, wherein the instructions when executed by one or more processors:
display in a single story-mode presentation on a user interface includes displaying narrative descriptions of the events including one or more of who, what, when, where, why, in what way, and/or by what means types of descriptions; and visually highlight the events displayed in the single story-mode presentation by event category. | 2,100 |
5,068 | 14,208,958 | 2,153 | A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue. | 1. A method of managing database logging, the method comprising:
receiving by a user task executing in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtaining a lock on the portion of the database; creating a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueuing the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and releasing the lock on the portion of the database after enqueuing the first log record to the queue. 2. The method of claim 1, comprising:
receiving by the user task a command to commit the data manipulation to the database; traversing, by the user task, the queue to write log records to the transaction log that are earlier in time than the first log record; and writing the first log record to the transaction log to commit the data manipulation to the database, by the user task. 3. The method of claim 2, wherein traversing the queue comprises:
identifying a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; accessing the second private log cache; and writing the second log record from the second private log cache to the transaction log. 4. The method of claim 3, wherein the second log record is stored in a block in the second private log cache, and wherein the method comprises:
after writing the second log record to the transaction log, marking the block in the second private log cache is being available for use. 5. The method of claim 1, wherein the first log record is stored in a block in the first private log cache. 6. The method of claim 5, wherein the first private log cache includes a plurality of blocks. 7. The method of claim 5, wherein the first private log cache includes four blocks. 8. The method of claim 1, wherein enqueuing the first log record in the queue is in response to at least one of the first private log cache becoming full or to commit a transaction being handled by the user task. 9. A system for managing database logging, the system comprising:
a processor; and a user task executing in a database server process and executable by the processor, the user task configured to:
receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system;
obtain a lock on the portion of the database;
create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database;
enqueue the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and
release the lock on the portion of the database after enqueuing the first log record to the queue. 10. The system of claim 9, wherein the user task is configured to:
receive a command to commit the data manipulation to the database; traverse the queue to write log records to the transaction log that are earlier in time than the first log record; and write the first log record to the transaction log to commit the data manipulation to the database. 11. The system of claim 10, wherein to traverse the queue, the user task is configured to:
identify a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; access the second private log cache; and write the second log record from the second private log cache to the transaction log. 12. The system of claim 11, wherein the second log record is stored in a block in the second private log cache, and wherein the user task is configured to:
after writing the second log record to the transaction log, mark the block in the second private log cache is being available for use. 13. The system of claim 9, wherein the first log record is stored in a block in the first private log cache. 14. The system of claim 13, wherein the first private log cache includes a plurality of blocks. 15. The system of claim 13, wherein the first private log cache includes four blocks. 16. The system of claim 9, wherein to enqueue the first log record, the user task is to enqueue the first log record in the queue is in response to at least one of the first private log cache becoming full or to commit a transaction being handled by the user task. 17. 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 operations comprising:
receiving by a user task executing in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtaining a lock on the portion of the database; creating a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueuing the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and release the lock on the portion of the database after enqueuing the first log record to the queue. 18. The non-transitory machine-readable storage medium of claim 17, comprising instructions, which when implemented by the one or more machines, cause the one or more machines to perform operations comprising:
receiving by the user task a command to commit the data manipulation to the database; traversing, by the user task, the queue to write log records to the transaction log that are earlier in time than the first log record; and write the first log record to the transaction log to commit the data manipulation to the database, by the user task. 19. The non-transitory machine-readable storage medium of claim 18, wherein the instructions to traverse the queue comprise instructions to perform operations comprising:
identifying a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; accessing the second private log cache; and writing the second log record from the second private log cache to the transaction log. 20. The non-transitory machine-readable storage medium of claim 19, wherein the second log record is stored in a block in the second private log cache, and comprising instructions, which when implemented by the one or more machines, cause the one or more machines to perform operations comprising:
after writing the second log record to the transaction log, marking the block in the second private log cache is being available for use. | A system for managing database logging, the comprises a processor; and a user task executing in a database server process and executable by the processor, the user task to: receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtain a lock on the portion of the database; create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueue the first log record to a queue; and release the lock on the portion of the database after copying the first log record to the queue.1. A method of managing database logging, the method comprising:
receiving by a user task executing in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtaining a lock on the portion of the database; creating a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueuing the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and releasing the lock on the portion of the database after enqueuing the first log record to the queue. 2. The method of claim 1, comprising:
receiving by the user task a command to commit the data manipulation to the database; traversing, by the user task, the queue to write log records to the transaction log that are earlier in time than the first log record; and writing the first log record to the transaction log to commit the data manipulation to the database, by the user task. 3. The method of claim 2, wherein traversing the queue comprises:
identifying a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; accessing the second private log cache; and writing the second log record from the second private log cache to the transaction log. 4. The method of claim 3, wherein the second log record is stored in a block in the second private log cache, and wherein the method comprises:
after writing the second log record to the transaction log, marking the block in the second private log cache is being available for use. 5. The method of claim 1, wherein the first log record is stored in a block in the first private log cache. 6. The method of claim 5, wherein the first private log cache includes a plurality of blocks. 7. The method of claim 5, wherein the first private log cache includes four blocks. 8. The method of claim 1, wherein enqueuing the first log record in the queue is in response to at least one of the first private log cache becoming full or to commit a transaction being handled by the user task. 9. A system for managing database logging, the system comprising:
a processor; and a user task executing in a database server process and executable by the processor, the user task configured to:
receive in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system;
obtain a lock on the portion of the database;
create a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database;
enqueue the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and
release the lock on the portion of the database after enqueuing the first log record to the queue. 10. The system of claim 9, wherein the user task is configured to:
receive a command to commit the data manipulation to the database; traverse the queue to write log records to the transaction log that are earlier in time than the first log record; and write the first log record to the transaction log to commit the data manipulation to the database. 11. The system of claim 10, wherein to traverse the queue, the user task is configured to:
identify a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; access the second private log cache; and write the second log record from the second private log cache to the transaction log. 12. The system of claim 11, wherein the second log record is stored in a block in the second private log cache, and wherein the user task is configured to:
after writing the second log record to the transaction log, mark the block in the second private log cache is being available for use. 13. The system of claim 9, wherein the first log record is stored in a block in the first private log cache. 14. The system of claim 13, wherein the first private log cache includes a plurality of blocks. 15. The system of claim 13, wherein the first private log cache includes four blocks. 16. The system of claim 9, wherein to enqueue the first log record, the user task is to enqueue the first log record in the queue is in response to at least one of the first private log cache becoming full or to commit a transaction being handled by the user task. 17. 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 operations comprising:
receiving by a user task executing in a database management system on a database server, a command to manipulate a portion of a database managed by the database management system; obtaining a lock on the portion of the database; creating a first log record in a first private log cache associated with the user task, the first log record recording a data manipulation to the portion of the database; enqueuing the first log record in a queue, the queue shared among a plurality of tasks executing in the database management system and the queue configured to store references to log records from one or more transactions of the plurality of tasks before such log records are written to a transaction log; and release the lock on the portion of the database after enqueuing the first log record to the queue. 18. The non-transitory machine-readable storage medium of claim 17, comprising instructions, which when implemented by the one or more machines, cause the one or more machines to perform operations comprising:
receiving by the user task a command to commit the data manipulation to the database; traversing, by the user task, the queue to write log records to the transaction log that are earlier in time than the first log record; and write the first log record to the transaction log to commit the data manipulation to the database, by the user task. 19. The non-transitory machine-readable storage medium of claim 18, wherein the instructions to traverse the queue comprise instructions to perform operations comprising:
identifying a second private log cache associated with a second log record, the second log record having occurred earlier in time than the first log record; accessing the second private log cache; and writing the second log record from the second private log cache to the transaction log. 20. The non-transitory machine-readable storage medium of claim 19, wherein the second log record is stored in a block in the second private log cache, and comprising instructions, which when implemented by the one or more machines, cause the one or more machines to perform operations comprising:
after writing the second log record to the transaction log, marking the block in the second private log cache is being available for use. | 2,100 |
5,069 | 13,876,377 | 2,145 | The disclosed methods and systems are related to a navigation of user interfaces that is vector based. Vector based navigation combines the efficiency of orthogonal direction navigation (up/down/left/right) with the flexibility of pointer-based (e.g. mouse/touch-pad) navigation. User interface elements can be arranged arbitrarily in 2D (or 3D) space and described in term of vector relationships from the currently active UI element. Directional gestures coming from control devices such as a track-ball, touch-pad, or gyroscopic remote can be translated into vector movements to affect navigation between UI elements. | 1. A method for navigating a user interface comprising:
expressing the orientation of at least one element of the user interface and at least one neighbor as vector information; receiving movement information input for navigating the user interface; translating the movement information into vector information; and mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor. 2. The method of claim 1, further comprising the step of:
displaying a user interface comprising multiple elements for a user to navigate between. 3. The method of claim 2, further comprising the step of:
updating the displayed user interface to reflect the received movement information mapped to the orientation of the at least one elements and at least one neighbor. 4. The method of claim 1, wherein the vector information comprises angle and magnitude components. 5. The method of claim 4, wherein the vector information expressing the orientation of at least one element and at least one neighbor further comprises an acceptance angle and a magnitude threshold. 6. The method of claim 1, wherein the movement information input is received from a pointer-based control device. 7. The method of claim 1, wherein the orientation of multiple elements and their neighbors are expressed. 8. The method of claims 1, wherein the step of mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor comprises:
determining the active element in the user interface; determining if the angle component of the translated vector information is within an acceptance angle of the vector information expressing the orientation of the active element and at least one neighbor; determining if the magnitude component of the translated vector information meets the magnitude threshold of the vector information expressing the orientation of the active element and at least one neighbor if the angle and magnitude components of the translated vector information are within the acceptance angel and magnitude threshold, making the neighbor the new active element. 9. A system allowing for the navigation of a user interface including an electronic device comprising:
an output interface configured to output a user interface; an input interface configured to receive movement information for navigating the user interface a processor configured to: express the orientation of at least element of the user interface and its neighbor as vector information, translate the received movement information into vector information; and map the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor; and storage configured to store the vector information. 10. The system of claim 9, further comprising a display for displaying the user interface outputted by the output interface. 11. The media system of claim 10, wherein the display is part of the electronic device. 12. The media system of claim 9, further comprising a control device configured to generate the movement information to be received by the input interface. 13. The media system of claim 12, wherein the control device is part of the electronic device. 14. A computer program product comprising a computer useable medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform method steps including:
expressing the orientation of at least element of the user interface and its neighbor as vector information; receiving movement information input for navigating the user interface; translating the movement information into vector information; and mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor. | The disclosed methods and systems are related to a navigation of user interfaces that is vector based. Vector based navigation combines the efficiency of orthogonal direction navigation (up/down/left/right) with the flexibility of pointer-based (e.g. mouse/touch-pad) navigation. User interface elements can be arranged arbitrarily in 2D (or 3D) space and described in term of vector relationships from the currently active UI element. Directional gestures coming from control devices such as a track-ball, touch-pad, or gyroscopic remote can be translated into vector movements to affect navigation between UI elements.1. A method for navigating a user interface comprising:
expressing the orientation of at least one element of the user interface and at least one neighbor as vector information; receiving movement information input for navigating the user interface; translating the movement information into vector information; and mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor. 2. The method of claim 1, further comprising the step of:
displaying a user interface comprising multiple elements for a user to navigate between. 3. The method of claim 2, further comprising the step of:
updating the displayed user interface to reflect the received movement information mapped to the orientation of the at least one elements and at least one neighbor. 4. The method of claim 1, wherein the vector information comprises angle and magnitude components. 5. The method of claim 4, wherein the vector information expressing the orientation of at least one element and at least one neighbor further comprises an acceptance angle and a magnitude threshold. 6. The method of claim 1, wherein the movement information input is received from a pointer-based control device. 7. The method of claim 1, wherein the orientation of multiple elements and their neighbors are expressed. 8. The method of claims 1, wherein the step of mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor comprises:
determining the active element in the user interface; determining if the angle component of the translated vector information is within an acceptance angle of the vector information expressing the orientation of the active element and at least one neighbor; determining if the magnitude component of the translated vector information meets the magnitude threshold of the vector information expressing the orientation of the active element and at least one neighbor if the angle and magnitude components of the translated vector information are within the acceptance angel and magnitude threshold, making the neighbor the new active element. 9. A system allowing for the navigation of a user interface including an electronic device comprising:
an output interface configured to output a user interface; an input interface configured to receive movement information for navigating the user interface a processor configured to: express the orientation of at least element of the user interface and its neighbor as vector information, translate the received movement information into vector information; and map the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor; and storage configured to store the vector information. 10. The system of claim 9, further comprising a display for displaying the user interface outputted by the output interface. 11. The media system of claim 10, wherein the display is part of the electronic device. 12. The media system of claim 9, further comprising a control device configured to generate the movement information to be received by the input interface. 13. The media system of claim 12, wherein the control device is part of the electronic device. 14. A computer program product comprising a computer useable medium having a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform method steps including:
expressing the orientation of at least element of the user interface and its neighbor as vector information; receiving movement information input for navigating the user interface; translating the movement information into vector information; and mapping the vector information translated from the received movement information to the vector information expressing the orientation of the at least one element and at least one neighbor. | 2,100 |
5,070 | 14,798,216 | 2,158 | A computing device includes a touch-sensitive area that is arranged and configured to receive one or more gestures, and a memory that is arranged and configured to store one or more device gestures, where the stored device gestures correspond to a selection of one or more remote devices and a processor that is operably coupled to the touch sensitive area and the memory. The processor is arranged and configured to compare the gestures received in the touch sensitive area to the stored device gestures, determine a selected remote device based on the comparison, and initiate contact with the selected remote device. | 1. A computing device, comprising:
a touch-sensitive input device configured to receive gesture input; a memory configured to store a gesture pattern associated with a particular remote device, the particular remote device in wireless communication with the computing device; a communication interface to wirelessly communicate between the computing device and the particular remote device; and a processor operably coupled to the touch-sensitive input device, the memory, and the communication interface, the processor configured to:
determine, based on a gesture input and the gesture pattern, a selection of the particular remote device; and
output, to the communication interface, a wake-up signal configured to cause the particular remote device to transition to an active state. 2. The computing device of claim 1, wherein the memory stores a configurable period of time and the gesture pattern corresponds to multiple touches received within the configurable period of time. 3. The computing device of claim 1, wherein the gesture pattern corresponds to a plurality of simultaneous touches. 4. The computing device of claim 1, wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and the gesture pattern corresponds to multiple simultaneous touches received at two or more touch-sensitive areas from the plurality of different touch-sensitive areas. 5. The computing device of claim 1, further comprising:
a display operably coupled to the processor;
wherein the processor is further configured to:
output, for display on the display, a display screen for controlling the particular remote device. 6. The computing device of claim 1, wherein the gesture pattern associated with the particular remote device is customized by a user. 7. The computing device of claim 1, wherein the gesture pattern associated with the particular remote device is configured by a user. 8. The computing device of claim 1, wherein the processor is further configured to:
output, to the communication interface, an unlock signal configured to cause the particular remote device to unlock for remote access by a user of the computing device. 9. A method comprising:
receiving, by a processor, an indication of one or more gestures received at a touch-sensitive input device associated with a computing device; determining, by the processor and based on a gesture pattern stored in a memory, a selection-of a remote device in wireless communication with the computing device, wherein the selection corresponds to the one or more gestures; and outputting, to the remote device, a wake-up signal configured to cause the remote device to transition to an active state. 10. The method of claim 9 wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and
the gesture pattern corresponds to multiple simultaneous touches received at two or more of the plurality different touch-sensitive areas and is uniquely associated with the remote device. 11. The method of claim 9 further comprising:
outputting, for display on a display associated with the computing device, a custom display screen for controlling the remote device. 12. The method of claim 9, wherein the gesture pattern associated with the remote device is configured by a user. 13. The method of claim 9 further comprising:
after outputting the wake-up signal, outputting an unlock signal to the remote device configured to cause the remote device to unlock for remote access by a user of the computing device. 14. A computing device, comprising:
a touch-sensitive input device configured to receive gesture input; a memory configured to store a gesture pattern associated with a particular remote device, the particular remote device in wireless communication with the computing device; a communication interface to wirelessly communicate between the computing device and the particular remote device; and a processor operably coupled to the touch-sensitive input device, the memory, and the communication interface, the processor configured to:
determine, based on a gesture input and the gesture pattern, a selection of the particular remote device; and
output, to the communication interface, an unlock signal configured to cause the particular remote device to unlock for remote access by a user of the computing device. 15. The computing device of claim 14, wherein the memory stores a configurable period of time and the gesture pattern corresponds to multiple touches received within the configurable period of time. 16. The computing device of claim 14, wherein the gesture pattern corresponds to a plurality of simultaneous touches. 17. The computing device of claim 14, wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and the gesture pattern corresponds to multiple simultaneous touches received at two or more touch-sensitive areas from the plurality of different touch-sensitive areas. 18. The computing device of claim 14, further comprising:
a display coupled to the processor;
wherein the processor is further configured to:
output, for display on the display, a display screen for controlling the particular remote device. 19. The computing device of claim 14, wherein the gesture pattern associated with the particular remote device is configured by the user. 20. The computing device of claim 14, wherein the processor is further configured to:
output, to the communication interface, a wake-up signal configured to cause the particular remote device to transition to an active state. | A computing device includes a touch-sensitive area that is arranged and configured to receive one or more gestures, and a memory that is arranged and configured to store one or more device gestures, where the stored device gestures correspond to a selection of one or more remote devices and a processor that is operably coupled to the touch sensitive area and the memory. The processor is arranged and configured to compare the gestures received in the touch sensitive area to the stored device gestures, determine a selected remote device based on the comparison, and initiate contact with the selected remote device.1. A computing device, comprising:
a touch-sensitive input device configured to receive gesture input; a memory configured to store a gesture pattern associated with a particular remote device, the particular remote device in wireless communication with the computing device; a communication interface to wirelessly communicate between the computing device and the particular remote device; and a processor operably coupled to the touch-sensitive input device, the memory, and the communication interface, the processor configured to:
determine, based on a gesture input and the gesture pattern, a selection of the particular remote device; and
output, to the communication interface, a wake-up signal configured to cause the particular remote device to transition to an active state. 2. The computing device of claim 1, wherein the memory stores a configurable period of time and the gesture pattern corresponds to multiple touches received within the configurable period of time. 3. The computing device of claim 1, wherein the gesture pattern corresponds to a plurality of simultaneous touches. 4. The computing device of claim 1, wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and the gesture pattern corresponds to multiple simultaneous touches received at two or more touch-sensitive areas from the plurality of different touch-sensitive areas. 5. The computing device of claim 1, further comprising:
a display operably coupled to the processor;
wherein the processor is further configured to:
output, for display on the display, a display screen for controlling the particular remote device. 6. The computing device of claim 1, wherein the gesture pattern associated with the particular remote device is customized by a user. 7. The computing device of claim 1, wherein the gesture pattern associated with the particular remote device is configured by a user. 8. The computing device of claim 1, wherein the processor is further configured to:
output, to the communication interface, an unlock signal configured to cause the particular remote device to unlock for remote access by a user of the computing device. 9. A method comprising:
receiving, by a processor, an indication of one or more gestures received at a touch-sensitive input device associated with a computing device; determining, by the processor and based on a gesture pattern stored in a memory, a selection-of a remote device in wireless communication with the computing device, wherein the selection corresponds to the one or more gestures; and outputting, to the remote device, a wake-up signal configured to cause the remote device to transition to an active state. 10. The method of claim 9 wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and
the gesture pattern corresponds to multiple simultaneous touches received at two or more of the plurality different touch-sensitive areas and is uniquely associated with the remote device. 11. The method of claim 9 further comprising:
outputting, for display on a display associated with the computing device, a custom display screen for controlling the remote device. 12. The method of claim 9, wherein the gesture pattern associated with the remote device is configured by a user. 13. The method of claim 9 further comprising:
after outputting the wake-up signal, outputting an unlock signal to the remote device configured to cause the remote device to unlock for remote access by a user of the computing device. 14. A computing device, comprising:
a touch-sensitive input device configured to receive gesture input; a memory configured to store a gesture pattern associated with a particular remote device, the particular remote device in wireless communication with the computing device; a communication interface to wirelessly communicate between the computing device and the particular remote device; and a processor operably coupled to the touch-sensitive input device, the memory, and the communication interface, the processor configured to:
determine, based on a gesture input and the gesture pattern, a selection of the particular remote device; and
output, to the communication interface, an unlock signal configured to cause the particular remote device to unlock for remote access by a user of the computing device. 15. The computing device of claim 14, wherein the memory stores a configurable period of time and the gesture pattern corresponds to multiple touches received within the configurable period of time. 16. The computing device of claim 14, wherein the gesture pattern corresponds to a plurality of simultaneous touches. 17. The computing device of claim 14, wherein:
the touch-sensitive input device comprises a plurality of different touch-sensitive areas; and the gesture pattern corresponds to multiple simultaneous touches received at two or more touch-sensitive areas from the plurality of different touch-sensitive areas. 18. The computing device of claim 14, further comprising:
a display coupled to the processor;
wherein the processor is further configured to:
output, for display on the display, a display screen for controlling the particular remote device. 19. The computing device of claim 14, wherein the gesture pattern associated with the particular remote device is configured by the user. 20. The computing device of claim 14, wherein the processor is further configured to:
output, to the communication interface, a wake-up signal configured to cause the particular remote device to transition to an active state. | 2,100 |
5,071 | 15,582,670 | 2,167 | Embodiments are directed towards real time display of event records and extracted values based on at least one extraction rule, such as a regular expression. A user interface may be employed to enable a user to have an extraction rule automatically generate and/or to manually enter an extraction rule. The user may be enabled to manually edit a previously provided extraction rule, which may result in real time display of updated extracted values. The extraction rule may be utilized to extract values from each of a plurality of records, including event records of unstructured machine data. Statistics may be determined for each unique extracted value, and may be displayed to the user in real time. The user interface may also enable the user to select at least one unique extracted value to display those event records that include an extracted value that matches the selected value. | 1. A computer-implemented method, comprising:
receiving raw machine data; generating, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data; associating a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; storing the set of events in a data store such that they are searchable at least by their associated times; causing display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; causing display of a subset of events of the set of events; emphasizing in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receiving input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modifying the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modifying the displayed given event to emphasize the different value for the field for the given event. 2. The method of claim 1, wherein the extraction rile includes a regular expression. 3. The method of claim 1, wherein the raw machine data includes log data. 4. The method of claim 1, further comprising displaying the modified extraction rule. 5. The method of claim 1, wherein the extraction rule is received from a user through manual keyboard input. 6. The method of claim 1, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. 7. The method of claim 1, further comprising modifying a second event in the displayed subset of events to emphasize a value that would be extracted for the field for the second event by applying the modified extraction rule to the second event. 8. The method of claim 1, further comprising:
receiving a label for the field corresponding to the extraction rule; and using the label to search for an event using the field. 9. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying one or more unique field values in the set of unique field values. 10. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values. 11. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values, wherein the statistic includes a count of events in which the unique field value appears as the value for the field or a percentage of events in which the unique field value appears as the value for the field. 12. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; receiving a selection of a unique field value in the set of unique field values; and displaying only events in the subset of events for which the extraction rule would extract the selected unique filed value when applied to the events. 13. A system comprising:
at least one network device, comprising:
a processor; and
a non-transitory computer-readable storage medium containing instructions configured to cause the processor to perform operations including:
receiving raw machine data; generating, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data; associating a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; storing the set of events in a data store such that they are searchable at least by their associated times; causing display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; causing display of a subset of events of the set of events; emphasizing in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receiving input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modifying the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modifying the displayed given event to emphasize the different value for the field for the given event. 14. The system of claim 13, wherein the extraction rile includes a regular expression. 15. The system of claim 13, wherein the raw machine data includes log data. 16. The system of claim 13, further comprising displaying the modified extraction rule. 17. The system of claim 13, wherein the extraction rule is received from a user through manual keyboard input. 18. The system of claim 13, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. 19. The system of claim 13, further comprising modifying a second event in the displayed subset of events to emphasize a value that would be extracted for the field for the second event by applying the modified extraction rule to the second event. 20. The system of claim 13, further comprising:
receiving a label for the field corresponding to the extraction rule; and using the label to search for an event using the field. 21. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying one or more unique field values in the set of unique field values. 22. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values. 23. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values, wherein the statistic includes a count of events in which the unique field value appears as the value for the field or a percentage of events in which the unique field value appears as the value for the field. 24. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; receiving a selection of a unique field value in the set of unique field values; and displaying only events in the subset of events for which the extraction rule would extract the selected unique filed value when applied to the events. 25. A computer-program product, tangibly embodied in a non-transitory machine-readable medium, including instructions configured to cause a data processing apparatus to:
receive raw machine data;
generate, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data;
associate a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; store the set of events in a data store such that they are searchable at least by their associated times; cause display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; cause display of a subset of events of the set of events; emphasize in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receive input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modify the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modify the displayed given event to emphasize the different value for the field for the given event. 26. The computer-program product of claim 25, wherein the extraction rile includes a regular expression. 27. The computer-program product of claim 25, wherein the raw machine data includes log data. 28. The computer-program product of claim 25, further comprising displaying the modified extraction rule. 29. The computer-program product of claim 25, wherein the extraction rule is received from a user through manual keyboard input. 30. The computer-program product of claim 25, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. | Embodiments are directed towards real time display of event records and extracted values based on at least one extraction rule, such as a regular expression. A user interface may be employed to enable a user to have an extraction rule automatically generate and/or to manually enter an extraction rule. The user may be enabled to manually edit a previously provided extraction rule, which may result in real time display of updated extracted values. The extraction rule may be utilized to extract values from each of a plurality of records, including event records of unstructured machine data. Statistics may be determined for each unique extracted value, and may be displayed to the user in real time. The user interface may also enable the user to select at least one unique extracted value to display those event records that include an extracted value that matches the selected value.1. A computer-implemented method, comprising:
receiving raw machine data; generating, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data; associating a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; storing the set of events in a data store such that they are searchable at least by their associated times; causing display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; causing display of a subset of events of the set of events; emphasizing in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receiving input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modifying the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modifying the displayed given event to emphasize the different value for the field for the given event. 2. The method of claim 1, wherein the extraction rile includes a regular expression. 3. The method of claim 1, wherein the raw machine data includes log data. 4. The method of claim 1, further comprising displaying the modified extraction rule. 5. The method of claim 1, wherein the extraction rule is received from a user through manual keyboard input. 6. The method of claim 1, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. 7. The method of claim 1, further comprising modifying a second event in the displayed subset of events to emphasize a value that would be extracted for the field for the second event by applying the modified extraction rule to the second event. 8. The method of claim 1, further comprising:
receiving a label for the field corresponding to the extraction rule; and using the label to search for an event using the field. 9. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying one or more unique field values in the set of unique field values. 10. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values. 11. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values, wherein the statistic includes a count of events in which the unique field value appears as the value for the field or a percentage of events in which the unique field value appears as the value for the field. 12. The method of claim 1, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; receiving a selection of a unique field value in the set of unique field values; and displaying only events in the subset of events for which the extraction rule would extract the selected unique filed value when applied to the events. 13. A system comprising:
at least one network device, comprising:
a processor; and
a non-transitory computer-readable storage medium containing instructions configured to cause the processor to perform operations including:
receiving raw machine data; generating, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data; associating a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; storing the set of events in a data store such that they are searchable at least by their associated times; causing display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; causing display of a subset of events of the set of events; emphasizing in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receiving input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modifying the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modifying the displayed given event to emphasize the different value for the field for the given event. 14. The system of claim 13, wherein the extraction rile includes a regular expression. 15. The system of claim 13, wherein the raw machine data includes log data. 16. The system of claim 13, further comprising displaying the modified extraction rule. 17. The system of claim 13, wherein the extraction rule is received from a user through manual keyboard input. 18. The system of claim 13, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. 19. The system of claim 13, further comprising modifying a second event in the displayed subset of events to emphasize a value that would be extracted for the field for the second event by applying the modified extraction rule to the second event. 20. The system of claim 13, further comprising:
receiving a label for the field corresponding to the extraction rule; and using the label to search for an event using the field. 21. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying one or more unique field values in the set of unique field values. 22. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values. 23. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; and displaying a statistic for one or more unique field values in the set of unique field values, wherein the statistic includes a count of events in which the unique field value appears as the value for the field or a percentage of events in which the unique field value appears as the value for the field. 24. The system of claim 13, further comprising:
identifying a set of unique field values that would be extracted for the field by applying the extraction rule to events in the set of events; receiving a selection of a unique field value in the set of unique field values; and displaying only events in the subset of events for which the extraction rule would extract the selected unique filed value when applied to the events. 25. A computer-program product, tangibly embodied in a non-transitory machine-readable medium, including instructions configured to cause a data processing apparatus to:
receive raw machine data;
generate, using one or more processors, a set of events, wherein each event in the set of events includes a portion of the raw machine data;
associate a time with each event in the set of events, the time for each event extracted from the raw machine data included in that event; store the set of events in a data store such that they are searchable at least by their associated times; cause display of an extraction rule, wherein the extraction rule specifies how to extract a value for a field from raw machine data included in an event; cause display of a subset of events of the set of events; emphasize in the displayed subset of events a value for the field that would be extracted from each of the events in the subset of events by applying the extraction rule; receive input indicating that the emphasized value in a given event in the subset of events should not be the value for the field for the given event; based on the input, automatically modify the extraction rule so that it would extract a different value as a value for the field for the given event when applied to the given event; and modify the displayed given event to emphasize the different value for the field for the given event. 26. The computer-program product of claim 25, wherein the extraction rile includes a regular expression. 27. The computer-program product of claim 25, wherein the raw machine data includes log data. 28. The computer-program product of claim 25, further comprising displaying the modified extraction rule. 29. The computer-program product of claim 25, wherein the extraction rule is received from a user through manual keyboard input. 30. The computer-program product of claim 25, wherein the extraction rule is automatically generated to extract as the value for the field for a displayed event text that a user has selected in the event. | 2,100 |
5,072 | 14,751,262 | 2,198 | As a memory usage optimization, a compiler identifies coroutines whose activation frames can be allocated on a caller's stack instead of allocating the frame on the heap. For example, when the compiler determines that a coroutine C's life cannot extend beyond the life of the routine R that first calls the coroutine C, the compiler generates code to allocate the activation frame for C on the stack of R, instead of generating code to allocate C's frame from heap memory. In some cases, as another optimization, code for coroutine C is also inlined with code for the routine R that calls C. Coroutine activation frame content variations and layout variations are also described. | 1. A method for implementing a resumable function, comprising:
a compiler determining at compile time whether the resumable function has a lifespan that will not extend beyond a call to the resumable function made by a caller in a computing system; when the compiler determines that the resumable function lifespan will not extend beyond the call, the compiler generating code which upon execution will allocate an activation frame of the resumable function from a local stack memory of the caller in the computing system; and when the compiler determines that the resumable function lifespan can extend beyond the call, the compiler generating code which upon execution will allocate the activation frame from a heap memory in the computing system. 2. The method of claim 1, further comprising the compiler generating code which upon execution places a resumption address in the activation frame, the resumption address being the address of a resumable portion of a function body of the resumable function. 3. The method of claim 1, further comprising the compiler generating code which upon execution sets a resumption index in the activation frame, the resumption index being an ordinal whose value distinguishes between a plurality of execution resumption points in a function body of the resumable function. 4. The method of claim 1, wherein the compiler determines an extent of the resumable function lifespan at least in part by using a static single assignment use-definition chain. 5. The method of claim 1, wherein the resumable function includes at least one of the following: a yield statement, an await expression. 6. The method of claim 1, wherein the compiler also inlines code of the resumable function in the caller of the resumable function. 7. The method of claim 1, wherein the compiler also generates code which upon execution initializes a promise data structure in the activation frame. 8. The method of claim 1, wherein the compiler includes a front end and a back end, the front end performs lexical analysis and parsing for a particular programming language, the back end converts output from the front end into tuples which include machine-independent opcodes and symbolic operands, and the front end identifies the following to the back end: (a) an initialization point of the resumable function, (b) at least one suspension point of the resumable function, (c) a resumption point for each suspension point, indicating where execution of the resumable function will resume after execution has been suspended at that suspension point. 9. The method of claim 8, wherein the compiler front end identifies resumable function initialization, suspension, and resumption points to the compiler back end using intrinsics. 10. A computer-readable storage medium configured with data and with instructions that upon execution by at least one processor in a compilation computing system will cause the at least one processor to perform a technical process for coroutine compilation, the process comprising:
determining at compile time whether a coroutine has a lifespan that will not extend beyond a call to the coroutine that will be made by a caller in a target computing system; when the coroutine lifespan will not extend beyond the call, generating code which upon execution by a processor in the target computing system allocates an activation frame of the coroutine from a local stack memory of the caller in the target computing system; when the coroutine lifespan can extend beyond the call, generating code which upon execution in the target computing system allocates the activation frame from a heap memory in the target computing system; and generating code which upon execution in the target computing system places a resumption address in the activation frame, the resumption address being the address of a resumable portion of the coroutine. 11. The computer-readable storage medium of claim 10, wherein the process further comprises generating code which upon execution in the target computing system initializes a promise data structure in the activation frame. 12. The computer-readable storage medium of claim 10, wherein the process further comprises at least one of the following:
generating code which upon execution in the target computing system verifies that a resumption address value specified in the activation frame is a valid value before passing control based on that resumption address value; generating code which upon execution in the target computing system verifies that a resumption index value specified in the activation frame is a valid value before passing control based on that resumption index value. 13. The computer-readable storage medium of claim 10, wherein the process determines an extent of the coroutine lifespan at least in part by using a static single assignment use-definition chain. 14. A computer system comprising:
a compilation processor; a memory in operable communication with the compilation processor; program source code residing in the memory, the program source code including a call to a coroutine by a caller; a static single assignment use-definition chain residing in the memory and based on a definition of the coroutine in the program source code and also based on at least one use of the coroutine in the program source code; a compiler residing in the memory and having coroutine compilation code, the coroutine compilation code interacting with the compilation processor and memory to perform, upon execution, a process which includes (a) determining with an analysis of the static single assignment use-definition chain whether the coroutine has a lifespan that will not extend beyond the call when the call is executed by a target processor, (b) when the coroutine lifespan will not extend beyond the call, the compilation processor generating code which upon execution by the target processor allocates an activation frame of the coroutine from a local stack memory of the caller, and (c) when the coroutine lifespan can extend beyond the call, the compilation processor generating code which upon execution by the target processor allocates the activation frame from a heap memory. 15. The system of claim 14, wherein the activation frame comprises a resumption index, namely, an ordinal whose value distinguishes between a plurality of execution resumption points in the coroutine. 16. The system of claim 14, wherein the activation frame comprises a promise portion which the target processor initialized in executing the code compiled from the program source code, and a platform-specific register save area initialized by a runtime. 17. The system of claim 14, further comprising at least a first coroutine piece and a second coroutine piece residing in the memory, the coroutine pieces delimited by an initial suspension point of the coroutine, the first coroutine piece including an initialization portion of the coroutine which the target processor executes up to the initial suspension point, the second coroutine piece including a resumption portion that the target processor executes after at least one suspension point of the coroutine. 18. The system of claim 14, wherein the coroutine compilation code identifies coroutine initialization, suspension, and resumption points using intrinsics in an intermediate language produced from the program source code. 19. The system of claim 14, further comprising compiled coroutine code which upon execution by one or more target processors allocates the activation frame of the coroutine from a local stack memory of the caller and executes at least a portion of the coroutine inline with the caller of the coroutine. 20. The system of claim 14, wherein the coroutine includes at least one of the following: a yield statement, an await expression. | As a memory usage optimization, a compiler identifies coroutines whose activation frames can be allocated on a caller's stack instead of allocating the frame on the heap. For example, when the compiler determines that a coroutine C's life cannot extend beyond the life of the routine R that first calls the coroutine C, the compiler generates code to allocate the activation frame for C on the stack of R, instead of generating code to allocate C's frame from heap memory. In some cases, as another optimization, code for coroutine C is also inlined with code for the routine R that calls C. Coroutine activation frame content variations and layout variations are also described.1. A method for implementing a resumable function, comprising:
a compiler determining at compile time whether the resumable function has a lifespan that will not extend beyond a call to the resumable function made by a caller in a computing system; when the compiler determines that the resumable function lifespan will not extend beyond the call, the compiler generating code which upon execution will allocate an activation frame of the resumable function from a local stack memory of the caller in the computing system; and when the compiler determines that the resumable function lifespan can extend beyond the call, the compiler generating code which upon execution will allocate the activation frame from a heap memory in the computing system. 2. The method of claim 1, further comprising the compiler generating code which upon execution places a resumption address in the activation frame, the resumption address being the address of a resumable portion of a function body of the resumable function. 3. The method of claim 1, further comprising the compiler generating code which upon execution sets a resumption index in the activation frame, the resumption index being an ordinal whose value distinguishes between a plurality of execution resumption points in a function body of the resumable function. 4. The method of claim 1, wherein the compiler determines an extent of the resumable function lifespan at least in part by using a static single assignment use-definition chain. 5. The method of claim 1, wherein the resumable function includes at least one of the following: a yield statement, an await expression. 6. The method of claim 1, wherein the compiler also inlines code of the resumable function in the caller of the resumable function. 7. The method of claim 1, wherein the compiler also generates code which upon execution initializes a promise data structure in the activation frame. 8. The method of claim 1, wherein the compiler includes a front end and a back end, the front end performs lexical analysis and parsing for a particular programming language, the back end converts output from the front end into tuples which include machine-independent opcodes and symbolic operands, and the front end identifies the following to the back end: (a) an initialization point of the resumable function, (b) at least one suspension point of the resumable function, (c) a resumption point for each suspension point, indicating where execution of the resumable function will resume after execution has been suspended at that suspension point. 9. The method of claim 8, wherein the compiler front end identifies resumable function initialization, suspension, and resumption points to the compiler back end using intrinsics. 10. A computer-readable storage medium configured with data and with instructions that upon execution by at least one processor in a compilation computing system will cause the at least one processor to perform a technical process for coroutine compilation, the process comprising:
determining at compile time whether a coroutine has a lifespan that will not extend beyond a call to the coroutine that will be made by a caller in a target computing system; when the coroutine lifespan will not extend beyond the call, generating code which upon execution by a processor in the target computing system allocates an activation frame of the coroutine from a local stack memory of the caller in the target computing system; when the coroutine lifespan can extend beyond the call, generating code which upon execution in the target computing system allocates the activation frame from a heap memory in the target computing system; and generating code which upon execution in the target computing system places a resumption address in the activation frame, the resumption address being the address of a resumable portion of the coroutine. 11. The computer-readable storage medium of claim 10, wherein the process further comprises generating code which upon execution in the target computing system initializes a promise data structure in the activation frame. 12. The computer-readable storage medium of claim 10, wherein the process further comprises at least one of the following:
generating code which upon execution in the target computing system verifies that a resumption address value specified in the activation frame is a valid value before passing control based on that resumption address value; generating code which upon execution in the target computing system verifies that a resumption index value specified in the activation frame is a valid value before passing control based on that resumption index value. 13. The computer-readable storage medium of claim 10, wherein the process determines an extent of the coroutine lifespan at least in part by using a static single assignment use-definition chain. 14. A computer system comprising:
a compilation processor; a memory in operable communication with the compilation processor; program source code residing in the memory, the program source code including a call to a coroutine by a caller; a static single assignment use-definition chain residing in the memory and based on a definition of the coroutine in the program source code and also based on at least one use of the coroutine in the program source code; a compiler residing in the memory and having coroutine compilation code, the coroutine compilation code interacting with the compilation processor and memory to perform, upon execution, a process which includes (a) determining with an analysis of the static single assignment use-definition chain whether the coroutine has a lifespan that will not extend beyond the call when the call is executed by a target processor, (b) when the coroutine lifespan will not extend beyond the call, the compilation processor generating code which upon execution by the target processor allocates an activation frame of the coroutine from a local stack memory of the caller, and (c) when the coroutine lifespan can extend beyond the call, the compilation processor generating code which upon execution by the target processor allocates the activation frame from a heap memory. 15. The system of claim 14, wherein the activation frame comprises a resumption index, namely, an ordinal whose value distinguishes between a plurality of execution resumption points in the coroutine. 16. The system of claim 14, wherein the activation frame comprises a promise portion which the target processor initialized in executing the code compiled from the program source code, and a platform-specific register save area initialized by a runtime. 17. The system of claim 14, further comprising at least a first coroutine piece and a second coroutine piece residing in the memory, the coroutine pieces delimited by an initial suspension point of the coroutine, the first coroutine piece including an initialization portion of the coroutine which the target processor executes up to the initial suspension point, the second coroutine piece including a resumption portion that the target processor executes after at least one suspension point of the coroutine. 18. The system of claim 14, wherein the coroutine compilation code identifies coroutine initialization, suspension, and resumption points using intrinsics in an intermediate language produced from the program source code. 19. The system of claim 14, further comprising compiled coroutine code which upon execution by one or more target processors allocates the activation frame of the coroutine from a local stack memory of the caller and executes at least a portion of the coroutine inline with the caller of the coroutine. 20. The system of claim 14, wherein the coroutine includes at least one of the following: a yield statement, an await expression. | 2,100 |
5,073 | 14,106,131 | 2,118 | Assessment of operational performance of an additive manufacturing apparatus is provided. Particle size images are obtained, in real-time during an additive manufacturing build process in which at least one structure is built by the additive manufacturing apparatus, the obtained images being of an area of a build platform on which the at least one structure is built. The obtained images are evaluated, and it is determined, based on the evaluating, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. Operational flaws include errors in the operation of the additive manufacturing apparatus and/or component thereof, as evidenced by, for instance, distortions or other errors in the structure(s) being built and/or materials being used. | 1. A method for assessment of operational performance of an additive manufacturing apparatus, the method comprising:
obtaining particle size images of an area of a build platform on which at least one structure is built, wherein the particle size images are acquired in real-time during an additive manufacturing build process in which the at least one structure is built by the additive manufacturing apparatus; evaluating, by a processor, the particle size images; and determining, based on the evaluating of the particle size images, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. 2. The method of claim 1, wherein the evaluating comprises performing image processing on the obtained images to detect an error indicative of occurrence of the operational flaw of the additive manufacturing apparatus or the design for the at least one structure. 3. The method of claim 1, wherein the determined operational flaw comprises a malfunction of the additive manufacturing apparatus indicative that maintenance of the additive manufacturing apparatus is necessary. 4. The method of claim 1, further comprising, responsive to determining that the operational flaw has occurred, performing one or more of the following: providing an alert to a user that the operational flaw has occurred, and halting the build process. 5. The method of claim 1, further comprising, responsive to determining that the operational flaw has occurred, modifying the build process, wherein the modifying disables (i) building at least a portion of a structure which is determined to exhibit the operational flaw or (ii) building at a location of the build platform at which the operational flaw is determined to be exhibited. 6. The method of claim 1, wherein the evaluating further comprises comparing one or more physical properties of the at least one structure as it is being built during the build process to a computer-aided design specification describing one or more target properties for the at least one structure, and wherein the determining comprises determining, based on the comparison, whether the at least one structure being built is accurate to the computer-aided design specification. 7. The method of claim 1, wherein the build process provides powder material comprising powder particles to the build platform and forms a powder bed on the build platform during a recoating procedure, wherein the obtained images comprise images of powder particles of the powder bed obtained after performing the recoating procedure, and wherein the evaluating evaluates quality of the powder bed to determine occurrence of the operational flaw. 8. The method of claim 7, wherein the evaluating identifies an area of the powder bed having a protrusion from the powder bed. 9. The method of claim 7, wherein the evaluating identifies a depression in an area of the powder bed indicative of insufficient powder being provided at the area of the powder bed. 10. The method of claim 1, wherein the build process exposes a powder bed of powder material to an energy source of the additive manufacturing apparatus to fuse together powder particles of the powder bed, wherein the obtained images comprise images of the powder bed obtained after exposing the powder bed to the energy source, and wherein the evaluating identifies an area of the powder bed having (i) excess powder material or (ii) powder material that was not properly exposed to the energy source. 11. The method of claim 10, wherein the area comprises a weld area of welded powder particles of the powder bed as a result of exposing the powder particles to the energy source. 12. The method of claim 1, wherein the method further comprises performing a root cause analysis for the operational flaw with the additive manufacturing apparatus or the design for the at least one structure. 13. The method of claim 1, further comprising:
performing low resolution imaging of the area of the build platform to obtain low resolution images of the area of the build platform; evaluating the obtained low resolution images to determine that a large scale issue with the additive manufacturing apparatus has occurred; obtaining the particle size images of the area of the build platform based on the evaluation of the obtained low resolution images; and evaluating the particle size images to determine the operational flaw. 14. A system for assessment of operational performance of an additive manufacturing apparatus, the system comprising:
one or more cameras comprising at least one high resolution imaging camera; a memory; and a processor in communication with the memory, wherein the system is configured to perform:
obtaining, in real-time during an additive manufacturing build process in which at least one structure is built by the additive manufacturing apparatus, particle size images of an area of a build platform on which the at least one structure is built, the particle size images obtained using the at least one high resolution imaging camera;
evaluating the obtained images; and
determining, based on the evaluating, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. 15. The system of claim 14, wherein at least one camera of the one or more cameras is a low resolution imaging camera. 16. The system of claim 14, wherein the at least one high resolution imaging camera is configured to obtain low resolution images and high resolution images. 17. The system of claim 14, wherein at least one camera of the one or more cameras is an internal camera disposed at least partially within a build chamber of the additive manufacturing apparatus. 18. The system of claim 14, wherein at least one camera of the one or more cameras is an internal camera disposed within an insulated chamber, the insulated chamber disposed at least partially within a build chamber of the additive manufacturing apparatus, and wherein the insulated chamber comprises a cooling component configured to control temperature of the at least one camera during operation thereof. 19. The system of claim 14, wherein at least one camera of the one or more cameras is an external camera disposed external to a build chamber of the additive manufacturing apparatus, wherein the at least one external camera images the area of the build platform through a door or window of the additive manufacturing apparatus. 20. A computer program product for assessment of operational performance of an additive manufacturing apparatus, the computer program product comprising:
a non-transitory computer readable storage medium readable by a processor and storing instructions for execution by the process to perform a method comprising:
obtaining particle size images of an area of a build platform on which at least one structure is built, wherein the particle size images are acquired in real-time during an additive manufacturing build process in which the at least one structure is built by the additive manufacturing apparatus;
evaluating the particle size images; and
determining, based on the evaluating of the particle size images, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. | Assessment of operational performance of an additive manufacturing apparatus is provided. Particle size images are obtained, in real-time during an additive manufacturing build process in which at least one structure is built by the additive manufacturing apparatus, the obtained images being of an area of a build platform on which the at least one structure is built. The obtained images are evaluated, and it is determined, based on the evaluating, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. Operational flaws include errors in the operation of the additive manufacturing apparatus and/or component thereof, as evidenced by, for instance, distortions or other errors in the structure(s) being built and/or materials being used.1. A method for assessment of operational performance of an additive manufacturing apparatus, the method comprising:
obtaining particle size images of an area of a build platform on which at least one structure is built, wherein the particle size images are acquired in real-time during an additive manufacturing build process in which the at least one structure is built by the additive manufacturing apparatus; evaluating, by a processor, the particle size images; and determining, based on the evaluating of the particle size images, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. 2. The method of claim 1, wherein the evaluating comprises performing image processing on the obtained images to detect an error indicative of occurrence of the operational flaw of the additive manufacturing apparatus or the design for the at least one structure. 3. The method of claim 1, wherein the determined operational flaw comprises a malfunction of the additive manufacturing apparatus indicative that maintenance of the additive manufacturing apparatus is necessary. 4. The method of claim 1, further comprising, responsive to determining that the operational flaw has occurred, performing one or more of the following: providing an alert to a user that the operational flaw has occurred, and halting the build process. 5. The method of claim 1, further comprising, responsive to determining that the operational flaw has occurred, modifying the build process, wherein the modifying disables (i) building at least a portion of a structure which is determined to exhibit the operational flaw or (ii) building at a location of the build platform at which the operational flaw is determined to be exhibited. 6. The method of claim 1, wherein the evaluating further comprises comparing one or more physical properties of the at least one structure as it is being built during the build process to a computer-aided design specification describing one or more target properties for the at least one structure, and wherein the determining comprises determining, based on the comparison, whether the at least one structure being built is accurate to the computer-aided design specification. 7. The method of claim 1, wherein the build process provides powder material comprising powder particles to the build platform and forms a powder bed on the build platform during a recoating procedure, wherein the obtained images comprise images of powder particles of the powder bed obtained after performing the recoating procedure, and wherein the evaluating evaluates quality of the powder bed to determine occurrence of the operational flaw. 8. The method of claim 7, wherein the evaluating identifies an area of the powder bed having a protrusion from the powder bed. 9. The method of claim 7, wherein the evaluating identifies a depression in an area of the powder bed indicative of insufficient powder being provided at the area of the powder bed. 10. The method of claim 1, wherein the build process exposes a powder bed of powder material to an energy source of the additive manufacturing apparatus to fuse together powder particles of the powder bed, wherein the obtained images comprise images of the powder bed obtained after exposing the powder bed to the energy source, and wherein the evaluating identifies an area of the powder bed having (i) excess powder material or (ii) powder material that was not properly exposed to the energy source. 11. The method of claim 10, wherein the area comprises a weld area of welded powder particles of the powder bed as a result of exposing the powder particles to the energy source. 12. The method of claim 1, wherein the method further comprises performing a root cause analysis for the operational flaw with the additive manufacturing apparatus or the design for the at least one structure. 13. The method of claim 1, further comprising:
performing low resolution imaging of the area of the build platform to obtain low resolution images of the area of the build platform; evaluating the obtained low resolution images to determine that a large scale issue with the additive manufacturing apparatus has occurred; obtaining the particle size images of the area of the build platform based on the evaluation of the obtained low resolution images; and evaluating the particle size images to determine the operational flaw. 14. A system for assessment of operational performance of an additive manufacturing apparatus, the system comprising:
one or more cameras comprising at least one high resolution imaging camera; a memory; and a processor in communication with the memory, wherein the system is configured to perform:
obtaining, in real-time during an additive manufacturing build process in which at least one structure is built by the additive manufacturing apparatus, particle size images of an area of a build platform on which the at least one structure is built, the particle size images obtained using the at least one high resolution imaging camera;
evaluating the obtained images; and
determining, based on the evaluating, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. 15. The system of claim 14, wherein at least one camera of the one or more cameras is a low resolution imaging camera. 16. The system of claim 14, wherein the at least one high resolution imaging camera is configured to obtain low resolution images and high resolution images. 17. The system of claim 14, wherein at least one camera of the one or more cameras is an internal camera disposed at least partially within a build chamber of the additive manufacturing apparatus. 18. The system of claim 14, wherein at least one camera of the one or more cameras is an internal camera disposed within an insulated chamber, the insulated chamber disposed at least partially within a build chamber of the additive manufacturing apparatus, and wherein the insulated chamber comprises a cooling component configured to control temperature of the at least one camera during operation thereof. 19. The system of claim 14, wherein at least one camera of the one or more cameras is an external camera disposed external to a build chamber of the additive manufacturing apparatus, wherein the at least one external camera images the area of the build platform through a door or window of the additive manufacturing apparatus. 20. A computer program product for assessment of operational performance of an additive manufacturing apparatus, the computer program product comprising:
a non-transitory computer readable storage medium readable by a processor and storing instructions for execution by the process to perform a method comprising:
obtaining particle size images of an area of a build platform on which at least one structure is built, wherein the particle size images are acquired in real-time during an additive manufacturing build process in which the at least one structure is built by the additive manufacturing apparatus;
evaluating the particle size images; and
determining, based on the evaluating of the particle size images, whether an operational flaw has occurred with the additive manufacturing apparatus or a design for the at least one structure. | 2,100 |
5,074 | 13,345,620 | 2,163 | A system includes a master node and worker nodes controlled by the master node. Each worker node stores 25 or more modular blocks of a distributed database, where each modular block has a size of 5 G bytes or less and has an associated log file. | 1. A system, comprising:
a master node; and a plurality of worker nodes controlled by the master node, wherein each worker node stores 25 or more modular blocks of a distributed database, wherein each modular block of the distributed database has a size of 5 G bytes or less and has an associated log file to record changes associated with the distributed database; wherein the master node and the plurality of worker nodes communicate over a distributed network utilizing standard protocols. 2. The system of claim 1 wherein the master node receives a database query and partitions the database query to run in parallel across the plurality of worker nodes. 3. The system of claim 1 wherein the master node collects statistics about data in the modular blocks. 4. The system of claim 3 wherein the master node uses the statistics to optimize a database query. 5. The system of claim 3 wherein the master node collects statistics selected from modular block location, size, associated log file and update time. 6. The system of claim 5 wherein the master node communicates with the plurality of worker nodes to update the statistics. 7. The system of claim 1 wherein the master node maintains availability information for the plurality of worker nodes. 8. The system of claim 1 wherein the master node maintains distribution information for the modular blocks across the plurality of worker nodes. 9. The system of claim 7 wherein the master node determines the placement of new modular blocks using the availability information for the plurality of worker nodes. 10. The system of claim 8 wherein the master node determines the placement of new modular blocks based upon the distribution information for the modular blocks. 11. The system of claim 1 wherein the master node redistributes modular blocks across the plurality of worker nodes. 12. The system of claim 7 wherein the master node redistributes modular blocks based upon the availability information. 13. The system of claim 8 wherein the master node redistributes modular blocks based upon the distribution information for the modular blocks. 14. The system of claim 1 wherein the master node controls the replication of modular blocks across the plurality of worker nodes. 15. The system of claim 14 wherein the master node controls the replication of modular blocks based upon availability information for the plurality of worker nodes. 16. The system of claim 14 wherein the master node controls the replication of the modular blocks based upon distribution information for the modular blocks. 17. The system of claim 14 wherein replication is a configurable parameter. 18. The system of claim 1 wherein the modular blocks have a size configurable to any value less than 5 GB. 19. The system of claim 1 wherein the master node produces a new modular block when a current modular block exceeds a maximum size. 20. The system of claim 1 wherein the master node produces a new modular block with half of the information from a current modular block when the current modular block exceeds a maximum size. | A system includes a master node and worker nodes controlled by the master node. Each worker node stores 25 or more modular blocks of a distributed database, where each modular block has a size of 5 G bytes or less and has an associated log file.1. A system, comprising:
a master node; and a plurality of worker nodes controlled by the master node, wherein each worker node stores 25 or more modular blocks of a distributed database, wherein each modular block of the distributed database has a size of 5 G bytes or less and has an associated log file to record changes associated with the distributed database; wherein the master node and the plurality of worker nodes communicate over a distributed network utilizing standard protocols. 2. The system of claim 1 wherein the master node receives a database query and partitions the database query to run in parallel across the plurality of worker nodes. 3. The system of claim 1 wherein the master node collects statistics about data in the modular blocks. 4. The system of claim 3 wherein the master node uses the statistics to optimize a database query. 5. The system of claim 3 wherein the master node collects statistics selected from modular block location, size, associated log file and update time. 6. The system of claim 5 wherein the master node communicates with the plurality of worker nodes to update the statistics. 7. The system of claim 1 wherein the master node maintains availability information for the plurality of worker nodes. 8. The system of claim 1 wherein the master node maintains distribution information for the modular blocks across the plurality of worker nodes. 9. The system of claim 7 wherein the master node determines the placement of new modular blocks using the availability information for the plurality of worker nodes. 10. The system of claim 8 wherein the master node determines the placement of new modular blocks based upon the distribution information for the modular blocks. 11. The system of claim 1 wherein the master node redistributes modular blocks across the plurality of worker nodes. 12. The system of claim 7 wherein the master node redistributes modular blocks based upon the availability information. 13. The system of claim 8 wherein the master node redistributes modular blocks based upon the distribution information for the modular blocks. 14. The system of claim 1 wherein the master node controls the replication of modular blocks across the plurality of worker nodes. 15. The system of claim 14 wherein the master node controls the replication of modular blocks based upon availability information for the plurality of worker nodes. 16. The system of claim 14 wherein the master node controls the replication of the modular blocks based upon distribution information for the modular blocks. 17. The system of claim 14 wherein replication is a configurable parameter. 18. The system of claim 1 wherein the modular blocks have a size configurable to any value less than 5 GB. 19. The system of claim 1 wherein the master node produces a new modular block when a current modular block exceeds a maximum size. 20. The system of claim 1 wherein the master node produces a new modular block with half of the information from a current modular block when the current modular block exceeds a maximum size. | 2,100 |
5,075 | 14,174,707 | 2,175 | Systems and methods for improving the scrolling of user interfaces of electronic devices are provided. | 1.-20. (canceled) 21. A method, comprising:
receiving, at a device with one or more input devices, an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets; determining that an attribute associated with the received input is above a threshold value; setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating in accordance with the input. 22. The method of claim 21, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 23. The method of claim 21, wherein an asset subset identifier is an audible feedback. 24. The method of claim 21, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 25. The method of claim 21, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 26. The method of claim 21, further comprising:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 27. The method of claim 21, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 28. The method of claim 21, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. 29. A system, comprising:
one or more processors; and one or more computer readable storage media including instructions configured to cause the one or more processors to perform operations including:
receiving an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets;
determining that an attribute associated with the received input is above a threshold value;
setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and
while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which a device is currently navigating in accordance with the input. 30. The system of claim 29, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 31. The system of claim 29, wherein an asset subset identifier is an audible feedback. 32. The system of claim 29, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 33. The system of claim 29, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 34. The system of claim 29, further comprising instructions configured to cause the one or more processors to perform operations including:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 35. The system of claim 29, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 36. The system of claim 29, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. 37. A computer readable storage medium encoded with a set of instructions that when executed causes one or more processors to perform operations including:
receiving an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets; determining that an attribute associated with the received input is above a threshold value; setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which a device is currently navigating in accordance with the input. 38. The computer readable storage medium of claim 37, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 39. The computer readable storage medium of claim 37, wherein an asset subset identifier is an audible feedback. 40. The computer readable storage medium of claim 37, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 41. The computer readable storage medium of claim 37, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 42. The computer readable storage medium of claim 37, further comprising instructions configured to cause the one or more processors to perform operations including:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 43. The computer readable storage medium of claim 37, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 44. The computer readable storage medium of claim 37, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. | Systems and methods for improving the scrolling of user interfaces of electronic devices are provided.1.-20. (canceled) 21. A method, comprising:
receiving, at a device with one or more input devices, an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets; determining that an attribute associated with the received input is above a threshold value; setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating in accordance with the input. 22. The method of claim 21, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 23. The method of claim 21, wherein an asset subset identifier is an audible feedback. 24. The method of claim 21, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 25. The method of claim 21, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 26. The method of claim 21, further comprising:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 27. The method of claim 21, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 28. The method of claim 21, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. 29. A system, comprising:
one or more processors; and one or more computer readable storage media including instructions configured to cause the one or more processors to perform operations including:
receiving an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets;
determining that an attribute associated with the received input is above a threshold value;
setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and
while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which a device is currently navigating in accordance with the input. 30. The system of claim 29, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 31. The system of claim 29, wherein an asset subset identifier is an audible feedback. 32. The system of claim 29, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 33. The system of claim 29, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 34. The system of claim 29, further comprising instructions configured to cause the one or more processors to perform operations including:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 35. The system of claim 29, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 36. The system of claim 29, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. 37. A computer readable storage medium encoded with a set of instructions that when executed causes one or more processors to perform operations including:
receiving an input for navigating through a representation of a set of assets, the set including a plurality of subsets of the assets; determining that an attribute associated with the received input is above a threshold value; setting a scrolling mode to be an accelerated navigation mode in response to determining that the attribute associated with the received input is above the threshold value; and while the scrolling mode is in the accelerated navigation mode and while navigating through the representation of assets in accordance with the input, providing one or more asset subset identifiers that identify a respective subset of the assets through which a device is currently navigating in accordance with the input. 38. The computer readable storage medium of claim 37, wherein an asset subset identifier is a visual indicator superimposed over at least a portion of the representation of the set of assets. 39. The computer readable storage medium of claim 37, wherein an asset subset identifier is an audible feedback. 40. The computer readable storage medium of claim 37, wherein providing the one or more asset subset identifiers includes providing first audio feedback when scrolling through a portion of the representation of the set of assets that corresponds to a first subset and providing second audio feedback, that is different from the first audio feedback, when scrolling through a portion of the representation of the set of assets that corresponds to a second subset. 41. The computer readable storage medium of claim 37, wherein the set of assets includes at least a first subset that includes assets with first metadata and a second subset that includes assets with second metadata that is different from the first metadata. 42. The computer readable storage medium of claim 37, further comprising instructions configured to cause the one or more processors to perform operations including:
after providing the one or more asset subset identifiers, terminating the accelerated navigation mode; and after terminating the accelerated navigation mode, continuing to navigate through the representation of the set of assets without providing asset subset identifiers that identify a respective subset of the assets through which the device is currently navigating. 43. The computer readable storage medium of claim 37, wherein setting the scrolling mode to be in the accelerated navigation mode includes causing the representation of the set of assets to scroll between a representation of an asset in a first subset of assets to an initial asset in subset of assets selected from: (1) the first subset, or (2) a second subset that is consecutive with the first subset in the representation of the set of assets, and
wherein one or more assets within at least one of the first subset or the second subset is concurrently displayed with the initial asset in the first subset or the initial asset in the second subset. 44. The computer readable storage medium of claim 37, wherein the attribute is selected from the set consisting of:
the acceleration of the input; the duration of the input; and the number of instances of the input within a first period of time. | 2,100 |
5,076 | 14,977,699 | 2,135 | A system and method for allocating different temperature data to storage devices within a computer system including inexpensive non-volatile storage, such as hard disk drive (HDD) storage devices; expensive non-volatile storage, such as solid-state drive (SSD) storage devices; and expensive volatile storage, such as system cache memory. The system and method allocates cold to warm data having access frequencies up to a first access frequency threshold to inexpensive non-volatile storage; allocates hot data having access frequencies greater than the first access frequency value and ranging up to a second access frequency threshold, to expensive non-volatile storage; and allocates very hot data having access frequencies greater than the second access frequency value and which resides during normal system operation in expensive volatile storage, to said inexpensive non-volatile storage. | 1. A computer system comprising:
a data storage system including:
inexpensive non-volatile storage;
expensive non-volatile storage; and
expensive volatile storage; and
a processor for:
allocating data having access frequencies up to a first access frequency threshold to said inexpensive non-volatile storage;
allocating data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, to said expensive non-volatile storage; and
allocating data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, to said inexpensive non-volatile storage, 2. The computer system in accordance with claim 1, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 3. In a computer system including a data storage system, said data storage system including inexpensive non-volatile storage, expensive non-volatile storage; and expensive volatile storage, a method for allocating data to said storage system, the method comprising the steps of:
allocating data having access frequencies up to a first access frequency threshold to said inexpensive non-volatile storage; allocating data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, to said expensive non-volatile storage; and allocating data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, to said inexpensive non-volatile storage. 4. The Method for allocating data to a storage system within a computer system in accordance with claim 3, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 5. A data storage system, comprising:
inexpensive non-volatile storage; expensive non-volatile storage; and expensive volatile storage; and wherein: data having access frequencies up to a first access frequency threshold are allocated to said inexpensive nonvolatile storage; data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, are allocated to said expensive non-volatile storage; and data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, are allocated to said inexpensive non-volatile storage. 6. The data storage system in accordance with claim 3, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 7. A computer system comprising:
a data storage system for storage of multiple temperature data; said data storage system comprising:
inexpensive non-volatile storage;
expensive non-volatile storage; and
expensive volatile storage; and
a processor for:
allocating cold to warm data to said inexpensive non-volatile storage;
allocating hot data to said expensive non-volatile storage; and
allocating very hot data to said expensive volatile storage. 8. The computer system in accordance with claim 7, wherein:
said cold to warm data comprises data having access frequencies up to a first access frequency threshold; said hot data comprises data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold; and said very hot data comprises data having access frequencies greater than said second access frequency value 9. The computer system in accordance with claim 7, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. | A system and method for allocating different temperature data to storage devices within a computer system including inexpensive non-volatile storage, such as hard disk drive (HDD) storage devices; expensive non-volatile storage, such as solid-state drive (SSD) storage devices; and expensive volatile storage, such as system cache memory. The system and method allocates cold to warm data having access frequencies up to a first access frequency threshold to inexpensive non-volatile storage; allocates hot data having access frequencies greater than the first access frequency value and ranging up to a second access frequency threshold, to expensive non-volatile storage; and allocates very hot data having access frequencies greater than the second access frequency value and which resides during normal system operation in expensive volatile storage, to said inexpensive non-volatile storage.1. A computer system comprising:
a data storage system including:
inexpensive non-volatile storage;
expensive non-volatile storage; and
expensive volatile storage; and
a processor for:
allocating data having access frequencies up to a first access frequency threshold to said inexpensive non-volatile storage;
allocating data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, to said expensive non-volatile storage; and
allocating data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, to said inexpensive non-volatile storage, 2. The computer system in accordance with claim 1, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 3. In a computer system including a data storage system, said data storage system including inexpensive non-volatile storage, expensive non-volatile storage; and expensive volatile storage, a method for allocating data to said storage system, the method comprising the steps of:
allocating data having access frequencies up to a first access frequency threshold to said inexpensive non-volatile storage; allocating data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, to said expensive non-volatile storage; and allocating data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, to said inexpensive non-volatile storage. 4. The Method for allocating data to a storage system within a computer system in accordance with claim 3, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 5. A data storage system, comprising:
inexpensive non-volatile storage; expensive non-volatile storage; and expensive volatile storage; and wherein: data having access frequencies up to a first access frequency threshold are allocated to said inexpensive nonvolatile storage; data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold, are allocated to said expensive non-volatile storage; and data having access frequencies greater than said second access frequency value and which resides in said expensive volatile storage, are allocated to said inexpensive non-volatile storage. 6. The data storage system in accordance with claim 3, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. 7. A computer system comprising:
a data storage system for storage of multiple temperature data; said data storage system comprising:
inexpensive non-volatile storage;
expensive non-volatile storage; and
expensive volatile storage; and
a processor for:
allocating cold to warm data to said inexpensive non-volatile storage;
allocating hot data to said expensive non-volatile storage; and
allocating very hot data to said expensive volatile storage. 8. The computer system in accordance with claim 7, wherein:
said cold to warm data comprises data having access frequencies up to a first access frequency threshold; said hot data comprises data having access frequencies greater than said first access frequency value and ranging up to a second access frequency threshold; and said very hot data comprises data having access frequencies greater than said second access frequency value 9. The computer system in accordance with claim 7, wherein:
said inexpensive non-volatile storage comprises hard disk drive (HDD) storage devices; said expensive non-volatile storage comprises solid-state drive (SSD) storage devices; and said expensive volatile storage comprises system cache memory. | 2,100 |
5,077 | 14,451,375 | 2,131 | According to one general aspect, a method may include receiving, by a pre-fetch unit, a demand to access data stored at a memory address. The method may include determining if a first portion of the memory address matches a prior defined region of memory. The method may further include determining if a second portion of the memory address matches a previously detected pre-fetched address portion. The method may also include, if the first portion of the memory address matches the prior defined region of memory, and the second portion of the memory address matches the previously detected pre-fetched address portion, confirming that a pre-fetch pattern is associated with the memory address. | 1. A method comprising:
receiving, by a pre-fetch unit, a demand to access data stored at a memory address; determining if a first portion of the memory address matches a prior defined region of memory; determining if a second portion of the memory address matches a previously detected pre-fetched address portion; and if the first portion of the memory address matches the prior defined region of memory, and the second portion of the memory address matches the previously detected pre-fetched address portion, confirming that a pre-fetch pattern is associated with the memory address. 2. The method of claim 1, wherein, if either or both the first portion of the memory address does not match the prior defined region of memory, or the second portion of the memory address do not match the previously detected pre-fetched address portion, training the pre-fetch unit based, at least in part, upon the memory address. 3. The method of claim 1, wherein the determining if the first portion of the memory address matches comprises detecting if the first portion of the memory address matches an entry in a first data structure; and
wherein the determining if the second portion of the memory address matches comprises detecting if the second portion of the memory address matches an entry in a second data structure. 4. The method of claim 1, wherein the pre-fetch unit is configured to, substantially simultaneously, pre-fetch data for a plurality of instruction streams; and
wherein determining if the first portion of the memory address matches comprises determining if the first portion of the memory address matches for a prior defined region associated with any of the instructions streams. 5. The method of claim 1, wherein determining if the second portion of the memory address matches comprises comparing against at least an outstanding pre-fetched portion, a pending pre-fetched portion, and a completed pre-fetched portion. 6. The method of claim 1, further comprising, if the first portion of the memory address does not match a prior defined region of memory:
skipping determining if the second portion of the memory address matches; and treating the demand to access data stored at the memory address as a new entry for the pre-fetch unit to train upon. 7. The method of claim 1, further comprising, if the first portion of the memory address matches a prior defined region of memory and a second portion of the memory address matches a previously detected pre-fetched address portion:
treating the demand to access data stored at the memory address as an entry for the pre-fetch unit to re-enforce prior training. 8. The method of claim 1, wherein determining if the first portion of the memory address matches and determining if the second portion of the memory address matches comprises:
an abbreviated two-stage look-up. 9. An apparatus comprising:
a pattern identifier configured to predict data access of a plurality of instruction streams; and a pre-fetch confirmer configured to determine, via a two-stage lookup, if an actual data access was predicted by the pattern identifier. 10. The apparatus of claim 9, wherein the pre-fetcher confirmer is configured to maintain:
a first data structure that identifies one or more regions of memory in which data access has been predicted, and a second data structure that associates memory addresses with one or more predicted patterns of data access. 11. The apparatus of claim 9, wherein the actual data access is associated with a memory address; and
wherein the pre-fetcher confirmer is configured to: in a first stage of the two stage lookup, compare a first portion of the memory address to a list of one or more regions of memory in which data access has been predicted, and in a second stage of the two stage lookup, at least, determine if an association exists between a second portion of the memory address and a predicted data access. 12. The apparatus of claim 9, wherein if either stage of the two-stage lookup fails, the pattern identifier is configured to treat the actual data access as a new data access upon which to predict future data accesses. 13. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to determine if an actual data access was predicted in relation to any of the plurality of instruction streams. 14. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to maintain a data structure that comprises a fixed amount of memory storage per a pre-fetch data request. 15. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to maintain at least one data structure that comingles entries that represent any outstanding pre-fetch data requests, any pending pre-fetch data requests, and any completed pre-fetch data requests associated with an active instruction stream. 16. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to:
maintain one or more data structures that associates memory addresses with one or more predicted patterns of data access in a comingled fashion, wherein the predicted patterns of data access are associated with respective instruction streams; and dynamically allocate storage space within the one or more data structures to the instruction streams. 17. A system comprising:
an execution unit configured to execute one or more instruction streams, wherein the execution unit is configured to perform an actual data access as instructed by the one or more instruction streams; a pre-fetch unit configured to:
predict data access of a plurality of instruction streams, and
determine, via a two-stage lookup and a confirmation data structure, if an actual data access was predicted; and
a memory configured to store data accessed by the one or more instruction streams. 18. The system of claim 17, wherein the confirmation data structure comprises:
a first data structure that identifies one or more regions of memory in which data access has been predicted, and a second data structure that associates memory addresses with one or more predicted patterns of data access. 19. The system of claim 17, wherein the pre-fetch unit is configured to:
if a first stage of the two-stage lookup fails, treat the actual data access as a new data access upon which to predict future data accesses; and if the first stage of the two-stage lookup succeeds, determine if the actual data access is associated with a predicted pattern of data access. 20. The system of claim 17, wherein the pre-fetch unit is configured to:
determine if an actual data access was predicted in relation to any of the plurality of instruction streams. | According to one general aspect, a method may include receiving, by a pre-fetch unit, a demand to access data stored at a memory address. The method may include determining if a first portion of the memory address matches a prior defined region of memory. The method may further include determining if a second portion of the memory address matches a previously detected pre-fetched address portion. The method may also include, if the first portion of the memory address matches the prior defined region of memory, and the second portion of the memory address matches the previously detected pre-fetched address portion, confirming that a pre-fetch pattern is associated with the memory address.1. A method comprising:
receiving, by a pre-fetch unit, a demand to access data stored at a memory address; determining if a first portion of the memory address matches a prior defined region of memory; determining if a second portion of the memory address matches a previously detected pre-fetched address portion; and if the first portion of the memory address matches the prior defined region of memory, and the second portion of the memory address matches the previously detected pre-fetched address portion, confirming that a pre-fetch pattern is associated with the memory address. 2. The method of claim 1, wherein, if either or both the first portion of the memory address does not match the prior defined region of memory, or the second portion of the memory address do not match the previously detected pre-fetched address portion, training the pre-fetch unit based, at least in part, upon the memory address. 3. The method of claim 1, wherein the determining if the first portion of the memory address matches comprises detecting if the first portion of the memory address matches an entry in a first data structure; and
wherein the determining if the second portion of the memory address matches comprises detecting if the second portion of the memory address matches an entry in a second data structure. 4. The method of claim 1, wherein the pre-fetch unit is configured to, substantially simultaneously, pre-fetch data for a plurality of instruction streams; and
wherein determining if the first portion of the memory address matches comprises determining if the first portion of the memory address matches for a prior defined region associated with any of the instructions streams. 5. The method of claim 1, wherein determining if the second portion of the memory address matches comprises comparing against at least an outstanding pre-fetched portion, a pending pre-fetched portion, and a completed pre-fetched portion. 6. The method of claim 1, further comprising, if the first portion of the memory address does not match a prior defined region of memory:
skipping determining if the second portion of the memory address matches; and treating the demand to access data stored at the memory address as a new entry for the pre-fetch unit to train upon. 7. The method of claim 1, further comprising, if the first portion of the memory address matches a prior defined region of memory and a second portion of the memory address matches a previously detected pre-fetched address portion:
treating the demand to access data stored at the memory address as an entry for the pre-fetch unit to re-enforce prior training. 8. The method of claim 1, wherein determining if the first portion of the memory address matches and determining if the second portion of the memory address matches comprises:
an abbreviated two-stage look-up. 9. An apparatus comprising:
a pattern identifier configured to predict data access of a plurality of instruction streams; and a pre-fetch confirmer configured to determine, via a two-stage lookup, if an actual data access was predicted by the pattern identifier. 10. The apparatus of claim 9, wherein the pre-fetcher confirmer is configured to maintain:
a first data structure that identifies one or more regions of memory in which data access has been predicted, and a second data structure that associates memory addresses with one or more predicted patterns of data access. 11. The apparatus of claim 9, wherein the actual data access is associated with a memory address; and
wherein the pre-fetcher confirmer is configured to: in a first stage of the two stage lookup, compare a first portion of the memory address to a list of one or more regions of memory in which data access has been predicted, and in a second stage of the two stage lookup, at least, determine if an association exists between a second portion of the memory address and a predicted data access. 12. The apparatus of claim 9, wherein if either stage of the two-stage lookup fails, the pattern identifier is configured to treat the actual data access as a new data access upon which to predict future data accesses. 13. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to determine if an actual data access was predicted in relation to any of the plurality of instruction streams. 14. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to maintain a data structure that comprises a fixed amount of memory storage per a pre-fetch data request. 15. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to maintain at least one data structure that comingles entries that represent any outstanding pre-fetch data requests, any pending pre-fetch data requests, and any completed pre-fetch data requests associated with an active instruction stream. 16. The apparatus of claim 9, wherein the pre-fetch confirmer is configured to:
maintain one or more data structures that associates memory addresses with one or more predicted patterns of data access in a comingled fashion, wherein the predicted patterns of data access are associated with respective instruction streams; and dynamically allocate storage space within the one or more data structures to the instruction streams. 17. A system comprising:
an execution unit configured to execute one or more instruction streams, wherein the execution unit is configured to perform an actual data access as instructed by the one or more instruction streams; a pre-fetch unit configured to:
predict data access of a plurality of instruction streams, and
determine, via a two-stage lookup and a confirmation data structure, if an actual data access was predicted; and
a memory configured to store data accessed by the one or more instruction streams. 18. The system of claim 17, wherein the confirmation data structure comprises:
a first data structure that identifies one or more regions of memory in which data access has been predicted, and a second data structure that associates memory addresses with one or more predicted patterns of data access. 19. The system of claim 17, wherein the pre-fetch unit is configured to:
if a first stage of the two-stage lookup fails, treat the actual data access as a new data access upon which to predict future data accesses; and if the first stage of the two-stage lookup succeeds, determine if the actual data access is associated with a predicted pattern of data access. 20. The system of claim 17, wherein the pre-fetch unit is configured to:
determine if an actual data access was predicted in relation to any of the plurality of instruction streams. | 2,100 |
5,078 | 14,871,239 | 2,176 | Described herein are systems and methods for a media application including an interactive grid display. A method may include identifying one or more user preferences; displaying a grid including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences. | 1. A method, comprising:
identifying one or more user preferences; generating a grid for display including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences. 2. The method of claim 1, further comprising:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 3. The method of claim 1, wherein the identifying the one or more user preferences is based on activity input received from a user. 4. The method of claim 1, wherein the identifying the one or more user preferences is based on preference selection input received from a user. 5. The method of claim 1, further comprising:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 6. The method of claim 1, wherein the grid further includes a centrally located featured media region for displaying at least one of a recently activated media element and a media element of a favorite category. 7. The method of claim 1, wherein each of the plurality of media elements is categorized based on at least one of an actor, a character, a property, and a theme. 8. The method of claim 1, further comprising:
generating a user-activated button for display within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. 9. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform actions that include:
identifying one or more user preferences; generating a grid for display including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences. 10. The computer readable storage medium of claim 9, wherein the actions further include:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 11. The computer readable storage medium of claim 9, wherein the identifying the one or more user preferences is based on activity input received from a user. 12. The computer readable storage medium of claim 9, wherein the identifying the one or more user preferences is based on preference selection input received from a user. 13. The computer readable storage medium of claim 9, wherein the actions further include:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 14. The computer readable storage medium of claim 9, wherein the grid further includes a centrally located featured media region for displaying at least one of a recently activated media element and a media element of a favorite category. 15. The computer readable storage medium of claim 9, wherein each of the plurality of media elements is categorized based on at least one of an actor, a character, a property, and a theme. 16. The computer readable storage medium of claim 9, wherein the actions further include:
generating a user-activated button for display within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. 17. A device, comprising:
a display; a memory storing a plurality of rules; and a processor coupled to the memory and configured to perform actions that include:
identifying one or more user preferences;
generating a grid on the display including a content region;
arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file;
receiving a further media element from a content provider over a network; and
inserting the further media element onto the content region based on the one or more user preferences. 18. The device of claim 17, wherein the processor is further configured to perform actions that include:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 19. The device of claim 17, wherein the processor is further configured to perform actions that include:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 20. The device of claim 17, wherein the processor is further configured to perform actions that include:
displaying a user-activated button within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. | Described herein are systems and methods for a media application including an interactive grid display. A method may include identifying one or more user preferences; displaying a grid including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences.1. A method, comprising:
identifying one or more user preferences; generating a grid for display including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences. 2. The method of claim 1, further comprising:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 3. The method of claim 1, wherein the identifying the one or more user preferences is based on activity input received from a user. 4. The method of claim 1, wherein the identifying the one or more user preferences is based on preference selection input received from a user. 5. The method of claim 1, further comprising:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 6. The method of claim 1, wherein the grid further includes a centrally located featured media region for displaying at least one of a recently activated media element and a media element of a favorite category. 7. The method of claim 1, wherein each of the plurality of media elements is categorized based on at least one of an actor, a character, a property, and a theme. 8. The method of claim 1, further comprising:
generating a user-activated button for display within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. 9. A non-transitory computer readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform actions that include:
identifying one or more user preferences; generating a grid for display including a content region; arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file; receiving a further media element from a content provider over a network; and inserting the further media element onto the content region based on the one or more user preferences. 10. The computer readable storage medium of claim 9, wherein the actions further include:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 11. The computer readable storage medium of claim 9, wherein the identifying the one or more user preferences is based on activity input received from a user. 12. The computer readable storage medium of claim 9, wherein the identifying the one or more user preferences is based on preference selection input received from a user. 13. The computer readable storage medium of claim 9, wherein the actions further include:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 14. The computer readable storage medium of claim 9, wherein the grid further includes a centrally located featured media region for displaying at least one of a recently activated media element and a media element of a favorite category. 15. The computer readable storage medium of claim 9, wherein each of the plurality of media elements is categorized based on at least one of an actor, a character, a property, and a theme. 16. The computer readable storage medium of claim 9, wherein the actions further include:
generating a user-activated button for display within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. 17. A device, comprising:
a display; a memory storing a plurality of rules; and a processor coupled to the memory and configured to perform actions that include:
identifying one or more user preferences;
generating a grid on the display including a content region;
arranging a presentation of a plurality of media elements within the content region based on the one or more user preferences, wherein each of the plurality of media elements activates a correlated media file;
receiving a further media element from a content provider over a network; and
inserting the further media element onto the content region based on the one or more user preferences. 18. The device of claim 17, wherein the processor is further configured to perform actions that include:
receiving a selection input from a user to activate a first media element within the content region; eliminating the first media element from the grid upon activating the correlated media file associated with the first media element; and inserting an additional media element onto the content region to replace the eliminated first media element. 19. The device of claim 17, wherein the processor is further configured to perform actions that include:
updating the one or more user preferences based on input from the user; and eliminating the at least one of the plurality of media elements from the grid based on the updated preferences. 20. The device of claim 17, wherein the processor is further configured to perform actions that include:
displaying a user-activated button within the grid; activating a disruptive media file upon receiving a user interaction with the user-activated button; and modifying the presentation of the plurality of media elements within the grid upon activating the disruptive media file. | 2,100 |
5,079 | 12,614,457 | 2,176 | A method described herein includes acts of extracting at least one entity from an arbitrary web page being viewed by an individual on a computing device and comparing the at least one entity with social network data of the individual, wherein the social network data comprises a plurality of messages generated by members of a social network of the individual. The method further includes the acts of identifying at least one message in the plurality of messages based at least in part upon the comparing of the at least one entity with the social network data of the individual and causing the at least one message to be displayed on the web page in conjunction with the at least one entity. | 1. A method comprising the following computer-executable acts:
extracting at least one entity from an arbitrary web page being viewed by an individual on a computing device; comparing the at least one entity with social network data of the individual, wherein the social network data comprises a plurality of messages generated by members of a social network of the individual; identifying at least one message in the plurality of messages based at least in part upon the comparing of the at least one entity with the social network data of the individual; and causing the at least one message to be displayed in conjunction with the web page in conjunction with the at least one entity. 2. The method of claim 1, further comprising:
prior to the message being displayed on the web page, causing text on the web page that relates to the at least one message to be highlighted; and prior to the message being displayed, detecting that the individual performs an input gesture indicating interest in the highlighted text. 3. The method of claim 1, wherein the at least one entity is compared with entities extracted from the plurality of messages generated by the members of the social network of the individual. 4. The method of claim 1, wherein the at least one message is displayed as an inline popup window on the web page. 5. The method of claim 1, further comprising:
causing one or more of a field or button to be displayed in conjunction with the at least one message displayed on the web page, wherein the one or more of the field or the button is configured to receive input from the individual that pertains to the at least one message. 6. The method of claim 5, further comprising:
receiving a reply message from the first individual in the field; and causing the reply message to be transmitted to a social networking application. 7. The method of claim 1, wherein the social network data of the first individual is originated from a social network application operating at least partially within an enterprise, wherein the message is posted by a contact of the individual, wherein the contact of the individual and the individual are related via the enterprise. 8. The method of claim 1, wherein extracting the at least one entity from the arbitrary web page comprises:
selecting a keyword from the web page; comparing the keyword with term frequency data, wherein the term frequency data is indicative of frequency of use of the keyword; comparing the keyword with a stop list, wherein the stop list comprises keywords that are prohibited from being extracted; and extracting the at least one entity from the arbitrary web page based at least in part upon the comparing of the keyword with the term frequency data and the comparing of the keyword with the stop list. 9. The method of claim 1, wherein extracting the at least one entity from the arbitrary web page comprises:
accessing a trained dictionary; and determining a meaning of the keyword based at least in part upon contents of the trained dictionary. 10. The method of claim 1, wherein identifying the at least one message in the plurality of messages comprises ranking messages based at least in part upon at least one of the following parameters:
an amount of time that has passed since the messages were generated by posters of the messages; difference of content of the messages with respect to one or more of other messages or content of the web page; whether the first individual has previously read the messages; an amount of time since the first individual has read the messages; explicit feedback provided to messages by the first individual; relevancy of message content to the web page; whether the first individual selected links corresponding to the messages; or identities of posters of the messages. 11. The method of claim 1, further comprising displaying an advertisement in conjunction with the message on the web page. 12. The method of claim 11, wherein the advertisement is selected based at least in part upon a recommendation made by the poster of the message. 13. The method of claim 1, further comprising:
causing a hyperlink to be displayed to the first individual in conjunction with the message, wherein the hyperlink is configured to direct the first individual to a search engine when selected by the first individual, wherein the hyperlink is further configured to cause the search engine to execute a search based at least in part upon content of the message. 14. A system comprising the following computer-executable components:
a content analyzer component that extracts at least one entity from an arbitrary web page being viewed by an individual; a comparer component that performs a comparison of the at least one entity from the arbitrary web page and a plurality of entities extracted from a plurality of messages posted by way of at least one social networking application; an identifier component that selects at least one message from the plurality of messages based at least in part upon the comparison undertaken by the comparer component; and a display component that causes the at least one message selected by the comparer component to be displayed on the web page in conjunction with the at least one entity. 15. The system of claim 14, further comprising a detection component that detects that the individual has selected the at least one entity on the web page, wherein the display component is configured to cause the at least one message to be displayed as an inline popup upon the detection component detecting that the individual has selected the at least one entity on the web page. 16. The system of claim 15, wherein the display component is further configured to generate a field in the inline popup that is configured to receive a reply to the at least one message from the individual. 17. The system of claim 16, further comprising a reply transmitter component that receives the reply from the individual and causes the reply to be posted via the social networking application. 18. The system of claim 14, further comprising an advertisement selector component that causes an advertisement to be displayed in conjunction with the message based at least in part upon one or more of the at least one entity extracted from the web page or content of the at least one message. 19. The system of claim 14, further comprising a hyperlink generator component that generates a hyperlink to be displayed in conjunction with the at least one message, wherein the hyperlink is configured to direct the individual to a search engine when selected by the individual, wherein the hyperlink is further configured to cause the search engine to execute a search that pertains to the at least one entity extracted from the web page. 20. A computer-readable medium comprising instructions that, when executed by a processor, cause the processor to perform acts comprising:
extracting at least one entity from content of an arbitrary web page viewed by an individual through utilization of a web browser installed on a computing device; receiving a message by way of a social networking application from a contact of the individual; ranking the message highest amongst a plurality of messages based at least in part upon one or more of the following features:
whether the message includes the entity;
whether the first individual has previously viewed the message;
an amount of time since the message was received by the social networking application;
explicit feedback provided by the first individual for the message; or
identity of a poster of the message; and
causing the message to be displayed on the web page as an inline popup. | A method described herein includes acts of extracting at least one entity from an arbitrary web page being viewed by an individual on a computing device and comparing the at least one entity with social network data of the individual, wherein the social network data comprises a plurality of messages generated by members of a social network of the individual. The method further includes the acts of identifying at least one message in the plurality of messages based at least in part upon the comparing of the at least one entity with the social network data of the individual and causing the at least one message to be displayed on the web page in conjunction with the at least one entity.1. A method comprising the following computer-executable acts:
extracting at least one entity from an arbitrary web page being viewed by an individual on a computing device; comparing the at least one entity with social network data of the individual, wherein the social network data comprises a plurality of messages generated by members of a social network of the individual; identifying at least one message in the plurality of messages based at least in part upon the comparing of the at least one entity with the social network data of the individual; and causing the at least one message to be displayed in conjunction with the web page in conjunction with the at least one entity. 2. The method of claim 1, further comprising:
prior to the message being displayed on the web page, causing text on the web page that relates to the at least one message to be highlighted; and prior to the message being displayed, detecting that the individual performs an input gesture indicating interest in the highlighted text. 3. The method of claim 1, wherein the at least one entity is compared with entities extracted from the plurality of messages generated by the members of the social network of the individual. 4. The method of claim 1, wherein the at least one message is displayed as an inline popup window on the web page. 5. The method of claim 1, further comprising:
causing one or more of a field or button to be displayed in conjunction with the at least one message displayed on the web page, wherein the one or more of the field or the button is configured to receive input from the individual that pertains to the at least one message. 6. The method of claim 5, further comprising:
receiving a reply message from the first individual in the field; and causing the reply message to be transmitted to a social networking application. 7. The method of claim 1, wherein the social network data of the first individual is originated from a social network application operating at least partially within an enterprise, wherein the message is posted by a contact of the individual, wherein the contact of the individual and the individual are related via the enterprise. 8. The method of claim 1, wherein extracting the at least one entity from the arbitrary web page comprises:
selecting a keyword from the web page; comparing the keyword with term frequency data, wherein the term frequency data is indicative of frequency of use of the keyword; comparing the keyword with a stop list, wherein the stop list comprises keywords that are prohibited from being extracted; and extracting the at least one entity from the arbitrary web page based at least in part upon the comparing of the keyword with the term frequency data and the comparing of the keyword with the stop list. 9. The method of claim 1, wherein extracting the at least one entity from the arbitrary web page comprises:
accessing a trained dictionary; and determining a meaning of the keyword based at least in part upon contents of the trained dictionary. 10. The method of claim 1, wherein identifying the at least one message in the plurality of messages comprises ranking messages based at least in part upon at least one of the following parameters:
an amount of time that has passed since the messages were generated by posters of the messages; difference of content of the messages with respect to one or more of other messages or content of the web page; whether the first individual has previously read the messages; an amount of time since the first individual has read the messages; explicit feedback provided to messages by the first individual; relevancy of message content to the web page; whether the first individual selected links corresponding to the messages; or identities of posters of the messages. 11. The method of claim 1, further comprising displaying an advertisement in conjunction with the message on the web page. 12. The method of claim 11, wherein the advertisement is selected based at least in part upon a recommendation made by the poster of the message. 13. The method of claim 1, further comprising:
causing a hyperlink to be displayed to the first individual in conjunction with the message, wherein the hyperlink is configured to direct the first individual to a search engine when selected by the first individual, wherein the hyperlink is further configured to cause the search engine to execute a search based at least in part upon content of the message. 14. A system comprising the following computer-executable components:
a content analyzer component that extracts at least one entity from an arbitrary web page being viewed by an individual; a comparer component that performs a comparison of the at least one entity from the arbitrary web page and a plurality of entities extracted from a plurality of messages posted by way of at least one social networking application; an identifier component that selects at least one message from the plurality of messages based at least in part upon the comparison undertaken by the comparer component; and a display component that causes the at least one message selected by the comparer component to be displayed on the web page in conjunction with the at least one entity. 15. The system of claim 14, further comprising a detection component that detects that the individual has selected the at least one entity on the web page, wherein the display component is configured to cause the at least one message to be displayed as an inline popup upon the detection component detecting that the individual has selected the at least one entity on the web page. 16. The system of claim 15, wherein the display component is further configured to generate a field in the inline popup that is configured to receive a reply to the at least one message from the individual. 17. The system of claim 16, further comprising a reply transmitter component that receives the reply from the individual and causes the reply to be posted via the social networking application. 18. The system of claim 14, further comprising an advertisement selector component that causes an advertisement to be displayed in conjunction with the message based at least in part upon one or more of the at least one entity extracted from the web page or content of the at least one message. 19. The system of claim 14, further comprising a hyperlink generator component that generates a hyperlink to be displayed in conjunction with the at least one message, wherein the hyperlink is configured to direct the individual to a search engine when selected by the individual, wherein the hyperlink is further configured to cause the search engine to execute a search that pertains to the at least one entity extracted from the web page. 20. A computer-readable medium comprising instructions that, when executed by a processor, cause the processor to perform acts comprising:
extracting at least one entity from content of an arbitrary web page viewed by an individual through utilization of a web browser installed on a computing device; receiving a message by way of a social networking application from a contact of the individual; ranking the message highest amongst a plurality of messages based at least in part upon one or more of the following features:
whether the message includes the entity;
whether the first individual has previously viewed the message;
an amount of time since the message was received by the social networking application;
explicit feedback provided by the first individual for the message; or
identity of a poster of the message; and
causing the message to be displayed on the web page as an inline popup. | 2,100 |
5,080 | 14,237,293 | 2,196 | Example embodiments disclosed herein relate to determine an amount of power drawn by a network powered device. A power load of the network powered device is set. The amount of power drawn by the power load is incrementally increased based on whether the power load meets at least one criterion. A representation for the increments of the power load is stored in a non-volatile memory. | 1. A method comprising:
setting a power load in a network powered device; incrementally increasing the power drawn by the power load more times until the power load meets one or more criteria, wherein the criteria includes removal of power to the network powered device; and storing a representation of the power load in a non-volatile memory for each increment. 2. The method of claim 1, when the criteria further includes a maximum increment level. 3. The method of claim 1, further comprising:
setting a memory identifier indicating that a test mode for setting the power load has been initiated. 4. The method of claim 3, further comprising:
determining to boot to an operational mode of the network powered device based on the memory identifier. 5. The method of claim 4, further comprising:
changing performance settings of the operational mode based on the representation. 6. The method of claim 1, wherein the representation describes an incremental power level before the power is removed from the network powered device. 7. The method of claim 1, wherein load circuit including a resistor, a power transistor, and a digital-to-analog converter is used to increment the power load. 8. The method of claim 1, wherein a network of resistors is s used to control the incrementing of the power load. 9. The method of claim 1, wherein the network powered device is powered via an Ethernet cable. 10. A network powered device comprising:
a network connection, wherein the network connection provides power to the network powered device; a power loading circuit; a non-volatile memory; and a test module that causes the network powered device to:
set an address of the non-volatile memory to indicate that test has been initiated;
initiate a load of the power loading circuit to a first power level; and
increase the load of the power circuit incrementally until at least one of:
the power is removed from the network powered device and a threshold limit is reached,
wherein during each increment a representation of the power load is updated in another address of the non-volatile memory. 11. The network powered device of claim 10, further comprising:
a startup module that reads the address, wherein the startup module determines that the address indicates that the representation is stored in the other address, and wherein the startup module initiates boot of an operating system of the network powered device. 12. The network powered device of claim 11, wherein the operating system reads the other address to change performance settings of the network powered device. 13. A powered device comprising:
a network connection, wherein the network connection provides power to the powered device; a test module; a non-volatile memory; and at least one processor to set the powered device to a reset state, wherein the at least one processor determines to enable the test module lased on the non-volatile memory, wherein the test module sets a power load to increase power consumption of the powered device to an initial load threshold, and wherein the test module increases the power load based on at least one of: the powered device losing power and the powered device reaching a maximum threshold. 14. The powered device of claim 13, wherein the test module stores an identifier of the power load in the non-volatile memory as the power load is increased. 15. The powered device of claim 14, wherein the at least one processor bypasses the power test module based on the non-volatile memory, wherein the east one processor causes the powered device to boot into an operational state, and wherein the powered device uses the identifier as a maximum power threshold. | Example embodiments disclosed herein relate to determine an amount of power drawn by a network powered device. A power load of the network powered device is set. The amount of power drawn by the power load is incrementally increased based on whether the power load meets at least one criterion. A representation for the increments of the power load is stored in a non-volatile memory.1. A method comprising:
setting a power load in a network powered device; incrementally increasing the power drawn by the power load more times until the power load meets one or more criteria, wherein the criteria includes removal of power to the network powered device; and storing a representation of the power load in a non-volatile memory for each increment. 2. The method of claim 1, when the criteria further includes a maximum increment level. 3. The method of claim 1, further comprising:
setting a memory identifier indicating that a test mode for setting the power load has been initiated. 4. The method of claim 3, further comprising:
determining to boot to an operational mode of the network powered device based on the memory identifier. 5. The method of claim 4, further comprising:
changing performance settings of the operational mode based on the representation. 6. The method of claim 1, wherein the representation describes an incremental power level before the power is removed from the network powered device. 7. The method of claim 1, wherein load circuit including a resistor, a power transistor, and a digital-to-analog converter is used to increment the power load. 8. The method of claim 1, wherein a network of resistors is s used to control the incrementing of the power load. 9. The method of claim 1, wherein the network powered device is powered via an Ethernet cable. 10. A network powered device comprising:
a network connection, wherein the network connection provides power to the network powered device; a power loading circuit; a non-volatile memory; and a test module that causes the network powered device to:
set an address of the non-volatile memory to indicate that test has been initiated;
initiate a load of the power loading circuit to a first power level; and
increase the load of the power circuit incrementally until at least one of:
the power is removed from the network powered device and a threshold limit is reached,
wherein during each increment a representation of the power load is updated in another address of the non-volatile memory. 11. The network powered device of claim 10, further comprising:
a startup module that reads the address, wherein the startup module determines that the address indicates that the representation is stored in the other address, and wherein the startup module initiates boot of an operating system of the network powered device. 12. The network powered device of claim 11, wherein the operating system reads the other address to change performance settings of the network powered device. 13. A powered device comprising:
a network connection, wherein the network connection provides power to the powered device; a test module; a non-volatile memory; and at least one processor to set the powered device to a reset state, wherein the at least one processor determines to enable the test module lased on the non-volatile memory, wherein the test module sets a power load to increase power consumption of the powered device to an initial load threshold, and wherein the test module increases the power load based on at least one of: the powered device losing power and the powered device reaching a maximum threshold. 14. The powered device of claim 13, wherein the test module stores an identifier of the power load in the non-volatile memory as the power load is increased. 15. The powered device of claim 14, wherein the at least one processor bypasses the power test module based on the non-volatile memory, wherein the east one processor causes the powered device to boot into an operational state, and wherein the powered device uses the identifier as a maximum power threshold. | 2,100 |
5,081 | 14,703,558 | 2,112 | A method of transmitting data determines a measure of consecutive packet loss in a network; a ratio of a number of data packets and a number of error correction packets is selected in dependence on the measure. A stream of data packets is generated, and a stream of error correction packets is generated in dependence on the stream of data packets such that the proportion of error correction packets generated to the data packets generated is commensurate with the selected ratio. | 1. A method of transmitting data, comprising:
determining a measure of consecutive packet loss in a network; selecting a ratio of a number of data packets and a number of error correction packets in dependence on said measure; generating a stream of data packets; generating a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio; and transmitting said stream of data packets and said stream of error correction packets over said network. 2. A method as claimed in claim 1, wherein said determining comprises deriving the measure from a histogram having a plurality of bins, each bin representing a number of consecutive missing data packets and having a frequency indicating a number of occurrences of that number of consecutive missing data packets. 3. A method as claimed in claim 2, wherein said deriving comprises analysing the histogram so as to determine the bin representing the smallest number of consecutive missing data packets which has a predetermined frequency. 4. A method as claimed in claim 2, further comprising receiving the histogram from a receiving device and transmitting the stream of data packets and error correction packets from a transmitting device to the receiving device. 5. A method as claimed in claim 2, further comprising, prior to deriving the measure, filtering the histogram so as to remove outlier occurrences of consecutive packets lost in the network. 6. A method as claimed in claim 5, wherein the histogram is filtered with a filter having a window size dependent on a transmission mode, the mode being dependent on a measure of network quality. 7. A method as claimed in claim 1, further comprising transmitting the stream of data packets and the stream of error correction packets as different streams. 8. A method as claimed in claim 1, wherein each data packet is associated with a sequence number, and the measure of consecutive packets is dependent on a determination of sequence numbers associated with packets not received at a or the receiving device. 9. A method as claimed in claim 1, wherein the selected ratio is dependent on a transmission mode, the mode being dependent on a measure of network quality. 10. A method as claimed in claim 1, wherein generating a stream of error correction packets further comprises generating error correction packets in dependence on a packet type of the data packets generated in the stream of data packets. 11. A method as claimed in claim 1, wherein the data packets comprise media data for a media stream. 12. A method as claimed in claim 1, wherein the data packets are RTP packets. 13. A method as claimed in claim 1, wherein the error correction packets are forward error correction packets. 14. A data processing device comprising:
an error correction generator configured to:
determine a measure of consecutive packet loss in a network, and
select a ratio of a number of data packets and a number of error correction packets in dependence on said measure; and
a first packetiser configured to generate a stream of data packets, the error correction generator being further configured to generate a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio. 15. A data processing device as claimed in claim 14, wherein the error correction generator is further configured to determine the measure by deriving the measure from a histogram having a plurality of bins, each bin representing a number of consecutive missing data packets and having a frequency indicating a number of occurrences of that number of consecutive missing data packets. 16. A data processing device as claimed in claim 15, wherein the error correction generator is further configured to derive the measure by analysing the histogram so as to determine the bin representing the smallest number of consecutive missing data packets which has a predetermined frequency. 17. A data processing device as claimed in claim 15, wherein the error correction generator is further configured to, prior to deriving the measure, filtering the histogram so as to remove outlier occurrences of consecutive packets lost in the network. 18. A non-transitory machine readable storage medium having stored therein computer-executable instructions that when executed cause at least one processor to:
determine a measure of consecutive packet loss in a network; select a ratio of a number of data packets and a number of error correction packets in dependence on said measure; generate a stream of data packets; generate a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio; and transmit said stream of data packets and said stream of error correction packets over said network. | A method of transmitting data determines a measure of consecutive packet loss in a network; a ratio of a number of data packets and a number of error correction packets is selected in dependence on the measure. A stream of data packets is generated, and a stream of error correction packets is generated in dependence on the stream of data packets such that the proportion of error correction packets generated to the data packets generated is commensurate with the selected ratio.1. A method of transmitting data, comprising:
determining a measure of consecutive packet loss in a network; selecting a ratio of a number of data packets and a number of error correction packets in dependence on said measure; generating a stream of data packets; generating a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio; and transmitting said stream of data packets and said stream of error correction packets over said network. 2. A method as claimed in claim 1, wherein said determining comprises deriving the measure from a histogram having a plurality of bins, each bin representing a number of consecutive missing data packets and having a frequency indicating a number of occurrences of that number of consecutive missing data packets. 3. A method as claimed in claim 2, wherein said deriving comprises analysing the histogram so as to determine the bin representing the smallest number of consecutive missing data packets which has a predetermined frequency. 4. A method as claimed in claim 2, further comprising receiving the histogram from a receiving device and transmitting the stream of data packets and error correction packets from a transmitting device to the receiving device. 5. A method as claimed in claim 2, further comprising, prior to deriving the measure, filtering the histogram so as to remove outlier occurrences of consecutive packets lost in the network. 6. A method as claimed in claim 5, wherein the histogram is filtered with a filter having a window size dependent on a transmission mode, the mode being dependent on a measure of network quality. 7. A method as claimed in claim 1, further comprising transmitting the stream of data packets and the stream of error correction packets as different streams. 8. A method as claimed in claim 1, wherein each data packet is associated with a sequence number, and the measure of consecutive packets is dependent on a determination of sequence numbers associated with packets not received at a or the receiving device. 9. A method as claimed in claim 1, wherein the selected ratio is dependent on a transmission mode, the mode being dependent on a measure of network quality. 10. A method as claimed in claim 1, wherein generating a stream of error correction packets further comprises generating error correction packets in dependence on a packet type of the data packets generated in the stream of data packets. 11. A method as claimed in claim 1, wherein the data packets comprise media data for a media stream. 12. A method as claimed in claim 1, wherein the data packets are RTP packets. 13. A method as claimed in claim 1, wherein the error correction packets are forward error correction packets. 14. A data processing device comprising:
an error correction generator configured to:
determine a measure of consecutive packet loss in a network, and
select a ratio of a number of data packets and a number of error correction packets in dependence on said measure; and
a first packetiser configured to generate a stream of data packets, the error correction generator being further configured to generate a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio. 15. A data processing device as claimed in claim 14, wherein the error correction generator is further configured to determine the measure by deriving the measure from a histogram having a plurality of bins, each bin representing a number of consecutive missing data packets and having a frequency indicating a number of occurrences of that number of consecutive missing data packets. 16. A data processing device as claimed in claim 15, wherein the error correction generator is further configured to derive the measure by analysing the histogram so as to determine the bin representing the smallest number of consecutive missing data packets which has a predetermined frequency. 17. A data processing device as claimed in claim 15, wherein the error correction generator is further configured to, prior to deriving the measure, filtering the histogram so as to remove outlier occurrences of consecutive packets lost in the network. 18. A non-transitory machine readable storage medium having stored therein computer-executable instructions that when executed cause at least one processor to:
determine a measure of consecutive packet loss in a network; select a ratio of a number of data packets and a number of error correction packets in dependence on said measure; generate a stream of data packets; generate a stream of error correction packets in dependence on the stream of data packets such that the proportion of error correction packets generated to data packets generated is commensurate with the selected ratio; and transmit said stream of data packets and said stream of error correction packets over said network. | 2,100 |
5,082 | 14,693,534 | 2,162 | A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry. | 1. A method performed by a computer system to update a tuple table of tuples, each tuple having fields, each field having a value, the tuple table having an index that maps index values for an indexed field to tuples that have the index values in the indexed field, the method comprising:
updating the tuple table for a tuple having a target index value in the indexed field; and updating the index by:
locking a portion of the index that maps the target index value to tuples without locking other portions of the index so that other portions can be accessed concurrently while the portion is locked;
after locking the portion, updating the portion to reflect the update to the tuple table; and
after updating the portion, unlocking the portion. 2. The method of claim 1 wherein the updating is performed prior to the locking of the portion. 3. The method of claim 2 wherein the updating is adding to the tuple table a new tuple with the target index value in the indexed field. 4. The method of claim 3 wherein the updating of the portion includes updating an indication of the number of tuples in the tuple table that have the target index value in the indexed field. 5. The method of claim 4 wherein the indication of the number of tuples is an end-of-table marker in a value-tuple table that contains an entry for each tuple in the tuple table that has the target index value in the indexed field. 6. The method of claim 1 further comprising accessing by a reader a tuple of the tuple table that has the target index value in the indexed field by locking the portion, using the mapping of the locked portion to retrieve a tuple that has the target index value in the indexed field, and unlocking the locked portion. 7. The method of claim 1 wherein the index includes a values table, the values table including an entry for each index value of the indexed field and each entry having a reference to a value-tuple table for that index value that maps to tuples that have that index value in the indexed field, and wherein the locking is performed by issuing a read full/leave empty instruction to the reference of the entry for the index value and the unlocking is performed by issuing a write empty/leave full instruction to the reference of the entry for the index value. 8. The method of claim 1 wherein the indexed field is selected from the group consisting of a subject field, a predicate field, and an object field. 9. A computer-readable storage storing an index for a tuple table, the tuple table having tuples with fields, each field having a value, the index for mapping index values of an indexed field to tuples that have the corresponding index values in the indexed field, the index comprising:
for each index value, a value-tuple data structure that identifies the tuples of the tuple table that have that index value in the indexed field, each value-tuple data structure being separately lockable so that a locked value-tuple data structure can be updated while locked without locking any other value-tuple data structure; and a values data structure that, for each index value, identifies the value-table data structure for that index value. 10. The computer-readable storage of claim 9 wherein the value-tuple data structure of an index value includes an entry for each tuple of the tuple table that has that index value in the index field. 11. The computer-readable storage of claim 10 wherein each entry contains a reference to a tuple in the tuple table. 12. The computer-readable storage of claim 9 wherein the values data structure includes an entry for each index value of the indexed field that contains a reference to the value-tuple data structure for that index value of the indexed field. 13. A computer system for adding a new tuple to a tuple table of tuples, each tuple having fields, each field having a value, the computer system comprising:
a memory storing computer-executable instructions to:
add the new tuple to the tuple table, the new tuple having a new index value in an indexed field; and
update an index for the indexed field into the tuple table, the index including a value-tuple data structure for each index value of the indexed field that maps to the tuples of the tuple table that contain that index value, the instructions to update including instructions to:
lock the value-tuple data structure for the new index value without having to lock the value-tuple data structure for another index value;
after the value-tuple data structure is locked, update the value-tuple data structure for the new index value to map to the new tuple in the tuple table; and
after the value-tuple data structure is updated, unlock the value-tuple data structure for the new index value; and
a processor for executing the computer-executable instructions stored in the memory. 14. The computer system of claim 13 wherein the memory further stores instructions to access by a reader the new tuple, the instructions to access including instructions to lock the value-tuple data structure for the new index value without having to lock the value-tuple data structure for another index value, retrieve the new tuple using the mapping of the value-tuple data structure for the new index value, and unlock the value-tuple data structure for the new index value. 15. The computer system of claim 13 wherein the instructions to update allow a value-tuple data structure for another index value to be updated while the value-tuple data structure for the new index value is locked. 16. The computer system of claim 13 wherein the memory further stores instructions to access by a reader a tuple of the tuple table that has an index value other than the new index value while the value-tuple data structure for the new index value is locked. 17. The computer system of claim 13 wherein the index includes a values data structure with an entry for each index value of the indexed field of a tuple of the tuple table. 18. The computer system of claim 17 wherein each entry for an index value of the values data structure contains a reference to the value-tuple data structure for that index value and wherein the instructions to lock the value-tuple data structure for the new index value locks the reference to effect the locking of the value-tuple data structure for the new index value. 19. A method performed by a computer system for fine-grain locking of an index of a tuple table of tuples, each tuple having fields with value, the index for an indexed field, the method comprising:
providing a value-tuple data structure for each index value in the indexed field of a tuple of the tuple table, the value-tuple data structure for an index value providing a mapping to the tuples that have that index value in the indexed field, prior to accessing the value-tuple data structure for a target index value, locking the value-tuple data structure for the target index value wherein the locking does not lock the value-tuple data structure for index values other than the target index value; after locking the value-tuple data structure for the target index value, accessing the value-tuple data structure for the target index value; and after accessing the value-tuple data structure for the target index value, unlocking the value-tuple data structure for the target index value wherein multiple value-tuple data structures can be accessed concurrently by different accessors because of the fine-grain locking. 20. The method of claim 19 further comprising prior to locking the value-tuple data structure for the target index value, adding a new tuple to the tuple table having the target index value in the indexed field and wherein the accessing includes generating a mapping to the new tuple. 21. The method of claim 19 further comprising after to locking the value-tuple data structure for the target index value and prior to unlocking the value-tuple data structure for the target index value, retrieving from the tuple table a tuple that has the target index value in the indexed field. | A system for updating an index into a tuple table of tuples is provided. An indexing system updates an index into a tuple table using fine-grain locking of the index. The index includes a values table with an entry for each index value of an index field that references a value-tuple table that includes, for each tuple with the index value, a row that identifies a tuple of the tuple table with that indexed value. After a new tuple is added to the tuple table with a value, the index is updated by locking the entry in the values table, updating the value-tuple table for the value, and then unlocking the entry. When the index is accessed for locating tuples with a value, the accessor locks the entry in the values table for the value, uses the value-tuple table to locate the tuples, and unlocks the entry.1. A method performed by a computer system to update a tuple table of tuples, each tuple having fields, each field having a value, the tuple table having an index that maps index values for an indexed field to tuples that have the index values in the indexed field, the method comprising:
updating the tuple table for a tuple having a target index value in the indexed field; and updating the index by:
locking a portion of the index that maps the target index value to tuples without locking other portions of the index so that other portions can be accessed concurrently while the portion is locked;
after locking the portion, updating the portion to reflect the update to the tuple table; and
after updating the portion, unlocking the portion. 2. The method of claim 1 wherein the updating is performed prior to the locking of the portion. 3. The method of claim 2 wherein the updating is adding to the tuple table a new tuple with the target index value in the indexed field. 4. The method of claim 3 wherein the updating of the portion includes updating an indication of the number of tuples in the tuple table that have the target index value in the indexed field. 5. The method of claim 4 wherein the indication of the number of tuples is an end-of-table marker in a value-tuple table that contains an entry for each tuple in the tuple table that has the target index value in the indexed field. 6. The method of claim 1 further comprising accessing by a reader a tuple of the tuple table that has the target index value in the indexed field by locking the portion, using the mapping of the locked portion to retrieve a tuple that has the target index value in the indexed field, and unlocking the locked portion. 7. The method of claim 1 wherein the index includes a values table, the values table including an entry for each index value of the indexed field and each entry having a reference to a value-tuple table for that index value that maps to tuples that have that index value in the indexed field, and wherein the locking is performed by issuing a read full/leave empty instruction to the reference of the entry for the index value and the unlocking is performed by issuing a write empty/leave full instruction to the reference of the entry for the index value. 8. The method of claim 1 wherein the indexed field is selected from the group consisting of a subject field, a predicate field, and an object field. 9. A computer-readable storage storing an index for a tuple table, the tuple table having tuples with fields, each field having a value, the index for mapping index values of an indexed field to tuples that have the corresponding index values in the indexed field, the index comprising:
for each index value, a value-tuple data structure that identifies the tuples of the tuple table that have that index value in the indexed field, each value-tuple data structure being separately lockable so that a locked value-tuple data structure can be updated while locked without locking any other value-tuple data structure; and a values data structure that, for each index value, identifies the value-table data structure for that index value. 10. The computer-readable storage of claim 9 wherein the value-tuple data structure of an index value includes an entry for each tuple of the tuple table that has that index value in the index field. 11. The computer-readable storage of claim 10 wherein each entry contains a reference to a tuple in the tuple table. 12. The computer-readable storage of claim 9 wherein the values data structure includes an entry for each index value of the indexed field that contains a reference to the value-tuple data structure for that index value of the indexed field. 13. A computer system for adding a new tuple to a tuple table of tuples, each tuple having fields, each field having a value, the computer system comprising:
a memory storing computer-executable instructions to:
add the new tuple to the tuple table, the new tuple having a new index value in an indexed field; and
update an index for the indexed field into the tuple table, the index including a value-tuple data structure for each index value of the indexed field that maps to the tuples of the tuple table that contain that index value, the instructions to update including instructions to:
lock the value-tuple data structure for the new index value without having to lock the value-tuple data structure for another index value;
after the value-tuple data structure is locked, update the value-tuple data structure for the new index value to map to the new tuple in the tuple table; and
after the value-tuple data structure is updated, unlock the value-tuple data structure for the new index value; and
a processor for executing the computer-executable instructions stored in the memory. 14. The computer system of claim 13 wherein the memory further stores instructions to access by a reader the new tuple, the instructions to access including instructions to lock the value-tuple data structure for the new index value without having to lock the value-tuple data structure for another index value, retrieve the new tuple using the mapping of the value-tuple data structure for the new index value, and unlock the value-tuple data structure for the new index value. 15. The computer system of claim 13 wherein the instructions to update allow a value-tuple data structure for another index value to be updated while the value-tuple data structure for the new index value is locked. 16. The computer system of claim 13 wherein the memory further stores instructions to access by a reader a tuple of the tuple table that has an index value other than the new index value while the value-tuple data structure for the new index value is locked. 17. The computer system of claim 13 wherein the index includes a values data structure with an entry for each index value of the indexed field of a tuple of the tuple table. 18. The computer system of claim 17 wherein each entry for an index value of the values data structure contains a reference to the value-tuple data structure for that index value and wherein the instructions to lock the value-tuple data structure for the new index value locks the reference to effect the locking of the value-tuple data structure for the new index value. 19. A method performed by a computer system for fine-grain locking of an index of a tuple table of tuples, each tuple having fields with value, the index for an indexed field, the method comprising:
providing a value-tuple data structure for each index value in the indexed field of a tuple of the tuple table, the value-tuple data structure for an index value providing a mapping to the tuples that have that index value in the indexed field, prior to accessing the value-tuple data structure for a target index value, locking the value-tuple data structure for the target index value wherein the locking does not lock the value-tuple data structure for index values other than the target index value; after locking the value-tuple data structure for the target index value, accessing the value-tuple data structure for the target index value; and after accessing the value-tuple data structure for the target index value, unlocking the value-tuple data structure for the target index value wherein multiple value-tuple data structures can be accessed concurrently by different accessors because of the fine-grain locking. 20. The method of claim 19 further comprising prior to locking the value-tuple data structure for the target index value, adding a new tuple to the tuple table having the target index value in the indexed field and wherein the accessing includes generating a mapping to the new tuple. 21. The method of claim 19 further comprising after to locking the value-tuple data structure for the target index value and prior to unlocking the value-tuple data structure for the target index value, retrieving from the tuple table a tuple that has the target index value in the indexed field. | 2,100 |
5,083 | 13,195,298 | 2,176 | In a collection technique, a user (such as a taxpayer) provides information (such as income-tax information) by submitting an image of a document, such as an income-tax summary or form. In particular, the user may provide a description of the document. In response, the user is prompted for the information associated with the field in the document. Then, the user provides the image of a region in the document that includes the field. Based on the image, the information is extracted, and the field in the form is populated using the extracted information. The prompting, receiving, extracting and populating operations may be repeated for one or more additional fields in the document. | 1. A computer-implemented method for populating a field in a form, comprising:
receiving a description of a document from a user; prompting the user for information associated with a field in the document; receiving, from the user, an image of a region in the document that includes the field; extracting, using a computer, the information from the image of the region; and populating the field in the form based on the extracted information. 2. The method of claim 1, wherein the document includes an income-tax form. 3. The method of claim 1, wherein the document includes a form having a format specified by a government agency. 4. The method of claim 1, wherein prompting the user involves displaying a template of fields in the document and requesting that the user provide the image of the field. 5. The method of claim 1, wherein the image includes a digital photograph. 6. The method of claim 1, wherein the image includes multiple fields; and
wherein the extracting involves:
capturing a set of information associated with the fields;
identifying the field based on descriptive information proximate to the field; and
selecting a subset of the set of information that includes the information. 7. The method of claim 6, wherein, if the computer is unable to identify the field, the method further includes prompting the user to identify the field from the multiple fields. 8. The method of claim 1, wherein the image includes a real-time video stream provided by an imaging device. 9. The method of claim 1, wherein extracting the information involves optical character recognition. 10. The method of claim 9, wherein the optical character recognition includes a radial image analysis technique that identifies a boundary of the field in the region. 11. The method of claim 1, wherein the method further includes repeating the prompting, receiving, extracting and populating operations for one or more additional fields in the document. 12. A non-transitory computer-program product for use in conjunction with an electronic device, the computer-program product comprising a computer-readable storage medium and a computer-program mechanism embedded therein to populate a field in a form, the computer-program mechanism including:
instructions for receiving a description of a document from a user; instructions for prompting the user for information associated with a field in the document; instructions for receiving, from the user, an image of a region in the document that includes the field; instructions for extracting the information from the image of the region; and instructions for populating the field in the form based on the extracted information. 13. The computer-program product of claim 12, wherein the document includes a form having a format specified by a government agency. 14. The computer-program product of claim 12, wherein the instructions for prompting the user involve displaying a template of fields in the document and requesting that the user provide the image of the field. 15. The computer-program product of claim 12, wherein the image includes a digital photograph. 16. The computer-program product of claim 12, wherein the image includes multiple fields; and
wherein the instructions for extracting involve:
capturing a set of information associated with the fields;
identifying the field based on descriptive information proximate to the field; and
selecting a subset of the set of information that includes the information. 17. The computer-program product of claim 16, wherein, if the electronic device is unable to identify the field, the computer-program mechanism further includes instructions for prompting the user to identify the field from the multiple fields. 18. The computer-program product of claim 12, wherein the image includes a real-time video stream provided by an imaging device. 19. The computer-program product of claim 12, wherein instructions for extracting the information involve optical character recognition. 20. The computer-program product of claim 19, wherein the optical character recognition includes a radial image analysis technique that identifies a boundary of the field in the region. 21. The computer-program product of claim 12, wherein the computer-program mechanism further includes instructions for repeating the prompting, receiving, extracting and populating operations for one or more additional fields in the document. 22. An electronic device, comprising:
a processor; memory; and a program module, wherein the program module is stored in the memory and configurable to be executed by the processor to populate a field in a form, the program module including:
instructions for receiving a description of a document from a user;
instructions for prompting the user for information associated with a field in the document;
instructions for receiving, from the user, an image of a region in the document that includes the field;
instructions for extracting the information from the image of the region; and
instructions for populating the field in the form based on the extracted information. | In a collection technique, a user (such as a taxpayer) provides information (such as income-tax information) by submitting an image of a document, such as an income-tax summary or form. In particular, the user may provide a description of the document. In response, the user is prompted for the information associated with the field in the document. Then, the user provides the image of a region in the document that includes the field. Based on the image, the information is extracted, and the field in the form is populated using the extracted information. The prompting, receiving, extracting and populating operations may be repeated for one or more additional fields in the document.1. A computer-implemented method for populating a field in a form, comprising:
receiving a description of a document from a user; prompting the user for information associated with a field in the document; receiving, from the user, an image of a region in the document that includes the field; extracting, using a computer, the information from the image of the region; and populating the field in the form based on the extracted information. 2. The method of claim 1, wherein the document includes an income-tax form. 3. The method of claim 1, wherein the document includes a form having a format specified by a government agency. 4. The method of claim 1, wherein prompting the user involves displaying a template of fields in the document and requesting that the user provide the image of the field. 5. The method of claim 1, wherein the image includes a digital photograph. 6. The method of claim 1, wherein the image includes multiple fields; and
wherein the extracting involves:
capturing a set of information associated with the fields;
identifying the field based on descriptive information proximate to the field; and
selecting a subset of the set of information that includes the information. 7. The method of claim 6, wherein, if the computer is unable to identify the field, the method further includes prompting the user to identify the field from the multiple fields. 8. The method of claim 1, wherein the image includes a real-time video stream provided by an imaging device. 9. The method of claim 1, wherein extracting the information involves optical character recognition. 10. The method of claim 9, wherein the optical character recognition includes a radial image analysis technique that identifies a boundary of the field in the region. 11. The method of claim 1, wherein the method further includes repeating the prompting, receiving, extracting and populating operations for one or more additional fields in the document. 12. A non-transitory computer-program product for use in conjunction with an electronic device, the computer-program product comprising a computer-readable storage medium and a computer-program mechanism embedded therein to populate a field in a form, the computer-program mechanism including:
instructions for receiving a description of a document from a user; instructions for prompting the user for information associated with a field in the document; instructions for receiving, from the user, an image of a region in the document that includes the field; instructions for extracting the information from the image of the region; and instructions for populating the field in the form based on the extracted information. 13. The computer-program product of claim 12, wherein the document includes a form having a format specified by a government agency. 14. The computer-program product of claim 12, wherein the instructions for prompting the user involve displaying a template of fields in the document and requesting that the user provide the image of the field. 15. The computer-program product of claim 12, wherein the image includes a digital photograph. 16. The computer-program product of claim 12, wherein the image includes multiple fields; and
wherein the instructions for extracting involve:
capturing a set of information associated with the fields;
identifying the field based on descriptive information proximate to the field; and
selecting a subset of the set of information that includes the information. 17. The computer-program product of claim 16, wherein, if the electronic device is unable to identify the field, the computer-program mechanism further includes instructions for prompting the user to identify the field from the multiple fields. 18. The computer-program product of claim 12, wherein the image includes a real-time video stream provided by an imaging device. 19. The computer-program product of claim 12, wherein instructions for extracting the information involve optical character recognition. 20. The computer-program product of claim 19, wherein the optical character recognition includes a radial image analysis technique that identifies a boundary of the field in the region. 21. The computer-program product of claim 12, wherein the computer-program mechanism further includes instructions for repeating the prompting, receiving, extracting and populating operations for one or more additional fields in the document. 22. An electronic device, comprising:
a processor; memory; and a program module, wherein the program module is stored in the memory and configurable to be executed by the processor to populate a field in a form, the program module including:
instructions for receiving a description of a document from a user;
instructions for prompting the user for information associated with a field in the document;
instructions for receiving, from the user, an image of a region in the document that includes the field;
instructions for extracting the information from the image of the region; and
instructions for populating the field in the form based on the extracted information. | 2,100 |
5,084 | 14,022,876 | 2,173 | An aspect provides a method, including: operating an audio receiver and a memory of an information handling device to store audio; receiving input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, processing the audio stored to identify one or more actionable items for the virtual assistant. Other aspects are described and claimed. | 1. A method, comprising:
operating an audio receiver and a memory of an information handling device to store audio; receiving input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, processing the audio stored to identify one or more actionable items for the virtual assistant. 2. The method of claim 1, further comprising:
identifying, in the input activating the virtual assistant, one or more key inputs; and utilizing the one or more key inputs as a trigger for processing the audio stored to identify the one or more actionable items for the virtual assistant. 3. The method of claim 2, wherein the one or more key inputs are selected from the group of inputs consisting of a key word, a key phrase, a gesture, and a touch input. 4. The method of claim 3, wherein the one or more key inputs are keyed to an indication that the audio stored contains actionable items. 5. The method of claim 1, wherein the one or more actionable items are selected from the group of actionable items consisting of a query, a command and a reminder. 6. The method of claim 5, further comprising, after identifying one or more actionable items from the audio stored, executing one or more actions via the virtual assistant. 7. The method of claim 1, wherein the input activating the virtual assistant is selected from the group of inputs consisting of an audio input, a gesture input, and a predetermined symbol input;
said method further comprising, after detecting the input activating the virtual assistant, executing one or more actions via the virtual assistant. 8. The method of claim 1, wherein the predetermined amount of audio is variable according to one or more factors. 9. The method of claim 8, wherein the one or more factors include a determination that an initial allocation of memory is insufficient for storing ongoing audio input. 10. The method of claim 8, wherein the one or more factors are selected from the group of factors consisting of power consumption, processing delay, and privacy. 11. An information handling device, comprising:
an audio receiver; one or more processors; and a memory device accessible to the one or more processors and storing code executable by the one or more processors to: operate the audio receiver and a memory to store audio; receive input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, process the audio stored to identify one or more actionable items for the virtual assistant. 12. The information handling device of claim 1, wherein the code is executable by the one or more processors to:
identify, in the input activating the virtual assistant, one or more key inputs; and utilize the one or more key inputs as a trigger for processing the audio stored to identify the one or more actionable items for the virtual assistant. 13. The information handling device of claim 12, wherein the one or more key inputs are selected from the group of inputs consisting of a key word, a key phrase, a gesture, and a touch input. 14. The information handling device of claim 13, wherein the one or more key inputs are keyed to an indication that the audio stored contains actionable items. 15. The information handling device of claim 11, wherein the one or more actionable items are selected from the group of actionable items consisting of a query, a command and a reminder. 16. The information handling device of claim 15, wherein the code is executable by the one or more processors to, after identifying one or more actionable items from the audio stored, execute one or more actions via the virtual assistant. 17. The information handling device of claim 11, wherein the input activating the virtual assistant is selected from the group of inputs consisting of an audio input, a gesture input, and a predetermined symbol input;
wherein the code is executable by the one or more processors to, after detecting the input activating the virtual assistant, execute one or more actions via the virtual assistant. 18. The information handling device of claim 11, wherein the predetermined amount of audio is variable according to one or more factors. 19. The information handling device of claim 18, wherein the one or more factors are selected from the group of factors consisting of power consumption, processing delay, and privacy. 20. A program product, comprising:
a storage device having computer readable program code stored therewith, the computer readable program code comprising: computer readable program code configured to operate an audio receiver and a memory of an information handling device to store audio; computer readable program code configured to receive input activating a virtual assistant of the information handling device; and computer readable program code configured to, after activation of the virtual assistant, process the audio stored to identify one or more actionable items for the virtual assistant. | An aspect provides a method, including: operating an audio receiver and a memory of an information handling device to store audio; receiving input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, processing the audio stored to identify one or more actionable items for the virtual assistant. Other aspects are described and claimed.1. A method, comprising:
operating an audio receiver and a memory of an information handling device to store audio; receiving input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, processing the audio stored to identify one or more actionable items for the virtual assistant. 2. The method of claim 1, further comprising:
identifying, in the input activating the virtual assistant, one or more key inputs; and utilizing the one or more key inputs as a trigger for processing the audio stored to identify the one or more actionable items for the virtual assistant. 3. The method of claim 2, wherein the one or more key inputs are selected from the group of inputs consisting of a key word, a key phrase, a gesture, and a touch input. 4. The method of claim 3, wherein the one or more key inputs are keyed to an indication that the audio stored contains actionable items. 5. The method of claim 1, wherein the one or more actionable items are selected from the group of actionable items consisting of a query, a command and a reminder. 6. The method of claim 5, further comprising, after identifying one or more actionable items from the audio stored, executing one or more actions via the virtual assistant. 7. The method of claim 1, wherein the input activating the virtual assistant is selected from the group of inputs consisting of an audio input, a gesture input, and a predetermined symbol input;
said method further comprising, after detecting the input activating the virtual assistant, executing one or more actions via the virtual assistant. 8. The method of claim 1, wherein the predetermined amount of audio is variable according to one or more factors. 9. The method of claim 8, wherein the one or more factors include a determination that an initial allocation of memory is insufficient for storing ongoing audio input. 10. The method of claim 8, wherein the one or more factors are selected from the group of factors consisting of power consumption, processing delay, and privacy. 11. An information handling device, comprising:
an audio receiver; one or more processors; and a memory device accessible to the one or more processors and storing code executable by the one or more processors to: operate the audio receiver and a memory to store audio; receive input activating a virtual assistant of the information handling device; and after activation of the virtual assistant, process the audio stored to identify one or more actionable items for the virtual assistant. 12. The information handling device of claim 1, wherein the code is executable by the one or more processors to:
identify, in the input activating the virtual assistant, one or more key inputs; and utilize the one or more key inputs as a trigger for processing the audio stored to identify the one or more actionable items for the virtual assistant. 13. The information handling device of claim 12, wherein the one or more key inputs are selected from the group of inputs consisting of a key word, a key phrase, a gesture, and a touch input. 14. The information handling device of claim 13, wherein the one or more key inputs are keyed to an indication that the audio stored contains actionable items. 15. The information handling device of claim 11, wherein the one or more actionable items are selected from the group of actionable items consisting of a query, a command and a reminder. 16. The information handling device of claim 15, wherein the code is executable by the one or more processors to, after identifying one or more actionable items from the audio stored, execute one or more actions via the virtual assistant. 17. The information handling device of claim 11, wherein the input activating the virtual assistant is selected from the group of inputs consisting of an audio input, a gesture input, and a predetermined symbol input;
wherein the code is executable by the one or more processors to, after detecting the input activating the virtual assistant, execute one or more actions via the virtual assistant. 18. The information handling device of claim 11, wherein the predetermined amount of audio is variable according to one or more factors. 19. The information handling device of claim 18, wherein the one or more factors are selected from the group of factors consisting of power consumption, processing delay, and privacy. 20. A program product, comprising:
a storage device having computer readable program code stored therewith, the computer readable program code comprising: computer readable program code configured to operate an audio receiver and a memory of an information handling device to store audio; computer readable program code configured to receive input activating a virtual assistant of the information handling device; and computer readable program code configured to, after activation of the virtual assistant, process the audio stored to identify one or more actionable items for the virtual assistant. | 2,100 |
5,085 | 14,015,947 | 2,196 | In one embodiment, an apparatus includes a wearable computing device that includes one or more processors and a memory. The memory is coupled to the processors and includes instructions executable by the processors. When executing the instructions, the processors determine whether an application is running on the wearable computing device. The application controls one or more functions of a remote computing device. The processors determine to delegate a task associated with the application; delegate the task to be processed by a local computing device; and receive from the local computing device results from processing the delegated task. | 1. An apparatus comprising:
a wearable computing device comprising one or more processors and a memory; wherein the memory is coupled to the processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
determine whether an application is running on the wearable computing device, wherein the application controls one or more functions of a remote computing device;
determine to delegate a task associated with the application;
delegate the task to be processed by a local computing device; and
receive from the local computing device results from processing the delegated task. 2. The apparatus of claim 1, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 3. The apparatus of claim 1, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 4. The apparatus of claim 1, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 5. The apparatus of claim 1, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 6. The apparatus of claim 1, wherein the task comprises wirelessly connecting to the remote computing device. 7. The apparatus of claim 1, wherein the task comprises issuing a command to the remote computing device. 8. The apparatus of claim 1, wherein the task comprises receiving data from the remote computing device. 9. A method comprising:
determining whether an application is running on a wearable computing device, wherein the application controls one or more functions of a remote computing device; by the wearable computing device, determining to delegate a task associated with the application; delegating the task to be processed by a local computing device; and receiving from the local computing device results from processing the delegated task. 10. The method of claim 9, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 11. The method of claim 9, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 12. The method of claim 9, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 13. The method of claim 9, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 14. The method of claim 9, wherein the task comprises wirelessly connecting to the remote computing device. 15. The method of claim 9, wherein the task comprises issuing a command to the remote computing device. 16. The method of claim 9, wherein the task comprises receiving data from the remote computing device. 17. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
determine whether an application is running on a wearable computing device, wherein the application controls one or more functions of a remote computing device; determine to delegate a task associated with the application; delegate the task to be processed by a local computing device; and receive from the local computing device results from processing the delegated task. 18. The media of claim 17, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 19. The media of claim 17, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 20. The media of claim 17, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 21. The media of claim 17, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 22. The media of claim 17, wherein the task comprises wirelessly connecting to the remote computing device. 23. The media of claim 17, wherein the task comprises issuing a command to the remote computing device. 24. The media of claim 17, wherein the task comprises receiving data from the remote computing device. | In one embodiment, an apparatus includes a wearable computing device that includes one or more processors and a memory. The memory is coupled to the processors and includes instructions executable by the processors. When executing the instructions, the processors determine whether an application is running on the wearable computing device. The application controls one or more functions of a remote computing device. The processors determine to delegate a task associated with the application; delegate the task to be processed by a local computing device; and receive from the local computing device results from processing the delegated task.1. An apparatus comprising:
a wearable computing device comprising one or more processors and a memory; wherein the memory is coupled to the processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
determine whether an application is running on the wearable computing device, wherein the application controls one or more functions of a remote computing device;
determine to delegate a task associated with the application;
delegate the task to be processed by a local computing device; and
receive from the local computing device results from processing the delegated task. 2. The apparatus of claim 1, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 3. The apparatus of claim 1, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 4. The apparatus of claim 1, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 5. The apparatus of claim 1, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 6. The apparatus of claim 1, wherein the task comprises wirelessly connecting to the remote computing device. 7. The apparatus of claim 1, wherein the task comprises issuing a command to the remote computing device. 8. The apparatus of claim 1, wherein the task comprises receiving data from the remote computing device. 9. A method comprising:
determining whether an application is running on a wearable computing device, wherein the application controls one or more functions of a remote computing device; by the wearable computing device, determining to delegate a task associated with the application; delegating the task to be processed by a local computing device; and receiving from the local computing device results from processing the delegated task. 10. The method of claim 9, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 11. The method of claim 9, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 12. The method of claim 9, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 13. The method of claim 9, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 14. The method of claim 9, wherein the task comprises wirelessly connecting to the remote computing device. 15. The method of claim 9, wherein the task comprises issuing a command to the remote computing device. 16. The method of claim 9, wherein the task comprises receiving data from the remote computing device. 17. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
determine whether an application is running on a wearable computing device, wherein the application controls one or more functions of a remote computing device; determine to delegate a task associated with the application; delegate the task to be processed by a local computing device; and receive from the local computing device results from processing the delegated task. 18. The media of claim 17, wherein the wearable computing device comprises:
a device body comprising:
one or more of the processors;
the memory;
a display;
a rotatable element about the display; and
a detector configured to detecting rotation of the rotatable element;
a band coupled to the device body; and an optical sensor in or on the band. 19. The media of claim 17, wherein:
the local computing device is paired with the wearable computing device using one or more of the following: a BLUETOOTH connection between the local computing device and the wearable computing device; a near-field communication (NFC) connection between the local computing device and the wearable computing device; or a WI-FI connection between the local computing device and the wearable computing device. 20. The media of claim 17, wherein determining to delegate the task is performed based at least in part on one or more of the following:
a latency sensitivity of the task; a processing requirement of the task; or a network payload size of data associated with the task. 21. The media of claim 17, wherein determining to delegate the task is performed based at least in part on analyzing one or more characteristics of the wearable computing device, the characteristics comprising one or more of the following:
available memory; CPU capacity; available energy; network connectivity; availability of network-based services; behavior of one or more users; or predicted processing time of the task. 22. The media of claim 17, wherein the task comprises wirelessly connecting to the remote computing device. 23. The media of claim 17, wherein the task comprises issuing a command to the remote computing device. 24. The media of claim 17, wherein the task comprises receiving data from the remote computing device. | 2,100 |
5,086 | 15,202,207 | 2,111 | Certain aspects of the present disclosure generally relate to techniques for puncturing of structured low density parity check (LDPC) codes. A method for wireless communications by wireless node is provided. The method generally includes encoding a set of information bits based on a LDPC code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes, puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes, and transmitting the punctured code word | 1. A method for wireless communications, comprising:
encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and transmitting the punctured code word. 2. The method of claim 1, wherein the first puncturing pattern is designed to puncture bits corresponding to at least one variable node having a highest degree of connectivity to the check nodes. 3. The method of claim 2, wherein the first puncturing pattern is designed to puncture a first number of bits at a start of the code word. 4. The method of claim 3, wherein the bits corresponding to the at least one variable node having the highest degree of connectivity to the check nodes comprise the first number of bits at the start of the code word. 5. The method of claim 3, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the start of the code word, with a given periodicity. 6. The method of claim 1, wherein the first puncturing pattern is designed to limit a number of the check nodes that are connected to more than one variable node having punctured bits. 7. The method of claim 1, wherein the first puncturing pattern is designed to limit a number of closed loops in the punctured code word. 8. The method of claim 1, wherein the first puncturing pattern is designed to puncture a first number of bits at an end of the code word. 9. The method of claim 8, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the end of the code word, with a given periodicity. 10. The method of claim 1, wherein:
for a retransmission of the set of information bits, the puncturing is performed according to a second puncturing pattern designed to puncture different bits of the code word than the first puncturing pattern. 11. The method of claim 10, wherein the second puncturing pattern is designed to switch, relative to the first puncturing pattern, the punctured bits among variable nodes with a same degree of connectivity to check nodes. 12. The method of claim 10, wherein the second puncturing pattern is designed to puncture bits in the code word at a defined offset relative to bits in the code word punctured by the first puncturing pattern. 13. The method of claim 1, wherein the LDPC code comprises an 802.11 Wi-Fi LDPC code. 14. The method of claim 1, wherein the encoding results in a first code rate of 5/6 for the code word and the first puncturing pattern is designed to achieve a second code rate of 7/8 for the punctured code word. 15. A method for wireless communications, comprising:
encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and transmitting the punctured code word. 16. The method of claim 15, wherein the puncturing pattern is design to puncture bits corresponding to the extra variable node. 17. The method of claim 15, wherein the punctured code word has a same block length as the reference LDPC code. 18. The method of claim 15, wherein the LDPC code has a lifting value of 81 and the punctured code word has a block length of 1944 bits. 19. The method of claim 15, wherein the reference LDPC code comprises a 5/6 code rate 802.11 Wi-Fi LDPC code. 20. The method of claim 15, wherein the code rate is 7/8. 21. An apparatus for wireless communications, comprising:
means for encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; means for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and means for transmitting the punctured code word. 22. The apparatus of claim 21, wherein the first puncturing pattern is designed to puncture bits corresponding to at least one variable node having a highest degree of connectivity to the check nodes. 23. The apparatus of claim 22, wherein the first puncturing pattern is designed to puncture a first number of bits at a start of the code word. 24. The apparatus of claim 23, wherein the bits corresponding to the at least one variable node having the highest degree of connectivity to the check nodes comprise the first number of bits at the start of the code word. 25. The apparatus of claim 23, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the start of the code word, with a given periodicity. 26. The apparatus of claim 21, wherein the first puncturing pattern is designed to limit a number of the check nodes that are connected to more than one variable node having punctured bits. 27. The apparatus of claim 21, wherein the first puncturing pattern is designed to limit a number of closed loops in the punctured code word. 28. The apparatus of claim 21, wherein the first puncturing pattern is designed to puncture a first number of bits at an end of the code word. 29. The apparatus of claim 28, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the end of the code word, with a given periodicity. 30. The apparatus of claim 21, wherein:
for a retransmission of the set of information bits, the puncturing is performed according to a second puncturing pattern designed to puncture different bits of the code word than the first puncturing pattern. 31. The apparatus of claim 30, wherein the second puncturing pattern is designed to switch, relative to the first puncturing pattern, the punctured bits among variable nodes with a same degree of connectivity to check nodes. 32. The apparatus of claim 30, wherein the second puncturing pattern is designed to puncture bits in the code word at a defined offset relative to bits in the code word punctured by the first puncturing pattern. 33. The apparatus of claim 21, wherein the LDPC code comprises an 802.11 Wi-Fi LDPC code. 34. The apparatus of claim 21, wherein the encoding results in a first code rate of 5/6 for the code word and the first puncturing pattern is designed to achieve a second code rate of 7/8 for the punctured code word. 35. An apparatus for wireless communications, comprising:
means for encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; means for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and means for transmitting the punctured code word. 36. The apparatus of claim 35, wherein the puncturing pattern is design to puncture bits corresponding to the extra variable node. 37. The apparatus of claim 35, wherein the punctured code word has a same block length as the reference LDPC code. 38. The apparatus of claim 35, wherein the LDPC code has a lifting value of 81 and the punctured code word has a block length of 1944 bits. 39. The apparatus of claim 35, wherein the reference LDPC code comprises a 5/6 code rate 802.11 Wi-Fi LDPC code. 40. The apparatus of claim 35, wherein the code rate is 7/8. 41. An apparatus for wireless communications, comprising:
at least one processor configured to:
encode a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; and
puncture the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and
a transmitter configured to transmit the punctured code word. 42. An apparatus for wireless communications, comprising:
at least one processor configured to:
encode a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; and
puncture the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and
a transmitter configured to transmit the punctured code word. 43. A computer readable medium having computer executable code stored thereon, comprising:
code for encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; code for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and code for transmitting the punctured code word. 44. A computer readable medium having computer executable code stored thereon, comprising:
code for encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; code for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and code for transmitting the punctured code word. | Certain aspects of the present disclosure generally relate to techniques for puncturing of structured low density parity check (LDPC) codes. A method for wireless communications by wireless node is provided. The method generally includes encoding a set of information bits based on a LDPC code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes, puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes, and transmitting the punctured code word1. A method for wireless communications, comprising:
encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and transmitting the punctured code word. 2. The method of claim 1, wherein the first puncturing pattern is designed to puncture bits corresponding to at least one variable node having a highest degree of connectivity to the check nodes. 3. The method of claim 2, wherein the first puncturing pattern is designed to puncture a first number of bits at a start of the code word. 4. The method of claim 3, wherein the bits corresponding to the at least one variable node having the highest degree of connectivity to the check nodes comprise the first number of bits at the start of the code word. 5. The method of claim 3, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the start of the code word, with a given periodicity. 6. The method of claim 1, wherein the first puncturing pattern is designed to limit a number of the check nodes that are connected to more than one variable node having punctured bits. 7. The method of claim 1, wherein the first puncturing pattern is designed to limit a number of closed loops in the punctured code word. 8. The method of claim 1, wherein the first puncturing pattern is designed to puncture a first number of bits at an end of the code word. 9. The method of claim 8, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the end of the code word, with a given periodicity. 10. The method of claim 1, wherein:
for a retransmission of the set of information bits, the puncturing is performed according to a second puncturing pattern designed to puncture different bits of the code word than the first puncturing pattern. 11. The method of claim 10, wherein the second puncturing pattern is designed to switch, relative to the first puncturing pattern, the punctured bits among variable nodes with a same degree of connectivity to check nodes. 12. The method of claim 10, wherein the second puncturing pattern is designed to puncture bits in the code word at a defined offset relative to bits in the code word punctured by the first puncturing pattern. 13. The method of claim 1, wherein the LDPC code comprises an 802.11 Wi-Fi LDPC code. 14. The method of claim 1, wherein the encoding results in a first code rate of 5/6 for the code word and the first puncturing pattern is designed to achieve a second code rate of 7/8 for the punctured code word. 15. A method for wireless communications, comprising:
encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and transmitting the punctured code word. 16. The method of claim 15, wherein the puncturing pattern is design to puncture bits corresponding to the extra variable node. 17. The method of claim 15, wherein the punctured code word has a same block length as the reference LDPC code. 18. The method of claim 15, wherein the LDPC code has a lifting value of 81 and the punctured code word has a block length of 1944 bits. 19. The method of claim 15, wherein the reference LDPC code comprises a 5/6 code rate 802.11 Wi-Fi LDPC code. 20. The method of claim 15, wherein the code rate is 7/8. 21. An apparatus for wireless communications, comprising:
means for encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; means for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and means for transmitting the punctured code word. 22. The apparatus of claim 21, wherein the first puncturing pattern is designed to puncture bits corresponding to at least one variable node having a highest degree of connectivity to the check nodes. 23. The apparatus of claim 22, wherein the first puncturing pattern is designed to puncture a first number of bits at a start of the code word. 24. The apparatus of claim 23, wherein the bits corresponding to the at least one variable node having the highest degree of connectivity to the check nodes comprise the first number of bits at the start of the code word. 25. The apparatus of claim 23, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the start of the code word, with a given periodicity. 26. The apparatus of claim 21, wherein the first puncturing pattern is designed to limit a number of the check nodes that are connected to more than one variable node having punctured bits. 27. The apparatus of claim 21, wherein the first puncturing pattern is designed to limit a number of closed loops in the punctured code word. 28. The apparatus of claim 21, wherein the first puncturing pattern is designed to puncture a first number of bits at an end of the code word. 29. The apparatus of claim 28, wherein the first puncturing pattern is further designed to puncture remaining bits of the code word, excluding the first number of bits at the end of the code word, with a given periodicity. 30. The apparatus of claim 21, wherein:
for a retransmission of the set of information bits, the puncturing is performed according to a second puncturing pattern designed to puncture different bits of the code word than the first puncturing pattern. 31. The apparatus of claim 30, wherein the second puncturing pattern is designed to switch, relative to the first puncturing pattern, the punctured bits among variable nodes with a same degree of connectivity to check nodes. 32. The apparatus of claim 30, wherein the second puncturing pattern is designed to puncture bits in the code word at a defined offset relative to bits in the code word punctured by the first puncturing pattern. 33. The apparatus of claim 21, wherein the LDPC code comprises an 802.11 Wi-Fi LDPC code. 34. The apparatus of claim 21, wherein the encoding results in a first code rate of 5/6 for the code word and the first puncturing pattern is designed to achieve a second code rate of 7/8 for the punctured code word. 35. An apparatus for wireless communications, comprising:
means for encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; means for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and means for transmitting the punctured code word. 36. The apparatus of claim 35, wherein the puncturing pattern is design to puncture bits corresponding to the extra variable node. 37. The apparatus of claim 35, wherein the punctured code word has a same block length as the reference LDPC code. 38. The apparatus of claim 35, wherein the LDPC code has a lifting value of 81 and the punctured code word has a block length of 1944 bits. 39. The apparatus of claim 35, wherein the reference LDPC code comprises a 5/6 code rate 802.11 Wi-Fi LDPC code. 40. The apparatus of claim 35, wherein the code rate is 7/8. 41. An apparatus for wireless communications, comprising:
at least one processor configured to:
encode a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; and
puncture the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and
a transmitter configured to transmit the punctured code word. 42. An apparatus for wireless communications, comprising:
at least one processor configured to:
encode a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; and
puncture the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and
a transmitter configured to transmit the punctured code word. 43. A computer readable medium having computer executable code stored thereon, comprising:
code for encoding a set of information bits based on a low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes and a second number of check nodes; code for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a first puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes having a certain degree of connectivity to the check nodes; and code for transmitting the punctured code word. 44. A computer readable medium having computer executable code stored thereon, comprising:
code for encoding a set of information bits based on a multi-edge low density parity check (LDPC) code to produce a code word, the LDPC code defined by a matrix having a first number of variable nodes including an extra variable node, relative to a reference LDPC code, and a second number of check nodes; code for puncturing the code word to produce a punctured code word, wherein the puncturing is performed according to a puncturing pattern designed to puncture bits corresponding to one or more of the variable nodes to achieve a certain code rate for the punctured code word; and code for transmitting the punctured code word. | 2,100 |
5,087 | 14,880,798 | 2,182 | A method and apparatus is provided for generating pseudorandom numbers in a way that is deterministic (i.e., repeatable), that passes statistical tests, can have multiple instances of objects generating pseudorandom numbers at the same time. Also, it is desirable that the collection of pseudorandom numbers generated by multiple instances have the same statistical properties as numbers generated by a single instance (i.e., randomness). Embodiments described herein generate pseudorandom values by using a plurality of subsidiary linear congruential generators and combining their outputs nonlinearly. According to embodiments, after their outputs have been combined, a mixing function is applied. Embodiments include an on-demand split method in the style of the SplitMix algorithm. | 1. A computer-executed method comprising:
advancing the states of two or more subsidiary pseudorandom number generators; receiving a request for a pseudorandom number; in response to receiving the request:
nonlinearly combining two or more component pseudorandom numbers to produce a particular pseudorandom number;
wherein each of the two or more component pseudorandom numbers is generated by a respective subsidiary component pseudorandom number generator of the two or more subsidiary pseudorandom number generators;
determining a response to the request based, at least in part, on the particular pseudorandom number; and
returning the response to the request;
wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein nonlinearly combining the two or more component pseudorandom numbers comprises:
permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers to produce a permuted pseudorandom number; and combining the permuted pseudorandom number with one or more other component pseudorandom numbers of the two or more component pseudorandom numbers. 3. The method of claim 2, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises permuting the certain pseudorandom number based, at least in part, on at least a portion of another component pseudorandom number of the two or more component pseudorandom numbers. 4. The method of claim 3, wherein permuting the certain pseudorandom number based, at least in part, on another component pseudorandom number of the two or more component pseudorandom numbers comprises basing the permuting on one or more highest-order bits of the other component pseudorandom number. 5. The method of claim 2, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises rotating the bits of the certain pseudorandom number. 6. The method of claim 1, wherein determining a response to the request based, at least in part, on the particular pseudorandom number comprises:
performing a mixing function on the particular pseudorandom number to produce a mixed pseudorandom number; and including the mixed pseudorandom number in the response to the request. 7. The method of claim 1, wherein the request for a pseudorandom number is received by a first instance of a pseudorandom number generator, the method further comprising:
the first instance of the pseudorandom number generator receiving a request to split the generator; in response to receiving the request to split the generator, the first instance of the pseudorandom number generator initializing a second instance of the pseudorandom number generator. 8. The method of claim 7, wherein the first instance of the pseudorandom number generator initializing the second instance of the pseudorandom number generator further comprises:
generating a plurality of pseudorandom numbers; and initializing the second instance of the pseudorandom number generator based on the plurality of pseudorandom numbers. 9. The method of claim 1, further comprising, prior to receiving the request for a pseudorandom number:
receiving at least four pseudorandom values; wherein each of the two or more subsidiary pseudorandom number generators is based on at least two of the at least four pseudorandom values. 10. The method of claim 1, wherein the two or more subsidiary pseudorandom number generators are linear congruential generators. 11. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, causes:
advancing the states of two or more subsidiary pseudorandom number generators; receiving a request for a pseudorandom number; in response to receiving the request:
nonlinearly combining two or more component pseudorandom numbers to produce a particular pseudorandom number;
wherein each of the two or more component pseudorandom numbers is generated by a respective subsidiary component pseudorandom number generator of the two or more subsidiary pseudorandom number generators;
determining a response to the request based, at least in part, on the particular pseudorandom number; and
returning the response to the request. 12. The one or more non-transitory computer-readable media of claim 11, wherein nonlinearly combining the two or more component pseudorandom numbers comprises:
permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers to produce a permuted pseudorandom number; and combining the permuted pseudorandom number with one or more other component pseudorandom numbers of the two or more component pseudorandom numbers. 13. The one or more non-transitory computer-readable media of claim 12, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises permuting the certain pseudorandom number based, at least in part, on at least a portion of another component pseudorandom number of the two or more component pseudorandom numbers. 14. The one or more non-transitory computer-readable media of claim 13, wherein permuting the certain pseudorandom number based, at least in part, on another component pseudorandom number of the two or more component pseudorandom numbers comprises basing the permuting on one or more highest-order bits of the other component pseudorandom number. 15. The one or more non-transitory computer-readable media of claim 12, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises rotating the bits of the certain pseudorandom number. 16. The one or more non-transitory computer-readable media of claim 11, wherein determining a response to the request based, at least in part, on the particular pseudorandom number comprises:
performing a mixing function on the particular pseudorandom number to produce a mixed pseudorandom number; and including the mixed pseudorandom number in the response to the request. 17. The one or more non-transitory computer-readable media of claim 11, wherein:
the request for a pseudorandom number is received by a first instance of a pseudorandom number generator; and the instructions further comprise instructions for:
the first instance of the pseudorandom number generator receiving a request to split the generator;
in response to receiving the request to split the generator, the first instance of the pseudorandom number generator initializing a second instance of the pseudorandom number generator. 18. The one or more non-transitory computer-readable media of claim 17, wherein the first instance of the pseudorandom number generator initializing the second instance of the pseudorandom number generator further comprises:
generating a plurality of pseudorandom numbers; and initializing the second instance of the pseudorandom number generator based on the plurality of pseudorandom numbers. 19. The one or more non-transitory computer-readable media of claim 11, wherein the instructions further comprise instructions for, prior to receiving the request for a pseudorandom number:
receiving at least four pseudorandom values; wherein each of the two or more subsidiary pseudorandom number generators is based on at least two of the at least four pseudorandom values. 20. The one or more non-transitory computer-readable media of claim 11, wherein the two or more subsidiary pseudorandom number generators are linear congruential generators. | A method and apparatus is provided for generating pseudorandom numbers in a way that is deterministic (i.e., repeatable), that passes statistical tests, can have multiple instances of objects generating pseudorandom numbers at the same time. Also, it is desirable that the collection of pseudorandom numbers generated by multiple instances have the same statistical properties as numbers generated by a single instance (i.e., randomness). Embodiments described herein generate pseudorandom values by using a plurality of subsidiary linear congruential generators and combining their outputs nonlinearly. According to embodiments, after their outputs have been combined, a mixing function is applied. Embodiments include an on-demand split method in the style of the SplitMix algorithm.1. A computer-executed method comprising:
advancing the states of two or more subsidiary pseudorandom number generators; receiving a request for a pseudorandom number; in response to receiving the request:
nonlinearly combining two or more component pseudorandom numbers to produce a particular pseudorandom number;
wherein each of the two or more component pseudorandom numbers is generated by a respective subsidiary component pseudorandom number generator of the two or more subsidiary pseudorandom number generators;
determining a response to the request based, at least in part, on the particular pseudorandom number; and
returning the response to the request;
wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein nonlinearly combining the two or more component pseudorandom numbers comprises:
permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers to produce a permuted pseudorandom number; and combining the permuted pseudorandom number with one or more other component pseudorandom numbers of the two or more component pseudorandom numbers. 3. The method of claim 2, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises permuting the certain pseudorandom number based, at least in part, on at least a portion of another component pseudorandom number of the two or more component pseudorandom numbers. 4. The method of claim 3, wherein permuting the certain pseudorandom number based, at least in part, on another component pseudorandom number of the two or more component pseudorandom numbers comprises basing the permuting on one or more highest-order bits of the other component pseudorandom number. 5. The method of claim 2, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises rotating the bits of the certain pseudorandom number. 6. The method of claim 1, wherein determining a response to the request based, at least in part, on the particular pseudorandom number comprises:
performing a mixing function on the particular pseudorandom number to produce a mixed pseudorandom number; and including the mixed pseudorandom number in the response to the request. 7. The method of claim 1, wherein the request for a pseudorandom number is received by a first instance of a pseudorandom number generator, the method further comprising:
the first instance of the pseudorandom number generator receiving a request to split the generator; in response to receiving the request to split the generator, the first instance of the pseudorandom number generator initializing a second instance of the pseudorandom number generator. 8. The method of claim 7, wherein the first instance of the pseudorandom number generator initializing the second instance of the pseudorandom number generator further comprises:
generating a plurality of pseudorandom numbers; and initializing the second instance of the pseudorandom number generator based on the plurality of pseudorandom numbers. 9. The method of claim 1, further comprising, prior to receiving the request for a pseudorandom number:
receiving at least four pseudorandom values; wherein each of the two or more subsidiary pseudorandom number generators is based on at least two of the at least four pseudorandom values. 10. The method of claim 1, wherein the two or more subsidiary pseudorandom number generators are linear congruential generators. 11. One or more non-transitory computer-readable media storing instructions which, when executed by one or more processors, causes:
advancing the states of two or more subsidiary pseudorandom number generators; receiving a request for a pseudorandom number; in response to receiving the request:
nonlinearly combining two or more component pseudorandom numbers to produce a particular pseudorandom number;
wherein each of the two or more component pseudorandom numbers is generated by a respective subsidiary component pseudorandom number generator of the two or more subsidiary pseudorandom number generators;
determining a response to the request based, at least in part, on the particular pseudorandom number; and
returning the response to the request. 12. The one or more non-transitory computer-readable media of claim 11, wherein nonlinearly combining the two or more component pseudorandom numbers comprises:
permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers to produce a permuted pseudorandom number; and combining the permuted pseudorandom number with one or more other component pseudorandom numbers of the two or more component pseudorandom numbers. 13. The one or more non-transitory computer-readable media of claim 12, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises permuting the certain pseudorandom number based, at least in part, on at least a portion of another component pseudorandom number of the two or more component pseudorandom numbers. 14. The one or more non-transitory computer-readable media of claim 13, wherein permuting the certain pseudorandom number based, at least in part, on another component pseudorandom number of the two or more component pseudorandom numbers comprises basing the permuting on one or more highest-order bits of the other component pseudorandom number. 15. The one or more non-transitory computer-readable media of claim 12, wherein permuting at least a certain pseudorandom number of the two or more component pseudorandom numbers comprises rotating the bits of the certain pseudorandom number. 16. The one or more non-transitory computer-readable media of claim 11, wherein determining a response to the request based, at least in part, on the particular pseudorandom number comprises:
performing a mixing function on the particular pseudorandom number to produce a mixed pseudorandom number; and including the mixed pseudorandom number in the response to the request. 17. The one or more non-transitory computer-readable media of claim 11, wherein:
the request for a pseudorandom number is received by a first instance of a pseudorandom number generator; and the instructions further comprise instructions for:
the first instance of the pseudorandom number generator receiving a request to split the generator;
in response to receiving the request to split the generator, the first instance of the pseudorandom number generator initializing a second instance of the pseudorandom number generator. 18. The one or more non-transitory computer-readable media of claim 17, wherein the first instance of the pseudorandom number generator initializing the second instance of the pseudorandom number generator further comprises:
generating a plurality of pseudorandom numbers; and initializing the second instance of the pseudorandom number generator based on the plurality of pseudorandom numbers. 19. The one or more non-transitory computer-readable media of claim 11, wherein the instructions further comprise instructions for, prior to receiving the request for a pseudorandom number:
receiving at least four pseudorandom values; wherein each of the two or more subsidiary pseudorandom number generators is based on at least two of the at least four pseudorandom values. 20. The one or more non-transitory computer-readable media of claim 11, wherein the two or more subsidiary pseudorandom number generators are linear congruential generators. | 2,100 |
5,088 | 14,308,188 | 2,175 | One or more embodiments described herein include methods and systems of creating transcribed electronic communications based on sound inputs. More specifically, systems and methods described herein provide users the ability to easily and effectively send an electronic communication that includes a textual message transcribed from a sound input. Additionally, systems and methods described herein provide an analysis of a textual message transcribed from a sound input allowing users to correct an inaccurate or incorrect transcription. | 1. A method comprising:
providing a messaging graphical user interface comprising a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; and detecting a selection of a sound recording control from the messaging graphical user interface; in response to the detected selection of the sound recording control, recording a message from the user; transcribing, by at least one processor, the recorded message into a textual message; sending, to one or more co-users, the recorded message and the transcribed textual message; and adding, by at the least one processor, the transcribed textual message and the recorded message to the communication thread. 2. The method as recited in claim 1, wherein recording a message from the user in response to the detected selection of the sound recording control comprises recording a message during a press-and-hold selection of the sound recording control. 3. The method as recited in claim 2, further comprising:
detecting a release of the press-and-hold selection of the sound recording control; and sending, to one or more co-users, the recorded message and the transcribed textual message in response to the detected release of the press-and-hold selection of the sound recording control. 4. The method as recited in claim 1, further comprising:
after sending, to one or more co-users, the recorded message and the transcribed textual message, receiving a correction to the transcribed textual message; in response to receiving the correction to the transcribed textual message, updating the transcribed textual message added to the communication thread with the received correction. 5. A method comprising:
providing a messaging graphical user interface comprising a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; recording, by at least one processor, a message from the user; transcribing, by the at least one processor, the recorded message into a textual message; sending to one or more co-users the recorded message and the transcribed textual message; adding the transcribed textual message and the recorded message to the communication thread; and providing, within the transcribed textual message added to the communication thread, an analysis of the transcribed textual message. 6. The method as recited in claim 5, further comprising:
providing a sound recording control within the messaging graphical user interface; detecting a press-and-hold touch gesture interacting with the sound recording control; recording the message from the user in response to the detected press-and-hold touch gesture, wherein a duration of the message recorded from the user is the same as a duration of the press-and-hold touch gesture. 7. The method as recited in claim 6, further comprising adding the transcribed textual message and the recorded message to the communication thread in response to a detected release of the press-and-hold touch gesture. 8. The method as recited in claim 7, wherein the transcribed textual message comprises one or more words, and the analysis of the transcribed textual message comprises an indicator within the transcribed textual message indicating low confidence in at least one of the one or more words. 9. The method as recited in claim 8, wherein low confidence is indicated for at least one word that is likely misspelled, grammatically incorrect, or contextually incorrect. 10. The method as recited in claim 9, wherein the indicator within the transcribed textual message indicating low confidence in at least one of the one or more words comprises the at least one word displayed differently from the remaining words in the transcribed textual message. 11. The method as recited in claim 10, wherein the at least one word is displayed differently from the remaining words in the transcribed textual message by displaying the at least one word in a first color and displaying the remaining words in a second color. 12. The method as recited in claim 11, further comprising:
detecting a selection of the indicator from the transcribed textual message added to the communication thread; and playing, a portion of the recorded message corresponding to a word associated with the indicator. 13. The method as recited in claim 12, further comprising providing one or more alternatives to the word associated with the selected indicator. 14. The method as recited in claim 13, further comprising:
detecting a selection of one of the one or more alternatives to the word associated with the indicator; substituting, within the transcribed textual message added to the communication thread, the word associated with the indicator with the selected alternative. 15. The method as recited in claim 14, further comprising, after the word associated with the indicator is substituted with the selected alternative, sending, to the one or more co-users, the transcribed textual message with the substitution. 16. The method as recited in claim 5, further comprising:
receiving a correction to the transcribed textual message; in response to receiving the correction to the transcribed textual message, updating the transcribed textual message added to the communication thread to include the received correction. 17. A non-transitory computer readable storage medium having stored thereon computer-executable instructions that, when executed by a processor, cause a computer system to:
provide a messaging graphical user interface comprising:
a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; and
a message input control area;
detect a selection of a sound recording control from within the message input control area; in response to the detected selection of the sound recording control, record a message from the user; transcribe the message recorded from the user into a textual message; send the message recorded from the user and the transcribed textual message; and add the transcribed textual message and a playback control capable of playing the message recorded from the user to the communication thread. 18. The system as recited in claim 17, further comprising computer-executable instructions that, when executed cause the computer system to:
add the transcribed textual message and the playback control capable of playing the message recorded from the user to the communication thread in response to a detected release of the selection of the sound recording control. 19. The system as recited in claim 18, further comprising computer-executable instructions that, when executed cause the computer system to:
provide an analysis of the transcribed textual message added to the communication thread, wherein the analysis comprises a low-confidence indicator associated with a portion of the transcribed textual message. 20. The system as recited in claim 19, further comprising computer-executable instructions that, when executed cause the computer system to:
detect a selection of the low-confidence indicator; play a portion of the message recorded from the user corresponding to the portion of the transcribed textual message associated with the low-confidence indicator; provide one or more alternatives to the portion of the transcribed textual message associated with the low-confidence indicator; detect a selection of one of the one or more provided alternatives; substitute the portion of the transcribed textual message associated with the low-confidence indicator with the selected provided alternative. | One or more embodiments described herein include methods and systems of creating transcribed electronic communications based on sound inputs. More specifically, systems and methods described herein provide users the ability to easily and effectively send an electronic communication that includes a textual message transcribed from a sound input. Additionally, systems and methods described herein provide an analysis of a textual message transcribed from a sound input allowing users to correct an inaccurate or incorrect transcription.1. A method comprising:
providing a messaging graphical user interface comprising a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; and detecting a selection of a sound recording control from the messaging graphical user interface; in response to the detected selection of the sound recording control, recording a message from the user; transcribing, by at least one processor, the recorded message into a textual message; sending, to one or more co-users, the recorded message and the transcribed textual message; and adding, by at the least one processor, the transcribed textual message and the recorded message to the communication thread. 2. The method as recited in claim 1, wherein recording a message from the user in response to the detected selection of the sound recording control comprises recording a message during a press-and-hold selection of the sound recording control. 3. The method as recited in claim 2, further comprising:
detecting a release of the press-and-hold selection of the sound recording control; and sending, to one or more co-users, the recorded message and the transcribed textual message in response to the detected release of the press-and-hold selection of the sound recording control. 4. The method as recited in claim 1, further comprising:
after sending, to one or more co-users, the recorded message and the transcribed textual message, receiving a correction to the transcribed textual message; in response to receiving the correction to the transcribed textual message, updating the transcribed textual message added to the communication thread with the received correction. 5. A method comprising:
providing a messaging graphical user interface comprising a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; recording, by at least one processor, a message from the user; transcribing, by the at least one processor, the recorded message into a textual message; sending to one or more co-users the recorded message and the transcribed textual message; adding the transcribed textual message and the recorded message to the communication thread; and providing, within the transcribed textual message added to the communication thread, an analysis of the transcribed textual message. 6. The method as recited in claim 5, further comprising:
providing a sound recording control within the messaging graphical user interface; detecting a press-and-hold touch gesture interacting with the sound recording control; recording the message from the user in response to the detected press-and-hold touch gesture, wherein a duration of the message recorded from the user is the same as a duration of the press-and-hold touch gesture. 7. The method as recited in claim 6, further comprising adding the transcribed textual message and the recorded message to the communication thread in response to a detected release of the press-and-hold touch gesture. 8. The method as recited in claim 7, wherein the transcribed textual message comprises one or more words, and the analysis of the transcribed textual message comprises an indicator within the transcribed textual message indicating low confidence in at least one of the one or more words. 9. The method as recited in claim 8, wherein low confidence is indicated for at least one word that is likely misspelled, grammatically incorrect, or contextually incorrect. 10. The method as recited in claim 9, wherein the indicator within the transcribed textual message indicating low confidence in at least one of the one or more words comprises the at least one word displayed differently from the remaining words in the transcribed textual message. 11. The method as recited in claim 10, wherein the at least one word is displayed differently from the remaining words in the transcribed textual message by displaying the at least one word in a first color and displaying the remaining words in a second color. 12. The method as recited in claim 11, further comprising:
detecting a selection of the indicator from the transcribed textual message added to the communication thread; and playing, a portion of the recorded message corresponding to a word associated with the indicator. 13. The method as recited in claim 12, further comprising providing one or more alternatives to the word associated with the selected indicator. 14. The method as recited in claim 13, further comprising:
detecting a selection of one of the one or more alternatives to the word associated with the indicator; substituting, within the transcribed textual message added to the communication thread, the word associated with the indicator with the selected alternative. 15. The method as recited in claim 14, further comprising, after the word associated with the indicator is substituted with the selected alternative, sending, to the one or more co-users, the transcribed textual message with the substitution. 16. The method as recited in claim 5, further comprising:
receiving a correction to the transcribed textual message; in response to receiving the correction to the transcribed textual message, updating the transcribed textual message added to the communication thread to include the received correction. 17. A non-transitory computer readable storage medium having stored thereon computer-executable instructions that, when executed by a processor, cause a computer system to:
provide a messaging graphical user interface comprising:
a communication thread comprising a plurality of electronic messages exchanged between a user and one or more co-users; and
a message input control area;
detect a selection of a sound recording control from within the message input control area; in response to the detected selection of the sound recording control, record a message from the user; transcribe the message recorded from the user into a textual message; send the message recorded from the user and the transcribed textual message; and add the transcribed textual message and a playback control capable of playing the message recorded from the user to the communication thread. 18. The system as recited in claim 17, further comprising computer-executable instructions that, when executed cause the computer system to:
add the transcribed textual message and the playback control capable of playing the message recorded from the user to the communication thread in response to a detected release of the selection of the sound recording control. 19. The system as recited in claim 18, further comprising computer-executable instructions that, when executed cause the computer system to:
provide an analysis of the transcribed textual message added to the communication thread, wherein the analysis comprises a low-confidence indicator associated with a portion of the transcribed textual message. 20. The system as recited in claim 19, further comprising computer-executable instructions that, when executed cause the computer system to:
detect a selection of the low-confidence indicator; play a portion of the message recorded from the user corresponding to the portion of the transcribed textual message associated with the low-confidence indicator; provide one or more alternatives to the portion of the transcribed textual message associated with the low-confidence indicator; detect a selection of one of the one or more provided alternatives; substitute the portion of the transcribed textual message associated with the low-confidence indicator with the selected provided alternative. | 2,100 |
5,089 | 13,306,798 | 2,153 | Changes identified between two electronic documents are grouped according to the category of the identified change, and the categorized changes are grouped and displayed to a user. Additionally, each change is assigned a review state that can be updated to reflect the status of each change as the user reviews the changes in a comparison document. | 1. A system, comprising:
a display; at least one memory component storing a software program, changes between documents, and a review state of each change; at least one input device; a processor coupled among the display, the at least one memory component, and the at least one input device, wherein the processor is configured to execute the software program, the software program comprising:
a comparison module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component;
a review state module operable to assign and update the review state of each of the changes and to store the review states in the at least one memory component;
a categorization module operable to categorize each of the changes according to a plurality of categories, wherein the display shows a first view of at least a portion of the changes organized according to the plurality of categories;
a user interface module operable to receive changes to review states from a user using the at least one input device. 2. A system, comprising:
a display; at least one memory component storing a software program; a processor coupled among the display and the memory component, wherein the processor is configured to execute the software program, the software program comprising:
a communication module operable to receive a list of changes between two documents;
a categorization module operable to categorize each of the changes according to a plurality of categories;
wherein the display shows a first view of at least a portion of the changes organized according to the plurality of categories. 3. The system of claim 2, wherein the software program further comprises a review state module operable to assign and update a review state for each of the changes and to store the review states in the at least one memory component, and wherein the at least one memory component further stores a review state for each change. 4. The system of claim 2, wherein the system further shows a second view of the changes in a context of the comparison document. 5. The system of claim 2, wherein the system further comprises at least one input device, and further wherein the software program further comprises a user interface module operable to receive changes to review states from a user using the at least one input device. 6. The system of claim 2, wherein updating the review state occurs automatically when a particular change has been visible on the display in the first view for a predetermined period of time. 7. The system of claim 2, wherein a review state is selected from a group consisting of: unreviewed, reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 8. The system of claim 7, wherein each of the different review states in the group has a different symbol associated with it and an appropriate symbol is shown near the changes in the first view. 9. The system of claim 2, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 10. The system of claim 2, wherein a user defines a one or more of the plurality of categories. 11. The system of claim 2, wherein the software program further comprises a comparison module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component; 12. The system of claim 11, wherein the comparison module is further operable to store the comparison document in the at least one memory component, and further wherein the review state for each change is stored within the comparison document as metadata. 13. A computer-implemented method of presenting a comparison of electronic documents, comprising:
identifying changes between two documents or receiving changes identified between two electronic documents; categorizing the changes according to a plurality of categories; displaying at least a portion of the changes in a first view, wherein the changes are grouped hierarchically by the plurality of categories. 14. The method of claim 13, further comprising:
assigning an initial review state to each change; updating the initial review state responsive to user input or automatically according predetermined criteria. 15. The method of claim 14, wherein the predetermined criteria comprises displaying the change for a prespecified period of time. 16. The method of claim 14, wherein the initial review state is updated to a second review state selected from a group consisting of reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 17. The method of claim 14, further comprising storing the review states associated with the changes. 18. The method of claim 17, wherein storing the review states comprises storing the review states within the comparison document as metadata. 19. The method of claim 13, further comprising displaying next to the first view a redlined view of a comparison document containing the identified changes. 20. The method of claim 13, wherein the computer implemented method is part of an add-in or extension to a master application program. 21. The method of claim 13, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 22. A computer-readable medium encoded with processing instructions for implementing a method performed by a computer, the method comprising:
identifying changes between two documents or receiving changes identified between two electronic documents; categorizing the changes according to a plurality of categories; displaying at least a portion of the changes in a first view, wherein the changes are grouped using the plurality of categories. 23. The computer-readable medium of claim 22, further comprising:
assigning an initial review state to each change; updating the initial review state responsive to user input or automatically according predetermined criteria. 24. The computer-readable medium of claim 23, wherein the predetermined criteria comprises displaying the change for a prespecified period of time. 25. The computer-readable medium of claim 23, wherein the initial review state is updated to a second review state selected from a group consisting of reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 26. The computer-readable medium of claim 22, further comprising storing the review states associated with the changes. 27. The computer-readable medium of claim 26, wherein storing the review states comprises storing the review states within the comparison document as metadata. 28. The computer-readable medium of claim 22, further comprising displaying next to the first view a redlined view of a comparison document containing the identified changes. 29. The computer-readable medium of claim 22, wherein the computer implemented method is part of an add-in or extension to a master application program. 30. The computer-readable medium of claim 22, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 31. A system, comprising:
a communications module operable to receive two documents for comparison or locations where the two documents are stored; a comparison module operable to compare the two documents to identify changes; a categorization module operable to categorize each of the changes according to a plurality of categories, wherein the communications module is further operable to transmit the comparison document and the categorized changes to a display to show a first view of at least a portion of the changes organized according to the plurality of categories. 32. The system of claim 31, further comprising:
a review state module operable to assign and update a review state to each of the changes, wherein the communications module is further operable to transmit the review states to the display to show with the first view. 33. The system of claim 31, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 34. The system of claim 32, further comprising a memory component, wherein the comparison module stores a resulting comparison document with the changes in the memory component, and further wherein the review state module stores the review states in the memory component. 35. The system of claim 32, wherein the communications module is further operable to stream the comparison document, categorized changes, or the review states to the display. 36. The system of claim 32, wherein updating a review state comprises responding to user input or automatically based upon predetermined criteria. 37. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is a potentially missing change; displaying at least a portion of a listing of the potentially missing changes. 38. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is an unexpected change; displaying at least a portion of a listing of the unexpected changes. 39. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is an unexpected boilerplate change; displaying at least a portion of a listing of the unexpected boilerplate changes. 40. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is a missing placeholder change; displaying at least a portion of a listing of the missing placeholder changes. 41. A system, comprising:
a display; at least one memory component storing a software program and changes between documents; a processor coupled among the display and the memory component, wherein the processor is configured to execute the software program, the software program comprising:
a change module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component or to receive a list of changes between two documents;
an analysis module operable to determine whether each of the changes is a particular change;
wherein the display shows a view of at least a portion of a listing of the particular changes. 42. The system of claim 41, wherein the particular change is a potentially missing change. 43. The system of claim 41, wherein the particular change is an unexpected change. 44. The system of claim 41, wherein the particular change is an unexpected boilerplate change. 45. The system of claim 41, wherein the particular change is a missing placeholder change. | Changes identified between two electronic documents are grouped according to the category of the identified change, and the categorized changes are grouped and displayed to a user. Additionally, each change is assigned a review state that can be updated to reflect the status of each change as the user reviews the changes in a comparison document.1. A system, comprising:
a display; at least one memory component storing a software program, changes between documents, and a review state of each change; at least one input device; a processor coupled among the display, the at least one memory component, and the at least one input device, wherein the processor is configured to execute the software program, the software program comprising:
a comparison module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component;
a review state module operable to assign and update the review state of each of the changes and to store the review states in the at least one memory component;
a categorization module operable to categorize each of the changes according to a plurality of categories, wherein the display shows a first view of at least a portion of the changes organized according to the plurality of categories;
a user interface module operable to receive changes to review states from a user using the at least one input device. 2. A system, comprising:
a display; at least one memory component storing a software program; a processor coupled among the display and the memory component, wherein the processor is configured to execute the software program, the software program comprising:
a communication module operable to receive a list of changes between two documents;
a categorization module operable to categorize each of the changes according to a plurality of categories;
wherein the display shows a first view of at least a portion of the changes organized according to the plurality of categories. 3. The system of claim 2, wherein the software program further comprises a review state module operable to assign and update a review state for each of the changes and to store the review states in the at least one memory component, and wherein the at least one memory component further stores a review state for each change. 4. The system of claim 2, wherein the system further shows a second view of the changes in a context of the comparison document. 5. The system of claim 2, wherein the system further comprises at least one input device, and further wherein the software program further comprises a user interface module operable to receive changes to review states from a user using the at least one input device. 6. The system of claim 2, wherein updating the review state occurs automatically when a particular change has been visible on the display in the first view for a predetermined period of time. 7. The system of claim 2, wherein a review state is selected from a group consisting of: unreviewed, reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 8. The system of claim 7, wherein each of the different review states in the group has a different symbol associated with it and an appropriate symbol is shown near the changes in the first view. 9. The system of claim 2, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 10. The system of claim 2, wherein a user defines a one or more of the plurality of categories. 11. The system of claim 2, wherein the software program further comprises a comparison module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component; 12. The system of claim 11, wherein the comparison module is further operable to store the comparison document in the at least one memory component, and further wherein the review state for each change is stored within the comparison document as metadata. 13. A computer-implemented method of presenting a comparison of electronic documents, comprising:
identifying changes between two documents or receiving changes identified between two electronic documents; categorizing the changes according to a plurality of categories; displaying at least a portion of the changes in a first view, wherein the changes are grouped hierarchically by the plurality of categories. 14. The method of claim 13, further comprising:
assigning an initial review state to each change; updating the initial review state responsive to user input or automatically according predetermined criteria. 15. The method of claim 14, wherein the predetermined criteria comprises displaying the change for a prespecified period of time. 16. The method of claim 14, wherein the initial review state is updated to a second review state selected from a group consisting of reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 17. The method of claim 14, further comprising storing the review states associated with the changes. 18. The method of claim 17, wherein storing the review states comprises storing the review states within the comparison document as metadata. 19. The method of claim 13, further comprising displaying next to the first view a redlined view of a comparison document containing the identified changes. 20. The method of claim 13, wherein the computer implemented method is part of an add-in or extension to a master application program. 21. The method of claim 13, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 22. A computer-readable medium encoded with processing instructions for implementing a method performed by a computer, the method comprising:
identifying changes between two documents or receiving changes identified between two electronic documents; categorizing the changes according to a plurality of categories; displaying at least a portion of the changes in a first view, wherein the changes are grouped using the plurality of categories. 23. The computer-readable medium of claim 22, further comprising:
assigning an initial review state to each change; updating the initial review state responsive to user input or automatically according predetermined criteria. 24. The computer-readable medium of claim 23, wherein the predetermined criteria comprises displaying the change for a prespecified period of time. 25. The computer-readable medium of claim 23, wherein the initial review state is updated to a second review state selected from a group consisting of reviewed and accepted, reviewed and rejected, and reviewed and needs further discussion. 26. The computer-readable medium of claim 22, further comprising storing the review states associated with the changes. 27. The computer-readable medium of claim 26, wherein storing the review states comprises storing the review states within the comparison document as metadata. 28. The computer-readable medium of claim 22, further comprising displaying next to the first view a redlined view of a comparison document containing the identified changes. 29. The computer-readable medium of claim 22, wherein the computer implemented method is part of an add-in or extension to a master application program. 30. The computer-readable medium of claim 22, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 31. A system, comprising:
a communications module operable to receive two documents for comparison or locations where the two documents are stored; a comparison module operable to compare the two documents to identify changes; a categorization module operable to categorize each of the changes according to a plurality of categories, wherein the communications module is further operable to transmit the comparison document and the categorized changes to a display to show a first view of at least a portion of the changes organized according to the plurality of categories. 32. The system of claim 31, further comprising:
a review state module operable to assign and update a review state to each of the changes, wherein the communications module is further operable to transmit the review states to the display to show with the first view. 33. The system of claim 31, wherein the plurality of categories comprises trivial changes, matching changes, potentially missing changes, unexpected changes, unexpected boilerplate changes, and missing placeholder changes. 34. The system of claim 32, further comprising a memory component, wherein the comparison module stores a resulting comparison document with the changes in the memory component, and further wherein the review state module stores the review states in the memory component. 35. The system of claim 32, wherein the communications module is further operable to stream the comparison document, categorized changes, or the review states to the display. 36. The system of claim 32, wherein updating a review state comprises responding to user input or automatically based upon predetermined criteria. 37. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is a potentially missing change; displaying at least a portion of a listing of the potentially missing changes. 38. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is an unexpected change; displaying at least a portion of a listing of the unexpected changes. 39. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is an unexpected boilerplate change; displaying at least a portion of a listing of the unexpected boilerplate changes. 40. A computer-implemented method, comprising:
identifying changes between two documents or receiving changes identified between the two documents; determining whether each of the changes is a missing placeholder change; displaying at least a portion of a listing of the missing placeholder changes. 41. A system, comprising:
a display; at least one memory component storing a software program and changes between documents; a processor coupled among the display and the memory component, wherein the processor is configured to execute the software program, the software program comprising:
a change module operable to compare two documents for changes and to store a resulting comparison document with the changes in the at least one memory component or to receive a list of changes between two documents;
an analysis module operable to determine whether each of the changes is a particular change;
wherein the display shows a view of at least a portion of a listing of the particular changes. 42. The system of claim 41, wherein the particular change is a potentially missing change. 43. The system of claim 41, wherein the particular change is an unexpected change. 44. The system of claim 41, wherein the particular change is an unexpected boilerplate change. 45. The system of claim 41, wherein the particular change is a missing placeholder change. | 2,100 |
5,090 | 13,759,838 | 2,169 | A viewing user is provided with sponsored stories describes actions of a user connected to the viewing user associated with an object promoted by an advertiser or actions otherwise promoted by the advertiser. Based on a performance metric, the social networking system selects the user or action to be described by the sponsored story. For example, the social networking system ranks candidate sponsored stories describing different actions or users and selects a candidate sponsored story to increase the likelihood of a viewing user interacting with the selected candidate sponsored story. | 1. A method comprising:
storing, in a social networking system, a user profile associated with a viewing user, the user profile identifying one or more users of the social networking system connected to the viewing user; receiving a story request for a sponsored story unit, the story request identifying content to be included in the requested sponsored story; identifying interactions with objects by users of the social networking system connected to the viewing user, the interactions identified based on the content identified by the story request; generating candidate sponsored stories based on the identified interaction, each candidate sponsored story describing an interaction performed by a user of the social networking system who is connected to the viewing user; ranking the candidate sponsored stories based on a performance metric specified by the story request, the performance metric specifying an objective for the sponsored story unit; selecting a candidate sponsored story based in part on the ranking; generating the sponsored story unit including the selected candidate sponsored story; and presenting the sponsored story unit to the viewing user. 2. The method of claim 1, further comprising:
receiving an interaction with the sponsored story unit from the viewing user; collecting a performance metric for the sponsored story unit based at least in part on the received interaction; and storing the performance metric for the sponsored story unit. 3. The method of claim 1, further comprising:
ranking subsequently generated candidate sponsored stories based at least in part on the performance metric. 4. The method of claim 1, wherein the performance metric is selected from a group consisting of: a unique number of users of the social networking system to which the sponsored story unit was presented, a percentage of users of the social networking system to which the sponsored story unit was presented, a number of users of the social networking system interacting with the sponsored story unit, a click-through-rate, an amount of revenue associated with the sponsored story unit, a frequency of interactions with the sponsored story unit by users of the social networking system, and any combination thereof. 5. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
determining affinities between the viewing user and each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 6. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
determining affinities between the viewing user and a user described by each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 7. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories so candidate sponsored stories describing a type of action specified by the request have a higher position in the ranking 8. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories based on a time associated with an interaction described by a candidate sponsored story. 9. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories based on a number of user interactions with an object described by each candidate sponsored story. 10. The method of claim 1, wherein the objective for the sponsored story unit is selected from a group consisting of: maximizing a number of users of the social networking system presented with the sponsored story unit, maximizing a percentage of users of the social networking system presented with the sponsored story unit, maximizing a number of interactions with the sponsored story unit, maximizing a frequency of interaction with the sponsored story unit, maximizing revenue for an advertiser associated with the sponsored story unit, and any combination thereof. 11. A method comprising:
storing, in a social networking system, a user profile associated with a viewing user, the user profile identifying one or more users of the social networking system connected to the viewing user; receiving a story request for a sponsored story unit, the story request identifying content to be included in the requested sponsored story; identifying interactions with objects by users of the social networking system connected to the viewing user, the interactions identified based on the content identified by the story request; generating candidate sponsored stories based on the identified interaction, each candidate sponsored story describing an interaction performed by a user of the social networking system who is connected to the viewing user; ranking the candidate sponsored stories based on an objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units; selecting a candidate sponsored story based in part on the ranking; generating the sponsored story unit including the selected candidate sponsored story; presenting the sponsored story unit to the viewing user; and modifying the objective based on an interaction with the sponsored story unit. 12. The method of claim 11, wherein the performance metric is selected from a group consisting of: a unique number of users of the social networking system to which the sponsored story unit was presented, a percentage of users of the social networking system to which the sponsored story unit was presented, a number of users of the social networking system interacting with the sponsored story unit, a click-through-rate, an amount of revenue associated with the sponsored story unit, a frequency of interactions with the sponsored story unit by users of the social networking system, and any combination thereof. 13. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units comprises:
determining affinities between the viewing user and each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 14. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units comprises:
determining affinities between the viewing user and a user described by each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 15. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units:
ranking the candidate sponsored stories so candidate sponsored stories describing a type of action specified by the request have a higher position in the ranking 16. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units: ranking the candidate sponsored stories based on a time associated with an interaction described by a candidate sponsored story. | A viewing user is provided with sponsored stories describes actions of a user connected to the viewing user associated with an object promoted by an advertiser or actions otherwise promoted by the advertiser. Based on a performance metric, the social networking system selects the user or action to be described by the sponsored story. For example, the social networking system ranks candidate sponsored stories describing different actions or users and selects a candidate sponsored story to increase the likelihood of a viewing user interacting with the selected candidate sponsored story.1. A method comprising:
storing, in a social networking system, a user profile associated with a viewing user, the user profile identifying one or more users of the social networking system connected to the viewing user; receiving a story request for a sponsored story unit, the story request identifying content to be included in the requested sponsored story; identifying interactions with objects by users of the social networking system connected to the viewing user, the interactions identified based on the content identified by the story request; generating candidate sponsored stories based on the identified interaction, each candidate sponsored story describing an interaction performed by a user of the social networking system who is connected to the viewing user; ranking the candidate sponsored stories based on a performance metric specified by the story request, the performance metric specifying an objective for the sponsored story unit; selecting a candidate sponsored story based in part on the ranking; generating the sponsored story unit including the selected candidate sponsored story; and presenting the sponsored story unit to the viewing user. 2. The method of claim 1, further comprising:
receiving an interaction with the sponsored story unit from the viewing user; collecting a performance metric for the sponsored story unit based at least in part on the received interaction; and storing the performance metric for the sponsored story unit. 3. The method of claim 1, further comprising:
ranking subsequently generated candidate sponsored stories based at least in part on the performance metric. 4. The method of claim 1, wherein the performance metric is selected from a group consisting of: a unique number of users of the social networking system to which the sponsored story unit was presented, a percentage of users of the social networking system to which the sponsored story unit was presented, a number of users of the social networking system interacting with the sponsored story unit, a click-through-rate, an amount of revenue associated with the sponsored story unit, a frequency of interactions with the sponsored story unit by users of the social networking system, and any combination thereof. 5. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
determining affinities between the viewing user and each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 6. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
determining affinities between the viewing user and a user described by each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 7. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories so candidate sponsored stories describing a type of action specified by the request have a higher position in the ranking 8. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories based on a time associated with an interaction described by a candidate sponsored story. 9. The method of claim 1, wherein ranking the candidate sponsored stories based on the performance metric specified by the story request comprises:
ranking the candidate sponsored stories based on a number of user interactions with an object described by each candidate sponsored story. 10. The method of claim 1, wherein the objective for the sponsored story unit is selected from a group consisting of: maximizing a number of users of the social networking system presented with the sponsored story unit, maximizing a percentage of users of the social networking system presented with the sponsored story unit, maximizing a number of interactions with the sponsored story unit, maximizing a frequency of interaction with the sponsored story unit, maximizing revenue for an advertiser associated with the sponsored story unit, and any combination thereof. 11. A method comprising:
storing, in a social networking system, a user profile associated with a viewing user, the user profile identifying one or more users of the social networking system connected to the viewing user; receiving a story request for a sponsored story unit, the story request identifying content to be included in the requested sponsored story; identifying interactions with objects by users of the social networking system connected to the viewing user, the interactions identified based on the content identified by the story request; generating candidate sponsored stories based on the identified interaction, each candidate sponsored story describing an interaction performed by a user of the social networking system who is connected to the viewing user; ranking the candidate sponsored stories based on an objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units; selecting a candidate sponsored story based in part on the ranking; generating the sponsored story unit including the selected candidate sponsored story; presenting the sponsored story unit to the viewing user; and modifying the objective based on an interaction with the sponsored story unit. 12. The method of claim 11, wherein the performance metric is selected from a group consisting of: a unique number of users of the social networking system to which the sponsored story unit was presented, a percentage of users of the social networking system to which the sponsored story unit was presented, a number of users of the social networking system interacting with the sponsored story unit, a click-through-rate, an amount of revenue associated with the sponsored story unit, a frequency of interactions with the sponsored story unit by users of the social networking system, and any combination thereof. 13. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units comprises:
determining affinities between the viewing user and each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 14. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units comprises:
determining affinities between the viewing user and a user described by each candidate sponsored story; and ranking the candidate sponsored stories based on the affinities. 15. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units:
ranking the candidate sponsored stories so candidate sponsored stories describing a type of action specified by the request have a higher position in the ranking 16. The method of claim 11, wherein ranking the candidate sponsored stories based on the objective specified by the story request and a performance metric based on interactions with previously presented sponsored story units: ranking the candidate sponsored stories based on a time associated with an interaction described by a candidate sponsored story. | 2,100 |
5,091 | 14,598,628 | 2,122 | A system is provided for multi-methodology, multi-user, self-optimizing Machine Learning as a Service for that automates and optimizes the model training process. The system uses a large-scale distributed architecture and is compatible with cloud services. The system uses a hybrid optimization technique to select between multiple machine learning approaches for a given dataset. The system can also use datasets to transferring knowledge of how one modeling methodology has previously worked over to a new problem. | 1. A system to automate selection and training of machine learning models across multiple modeling methodologies, the system comprising:
a model methodology repository configured to store one or more model methodology implementations, each of the model methodology implementations associated with a modeling methodology; a dataset repository configured to store datasets; a data hub configured to store data run records and performance records; a dataset upload interface (UI) configured to receive a dataset, store the received dataset within the dataset repository, to generate a data run record comprising the location of received dataset within the dataset repository, and to store the generated data run record to the data hub; and a processing cluster comprising a plurality of worker nodes, each of the worker nodes configured to select a data run record from the data hub, to select a dataset from the dataset repository, to select a modeling methodology from the model methodology repository; to generate a parameterization within with the model methodology, to generate a model having the selected modeling methodology and generated parameterization, to train the generated model on the selected dataset, to evaluate the performance of the trained model on the selected dataset, to generate a performance record, and to store the generated performance record to the data hub. 2. The system of claim 1 wherein each of the data run records comprising a dataset location identifying one of the stored datasets within the dataset repository, wherein the each of the worker nodes is configured to select a dataset from the dataset repository based upon the dataset location identified by the data run record. 3. The system of claim 2 wherein each of the performance records is associated with a data run record and a modeling methodology, each of the performance records comprising a parameterization within the associated modeling methodology and performance data indicating the performance of the model parameterization on the associated dataset, wherein each of the worker nodes is configured to and to generate a performance record comprising the evaluated performance and associated with the selected data run, the selected modeling methodology, and the generated parameterization. 4. The system of claim 2 wherein the dataset UI is further configured to receive one or more parameters and to store the one of more parameters with a data run record. 5. The system of claim 4 wherein the parameters include a wall time budget, a performance threshold, number of models to evaluate, or a performance metric. 6. The system of claim 5 wherein at least one of the worker nodes is configured to correlate the performance of models on a first dataset to the performance of models on a second dataset. 7. The system of claim 5 wherein at least one of the worker nodes is configured to use a Bandit strategy to optimize a model for a dataset. 8. The system of claim 7 wherein the parameters include a Bandit strategy memory type, a Bandit strategy reward type, or a Bandit strategy grouping type. 9. The system of claim 7 wherein at least one of the worker nodes is configured to use a Gaussian Process (GP) model to select a model for a dataset, wherein the selected model maximizes an acquisition function. 10. The system of claim 9 wherein the parameters include the acquisition function. 11. The system of claim 1 further comprising a trained model repository, wherein at least one of the worker nodes is configured to store a trained model within the trained model repository. 12. A method for machine learning comprising:
(a) generating a plurality modeling possibilities across a plurality of modeling methodologies; (b) receiving a first dataset; (c) selecting a first plurality of models from the modeling possibilities; (d) evaluating a performance of each one of the first plurality of models on the first dataset; (e) receiving a second dataset; (f) selecting a second plurality of models from the modeling possibilities; (g) evaluating a performance of each one of the second plurality of models on the second dataset; (h) receiving a third dataset; (i) selecting a third plurality of models from the modeling possibilities; (j) evaluating a performance of each one of the third plurality of models on the third dataset; (k) generating a first performance vector comprising the performance of each one of the first plurality of models on the first dataset; (l) generating a second performance vector comprising the performance of each one of the second plurality of models on the second dataset; (m) generating a third performance vector comprising the performance of each one of the third plurality of models on the third dataset; (n) selecting from the first and second datasets, the most similar dataset based upon comparing a similarity between the first and third performance vectors and a similarity between the second and third performance vectors; (o) among the models trained for the most similar dataset, select the one with the highest performance on the most similar dataset; (p) evaluating a performance of the selected model on the third dataset; (q) add the performance of the selected model on the third dataset to the third performance vector; and (r) returning a model from the third performance vector having a highest performance of models in the third performance vector. 13. The method of claim 12 wherein the steps (n)-(r) are repeated until the model having the highest performance from the third performance vector has a performance greater than or equal to a predetermined performance threshold. 14. The method of claim 12 wherein the steps (n)-(r) are repeated until a predetermined wall time budget is exceeded. 15. The method of claim 12 wherein the steps (n)-(r) are repeated until performance of a predetermined number of models is evaluated. 16. The method of claim 12 wherein evaluating the performance of each one of the first plurality of models on the first dataset comprises storing a plurality of performances records to a database, wherein generate a first performance vector comprising the performance of each one of the first plurality of models on the first dataset comprises retrieving the first plurality of performance records from the database, wherein each of the plurality of performance records is associated with the first dataset and one of the first plurality of models, wherein each of the plurality of performance records comprises performance data indicating the performance of the associated model on the first dataset. 17. The method of claim 12 further comprising:
estimating the performance of one or more of the modeling possibilities not in the third plurality of models on the third dataset using collaborative filtering or matrix factorization techniques; and
adding the estimated performances to the third performance vector. 18. The method of claim 12 wherein generating a plurality modeling possibilities across a plurality of modeling methodologies comprises:
enumerating a plurality of hyperpartitions across a plurality of modeling methodologies; and
for optimizable model parameters and hyperparameters, choose a feasible step size to derive a plurality of modeling possibilities. 19. A method for machine learning comprising:
(a) receiving a dataset; (b) enumerating a plurality of hyperpartitions across a plurality of modeling methodologies; (c) generating a plurality initial models, each of the initial models associated with one of the plurality of hyperpartitions; (d) evaluating a performance of each of the plurality of initial models on the dataset; (e) providing a Multi-Armed Bandit (MAB) comprising a plurality of arms, each of the arms corresponding to at least one of the plurality of hyperpartitions; (f) calculating a score for each of the MAB arms based upon the performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions; (g) choosing a hyperpartition based upon the MAB arm scores; (h) generating a Gaussian Process (GP) model using the performance of evaluated models associated with the chosen hyperpartition; (i) generating a plurality of proposed models, each of the modeling possibilities associated with the chosen hyperpartition; (j) estimating a performance of each of the proposed models using the GP model; (k) choosing a model from the proposed models maximizing an acquisition function; (l) evaluating the performance of the chosen model on the dataset; and (m) returning a model having the highest performance on the dataset of the models evaluated. 20. The method of claim 19 wherein the steps (f)-(l) are repeated until a model having the highest performance on the dataset has a performance greater than or equal to a predetermined performance threshold. 21. The method of claim 19 wherein the steps (f)-(l) are repeated until a predetermined wall time budget is exceeded. 22. The method of claim 19 wherein providing MAB comprises providing a MAB comprising a plurality of arms, each of the arms corresponding to at least two of the plurality of hyperpartitions associated with the same modeling methodology. 23. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon the performance of the most recent K evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 24. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon the performance of a best K evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 25. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon an average performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 26. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon a derivative of the performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 27. The method of claim 19 wherein choosing a hyperpartition based upon the MAB arm scores comprises choosing a hyperpartition using an Upper Confidence Bound-1 (UCB1) algorithm. | A system is provided for multi-methodology, multi-user, self-optimizing Machine Learning as a Service for that automates and optimizes the model training process. The system uses a large-scale distributed architecture and is compatible with cloud services. The system uses a hybrid optimization technique to select between multiple machine learning approaches for a given dataset. The system can also use datasets to transferring knowledge of how one modeling methodology has previously worked over to a new problem.1. A system to automate selection and training of machine learning models across multiple modeling methodologies, the system comprising:
a model methodology repository configured to store one or more model methodology implementations, each of the model methodology implementations associated with a modeling methodology; a dataset repository configured to store datasets; a data hub configured to store data run records and performance records; a dataset upload interface (UI) configured to receive a dataset, store the received dataset within the dataset repository, to generate a data run record comprising the location of received dataset within the dataset repository, and to store the generated data run record to the data hub; and a processing cluster comprising a plurality of worker nodes, each of the worker nodes configured to select a data run record from the data hub, to select a dataset from the dataset repository, to select a modeling methodology from the model methodology repository; to generate a parameterization within with the model methodology, to generate a model having the selected modeling methodology and generated parameterization, to train the generated model on the selected dataset, to evaluate the performance of the trained model on the selected dataset, to generate a performance record, and to store the generated performance record to the data hub. 2. The system of claim 1 wherein each of the data run records comprising a dataset location identifying one of the stored datasets within the dataset repository, wherein the each of the worker nodes is configured to select a dataset from the dataset repository based upon the dataset location identified by the data run record. 3. The system of claim 2 wherein each of the performance records is associated with a data run record and a modeling methodology, each of the performance records comprising a parameterization within the associated modeling methodology and performance data indicating the performance of the model parameterization on the associated dataset, wherein each of the worker nodes is configured to and to generate a performance record comprising the evaluated performance and associated with the selected data run, the selected modeling methodology, and the generated parameterization. 4. The system of claim 2 wherein the dataset UI is further configured to receive one or more parameters and to store the one of more parameters with a data run record. 5. The system of claim 4 wherein the parameters include a wall time budget, a performance threshold, number of models to evaluate, or a performance metric. 6. The system of claim 5 wherein at least one of the worker nodes is configured to correlate the performance of models on a first dataset to the performance of models on a second dataset. 7. The system of claim 5 wherein at least one of the worker nodes is configured to use a Bandit strategy to optimize a model for a dataset. 8. The system of claim 7 wherein the parameters include a Bandit strategy memory type, a Bandit strategy reward type, or a Bandit strategy grouping type. 9. The system of claim 7 wherein at least one of the worker nodes is configured to use a Gaussian Process (GP) model to select a model for a dataset, wherein the selected model maximizes an acquisition function. 10. The system of claim 9 wherein the parameters include the acquisition function. 11. The system of claim 1 further comprising a trained model repository, wherein at least one of the worker nodes is configured to store a trained model within the trained model repository. 12. A method for machine learning comprising:
(a) generating a plurality modeling possibilities across a plurality of modeling methodologies; (b) receiving a first dataset; (c) selecting a first plurality of models from the modeling possibilities; (d) evaluating a performance of each one of the first plurality of models on the first dataset; (e) receiving a second dataset; (f) selecting a second plurality of models from the modeling possibilities; (g) evaluating a performance of each one of the second plurality of models on the second dataset; (h) receiving a third dataset; (i) selecting a third plurality of models from the modeling possibilities; (j) evaluating a performance of each one of the third plurality of models on the third dataset; (k) generating a first performance vector comprising the performance of each one of the first plurality of models on the first dataset; (l) generating a second performance vector comprising the performance of each one of the second plurality of models on the second dataset; (m) generating a third performance vector comprising the performance of each one of the third plurality of models on the third dataset; (n) selecting from the first and second datasets, the most similar dataset based upon comparing a similarity between the first and third performance vectors and a similarity between the second and third performance vectors; (o) among the models trained for the most similar dataset, select the one with the highest performance on the most similar dataset; (p) evaluating a performance of the selected model on the third dataset; (q) add the performance of the selected model on the third dataset to the third performance vector; and (r) returning a model from the third performance vector having a highest performance of models in the third performance vector. 13. The method of claim 12 wherein the steps (n)-(r) are repeated until the model having the highest performance from the third performance vector has a performance greater than or equal to a predetermined performance threshold. 14. The method of claim 12 wherein the steps (n)-(r) are repeated until a predetermined wall time budget is exceeded. 15. The method of claim 12 wherein the steps (n)-(r) are repeated until performance of a predetermined number of models is evaluated. 16. The method of claim 12 wherein evaluating the performance of each one of the first plurality of models on the first dataset comprises storing a plurality of performances records to a database, wherein generate a first performance vector comprising the performance of each one of the first plurality of models on the first dataset comprises retrieving the first plurality of performance records from the database, wherein each of the plurality of performance records is associated with the first dataset and one of the first plurality of models, wherein each of the plurality of performance records comprises performance data indicating the performance of the associated model on the first dataset. 17. The method of claim 12 further comprising:
estimating the performance of one or more of the modeling possibilities not in the third plurality of models on the third dataset using collaborative filtering or matrix factorization techniques; and
adding the estimated performances to the third performance vector. 18. The method of claim 12 wherein generating a plurality modeling possibilities across a plurality of modeling methodologies comprises:
enumerating a plurality of hyperpartitions across a plurality of modeling methodologies; and
for optimizable model parameters and hyperparameters, choose a feasible step size to derive a plurality of modeling possibilities. 19. A method for machine learning comprising:
(a) receiving a dataset; (b) enumerating a plurality of hyperpartitions across a plurality of modeling methodologies; (c) generating a plurality initial models, each of the initial models associated with one of the plurality of hyperpartitions; (d) evaluating a performance of each of the plurality of initial models on the dataset; (e) providing a Multi-Armed Bandit (MAB) comprising a plurality of arms, each of the arms corresponding to at least one of the plurality of hyperpartitions; (f) calculating a score for each of the MAB arms based upon the performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions; (g) choosing a hyperpartition based upon the MAB arm scores; (h) generating a Gaussian Process (GP) model using the performance of evaluated models associated with the chosen hyperpartition; (i) generating a plurality of proposed models, each of the modeling possibilities associated with the chosen hyperpartition; (j) estimating a performance of each of the proposed models using the GP model; (k) choosing a model from the proposed models maximizing an acquisition function; (l) evaluating the performance of the chosen model on the dataset; and (m) returning a model having the highest performance on the dataset of the models evaluated. 20. The method of claim 19 wherein the steps (f)-(l) are repeated until a model having the highest performance on the dataset has a performance greater than or equal to a predetermined performance threshold. 21. The method of claim 19 wherein the steps (f)-(l) are repeated until a predetermined wall time budget is exceeded. 22. The method of claim 19 wherein providing MAB comprises providing a MAB comprising a plurality of arms, each of the arms corresponding to at least two of the plurality of hyperpartitions associated with the same modeling methodology. 23. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon the performance of the most recent K evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 24. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon the performance of a best K evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 25. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon an average performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 26. The method of claim 19 wherein calculating a score for each of a MAB arm comprises calculating a score based upon a derivative of the performance of evaluated models associated with the corresponding at least one of the plurality of hyperpartitions. 27. The method of claim 19 wherein choosing a hyperpartition based upon the MAB arm scores comprises choosing a hyperpartition using an Upper Confidence Bound-1 (UCB1) algorithm. | 2,100 |
5,092 | 14,189,433 | 2,153 | A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question. | 1. A method comprising:
gathering data statistics, wherein the data statistics are generated by a plurality of components of a database system during execution of database processes; receiving a statistical question requiring an estimate for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and providing the answer to the statistical question in real-time based on the data statistics. 2. The method of claim 1, wherein the database process processes a query and the answer is an execution cost estimate, and further comprising:
generating a query execution plan for the query based on the execution cost estimate. 3. The method of claim 1, wherein the database process load balances the database system, and further comprising:
load balancing the database system based on the answer. 4. The method of claim 1, further comprising:
building a data statistics object from the data statistics, wherein the data statistics object is associated with performance of a component of the plurality of components in the database system. 5. The method of claim 4, wherein the component of the database system facilitates execution of a query. 6. The method of claim 4, further comprising:
modifying the data statistics object based on utilization of the data statistics object in providing the answer to the statistical question. 7. The method of claim 4, further comprising:
modifying the data statistics object based on data generated by the plurality of components of the database system. 8. The method of claim 1, further comprising:
modifying a data statistics object based on a plurality of statistical questions posed by the plurality of components in the database system. 9. The method of claim 1, further comprising:
retrieving a data statistics object that generates the answer to the statistical question; generating the answer to the statistical question based on using the data statistics object; and generating the execution cost estimate based on the answer. 10. The method of claim 1, further comprising:
retrieving a first data statistics object and a second data statistics object; and generating the answer to the statistical question by combining the first data statistics object and the second data statistics object. 11. A system comprising:
a memory; at least one processor coupled to a memory, wherein the at least one processor is further configured to:
gather data statistics, wherein the data statistics are generated by a plurality of components of a database system during execution of database processes;
receive a statistical question requiring an answer for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and
provide the answer to the statistical question in real-time based on the data statistics. 12. The system of claim 11, wherein the database process processes a query and the answer is an execution cost estimate, and the at least one processor is further configured to:
generate a query execution plan for the query based on the execution cost estimate. 13. The system of claim 11, wherein the at least one processor is further configured to:
build a data statistics object from the data statistics, wherein the data statistics object is associated with performance of a component of the plurality of components in the database system. 14. The system of claim 14, wherein the component of the database system facilitates execution of a query. 15. The system of claim 14, wherein the at least one processor is further configured to:
modify the data statistics object based on utilization of the data statistics object in providing the answer. 16. The system of claim 14, wherein the at least one processor is further configured to:
modify the data statistics object based on data generated by the plurality of components of the database management system. 17. The system of claim 11, wherein the at least one processor is further configured to:
modify a data statistics object based on a plurality of statistical questions posed to the database system. 18. The system of claim 11, wherein the at least one processor is further configured to:
retrieve a data statistics object that generates the answer to the statistical question; generate the answer to the statistical question based on the data statistics object; and generate the execution cost estimate based on the answer. 19. The system of claim 18, wherein the at least one processor is further configured to:
retrieve a first data statistics object and a second data statistics object; and generate the answer to the statistical question by combining the first data statistics object and the second data statistics object. 20. A computer-readable device having instructions stored thereon that, when executed by at least one computing device, causes the at least one computing device to perform operations comprising:
gathering data statistics, wherein the data statistics are generated by a plurality components of a database system during execution of database processes; receiving a statistical question requiring an answer for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and providing the answer to the statistical question in real-time based on the data statistics. | A system, computer-implemented method, and a computer-readable storage medium for determining estimations to statistical questions. Data statistics used in evaluating estimations to statistical questions are gathered from multiple sources in a database management system. A statistical question comprising, for example, cardinality estimations is received, wherein the question is posed by different database components, such as query optimizer, or execution engine. Estimation for the statistical question is computed, where the estimation is based on multiple data statistics and without using the data referred to in the question.1. A method comprising:
gathering data statistics, wherein the data statistics are generated by a plurality of components of a database system during execution of database processes; receiving a statistical question requiring an estimate for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and providing the answer to the statistical question in real-time based on the data statistics. 2. The method of claim 1, wherein the database process processes a query and the answer is an execution cost estimate, and further comprising:
generating a query execution plan for the query based on the execution cost estimate. 3. The method of claim 1, wherein the database process load balances the database system, and further comprising:
load balancing the database system based on the answer. 4. The method of claim 1, further comprising:
building a data statistics object from the data statistics, wherein the data statistics object is associated with performance of a component of the plurality of components in the database system. 5. The method of claim 4, wherein the component of the database system facilitates execution of a query. 6. The method of claim 4, further comprising:
modifying the data statistics object based on utilization of the data statistics object in providing the answer to the statistical question. 7. The method of claim 4, further comprising:
modifying the data statistics object based on data generated by the plurality of components of the database system. 8. The method of claim 1, further comprising:
modifying a data statistics object based on a plurality of statistical questions posed by the plurality of components in the database system. 9. The method of claim 1, further comprising:
retrieving a data statistics object that generates the answer to the statistical question; generating the answer to the statistical question based on using the data statistics object; and generating the execution cost estimate based on the answer. 10. The method of claim 1, further comprising:
retrieving a first data statistics object and a second data statistics object; and generating the answer to the statistical question by combining the first data statistics object and the second data statistics object. 11. A system comprising:
a memory; at least one processor coupled to a memory, wherein the at least one processor is further configured to:
gather data statistics, wherein the data statistics are generated by a plurality of components of a database system during execution of database processes;
receive a statistical question requiring an answer for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and
provide the answer to the statistical question in real-time based on the data statistics. 12. The system of claim 11, wherein the database process processes a query and the answer is an execution cost estimate, and the at least one processor is further configured to:
generate a query execution plan for the query based on the execution cost estimate. 13. The system of claim 11, wherein the at least one processor is further configured to:
build a data statistics object from the data statistics, wherein the data statistics object is associated with performance of a component of the plurality of components in the database system. 14. The system of claim 14, wherein the component of the database system facilitates execution of a query. 15. The system of claim 14, wherein the at least one processor is further configured to:
modify the data statistics object based on utilization of the data statistics object in providing the answer. 16. The system of claim 14, wherein the at least one processor is further configured to:
modify the data statistics object based on data generated by the plurality of components of the database management system. 17. The system of claim 11, wherein the at least one processor is further configured to:
modify a data statistics object based on a plurality of statistical questions posed to the database system. 18. The system of claim 11, wherein the at least one processor is further configured to:
retrieve a data statistics object that generates the answer to the statistical question; generate the answer to the statistical question based on the data statistics object; and generate the execution cost estimate based on the answer. 19. The system of claim 18, wherein the at least one processor is further configured to:
retrieve a first data statistics object and a second data statistics object; and generate the answer to the statistical question by combining the first data statistics object and the second data statistics object. 20. A computer-readable device having instructions stored thereon that, when executed by at least one computing device, causes the at least one computing device to perform operations comprising:
gathering data statistics, wherein the data statistics are generated by a plurality components of a database system during execution of database processes; receiving a statistical question requiring an answer for processing a statement relevant to a database process subsequent to the gathering, wherein the statistical question is posed by the database process prior to executing the statement; and providing the answer to the statistical question in real-time based on the data statistics. | 2,100 |
5,093 | 14,937,399 | 2,174 | Systems and methods are disclosed for providing an icon for display by a user interface from an automation device that the icon depicts. Specifically, present embodiments are directed to methods and systems capable of detecting, with processing circuitry of an automation device, a shell program on a workstation via an automation control network. Further, embodiments are capable of providing icon configuration data to the shell program from the automation device, wherein the configuration data controls characteristics of an icon representative of the automation device for display in a visualization of the workstation. | 1. An industrial automation method, comprising:
storing, on an industrial automation component, a user interface comprising an executable program; receiving, on the industrial automation component, a communication from a remote computer system in communication with the industrial automation component via a network; sending, from the industrial automation component to the remote computer system, a representation of the industrial automation component for display on the remote computer system; receiving a request, on the industrial automation component from the remote computer system; and in response to the request, serving from the user interface the executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via a browser running on the remote computer system that, without the executable program is incapable of accessing data from the industrial automation component. 2. The method of claim 1, wherein the representation comprises a configurable icon. 3. The method of claim 2, wherein the request is generated by a user selection of the configurable icon on the remote computer system. 4. The method of claim 1, comprising receiving, on the industrial automation component from the remote computer system, a request for operational data from the industrial automation component, the request originating from execution of the executable program on the remote computer system. 5. The method of claim 1, comprising receiving, on the industrial automation component from the remote computer system, a request for operational data from a different industrial automation component, the request originating from execution of the executable program on the remote computer system. 6. The method of claim 1, wherein the industrial automation component comprises a motor drive system having power circuitry comprising a power inverter configured to provide three-phase electrical power to drive an electric motor, and motor drive control circuitry configured to provide control signals for controlling operation of the power circuitry. 7. The method of claim 1, comprising sending from the industrial automation component in response to a further request from the remote computer system, for display on the browser, a menu listing available executable applications from the industrial automation component. 8. The method of claim 7, wherein the available executable applications include device applications stored on the industrial automation component. 7. The method of claim 7, wherein the available executable applications include network applications stored on the industrial automation component. 8. The method of claim 7, wherein the available executable applications include a circuit diagram stored on the industrial automation component. 9. The method of claim 7, wherein the available executable applications include instructional literature stored on the industrial automation component. 10. The method of claim 7, wherein the available executable applications include operational features of the industrial automation component. 11. An industrial automation method, comprising:
sending a communication, from a remote computer system to an industrial automation component in communication with the remote computer system via a network; receiving in the remote computer system from the industrial automation component, a representation of the industrial automation component and displaying the representation in a browser running on the remote computer system; sending a request, to the industrial automation component from the remote computer system; and in response to the request, receiving on the remote computer system from a server on the industrial automation component an executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via the browser that, without the executable program is incapable of accessing data from the industrial automation component. 12. The method of claim 11, wherein the executable program is represented as a configurable icon that, when selected by a user of the remote computer system, instantiates the executable program. 13. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to operational features of the motor drive system. 14. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to device applications stored on the motor drive system. 15. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to network applications stored on the motor drive system. 16. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to a circuit diagram stored on the motor drive system. 17. The method of claim 11, wherein the executable program, when executed by the remote system, permits access, from the motor drive system, to instructional literature stored on the motor drive system. 18. The method of claim 11, wherein the executable program, when executed by the remote system, permits access to other industrial automation components not otherwise discoverable by the remote computer system. 19. Machine readable and executable code stored in tangible and non-transitory medium, which when executed, causes an industrial automation component to:
process a communication received on the industrial automation component from a remote computer system in communication with the industrial automation component via a network; send, from the industrial automation component to the remote computer system, a representation of the industrial automation component for display on the remote computer system; process a request received on the industrial automation component from the remote computer system; and in response to the request, serve from the industrial automation component, an executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via a browser running on the remote computer system that, without the executable program is incapable of accessing data from the industrial automation component. 20. The code of claim 19, wherein the wherein the representation comprises a configurable icon. | Systems and methods are disclosed for providing an icon for display by a user interface from an automation device that the icon depicts. Specifically, present embodiments are directed to methods and systems capable of detecting, with processing circuitry of an automation device, a shell program on a workstation via an automation control network. Further, embodiments are capable of providing icon configuration data to the shell program from the automation device, wherein the configuration data controls characteristics of an icon representative of the automation device for display in a visualization of the workstation.1. An industrial automation method, comprising:
storing, on an industrial automation component, a user interface comprising an executable program; receiving, on the industrial automation component, a communication from a remote computer system in communication with the industrial automation component via a network; sending, from the industrial automation component to the remote computer system, a representation of the industrial automation component for display on the remote computer system; receiving a request, on the industrial automation component from the remote computer system; and in response to the request, serving from the user interface the executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via a browser running on the remote computer system that, without the executable program is incapable of accessing data from the industrial automation component. 2. The method of claim 1, wherein the representation comprises a configurable icon. 3. The method of claim 2, wherein the request is generated by a user selection of the configurable icon on the remote computer system. 4. The method of claim 1, comprising receiving, on the industrial automation component from the remote computer system, a request for operational data from the industrial automation component, the request originating from execution of the executable program on the remote computer system. 5. The method of claim 1, comprising receiving, on the industrial automation component from the remote computer system, a request for operational data from a different industrial automation component, the request originating from execution of the executable program on the remote computer system. 6. The method of claim 1, wherein the industrial automation component comprises a motor drive system having power circuitry comprising a power inverter configured to provide three-phase electrical power to drive an electric motor, and motor drive control circuitry configured to provide control signals for controlling operation of the power circuitry. 7. The method of claim 1, comprising sending from the industrial automation component in response to a further request from the remote computer system, for display on the browser, a menu listing available executable applications from the industrial automation component. 8. The method of claim 7, wherein the available executable applications include device applications stored on the industrial automation component. 7. The method of claim 7, wherein the available executable applications include network applications stored on the industrial automation component. 8. The method of claim 7, wherein the available executable applications include a circuit diagram stored on the industrial automation component. 9. The method of claim 7, wherein the available executable applications include instructional literature stored on the industrial automation component. 10. The method of claim 7, wherein the available executable applications include operational features of the industrial automation component. 11. An industrial automation method, comprising:
sending a communication, from a remote computer system to an industrial automation component in communication with the remote computer system via a network; receiving in the remote computer system from the industrial automation component, a representation of the industrial automation component and displaying the representation in a browser running on the remote computer system; sending a request, to the industrial automation component from the remote computer system; and in response to the request, receiving on the remote computer system from a server on the industrial automation component an executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via the browser that, without the executable program is incapable of accessing data from the industrial automation component. 12. The method of claim 11, wherein the executable program is represented as a configurable icon that, when selected by a user of the remote computer system, instantiates the executable program. 13. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to operational features of the motor drive system. 14. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to device applications stored on the motor drive system. 15. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to network applications stored on the motor drive system. 16. The method of claim 11, wherein the executable program, when executed by the remote computer system, permits access, from the motor drive system, to a circuit diagram stored on the motor drive system. 17. The method of claim 11, wherein the executable program, when executed by the remote system, permits access, from the motor drive system, to instructional literature stored on the motor drive system. 18. The method of claim 11, wherein the executable program, when executed by the remote system, permits access to other industrial automation components not otherwise discoverable by the remote computer system. 19. Machine readable and executable code stored in tangible and non-transitory medium, which when executed, causes an industrial automation component to:
process a communication received on the industrial automation component from a remote computer system in communication with the industrial automation component via a network; send, from the industrial automation component to the remote computer system, a representation of the industrial automation component for display on the remote computer system; process a request received on the industrial automation component from the remote computer system; and in response to the request, serve from the industrial automation component, an executable program to permit access by the remote computer system to automation data stored on the industrial automation system, wherein the executable program is configured to be executed via a browser running on the remote computer system that, without the executable program is incapable of accessing data from the industrial automation component. 20. The code of claim 19, wherein the wherein the representation comprises a configurable icon. | 2,100 |
5,094 | 14,727,675 | 2,191 | Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing partial analysis of source code files in a code base. One of the methods includes receiving a request for analysis results for a subset of source code files in a project. A set of primary source code files is generated according to the request, wherein the set of primary source code files includes fewer than all source code files in the project. A set of secondary source code files is generated, the set comprising source code files upon which at least one of the primary source code files depends directly or transitively. A partial analysis of the code base is performed using all files included in the set of primary source code files or the set of secondary source code files. Analysis results for the files included in the set of primary source code files is provided in response to the request. | 1. A computer-implemented method comprising:
receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of source code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code files, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any of the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code files; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files and the set of secondary source code files to identify unmatched violations occurring in the augmented set of primary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced by the user in changes made by the user to the one or more source code files in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. 2. The method of claim 1, wherein generating the set of secondary source code files comprises identifying all source code files reachable along a path of at most N steps in the dependency graph from at least one of the source code files in the augmented set of primary source code files. 3. The method of claim 1, wherein a change made by the user to one of the source code files in the initial set of primary source code files introduced a violation in a first source code file in the augmented set of primary source code files, and wherein performing the partial analysis comprises determining that the violation in the first source code file is an unmatched violation that does not occur in the first snapshot of the project. 4. The method of claim 2, further comprising;
obtaining a system setting specifying a value for N representing a maximum number of steps in the dependency graph by which to identify the set of secondary source code files; identifying the set of secondary source code files including identifying all source code files reachable along a path having at most N steps in the dependency grapg from at least one of the files in the augmented set of primary source code files; and adding the identified source code files to the set of secondary source code files. 5. The method of claim 4, further comprising;
identifying a programming language of the project; and obtaining a programming-language-specific setting for the value of N for the identified programming language of the project. 6. The method of claim 5, further comprising:
determining that the programming-language-specific setting is an unlimited number of steps; and in response, adding, to the set of secondary source code files, all files represented by nodes that are reachable in the dependency graph from any nodes representing files in the augmented set of primary source code files. 7. The method of claim 4, further comprising
obtaining an application-specific setting for the value of N based on an application type of request. 8. The method of claim 1, wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path of at most N steps in the dependency graph; and
adding the identified source code files to the augmented set of primary source code files. 9. The method of claim 8, further comprising:
obtaining a system setting specifying a number of steps in a dependency graph of source code files in the project by which to supplement the initial set of primary source code files, wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path having a length that is no more than N steps; and adding the identified source code files to the augmented set of primary source code files. 10. The method of claim 9, further comprising:
identifying a programming language of the project; and obtaining a programming-language-specific setting for a value of N for the identified programming language. 11. The method of claim 9, further comprising:
obtaining an application-specific setting for the value of N based on an application type of the request. 12. The method of claim 1, wherein the first snapshot is most recent revision of the project. 13. The method of claim 1, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files all source code files that have been changed by the user relative to the first snapshot of the project. 14. The method of claim 1, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files one or more source code files currently being presented in an integrated development environment. 15. 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: receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of source code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code file, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any f the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code file; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files an the set of secondary source code files to identify unmatched violations occurring in the augmented set of primary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced by the uder in changes made by the user to the one or more source code files in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. 16. The system of claim 15, Wherein generating the set of secondary source code files comprises identifying all source code files reachable along a path of at most N steps in the dependency graph from at least one of the source code files in the augmented set of primary source code files. 17. The system of claim 15, wherein a change made by the user to one of the source code files in the initial set of primary source code files introduced a violation in a first source code file in the augmented set of primary source code files, and wherein performing the partial analysis comprises determining that the violation in the first source code file is an unmatched violation that does not occur in the first snapshot of the project. 18. The system of claim 16, wherein the operations further comprise:
obtaining a system setting specifying a value for N representing a maximum number of steps in the dependency graph by which to identify the set of secondary source code files; identifying the set of secondary source code files including identifying all source code files reachable along a path having at most N steps in the dependency graph from at least one of the files in the augmented set of primary source code files; and adding the identified source code files to the set of secondary source code files. 19. They system of claim 18, wherein the operations further comprise:
identifying a programming language of the project; and obtaining a programming-language-specific setting for the value of N for the identified programming language of the project. 20. The system of claim 19, wherein the operations further comprise:
determining that the programming-language-specific setting is an unlimited number of steps; and in response, adding, to the set of secondary source code files, all files represented by nodes that are reachable in the dependency graph from any nodes representing files in the augmented set of primary source code files. 21. The system of claim 18, where in the operations further comprise:
Obtaining an application-specific setting for the value of N based on an application type of the request. 22. They system of claim 15, wherein generating the augmented set of primary source code files identifying all source code files from which at least one of the primary source code files are reachable along a path of at most N steps in the dependency graph; and
adding the identified source code files to the augmented set of primary source code files. 23. The system of claim 22, wherein the operations further comprise:
obtaining a system setting specifying a number of steps in a dependency graph of source code files in the project by which to supplement the initial set of primary source code files. wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path having a length that is no more than N steps; and
adding the identified source code files to the augmented set of primary source code files. 24. The system of claim 23, wherein the operations further comprise:
identifying a programming language of the project; and obtaining a programming-language-specific setting for a value of N for the identified programming language. 25. The system of claim 23, wherein the operations further comprise:
obtaining an application-specific setting for the value of N based on an application type of the request. 26. The system of claim 15, wherein the first snapshot is a most recent revision of the project. 27. The system of claim 15, where in generating the initial set of primary source code files comprises adding to the initial set of primary source code files all source code files that have been changed by the user relative to the first snapshot of the project. 28. The system of claim 15, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files one or more source code files currently being presented in an integrated development environment. 29. A computer program product, encoded on one or more computer-readable hardware storage devices, comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:
receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of course code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code file, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any of the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code file; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files and the set of secondary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced bu the user in changes made by the user to the one or more source code filed in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. | Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing partial analysis of source code files in a code base. One of the methods includes receiving a request for analysis results for a subset of source code files in a project. A set of primary source code files is generated according to the request, wherein the set of primary source code files includes fewer than all source code files in the project. A set of secondary source code files is generated, the set comprising source code files upon which at least one of the primary source code files depends directly or transitively. A partial analysis of the code base is performed using all files included in the set of primary source code files or the set of secondary source code files. Analysis results for the files included in the set of primary source code files is provided in response to the request.1. A computer-implemented method comprising:
receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of source code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code files, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any of the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code files; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files and the set of secondary source code files to identify unmatched violations occurring in the augmented set of primary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced by the user in changes made by the user to the one or more source code files in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. 2. The method of claim 1, wherein generating the set of secondary source code files comprises identifying all source code files reachable along a path of at most N steps in the dependency graph from at least one of the source code files in the augmented set of primary source code files. 3. The method of claim 1, wherein a change made by the user to one of the source code files in the initial set of primary source code files introduced a violation in a first source code file in the augmented set of primary source code files, and wherein performing the partial analysis comprises determining that the violation in the first source code file is an unmatched violation that does not occur in the first snapshot of the project. 4. The method of claim 2, further comprising;
obtaining a system setting specifying a value for N representing a maximum number of steps in the dependency graph by which to identify the set of secondary source code files; identifying the set of secondary source code files including identifying all source code files reachable along a path having at most N steps in the dependency grapg from at least one of the files in the augmented set of primary source code files; and adding the identified source code files to the set of secondary source code files. 5. The method of claim 4, further comprising;
identifying a programming language of the project; and obtaining a programming-language-specific setting for the value of N for the identified programming language of the project. 6. The method of claim 5, further comprising:
determining that the programming-language-specific setting is an unlimited number of steps; and in response, adding, to the set of secondary source code files, all files represented by nodes that are reachable in the dependency graph from any nodes representing files in the augmented set of primary source code files. 7. The method of claim 4, further comprising
obtaining an application-specific setting for the value of N based on an application type of request. 8. The method of claim 1, wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path of at most N steps in the dependency graph; and
adding the identified source code files to the augmented set of primary source code files. 9. The method of claim 8, further comprising:
obtaining a system setting specifying a number of steps in a dependency graph of source code files in the project by which to supplement the initial set of primary source code files, wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path having a length that is no more than N steps; and adding the identified source code files to the augmented set of primary source code files. 10. The method of claim 9, further comprising:
identifying a programming language of the project; and obtaining a programming-language-specific setting for a value of N for the identified programming language. 11. The method of claim 9, further comprising:
obtaining an application-specific setting for the value of N based on an application type of the request. 12. The method of claim 1, wherein the first snapshot is most recent revision of the project. 13. The method of claim 1, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files all source code files that have been changed by the user relative to the first snapshot of the project. 14. The method of claim 1, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files one or more source code files currently being presented in an integrated development environment. 15. 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: receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of source code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code file, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any f the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code file; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files an the set of secondary source code files to identify unmatched violations occurring in the augmented set of primary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced by the uder in changes made by the user to the one or more source code files in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. 16. The system of claim 15, Wherein generating the set of secondary source code files comprises identifying all source code files reachable along a path of at most N steps in the dependency graph from at least one of the source code files in the augmented set of primary source code files. 17. The system of claim 15, wherein a change made by the user to one of the source code files in the initial set of primary source code files introduced a violation in a first source code file in the augmented set of primary source code files, and wherein performing the partial analysis comprises determining that the violation in the first source code file is an unmatched violation that does not occur in the first snapshot of the project. 18. The system of claim 16, wherein the operations further comprise:
obtaining a system setting specifying a value for N representing a maximum number of steps in the dependency graph by which to identify the set of secondary source code files; identifying the set of secondary source code files including identifying all source code files reachable along a path having at most N steps in the dependency graph from at least one of the files in the augmented set of primary source code files; and adding the identified source code files to the set of secondary source code files. 19. They system of claim 18, wherein the operations further comprise:
identifying a programming language of the project; and obtaining a programming-language-specific setting for the value of N for the identified programming language of the project. 20. The system of claim 19, wherein the operations further comprise:
determining that the programming-language-specific setting is an unlimited number of steps; and in response, adding, to the set of secondary source code files, all files represented by nodes that are reachable in the dependency graph from any nodes representing files in the augmented set of primary source code files. 21. The system of claim 18, where in the operations further comprise:
Obtaining an application-specific setting for the value of N based on an application type of the request. 22. They system of claim 15, wherein generating the augmented set of primary source code files identifying all source code files from which at least one of the primary source code files are reachable along a path of at most N steps in the dependency graph; and
adding the identified source code files to the augmented set of primary source code files. 23. The system of claim 22, wherein the operations further comprise:
obtaining a system setting specifying a number of steps in a dependency graph of source code files in the project by which to supplement the initial set of primary source code files. wherein generating the augmented set of primary source code files comprises identifying all source code files from which at least one of the primary source code files are reachable along a path having a length that is no more than N steps; and
adding the identified source code files to the augmented set of primary source code files. 24. The system of claim 23, wherein the operations further comprise:
identifying a programming language of the project; and obtaining a programming-language-specific setting for a value of N for the identified programming language. 25. The system of claim 23, wherein the operations further comprise:
obtaining an application-specific setting for the value of N based on an application type of the request. 26. The system of claim 15, wherein the first snapshot is a most recent revision of the project. 27. The system of claim 15, where in generating the initial set of primary source code files comprises adding to the initial set of primary source code files all source code files that have been changed by the user relative to the first snapshot of the project. 28. The system of claim 15, wherein generating the initial set of primary source code files comprises adding to the initial set of primary source code files one or more source code files currently being presented in an integrated development environment. 29. A computer program product, encoded on one or more computer-readable hardware storage devices, comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:
receiving, from a user, a request for partial analysis results to identify source code violations introduced by the user in changes made by the user to one or more source code files in a first snapshot of a project; generating an initial set of primary source code files comprising only one or more source code files changed by the user relative to source code files in the first snapshot of the project; obtaining data representing a dependency graph of course code files in the project, wherein the dependency graph has a directed link from a first node representing a first source code file to a second node representing a second source code file whenever the first source code file imports the second source code file or uses one or more definitions in the second source code file; generating an augmented set of primary source code file, including adding, to the initial set of primary source code files, one or more additional source code files represented by nodes in the dependency graph having a link to any node representing any of the files in the initial set of primary source code files; generating a set of secondary source code files including identifying source code files represented by nodes to which a link in the dependency graph exists from any node representing any of the files in the augmented set of primary source code file; performing a partial analysis of the project using one or more files included in the augmented set of primary source code files and the set of secondary source code files but not occurring in the first snapshot, the unmatched violations being violations introduced bu the user in changes made by the user to the one or more source code filed in the initial set of primary source code files; and providing partial analysis results for the files included in the augmented set of primary source code files, wherein the partial analysis results identify locations of the violations introduced by the user in the one or more source code files. | 2,100 |
5,095 | 13,864,929 | 2,122 | The current application is directed to intelligent controllers that use sensor output and electronically stored information to determine whether or not one or more types of entities are present within an area, volume, or environment monitored by the intelligent controllers. The intelligent controllers select operational modes and/or modify control schedules with respect to the presence and absence of the one or more entities. The intelligent controllers selectively carry out scheduled control operations during periods of time when one or more types of entities are determined not to be in a controlled environment. | 1. An intelligent controller comprising:
a processor; one or more sensors; a memory that stores a control schedule and cumulative probability-of-presence data; and instructions stored within the memory that, when executed by the processor, controls the intelligent controller to
determine, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment, and
while no human being is determined to be present in the controlled environment, modify the control schedule to maintain one or more environmental parameters at energy-efficient levels while selectively carrying out control operations corresponding to scheduled setpoints. 2. The intelligent controller of claim 1 wherein the intelligent controller selectively carries out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment by:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation. 3. The intelligent controller of claim 2 wherein evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data further comprises determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation. 4. The intelligent controller of claim 3 wherein determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation further comprises:
selecting a first time of day t1 prior to the time of day of the setpoint corresponding to the control operation, t;
selecting a second time of day t2 following the time of day of the setpoint corresponding to the control operation, t; and
when either the cumulative probability of presence at time of day t2 is greater than the cumulative probability of presence at time of day t or the cumulative probability of presence at time of day t is greater than the cumulative probability of presence at time of day t1, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is increasing and, otherwise, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is not increasing. 5. The intelligent controller of claim 1 wherein the intelligent determines, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment at times within a range of times of day within which a determination of whether or not a human being is present can be reliably made. 6. The intelligent controller of claim 5 wherein the range of times of day within which a determination of whether or not a human being is present can be reliably made is determined from cumulative sensor data. 7. The intelligent controller of claim 5 wherein the range of times of day within which a determination of whether or not a human being is present can be reliably made is 8:00 AM until 8:00 PM. 8. The intelligent controller of claim 1 wherein the intelligent controller selectively carries out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment by:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation; and
when the evaluation of the corresponding setpoint indicates that the control operation is to be carried out, returning to maintenance of the one or more environmental parameters at energy-efficient levels. 9. The intelligent controller of claim 8 wherein the variable threshold amount of time varies from a maximum variable threshold amount of time, immediately following a determination that no human being is present in the controlled environment, to 0, after an amount of time has elapsed that indicates a long-term absence of human beings in the controlled environment. 10. The intelligent controller of claim 9 wherein maximum variable threshold amount of time is 2 hours and the amount of elapsed time that indicates a long-term absence of human beings in the controlled environment is 2 days, with the variable threshold amount of time decreasing linearly over the period of 2 days. 11. The intelligent controller of claim 1 wherein control operations corresponding to scheduled setpoints include:
changing one or more environmental parameter settings at a time corresponding to a scheduled setpoint; and
changing one or more environmental parameter settings at a time prior to a time corresponding to a scheduled setpoint in order to carry out preconditioning. 12. The intelligent controller of claim 1 wherein the intelligent controller is a thermostat. 13. The intelligent controller of claim 12 wherein the one or more environmental parameters is temperature. 14. The intelligent controller of claim 13 wherein the thermostat is in a heating mode and wherein the thermostat modifies the control schedule to maintain one or more environmental parameters at energy-efficient levels by setting a temperature setting to a specified away temperature below 70 degrees Fahrenheit and above 32 degrees Fahrenheit. 15. The intelligent controller of claim 13 wherein the thermostat is in a cooling mode and wherein the thermostat modifies the control schedule to maintain one or more environmental parameters at energy-efficient levels by setting a temperature setting to a specified away temperature above 65 degrees Fahrenheit and below 90 degrees Fahrenheit. 16. A method for controlling an environment by an intelligent controller that includes a processor, one or more sensors, a memory that stores a control schedule and cumulative probability-of-presence data, and instructions stored within the memory that, when executed by the processor, control the intelligent controller, the method comprising:
determining, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment, and while no human being is determined to be present in the controlled environment, modifying the control schedule to maintain one or more environmental parameters at energy-efficient levels while selectively carrying out control operations corresponding to scheduled setpoints. 17. The method of claim 16 wherein selectively carrying out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment further comprises:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation. 18. The method of claim 17 wherein evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data further comprises determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation. 19. The method of claim 18 wherein determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation further comprises:
selecting a first time of day t1 prior to the time of day of the setpoint corresponding to the control operation, t;
selecting a second time of day t2 following the time of day of the setpoint corresponding to the control operation, t; and
when either the cumulative probability of presence at time of day t2 is greater than the cumulative probability of presence at time of day t or the cumulative probability of presence at time of day t is greater than the cumulative probability of presence at time of day t1, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is increasing and, otherwise, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is not increasing. | The current application is directed to intelligent controllers that use sensor output and electronically stored information to determine whether or not one or more types of entities are present within an area, volume, or environment monitored by the intelligent controllers. The intelligent controllers select operational modes and/or modify control schedules with respect to the presence and absence of the one or more entities. The intelligent controllers selectively carry out scheduled control operations during periods of time when one or more types of entities are determined not to be in a controlled environment.1. An intelligent controller comprising:
a processor; one or more sensors; a memory that stores a control schedule and cumulative probability-of-presence data; and instructions stored within the memory that, when executed by the processor, controls the intelligent controller to
determine, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment, and
while no human being is determined to be present in the controlled environment, modify the control schedule to maintain one or more environmental parameters at energy-efficient levels while selectively carrying out control operations corresponding to scheduled setpoints. 2. The intelligent controller of claim 1 wherein the intelligent controller selectively carries out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment by:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation. 3. The intelligent controller of claim 2 wherein evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data further comprises determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation. 4. The intelligent controller of claim 3 wherein determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation further comprises:
selecting a first time of day t1 prior to the time of day of the setpoint corresponding to the control operation, t;
selecting a second time of day t2 following the time of day of the setpoint corresponding to the control operation, t; and
when either the cumulative probability of presence at time of day t2 is greater than the cumulative probability of presence at time of day t or the cumulative probability of presence at time of day t is greater than the cumulative probability of presence at time of day t1, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is increasing and, otherwise, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is not increasing. 5. The intelligent controller of claim 1 wherein the intelligent determines, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment at times within a range of times of day within which a determination of whether or not a human being is present can be reliably made. 6. The intelligent controller of claim 5 wherein the range of times of day within which a determination of whether or not a human being is present can be reliably made is determined from cumulative sensor data. 7. The intelligent controller of claim 5 wherein the range of times of day within which a determination of whether or not a human being is present can be reliably made is 8:00 AM until 8:00 PM. 8. The intelligent controller of claim 1 wherein the intelligent controller selectively carries out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment by:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation; and
when the evaluation of the corresponding setpoint indicates that the control operation is to be carried out, returning to maintenance of the one or more environmental parameters at energy-efficient levels. 9. The intelligent controller of claim 8 wherein the variable threshold amount of time varies from a maximum variable threshold amount of time, immediately following a determination that no human being is present in the controlled environment, to 0, after an amount of time has elapsed that indicates a long-term absence of human beings in the controlled environment. 10. The intelligent controller of claim 9 wherein maximum variable threshold amount of time is 2 hours and the amount of elapsed time that indicates a long-term absence of human beings in the controlled environment is 2 days, with the variable threshold amount of time decreasing linearly over the period of 2 days. 11. The intelligent controller of claim 1 wherein control operations corresponding to scheduled setpoints include:
changing one or more environmental parameter settings at a time corresponding to a scheduled setpoint; and
changing one or more environmental parameter settings at a time prior to a time corresponding to a scheduled setpoint in order to carry out preconditioning. 12. The intelligent controller of claim 1 wherein the intelligent controller is a thermostat. 13. The intelligent controller of claim 12 wherein the one or more environmental parameters is temperature. 14. The intelligent controller of claim 13 wherein the thermostat is in a heating mode and wherein the thermostat modifies the control schedule to maintain one or more environmental parameters at energy-efficient levels by setting a temperature setting to a specified away temperature below 70 degrees Fahrenheit and above 32 degrees Fahrenheit. 15. The intelligent controller of claim 13 wherein the thermostat is in a cooling mode and wherein the thermostat modifies the control schedule to maintain one or more environmental parameters at energy-efficient levels by setting a temperature setting to a specified away temperature above 65 degrees Fahrenheit and below 90 degrees Fahrenheit. 16. A method for controlling an environment by an intelligent controller that includes a processor, one or more sensors, a memory that stores a control schedule and cumulative probability-of-presence data, and instructions stored within the memory that, when executed by the processor, control the intelligent controller, the method comprising:
determining, from output of one or more of the one or more sensors, whether or not a human being is present in the controlled environment, and while no human being is determined to be present in the controlled environment, modifying the control schedule to maintain one or more environmental parameters at energy-efficient levels while selectively carrying out control operations corresponding to scheduled setpoints. 17. The method of claim 16 wherein selectively carrying out control operations corresponding to scheduled setpoints while no human being is determined to be present in the controlled environment further comprises:
for each control operation corresponding to a scheduled setpoint,
evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data to determine whether or not to carry out the control operation. 18. The method of claim 17 wherein evaluating the corresponding setpoint with respect to the cumulative probability-of-presence data further comprises determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation. 19. The method of claim 18 wherein determining whether or not the cumulative probability-of-presence data indicates an increase in the probability of presence at the time of day of the setpoint corresponding to the control operation further comprises:
selecting a first time of day t1 prior to the time of day of the setpoint corresponding to the control operation, t;
selecting a second time of day t2 following the time of day of the setpoint corresponding to the control operation, t; and
when either the cumulative probability of presence at time of day t2 is greater than the cumulative probability of presence at time of day t or the cumulative probability of presence at time of day t is greater than the cumulative probability of presence at time of day t1, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is increasing and, otherwise, determining that the probability of presence at the time of day of the setpoint corresponding to the control operation is not increasing. | 2,100 |
5,096 | 13,603,926 | 2,161 | An apparatus and method of searching and organizing intellectual property (IP) formulates and facilitates searches for intellectual property and organizes results of such searches. In an exemplary embodiment, a search and organization server is provided with one or more modules to create and process search queries to be run on local or remote database systems. A class search can provide on-line access to classification information and facilitate searching of intellectual property using classifications. An IP thesaurus can provide for developing a list of elements found in IP information. The list of elements may be used as an aid in learning a new technology, as a search tool to refine search queries or criteria. A field-of-search can be based on search information identified from select IP information. Optional modules can formulate, store, organize, and output search results. | 1-30. (canceled) 31. A method for formulating an intellectual property search, comprising:
inputting, in a computer processor device, as a search field, an identification of at least one classification in a classification system; retrieving, in the computer processor device, select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and returning the select intellectual property documents as source grouping search results; providing, in the computer processor device, intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and providing, in the computer processor device, the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 32. The method of claim 31, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 33. The method of claim 31, further comprising providing, in the computer processor device, a word frequency list of the significant search elements, receiving an input selecting a portion of the significant search elements, and storing the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 34. The method of claim 32, further comprising providing, in the computer processor device, an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 35. The method of claim 31, wherein the computer processor device stores, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 36. The method of claim 31, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 37. The method of claim 31, further comprising receiving, in the computer processor device, an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 38. The method of claim 31, further comprising receiving, in the computer processor device, a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. 39. A system, implemented on at least one computer, for formulating an intellectual property search, comprising:
an interface; and a processor cooperatively operable with the interface, the processor being configured to
input, as a search field, an identification of at least one classification in a classification system;
retrieve select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and return the select intellectual property documents as source grouping search results;
provide intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and
provide the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 40. The system of claim 39, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 41. The system of claim 39, wherein the processor is further configured to provide a word frequency list of the significant search elements, receive an input selecting a portion of the significant search elements, and store the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 42. The system of claim 40, wherein the processor is further configured to provide an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 43. The system of claim 39, wherein the processor is further configured to store, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 44. The system of claim 39, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 45. The system of claim 39, wherein the processor is further configured to receive an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 46. The system of claim 39, wherein the processor is further configured to receive a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. 47. A computer program stored on a non-transitory computer-readable medium with a method for formulating an intellectual property search, the program comprising computer-executable steps for:
inputting, as a search field, an identification of at least one classification in a classification system; retrieving select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and returning the select intellectual property documents as source grouping search results; providing intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and providing the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 48. The computer program of claim 47, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 49. The computer program of claim 47, further comprising providing, in the computer processor device, a word frequency list of the significant search elements, receiving an input selecting a portion of the significant search elements, and storing the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 50. The computer program of claim 48, further comprising providing, in the computer processor device, an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 51. The computer program of claim 47, wherein the computer processor device stores, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 52. The computer program of claim 47, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 53. The computer program of claim 47, further comprising receiving, in the computer processor device, an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 54. The computer program of claim 47, further comprising receiving, in the computer processor device, a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. | An apparatus and method of searching and organizing intellectual property (IP) formulates and facilitates searches for intellectual property and organizes results of such searches. In an exemplary embodiment, a search and organization server is provided with one or more modules to create and process search queries to be run on local or remote database systems. A class search can provide on-line access to classification information and facilitate searching of intellectual property using classifications. An IP thesaurus can provide for developing a list of elements found in IP information. The list of elements may be used as an aid in learning a new technology, as a search tool to refine search queries or criteria. A field-of-search can be based on search information identified from select IP information. Optional modules can formulate, store, organize, and output search results.1-30. (canceled) 31. A method for formulating an intellectual property search, comprising:
inputting, in a computer processor device, as a search field, an identification of at least one classification in a classification system; retrieving, in the computer processor device, select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and returning the select intellectual property documents as source grouping search results; providing, in the computer processor device, intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and providing, in the computer processor device, the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 32. The method of claim 31, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 33. The method of claim 31, further comprising providing, in the computer processor device, a word frequency list of the significant search elements, receiving an input selecting a portion of the significant search elements, and storing the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 34. The method of claim 32, further comprising providing, in the computer processor device, an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 35. The method of claim 31, wherein the computer processor device stores, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 36. The method of claim 31, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 37. The method of claim 31, further comprising receiving, in the computer processor device, an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 38. The method of claim 31, further comprising receiving, in the computer processor device, a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. 39. A system, implemented on at least one computer, for formulating an intellectual property search, comprising:
an interface; and a processor cooperatively operable with the interface, the processor being configured to
input, as a search field, an identification of at least one classification in a classification system;
retrieve select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and return the select intellectual property documents as source grouping search results;
provide intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and
provide the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 40. The system of claim 39, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 41. The system of claim 39, wherein the processor is further configured to provide a word frequency list of the significant search elements, receive an input selecting a portion of the significant search elements, and store the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 42. The system of claim 40, wherein the processor is further configured to provide an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 43. The system of claim 39, wherein the processor is further configured to store, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 44. The system of claim 39, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 45. The system of claim 39, wherein the processor is further configured to receive an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 46. The system of claim 39, wherein the processor is further configured to receive a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. 47. A computer program stored on a non-transitory computer-readable medium with a method for formulating an intellectual property search, the program comprising computer-executable steps for:
inputting, as a search field, an identification of at least one classification in a classification system; retrieving select intellectual property documents that have the classification, that was input as the search field, indicated as content of a classification field, and returning the select intellectual property documents as source grouping search results; providing intellectual property documents which were returned as the source grouping search results, to a thesaurus module to generate a list of elements which are significant search elements found in the source grouping search results; and providing the list of elements which are the significant search elements as a field-of-search corresponding to the at least one classification which was input, for further use as terminology. 48. The computer program of claim 47, wherein the at least one classification is an enumerated class in the classification system, and the classification system is determined by a government patent or trademark office. 49. The computer program of claim 47, further comprising providing, in the computer processor device, a word frequency list of the significant search elements, receiving an input selecting a portion of the significant search elements, and storing the selected portion of the significant search elements as an accrued synonym list associated with the at least one classification. 50. The computer program of claim 48, further comprising providing, in the computer processor device, an analysis of the list of elements in the source grouping search results, the analysis includes frequency of occurrence of elements in the select intellectual property documents in the source grouping search results, wherein the elements are at least one of: a word, a phrase, a concept, a number, a picture, a feature, a representation, a graphic, and an identifier. 51. The computer program of claim 47, wherein the computer processor device stores, as the thesaurus module, the significant search elements found in the source grouping search results in an electronic thesaurus associated with the at least one classification, as part of an electronic thesaurus library that stores plural thesauruses, each thesaurus in the electronic thesaurus library having terminology devoted to a technical area. 52. The computer program of claim 47, wherein the at least one classification in a classification system that is received as input, to the computer processor device, as the search field is at least one of a classification number, a classification index, a classification heading, a sub-classification, a classification definition and a classification title, in a classification system maintained by a government patent or trademark office. 53. The computer program of claim 47, further comprising receiving, in the computer processor device, an input of at least one of the elements in the list of elements into a search tool to refine search queries or criteria. 54. The computer program of claim 47, further comprising receiving, in the computer processor device, a selection of one of the elements in the list of elements for use in drafting to assist in the preparation of technical or legal documents. | 2,100 |
5,097 | 12,984,944 | 2,141 | First, a plurality of selection objects having at least one part thereof displayed on a display area of a display device are moved relative to the display area, based on an output signal outputted from an input device. Then, when an end-located selection object among the moved plurality of selection objects reaches a predetermined position of the display area, an object that is different from the plurality of selection objects is displayed on the display area. The object moves relative to the display area based on an output signal outputted from the input device. | 1. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control means, an end-located selection object reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. 2. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the computer is further caused to operate as object erasing means for erasing, from the display area, the object displayed by the display control means, when the input device stops outputting an output signal. 3. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the second movement control means moves the object after the first movement control means stops moving the selection objects. 4. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the second movement control means moves the object in a moving direction determined based on an output signal outputted from the input device. 5. The computer-readable storage medium having stored thereon the display control program according to claim 4, wherein the computer is further caused to operate as object erasing means for erasing the object from the display area by moving the object in a direction opposite to the moving direction, when the input device stops outputting an output signal. 6. The computer-readable storage medium having stored thereon the display control program according to claim 5, wherein
the second movement control means displays the object so as to emerge from an end of the display area from a direction opposite of the moving direction determined based on an output signal outputted from the input device, and the object erasing means erases the object by moving the object toward the end of the display area. 7. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means displays the object in a manner such that the object is superimposed on front surfaces of the selection objects. 8. The computer-readable storage medium having stored thereon the display control program according to claim 7, wherein the display control means displays a semi-transparent object as the object in a manner such that the semi-transparent object is superimposed on front surfaces of the selection objects. 9. The computer-readable storage medium having stored thereon the display control program according to claim 8, wherein the display control means changes the transparency of the object in accordance with a movement of the object. 10. The computer-readable storage medium having stored thereon the display control program according to claim 9, wherein the display control means changes the transparency of the object such that the transparency becomes lower as a movement distance of the object becomes larger. 11. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means changes a shape of the object in accordance with a movement of the object. 12. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means changes a size of the object in accordance with a movement of the object. 13. A display control system which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control system comprising:
a first movement control section for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; a display control section for displaying, on display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control section, an end-located selection object reaches a predetermined position of the display area; and a second movement control section for moving, relative to the display area, the object displayed by the display control section, based on an output signal outputted from the input device. 14. A display control apparatus which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control apparatus comprising:
a first movement control section for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; a display control section for displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control section, an end-located selection object reaches a predetermined position of the display area; and a second movement control section for moving, relative to the display area, the object display by the display control section, based on an output signal outputted from the input device. 15. A display control method for displaying, on a display device, a selection object selected in accordance with an operation by a user, the display control method comprising:
a first movement control step of moving a plurality of selection objects having at least one part thereof displayed on a display area of the display device, based on an output signal outputted from an input device; a display control step of displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved at the first movement control step, an end-located selection object reaches a predetermined position of the display area; and a second movement control step of moving, relative to the display area, the object displayed by the display control step, based on an output signal outputted from the input device. 16. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a content to be browsed by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a content having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the content, when an end of the content, which is moved by the first movement control means, reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. 17. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a content to be browsed by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a plurality of contents having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the plurality of contents displayed on the display area, when, among the plurality of contents moved by the first movement control means, an end-located content reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. | First, a plurality of selection objects having at least one part thereof displayed on a display area of a display device are moved relative to the display area, based on an output signal outputted from an input device. Then, when an end-located selection object among the moved plurality of selection objects reaches a predetermined position of the display area, an object that is different from the plurality of selection objects is displayed on the display area. The object moves relative to the display area based on an output signal outputted from the input device.1. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control means, an end-located selection object reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. 2. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the computer is further caused to operate as object erasing means for erasing, from the display area, the object displayed by the display control means, when the input device stops outputting an output signal. 3. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the second movement control means moves the object after the first movement control means stops moving the selection objects. 4. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the second movement control means moves the object in a moving direction determined based on an output signal outputted from the input device. 5. The computer-readable storage medium having stored thereon the display control program according to claim 4, wherein the computer is further caused to operate as object erasing means for erasing the object from the display area by moving the object in a direction opposite to the moving direction, when the input device stops outputting an output signal. 6. The computer-readable storage medium having stored thereon the display control program according to claim 5, wherein
the second movement control means displays the object so as to emerge from an end of the display area from a direction opposite of the moving direction determined based on an output signal outputted from the input device, and the object erasing means erases the object by moving the object toward the end of the display area. 7. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means displays the object in a manner such that the object is superimposed on front surfaces of the selection objects. 8. The computer-readable storage medium having stored thereon the display control program according to claim 7, wherein the display control means displays a semi-transparent object as the object in a manner such that the semi-transparent object is superimposed on front surfaces of the selection objects. 9. The computer-readable storage medium having stored thereon the display control program according to claim 8, wherein the display control means changes the transparency of the object in accordance with a movement of the object. 10. The computer-readable storage medium having stored thereon the display control program according to claim 9, wherein the display control means changes the transparency of the object such that the transparency becomes lower as a movement distance of the object becomes larger. 11. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means changes a shape of the object in accordance with a movement of the object. 12. The computer-readable storage medium having stored thereon the display control program according to claim 1, wherein the display control means changes a size of the object in accordance with a movement of the object. 13. A display control system which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control system comprising:
a first movement control section for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; a display control section for displaying, on display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control section, an end-located selection object reaches a predetermined position of the display area; and a second movement control section for moving, relative to the display area, the object displayed by the display control section, based on an output signal outputted from the input device. 14. A display control apparatus which displays, on a display device, a selection object selected in accordance with an operation by a user, the display control apparatus comprising:
a first movement control section for moving, relative to a display area of the display device, a plurality of selection objects having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; a display control section for displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved by the first movement control section, an end-located selection object reaches a predetermined position of the display area; and a second movement control section for moving, relative to the display area, the object display by the display control section, based on an output signal outputted from the input device. 15. A display control method for displaying, on a display device, a selection object selected in accordance with an operation by a user, the display control method comprising:
a first movement control step of moving a plurality of selection objects having at least one part thereof displayed on a display area of the display device, based on an output signal outputted from an input device; a display control step of displaying, on the display area, an object that is different from the selection objects, when, among the plurality of selection objects moved at the first movement control step, an end-located selection object reaches a predetermined position of the display area; and a second movement control step of moving, relative to the display area, the object displayed by the display control step, based on an output signal outputted from the input device. 16. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a content to be browsed by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a content having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the content, when an end of the content, which is moved by the first movement control means, reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. 17. A computer-readable storage medium having stored thereon a display control program executed by a computer of a display control apparatus which displays, on a display device, a content to be browsed by a user, the display control program causing the computer to operate as:
first movement control means for moving, relative to a display area of the display device, a plurality of contents having at least one part thereof displayed on the display area, based on an output signal outputted from an input device; display control means for displaying, on the display area, an object that is different from the plurality of contents displayed on the display area, when, among the plurality of contents moved by the first movement control means, an end-located content reaches a predetermined position of the display area; and second movement control means for moving, relative to the display area, the object displayed by the display control means, based on an output signal outputted from the input device. | 2,100 |
5,098 | 14,068,454 | 2,137 | A method for data processing is disclosed. A blank state is determined for several data bits based on a majority decision. Each data bit is represented by a group of at least two memory cells. The at least two memory cells of this group are complementary cells of a differential read memory. | 1. A method for data processing comprising:
determining a blank state for several data bits based on a majority decision. 2. The method according to claim 1, wherein each data bit of the several data bits is represented by a group of at least two memory cells, wherein the at least two memory cells of this group are complementary cells of a differential read memory. 3. The method according to claim 1, wherein the memory cells are of a non-volatile memory. 4. The method according to claim 2, wherein the differential read memory comprises at least one of the following:
floating gate cells; PCRAM, RRAM, MRAM, MONOS devices, nanocrystal cells, and ROM. 5. The method according to claim 1, further comprising:
setting a blank indicator in case the blank state for several data bits is determined; re-setting the blank indicator in case the blank state for several data bits is not determined. 6. The method according to claim 1, further comprising:
determining the blank state based on a status of an error correction code. 7. The method according to claim 1, further comprising:
determining the blank state based on an error correction status of fully erased data bits. 8. The method according to claim 1, further comprising:
determining one or more potentially blank data bits in case the current of its memory cells reaches or exceeds a predetermined current threshold; determining a ratio of the potentially blank data bits over total data bits of the memory cells; determining a blank state for the total data bits in case the ratio fulfills a predefined criterion. 9. The method according to claim 8, further comprising:
determining another potentially blank data bit in case the current of all of the memory cells reaches or exceeds the predetermined current threshold. 10. The method according to claim 8, wherein the ratio fulfills the predefined criterion in case the ratio reaches or exceeds a predefined threshold. 11. The method according to claim 8, further comprising:
determining the potentially blank data bits during or after a read operation of the data bits. 12. The method according to claim 1, further comprising:
applying a predetermined offset to either a cell sense amplifier or to a complementary sense amplifier; determining a number of flipped data bits; determining the blank state for the data bits in case the number of flipped data bits fulfills a predefined criterion. 13. The method according to claim 12, further comprising:
determining the blank state for the data bits in case the number and/or a ratio of flipped data bits reaches or exceeds a predefined threshold. 14. The method according to claim 12, further comprising:
determining the number of flipped data bits via an exclusive-or function. 15. The method according to claim 1, further comprising:
invalidating at least one data bit by overwriting at least one memory cell of at least one data bit. 16. An apparatus for data processing comprising:
a processing unit arranged to determine a blank state for several data bits based on a majority decision. 17. The apparatus according to claim 16, wherein each data bit of the several is represented by a group of at least two memory cells, wherein the at least two memory cells of are complementary cells of a differential read memory. 18. The apparatus according to claim 16, wherein the memory cells are of a non-volatile memory. 19. The apparatus according to claim 16, wherein the differential read memory comprises at least one of the following:
floating gate cells; PCRAM, RRAM, MRAM, MONOS devices, nanocrystal cells, and ROM. 20. The apparatus according to claim 16, wherein the processing unit is arranged to
determine a potentially blank data bit in case the current of its memory cells reaches or exceeds a predetermined current threshold; determine a ratio of the potentially blank data bits over the total data bits; and determine a blank state for the data bits in case the ratio fulfills a predefined criterion. 21. The apparatus according to claim 16, wherein the processing unit is arranged to
apply a predetermined offset to either a cell sense amplifier or to a complementary sense amplifier; determine a number of flipped data bits; and determine a blank state for the data bits in case the number of flipped data bits fulfills a predefined criterion. 22. The apparatus according to claim 16, wherein the processing unit is arranged to
invalidate at least one data bit by overwriting at least one memory cell of at least one data bit. 23. A device for data processing, including determining a blank state of data bits, the device comprising:
a means for determining a blank state for several data bits based on a majority decision. 24. The device of claim 23, wherein each data bit is represented by a group of at least two memory cells, wherein the at least two memory cells of this group are complementary cells of a differential read memory. | A method for data processing is disclosed. A blank state is determined for several data bits based on a majority decision. Each data bit is represented by a group of at least two memory cells. The at least two memory cells of this group are complementary cells of a differential read memory.1. A method for data processing comprising:
determining a blank state for several data bits based on a majority decision. 2. The method according to claim 1, wherein each data bit of the several data bits is represented by a group of at least two memory cells, wherein the at least two memory cells of this group are complementary cells of a differential read memory. 3. The method according to claim 1, wherein the memory cells are of a non-volatile memory. 4. The method according to claim 2, wherein the differential read memory comprises at least one of the following:
floating gate cells; PCRAM, RRAM, MRAM, MONOS devices, nanocrystal cells, and ROM. 5. The method according to claim 1, further comprising:
setting a blank indicator in case the blank state for several data bits is determined; re-setting the blank indicator in case the blank state for several data bits is not determined. 6. The method according to claim 1, further comprising:
determining the blank state based on a status of an error correction code. 7. The method according to claim 1, further comprising:
determining the blank state based on an error correction status of fully erased data bits. 8. The method according to claim 1, further comprising:
determining one or more potentially blank data bits in case the current of its memory cells reaches or exceeds a predetermined current threshold; determining a ratio of the potentially blank data bits over total data bits of the memory cells; determining a blank state for the total data bits in case the ratio fulfills a predefined criterion. 9. The method according to claim 8, further comprising:
determining another potentially blank data bit in case the current of all of the memory cells reaches or exceeds the predetermined current threshold. 10. The method according to claim 8, wherein the ratio fulfills the predefined criterion in case the ratio reaches or exceeds a predefined threshold. 11. The method according to claim 8, further comprising:
determining the potentially blank data bits during or after a read operation of the data bits. 12. The method according to claim 1, further comprising:
applying a predetermined offset to either a cell sense amplifier or to a complementary sense amplifier; determining a number of flipped data bits; determining the blank state for the data bits in case the number of flipped data bits fulfills a predefined criterion. 13. The method according to claim 12, further comprising:
determining the blank state for the data bits in case the number and/or a ratio of flipped data bits reaches or exceeds a predefined threshold. 14. The method according to claim 12, further comprising:
determining the number of flipped data bits via an exclusive-or function. 15. The method according to claim 1, further comprising:
invalidating at least one data bit by overwriting at least one memory cell of at least one data bit. 16. An apparatus for data processing comprising:
a processing unit arranged to determine a blank state for several data bits based on a majority decision. 17. The apparatus according to claim 16, wherein each data bit of the several is represented by a group of at least two memory cells, wherein the at least two memory cells of are complementary cells of a differential read memory. 18. The apparatus according to claim 16, wherein the memory cells are of a non-volatile memory. 19. The apparatus according to claim 16, wherein the differential read memory comprises at least one of the following:
floating gate cells; PCRAM, RRAM, MRAM, MONOS devices, nanocrystal cells, and ROM. 20. The apparatus according to claim 16, wherein the processing unit is arranged to
determine a potentially blank data bit in case the current of its memory cells reaches or exceeds a predetermined current threshold; determine a ratio of the potentially blank data bits over the total data bits; and determine a blank state for the data bits in case the ratio fulfills a predefined criterion. 21. The apparatus according to claim 16, wherein the processing unit is arranged to
apply a predetermined offset to either a cell sense amplifier or to a complementary sense amplifier; determine a number of flipped data bits; and determine a blank state for the data bits in case the number of flipped data bits fulfills a predefined criterion. 22. The apparatus according to claim 16, wherein the processing unit is arranged to
invalidate at least one data bit by overwriting at least one memory cell of at least one data bit. 23. A device for data processing, including determining a blank state of data bits, the device comprising:
a means for determining a blank state for several data bits based on a majority decision. 24. The device of claim 23, wherein each data bit is represented by a group of at least two memory cells, wherein the at least two memory cells of this group are complementary cells of a differential read memory. | 2,100 |
5,099 | 14,965,708 | 2,182 | A method and apparatus is provided for implementing combinatorial hypermaps (CHYMAPS) and/or generalized combinatorial maps (G-Maps) based data representations and operations, comprising: mapping term-algebras to tree-based numbers using a fast algorithm and representing a graph of the mapping structure as a CHYMAPS using reversible numeric encoding and decoding; generating a representation of CHYMAPS in a form optimized for sub-map (sub-graph) to map (graph) isomorphism and partial matching with a general matching process; performing operations on the CHYMAPS as operations on respective numerical representations; performing compression and decompression using a three bit self-delimiting binary code; and storing and retrieving codes. | 1. A method of implementing combinatorial hypermaps (CHYMAPS) based data representations and operations, comprising:
mapping term-algebras to tree-based numbers using a fast algorithm and representing a graph of the mapping structure as a CHYMAPS using reversible numeric encoding and decoding; generating a representation of CHYMAPS in a form optimized for sub-map (sub-graph) to map (graph) isomorphism and partial matching with a general matching process; performing operations on the CHYMAPS as operations on respective numerical representations; performing compression and decompression using a three bit self-delimiting binary code; and storing and retrieving codes. | A method and apparatus is provided for implementing combinatorial hypermaps (CHYMAPS) and/or generalized combinatorial maps (G-Maps) based data representations and operations, comprising: mapping term-algebras to tree-based numbers using a fast algorithm and representing a graph of the mapping structure as a CHYMAPS using reversible numeric encoding and decoding; generating a representation of CHYMAPS in a form optimized for sub-map (sub-graph) to map (graph) isomorphism and partial matching with a general matching process; performing operations on the CHYMAPS as operations on respective numerical representations; performing compression and decompression using a three bit self-delimiting binary code; and storing and retrieving codes.1. A method of implementing combinatorial hypermaps (CHYMAPS) based data representations and operations, comprising:
mapping term-algebras to tree-based numbers using a fast algorithm and representing a graph of the mapping structure as a CHYMAPS using reversible numeric encoding and decoding; generating a representation of CHYMAPS in a form optimized for sub-map (sub-graph) to map (graph) isomorphism and partial matching with a general matching process; performing operations on the CHYMAPS as operations on respective numerical representations; performing compression and decompression using a three bit self-delimiting binary code; and storing and retrieving codes. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.